33 pair<_Iter, _Iter> __search_n_forward_impl(_Iter __first, _Sent __last,  in __search_n_forward_impl()  argument
39     return std::make_pair(__first, __first);  in __search_n_forward_impl()
43       if (__first == __last) { // return __last if no element matches __value  in __search_n_forward_impl()
44         _IterOps<_AlgPolicy>::__advance_to(__first, __last);  in __search_n_forward_impl()
45         return std::make_pair(__first, __first);  in __search_n_forward_impl()
47       if (std::__invoke(__pred, std::__invoke(__proj, *__first), __value))  in __search_n_forward_impl()
49       ++__first;  in __search_n_forward_impl()
52     _Iter __m = __first;  in __search_n_forward_impl()
56         return std::make_pair(__first, ++__m);  in __search_n_forward_impl()
58         _IterOps<_AlgPolicy>::__advance_to(__first, __last);  in __search_n_forward_impl()
59         return std::make_pair(__first, __first);  in __search_n_forward_impl()
65         __first = __m;  in __search_n_forward_impl()
66         ++__first;  in __search_n_forward_impl()
75 std::pair<_Iter, _Iter> __search_n_random_access_impl(_Iter __first, _Sent __last,  in __search_n_random_access_impl()  argument
83     return std::make_pair(__first, __first);  in __search_n_random_access_impl()
85     _IterOps<_AlgPolicy>::__advance_to(__first, __last);  in __search_n_random_access_impl()
86     return std::make_pair(__first, __first);  in __search_n_random_access_impl()
89 …const auto __s = __first + __size1 - difference_type(__count - 1); // Start of pattern match can't…  in __search_n_random_access_impl()
93       if (__first >= __s) { // return __last if no element matches __value  in __search_n_random_access_impl()
94         _IterOps<_AlgPolicy>::__advance_to(__first, __last);  in __search_n_random_access_impl()
95         return std::make_pair(__first, __first);  in __search_n_random_access_impl()
97       if (std::__invoke(__pred, std::__invoke(__proj, *__first), __value))  in __search_n_random_access_impl()
99       ++__first;  in __search_n_random_access_impl()
102     auto __m = __first;  in __search_n_random_access_impl()
106         return std::make_pair(__first, __first + _DiffT(__count));  in __search_n_random_access_impl()
112         __first = __m;  in __search_n_random_access_impl()
113         ++__first;  in __search_n_random_access_impl()
126 pair<_Iter, _Iter> __search_n_impl(_Iter __first, _Sent __last,
132   return std::__search_n_random_access_impl<_ClassicAlgPolicy>(__first, __last,
137                                                                __last - __first);
146 pair<_Iter1, _Iter1> __search_n_impl(_Iter1 __first, _Sent1 __last,
153   return std::__search_n_forward_impl<_ClassicAlgPolicy>(__first, __last,
162 _ForwardIterator search_n(_ForwardIterator __first, _ForwardIterator __last,  in search_n()  argument
166   static_assert(__is_callable<_BinaryPredicate, decltype(*__first), const _Tp&>::value,  in search_n()
169 …return std::__search_n_impl(__first, __last, std::__convert_to_integral(__count), __value, __pred,…  in search_n()
174 _ForwardIterator search_n(_ForwardIterator __first, _ForwardIterator __last, _Size __count, const _…  in search_n()  argument
176 …return std::search_n(__first, __last, std::__convert_to_integral(__count), __value, __equal_to<__v…  in search_n()