std::is_heap_until

Examines the range [first, last) and finds the largest range beginning at first which is a heap.

[edit] Parameters

[edit] Return value

The last iterator it for which range [first, it) is a heap.

[edit] Complexity

Given \(\scriptsize N\)N as std::distance (first, last):

[edit] Exceptions

The overloads with a template parameter named ExecutionPolicy report errors as follows:

• If execution of a function invoked as part of the algorithm throws an exception and ExecutionPolicy is one of the standard policies, std::terminate is called. For any other ExecutionPolicy, the behavior is implementation-defined.
• If the algorithm fails to allocate memory, std::bad_alloc is thrown.

[edit] Example

#include <algorithm>
#include <iostream>
#include <vector>
 
int main()
{
 std::vector <int> v{3, 1, 4, 1, 5, 9};
 
 std::make_heap (v.begin(), v.end());
 
 // probably mess up the heap
 v.push_back(2);
 v.push_back(6);
 
 auto heap_end = std::is_heap_until(v.begin(), v.end());
 
 std::cout << "all of v: ";
 for (const auto& i : v)
 std::cout << i << ' ';
 std::cout << '\n';
 
 std::cout << "only heap: ";
 for (auto i = v.begin(); i != heap_end; ++i)
 std::cout << *i << ' ';
 std::cout << '\n';
}

all of v: 9 5 4 1 1 3 2 6
only heap: 9 5 4 1 1 3 2

[edit] See also

• In other languages

• Deutsch
• Español
• Français
• Italiano
• 日本語
• Português
• Русский
• 中文