HomeSort by relevance Sort by last modified time
    Searched full:lower_bound (Results 1 - 25 of 591) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/map/map.ops/
lower_bound.pass.cpp 14 // iterator lower_bound(const key_type& k);
15 // const_iterator lower_bound(const key_type& k) const;
41 R r = m.lower_bound(5);
43 r = m.lower_bound(7);
45 r = m.lower_bound(9);
47 r = m.lower_bound(11);
49 r = m.lower_bound(13);
51 r = m.lower_bound(15);
53 r = m.lower_bound(17);
55 r = m.lower_bound(19)
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/set/
lower_bound.pass.cpp 14 // iterator lower_bound(const key_type& k);
15 // const_iterator lower_bound(const key_type& k) const;
41 R r = m.lower_bound(5);
43 r = m.lower_bound(7);
45 r = m.lower_bound(9);
47 r = m.lower_bound(11);
49 r = m.lower_bound(13);
51 r = m.lower_bound(15);
53 r = m.lower_bound(17);
55 r = m.lower_bound(19)
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multimap/multimap.ops/
lower_bound.pass.cpp 14 // iterator lower_bound(const key_type& k);
15 // const_iterator lower_bound(const key_type& k) const;
42 R r = m.lower_bound(4);
44 r = m.lower_bound(5);
46 r = m.lower_bound(6);
48 r = m.lower_bound(7);
50 r = m.lower_bound(8);
52 r = m.lower_bound(9);
54 r = m.lower_bound(10);
72 R r = m.lower_bound(4)
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multiset/
lower_bound.pass.cpp 14 // iterator lower_bound(const key_type& k);
15 // const_iterator lower_bound(const key_type& k) const;
42 R r = m.lower_bound(4);
44 r = m.lower_bound(5);
46 r = m.lower_bound(6);
48 r = m.lower_bound(7);
50 r = m.lower_bound(8);
52 r = m.lower_bound(9);
54 r = m.lower_bound(11);
72 R r = m.lower_bound(4)
    [all...]
  /external/llvm/lib/MC/
