Re^4: How foreach loops decide what to iterate through (push array inside foreach)

Actually, the first 3 examples work exactly how the simple model I offered in my previous posts would expect them to.

In the first case the concatenation with () creates a new list to loop over so that the addition to @a has no consequences while the second case adds to @a keeping the end out of reach like a carrot on a stick dangling before the horse.

Same for the third case. After the second value was poped from the array, the loop naturally was finished early. But the fourth case shows the problem. Seems the values of the "anonymous array" are aliased to the real values and have a problem when that value isn't there anymore.

But I can see why "Don't do it" is the better answer. Otherwise too much of the internas would spill out into the language design.

Comment on Re^4: How foreach loops decide what to iterate through (push array inside foreach)

Replies are listed 'Best First'.
Re^5: How foreach loops decide what to iterate through (push array inside foreach) by ikegami (Patriarch) on Feb 14, 2009 at 05:37 UTC
Actually, the first 3 examples work exactly how the simple model I offered in my previous posts would expect them to. Perhaps, but they don't all behave according to the documentation which say each of the loop pairs I provided should behave the same. Thus the deviation from the documentation is Perl being "confused". However, I must concur that it's very predictable confusion. But I can see why "Don't do it" is the better answer. There are way less obscure ways to structure the code this optimisation enables. Stack and queues are by far the most common usage of modifying an array being processed, and both are quite clear and concise without foreach. `while (@todo) { my $item = pop(@todo); ... push @todo, ...; ... }` [download] `while (@todo) { my $item = shift(@todo); ... push @todo, ...; ... }` [download]	[reply] [d/l] [select]

Replies are listed 'Best First'.

Re^5: How foreach loops decide what to iterate through (push array inside foreach)
by ikegami (Patriarch) on Feb 14, 2009 at 05:37 UTC

Actually, the first 3 examples work exactly how the simple model I offered in my previous posts would expect them to.

Perhaps, but they don't all behave according to the documentation which say each of the loop pairs I provided should behave the same. Thus the deviation from the documentation is Perl being "confused".

However, I must concur that it's very predictable confusion.

But I can see why "Don't do it" is the better answer.

There are way less obscure ways to structure the code this optimisation enables.

Stack and queues are by far the most common usage of modifying an array being processed, and both are quite clear and concise without foreach.

while (@todo) {
   my $item = pop(@todo);
   ...
   push @todo, ...;
   ...   
}
[download]

while (@todo) {
   my $item = shift(@todo);
   ...
   push @todo, ...;
   ...   
}
[download]

[reply]
[d/l]
[select]