in reply to Iterating over hash while deleting elements
in thread Iterating over an hash while removing keys

each has no problem if you delete the current element
Nice to know but I wouldn't rely on it. I think "don't use each if the hash changes" is an easier rule to follow/understand. And it's safer against possible future changes as well (you might start by only deleting the current key, and then find out you can delete a few more at the same time).

Question to follow ;-P
Spooky...

  • Comment on Re: Iterating over hash while deleting elements

Replies are listed 'Best First'.
Re^2: Iterating over hash while deleting elements
by LanX (Saint) on Feb 06, 2020 at 17:05 UTC
    > Nice to know but I wouldn't rely on it

    It's documented.

    > Exception: It is always safe to delete the item most recently returned by each, so the following code works properly:

    > 

    while (my ($key, $value) = each %hash) {
    print $key, "\n";
    delete $hash{$key};   # This is safe
}

    [download]

    Cheers Rolf
    (addicted to the Perl Programming Language :)
    Wikisyntax for the Monastery FootballPerl is like chess, only without the dice

[reply]
[d/l]

      Oh I didn't mean I don't trust perl with that. It's whoever is using perl I have trust issues against ;-)

[reply]
        point is you must delete the current key to avoid an endless loop.

        not sure how an idiot proof algo would look like.

        Cheers Rolf
        (addicted to the Perl Programming Language :)
        Wikisyntax for the Monastery FootballPerl is like chess, only without the dice

[reply]

In Section Seekers of Perl Wisdom