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
In reply to Re^6: A more elegant way to filter a nested hash?
by Veltro
in thread A more elegant way to filter a nested hash?
by jimpudar
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |