(Demonstrating the limitations of each is the most valuable outcome for me.)
Really. That limitation is already well documented:
"There is a single iterator for each hash, shared by all each, keys, and values function calls in the program; it can be reset by reading all the elements from the hash, or by evaluating keys HASH or values HASH. If you add or delete elements of a hash while you're iterating over it, you may get entries skipped or duplicated, so don't."
In reply to Re^4: Challenge: Perl 5: lazy sameFringe()?
by BrowserUk
in thread Challenge: Perl 5: lazy sameFringe()?
by BrowserUk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |