Home
last modified time | relevance | path

Searched refs:upper_bound (Results 1 – 16 of 16) sorted by relevance

/external/stlport/test/unit/
Dset_test.cpp139 sit = s.upper_bound(5); in bounds()
162 scit = s.upper_bound(5); in bounds()
180 scit = crs.upper_bound(5); in bounds()
409 CPPUNIT_ASSERT( keySet.upper_bound(2) != keySet.end() ); in template_methods()
415 CPPUNIT_ASSERT( ckeySet.upper_bound(2) != ckeySet.end() ); in template_methods()
433 CPPUNIT_ASSERT( keySet.upper_bound(2) != keySet.end() ); in template_methods()
439 CPPUNIT_ASSERT( ckeySet.upper_bound(2) != ckeySet.end() ); in template_methods()
456 CPPUNIT_ASSERT( keySet.upper_bound(2) != keySet.end() ); in template_methods()
462 CPPUNIT_ASSERT( ckeySet.upper_bound(2) != ckeySet.end() ); in template_methods()
480 CPPUNIT_ASSERT( keySet.upper_bound(2) != keySet.end() ); in template_methods()
[all …]
Dmap_test.cpp138 i = m.upper_bound(3); in mmap2()
248 i = m.upper_bound( 'x' ); in equal_range()
353 CPPUNIT_ASSERT( cont.upper_bound(2) != cont.end() ); in template_methods()
359 CPPUNIT_ASSERT( ccont.upper_bound(2) != ccont.end() ); in template_methods()
378 CPPUNIT_ASSERT( cont.upper_bound(2) != cont.end() ); in template_methods()
384 CPPUNIT_ASSERT( ccont.upper_bound(2) != ccont.end() ); in template_methods()
402 CPPUNIT_ASSERT( cont.upper_bound(2) != cont.end() ); in template_methods()
408 CPPUNIT_ASSERT( ccont.upper_bound(2) != ccont.end() ); in template_methods()
427 CPPUNIT_ASSERT( cont.upper_bound(2) != cont.end() ); in template_methods()
433 CPPUNIT_ASSERT( ccont.upper_bound(2) != ccont.end() ); in template_methods()
Dmultiset_test.cpp70 i = s.upper_bound(3); in mset3()
80 ci = s.upper_bound(3); in mset3()
93 ci = crs.upper_bound(3); in mset3()
Dbound_test.cpp46 int location = upper_bound((int*)arr, (int*)arr + 20, 3) - arr; in uprbnd1()
56 …int location = (upper_bound((char const**)str, (char const**)str + strCt, (const char *)"d", char… in uprbnd2()
Dequal_test.cpp113 it = upper_bound(tv.begin(), tv.end(), 5); in equal_range2()
/external/stlport/stlport/stl/
D_set.h200 iterator upper_bound(const _KT& __x) { return _M_t.upper_bound(__x); } in _STLP_CREATE_ITERATOR_TRAITS()
202 const_iterator upper_bound(const _KT& __x) const { return _M_t.upper_bound(__x); } in _STLP_CREATE_ITERATOR_TRAITS()
371 iterator upper_bound(const _KT& __x) { return _M_t.upper_bound(__x); } in _STLP_CREATE_ITERATOR_TRAITS()
373 const_iterator upper_bound(const _KT& __x) const { return _M_t.upper_bound(__x); } in _STLP_CREATE_ITERATOR_TRAITS()
D_map.h220 iterator upper_bound(const _KT& __x) { return _M_t.upper_bound(__x); } in _STLP_CREATE_ITERATOR_TRAITS()
222 const_iterator upper_bound(const _KT& __x) const { return _M_t.upper_bound(__x); } in _STLP_CREATE_ITERATOR_TRAITS()
396 iterator upper_bound(const _KT& __x) { return _M_t.upper_bound(__x); } in _STLP_CREATE_ITERATOR_TRAITS()
398 const_iterator upper_bound(const _KT& __x) const { return _M_t.upper_bound(__x); } in _STLP_CREATE_ITERATOR_TRAITS()
D_tree.h605 iterator upper_bound(const _KT& __x) { return iterator(_M_upper_bound(__x)); }
607 const_iterator upper_bound(const _KT& __x) const { return const_iterator(_M_upper_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)); }
D_algo.h507 inline _ForwardIter upper_bound(_ForwardIter __first, _ForwardIter __last, in upper_bound() function
517 inline _ForwardIter upper_bound(_ForwardIter __first, _ForwardIter __last, in upper_bound() function
D_algo.c1144 __first_cut = _STLP_STD::upper_bound(__first, __middle, *__second_cut, __comp); in __merge_adaptive()
1490 __first_cut = _STLP_STD::upper_bound(__first, __middle, *__second_cut, __comp); in __merge_without_buffer()
/external/stlport/stlport/stl/debug/
D_tree.h192 iterator upper_bound(const _KT& __x) in upper_bound() function
193 { return iterator(&_M_iter_list, _M_non_dbg_impl.upper_bound(__x)); } in upper_bound()
195 const_iterator upper_bound(const _KT& __x) const in upper_bound() function
196 { return const_iterator(&_M_iter_list, _M_non_dbg_impl.upper_bound(__x)); } in upper_bound()
201 iterator(&_M_iter_list, _M_non_dbg_impl.upper_bound(__x))); in equal_range()
206 … const_iterator(&_M_iter_list, _M_non_dbg_impl.upper_bound(__x))); in equal_range()
/external/stlport/stlport/stl/pointers/
D_set.h278 iterator upper_bound(const _KT& __x)
279 { return _S_to_value_ite(_M_t.upper_bound(cast_traits::to_storage_type_crefT(__x))); }
281 const_iterator upper_bound(const _KT& __x) const
282 { return _S_to_value_ite(_M_t.upper_bound(cast_traits::to_storage_type_crefT(__x))); }
533 iterator upper_bound(const _KT& __x)
534 { return _S_to_value_ite(_M_t.upper_bound(cast_traits::to_storage_type_crefT(__x))); }
536 const_iterator upper_bound(const _KT& __x) const
537 { return _S_to_value_ite(_M_t.upper_bound(cast_traits::to_storage_type_crefT(__x))); }
/external/clearsilver/util/regex/
Dregex.c2359 int lower_bound = -1, upper_bound = -1; local
2375 GET_UNSIGNED_NUMBER (upper_bound);
2376 if (upper_bound < 0) upper_bound = RE_DUP_MAX;
2380 upper_bound = lower_bound;
2382 if (lower_bound < 0 || upper_bound > RE_DUP_MAX
2383 || lower_bound > upper_bound)
2422 if (upper_bound == 0)
2441 unsigned nbytes = 10 + (upper_bound > 1) * 10;
2451 b + 5 + (upper_bound > 1) * 5,
2462 if (upper_bound > 1)
[all …]
/external/elfutils/tests/
Drun-show-die-info.sh173 Attrs : upper_bound type
426 Attrs : upper_bound type
494 Attrs : upper_bound type
728 Attrs : upper_bound type
744 Attrs : upper_bound type
/external/protobuf/src/google/protobuf/
Ddescriptor_database.cc221 typename map<string, Value>::iterator iter = by_symbol_.upper_bound(name); in FindLastLessOrEqual()
/external/stlport/etc/
DChangeLog-5.11352 count, erase, lower_bound, upper_bound, equal_range.
3147 * stlport/stl/_alogobase.c: Small equal_range optimization, upper_bound is not called
7438 * _algo.c : relaxed type requirements for lower_bound, upper_bound, binary_search