46 if (dict == NULL)
return NULL;
65 for( node = dict->
head.
next; node != &dict->
head; node = next ) {
79 }
while( node->
key != NULL && ! (*dict->
leq)(dict->
frame, node->
key, key));
82 if (newNode == NULL)
return NULL;
109 }
while( node->
key != NULL && ! (*dict->
leq)(dict->
frame, key, node->
key));
typedef void((*Func_t)())
#define dictDeleteDict(dict)
#define dictSearch(dict, key)
#define dictDelete(dict, node)
#define dictInsertBefore(dict, node, key)
#define dictNewDict(frame, leq)
int(* leq)(void *frame, DictKey key1, DictKey key2)