198       node = RightOf(node);  in ValueFromRank()
256     iter = right_child ? RightOf(iter) : LeftOf(iter);  in InsertNode()
278       if (RightOf(parent) == node) {  in InsertNode()
309   if (LeftOf(node) && RightOf(node)) {  in RemoveNode()
313     const uint32_t scapegoat = SizeOf(LeftOf(node)) >= SizeOf(RightOf(node))  in RemoveNode()
315                                    : LeftestDescendantOf(RightOf(node));  in RemoveNode()
325   assert(!RightOf(node) || !LeftOf(node));  in RemoveNode()
328   uint32_t child = RightOf(node) ? RightOf(node) : LeftOf(node);  in RemoveNode()
362         if (RightOf(parent) == node) {  in RemoveNode()
374             const uint32_t sibling = RightOf(parent);  in RemoveNode()
392   const uint32_t pivot = RightOf(node);  in RotateLeft()
397   if (RightOf(node)) MutableParentOf(RightOf(node)) = node;  in RotateLeft()
425   MutableLeftOf(node) = RightOf(pivot);  in RotateRight()
450   MutableSizeOf(node) = 1 + SizeOf(LeftOf(node)) + SizeOf(RightOf(node));  in UpdateNode()
452       1 + std::max(HeightOf(LeftOf(node)), HeightOf(RightOf(node)));  in UpdateNode()