Lines Matching defs:__count

36     _Iter __first, _Sent __last, _SizeT __count, const _Type& __value, _Pred& __pred, _Proj& __proj) {
37   if (__count <= 0)
54       if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern)
73     _Iter __first, _Sent __last, _SizeT __count, const _Type& __value, _Pred& __pred, _Proj& __proj, _DiffT __size1) {
75   if (__count == 0)
77   if (__size1 < static_cast<_DiffT>(__count)) {
82   const auto __s = __first + __size1 - difference_type(__count - 1); // Start of pattern match can't go beyond here
98       if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern)
99         return std::make_pair(__first, __first + _DiffT(__count));
120 __search_n_impl(_Iter __first, _Sent __last, _DiffT __count, const _Type& __value, _Pred& __pred, _Proj& __proj) {
122       __first, __last, __count, __value, __pred, __proj, __last - __first);
135 __search_n_impl(_Iter1 __first, _Sent1 __last, _DiffT __count, const _Type& __value, _Pred& __pred, _Proj& __proj) {
136   return std::__search_n_forward_impl<_ClassicAlgPolicy>(__first, __last, __count, __value, __pred, __proj);
141     _ForwardIterator __first, _ForwardIterator __last, _Size __count, const _Tp& __value, _BinaryPredicate __pred) {
145   return std::__search_n_impl(__first, __last, std::__convert_to_integral(__count), __value, __pred, __proj).first;
150 search_n(_ForwardIterator __first, _ForwardIterator __last, _Size __count, const _Tp& __value) {
151   return std::search_n(__first, __last, std::__convert_to_integral(__count), __value, __equal_to());