Lines Matching defs:child
78 * its right child C are rearranged so that the P instead becomes the left
79 * child of C. The left subtree of C is inherited as the new right subtree
599 /* rotation between parent and child preserves grandpa */
641 dnode_t *nil = dict_nil(dict), *child, *delparent = delete->parent;
671 * moving up its right child into its place.
674 child = next->right;
675 child->parent = nextparent;
678 nextparent->left = child;
681 nextparent->right = child;
708 child = (delete->left != nil) ? delete->left : delete->right;
710 child->parent = delparent = delete->parent;
713 delparent->left = child;
716 delparent->right = child;
735 while (child->color == dnode_black) {
736 parent = child->parent;
737 if (child == parent->left) {
750 child = parent;
766 } else { /* symmetric case: child == child->parent->right */
767 dict_assert(child == parent->right);
780 child = parent;
799 child->color = dnode_black;