MCModule.cpp 27 AtomListTy::iterator I = std::lower_bound(atom_begin(), atom_end(),
51 AtomListTy::iterator I = std::lower_bound(atom_begin(), atom_end(),
58 AtomListTy::iterator NewI = std::lower_bound(atom_begin(), atom_end(),
68 AtomListTy::const_iterator I = std::lower_bound(atom_begin(), atom_end(),
76 AtomListTy::iterator I = std::lower_bound(atom_begin(), atom_end(),
  /external/stlport/test/unit/
bound_test.cpp 67 vector<int>::iterator location = lower_bound(v1.begin(), v1.end(), 3);
77 char const** location = lower_bound((char const**)str, (char const**)str + strCt, (const char *)"d", char_str_less);
multiset_test.cpp 68 i = s.lower_bound(3);
78 ci = s.lower_bound(3);
91 ci = crs.lower_bound(3);
  /ndk/tests/device/test-gnustl-full/unit/
bound_test.cpp 67 vector<int>::iterator location = lower_bound(v1.begin(), v1.end(), 3);
77 char const** location = lower_bound((char const**)str, (char const**)str + strCt, (const char *)"d", char_str_less);
multiset_test.cpp 68 i = s.lower_bound(3);
78 ci = s.lower_bound(3);
91 ci = crs.lower_bound(3);
  /ndk/tests/device/test-stlport/unit/
bound_test.cpp 67 vector<int>::iterator location = lower_bound(v1.begin(), v1.end(), 3);
77 char const** location = lower_bound((char const**)str, (char const**)str + strCt, (const char *)"d", char_str_less);
multiset_test.cpp 68 i = s.lower_bound(3);
78 ci = s.lower_bound(3);
91 ci = crs.lower_bound(3);
  /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/detail/
binary_search.hpp 37 ForwardIter lower_bound(ForwardIter first, ForwardIter last, function in namespace:boost::detail
62 ForwardIter lower_bound(ForwardIter first, ForwardIter last, function in namespace:boost::detail
158 left = boost::detail::lower_bound(first, middle, val);
190 left = boost::detail::lower_bound(first, middle, val, comp);
202 ForwardIter i = boost::detail::lower_bound(first, last, val);
210 ForwardIter i = boost::detail::lower_bound(first, last, val, comp);
  /external/stlport/stlport/stl/debug/
_tree.h 185 iterator lower_bound(const _KT& __x) function in class:_Rb_tree
186 { return iterator(&_M_iter_list, _M_non_dbg_impl.lower_bound(__x)); }
188 const_iterator lower_bound(const _KT& __x) const function in class:_Rb_tree
189 { return const_iterator(&_M_iter_list, _M_non_dbg_impl.lower_bound(__x)); }
200 return pair<iterator, iterator>(iterator(&_M_iter_list, _M_non_dbg_impl.lower_bound(__x)),
205 return pair<const_iterator,const_iterator>(const_iterator(&_M_iter_list, _M_non_dbg_impl.lower_bound(__x)),
  /ndk/sources/cxx-stl/stlport/stlport/stl/debug/
_tree.h 185 iterator lower_bound(const _KT& __x) function in class:_Rb_tree
186 { return iterator(&_M_iter_list, _M_non_dbg_impl.lower_bound(__x)); }
188 const_iterator lower_bound(const _KT& __x) const function in class:_Rb_tree
189 { return const_iterator(&_M_iter_list, _M_non_dbg_impl.lower_bound(__x)); }
200 return pair<iterator, iterator>(iterator(&_M_iter_list, _M_non_dbg_impl.lower_bound(__x)),
205 return pair<const_iterator,const_iterator>(const_iterator(&_M_iter_list, _M_non_dbg_impl.lower_bound(__x)),
  /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/debug/
_tree.h 185 iterator lower_bound(const _KT& __x) function in class:_Rb_tree
186 { return iterator(&_M_iter_list, _M_non_dbg_impl.lower_bound(__x)); }
188 const_iterator lower_bound(const _KT& __x) const function in class:_Rb_tree
189 { return const_iterator(&_M_iter_list, _M_non_dbg_impl.lower_bound(__x)); }
200 return pair<iterator, iterator>(iterator(&_M_iter_list, _M_non_dbg_impl.lower_bound(__x)),
205 return pair<const_iterator,const_iterator>(const_iterator(&_M_iter_list, _M_non_dbg_impl.lower_bound(__x)),
  /prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/debug/
_tree.h 185 iterator lower_bound(const _KT& __x) function in class:_Rb_tree
186 { return iterator(&_M_iter_list, _M_non_dbg_impl.lower_bound(__x)); }
188 const_iterator lower_bound(const _KT& __x) const function in class:_Rb_tree
189 { return const_iterator(&_M_iter_list, _M_non_dbg_impl.lower_bound(__x)); }
200 return pair<iterator, iterator>(iterator(&_M_iter_list, _M_non_dbg_impl.lower_bound(__x)),
205 return pair<const_iterator,const_iterator>(const_iterator(&_M_iter_list, _M_non_dbg_impl.lower_bound(__x)),
  /prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/debug/
_tree.h 185 iterator lower_bound(const _KT& __x) function in class:_Rb_tree
186 { return iterator(&_M_iter_list, _M_non_dbg_impl.lower_bound(__x)); }
188 const_iterator lower_bound(const _KT& __x) const function in class:_Rb_tree
189 { return const_iterator(&_M_iter_list, _M_non_dbg_impl.lower_bound(__x)); }
200 return pair<iterator, iterator>(iterator(&_M_iter_list, _M_non_dbg_impl.lower_bound(__x)),
205 return pair<const_iterator,const_iterator>(const_iterator(&_M_iter_list, _M_non_dbg_impl.lower_bound(__x)),
  /prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/debug/
_tree.h 185 iterator lower_bound(const _KT& __x) function in class:_Rb_tree
186 { return iterator(&_M_iter_list, _M_non_dbg_impl.lower_bound(__x)); }
188 const_iterator lower_bound(const _KT& __x) const function in class:_Rb_tree
189 { return const_iterator(&_M_iter_list, _M_non_dbg_impl.lower_bound(__x)); }
200 return pair<iterator, iterator>(iterator(&_M_iter_list, _M_non_dbg_impl.lower_bound(__x)),
205 return pair<const_iterator,const_iterator>(const_iterator(&_M_iter_list, _M_non_dbg_impl.lower_bound(__x)),
  /prebuilts/ndk/9/sources/cxx-stl/EH/stlport/stlport/stl/debug/
_tree.h 185 iterator lower_bound(const _KT& __x) function in class:_Rb_tree
186 { return iterator(&_M_iter_list, _M_non_dbg_impl.lower_bound(__x)); }
188 const_iterator lower_bound(const _KT& __x) const function in class:_Rb_tree
189 { return const_iterator(&_M_iter_list, _M_non_dbg_impl.lower_bound(__x)); }
200 return pair<iterator, iterator>(iterator(&_M_iter_list, _M_non_dbg_impl.lower_bound(__x)),
205 return pair<const_iterator,const_iterator>(const_iterator(&_M_iter_list, _M_non_dbg_impl.lower_bound(__x)),
  /external/oprofile/libpp/
sample_container.cpp 53 return samples.lower_bound(key);
93 iterator it1 = samples_by_loc.lower_bound(&lower);
  /external/stlport/stlport/stl/
_set.h 196 iterator lower_bound(const _KT& __x) { return _M_t.lower_bound(__x); } function in class:set
198 const_iterator lower_bound(const _KT& __x) const { return _M_t.lower_bound(__x); } function in class:set
367 iterator lower_bound(const _KT& __x) { return _M_t.lower_bound(__x); } function in class:multiset
369 const_iterator lower_bound(const _KT& __x) const { return _M_t.lower_bound(__x); } function in class:multiset
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.binary.search/lower.bound/
lower_bound.pass.cpp 15 // lower_bound(Iter first, Iter last, const T& value);
27 Iter i = std::lower_bound(first, last, value);
lower_bound_comp.pass.cpp 15 // lower_bound(Iter first, Iter last, const T& value);
28 Iter i = std::lower_bound(first, last, value, std::greater<int>());
  /ndk/sources/cxx-stl/stlport/stlport/stl/
_set.h 196 iterator lower_bound(const _KT& __x) { return _M_t.lower_bound(__x); } function in class:set
198 const_iterator lower_bound(const _KT& __x) const { return _M_t.lower_bound(__x); } function in class:set
367 iterator lower_bound(const _KT& __x) { return _M_t.lower_bound(__x); } function in class:multiset
369 const_iterator lower_bound(const _KT& __x) const { return _M_t.lower_bound(__x); } function in class:multiset
  /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/
_set.h 196 iterator lower_bound(const _KT& __x) { return _M_t.lower_bound(__x); } function in class:set
198 const_iterator lower_bound(const _KT& __x) const { return _M_t.lower_bound(__x); } function in class:set
367 iterator lower_bound(const _KT& __x) { return _M_t.lower_bound(__x); } function in class:multiset
369 const_iterator lower_bound(const _KT& __x) const { return _M_t.lower_bound(__x); } function in class:multiset

Completed in 984 milliseconds

1 2 3 4 5 6 7 8 91011>>