Logo

Programming-Idioms

  • Pascal
  • Dart
  • C++

Idiom #312 Test for list equality

Set b to true if the lists p and q have the same size and the same elements, false otherwise.

#include <algorithm>
bool b = ::std::ranges::equal(p, q);
classes
  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;
  if (size(p,1) /= size(q,1)) then
    b = false
  else
    b = all (p == q)
  end if

This assumes one-dimensonal arrays a and b. The all intrinsic returns true if the array expression p == q contains only true elements, if all elements are equal.
New implementation...
< > ⌨
programming-idioms.org 
bool b = ::std::ranges::equal(p, 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;
  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 = @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;