in reply to Re^5: A more elegant way to filter a nested hash?
in thread A more elegant way to filter a nested hash?
What price is higher then using map or grep? I don't see it. The only iteration that is done twice is over the keys of the result-set which is necessary because of autovivification. The fact that missing values become undefined instead of non-existent is actually something that I would prefer in case the filter asked for it.
2018-06-09 Athanasius restored node content
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re^7: A more elegant way to filter a nested hash?
by LanX (Saint) on May 31, 2018 at 20:40 UTC | |
by Veltro (Hermit) on May 31, 2018 at 20:56 UTC | |
by LanX (Saint) on May 31, 2018 at 21:04 UTC |