34                                            _SizeT __count,  in __search_n_forward_impl()  argument
38   if (__count <= 0)  in __search_n_forward_impl()
55 … if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern)  in __search_n_forward_impl()
76                                                       _SizeT __count,  in __search_n_random_access_impl()  argument
82   if (__count == 0)  in __search_n_random_access_impl()
84   if (__size1 < static_cast<_DiffT>(__count)) {  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()
105 … if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern)  in __search_n_random_access_impl()
106         return std::make_pair(__first, __first + _DiffT(__count));  in __search_n_random_access_impl()
127                                    _DiffT __count,
133                                                                __count,
147                                      _DiffT __count,
154                                                          __count,
163                           _Size __count,  in search_n()  argument
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()