Lines Matching refs:key
64 KDEL (node->key);
67 /* We use the "key" field to hold the "next" pointer. */
68 node->key = (splay_tree_key)pending;
83 /* active points to a node which has its key and value
88 KDEL (active->left->key);
90 active->left->key = (splay_tree_key)pending;
95 KDEL (active->right->key);
97 active->right->key = (splay_tree_key)pending;
102 active = (splay_tree_node)(temp->key);
136 /* Bottom up splay of key. */
139 splay_tree_splay (splay_tree sp, splay_tree_key key)
149 cmp1 = (*sp->comp) (key, n->key);
165 cmp2 = (*sp->comp) (key, c->key);
336 splay_tree_insert (splay_tree sp, splay_tree_key key, splay_tree_value value)
340 splay_tree_splay (sp, key);
343 comparison = (*sp->comp)(sp->root->key, key);
361 node->key = key;
388 splay_tree_remove (splay_tree sp, splay_tree_key key)
390 splay_tree_splay (sp, key);
392 if (sp->root && (*sp->comp) (sp->root->key, key) == 0)
428 splay_tree_lookup (splay_tree sp, splay_tree_key key)
430 splay_tree_splay (sp, key);
432 if (sp->root && (*sp->comp)(sp->root->key, key) == 0)
438 /* Return the node in SP with the greatest key. */
454 /* Return the node in SP with the smallest key. */
474 splay_tree_predecessor (splay_tree sp, splay_tree_key key)
485 splay_tree_splay (sp, key);
486 comparison = (*sp->comp)(sp->root->key, key);
505 splay_tree_successor (splay_tree sp, splay_tree_key key)
516 splay_tree_splay (sp, key);
517 comparison = (*sp->comp)(sp->root->key, key);