Distribute new `hash' module.

[mLib] / man / str.3

diff --git a/man/str.3 b/man/str.3
index 16e859d7ce34b69281b6f59f06798d629805464e..4ac61d194a9fdb3117e0557942a78b22b5d75eca 100644 (file)
--- a/man/str.3
+++ b/man/str.3
@@ -11,9 +11,12 @@
 .sp 1
 .fi
 ..
-.TH str 3mLib "20 June 1999" mLib
+.TH str 3 "20 June 1999" mLib
 .SH NAME
 str \- small string utilities
+.\" @str_getword
+.\" @str_split
+.\" @str_sanitize
 .SH SYNOPSIS
 .nf
 .B "#include <mLib/str.h>"
@@ -60,7 +63,7 @@ and so on.  If there aren't enough words in the string, the remaining
 array elements are filled with null pointers.
 .TP
 .I c
-The maxmimum number of words to extract; also, the number of elements in
+The maximum number of words to extract; also, the number of elements in
 the array
 .IR v .
 .TP
@@ -132,5 +135,7 @@ will have the same values as last time, and
 and
 .B rest
 will be null.
+.SH "SEE ALSO"
+.BR mLib (3).
 .SH AUTHOR
 Mark Wooding, <mdw@nsict.org>