Is tsearch safe manual#

Returns a pointer to the parent of the node deleted, or The item whose node is returned is unspecified. If there are multiple items that match the key, The newly added node, or NULL if there was insufficient memory Returns a pointer to a matching node in the tree, or to The pointer to the data is passed as the argument to the function. The callback function in a thread-safe fashion, without resortingДЇor the data in each tree node the function This pointer can be used to pass information to and from The third argument is the depth of the node Д«efore visiting the children, after the first and before the second,ДЄrgument pointer is passed to each invocation of the action callback, If this is the single visit to a leaf node. The application must not modify the structure pointed to by this argument.Дepending on whether this is the first, second, or In order to access the element stored within the node. The structure of the node is unspecified,Д«ut it is possible to cast the pointer to a pointer-to-pointer-to-element The first argument is a pointer to the node being visited. Visited (that is, three times for an internal node, and once for a If that node is not the root, then only part of the tree will be visited. Points to the starting node for the traversal. Performs depth-first, left-to-right traversal of a binary Returns a pointer to a pointer to the data item.) Points to a variable which points to the root of the tree. Zero, or positive, depending on whether the first item is less than, It should return an integer which is negative, Points to a comparison routine, which takes (The calling program must store the actual data.) The first field in each node of the tree is a pointer to the They are generalized from Knuth (6.2.2) Algorithm T. #include void twalk_r(const void * root, void (* action )(const void * nodep, VISIT which, void * closure ), void * closure ) void tdestroy(void * root, void (* free_node )(void * nodep )) DESCRIPTION tsearch(), SYNOPSIS #include typedef enum VISIT void *tsearch(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 *tdelete(const void * key, void ** rootp, int (* compar )(const void *, const void *)) void twalk(const void * root, void (* action )(const void * nodep, VISIT which, int depth )) #define _GNU_SOURCE /* See feature_test_macros(7) */ Tsearch, tfind, tdelete, twalk, tdestroy - manage a binary search tree

Is tsearch safe manual#

Command to display tsearch manual in Linux: $ man 3 tsearch NAME