[ Web Proxy ]
URL:
Viewing: https://de.cppreference.com/cpp/algorithm/is_heap_until [Back]  [Original]
std::is_heap_until cppreference.com
cppreference.com
Namensrume
Varianten

    std::is_heap_until

    Aus cppreference.com
    []

    This page has been machine-translated from the English version of the wiki using Google Translate.

    The translation may contain errors and awkward wording. Hover over text to see the original version. You can help to fix errors and improve the translation. For instructions click here.

    Click here for the English version of this page

    <metanoindex/>

     
    C++
     
    Algorithm Bibliothek
    Funktionen
    Original:
    Functions
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
    Nicht-modifizierende Sequenz Operationen
    Original:
    Non-modifying sequence operations
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
    Modifizierende Sequenz Operationen
    Original:
    Modifying sequence operations
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
    Partitionierungsoperationen
    Original:
    Partitioning operations
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
    Sortierung Operationen (auf sortierten Bereiche)
    Original:
    Sorting operations (on sorted ranges)
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
    Binary Suchaktionen (auf sortierten Bereiche)
    Original:
    Binary search operations (on sorted ranges)
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
    Set-Operationen (auf sortierten Bereiche)
    Original:
    Set operations (on sorted ranges)
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
    Heap-Operationen
    Original:
    Heap operations
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
    Minimum / Maximum Operationen
    Original:
    Minimum/maximum operations
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
    Numerische Operationen
    Original:
    Numeric operations
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
    C-Bibliothek
    Original:
    C library
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
     
    <tbody> </tbody>
    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 grte 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.

    Rckgabewert

    Die obere Grenze der grte Funktionsvielfalt Anfang an first die Heap ist gebunden. Das heit, die letzten Iterator it fr 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.

    Komplexitt

    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 grte 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 hinzugefgt 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 tatschliche 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]
    Web Proxy Viewer  |  New URL  |  Original Page