Beefy Boxes and Bandwidth Generously Provided by pair Networks
laziness, impatience, and hubris
 
PerlMonks  

Re: Manipulate deepest values in complex hash structures

by Anonymous Monk
on Apr 29, 2013 at 22:47 UTC ( #1031291=note: print w/ replies, xml ) Need Help??


in reply to Manipulate deepest values in complex hash structures

Also consider e.g. Data::Leaf::Walker for existing examples of walker subs.


Comment on Re: Manipulate deepest values in complex hash structures
Re^2: Manipulate deepest values in complex hash structures
by LanX (Canon) on Apr 30, 2013 at 00:31 UTC
    IMHO Data::Leaf::Walker can't be used in this particular task of changing leave values.

    Or can you see a possibility to pass an absolute key-path which selects only the deepest leaves?

    And the each-method will only return copies which can't be manipulated.

    OTOH generating an iterator is for sure an interesting alternative.

    Cheers Rolf

    ( addicted to the Perl Programming Language)

      No arguments that it may or may not be appropriate in this case.   I mention it mainly to point out (as other Monks have, since) that “canned” walkers also exist, which might (or might not) be suitable.

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others imbibing at the Monastery: (2)
As of 2014-09-20 15:18 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    How do you remember the number of days in each month?











    Results (160 votes), past polls