![]() 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 top tsearch(), tfind(), twalk(), and tdelete() manage a binary search SYNOPSIS top #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 *restrict key, void **restrict 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, twalk_r, tdestroy - manage a Tsearch(3) Library Functions Manual tsearch(3) NAME top
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |