stl_heap.h File Reference

#include <debug/debug.h>

Include dependency graph for stl_heap.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Namespaces

namespace  std

Defines

#define STLHEAPH

Functions

template<typename RandomAccessIterator, typename Distance>
bool std::__is_heap (RandomAccessIterator first, Distance n)
template<typename RandomAccessIterator, typename Distance, typename StrictWeakOrdering>
bool std::__is_heap (RandomAccessIterator first, StrictWeakOrdering comp, Distance n)
template<typename RandomAccessIterator>
bool std::__is_heap (RandomAccessIterator first, RandomAccessIterator last)
template<typename RandomAccessIterator, typename StrictWeakOrdering>
bool std::__is_heap (RandomAccessIterator first, RandomAccessIterator last, StrictWeakOrdering comp)
template<typename RandomAccessIterator, typename Distance, typename Type>
void std::__push_heap (RandomAccessIterator first, Distance __holeIndex, Distance __topIndex, Type value)
template<typename RandomAccessIterator>
void std::push_heap (RandomAccessIterator first, RandomAccessIterator last)
 Push an element onto a heap.
template<typename RandomAccessIterator, typename Distance, typename Type, typename Compare>
void std::__push_heap (RandomAccessIterator first, Distance __holeIndex, Distance __topIndex, Type value, Compare comp)
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, typename Distance, typename Type>
void std::adjust_heap (RandomAccessIterator first, Distance __holeIndex, Distance __len, Type value)
template<typename RandomAccessIterator, typename Type>
void std::__pop_heap (RandomAccessIterator first, RandomAccessIterator last, RandomAccessIterator __result, Type value)
template<typename RandomAccessIterator>
void std::pop_heap (RandomAccessIterator first, RandomAccessIterator last)
 Pop an element off a heap.
template<typename RandomAccessIterator, typename Distance, typename Type, typename Compare>
void std::adjust_heap (RandomAccessIterator first, Distance __holeIndex, Distance __len, Type value, Compare comp)
template<typename RandomAccessIterator, typename Type, typename Compare>
void std::__pop_heap (RandomAccessIterator first, RandomAccessIterator last, RandomAccessIterator __result, Type value, Compare comp)
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.


Detailed Description

This is an internal header file, included by other library headers. You should not attempt to use it directly.

Definition in file stl_heap.h.


Generated on Wed Oct 3 06:17:16 2007 for libstdc++-v3 Source by  doxygen 1.5.3