in reply to confusing array comparison

Would something like this work?

#! perl -slw use strict; use List::Util qw[ shuffle ]; our $N ||= 10; our $E ||= 5; my @a = (shuffle 1 .. $N)[ 0 .. $E ]; my @b = (shuffle 1 .. $N)[ 0 .. $E ]; my @c = (shuffle 1 .. $N)[ 0 .. $E ]; my @d = (shuffle 1 .. $N)[ 0 .. $E ]; my %comp; $comp{ $_ }{a} = 'a' for @a; $comp{ $_ }{b} = 'b' for @b; $comp{ $_ }{c} = 'c' for @c; $comp{ $_ }{d} = 'd' for @d; print " : a b c d\n--------------"; printf "%4s : %s\n", $_, join ' ', map{ $_||'-' } @{ $comp{ $_ } }{ 'a'..'d' } for sort{$a<=>$b} keys %comp; __END__ c:\test>528473 : a b c d -------------- 1 : - - c - 2 : a - c d 3 : a b - - 4 : a b c - 5 : a b c d 6 : a b - d 7 : - b - d 8 : - - c d 9 : - - c - 10 : a b - d c:\test>528473 -N=10 -E=8 : a b c d -------------- 1 : a - c d 2 : a b c d 3 : a b c d 4 : a b - d 5 : a b c d 6 : a b c d 7 : a b c d 8 : - b c - 9 : a b c d 10 : a b c d

Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
Lingua non convalesco, consenesco et abolesco. -- Rule 1 has a caveat! -- Who broke the cabal?
"Science is about questioning the status quo. Questioning authority".
In the absence of evidence, opinion is indistinguishable from prejudice.

Replies are listed 'Best First'.
Re^2: confusing array comparison
by Anonymous Monk on Feb 07, 2006 at 12:40 UTC
    Hi there,

    thanks for your answer! i dont really understand your code so not sure how to adapt this to work for real data!?

      This first bit is just setting up 4 arrays with random integer test data.

      my @a = (shuffle 1 .. $N)[ 0 .. $E ]; my @b = (shuffle 1 .. $N)[ 0 .. $E ]; my @c = (shuffle 1 .. $N)[ 0 .. $E ]; my @d = (shuffle 1 .. $N)[ 0 .. $E ];

      This bit builds a hash of hashes using the values from the arrays as primary keys and the 'name' of the array that value came from as the secondary key.

      my %comp; $comp{ $_ }{a} = 'a' for @a; $comp{ $_ }{b} = 'b' for @b; $comp{ $_ }{c} = 'c' for @c; $comp{ $_ }{d} = 'd' for @d;

      print a header

      print " : a b c d\n--------------";

      And this bit does the display

      printf "%4s : %s\n", $_, join ' ', map{ $_||'-' } @{ $comp{ $_ } }{ 'a'..'d' } for sort{$a<=>$b} keys %comp;

      In reverse order

      for sort{$a<=>$b} keys %comp;

      For each key (ie. each unique value from the four arrays), in the primary hash, sorted into (in this case ascending numeric order),

      @{ $comp{ $_ } }{ 'a'..'d' }

      Take a slice across the hash for this value,

      map{ $_||'-' }

      Pass the values through a map to replace undef values by a token ('-') to represent that this value was missing in this array.

      join ' ',

      joins the 'found' and 'missing' tokens into a string with some spaces for presentation.

      printf "%4s : %s\n", $_,

      and print out the value, and the string showing which arrays it was found in.

      Each iteration of that loop gives you one line showing 'this value' appeared/was missing in these arrays. So for my test data you read this line:

      6 : a b - d

      As "The value 6 appeared in array @a @b @d but was missing from @c"


      Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
      Lingua non convalesco, consenesco et abolesco. -- Rule 1 has a caveat! -- Who broke the cabal?
      "Science is about questioning the status quo. Questioning authority".
      In the absence of evidence, opinion is indistinguishable from prejudice.
      A reply falls below the community's threshold of quality. You may see it by logging in.