Method Push

be/src/util/priority-queue.h:112–118

  // Add a new element to the end of the array and then heapify. This is an
  // O(log n) operation.
  void IR_ALWAYS_INLINE Push(const T& v) {
    // Insert the new element v at the end.
    elements_.emplace_back(v);
    // Move up the new element and its ancestors if necessary (all the way to the
    // element at index 0) to maintain the heap property.
    HeapifySubtreeUp(0, Size() - 1);
  }

  // Remove the top element from the priority queue and then heapify affected
  // elements. This is an O(log n) operation. Must not be called when the queue