Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical
 
PerlMonks  

Re^4: A more elegant way to filter a nested hash?

by LanX (Sage)
on May 31, 2018 at 18:22 UTC ( #1215558=note: print w/replies, xml ) Need Help??


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

I agree with most of what you said.

IMHO recursive solutions are easier to write and maintain, I'd only translate them to iterative if performance mattered.

Point is you still need some kind of call stack* which needs to be simulated then.

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

*) in this case the last positions in the tree and remaining keys for each sub hash.

  • Comment on Re^4: A more elegant way to filter a nested hash?

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://1215558]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others avoiding work at the Monastery: (4)
As of 2021-12-03 10:36 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    R or B?



    Results (28 votes). Check out past polls.

    Notices?