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)
In reply to Re^2: Manipulate deepest values in complex hash structures
by LanX
in thread Manipulate deepest values in complex hash structures
by RecursionBane
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |