pop_heap (STL/CLR)

  • Article

Removes the largest element from the front of a heap to the next-to-last position in the range and then forms a new heap from the remaining elements.

template<class _RanIt> inline
    void pop_heap(_RanIt _First, _RanIt _Last);
template<class _RanIt, class _Pr> inline
    void pop_heap(_RanIt _First, _RanIt _Last, _Pr _Pred);

Remarks

This function behaves the same as the STL function pop_heap. For more information, see pop_heap.

Requirements

Header: <cliext/algorithm>

Namespace: cliext

See Also

Reference

algorithm (STL/CLR)