X-Git-Url: http://git.shadowcat.co.uk/gitweb/gitweb.cgi?a=blobdiff_plain;f=pod%2Fperltodo.pod;h=5dbe882eb15be9c3acd8ad430bf3bdff39b90fa8;hb=7b667b5fb1c41f31aff1e46b9f74e36eb063010e;hp=6698b8da971e9292e426b16572683087636bead2;hpb=0c13e809ed4d404a11e0397efa6d6cb6bbb30d3e;p=p5sagit%2Fp5-mst-13.2.git

diff --git a/pod/perltodo.pod b/pod/perltodo.pod
index 6698b8d..5dbe882 100644
--- a/pod/perltodo.pod
+++ b/pod/perltodo.pod
@@ -27,6 +27,11 @@ it would be a good thing.
 
 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
@@ -139,7 +144,7 @@ Make the peephole optimizer optional.
 
 =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
@@ -179,11 +184,6 @@ Clean these up. Move them to mathom.c, and don't compile for blead?
 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