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

Answer: Union of Two Hashes

by maverick (Curate)
on Apr 09, 2002 at 14:35 UTC ( #157735=categorized answer: print w/replies, xml ) Need Help??

Q&A > hashes > Union of Two Hashes - Answer contributed by maverick

The question is a bit ask for a union, but you code snippet looks like you're looking for the intersection. Union first. For small hashes this is really quick:
%union = (%first, %second);
For large:
while (($k,$v) = each %first) { $union{$k} = $v; } while (($k,$v) = each %second) { $union{$k} = $v; }
(makes sense once you consider the memory usage for the first snippet.

For intersection, all you really need to do is change $matchWords to $matchWords{$k}++ the iterate of then matchWords looking for values == 2

Log In?

What's my password?
Create A New User
and the web crawler heard nothing...

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

    Results (379 votes). Check out past polls.