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;
85 newNode->next = node->next;
86 node->next->prev = newNode;
97 node->next->prev = node->prev;
98 node->prev->next = node->next;
109 }
while( node->key != NULL && ! (*dict->leq)(dict->frame, key, node->key));
#define dictDeleteDict(dict)
#define dictSearch(dict, key)
#define dictDelete(dict, node)
#define dictInsertBefore(dict, node, key)
#define dictNewDict(frame, leq)