Lines Matching defs:__val
1858 __val = _GLIBCXX_MOVE(*__last);
1861 while (__comp(__val, __next))
1867 *__last = _GLIBCXX_MOVE(__val);
1883 __val = _GLIBCXX_MOVE(*__i);
1885 *__first = _GLIBCXX_MOVE(__val);
2039 * @brief Finds the first position in which @p __val could be inserted
2044 * @param __val The search term.
2047 * than</em> @p __val, or end() if every element is less
2048 * than @p __val.
2057 const _Tp& __val, _Compare __comp)
2067 __val, __comp);
2069 return std::__lower_bound(__first, __last, __val,
2076 const _Tp& __val, _Compare __comp)
2088 if (__comp(__val, __middle))
2101 * @brief Finds the last position in which @p __val could be inserted
2106 * @param __val The search term.
2107 * @return An iterator pointing to the first element greater than @p __val,
2108 * or end() if no elements are greater than @p __val.
2114 const _Tp& __val)
2122 __glibcxx_requires_partitioned_upper(__first, __last, __val);
2124 return std::__upper_bound(__first, __last, __val,
2129 * @brief Finds the last position in which @p __val could be inserted
2134 * @param __val The search term.
2136 * @return An iterator pointing to the first element greater than @p __val,
2137 * or end() if no elements are greater than @p __val.
2146 const _Tp& __val, _Compare __comp)
2156 __val, __comp);
2158 return std::__upper_bound(__first, __last, __val,
2166 const _Tp& __val,
2179 if (__comp_it_val(__middle, __val))
2185 else if (__comp_val_it(__val, __middle))
2190 = std::__lower_bound(__first, __middle, __val, __comp_it_val);
2193 = std::__upper_bound(++__middle, __first, __val, __comp_val_it);
2201 * @brief Finds the largest subrange in which @p __val could be inserted
2206 * @param __val The search term.
2212 * std::make_pair(lower_bound(__first, __last, __val),
2213 * upper_bound(__first, __last, __val))
2220 const _Tp& __val)
2229 __glibcxx_requires_partitioned_lower(__first, __last, __val);
2230 __glibcxx_requires_partitioned_upper(__first, __last, __val);
2232 return std::__equal_range(__first, __last, __val,
2238 * @brief Finds the largest subrange in which @p __val could be inserted
2242 * @param __val The search term.
2249 * std::make_pair(lower_bound(__first, __last, __val, __comp),
2250 * upper_bound(__first, __last, __val, __comp))
2257 const _Tp& __val, _Compare __comp)
2269 __val, __comp);
2271 __val, __comp);
2273 return std::__equal_range(__first, __last, __val,
2283 * @param __val The search term.
2284 * @return True if @p __val (or its equivalent) is in [@p
2287 * Note that this does not actually return an iterator to @p __val. For
2293 const _Tp& __val)
2301 __glibcxx_requires_partitioned_lower(__first, __last, __val);
2302 __glibcxx_requires_partitioned_upper(__first, __last, __val);
2305 = std::__lower_bound(__first, __last, __val,
2307 return __i != __last && !(__val < *__i);
2315 * @param __val The search term.
2317 * @return True if @p __val (or its equivalent) is in @p [__first,__last].
2319 * Note that this does not actually return an iterator to @p __val. For
2328 const _Tp& __val, _Compare __comp)
2338 __val, __comp);
2340 __val, __comp);
2343 = std::__lower_bound(__first, __last, __val,
2345 return __i != __last && !bool(__comp(__val, *__i));
3798 * @param __val The value to find.
3800 * such that @c *i == @p __val, or @p __last if no such iterator exists.
3805 const _Tp& __val)
3813 __gnu_cxx::__ops::__iter_equals_val(__val));
4107 * @param __val The value to find.
4109 * [__first,__last-__count) such that @c *(i+N) == @p __val for
4114 * equal to @p __val.
4119 _Integer __count, const _Tp& __val)
4128 __gnu_cxx::__ops::__iter_equals_val(__val));
4139 * @param __val The value to find.
4143 * __binary_pred(*(i+N),__val) is true for each @c N in the range
4153 _Integer __count, const _Tp& __val,
4163 __val));
