I agree with you. But I don't understand why you are ignoring my point that I am trying to make. The point regards the answer that gets the highest amount of votes regards using map and grep in favor of using hash slices!
I don't know what you mean with 'edge cases' but if you mean checking for hashes or undefined values they can easily be added with some simple if then else statements. E.g.:
if ( !defined $n->{ $_ } && exists $f->{ $_ } ) { print "Hello a undefined value was detected\n" ; }2018-06-09 Athanasius restored node content
In reply to Re^8: A more elegant way to filter a nested hash?
by Veltro
in thread A more elegant way to filter a nested hash?
by jimpudar
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |