@@ -168,8 +168,8 @@ In fact, C<for> will now be exactly isomorphic to C<.map>:
168
168
foo VALUES { ... }
169
169
VALUES.map( { ... } } # same thing
170
170
171
- This even extends to the case where the thing being iterated is
172
- an itemizing container holding an C<Iterable>:
171
+ This isomorphism even extends to the case where the thing being iterated
172
+ is an itemizing container holding an C<Iterable>:
173
173
174
174
my $s = <apple banana cherry date eggplant>;
175
175
for $s { .say } # five iterations
@@ -200,6 +200,9 @@ instead of a class.
200
200
Looping constructs ( C<while>, C<for>, C<until>, C<loop> ) will be able
201
201
to lazily return lists, as described in C<S04>.
202
202
203
+ Question: Is the special "least surprise" eager behavior of
204
+ for-as-a-last-(bare)-statement preserved?
205
+
203
206
=item *
204
207
205
208
Because of the above, the GLR will need to improve sink context handling...
@@ -231,6 +234,11 @@ of values into its surrounding list when it is encountered.
231
234
This new type would replace the pre-GLR meaning of C<Nil> and
232
235
the temporary C<Empty> type.
233
236
237
+ NOTE: The current implemented behavior of Nil in newest rakudos
238
+ is mostly post-GLR, though it still shows up in a few places where
239
+ it should not. "Pre-GLR behavior" refers to Nil disappearing
240
+ during list flattenning.
241
+
234
242
=back
235
243
236
244
=head1 AUTHORS
0 commit comments