std::is_heap

[]	Google. . , . , . ( . .)

`<algorithm>`
`template< class RandomIt > bool is_heap( RandomIt first, RandomIt last );`	(1)
`template< class RandomIt, class Compare > bool is_heap( RandomIt first, RandomIt last, Compare comp );`	(2)

, [first, last).

is_heap operator< , comp.

first, last		: the range of elements to examine Google. . .
comp		(.. , Compare), `true`, "", . : `bool cmp(const Type1 &a, const Type2 &b);` `noexcept` ( C++11) . `const&`, . ( `const`) `Type1` `Type2` ( , `Type1&` , `Type1`, `Type1` ( C++11)). `Type1` `Type2` , `RandomIt` .

- `RandomIt` `RandomAccessIterator`.

true ' , false .
:
true if the range is heap, false otherwise.
Google.
. .

first last

' [f,l), :
:
A heap is a range of elements [f,l) that has the following properties:
Google.
. .

*f
:
*f is the largest element in the range
Google.
. .
std::push_heap()
:
a new element can be added using std::push_heap()
Google.
. .
std::pop_heap()
:
the first element can be removed using std::pop_heap()
Google.
. .

, .

#include <iostream>
#include <algorithm>

int main()
{
    std::vector<int> v { 3, 1, 4, 1, 5, 9 };

    std::cout << "initially, v: ";
    for (auto i : v) std::cout << i << ' ';
    std::cout << '\n';

    if (!std::is_heap(v.begin(), v.end())) {
        std::cout << "making heap...\n";
        std::make_heap(v.begin(), v.end());
    }

    std::cout << "after make_heap, v: ";
    for (auto i : v) std::cout << i << ' ';
    std::cout << '\n';
}

:

initially, v: 3 1 4 1 5 9
making heap...
after make_heap, v: 9 5 4 1 1 3

.

is_heap_until

(C++11)

,
( ) []







(C++20)

(C++20)
(C++11)





(C++20)


/

(C++11)
(C++11)
(C++11)
(C++17)

cppreference.com

std::is_heap

.