summaryrefslogtreecommitdiff
path: root/lib/libc/stdlib
diff options
context:
space:
mode:
authorlukem <lukem@NetBSD.org>1998-08-29 08:32:32 +0000
committerlukem <lukem@NetBSD.org>1998-08-29 08:32:32 +0000
commitce83c69e00a77ed28196913aa6cd4d90b18a5a40 (patch)
tree450c82d7051427c4a5591ae055ee20a914f89ff7 /lib/libc/stdlib
parented88a6f1032cd4c9cfba1c0bd934bbe6bff8fc05 (diff)
first pass at fixing up capitalization of function names and
arguments; ensure that each is correct with respect to the implementation, rather than being correct as per english.
Diffstat (limited to 'lib/libc/stdlib')
-rw-r--r--lib/libc/stdlib/exit.34
-rw-r--r--lib/libc/stdlib/qsort.312
2 files changed, 8 insertions, 8 deletions
diff --git a/lib/libc/stdlib/exit.3 b/lib/libc/stdlib/exit.3
index bcc138fb820..c00ce06cf13 100644
--- a/lib/libc/stdlib/exit.3
+++ b/lib/libc/stdlib/exit.3
@@ -1,4 +1,4 @@
-.\" $NetBSD: exit.3,v 1.5 1998/02/05 18:49:53 perry Exp $
+.\" $NetBSD: exit.3,v 1.6 1998/08/29 08:32:35 lukem Exp $
.\"
.\" Copyright (c) 1990, 1991, 1993
.\" The Regents of the University of California. All rights reserved.
@@ -50,7 +50,7 @@
.Ft void
.Fn exit "int status"
.Sh DESCRIPTION
-.Fn Exit
+.Fn exit
terminates a process.
.Pp
Before termination it performs the following functions in the
diff --git a/lib/libc/stdlib/qsort.3 b/lib/libc/stdlib/qsort.3
index e536684e96e..914ae750722 100644
--- a/lib/libc/stdlib/qsort.3
+++ b/lib/libc/stdlib/qsort.3
@@ -1,4 +1,4 @@
-.\" $NetBSD: qsort.3,v 1.6 1998/02/05 18:50:12 perry Exp $
+.\" $NetBSD: qsort.3,v 1.7 1998/08/29 08:32:35 lukem Exp $
.\"
.\" Copyright (c) 1990, 1991, 1993
.\" The Regents of the University of California. All rights reserved.
@@ -77,7 +77,7 @@ objects, the initial member of which is pointed to by
.Fa base .
The size of each object is specified by
.Fa size .
-.Fn Mergesort
+.Fn mergesort
behaves similarly, but
.Em requires
that
@@ -114,7 +114,7 @@ The
function is an implementation of C.A.R. Hoare's ``quicksort'' algorithm,
a variant of partition-exchange sorting; in particular, see D.E. Knuth's
Algorithm Q.
-.Fn Qsort
+.Fn qsort
takes O N lg N average time.
This implementation uses median selection to avoid its
O N**2 worst-case behavior.
@@ -123,7 +123,7 @@ The
.Fn heapsort
function is an implementation of J.W.J. William's ``heapsort'' algorithm,
a variant of selection sorting; in particular, see D.E. Knuth's Algorithm H.
-.Fn Heapsort
+.Fn heapsort
takes O N lg N worst-case time.
Its
.Em only
@@ -139,7 +139,7 @@ requires additional memory of size
.Fa nmemb *
.Fa size
bytes; it should be used only when space is not at a premium.
-.Fn Mergesort
+.Fn mergesort
is optimized for data with pre-existing order; its worst case
time is O N lg N; its best case is O N.
.Pp
@@ -181,7 +181,7 @@ argument to
is less than
.Dq "sizeof(void *) / 2" .
.It Bq Er ENOMEM
-.Fn Heapsort
+.Fn heapsort
or
.Fn mergesort
were unable to allocate memory.