Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw
 
PerlMonks  

Re: Re: Comparing hashes without sorting the keys

by Discipulus (Canon)
on Feb 18, 2004 at 19:09 UTC ( [id://330016]=note: print w/replies, xml ) Need Help??


in reply to Re: Comparing hashes without sorting the keys
in thread Comparing hashes without sorting the keys

thanks Diotalevi,
can you explain a little more this number of hash buckets vs hash buckets used values for each hash..

so there is not a smart way to do this ?

lor*
  • Comment on Re: Re: Comparing hashes without sorting the keys

Replies are listed 'Best First'.
Re: Re: Re: Comparing hashes without sorting the keys
by diotalevi (Canon) on Feb 18, 2004 at 19:12 UTC
    The smart way uses either Storable or the (unknown to me) Data::Compare module someone else recommended. You can find more information about hash buckets by using Super Search.

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others drinking their drinks and smoking their pipes about the Monastery: (5)
As of 2024-04-25 11:10 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found