Sorry, but none of these
Data: Hashes (Associative Arrays) How do I process an entire hash? What happens if I add or remove keys from a hash while iterating ove +r it? How do I look up a hash element by value? How can I know how many entries are in a hash? How do I sort a hash (optionally by value instead of key)? How can I always keep my hash sorted? What's the difference between "delete" and "undef" with hashes? Why don't my tied hashes make the defined/exists distinction? How do I reset an each() operation part-way through? How can I get the unique keys from two hashes? How can I store a multidimensional array in a DBM file? How can I make my hash remember the order I put elements i into it? Why does passing a subroutine an undefined element in a hash create +it? How can I make the Perl equivalent of a C structure/C++ class/hash +or array of hashes or arrays? How can I use a reference as a hash key?
relate to my question. Which for clarity I will restate. How can I determine if there are any common keys in two hashes to which I have references.
Specifically, the code
if(@{$refa}{keys %{$refb}}) { # }
does not work.
If you do not know the answer, perhaps you could let someone who does respond? Instead of linking to a generic section of Q&As that you think (hope) might answer it.
If you really believe one of those does answer the question, then perhaps you could link directly to it, rather than just waving your hands in a general direction: "it's over there somewhere".
In reply to Re^2: Common hash keys
by Anonymous Monk
in thread Common hash keys
by Anonymous Monk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |