in reply to Re^7: A more elegant way to filter a nested hash?
in thread A more elegant way to filter a nested hash?

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

Replies are listed 'Best First'.
Re^9: A more elegant way to filter a nested hash?
by LanX (Saint) on May 31, 2018 at 21:04 UTC
    > The point regards the answer that gets the highest amount of votes regards using map and grep in favor of using hash slices!

    ha, better don't give a damn about the votes! =)

    Regarding rankings of posts compared to "quality": The correlation is so low I don't even discuss it anymore. ;-)

    Cheers Rolf
    (addicted to the Perl Programming Language :)
    Wikisyntax for the Monastery

    *)... well maybe except with down-votes ... :)