Thank You, everyone for your help! I am just confused with the following example. I think it is an inverted form of the original example I performed:
%HoA = (
flintstones => [ "fred", "barney" ],
jetsons => [ "fred", "jane", "elroy" ],
simpsons => [ "fred", "marge", "bart" ],
);
If the family names (jetsons, simpsons) are always different but elements within each of the familes may or may not match.
If I want to show that:
"fred" is a name that can be found in 3 families = [flintstones, jetso
+ns, simpsons]
e.t.c
Is this possible with this hash formation?