Method sort

include/priority_queue.h:391–400

Sorts the elements of the priority queue according to the strict partial ordering defined by the object of type Less passed to the priority queue. The heap property of the priority queue is invalidated by this operation. */

    operation.
  */
  void sort() {
    if (!m_container.empty()) {
      for (size_type i = m_container.size() - 1; i > 0; --i) {
        std::swap(m_container[i], m_container[0]);
        m_marker(i, &m_container[i]);
        m_marker(0, &m_container[0]);
        heapify(0, i);
      }
    }
  }

  /// Clears the priority queue.
  void clear() { m_container.clear(); }