~~';
return $self->violation( $DESC, $EXPL, $elem );
}
1;
__END__
=encoding utf-8
=head1 NAME
Perl::Critic::Policy::Operators::ProhibitSmartmatch
- avoid using explicit smartmatching via C<~~
Smartmatch operator is considered experimental, see L<perlop/"Smartmatch Operator">.
if ($foo ~~ [ $bar ]) {
say 'No!';
}
=head1 AUTHOR
Jan Holcapek E<lt>holcapek@gmail.comE<gt>, wh
without a label';
}
$self->login;
my $tmpl = Crypt::PKCS11::Attributes->new;
given ($self->function) {
return $self->get_signing_key($self->key) when 'sign';
return
lots, $slot;
}
return \@slots;
}
sub login {
my $self = shift;
my $pin;
given (ref $self->pin) {
when ('CODE') {
$log->debug('Getting PIN from coderef');
mech->set_mechanism($const->());
# does this mechanism need parameters?
my $params;
given ($args->{mech}) {
when (/^(SHA(\d+))_RSA_PKCS_PSS$/) {
$params = $self->_get_
n triple semantics (the graph union of triples from all the named
graphs). If four arguments are given (even if C<< $context >> is undef),
statements will be matched based on quad semantics (the union
n triple semantics (the graph union of triples from all the named
graphs). If four arguments are given (even if C<< $context >> is undef),
statements will be matched based on quad semantics (the union
return
sort
map { $_->name }
grep { 'XML::XSS::Role::StyleAttribute' ~~ @{ $_->applied_traits } }
grep { $_->has_applied_traits }
map { $self->meta->get_a
if($self->view('Excel'))
{
unless ($self->view('Excel')->{etp_config}->{INCLUDE_PATH} ~~ $template_path) {
push @{$self->view('Excel')->{etp_config}->{INCLUDE_PATH}}, $templat
>view('Excel')->{etp_engine} = 'TTAutoFilter';
unless ($self->view($tt_view)->include_path ~~ $template_path) {
push @{$self->view($tt_view)->include_path}, $template_path;
nfig = $self->config->{'View::Excel'};
unless ($excel_config->{etp_config}->{INCLUDE_PATH} ~~ $template_path) {
push @{$excel_config->{etp_config}->{INCLUDE_PATH}}, $template_path;
e;
# for my $mod (@{ $self->lump_module }) {
# push @lump_mods, $mod unless $mod ~~ @lump_mods;
# }
#}
# lump_dist
{
last unless $self->lump_dist;
es->[0] == 200;
for my $mod (@{$res->[2]}) {
push @lump_mods, $mod unless $mod ~~ @lump_mods;
}
}
# lump_dist_and_deps
{
last unless $self->lump_dist_a
lude_author && @{ $self->include_author }) {
last DECIDE unless $rec->{author} ~~ @{ $self->include_author };
}
$lump = 1;
}
ts}->{$idcol} ) {
#@pk = $dman{ $id }->get_autoinc_primarykeys;
#if ($id ~~ @pk) {
if ( grep /^$idcol$/, @pk ) {
$log{ $id }->debug( $idcol, " no
alue undef" )
unless ( defined $v );
# if ( defined $v && ( $id ~~ @{$self->{dates_formatted}})){
if ( defined $v && defined $widgets{ $id }->{hdates
$self->get($name)->set(%$attrs);
}
}
sub get {
my ( $self, $name ) = @_;
given ( $name ) {
when ( '#document' ) {
return $self->document;
}
die;
}
}
sub resolve {
my ( $self, $node ) = @_;
my $type = ref $node;
given ($type) {
when ('XML::LibXML::Document') {
return $self->document;
}
toms) }]);
}
sub opt_spp_atom {
my $atom = shift;
my ($name, $value) = flat($atom);
given ($name) {
when ('Spec') { return opt_spp_spec($value) }
when ('Group') { return op
($char));
}
sub opt_spp_escape_char {
my $str = shift;
my $char = last_char($str);
given ($char) {
when ('n') { return "\n" }
when ('r') { return "\r" }
when ('t') { retur
return cons('Nclass', estr($atoms));
}
sub opt_spp_catom {
my ($name, $value) = @_;
given ($name) {
when ('Cclass') { return opt_spp_cclass($value) }
when ('Range') { return op
ers from patsubst
# in that it will perform correctly when alternate names for directories are
# given (as long as they precede the percent sign). For example,
#
# $(filesubst ./src/%.c, %.o, $(wild
differs from patsubst
in that it will perform correctly when alternate names for directories are
given (as long as they precede the percent sign). For example,
$(filesubst ./src/%.c, %.o, $(wild
ers from patsubst
# in that it will perform correctly when alternate names for directories are
# given (as long as they precede the percent sign). For example,
#
# $(filesubst ./src/%.c, %.o, $(wild
p abs log sqrt int 0+ #;
# non-numeric ops:
# x . x= .= cmp lt le gt ge eq ne ^. ^.= ~. "" qr -X ~~
sub overload_handler {
my ($ref, $y, $swap, $op) = @_;
my $handle = handle($ref);
my
r' )
# 05: }, 'ANONYMOUS_SHIRAS_MOOSE_CLASS_1' );
# 06: You did something wrong at ~~error_string (defined at ../../../../lib/Spreadsheet/Reader/ExcelXML/Error.pm line 43) line 13.
et_error(Spreadsheet::Reader::ExcelXML::Error=HASH(0x31e398), "You did something wrong") called at ~~ line 110
# 09: ANONYMOUS_SHIRAS_MOOSE_CLASS_1::set_error(ANONYMOUS_SHIRAS_MOOSE_CLASS_1=HAS
top' => undef,
# 26: 'left' => undef
# 27: },
# 28: 'cell_coercion' => bless( {
~~ Skipped 142 lines ~~
#170: 'display_name' => 'Excel_date_164',
#171: '
lan 25;
if !eval('("a" ~~ /a/)') {
skip_rest "skipped tests - rules support appears to be missing";
} else {
# Testing the parsing of verious forms of numbers
is(?("1" ~~ /^<Int>$/),Bool::True,"
~~ /^<Int>$/),Bool::True,"-1 is parsed as an integer");
is(?("1." ~~ /^<Rat>$/),Bool::True,"1. is parsed as a Rat");
is(?("-1." ~~ /^<Rat>$/),Bool::True,"-1. is parsed as a Rat");
is(?("0.1" ~~
" ~~ /^<Rat>$/),Bool::True,"0.1 is parsed as a Rat");
is(?(".1" ~~ /^<Rat>$/),Bool::True,".1 is parsed as a Rat");
is(?("-.1" ~~ /^<Rat>$/),Bool::True,".1 is parsed as a Rat");
is(?("10.01" ~~ /
@dirs = split("/", $directories);
@dirs = @dirs.map:{ split("\\", $_) };
if (($directories ~~ rx:P5"[\\/]\Z(?!\n)")) {
@dirs[@dirs - 1] = '';
}
@dirs = map {~$_ }, @dirs;
r
($nofile) {
$path ~~ rx:P5"^((?:[a-zA-Z]:|(?:\\\\|//)[^\\/]+[\\/][^\\/]+)?)(.*)";
$volume = ~$0;
$directory = ~$1;
}
else {
$path ~~ rx:P5"^((?:[a-zA-Z]:|(?:
ew_path;
my $i = 0;
loop ($i = 0; $i < @path; $i++) {
@path[$i] ~~ s:P5:g"/"\\";
if (@path[$i] ~~ m:P5"\\$") {
push(@new_path, @path[$i]);
}
else {
pts, @OPTIONS )
or die "Error parsing command-line options\n";
# "If no argument is given (but the switch is specified - not specifying
# the switch will include everything), it defau
=head2 max()
Returns the node with the maximal key.
=head2 nth(INDEX)
Returns the node at the given (zero based) index, or undef if there is no node at that index. Negative indexes can be used, wit