std::experimental::ranges:: find_end

Notwithstanding the declarations depicted above, the actual number and order of template parameters for algorithm declarations is unspecified. Thus, if explicit template arguments are used when calling an algorithm, the program is probably non-portable.

Parameters

Return value

Iterator to the beginning of last occurrence of the sequence [ first2 , last2 ) in range [ first1 , last1 ) (after projection with proj ).

If [ first2 , last2 ) is empty or if no such sequence is found, an iterator that compares equal to last1 is returned.

Complexity

At most S * (N - S + 1) applications of the predicate and projection, where S = last2 - first2 and N = last1 - first1 .

Notes

The projection is only applied to the range [ first1 , last1 ) .

Possible implementation

template<ForwardIterator I1, Sentinel<I1> S1, ForwardIterator I2, Sentinel<I2> S2,
         class Proj = ranges::identity,
         IndirectRelation<I2, projected<I1, Proj>> Pred = ranges::equal_to<>>
I1 find_end(I1 first1, S1 last1, I2 first2, S2 last2,
            Pred pred = Pred{}, Proj proj = Proj{})
{
    I1 result = ranges::next(first1, last1);
    if (first2 == last2)
        return result;
    while (true)
    {
        I1 new_result = ranges::search(first1, last1, first2, last2, pred, proj);
        if (new_result == last1)
            break;
        else
        {
            result = new_result;
            first1 = result;
            ++first1;
        }
    }
    return result;
}

Example

See also