template<class RandomAccessIterator>
void pop_heap(RandomAccessIterator first, RandomAccessIterator last);
template<class RandomAccessIterator, class Compare>
void pop_heap(RandomAccessIterator first, RandomAccessIterator last,
Compare comp);
Requires:
The range
[first, last)
shall be a valid non-empty heap
. The type
of
*first shall satisfy the requirements of
MoveConstructible (Table
23) and of
MoveAssignable (Table
25)
.Effects:
Swaps the value in the location
first
with the value in the location
last - 1
and makes
[first, last - 1)
into a heap
. Complexity:
At most
comparisons
.