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

Replies are listed 'Best First'.
Re^2: Manipulate deepest values in complex hash structures
by LanX (Saint) 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)

[reply]

      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.

In Section Seekers of Perl Wisdom