Namensräume
Varianten

    std::find_end

    Aus cppreference.com
    See More

    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 ForwardIt1, class ForwardIt2 > ForwardIt1 find_end( ForwardIt1 first, ForwardIt1 last, ForwardIt2 s_first, ForwardIt2 s_last );
    		 (1)
    template< class ForwardIt1, class ForwardIt2, class BinaryPredicate > ForwardIt1 find_end( ForwardIt1 first, ForwardIt1 last, ForwardIt2 s_first, ForwardIt2 s_last, BinaryPredicate p );
    		 (2)
    Sucht nach dem letzten Teilfolge von Elementen [s_first, s_last) im Bereich [first, last). Die erste Version verwendet operator== um die Elemente zu vergleichen, verwendet die zweite Version des gegebenen binären Prädikats p .
    Original:
    Searches for the last subsequence of elements [s_first, s_last) in the range [first, last). The first version uses operator== to compare the elements, the second version uses the given binary predicate p.
    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.
    s_first, s_last -
    der Bereich der Elemente für
    Original:
    the range of elements to search for
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
    p - binary predicate which returns ​true if the elements should be treated as equal.

    The signature of the predicate function should be equivalent to the following:

    bool pred(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 objects of types ForwardIt1 and ForwardIt2 can be dereferenced and then implicitly converted to Type1 and Type2 respectively.

    ​

    Type requirements
    -
    ForwardIt1 must meet the requirements of ForwardIterator.
    -
    ForwardIt2 must meet the requirements of ForwardIterator.

    Rückgabewert

    Iterator an den Anfang des letzten Teilfolge [s_first, s_last) im Bereich [first, last) .
    Original:
    Iterator to the beginning of last subsequence [s_first, s_last) in range [first, last).
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
    Wenn keine solche Subsequenz gefunden wird, wird last zurückgegeben. (bis C + +11)
    Original:
    If no such subsequence is found, last is returned. (bis C + +11)
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
    Wenn [s_first, s_last) leer oder, wenn keine solche Teilfolge gefunden wird, wird last zurückgegeben. (seit C++11)
    Original:
    If [s_first, s_last) is empty or if no such subsequence is found, last is returned. (seit C++11)
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.

    Komplexität

    Ist in den meisten S*(N-S+1) Vergleiche, wo S = distance(s_first, s_last) und N = distance(first, last) .
    Original:
    Does at most S*(N-S+1) comparisons where S = distance(s_first, s_last) and N = distance(first, last).
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.

    Mögliche Implementierung

    First version 
    template<class ForwardIt1, class ForwardIt2>
ForwardIt1 find_end(ForwardIt1 first, ForwardIt1 last,
                    ForwardIt2 s_first, ForwardIt2 s_last)
{
    if (s_first == s_last)
        return last;
    ForwardIt1 result = last;
    while (1) {
        ForwardIt1 new_result = std::search(first, last, s_first, s_last);
        if (new_result == last) {
            return result;
        } else {
            result = new_result;
            first = result;
            ++first;
        }
    }
    return result;
}
    Second version 
    template<class ForwardIt1, class ForwardIt2, class BinaryPredicate>
ForwardIt1 find_end(ForwardIt1 first, ForwardIt1 last,
                    ForwardIt2 s_first, ForwardIt2 s_last,
                    BinaryPredicate p)
{
    if (s_first == s_last)
        return last;
    ForwardIt1 result = last;
    while (1) {
        ForwardIt1 new_result = std::search(first, last, s_first, s_last, p);
        if (new_result == last) {
            return result;
        } else {
            result = new_result;
            first = result;
            ++first;
        }
    }
    return result;
}

    Beispiel

    Der folgende Code verwendet find_end() für zwei verschiedene Zahlenfolgen suchen .
    Original:
    The following code uses find_end() to search for two different sequences of numbers.
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.

    #include <algorithm>
#include <iostream>
#include <vector>

int main()
{
    std::vector<int> v{1, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 4};
    std::vector<int>::iterator result;
 
    std::vector<int> t1{1, 2, 3};

    result = std::find_end(v.begin(), v.end(), t1.begin(), t1.end());
    if (result == v.end()) {
        std::cout << "subsequence not found\n";
    } else {
        std::cout << "last subsequence is at: "
                  << std::distance(v.begin(), result) << "\n";
    }

    std::vector<int> t2{4, 5, 6};
    result = std::find_end(v.begin(), v.end(), t2.begin(), t2.end());
    if (result == v.end()) {
        std::cout << "subsequence not found\n";
    } else {
        std::cout << "last subsequence is at: " 
                  << std::distance(v.begin(), result) << "\n";
    }
}

    Output: 

    last subsequence is at: 8
subsequence not found

    Siehe auch
    findet zwei identischen (oder eine andere Beziehung) Elemente einander benachbart
    Original:
    finds two identical (or some other relationship) items adjacent to each other
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.

    (Funktions-Template) [edit]


    (C++11)
    		 Findet das erste Elemente, welches bestimmte Kriterien erfüllt
    (Funktions-Template) [edit]
    		searches for any one of a set of elements
    (Funktions-Template) [edit]
    Suchen nach einer Reihe aufeinanderfolgender Kopien eines Elements in einem Bereich
    Original:
    searches for a number consecutive copies of an element in a range
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.

    (Funktions-Template) [edit]