Lines Matching refs:__first

95     __valid_range_aux2(const _RandomAccessIterator& __first,
98 { return __last - __first >= 0; }
124 __valid_range_aux(const _InputIterator& __first,
129 return __valid_range_aux2(__first, __last, _Category());
139 __valid_range(const _InputIterator& __first, const _InputIterator& __last)
142 return __valid_range_aux(__first, __last, _Integral());
148 __valid_range(const _Safe_iterator<_Iterator, _Sequence>& __first,
150 { return __first._M_valid_range(__last); }
153 * __first. This routine is useful when we can't use a separate
158 __check_valid_range(const _InputIterator& __first,
162 _GLIBCXX_DEBUG_ASSERT(__valid_range(__first, __last));
163 return __first;
201 __check_sorted_aux(_ForwardIterator __first, _ForwardIterator __last,
204 if (__first == __last)
207 _ForwardIterator __next = __first;
208 for (++__next; __next != __last; __first = __next, ++__next) {
209 if (*__next < *__first)
228 __check_sorted_aux(_ForwardIterator __first, _ForwardIterator __last,
231 if (__first == __last)
234 _ForwardIterator __next = __first;
235 for (++__next; __next != __last; __first = __next, ++__next) {
236 if (__pred(*__next, *__first))
246 __check_sorted(const _InputIterator& __first, const _InputIterator& __last)
250 return __check_sorted_aux(__first, __last, _Category());
255 __check_sorted(const _InputIterator& __first, const _InputIterator& __last,
260 return __check_sorted_aux(__first, __last, __pred,
269 __check_partitioned(_ForwardIterator __first, _ForwardIterator __last,
272 while (__first != __last && *__first < __value)
273 ++__first;
274 while (__first != __last && !(*__first < __value))
275 ++__first;
276 return __first == __last;
282 __check_partitioned(_ForwardIterator __first, _ForwardIterator __last,
285 while (__first != __last && __pred(*__first, __value))
286 ++__first;
287 while (__first != __last && !__pred(*__first, __value))
288 ++__first;
289 return __first == __last;