Lines Matching defs:__val
171 const _Tp& __val, input_iterator_tag)
173 while (__first != __last && !(*__first == __val))
201 const _Tp& __val, random_access_iterator_tag)
208 if (*__first == __val)
212 if (*__first == __val)
216 if (*__first == __val)
220 if (*__first == __val)
228 if (*__first == __val)
232 if (*__first == __val)
236 if (*__first == __val)
319 const _Tp& __val)
326 return std::__find(__first, __last, __val,
631 _Integer __count, const _Tp& __val,
634 __first = std::find(__first, __last, __val);
641 while (__i != __last && __n != 1 && *__i == __val)
650 __first = std::find(++__i, __last, __val);
665 _Integer __count, const _Tp& __val,
686 while (!(*__lookAhead == __val)) // the skip loop...
695 *__backTrack == __val; --__backTrack)
723 _Integer __count, const _Tp& __val)
734 return std::find(__first, __last, __val);
735 return std::__search_n(__first, __last, __count, __val,
751 _Integer __count, const _Tp& __val,
754 while (__first != __last && !__binary_pred(*__first, __val))
763 while (__i != __last && __n != 1 && __binary_pred(*__i, __val))
773 while (__first != __last && !__binary_pred(*__first, __val))
791 _Integer __count, const _Tp& __val,
812 while (!__binary_pred(*__lookAhead, __val)) // the skip loop...
821 __binary_pred(*__backTrack, __val); --__backTrack)
852 _Integer __count, const _Tp& __val,
865 while (__first != __last && !__binary_pred(*__first, __val))
869 return std::__search_n(__first, __last, __count, __val, __binary_pred,
2305 __unguarded_linear_insert(_RandomAccessIterator __last, _Tp __val)
2309 while (__val < *__next)
2315 *__last = __val;
2325 __unguarded_linear_insert(_RandomAccessIterator __last, _Tp __val,
2330 while (__comp(__val, *__next))
2336 *__last = __val;
2355 __val = *__i;
2356 if (__val < *__first)
2359 *__first = __val;
2362 std::__unguarded_linear_insert(__i, __val);
2381 __val = *__i;
2382 if (__comp(__val, *__first))
2385 *__first = __val;
2388 std::__unguarded_linear_insert(__i, __val, __comp);
2885 const _Tp& __val)
2895 __glibcxx_requires_partitioned(__first, __last, __val);
2906 if (*__middle < __val)
2935 const _Tp& __val, _Compare __comp)
2946 __glibcxx_requires_partitioned_pred(__first, __last, __val, __comp);
2957 if (__comp(*__middle, __val))
2982 const _Tp& __val)
2992 __glibcxx_requires_partitioned(__first, __last, __val);
3003 if (__val < *__middle)
3032 const _Tp& __val, _Compare __comp)
3043 __glibcxx_requires_partitioned_pred(__first, __last, __val, __comp);
3054 if (__comp(__val, *__middle))
4110 const _Tp& __val)
4121 __glibcxx_requires_partitioned(__first, __last, __val);
4132 if (*__middle < __val)
4138 else if (__val < *__middle)
4142 __left = std::lower_bound(__first, __middle, __val);
4144 __right = std::upper_bound(++__middle, __first, __val);
4171 const _Tp& __val,
4185 __glibcxx_requires_partitioned_pred(__first, __last, __val, __comp);
4196 if (__comp(*__middle, __val))
4202 else if (__comp(__val, *__middle))
4206 __left = std::lower_bound(__first, __middle, __val, __comp);
4208 __right = std::upper_bound(++__middle, __first, __val, __comp);
4229 const _Tp& __val)
4237 __glibcxx_requires_partitioned(__first, __last, __val);
4239 _ForwardIterator __i = std::lower_bound(__first, __last, __val);
4240 return __i != __last && !(__val < *__i);
4261 const _Tp& __val, _Compare __comp)
4270 __glibcxx_requires_partitioned_pred(__first, __last, __val, __comp);
4272 _ForwardIterator __i = std::lower_bound(__first, __last, __val, __comp);
4273 return __i != __last && !__comp(__val, *__i);