tsearch.3: Reformat twalk() and twalk_r() prototypes for easier readability

Signed-off-by: Michael Kerrisk <mtk.manpages@gmail.com>
This commit is contained in:
Michael Kerrisk 2019-05-04 17:48:45 -05:00
parent 9794feed8f
commit befe2896c9
1 changed files with 7 additions and 5 deletions

View File

@ -40,15 +40,17 @@ tsearch, tfind, tdelete, twalk, tdestroy \- manage a binary search tree
.BI "void *tdelete(const void *" key ", void **" rootp ,
.BI " int (*" compar ")(const void *, const void *));"
.PP
.BI "void twalk(const void *" root ", void (*" action ")(const void *" nodep ,
.BI " VISIT " which ", int " depth "));"
.BI "void twalk(const void *" root ,
.BI " void (*" action ")(const void *" nodep ", VISIT " which ,
.BI " int " depth "));"
.PP
.BR "#define _GNU_SOURCE" " /* See feature_test_macros(7) */"
.B #include <search.h>
.PP
.BI "void twalk_r(const void *" root ", void (*" action ")(const void *" np ,
.BI " VISIT " which ", void *" closure "),
.BI " void *" closure );
.BI "void twalk_r(const void *" root ,
.BI " void (*" action ")(const void *" np ", VISIT " which ,
.BI " void *" closure "),
.BI " void *" closure );
.PP
.BI "void tdestroy(void *" root ", void (*" free_node ")(void *" nodep ));
.fi