summaryrefslogtreecommitdiff
path: root/pod/perltodo.pod
diff options
context:
space:
mode:
authorNicholas Clark <nick@ccl4.org>2004-07-13 19:10:20 +0000
committerNicholas Clark <nick@ccl4.org>2004-07-13 19:10:20 +0000
commit60cb11a8de37fb2d6b164364e3bb7cdc6724a2c4 (patch)
tree8333356909a266d69ddc446699c4dec525d3d84c /pod/perltodo.pod
parent471178c043790ed006373ae69f9589278aca3fbf (diff)
downloadperl-60cb11a8de37fb2d6b164364e3bb7cdc6724a2c4.tar.gz
s/sort/split/; - my mistake spotted by Dave.
p4raw-id: //depot/perl@23103
Diffstat (limited to 'pod/perltodo.pod')
-rw-r--r--pod/perltodo.pod2
1 files changed, 1 insertions, 1 deletions
diff --git a/pod/perltodo.pod b/pod/perltodo.pod
index 6698b8da97..db7274c23f 100644
--- a/pod/perltodo.pod
+++ b/pod/perltodo.pod
@@ -139,7 +139,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