$b = @array1 ~~ @array2;
my $b = \@array1 |M| \@array2;
sub lcomp {
my ($a, $b) = @_;
return 0 if ( @$a != @$b ); # lengths different
my $matched = 1;
for (my $i=0; $i < @$a; $i++) {
return 0 unless $a->[$i] == $b->[$i];
}
return 1;
}
$b = Compare( \@p, \@q );
bool b = ::std::ranges::equal(p, q);
if (size(p,1) /= size(q,1)) then b = false else b = all (p == q) end if
b := slices.Equal(p, q)
b = p.equals(q);
b := (p.count = q.count); if b then for i := 0 to p.count-1 do if (p.items[i] <> q.items[i]) then begin b := false; break; end;
$b = @array1 ~~ @array2;
my $b = \@array1 |M| \@array2;
sub lcomp { my ($a, $b) = @_; return 0 if ( @$a != @$b ); # lengths different my $matched = 1; for (my $i=0; $i < @$a; $i++) { return 0 unless $a->[$i] == $b->[$i]; } return 1; }
$b = Compare( \@p, \@q );
b = p == q
b = p == q
b = p == q;