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.

[edit]Parameters

[edit]Return value

An iterator to the beginning of first occurrence of the sequence[first2, last2) in the range[first1, last1). If[first2, last2) is empty,first1 is returned. If no such occurrence is found, an iterator that compares equal tolast1 is returned.

[edit]Complexity

At mostS * N applications of the predicate and each projection, whereS= last2- first2 andN= last1- first1.

[edit]Possible implementation

template<ForwardIterator I1, Sentinel<I1> S1,         ForwardIterator I2, Sentinel<I2> S2,class Pred=ranges::equal_to<>,class Proj1=ranges::identity,class Proj2=ranges::identity>    requires IndirectlyComparable<I1, I2, Pred, Proj1, Proj2>I1 search(I1 first1, S1 last1, I2 first2, S2 last2,          Pred pred= Pred{}, Proj1 proj1= Proj1{}, Proj2 proj2= Proj2{}){for(;;++first1){        I1 it= first1;for(I2 it2= first2;;(void)++it,(void)++it2){if(it2== last2)return first1;if(it== last1)return it;if(!ranges::invoke(pred,ranges::invoke(proj1,*it),ranges::invoke(proj2,*it2)))break;}}}

[edit]Example

[edit]See also