#include <debug/debug.h>
Go to the source code of this file.
Namespaces | |
namespace | std |
Functions | |
template<typename RandomAccessIterator> | |
void | std::push_heap (RandomAccessIterator first, RandomAccessIterator last) |
Push an element onto a heap. | |
template<typename RandomAccessIterator, typename Compare> | |
void | std::push_heap (RandomAccessIterator first, RandomAccessIterator last, Compare comp) |
Push an element onto a heap using comparison functor. | |
template<typename RandomAccessIterator> | |
void | std::pop_heap (RandomAccessIterator first, RandomAccessIterator last) |
Pop an element off a heap. | |
template<typename RandomAccessIterator, typename Compare> | |
void | std::pop_heap (RandomAccessIterator first, RandomAccessIterator last, Compare comp) |
Pop an element off a heap using comparison functor. | |
template<typename RandomAccessIterator> | |
void | std::make_heap (RandomAccessIterator first, RandomAccessIterator last) |
Construct a heap over a range. | |
template<typename RandomAccessIterator, typename Compare> | |
void | std::make_heap (RandomAccessIterator first, RandomAccessIterator last, Compare comp) |
Construct a heap over a range using comparison functor. | |
template<typename RandomAccessIterator> | |
void | std::sort_heap (RandomAccessIterator first, RandomAccessIterator last) |
Sort a heap. | |
template<typename RandomAccessIterator, typename Compare> | |
void | std::sort_heap (RandomAccessIterator first, RandomAccessIterator last, Compare comp) |
Sort a heap using comparison functor. |
Definition in file stl_heap.h.