From a4336f357f9e30dffdfad4909b24bd2e82c096a2 Mon Sep 17 00:00:00 2001 From: aaron <> Date: Thu, 20 Apr 2000 13:50:03 +0000 Subject: Flesh out stdlib function man pages. --- src/lib/libc/stdlib/tsearch.3 | 8 +++++--- 1 file changed, 5 insertions(+), 3 deletions(-) (limited to 'src/lib/libc/stdlib/tsearch.3') diff --git a/src/lib/libc/stdlib/tsearch.3 b/src/lib/libc/stdlib/tsearch.3 index fa1d34afbb..72048a19fb 100644 --- a/src/lib/libc/stdlib/tsearch.3 +++ b/src/lib/libc/stdlib/tsearch.3 @@ -23,7 +23,7 @@ .\" OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF .\" ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. .\" -.\" $OpenBSD: tsearch.3,v 1.7 2000/02/25 07:53:09 deraadt Exp $ +.\" $OpenBSD: tsearch.3,v 1.8 2000/04/20 13:50:03 aaron Exp $ .\" .Dd June 15, 1997 .Dt TSEARCH 3 @@ -49,7 +49,8 @@ The and .Fn twalk functions manage binary search trees based on algorithms T and D -from Knuth (6.2.2). The comparison function passed in by +from Knuth (6.2.2). +The comparison function passed in by the user has the same style of return values as .Xr strcmp 3 . .Pp @@ -67,7 +68,8 @@ is identical to .Fn tfind except that if no match is found, .Fa key -is inserted into the tree and a pointer to it is returned. If +is inserted into the tree and a pointer to it is returned. +If .Fa rootp points to a null value a new binary search tree is created. .Pp -- cgit v1.2.3-55-g6feb