is_heap_until()

#include <algorithm>

Ran is_heap_until (Ran first, Ran last) 
Ran is_heap_until (Ran first, Ran last, Binary comp) 
Ran is_heap_until (Exec pol, Ran first, Ran last) 
Ran is_heap_until (Exec pol, Ran first, Ran last, Binary comp) 
 
Ran ranges::is_heap_until (Range r, Binary comp = {}, Proj proj = {}) 
Ran ranges::is_heap_until (Ran first, Ran last, Binary comp = {}, Proj proj = {}) 

Liefert den Iterator auf das Ende des als Heap geordneten Teilbereiches von [first,last).

Rückgabewert: letzter Iterator i aus dem Bereich [first,last) mit std::is_heap(first, i) == true.

is_heap(), make_heap(), push_heap(), pop_heap(), sort_heap().

is_heap_until.cpp

#include <algorithm>
#include <iostream>
#include <vector>
 
int main()
{
  std::vector<int> v = { 7, 3, 2, 0, 1, 9, 4, 6, 5, 8 };
 
  auto i = std::is_heap_until(begin(v), end(v));
 
  std::vector<int> heap(begin(v), i);
	for(auto e : v) std::cout << e << " "; std::cout << '\n';
	for(auto e : heap) std::cout << e << " "; std::cout << '\n';
}