Perl hash $key, $value loop: while(my ($key, $value) = (each %items))

 

my %items = ("Building Secure Reliable Systems" => "c27bdbb3-6f8d-406c-970c-7ab21d3e614d",
"The Site Reliability Workbook" => "2f224a63-9e66-426d-95ac-c8efb621fc18",
"Site Reliability Engineering" => "1f431b1f-06c8-4b0e-b0c5-e7e697a7c629",);foreach my ($key, $value) (%items) {say $key, $value;
}while(my ($key, $value) = (each %items)) {say $key, $value;
}

foreach vs. while, which one to choose from?

 

结论是当然选择 书上教的 while each 啦

 

In the world of Perl, both foreach and while (with each) get the job done, but they behave quite differently under the hood. Choosing between them usually comes down to whether you prioritize safety or memory efficiency.

---

The Breakdown

1. foreach (The "Snapshotted" Approach)

When you use foreach on a hash, Perl first expands the entire hash into a flat list of keys and values.

• Behavior: It creates a temporary copy of all keys and values in memory before the first iteration begins.

• Safety: This is the safest way to iterate if you plan to add or delete keys inside the loop. Since you're working on a copy, you won't confuse the internal hash iterator.

• Memory: For a small hash (like your book list), this is negligible. For a hash with 10 million entries, this will cause a massive spike in memory usage.

2. while(each ...) (The "Streamed" Approach)

The each function maintains an internal pointer to the hash and returns the "next" pair one at a time.

• Behavior: It does not copy the hash. It processes items lazily.

• Memory: Extremely efficient. It uses the same amount of memory regardless of whether the hash has 10 items or 10 billion.

• Danger Zone: You must never add or delete keys (except for the current key) inside a while(each) loop. Doing so resets or skips the internal iterator, leading to unpredictable results or infinite loops.

• Stateful: Since it uses a single internal iterator per hash, if you break out of the loop early and call each again later, it will start where it left off unless you call keys %items to reset the iterator.

---

Comparison Table

Feature	foreach	while(each)
Memory Usage	High (copies the whole hash)	Low (one pair at a time)
Modification	Safe to add/delete keys	Unsafe to add/delete keys
Speed	Generally faster for small hashes	Faster for massive hashes
Resetting	Always starts from the beginning	Must be manually reset if interrupted

---

The Verdict: Which to choose?

Choose foreach if...

• Your hash is of a "reasonable" size (most application data).

• You need to delete items from the hash while looping.

• You want the most "Perlish" and readable syntax.

• Note: In modern Perl (5.12+), you can also use while(my ($k, $v) = each %hash).

Choose while(each) if...

• You are dealing with massive datasets where memory overhead is a concern.

• You are strictly reading the data and not modifying the hash structure.

A quick tip for your code: In your foreach example, you're using foreach my ($key, $value) (%items). This syntax (assigning a list slice directly in the loop head) is only available in Perl 5.36 and later. If you're on an older version, you'd typically use:

Perl

 

foreach my $key (keys %items) {my $value = $items{$key};say "$key: $value";
}

Are you planning to modify these book records while you're looping through them, or just print them out?