Difference between revisions of "cpp/algorithm/is heap until"
m (Text replace - "{{complex}}" to "===Complexity===") |
m (Text replace - "{{example}}" to "===Example===") |
||
| Line 35: | Line 35: | ||
<!-- ======== --> | <!-- ======== --> | ||
| − | + | ===Example=== | |
{{example cpp | {{example cpp | ||
| | | | ||
Revision as of 17:56, 2 August 2011
Template:cpp/algorithm/sidebar Template:ddcl list begin <tr class="t-dsc-header">
<td><algorithm>
<td></td> <td></td> </tr> <tr class="t-dcl ">
<td >RandomAccessIterator is_heap_until( RandomAccessIterator first,
<td > (1) </td> <td > Template:mark c++0x feature </td> </tr> <tr class="t-dcl ">
<td >RandomAccessIterator is_heap_until( RandomAccessIterator first,
RandomAccessIterator last,
<td > (2) </td> <td > Template:mark c++0x feature </td> </tr> Template:ddcl list end
Examines the range [first, last) and finds the largest range beginning at first which is heap. The first version of the function uses Template:cpp to compare the elements, the second uses the given comparison function comp.
Contents |
Parameters
| first, last | - | the range of elements to examine |
| comp | - | comparison function object (i.e. an object that satisfies the requirements of Compare) which returns true if the first argument is less than the second. The signature of the comparison function should be equivalent to the following: bool cmp(const Type1& a, const Type2& b); While the signature does not need to have const&, the function must not modify the objects passed to it and must be able to accept all values of type (possibly const) |
Return value
The upper bound of the largest range beginning at first which is heap. That is, the last iterator {{tt|it}] for which range [first, it) is heap.
Complexity
linear in the distance between first and last
Example
Notes
A heap with respect to comp (max heap) is a random access range [first, last) that has the following properties:
- Given N as last - first, for all integer i where 0 < i < N, bool(comp(first[(i - 1) / 2], first[i])) is false.
- A new element can be added using std::push_heap, in 𝓞(log N) time.
- *first can be removed using std::pop_heap, in 𝓞(log N) time.
