heap operations [Sorting Algorithms]

Functions
template<class RandomAccessRange >
void	make_heap (RandomAccessRange &range)
template<class RandomAccessIterator , class Compare >
void	make_heap (RandomAccessIterator first, RandomAccessIterator last, Compare comp)
template<class RandomAccessRange , class Compare >
void	make_heap (RandomAccessRange &range, Compare comp)
template<class RandomAccessIterator , class Compare >
void	pop_heap (RandomAccessIterator first, RandomAccessIterator last, Compare comp)
template<class RandomAccessRange >
void	pop_heap (RandomAccessRange &range)
template<class RandomAccessRange , class Compare >
void	pop_heap (RandomAccessRange &range, Compare comp)
template<class RandomAccessIterator , class Compare >
void	push_heap (RandomAccessIterator first, RandomAccessIterator last, Compare comp)
template<class RandomAccessRange >
void	push_heap (RandomAccessRange &range)
template<class RandomAccessRange , class Compare >
void	push_heap (RandomAccessRange &range, Compare comp)
template<class RandomAccessRange >
void	sort_heap (RandomAccessRange &range)
template<class RandomAccessRange , class Compare >
void	sort_heap (RandomAccessRange &range, Compare comp)
template<class RandomAccessIterator , class Compare >
void	sort_heap (RandomAccessIterator first, RandomAccessIterator last, Compare comp)

---

Detailed Description

See also:

• STL documentation for push_heap
• STL documentation for pop_heap
• STL documentation for make_heap
• STL documentation for sort_heap

---

Function Documentation

void adobe::make_heap

(

RandomAccessRange &

range )

heap implementation

Definition at line 108 of file heap.hpp.

void adobe::make_heap	(	RandomAccessIterator	first,
		RandomAccessIterator	last,
		Compare	comp
	)

heap implementation

Definition at line 119 of file heap.hpp.

void adobe::make_heap	(	RandomAccessRange &	range,
		Compare	comp
	)

heap implementation

Definition at line 130 of file heap.hpp.

void adobe::pop_heap	(	RandomAccessIterator	first,
		RandomAccessIterator	last,
		Compare	comp
	)

heap implementation

Definition at line 86 of file heap.hpp.

void adobe::pop_heap

(

RandomAccessRange &

range )

heap implementation

Definition at line 75 of file heap.hpp.

void adobe::pop_heap	(	RandomAccessRange &	range,
		Compare	comp
	)

heap implementation

Definition at line 97 of file heap.hpp.

void adobe::push_heap	(	RandomAccessIterator	first,
		RandomAccessIterator	last,
		Compare	comp
	)

heap implementation

Definition at line 53 of file heap.hpp.

void adobe::push_heap

(

RandomAccessRange &

range )

heap implementation

Definition at line 42 of file heap.hpp.

void adobe::push_heap	(	RandomAccessRange &	range,
		Compare	comp
	)

heap implementation

Definition at line 64 of file heap.hpp.

void adobe::sort_heap

(

RandomAccessRange &

range )

heap implementation

Definition at line 141 of file heap.hpp.

void adobe::sort_heap	(	RandomAccessRange &	range,
		Compare	comp
	)

heap implementation

Definition at line 163 of file heap.hpp.

void adobe::sort_heap	(	RandomAccessIterator	first,
		RandomAccessIterator	last,
		Compare	comp
	)

heap implementation

Definition at line 152 of file heap.hpp.