summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorMichael G. Schwern <schwern@pobox.com>2002-07-20 09:49:58 -0400
committerhv <hv@crypt.org>2002-08-04 01:25:14 +0000
commit6a30edae98bf8af3a005d1111ac077997dd26f35 (patch)
tree93d84c9b3d9acac5b85e7ad6b5a7d8c9b1a123f0
parent78a7c709d4434f29685ba4f85f6441dc8f042e3f (diff)
downloadperl-6a30edae98bf8af3a005d1111ac077997dd26f35.tar.gz
Re: mention of "use sort" botched in perlfunc?
Message-id: <20020720174958.GL362@ool-18b93024.dyn.optonline.net> p4raw-id: //depot/perl@17672
-rw-r--r--pod/perlfunc.pod2
1 files changed, 1 insertions, 1 deletions
diff --git a/pod/perlfunc.pod b/pod/perlfunc.pod
index b7fcd52dc8..564f3b6ae3 100644
--- a/pod/perlfunc.pod
+++ b/pod/perlfunc.pod
@@ -4572,7 +4572,7 @@ the original quicksort was faster. 5.8 has a sort pragma for
limited control of the sort. Its rather blunt control of the
underlying algorithm may not persist into future perls, but the
ability to characterize the input or output in implementation
-independent ways quite probably will. See L</use>.
+independent ways quite probably will. See L<sort>.
Examples: