aboutsummaryrefslogtreecommitdiff
path: root/lib/libc/stdlib/radixsort.3
diff options
context:
space:
mode:
authorYaroslav Tykhiy <ytykhiy@gmail.com>2001-08-09 13:32:13 +0000
committerYaroslav Tykhiy <ytykhiy@gmail.com>2001-08-09 13:32:13 +0000
commitb1250632c5fc76d3b403ef995ee04bf5db2b8493 (patch)
tree251e4417acf32d993acd2d301d7ead7122c562cf /lib/libc/stdlib/radixsort.3
parent91ce3c5b858af828f30bf79525f7e4560f33d2f9 (diff)
Notes
Diffstat (limited to 'lib/libc/stdlib/radixsort.3')
-rw-r--r--lib/libc/stdlib/radixsort.35
1 files changed, 1 insertions, 4 deletions
diff --git a/lib/libc/stdlib/radixsort.3 b/lib/libc/stdlib/radixsort.3
index 90a52c66aa56..04b2007a4533 100644
--- a/lib/libc/stdlib/radixsort.3
+++ b/lib/libc/stdlib/radixsort.3
@@ -108,10 +108,7 @@ These functions are variants of most-significant-byte radix sorting; in
particular, see D.E. Knuth's Algorithm R and section 5.2.5, exercise 10.
They take linear time relative to the number of bytes in the strings.
.Sh RETURN VALUES
-Upon successful completion 0 is returned.
-Otherwise, \-1 is returned and the global variable
-.Va errno
-is set to indicate the error.
+.Rv -std radixsort
.Sh ERRORS
.Bl -tag -width Er
.It Bq Er EINVAL