Lines Matching refs:key
55 #define key dict_key
150 * dict_next() successor function, verifying that the key of each node is
164 if (dict->compare(first->key, next->key) > 0)
170 if (dict->compare(first->key, next->key) >= 0)
448 * Locate a node in the dictionary having the given key.
454 dnode_t *dict_lookup(dict_t *dict, const void *key)
464 result = dict->compare(key, root->key);
476 while (root != nil && dict->compare(key, root->key))
489 * Look for the node corresponding to the lowest key that is equal to or
490 * greater than the given key. If there is no such node, return null.
493 dnode_t *dict_lower_bound(dict_t *dict, const void *key)
500 int result = dict->compare(key, root->key);
521 * Look for the node corresponding to the greatest key that is equal to or
522 * lower than the given key. If there is no such node, return null.
525 dnode_t *dict_upper_bound(dict_t *dict, const void *key)
532 int result = dict->compare(key, root->key);
561 void dict_insert(dict_t *dict, dnode_t *node, const void *key)
567 node->key = key;
577 result = dict->compare(key, where->key);
578 /* trap attempts at duplicate key insertion unless it's explicitly allowed */
671 * we avoid the traditional algorithm under which the successor's key and
834 int dict_alloc_insert(dict_t *dict, const void *key, void *data)
840 dict_insert(dict, node, key);
855 * Return the node with the lowest (leftmost) key. If the dictionary is empty
871 * Return the node with the highest (rightmost) key. If the dictionary is empty
888 * next key in the the left to right ordering. If the node has
915 * Return the given node's predecessor, in the key order.
1016 return dnode->key;
1057 void dict_load_next(dict_load_t *load, dnode_t *newnode, const void *key)
1068 assert (dict->compare(nil->left->key, key) <= 0);
1070 assert (dict->compare(nil->left->key, key) < 0);
1074 newnode->key = key;
1177 if (dest->compare(leftnode->key, rightnode->key) < 0)
1196 dict_load_next(&load, leftnode, leftnode->key);
1207 dict_load_next(&load, rightnode, rightnode->key);
1292 const char *key;
1296 "a <key> <val> add new entry\n";
1326 key = dupstring(tok1);
1330 if (!key || !val || !dn) {
1332 free((void *) key);
1338 dict_load_next(&dl, dn, key);
1358 const char *key;
1361 "a <key> <val> add value to dictionary\n"
1362 "d <key> delete value from dictionary\n"
1363 "l <key> lookup value in dictionary\n"
1364 "( <key> lookup lower bound\n"
1365 ") <key> lookup upper bound\n"
1397 key = dupstring(tok1);
1400 if (!key || !val) {
1402 free((void *) key);
1406 if (!dict_alloc_insert(d, key, val)) {
1408 free((void *) key);
1424 key = dnode_getkey(dn);
1428 free((void *) key);