167     Node *rotateLeft(Node *Lower, Node *Higher);
168     Node *rotateRight(Node *Lower, Node *Higher);
666 RangeTree::Node *RangeTree::rotateLeft(Node *Lower, Node *Higher) {  in rotateLeft()  argument
667   assert(Higher->Right == Lower);  in rotateLeft()
671   if (height(Lower->Left) > height(Lower->Right))  in rotateLeft()
672     Lower = rotateRight(Lower->Left, Lower);  in rotateLeft()
673   assert(height(Lower->Left) <= height(Lower->Right));  in rotateLeft()
674   Higher->Right = Lower->Left;  in rotateLeft()
676   Lower->Left = Higher;  in rotateLeft()
677   update(Lower);  in rotateLeft()
678   return Lower;  in rotateLeft()
681 RangeTree::Node *RangeTree::rotateRight(Node *Lower, Node *Higher) {  in rotateRight()  argument
682   assert(Higher->Left == Lower);  in rotateRight()
686   if (height(Lower->Left) < height(Lower->Right))  in rotateRight()
687     Lower = rotateLeft(Lower->Right, Lower);  in rotateRight()
688   assert(height(Lower->Left) >= height(Lower->Right));  in rotateRight()
689   Higher->Left = Lower->Right;  in rotateRight()
691   Lower->Right = Higher;  in rotateRight()
692   update(Lower);  in rotateRight()
693   return Lower;  in rotateRight()