#List values can be either list refs or CSV strings. For users, if the single
#string 'ALL' is given (not part of a list), then all users will be listed.
#
#If nopartinfo flag is set, the sshare com
> 0,
}
=item *
C<DEFAULT> - the default configuration.
Sample Password:
~~12:settle:SUCCEED:summer:48~~
Preset Definition:
{
symbol_alphabet => [qw{! @ $ % ^ & * - _ + =
Test scripts modifed, external modules eleminated.
# compareOrder() modified, it's using ~~ smart-match operator.
# Documentation updated.
# 2012-06-25 v1.0.0 H. Klausing
# Ini
avoid Argument "?undef?" isn't numeric in smart match
if (not($item ~~ @exclude)) {
if (not $item ~~ @resultList) {
push(@resultList, ($item ne UNDEF) ? $item : u
my $item = $arr_ref->[$i] // UNDEF;
no warnings;
if (not($item ~~ @outList)) {
unshift(@outList, $item);
}
use w
_NEW_cdm_GIVEN(c, father) (struct zx_cdm_GIVEN_s*)zx_new_elem((c),(father),zx_cdm_GIVEN_ELEM)
int zx_DEC_ATTR_cdm_GIVEN(struct zx_ctx* c, struct zx_cdm_GIVEN_s* x);
int zx_DEC_ELEM_cdm_GIVEN(struct zx
zx_DEEP_CLONE_cdm_GIVEN(struct zx_ctx* c, struct zx_cdm_GIVEN_s* x, int dup_strs);
void zx_DUP_STRS_cdm_GIVEN(struct zx_ctx* c, struct zx_cdm_GIVEN_s* x);
int zx_WALK_SO_cdm_GIVEN(struct zx_ctx* c, s
m_GIVEN_s* x, void* ctx, int (*callback)(struct zx_node_s* node, void* ctx));
int zx_WALK_WO_cdm_GIVEN(struct zx_ctx* c, struct zx_cdm_GIVEN_s* x, void* ctx, int (*callback)(struct zx_node_s* node, vo
y scaned', $indb->{size}),
$filelist_line->( { %$f, %$indb } ), next, if $indb->{size} ~~ $f->{size};
#$db->select('filelist', {path=>$f->{path},file=>$f->{file}, });
$curdir) = m{^Directory Name="([^"]+)">}i ) { #"mcedit
$dir .= ( ( !length $dir and $^O ~~ [ 'MSWin32', 'cygwin' ] ) ? () : '/' ) . $curdir;
#$self->log 'now in', $dir;
#$se
bz2',
);
psmisc::unlock('sharescan');
#$_[0]->( $sharesize, $sharefiles ) if ref $_[0] ~~ 'CODE';
#( $self->{share_size} , $self->{share_files} ) = ( $sharesize, $sharefiles );
$sh
";
}
sub token {
state $empty_line;
loop {
if @tokens {
if @tokens[0] ~~ '#' {
# skip comment
@tokens = ();
next;
$line_number++;
# print "# $line_number: $line\n";
@tokens = $line ~~ m:g:perl5 {(\w+|\s+|.+?)}; # \b doesn't work ???
@tokens = @tokens.map:{ ~$_ }; # force
}
}
sub optional_space {
my $word;
loop {
$word = token;
next if $word ~~ m:perl5/^\s/;
unshift @tokens, $word;
return;
}
}
sub sentence {
print ta
= $ua->request($req);
if ( $res->is_success ) {
$rubies->{$version} = [];
for ( grep { $_ ~~ /ruby.*\.tar\.bz2/ } split '\n', $res->content ) {
my $at = $self->archive_type;
( my $rub
nstalled;
my $installed = $self->installed_rubies->{$major_version};
if ($self->ruby_version ~~ @$installed){
$self->gemset($gemset);
$self->_setup_environment;
$self->_sub_shell;
}
nstalled;
my $installed = $self->installed_rubies->{$major_version};
if ($self->ruby_version ~~ @$installed){
my $dir = File::Spec->catdir($self->rootdir, 'gemsets', $self->major_version, $se
n zero. For "wrap" formats, it is the no. of characters in a row.
If a max. length specifier is given (ie. "@50:..."), then this value is returned.
[2] - The justification (either "<", "|", ">", or
[@_];
my $elt_type= $tc->[1]->[0];
if (!isprim($elt_type)) {
if (not ($tc->[1] ~~ $v->[0]->{Type}->[1]) ) {
die "Type error in Array type check:";
}
}
ore, we can do something similar to pattern matching by using a variant() function like this:
given(variant $t) {
when (Just) : untype $t;
when (Nothing) : <do something else>
}
So variant()
'Type' => $a->{Type}->[2]};
}
sub unshift {
(my $a, my $v) =@_;
if ($v->{Type} ~~ $a->{Type}[2]) {
unshift @{$a->{Val}}, $v->{Val};
} else {
die "T
lue })>
Pass a hashref of options to the constructor for Ossec::Log::Parse. Options that
can be given (in descending order of importance):
=over 4
=item B<fh>
Filehandle to be used as data source.
lue })>
Pass a hashref of options to the constructor for Ossec::Log::Parse. Options that
can be given (in descending order of importance):
=over 4
=item B<fh>
Filehandle to be used as data source.
T)>
=item C<new(NAME)>
Constructor. FILE, NAME or TEXT are optional arguments.
When a name is given (a string without 'C</>', 'C<\>' or 'C<.>') a lookup is
done using File::BaseDir. If the file fou
out of grace note state
$brhythm = $gbr;
$new_abc .= '}'; # close grace notes
}
given ($sym->{type}) { # symbol type
when (ABC_T_INFO ) { ($new_abc, $nl_new) = _inf
new_abc;
}
# -- change length when broken rhythm --
sub _broken_rhythm {
my $len = shift;
given ($brhythm) {
when (-3) { $len *= 8; }
when (-2) { $len *= 4; }
when (-1) { $len *= 2;
if ($all_tie) {
if ( $all_tie & SL_DOTTED ) { $new_abc .= q{.} }
$new_abc .= q{-};
given ($all_tie) {
when (SL_ABOVE) { $new_abc .= q{'}; }
when (SL_BELOW) { $new_abc .= q{,}
= {};
my $count = 0;
foreach my $top_node ($doc->findnodes('/plist/dict/key')) {
given ($top_node->textContent) {
when ('List of Faces') {
my $personlist_no
ODES:
foreach my $image_node ($imagelist_node->childNodes) {
given ($image_node->nodeName) {
when ('key') {
$key
;
unless ($person ~~ \@persons_list_final) {
push(@persons_list_final,$pers
ct to another.
=head2 hex_neighbor ($direction)
Returns a new neighboring hex in the direction given (0-5).
=head1 AUTHOR
David Farrell <dfarrell@cpan.org>
=head1 COPYRIGHT AND LICENSE
This soft
ult returns the closest
full stop aperture between 1 and 64.
If the optional third argument is given (a reference to a list of
possible aperture values), then the returned aperture will be
the close
the closest
full stop between 1920s (32 minutes) and 1/8000s.
If the optional third argument is given (a reference to a list
of possible shutter speeds), then the returned shutter speed
will be the c
<use base>
instead. Which you can, and Class::Mixer will notice and use it.
If no rule type is given (e.g. C<use Class::Mixer 'BaseClass';> )
then the before rule is assumed.
=head2 B<after>
The '
hem directly.
gen {$_**2} 100 ~~ gen {$_**2} range 0, 100
my @names = qw/bob alice eve/;
gen {"hello $_!"} \@names ~~ gen {"hello $_!"} makegen @names
those were
l's
C<reftype $reference> to determine which key to look for.
If no suitable key/value pair was given (e.g. C<$reference> is an C<ARRAY>
reference but no C<< ARRAY => sub {...} >> pair exists), C<swi
while( @list ) {
use experimental 'smartmatch';
use feature 'switch';
given( shift @list ) {
when( 'HASH' eq ref $_ ) { push @results, [ %{ $_ } ] }