/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/map/map.ops/ |
D | lower_bound.pass.cpp | 42 R r = m.lower_bound(5); in main() 44 r = m.lower_bound(7); in main() 46 r = m.lower_bound(9); in main() 48 r = m.lower_bound(11); in main() 50 r = m.lower_bound(13); in main() 52 r = m.lower_bound(15); in main() 54 r = m.lower_bound(17); in main() 56 r = m.lower_bound(19); in main() 58 r = m.lower_bound(4); in main() 60 r = m.lower_bound(6); in main() [all …]
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/set/ |
D | lower_bound.pass.cpp | 42 R r = m.lower_bound(5); in main() 44 r = m.lower_bound(7); in main() 46 r = m.lower_bound(9); in main() 48 r = m.lower_bound(11); in main() 50 r = m.lower_bound(13); in main() 52 r = m.lower_bound(15); in main() 54 r = m.lower_bound(17); in main() 56 r = m.lower_bound(19); in main() 58 r = m.lower_bound(4); in main() 60 r = m.lower_bound(6); in main() [all …]
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multiset/ |
D | lower_bound.pass.cpp | 43 R r = m.lower_bound(4); in main() 45 r = m.lower_bound(5); in main() 47 r = m.lower_bound(6); in main() 49 r = m.lower_bound(7); in main() 51 r = m.lower_bound(8); in main() 53 r = m.lower_bound(9); in main() 55 r = m.lower_bound(11); in main() 73 R r = m.lower_bound(4); in main() 75 r = m.lower_bound(5); in main() 77 r = m.lower_bound(6); in main() [all …]
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multimap/multimap.ops/ |
D | lower_bound.pass.cpp | 43 R r = m.lower_bound(4); in main() 45 r = m.lower_bound(5); in main() 47 r = m.lower_bound(6); in main() 49 r = m.lower_bound(7); in main() 51 r = m.lower_bound(8); in main() 53 r = m.lower_bound(9); in main() 55 r = m.lower_bound(10); in main() 73 R r = m.lower_bound(4); in main() 75 r = m.lower_bound(5); in main() 77 r = m.lower_bound(6); in main() [all …]
|
/ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/detail/ |
D | binary_search.hpp | 37 ForwardIter lower_bound(ForwardIter first, ForwardIter last, in lower_bound() function 62 ForwardIter lower_bound(ForwardIter first, ForwardIter last, in lower_bound() function 158 left = boost::detail::lower_bound(first, middle, val); in equal_range() 190 left = boost::detail::lower_bound(first, middle, val, comp); in equal_range() 202 ForwardIter i = boost::detail::lower_bound(first, last, val); in binary_search() 210 ForwardIter i = boost::detail::lower_bound(first, last, val, comp); in binary_search()
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/rand/rand.dis/rand.dist.samp/rand.dist.samp.pconst/ |
D | eval.pass.cpp | 57 I lb = std::lower_bound(u.begin(), u.end(), b[i]); in main() 58 I ub = std::lower_bound(u.begin(), u.end(), b[i+1]); in main() 117 I lb = std::lower_bound(u.begin(), u.end(), b[i]); in main() 118 I ub = std::lower_bound(u.begin(), u.end(), b[i+1]); in main() 177 I lb = std::lower_bound(u.begin(), u.end(), b[i]); in main() 178 I ub = std::lower_bound(u.begin(), u.end(), b[i+1]); in main() 237 I lb = std::lower_bound(u.begin(), u.end(), b[i]); in main() 238 I ub = std::lower_bound(u.begin(), u.end(), b[i+1]); in main() 297 I lb = std::lower_bound(u.begin(), u.end(), b[i]); in main() 298 I ub = std::lower_bound(u.begin(), u.end(), b[i+1]); in main() [all …]
|
D | eval_param.pass.cpp | 59 I lb = std::lower_bound(u.begin(), u.end(), b[i]); in main() 60 I ub = std::lower_bound(u.begin(), u.end(), b[i+1]); in main()
|
/ndk/tests/device/test-stlport/unit/ |
D | bound_test.cpp | 67 vector<int>::iterator location = lower_bound(v1.begin(), v1.end(), 3); in lwrbnd1() 77 …char const** location = lower_bound((char const**)str, (char const**)str + strCt, (const char *)"… in lwrbnd2()
|
D | set_test.cpp | 135 sit = s.lower_bound(2); in bounds() 158 scit = s.lower_bound(2); in bounds() 176 scit = crs.lower_bound(2); in bounds() 408 CPPUNIT_ASSERT( keySet.lower_bound(2) != keySet.end() ); in template_methods() 414 CPPUNIT_ASSERT( ckeySet.lower_bound(2) != ckeySet.end() ); in template_methods() 432 CPPUNIT_ASSERT( keySet.lower_bound(2) != keySet.end() ); in template_methods() 438 CPPUNIT_ASSERT( ckeySet.lower_bound(2) != ckeySet.end() ); in template_methods() 455 CPPUNIT_ASSERT( keySet.lower_bound(2) != keySet.end() ); in template_methods() 461 CPPUNIT_ASSERT( ckeySet.lower_bound(2) != ckeySet.end() ); in template_methods() 479 CPPUNIT_ASSERT( keySet.lower_bound(2) != keySet.end() ); in template_methods() [all …]
|
D | multiset_test.cpp | 68 i = s.lower_bound(3); in mset3() 78 ci = s.lower_bound(3); in mset3() 91 ci = crs.lower_bound(3); in mset3()
|
D | map_test.cpp | 134 i = m.lower_bound(3); in mmap2() 245 maptype::iterator i = m.lower_bound( 'x' ); in equal_range() 352 CPPUNIT_ASSERT( cont.lower_bound(2) != cont.end() ); in template_methods() 358 CPPUNIT_ASSERT( ccont.lower_bound(2) != ccont.end() ); in template_methods() 377 CPPUNIT_ASSERT( cont.lower_bound(2) != cont.end() ); in template_methods() 383 CPPUNIT_ASSERT( ccont.lower_bound(2) != ccont.end() ); in template_methods() 401 CPPUNIT_ASSERT( cont.lower_bound(2) != cont.end() ); in template_methods() 407 CPPUNIT_ASSERT( ccont.lower_bound(2) != ccont.end() ); in template_methods() 426 CPPUNIT_ASSERT( cont.lower_bound(2) != cont.end() ); in template_methods() 432 CPPUNIT_ASSERT( ccont.lower_bound(2) != ccont.end() ); in template_methods()
|
/ndk/tests/device/test-gnustl-full/unit/ |
D | bound_test.cpp | 67 vector<int>::iterator location = lower_bound(v1.begin(), v1.end(), 3); in lwrbnd1() 77 …char const** location = lower_bound((char const**)str, (char const**)str + strCt, (const char *)"… in lwrbnd2()
|
D | set_test.cpp | 135 sit = s.lower_bound(2); in bounds() 158 scit = s.lower_bound(2); in bounds() 176 scit = crs.lower_bound(2); in bounds() 408 CPPUNIT_ASSERT( keySet.lower_bound(2) != keySet.end() ); in template_methods() 414 CPPUNIT_ASSERT( ckeySet.lower_bound(2) != ckeySet.end() ); in template_methods() 432 CPPUNIT_ASSERT( keySet.lower_bound(2) != keySet.end() ); in template_methods() 438 CPPUNIT_ASSERT( ckeySet.lower_bound(2) != ckeySet.end() ); in template_methods() 455 CPPUNIT_ASSERT( keySet.lower_bound(2) != keySet.end() ); in template_methods() 461 CPPUNIT_ASSERT( ckeySet.lower_bound(2) != ckeySet.end() ); in template_methods() 479 CPPUNIT_ASSERT( keySet.lower_bound(2) != keySet.end() ); in template_methods() [all …]
|
D | multiset_test.cpp | 68 i = s.lower_bound(3); in mset3() 78 ci = s.lower_bound(3); in mset3() 91 ci = crs.lower_bound(3); in mset3()
|
D | map_test.cpp | 134 i = m.lower_bound(3); in mmap2() 245 maptype::iterator i = m.lower_bound( 'x' ); in equal_range() 352 CPPUNIT_ASSERT( cont.lower_bound(2) != cont.end() ); in template_methods() 358 CPPUNIT_ASSERT( ccont.lower_bound(2) != ccont.end() ); in template_methods() 377 CPPUNIT_ASSERT( cont.lower_bound(2) != cont.end() ); in template_methods() 383 CPPUNIT_ASSERT( ccont.lower_bound(2) != ccont.end() ); in template_methods() 401 CPPUNIT_ASSERT( cont.lower_bound(2) != cont.end() ); in template_methods() 407 CPPUNIT_ASSERT( ccont.lower_bound(2) != ccont.end() ); in template_methods() 426 CPPUNIT_ASSERT( cont.lower_bound(2) != cont.end() ); in template_methods() 432 CPPUNIT_ASSERT( ccont.lower_bound(2) != ccont.end() ); in template_methods()
|
/ndk/sources/cxx-stl/stlport/stlport/stl/ |
D | _map.h | 176 iterator __i = lower_bound(__k); in _STLP_CREATE_ITERATOR_TRAITS() 216 iterator lower_bound(const _KT& __x) { return _M_t.lower_bound(__x); } in _STLP_CREATE_ITERATOR_TRAITS() 218 const_iterator lower_bound(const _KT& __x) const { return _M_t.lower_bound(__x); } in _STLP_CREATE_ITERATOR_TRAITS() 392 iterator lower_bound(const _KT& __x) { return _M_t.lower_bound(__x); } in _STLP_CREATE_ITERATOR_TRAITS() 394 const_iterator lower_bound(const _KT& __x) const { return _M_t.lower_bound(__x); } in _STLP_CREATE_ITERATOR_TRAITS()
|
D | _set.h | 196 iterator lower_bound(const _KT& __x) { return _M_t.lower_bound(__x); } in _STLP_CREATE_ITERATOR_TRAITS() 198 const_iterator lower_bound(const _KT& __x) const { return _M_t.lower_bound(__x); } in _STLP_CREATE_ITERATOR_TRAITS() 367 iterator lower_bound(const _KT& __x) { return _M_t.lower_bound(__x); } in _STLP_CREATE_ITERATOR_TRAITS() 369 const_iterator lower_bound(const _KT& __x) const { return _M_t.lower_bound(__x); } in _STLP_CREATE_ITERATOR_TRAITS()
|
D | _tree.h | 601 iterator lower_bound(const _KT& __x) { return iterator(_M_lower_bound(__x)); } 603 const_iterator lower_bound(const _KT& __x) const { return const_iterator(_M_lower_bound(__x)); } 610 { return pair<iterator, iterator>(lower_bound(__x), upper_bound(__x)); } 613 { return pair<const_iterator, const_iterator>(lower_bound(__x), upper_bound(__x)); } 617 __p.second = lower_bound(__x); 630 __p.second = lower_bound(__x);
|
/ndk/sources/cxx-stl/stlport/stlport/stl/debug/ |
D | _tree.h | 185 iterator lower_bound(const _KT& __x) in lower_bound() function 186 { return iterator(&_M_iter_list, _M_non_dbg_impl.lower_bound(__x)); } in lower_bound() 188 const_iterator lower_bound(const _KT& __x) const in lower_bound() function 189 { return const_iterator(&_M_iter_list, _M_non_dbg_impl.lower_bound(__x)); } in lower_bound() 200 return pair<iterator, iterator>(iterator(&_M_iter_list, _M_non_dbg_impl.lower_bound(__x)), in equal_range() 205 …air<const_iterator,const_iterator>(const_iterator(&_M_iter_list, _M_non_dbg_impl.lower_bound(__x)), in equal_range()
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/include/ |
D | set | 145 iterator lower_bound(const key_type& k); 146 const_iterator lower_bound(const key_type& k) const; 148 iterator lower_bound(const K& x); // C++14 150 const_iterator lower_bound(const K& x) const; // C++14 324 iterator lower_bound(const key_type& k); 325 const_iterator lower_bound(const key_type& k) const; 327 iterator lower_bound(const K& x); // C++14 329 const_iterator lower_bound(const K& x) const; // C++14 667 iterator lower_bound(const key_type& __k) 668 {return __tree_.lower_bound(__k);} [all …]
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/rand/rand.dis/rand.dist.samp/rand.dist.samp.plinear/ |
D | eval.pass.cpp | 77 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1; in main() 127 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1; in main() 177 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1; in main() 227 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1; in main() 277 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1; in main() 327 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1; in main()
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/src/ |
D | regex.cpp | 250 _VSTD::lower_bound(begin(collatenames), end(collatenames), s, use_strcmp()); in __get_collation_name() 261 _VSTD::lower_bound(begin(ClassNames), end(ClassNames), s, use_strcmp()); in __get_classname()
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.binary.search/lower.bound/ |
D | lower_bound.pass.cpp | 27 Iter i = std::lower_bound(first, last, value); in test()
|
D | lower_bound_comp.pass.cpp | 28 Iter i = std::lower_bound(first, last, value, std::greater<int>()); in test()
|
/ndk/sources/cxx-stl/stlport/stlport/stl/pointers/ |
D | _set.h | 272 iterator lower_bound(const _KT& __x) 273 { return _S_to_value_ite(_M_t.lower_bound(cast_traits::to_storage_type_crefT(__x))); } 275 const_iterator lower_bound(const _KT& __x) const 276 { return _S_to_value_ite(_M_t.lower_bound(cast_traits::to_storage_type_crefT(__x))); } 527 iterator lower_bound(const _KT& __x) 528 { return _S_to_value_ite(_M_t.lower_bound(cast_traits::to_storage_type_crefT(__x))); } 530 const_iterator lower_bound(const _KT& __x) const 531 { return _S_to_value_ite(_M_t.lower_bound(cast_traits::to_storage_type_crefT(__x))); }
|