Method HeapifyFromTop

be/src/util/priority-queue.h:141–141

  // Heapify from top element at index 0 in O(log n) complexity. It is
  // assumed that the elements in [1, size_-1] are already arranged as a heap.
  void IR_ALWAYS_INLINE HeapifyFromTop() { HeapifySubtreeDown(0, Size()); }

 protected:
  // Move up elements starting at index i to maintain the heap property.