Traverse the tree, for each node, if its value is undef, deal with the file etc, otherwise, go to the next level. It can be written in a recursive way.
In reply to Re: Filling value of nested hash
by PeterPeiGuo
in thread Filling value of nested hash
by Dirk80
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |