Searched refs:upper_bound (Results 1 - 25 of 73) sorted by relevance

123

/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/upper_bound/
H A D2.cc41 // 25.3.3.2 upper_bound, with and without comparison predicate
45 using std::upper_bound;
50 const int* p = upper_bound(A, A + N, 3);
53 const int* q = upper_bound(A, A + N, first);
56 const int* r = upper_bound(A, A + N, last);
59 const int* s = upper_bound(A, A + N, 4);
62 const int* t = upper_bound(C, C + N, 3, gt());
65 const int* u = upper_bound(C, C + N, first, gt());
68 const int* v = upper_bound(C, C + N, last, gt());
71 const int* w = upper_bound(
[all...]
H A D33613.cc35 std::upper_bound(a, a, b, ba);
H A D1.cc26 using std::upper_bound;
38 VERIFY(upper_bound(con.begin(), con.end(), 0).ptr == array + 4);
H A Dcheck_type.cc39 { return std::upper_bound(s, s, *s); }
43 { return std::upper_bound(x, x, *x, predicate); }
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/upper_bound/requirements/explicit_instantiation/
H A D2.cc35 template iterator_type upper_bound(iterator_type, iterator_type,
37 template iterator_type upper_bound(iterator_type, iterator_type,
H A Dpod.cc34 template iterator_type upper_bound(iterator_type, iterator_type,
36 template iterator_type upper_bound(iterator_type, iterator_type,
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/ov_tree_map_/
H A Ddebug_fn_imps.hpp68 const_iterator upper_bound_it = upper_bound(PB_DS_V2F(*it));
H A Dsplit_join_fn_imps.hpp76 iterator it = upper_bound(r_key);
/haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/set/operations/
H A D2.cc105 auto it = x.upper_bound(1L);
107 it = x.upper_bound(5L);
110 auto cit = cx.upper_bound(1L);
112 cit = cx.upper_bound(5L);
/haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/map/operations/
H A D2.cc105 auto it = x.upper_bound(1L);
107 it = x.upper_bound(3L);
110 auto cit = cx.upper_bound(1L);
112 cit = cx.upper_bound(3L);
/haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/multimap/operations/
H A D2.cc105 auto it = x.upper_bound(1L);
107 it = x.upper_bound(3L);
110 auto cit = cx.upper_bound(1L);
112 cit = cx.upper_bound(3L);
/haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/multiset/operations/
H A D2.cc105 auto it = x.upper_bound(1L);
107 it = x.upper_bound(5L);
110 auto cit = cx.upper_bound(1L);
112 cit = cx.upper_bound(5L);
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/
H A Dfind_fn_imps.hpp82 upper_bound(key_const_reference r_key) const function in class:PB_DS_CLASS_C_DEC
101 upper_bound(key_const_reference r_key) function in class:PB_DS_CLASS_C_DEC
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/
H A Dsplit_join_fn_imps.hpp92 node_pointer p_upper_bound = this->upper_bound(r_key).m_p_nd;
/haiku-buildtools/gcc/libstdc++-v3/testsuite/ext/
H A Dconcept_checks.cc73 upper_bound(Index.begin(), Index.end(), SearchTerm, aComparison);
/haiku-buildtools/legacy/gcc/libstdc++/stl/
H A Dstl_map.h194 iterator upper_bound(const key_type& __x) {return _M_t.upper_bound(__x); } function in class:map
195 const_iterator upper_bound(const key_type& __x) const { function in class:map
196 return _M_t.upper_bound(__x);
H A Dstl_multimap.h183 iterator upper_bound(const key_type& __x) {return _M_t.upper_bound(__x); } function in class:multimap
184 const_iterator upper_bound(const key_type& __x) const { function in class:multimap
185 return _M_t.upper_bound(__x);
H A Dalgo.h75 using __STD::upper_bound;
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/
H A Ddebug_fn_imps.hpp76 PB_DS_DEBUG_VERIFY(--upper_bound(PB_DS_V2F(*it)) == it);
/haiku-buildtools/gcc/libstdc++-v3/include/bits/
H A Dstl_map.h960 upper_bound(const key_type& __x) function in class:map
961 { return _M_t.upper_bound(__x); }
966 upper_bound(const _Kt& __x)
980 upper_bound(const key_type& __x) const function in class:map
981 { return _M_t.upper_bound(__x); }
986 upper_bound(const _Kt& __x) const
1002 * c.upper_bound(val))
1031 * c.upper_bound(val))
H A Dstl_multimap.h865 upper_bound(const key_type& __x) function in class:multimap
866 { return _M_t.upper_bound(__x); }
871 upper_bound(const _Kt& __x)
885 upper_bound(const key_type& __x) const function in class:multimap
886 { return _M_t.upper_bound(__x); }
891 upper_bound(const _Kt& __x) const
907 * c.upper_bound(val))
934 * c.upper_bound(val))
H A Dstl_multiset.h740 upper_bound(const key_type& __x) function in class:multiset
741 { return _M_t.upper_bound(__x); }
744 upper_bound(const key_type& __x) const function in class:multiset
745 { return _M_t.upper_bound(__x); }
750 upper_bound(const _Kt& __x)
756 upper_bound(const _Kt& __x) const
772 * c.upper_bound(val))
H A Dstl_set.h759 upper_bound(const key_type& __x) function in class:set
760 { return _M_t.upper_bound(__x); }
763 upper_bound(const key_type& __x) const function in class:set
764 { return _M_t.upper_bound(__x); }
769 upper_bound(const _Kt& __x)
775 upper_bound(const _Kt& __x) const
791 * c.upper_bound(val))
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/resize_policy/
H A Dhash_prime_size_policy_imp.hpp140 const std::size_t* const p_upper = std::upper_bound(detail::g_a_sizes,
/haiku-buildtools/legacy/gcc/gcc/
H A Dcalls.c2874 int lower_bound, upper_bound, i;
2886 upper_bound = -argvec[argnum].offset.constant + 1;
2887 lower_bound = upper_bound - argvec[argnum].size.constant;
2890 upper_bound = lower_bound + argvec[argnum].size.constant;
2893 for (i = lower_bound; i < upper_bound; i++)
2900 if (i != upper_bound)
2920 for (i = lower_bound; i < upper_bound; i++)
3438 int lower_bound, upper_bound, i;
3450 upper_bound = -argvec[argnum].offset.constant + 1;
3451 lower_bound = upper_bound
2871 int lower_bound, upper_bound, i; local
3434 int lower_bound, upper_bound, i; local
3697 int i, lower_bound, upper_bound; local
[all...]

Completed in 288 milliseconds

123