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)())
void dictDeleteDict(Dict *dict)
void dictDelete(Dict *dict, DictNode *node)
DictNode * dictSearch(Dict *dict, DictKey key)
Dict * dictNewDict(void *frame, int(*leq)(void *frame, DictKey key1, DictKey key2))
DictNode * dictInsertBefore(Dict *dict, DictNode *node, DictKey key)
int(* leq)(void *frame, DictKey key1, DictKey key2)