Lines Matching refs:Void_t
61 Void_t* key;
66 int(* comparf)_ARG_((const Void_t*, const Void_t*));
84 return (*((Treedisc_t*)disc)->comparf)((Void_t*)one,(Void_t*)two);
101 Void_t* tsearch(const Void_t* key, Void_t** rootp,
102 int(*comparf)(const Void_t*,const Void_t*) )
104 Void_t* tsearch(key, rootp, comparf)
105 Void_t* key;
106 Void_t** rootp;
115 return NIL(Void_t*);
122 return NIL(Void_t*);
123 o->key = (Void_t*)key;
128 *rootp = (Void_t*)dt;
129 else if(*rootp == NIL(Void_t*) )
132 return (Void_t*)(&o->key);
137 Void_t* tfind(const Void_t* key, Void_t*const* rootp,
138 int(*comparf)(const Void_t*, const Void_t*) )
140 Void_t* tfind(key, rootp, comparf)
141 Void_t* key;
142 Void_t** rootp;
150 return NIL(Void_t*);
153 return (o = (Tree_t*)dtmatch(dt,key)) ? (Void_t*)(&o->key) : NIL(Void_t*);
163 Void_t* tdelete(const Void_t* key, Void_t** rootp,
164 int(*comparf)(const Void_t*, const Void_t*) )
166 Void_t* tdelete(key, rootp, comparf)
167 Void_t* key;
168 Void_t** rootp;
177 return NIL(Void_t*);
181 obj.key = (Void_t*)key;
186 *rootp = NIL(Void_t*);
189 return o ? (Void_t*)(&o->key) : NIL(Void_t*);
199 static void _twalk(Tree_t* obj, void(*action)(const Void_t*,VISIT,int), int level)
207 (*action)((Void_t*)obj,leaf,level);
209 { (*action)((Void_t*)obj,preorder,level);
212 (*action)((Void_t*)obj,postorder,level);
215 (*action)((Void_t*)obj,endorder,level);
225 void twalk(const Void_t* root, void(*action)(const Void_t*,VISIT,int) )
228 Void_t* root;