1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
|
hi(pop_heap)
itemization(
it() Header file: tt(<algorithm>)
it() Function prototypes:
itemization(
itt(void pop_heap(RandomAccessIterator first,
RandomAccessIterator last);)
itt(void pop_heap(RandomAccessIterator first,
RandomAccessIterator last, Compare comp);)
)
it() Description:
itemization(
it() The first prototype: the first element in the range
rangett(first, last) is moved to tt(last - 1). Then, the elements in the range
rangett(first, last - 1) are reordered to form a max-heap using the
tt(operator<) of the data type to which the iterators point.
it() The second prototype: the first element in the range
rangett(first, last) is moved to tt(last - 1). Then, the elements in the range
rangett(first, last - 1) are reordered to form a max-heap using the binary
comparison function object tt(comp) to compare elements.
)
IFDEF(html)(
it() Follow this link for a small link(example)(HEAPDEMO) of a program
using tt(pop_heap).)()
)
|
