Re^2: Consise way to filter out keys with undef values from a hash slice?

[jo37]

Otherwise (ab)using hashes for set operations like intersections would be trivial.

Though off-topic here: Is there a common idiom for an intersection of two hash-sets? The first thing that comes to my mind is something like:

%a_b = map {exists $b{$_} ? ($_ => $b{$_}) : ()} keys %a;

[LanX]

Hi

You might be interested in this older thread

Using hashes for set operations...

and this particular post

Re: Using hashes for set operations...