nless ref $data ~~ [qw/HASH ARRAY/];
my $current = shift;
my $type = $current->{'type'};
my $val = $current->{'val'};
if (ref $data eq 'HASH') {
given ($type) {
default { return undef }
}
}
elsif (ref $data eq 'ARRAY') {
given ($type) {
when ('SLICE') {
my @slice = @$data[@$val];
ata;
}
# for $val_pat we do grep at array or hash loops
return $data unless ref $data ~~ [qw/ARRAY HASH/];
# If we have been already visited this ref
$visited //= {};
return
ue) ~~ $matrix->SetAttribute("BGCOLOR30:10", $value)
$matrix->MatAttribute("ALIGNMENT", 10, $value) ~~ $matrix->SetAttribute("ALIGNMENT10", $value)
$v = $matrix->GetAttribute("BGCOLOR30:10") ~~ $v
al set and get functions:
$matrix->MatCell(30, 10, $value) ~~ $matrix->SetAttribute("30:10", $value)
$v = $matrix->MatCell(30, 10) ~~ $v = $matrix->GetAttribute("30:10")
=head1 EXAMPLES
The
>. It will be calculated from C<xydata>.
=item C<fit(time_limit =E<gt> 3)>
If a time limit is given (in seconds), C<fit()> will spend no more than that long trying to fit the data. It may return i
eletion> from I<BRANG> to I<BANG>).
I<Identical strings>: If two identical letter strings are given (I<BANG>, I<BANG>), they are defined as I<not> being orthons: the number of index identical chara
erformance counts of hits, false-alarms, misses & correct rejections
## from what has just been given (just initialised)
## e.g., number of hits from the given number of signal-trials and misses:
s
e
$i2c->write( $addr, $data_out )->get
Performs an I²C write operation to the chip at the given (7-bit) address
value.
The device sends a start condition, then a command to address the chip fo
$data_in = $i2c->read( $addr, $len_in )->get
Performs an I²C read operation to the chip at the given (7-bit) address
value.
The device sends a start condition, then a command to address the chip fo
I²C write operation followed by a read operation within the same
transaction to the chip at the given (7-bit) address value. This is roughly
equivalent to performing separate calls to L</write> and L
~~ <1..3> | <4..6> ~~ <1..3>->zip(<4..6>)
<1..3> Z. <4..6> ~~ <1..3> |'.'| <4..6> ~~ <1..3>->zip('.' => <4..6>)
<1..3> X <4..6> ~~ <1..3> x <4..6> ~~ <1.
<4..6> ~~ <1..3> x'.'x <4..6> ~~ <1..3>->cross('.' => <4..6>)
<1..3> <<+>> <4..6> ~~ <1..3> <<'+'>> <4..6> ~~ <1..3>->hyper('<<+>>', <4..6>)
[+] 1..10 ~~ <[+] 1..10
> ~~ reduce {$_[0] + $_[1]} 1 .. 10
[+]->(1..10) ~~ <[+]>->(1..10) ~~ same as above
[\+] 1..10 ~~ <[..+] 1..10> ~~ scan {$_[0] + $_[1]} 1 ..
tom see_ast is_exported);
use Spp::Builtin;
sub is_type {
my $str = shift;
return $str ~~ [
'Str', 'Int', 'Bool', 'Cursor',
'Lint', 'Array', 'Ints', 'Hash',
'
y $chars = [];
my $mode = 0;
for my $ch (split '', $json) {
if ($mode == 0) {
given ($ch) {
when ('[') { push @{$chars}, In; }
when (']') { push @{$chars}, Out; }
$mode = 2;
}
}
}
}
elsif ($mode == 1) {
given ($ch) {
when ('"') { $mode = 0 }
when ("\\") { $mode = 3 }
default {
^<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<< ~~
$role_reqs
.
format INHERIT_POD =
=head1 NAME
@*
$myclass
=he
<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<< ~~
$handles
.
format ATTR_NARROW =
$handles
^<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<< ~~
$handles
.
format ATTRHEAD_POD =
=head1 ATTRIBUTES
.
format ATTR_POD =
=head2 C<
^<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<< ~~
$role_reqs
.
format INHERIT_POD =
=head1 NAME
@*
$myclass
=he
<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<< ~~
$handles
.
format ATTR_NARROW =
$handles
^<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<< ~~
$handles
.
format ATTRHEAD_POD =
=head1 ATTRIBUTES
.
format ATTR_POD =
=head2 C<
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
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_
~~';
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
gs
return $r1 eq $r2;
}
}
elsif( $ref1 eq $ref2 ) {
if ( $ref1 ~~ [qw(Regexp GLOB CODE)] ) {
return $r1 eq $r2;
}
elsif ( $ref1 eq 'ARRA
$ref1 eq 'HASH' ) {
return _equal_hashes( $r1, $r2 );
}
elsif ( $ref1 ~~ [qw(SCALAR REF)] ) {
return are_equal($$r1, $$r2);
}
else {
($r1, $r2) = @_;
# Hashes can't be equal unless their keys are equal.
return unless ( %$r1 ~~ %$r2 );
# Compare the equality of the values for each key.
foreach my $key (keys %$r1) {
return
sort
map { $_->name }
grep { 'XML::XSS::Role::StyleAttribute' ~~ @{ $_->applied_traits } }
grep { $_->has_applied_traits }
map { $self->meta->get_a
$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;
}
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
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
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;