| tsearch.3 (108037) | tsearch.3 (108087) |
|---|---|
| 1.\" $NetBSD$ 2.\" Copyright (c) 1997 Todd C. Miller <Todd.Miller@courtesan.com> 3.\" All rights reserved. 4.\" 5.\" Redistribution and use in source and binary forms, with or without 6.\" modification, are permitted provided that the following conditions 7.\" are met: 8.\" 1. Redistributions of source code must retain the above copyright --- 11 unchanged lines hidden (view full) --- 20.\" EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, 21.\" PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; 22.\" OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, 23.\" WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR 24.\" OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF 25.\" ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 26.\" 27.\" OpenBSD: tsearch.3,v 1.2 1998/06/21 22:13:49 millert Exp | 1.\" $NetBSD$ 2.\" Copyright (c) 1997 Todd C. Miller <Todd.Miller@courtesan.com> 3.\" All rights reserved. 4.\" 5.\" Redistribution and use in source and binary forms, with or without 6.\" modification, are permitted provided that the following conditions 7.\" are met: 8.\" 1. Redistributions of source code must retain the above copyright --- 11 unchanged lines hidden (view full) --- 20.\" EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, 21.\" PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; 22.\" OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, 23.\" WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR 24.\" OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF 25.\" ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 26.\" 27.\" OpenBSD: tsearch.3,v 1.2 1998/06/21 22:13:49 millert Exp |
| 28.\" $FreeBSD: head/lib/libc/stdlib/tsearch.3 108037 2002-12-18 12:45:11Z ru $ | 28.\" $FreeBSD: head/lib/libc/stdlib/tsearch.3 108087 2002-12-19 09:40:28Z ru $ |
| 29.\" 30.Dd June 15, 1997 31.Dt TSEARCH 3 32.Os 33.Sh NAME 34.Nm tsearch , tfind , tdelete , twalk 35.Nd manipulate binary search trees 36.Sh SYNOPSIS --- 55 unchanged lines hidden (view full) --- 92The 93.Fn twalk 94function 95walks the binary search tree rooted in 96.Fa root 97and calls the function 98.Fa action 99on each node. | 29.\" 30.Dd June 15, 1997 31.Dt TSEARCH 3 32.Os 33.Sh NAME 34.Nm tsearch , tfind , tdelete , twalk 35.Nd manipulate binary search trees 36.Sh SYNOPSIS --- 55 unchanged lines hidden (view full) --- 92The 93.Fn twalk 94function 95walks the binary search tree rooted in 96.Fa root 97and calls the function 98.Fa action 99on each node. |
| 100.Fa Action | 100The 101.Fa action 102function |
| 101is called with three arguments: a pointer to the current node, 102a value from the enum 103.Sy "typedef enum { preorder, postorder, endorder, leaf } VISIT;" 104specifying the traversal type, and a node level (where level 105zero is the root of the tree). 106.Sh SEE ALSO 107.Xr bsearch 3 , 108.Xr hsearch 3 , --- 20 unchanged lines hidden --- | 103is called with three arguments: a pointer to the current node, 104a value from the enum 105.Sy "typedef enum { preorder, postorder, endorder, leaf } VISIT;" 106specifying the traversal type, and a node level (where level 107zero is the root of the tree). 108.Sh SEE ALSO 109.Xr bsearch 3 , 110.Xr hsearch 3 , --- 20 unchanged lines hidden --- |