What have you tried?
I'd write a subroutine that receives a hash ref as an argument, and stores the right value if the key in question is there. Then it recurses into all the values that are hashrefs.
In reply to Re: How to find all occurrences of a key in a deeply nested structure?
by moritz
in thread How to find all occurrences of a key in a deeply nested structure?
by deMize
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |