## push_heap
## Prototype
template <class RandomAccessIterator> void push_heap(RandomAccessIterator first, RandomAccessIterator last); template <class RandomAccessIterator, class StrictWeakOrdering> void push_heap(RandomAccessIterator first, RandomAccessIterator last, StrictWeakOrdering comp); ## Description
The two versions of ## DefinitionDefined in the standard header algorithm, and in the nonstandard backward-compatibility header algo.h. ## Requirements on typesFor the first version: -
`RandomAccessIterator` is a model of RandomAccessIterator. -
`RandomAccessIterator` is mutable. -
`RandomAccessIterator` 's value type is a model of LessThanComparable. -
The ordering on objects of
`RandomAccessIterator` 's value type is a*strict weak ordering*, as defined in the LessThanComparable requirements.
For the second version: -
`RandomAccessIterator` is a model of RandomAccessIterator. -
`RandomAccessIterator` is mutable. -
`StrictWeakOrdering` is a model of StrictWeakOrdering. -
`RandomAccessIterator` 's value type is convertible to`StrictWeakOrdering` 's argument type.
## PreconditionsFor the first version: -
`[first, last)` is a valid range. -
`[first, last - 1)` is a valid range. That is,`[first, last)` is nonempty. -
`[first, last - 1)` is a heap. That is,`is_heap(first, last - 1)` is`true` .
For the second version: -
`[first, last)` is a valid range. -
`[first, last - 1)` is a valid range. That is,`[first, last)` is nonempty. -
`[first, last)` is a heap. That is,`is_heap(first, last - 1, comp)` is`true` .
## ComplexityLogarithmic. At most ## Exampleint main() { int A[10] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9 }; make_heap(A, A + 9); cout << "[A, A + 9) = "; copy(A, A + 9, ostream_iterator<int>(cout, " ")); push_heap(A, A + 10); cout << endl << "[A, A + 10) = "; copy(A, A + 10, ostream_iterator<int>(cout, " ")); cout << endl; } The output is [A, A + 9) = 8 7 6 3 4 5 2 1 0 [A, A + 10) = 9 8 6 3 7 5 2 1 0 4 ## Notes[1] A heap is a particular way of ordering the elements in a range of RandomAccessIterator ## See also |