Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked

Re: Comparing two hashes

by bichonfrise74 (Vicar)
on Apr 01, 2010 at 20:45 UTC ( #832382=note: print w/replies, xml ) Need Help??

in reply to Comparing two hashes

Something like...

1. Create an outer for loop on 1st hash.
2. Create an inner for loop on the 2nd hash.
3. If keys and values of 2nd hash element is equal to the 1st hash element, then they are the same.

Replies are listed 'Best First'.
Re^2: Comparing two hashes
by moritz (Cardinal) on Apr 01, 2010 at 21:31 UTC
    Doing a linear scan over an associative array is like trying to club someone to death with a loaded Uzi -- TimToady

    Sounds like you don't need step 2. at all, since you can simply access the hash item by key.

    Perl 6 - links to (nearly) everything that is Perl 6.

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://832382]
[huck]: a first for me, got someone at credit card services to give me their credit card number!!

How do I use this? | Other CB clients
Other Users?
Others romping around the Monastery: (8)
As of 2017-03-24 19:23 GMT
Find Nodes?
    Voting Booth?
    Should Pluto Get Its Planethood Back?

    Results (306 votes). Check out past polls.