521   size_type MoveHoleUpAndFill(size_type hole_pos, U element);
534   size_type MoveHoleDownAndFill(size_type hole_pos, U element);
920 void IntrusiveHeap<T, Compare, HeapHandleAccessor>::FillHole(size_type hole_pos,  in FillHole()  argument
924   DCHECK_LE(hole_pos, size());  in FillHole()
925   if (hole_pos == size()) {  in FillHole()
928     impl_.heap_[hole_pos] = std::move_if_noexcept(element);  in FillHole()
930   SetHeapHandle(hole_pos);  in FillHole()
956     size_type hole_pos,  in MoveHoleUpAndFill()  argument
960   DCHECK_LE(hole_pos, size());  in MoveHoleUpAndFill()
963   while (hole_pos != 0) {  in MoveHoleUpAndFill()
965     size_type parent = intrusive_heap::ParentIndex(hole_pos);  in MoveHoleUpAndFill()
969     MoveHole(parent, hole_pos);  in MoveHoleUpAndFill()
970     hole_pos = parent;  in MoveHoleUpAndFill()
973   FillHole(hole_pos, std::move_if_noexcept(element));  in MoveHoleUpAndFill()
974   return hole_pos;  in MoveHoleUpAndFill()
981     size_type hole_pos,  in MoveHoleDownAndFill()  argument
983   DCHECK_LT(hole_pos, size());  in MoveHoleDownAndFill()
989   DCHECK_LT(hole_pos, n);  in MoveHoleDownAndFill()
990   DCHECK(!GetHeapHandle(hole_pos).IsValid());  in MoveHoleDownAndFill()
994     size_type left = intrusive_heap::LeftIndex(hole_pos);  in MoveHoleDownAndFill()
1009     MoveHole(largest, hole_pos);  in MoveHoleDownAndFill()
1010     hole_pos = largest;  in MoveHoleDownAndFill()
1016     hole_pos = MoveHoleUpAndFill(hole_pos, std::move_if_noexcept(element));  in MoveHoleDownAndFill()
1018     FillHole(hole_pos, std::move_if_noexcept(element));  in MoveHoleDownAndFill()
1020   return hole_pos;  in MoveHoleDownAndFill()