Beefy Boxes and Bandwidth Generously Provided by pair Networks
go ahead... be a heretic

Re^2: RFC: The Uniqueness of hashes.

by graff (Chancellor)
on Sep 25, 2005 at 16:49 UTC ( #494924=note: print w/replies, xml ) Need Help??

in reply to Re: RFC: The Uniqueness of hashes.
in thread The Uniqueness of hashes.

And a variation on that, which handles duplicate values within the arrays as well:
$_{$_} .= 'a' for @foo; $_{$_} .= 'b' for @bar; # $_{$key} =~ /ab/ iff $key was in @foo and @bar # /a$/ iff $key was only in @foo # /^b/ iff $key was only in @bar # number of occurrences in # $foo_plus_bar = length($_{$key}); # $foo_only = ( $_{$key} =~ tr/a// ); # $bar_only = ( $_{$key} =~ tr/b// );
Adapting that to handle up to 26 arrays is trivial -- just set a scalar to 'a' for the first array, and increment it for each successive array; using a regex to determine the distribution for a given array value is left as an exercise...

(I updated the last three comment lines to be more consistent with the first three comment lines.)

Log In?

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

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

    Results (350 votes). Check out past polls.