Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical

Re^8: Using hashes for set operations...

by LanX (Chancellor)
on May 27, 2011 at 18:13 UTC ( #907034=note: print w/replies, xml ) Need Help??

in reply to Re^7: Using hashes for set operations...
in thread Using hashes for set operations...

However, this claim would imply that stringification defines a bijection between objects and their hash keys.

Ergo, hash keys are all you need! ;-)

in theory yes, practically no.

There is no pure perl way to get the ref from the stringification, as long the relation is stored in a hash (sic).

And yes collisions can happen, when strings and references are mixed into one set...then resulting into the need of a specialized stringification.

Cheers Rolf

  • Comment on Re^8: Using hashes for set operations...

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others avoiding work at the Monastery: (6)
As of 2016-10-22 23:57 GMT
Find Nodes?
    Voting Booth?
    How many different varieties (color, size, etc) of socks do you have in your sock drawer?

    Results (299 votes). Check out past polls.