stl_heap.h File Reference

Go to the source code of this file.

Namespaces
	std

Functions
template<typename _RandomAccessIterator , typename _Distance , typename _Tp >
void	std::__adjust_heap (_RandomAccessIterator __first, _Distance __holeIndex, _Distance __len, _Tp __value)
template<typename _RandomAccessIterator , typename _Distance , typename _Tp , typename _Compare >
void	std::__adjust_heap (_RandomAccessIterator __first, _Distance __holeIndex, _Distance __len, _Tp __value, _Compare __comp)
template<typename _RandomAccessIterator , typename _Distance >
bool	std::__is_heap (_RandomAccessIterator __first, _Distance __n)
template<typename _RandomAccessIterator , typename _Compare , typename _Distance >
bool	std::__is_heap (_RandomAccessIterator __first, _Compare __comp, _Distance __n)
template<typename _RandomAccessIterator >
bool	std::__is_heap (_RandomAccessIterator __first, _RandomAccessIterator __last)
template<typename _RandomAccessIterator , typename _Compare >
bool	std::__is_heap (_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
template<typename _RandomAccessIterator , typename _Distance >
_Distance	std::__is_heap_until (_RandomAccessIterator __first, _Distance __n)
template<typename _RandomAccessIterator , typename _Distance , typename _Compare >
_Distance	std::__is_heap_until (_RandomAccessIterator __first, _Distance __n, _Compare __comp)
template<typename _RandomAccessIterator >
void	std::__pop_heap (_RandomAccessIterator __first, _RandomAccessIterator __last, _RandomAccessIterator __result)
template<typename _RandomAccessIterator , typename _Compare >
void	std::__pop_heap (_RandomAccessIterator __first, _RandomAccessIterator __last, _RandomAccessIterator __result, _Compare __comp)
template<typename _RandomAccessIterator , typename _Distance , typename _Tp >
void	std::__push_heap (_RandomAccessIterator __first, _Distance __holeIndex, _Distance __topIndex, _Tp __value)
template<typename _RandomAccessIterator , typename _Distance , typename _Tp , typename _Compare >
void	std::__push_heap (_RandomAccessIterator __first, _Distance __holeIndex, _Distance __topIndex, _Tp __value, _Compare __comp)
template<typename _RandomAccessIterator >
bool	std::is_heap (_RandomAccessIterator __first, _RandomAccessIterator __last)
template<typename _RandomAccessIterator , typename _Compare >
bool	std::is_heap (_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
template<typename _RandomAccessIterator >
_RandomAccessIterator	std::is_heap_until (_RandomAccessIterator __first, _RandomAccessIterator __last)
template<typename _RandomAccessIterator , typename _Compare >
_RandomAccessIterator	std::is_heap_until (_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
template<typename _RandomAccessIterator >
void	std::make_heap (_RandomAccessIterator __first, _RandomAccessIterator __last)
template<typename _RandomAccessIterator , typename _Compare >
void	std::make_heap (_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
template<typename _RandomAccessIterator >
void	std::pop_heap (_RandomAccessIterator __first, _RandomAccessIterator __last)
template<typename _RandomAccessIterator , typename _Compare >
void	std::pop_heap (_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
template<typename _RandomAccessIterator >
void	std::push_heap (_RandomAccessIterator __first, _RandomAccessIterator __last)
template<typename _RandomAccessIterator , typename _Compare >
void	std::push_heap (_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
template<typename _RandomAccessIterator >
void	std::sort_heap (_RandomAccessIterator __first, _RandomAccessIterator __last)
template<typename _RandomAccessIterator , typename _Compare >
void	std::sort_heap (_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)

Detailed Description

This is an internal header file, included by other library headers. Do not attempt to use it directly. Instead, include <queue>.

Definition in file stl_heap.h.