Lines Matching refs:Void_t
55 extern Void_t* dtfinger(Dt_t*);
63 Void_t* key;
68 int(* comparf)_ARG_((const Void_t*, const Void_t*));
86 return (*((Treedisc_t*)disc)->comparf)((Void_t*)one,(Void_t*)two);
103 Void_t* tsearch(const Void_t* key, Void_t** rootp,
104 int(*comparf)(const Void_t*,const Void_t*) )
106 Void_t* tsearch(key, rootp, comparf)
107 Void_t* key;
108 Void_t** rootp;
117 return NIL(Void_t*);
124 return NIL(Void_t*);
125 o->key = (Void_t*)key;
130 *rootp = (Void_t*)dt;
131 else if(*rootp == NIL(Void_t*) )
134 return (Void_t*)(&o->key);
139 Void_t* tfind(const Void_t* key, Void_t*const* rootp,
140 int(*comparf)(const Void_t*, const Void_t*) )
142 Void_t* tfind(key, rootp, comparf)
143 Void_t* key;
144 Void_t** rootp;
152 return NIL(Void_t*);
155 return (o = (Tree_t*)dtmatch(dt,key)) ? (Void_t*)(&o->key) : NIL(Void_t*);
165 Void_t* tdelete(const Void_t* key, Void_t** rootp,
166 int(*comparf)(const Void_t*, const Void_t*) )
168 Void_t* tdelete(key, rootp, comparf)
169 Void_t* key;
170 Void_t** rootp;
179 return NIL(Void_t*);
183 obj.key = (Void_t*)key;
188 *rootp = NIL(Void_t*);
191 return o ? (Void_t*)(&o->key) : NIL(Void_t*);
201 static void _twalk(Tree_t* obj, void(*action)(const Void_t*,VISIT,int), int level)
209 (*action)((Void_t*)obj,leaf,level);
211 { (*action)((Void_t*)obj,preorder,level);
214 (*action)((Void_t*)obj,postorder,level);
217 (*action)((Void_t*)obj,endorder,level);
227 void twalk(const Void_t* root, void(*action)(const Void_t*,VISIT,int) )
230 Void_t* root;