Lines Matching refs:left
57 #define left dict_left
75 #define dict_root(D) ((D)->nilnode.left)
83 * Perform a ``left rotation'' adjustment on the tree. The given node P and
84 * its right child C are rearranged so that the P instead becomes the left
85 * child of C. The left subtree of C is inherited as the new right subtree
94 upper->right = lowleft = lower->left;
100 the sentinel nil node, and root->parent->left points back to root */
102 if (upper == upparent->left) {
103 upparent->left = lower;
109 lower->left = upper;
115 * the same procedure, but with left and right interchanged.
122 lower = upper->left;
123 upper->left = lowright = lower->right;
131 dict_assert (upper == upparent->left);
132 upparent->left = lower;
148 free_nodes(dict, node->left, nil);
190 * be computed recursively and compared for left and right siblings for
202 height_left = verify_redblack(nil, root->left);
209 if (root->left->color != dnode_black)
233 return 1 + verify_node_count(nil, root->left)
249 || verify_dict_has_node(nil, root->left, node)
272 new->nilnode.left = &new->nilnode;
320 dict->nilnode.left = &dict->nilnode;
349 dict->nilnode.left = &dict->nilnode;
370 dict->nilnode.left = &dict->nilnode;
386 dict->nilnode.left = &dict->nilnode;
412 /* nil->left is the root node; check that its parent pointer is nil */
413 if (nil->left->parent != nil)
432 int dict_similar(const dict_t *left, const dict_t *right)
434 if (left->compare != right->compare)
437 if (left->allocnode != right->allocnode)
440 if (left->freenode != right->freenode)
443 if (left->context != right->context)
446 if (left->dupes != right->dupes)
472 root = root->left;
481 root = root->left;
512 root = root->left;
518 root = root->left;
541 root = root->left;
587 where = where->left;
595 parent->left = node;
600 node->left = nil;
611 if (parent == grandpa->left) {
632 uncle = grandpa->left;
640 if (node == parent->left) {
686 if (delete->left != nil && delete->right != nil) {
693 dict_assert (next->left == nil);
703 if (nextparent->left == next) {
704 nextparent->left = child;
716 next->left = delete->left;
718 next->left->parent = next;
723 if (delparent->left == delete) {
724 delparent->left = next;
732 dict_assert (delete->left == nil || delete->right == nil);
734 child = (delete->left != nil) ? delete->left : delete->right;
738 if (delete == delparent->left) {
739 delparent->left = child;
748 delete->left = NULL;
763 if (child == parent->left) {
773 if (sister->left->color == dnode_black
779 dict_assert (sister->left->color == dnode_red);
780 sister->left->color = dnode_black;
794 sister = parent->left;
800 sister = parent->left;
804 && sister->left->color == dnode_black) {
808 if (sister->left->color == dnode_black) {
813 sister = parent->left;
817 sister->left->color = dnode_black;
867 dnode_t *nil = dict_nil(dict), *root = dict_root(dict), *left;
870 while ((left = root->left) != nil)
871 root = left;
894 * next key in the the left to right ordering. If the node has
901 dnode_t *nil = dict_nil(dict), *parent, *left;
905 while ((left = curr->left) != nil)
906 curr = left;
929 if (curr->left != nil) {
930 curr = curr->left;
938 while (parent != nil && curr == parent->left) {
994 new->left = NULL;
1004 dnode->left = NULL;
1035 return (dnode->parent && dnode->left && dnode->right);
1057 load->nilnode.left = &load->nilnode;
1078 dict_assert (dict->compare(nil->left->key, key) <= 0);
1080 dict_assert (dict->compare(nil->left->key, key) < 0);
1085 nil->right->left = newnode;
1087 newnode->left = nil;
1108 for (curr = loadnil->left; curr != loadnil; curr = next) {
1109 next = curr->left;
1130 curr->left = dictnil;
1143 curr->left = complete;
1204 leftnode->left = NULL; /* suppress assertion in dict_load_next */
1215 rightnode->left = NULL;
