Lines Matching defs:__val
137 const _Tp& __val, input_iterator_tag)
139 while (__first != __last && !(*__first == __val))
159 const _Tp& __val, random_access_iterator_tag)
166 if (*__first == __val)
170 if (*__first == __val)
174 if (*__first == __val)
178 if (*__first == __val)
186 if (*__first == __val)
190 if (*__first == __val)
194 if (*__first == __val)
354 _Integer __count, const _Tp& __val,
357 __first = _GLIBCXX_STD_A::find(__first, __last, __val);
364 while (__i != __last && __n != 1 && *__i == __val)
373 __first = _GLIBCXX_STD_A::find(++__i, __last, __val);
386 _Integer __count, const _Tp& __val,
403 while (*--__backTrack == __val)
425 _Integer __count, const _Tp& __val,
428 while (__first != __last && !bool(__binary_pred(*__first, __val)))
437 while (__i != __last && __n != 1 && bool(__binary_pred(*__i, __val)))
448 && !bool(__binary_pred(*__first, __val)))
464 _Integer __count, const _Tp& __val,
481 while (__binary_pred(*--__backTrack, __val))
2095 __val = _GLIBCXX_MOVE(*__last);
2098 while (__val < *__next)
2104 *__last = _GLIBCXX_MOVE(__val);
2114 __val = _GLIBCXX_MOVE(*__last);
2117 while (__comp(__val, *__next))
2123 *__last = _GLIBCXX_MOVE(__val);
2140 __val = _GLIBCXX_MOVE(*__i);
2142 *__first = _GLIBCXX_MOVE(__val);
2162 __val = _GLIBCXX_MOVE(*__i);
2164 *__first = _GLIBCXX_MOVE(__val);
2408 * @brief Finds the first position in which @p __val could be inserted
2413 * @param __val The search term.
2416 * than</em> @p __val, or end() if every element is less
2417 * than @p __val.
2426 const _Tp& __val, _Compare __comp)
2438 __val, __comp);
2447 if (__comp(*__middle, __val))
2460 * @brief Finds the last position in which @p __val could be inserted
2465 * @param __val The search term.
2466 * @return An iterator pointing to the first element greater than @p __val,
2467 * or end() if no elements are greater than @p __val.
2473 const _Tp& __val)
2483 __glibcxx_requires_partitioned_upper(__first, __last, __val);
2492 if (__val < *__middle)
2505 * @brief Finds the last position in which @p __val could be inserted
2510 * @param __val The search term.
2512 * @return An iterator pointing to the first element greater than @p __val,
2513 * or end() if no elements are greater than @p __val.
2522 const _Tp& __val, _Compare __comp)
2534 __val, __comp);
2543 if (__comp(__val, *__middle))
2556 * @brief Finds the largest subrange in which @p __val could be inserted
2561 * @param __val The search term.
2567 * std::make_pair(lower_bound(__first, __last, __val),
2568 * upper_bound(__first, __last, __val))
2575 const _Tp& __val)
2586 __glibcxx_requires_partitioned_lower(__first, __last, __val);
2587 __glibcxx_requires_partitioned_upper(__first, __last, __val);
2596 if (*__middle < __val)
2602 else if (__val < *__middle)
2607 __val);
2610 __val);
2618 * @brief Finds the largest subrange in which @p __val could be inserted
2622 * @param __val The search term.
2629 * std::make_pair(lower_bound(__first, __last, __val, __comp),
2630 * upper_bound(__first, __last, __val, __comp))
2637 const _Tp& __val, _Compare __comp)
2651 __val, __comp);
2653 __val, __comp);
2662 if (__comp(*__middle, __val))
2668 else if (__comp(__val, *__middle))
2673 __val, __comp);
2676 __val, __comp);
2688 * @param __val The search term.
2689 * @return True if @p __val (or its equivalent) is in [@p
2692 * Note that this does not actually return an iterator to @p __val. For
2698 const _Tp& __val)
2706 __glibcxx_requires_partitioned_lower(__first, __last, __val);
2707 __glibcxx_requires_partitioned_upper(__first, __last, __val);
2709 _ForwardIterator __i = std::lower_bound(__first, __last, __val);
2710 return __i != __last && !(__val < *__i);
2718 * @param __val The search term.
2720 * @return True if @p __val (or its equivalent) is in @p [__first,__last].
2722 * Note that this does not actually return an iterator to @p __val. For
2731 const _Tp& __val, _Compare __comp)
2741 __val, __comp);
2743 __val, __comp);
2745 _ForwardIterator __i = std::lower_bound(__first, __last, __val, __comp);
2746 return __i != __last && !bool(__comp(__val, *__i));
4426 * @param __val The value to find.
4428 * such that @c *i == @p __val, or @p __last if no such iterator exists.
4433 const _Tp& __val)
4440 return std::__find(__first, __last, __val,
4824 * @param __val The value to find.
4826 * [__first,__last-__count) such that @c *(i+N) == @p __val for
4831 * equal to @p __val.
4836 _Integer __count, const _Tp& __val)
4847 return _GLIBCXX_STD_A::find(__first, __last, __val);
4848 return std::__search_n(__first, __last, __count, __val,
4860 * @param __val The value to find.
4864 * __binary_pred(*(i+N),__val) is true for each @c N in the range
4874 _Integer __count, const _Tp& __val,
4887 while (__first != __last && !bool(__binary_pred(*__first, __val)))
4891 return std::__search_n(__first, __last, __count, __val, __binary_pred,
