headers/cpp/stl_algo.h

91                        const _Tp& __val,
94   while (__first != __last && *__first != __val)
113                        const _Tp& __val,
120     if (*__first == __val) return __first;
123     if (*__first == __val) return __first;
126     if (*__first == __val) return __first;
129     if (*__first == __val) return __first;
135     if (*__first == __val) return __first;
138     if (*__first == __val) return __first;
141     if (*__first == __val) return __first;
191                        const _Tp& __val)
193   return find(__first, __last, __val, __ITERATOR_CATEGORY(__first));
374 // search_n.  Search for __count consecutive copies of __val.
378                       _Integer __count, const _Tp& __val) {
382     __first = find(__first, __last, __val);
387       while (__i != __last && __n != 0 && *__i == __val) {
394         __first = find(__i, __last, __val);
402                       _Integer __count, const _Tp& __val,
408       if (__binary_pred(*__first, __val))
416       while (__i != __last && __n != 0 && __binary_pred(*__i, __val)) {
424           if (__binary_pred(*__i, __val))
1151 void __unguarded_linear_insert(_RandomAccessIter __last, _Tp __val) {
1154   while (__val < *__next) {
1159   *__last = __val;
1163 void __unguarded_linear_insert(_RandomAccessIter __last, _Tp __val,
1167   while (__comp(__val, *__next)) {
1172   *__last = __val;
1178   _Tp __val = *__last;
1179   if (__val < *__first) {
1181     *__first = __val;
1184     __unguarded_linear_insert(__last, __val);
1190   _Tp __val = *__last;
1191   if (__comp(__val, *__first)) {
1193     *__first = __val;
1196     __unguarded_linear_insert(__last, __val, __comp);
1724                            const _Tp& __val, _Distance*)
1735     if (*__middle < __val) {
1748                                    const _Tp& __val) {
1749   return __lower_bound(__first, __last, __val,
1755                               const _Tp& __val, _Compare __comp, _Distance*)
1766     if (__comp(*__middle, __val)) {
1779                                 const _Tp& __val, _Compare __comp) {
1780   return __lower_bound(__first, __last, __val, __comp,
1786                            const _Tp& __val, _Distance*)
1797     if (__val < *__middle)
1810                                 const _Tp& __val) {
1811   return __upper_bound(__first, __last, __val,
1817                            const _Tp& __val, _Compare __comp, _Distance*)
1828     if (__comp(__val, *__middle))
1841                                 const _Tp& __val, _Compare __comp) {
1842   return __upper_bound(__first, __last, __val, __comp,
1848 __equal_range(_ForwardIter __first, _ForwardIter __last, const _Tp& __val,
1860     if (*__middle < __val) {
1865     else if (__val < *__middle)
1868       __left = lower_bound(__first, __middle, __val);
1870       __right = upper_bound(++__middle, __first, __val);
1879 equal_range(_ForwardIter __first, _ForwardIter __last, const _Tp& __val) {
1880   return __equal_range(__first, __last, __val,
1886 __equal_range(_ForwardIter __first, _ForwardIter __last, const _Tp& __val,
1898     if (__comp(*__middle, __val)) {
1903     else if (__comp(__val, *__middle))
1906       __left = lower_bound(__first, __middle, __val, __comp);
1908       __right = upper_bound(++__middle, __first, __val, __comp);
1917 equal_range(_ForwardIter __first, _ForwardIter __last, const _Tp& __val,
1919   return __equal_range(__first, __last, __val, __comp,
1925                    const _Tp& __val) {
1926   _ForwardIter __i = lower_bound(__first, __last, __val);
1927   return __i != __last && !(__val < *__i);
1932                    const _Tp& __val,
1934   _ForwardIter __i = lower_bound(__first, __last, __val, __comp);
1935   return __i != __last && !__comp(__val, *__i);