std::is_heap_until – cppreference.com

Aus cppreference.com

definiert in Header `<algorithm>`

`template< class RandomIt > RandomIt is_heap_until( RandomIt first, RandomIt last );`	(1)	(seit C++11)

`template< class RandomIt, class Compare > RandomIt is_heap_until( RandomIt first, RandomIt last, Compare comp );`	(2)	(seit C++11)

Untersucht den Bereich [first, last) und findet die größte Funktionsvielfalt Anfang an first die Haufen ist. Die erste Version der Funktion verwendet operator<, um die Elemente zu vergleichen, verwendet die zweite der angegebenen Vergleichsfunktion comp .

Original:

Examines the range [first, last) and finds the largest range beginning at first which is heap. The first version of the function uses operator< to compare the elements, the second uses the given comparison function comp.

The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

Parameter

first, last	-	das Spektrum der Elemente zu untersuchen Original: the range of elements to examine The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
comp	-	comparison function 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);` The signature does not need to have `const &`, but the function must not modify the objects passed to it. The types `Type1` and `Type2` must be such that an object of type `RandomIt` can be dereferenced and then implicitly converted to both of them.
Type requirements
-`RandomIt` must meet the requirements of `RandomAccessIterator`.

Rückgabewert

Die obere Grenze der größte Funktionsvielfalt Anfang an first die Heap ist gebunden. Das heißt, die letzten Iterator it für welchen Bereich [first, it) ist Haufen .

Original:

The upper bound of the largest range beginning at first which is heap. That is, the last iterator it for which range [first, it) is heap.

The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

Komplexität

Linear im Abstand first und last

Original:

Linear in the distance between first and last

The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

Notes

A Haufen ist ein Bereich von Elementen [f,l) das hat die folgenden Eigenschaften:

Original:

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

The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

*f ist das größte Element in dem Bereich
Original:
*f is the largest element in the range
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
ein neues Element hinzugefügt mit std::push_heap() werden
Original:
a new element can be added using std::push_heap()
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
das erste Element kann mit Hilfe std::pop_heap() werden
Original:
the first element can be removed using std::pop_heap()
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

Die tatsächliche Anordnung der Elemente ist die Umsetzung definiert .

Original:

The actual arrangement of the elements is implementation defined.

The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

Beispiel

#include <iostream>
#include <algorithm>

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 (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';
}

Output:

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

Siehe auch


	checks if the given range is a heap (Funktions-Template) [edit]