stl_heap.h File Reference

#include <debug/debug.h>

Go to the source code of this file.

Namespaces
namespace	std
Defines
#define	_STL_HEAP_H   1
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 _Tp>
void	std::__push_heap (_RandomAccessIterator __first, _Distance __holeIndex, _Distance __topIndex, _Tp __value)
template<typename _RandomAccessIterator>
void	std::push_heap (_RandomAccessIterator __first, _RandomAccessIterator __last)
	Push an element onto a heap.
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, 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 _Tp>
void	std::__adjust_heap (_RandomAccessIterator __first, _Distance __holeIndex, _Distance __len, _Tp __value)
template<typename _RandomAccessIterator, typename _Tp>
void	std::__pop_heap (_RandomAccessIterator __first, _RandomAccessIterator __last, _RandomAccessIterator __result, _Tp __value)
template<typename _RandomAccessIterator>
void	std::pop_heap (_RandomAccessIterator __first, _RandomAccessIterator __last)
	Pop an element off a heap.
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 _Tp, typename _Compare>
void	std::__pop_heap (_RandomAccessIterator __first, _RandomAccessIterator __last, _RandomAccessIterator __result, _Tp __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.

---

Define Documentation

#define _STL_HEAP_H   1

Definition at line 61 of file stl_heap.h.

---