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
26
27
|
hi(push_heap)
itemization(
it() Header file: tt(<algorithm>)
it() Function prototypes:
itemization(
itt(void push_heap(RandomAccessIterator first,
RandomAccessIterator last);)
itt(void push_heap+OPENPARRandomAccessIterator first,
RandomAccessIterator last,)linebreak()tt(Compare comp+CLOSEPAR;)
)
it() Description:
itemization(
it() The first prototype: assuming that the range rangett(first,
last - 2) contains a valid heap, and the element at tt(last - 1) contains an
element to be added to the heap, 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: assuming that the range rangett(first,
last - 2) contains a valid heap, and the element at tt(last - 1) contains an
element to be added to the heap, 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(push_heap).)()
)
|
