Standard C++ Library Class Reference

Click on the banner to return to the Class Reference home page.

pop_heap

Algorithms

Summary

Moves the largest element off the heap.

Contents

Synopsis●

Description●

Complexity●

Example●

Warning●

See Also●

Synopsis

template <class RandomAccessIterator>

void

pop_heap(RandomAccessIterator first,

RandomAccessIterator last);

template <class RandomAccessIterator, class Compare>

void

pop_heap(RandomAccessIterator first,

RandomAccessIterator last, Compare comp);

Description

A heap is a particular organization of elements in a range between two random access iterators

[a, b). Its two key properties are: