Personally, I don't think I'd trust the iterator after changing the hash, but I'd probably hope that it would iterate until there are zero keys in the hash that it has not yet returned.
There are two problems with that statement:
Ditto: noticing that a new key had been added at a point preceding the current position of the iterator.
In reply to Re^2: Design thoughts: iterator invalidation
by BrowserUk
in thread Design thoughts: iterator invalidation
by BrowserUk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |