Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl Monk, Perl Meditation

Re: Compare Hashes and Arrays

by Skeeve (Vicar)
on Dec 16, 2009 at 13:08 UTC ( #813012=note: print w/ replies, xml ) Need Help??

in reply to Compare Hashes and Arrays

Provided that either the array's values are unique or provided that you don't care for the number of occurences, you could use the array's values as hash keys. You can either compare the hashes, as you already are able to, or you can try this:

my @base= qw/b c d e/; my @dist= qw/w x y z/; my @id = @base; my @more= qw/a b c d e/; my @less= qw/b c d/; my @intr= qw/a b c d/; print compare(\@base, \@dist); print compare(\@base, \@id ); print compare(\@base, \@more); print compare(\@base, \@less); print compare(\@base, \@intr); sub compare { my($b, $c)= @_; my %a; @a{@$b}= (); my $n= scalar %a; @a{@$c}= (); return "differ\n" if $n ne scalar %a; delete @a{@$c}; return "differ\n" if scalar %a; return "identical\n"; }


Comment on Re: Compare Hashes and Arrays
Select or Download Code

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://813012]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others meditating upon the Monastery: (14)
As of 2015-10-13 12:06 GMT
Find Nodes?
    Voting Booth?

    Does Humor Belong in Programming?

    Results (302 votes), past polls