is_heap()

#include <algorithm>

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

Prüft, ob der Bereich [first,last) als Heap geordnet ist.

Rückgabewert: true, wenn der Bereich [first, last) als Heap geordnet ist.

is_heap_until(), make_heap(), sort_heap().

is_heap.cpp

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