Fix (or rewrite) the implementation of the C</(?{...})/> closures.
+=head1 A re-entrant regexp engine
+
+This will allow the use of a regex from inside (?{ }), (??{ }) and
+(?(?{ })|) constructs.
+
=head1 pragmata
=head2 lexical pragmas
=head2 You WANT *how* many
-Currently contexts are void, scalar and list. sort has a special mechanism in
+Currently contexts are void, scalar and list. split has a special mechanism in
place to pass in the number of return values wanted. It would be useful to
have a general mechanism for this, backwards compatible and little speed hit.
This would allow proposals such as short circuiting sort to be implemented
The old perltodo notes "This has been done in places, but needs a thorough
code review. Also fchdir is available in some platforms."
-=head2 foreach reverse
-
-The old perltodo notes that we could optimise foreach to iterate in reverse.
-(instead of making a reversed copy on the stack)
-
=head1 Tests
=head2 Make Schwern poorer