icon Top 9 categories map      RocketAware > man pages >


Tips: Browse or Search all pages for efficient awareness of more than 6000 of the most popular reusable and open source applications, functions, libraries, and FAQs.

The "RKT couplings" below include links to source code, updates, additional information, advice, FAQs, and overviews.


Search all pages


By activity
Professions, Sciences, Humanities, Business, ...

User Interface
Text-based, GUI, Audio, Video, Keyboards, Mouse, Images,...

Text Strings
Conversions, tests, processing, manipulation,...

Integer, Floating point, Matrix, Statistics, Boolean, ...

Algorithms, Memory, Process control, Debugging, ...

Stored Data
Data storage, Integrity, Encryption, Compression, ...

Networks, protocols, Interprocess, Remote, Client Server, ...

Hard World
Timing, Calendar and Clock, Audio, Video, Printer, Controls...

File System
Management, Filtering, File & Directory access, Viewers, ...


RocketLink!--> Man page versions: OpenBSD RedHat

TSEARCH(3)                OpenBSD Programmer's Manual               TSEARCH(3)

     tsearch, tfind, tdelete, twalk - manipulate binary search trees

     #include <search.h>

     void *
     tdelete(const void *key, void **rootp),int (*compar) (const void *, const
             void *)

     void *
     tfind(const void *key, void * const *rootp),int (*compar) (const void *,
             const void *)

     void *
     tsearch(const void *key, void **rootp),int (*compar) (const void *, const
             void *)

     twalk(const void *root, void (*compar) (const void *, VISIT, int));

     The tdelete(), tfind(), tsearch(), and twalk() functions manage binary
     search trees based on algorithms T and D from Knuth (6.2.2).  The compar-
     ison function passed in by the user has the same style of return values
     as strcmp(3).

     tfind() searches for the datum matched by the argument key in the binary
     tree rooted at rootp, returning a pointer to the datum if it is found and
     NULL if it is not.

     tsearch() is identical to tfind() except that if no match is found, key
     is inserted into the tree and a pointer to it is returned.  If rootp
     points to a null value a new binary search tree is created.

     tdelete() deletes a node from the specified binary search tree and re-
     turns a pointer to the parent of the node to be deleted.  It takes the
     same arguments as tfind() and tsearch().  If the node to be deleted is
     the root of the binary search tree, rootp will be adjusted.

     twalk() walks the binary search tree rooted in root and calls the func-
     tion action on each node.  action is called with three arguments: a
     pointer to the current node, a value from the enum typedef enum {
     preorder, postorder, endorder, leaf } VISIT; specifying the traversal
     type, and a node level (where level zero is the root of the tree).

     bsearch(3),  lsearch(3)

     The tsearch() function returns NULL if allocation of a new node fails
     (usually due to a lack of free memory).

     tfind(), tsearch(), and tdelete() return NULL if rootp is NULL or the da-
     tum cannot be found.

     The twalk() function returns no value.

OpenBSD 2.6                      June 15, 1997                               1

Source: OpenBSD 2.6 man pages. Copyright: Portions are copyrighted by BERKELEY
SOFTWARE DESIGN, INC., The Regents of the University of California, Massachusetts
Institute of Technology, Free Software Foundation, FreeBSD Inc., and others.

(Corrections, notes, and links courtesy of RocketAware.com)

[Detailed Topics]
OpenBSD sources for tsearch(3)

[Overview Topics]

Up to: Trees and Graphs - Data structures implementing Trees and Graphs. (Each element references 0 or more other elements)

RocketLink!--> Man page versions: OpenBSD RedHat

Rapid-Links: Search | About | Comments | Submit Path: RocketAware > man pages > tsearch.3/
RocketAware.com is a service of Mib Software
Copyright 1999, Forrest J. Cavalier III. All Rights Reserved.
We welcome submissions and comments