Home
last modified time | relevance | path

Searched refs:lower_bound (Results 1 – 22 of 22) sorted by relevance

/external/stlport/test/unit/
Dset_test.cpp135 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 …]
Dmap_test.cpp134 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()
Dmultiset_test.cpp68 i = s.lower_bound(3); in mset3()
78 ci = s.lower_bound(3); in mset3()
91 ci = crs.lower_bound(3); in mset3()
Dbound_test.cpp67 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()
Dequal_test.cpp117 it = lower_bound(tv.begin(), tv.end(), 5); in equal_range2()
/external/stlport/stlport/stl/
D_map.h176 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.h196 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.h601 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);
D_algo.h481 inline _ForwardIter lower_bound(_ForwardIter __first, _ForwardIter __last, in lower_bound() function
491 inline _ForwardIter lower_bound(_ForwardIter __first, _ForwardIter __last, in lower_bound() function
D_algo.c1138 __second_cut = _STLP_STD::lower_bound(__middle, __last, *__first_cut, __comp); in __merge_adaptive()
1484 __second_cut = _STLP_STD::lower_bound(__middle, __last, *__first_cut, __comp); in __merge_without_buffer()
/external/stlport/stlport/stl/debug/
D_tree.h185 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()
/external/stlport/stlport/stl/pointers/
D_set.h272 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))); }
/external/webkit/WebCore/platform/image-decoders/
DImageDecoder.cpp220 const int* matched = std::lower_bound(dataStart + searchStart, dataEnd, valueToMatch); in getScaledValue()
/external/clearsilver/util/regex/
Dregex.c2359 int lower_bound = -1, upper_bound = -1; local
2371 GET_UNSIGNED_NUMBER (lower_bound);
2380 upper_bound = lower_bound;
2382 if (lower_bound < 0 || upper_bound > RE_DUP_MAX
2383 || lower_bound > upper_bound)
2452 lower_bound);
2459 insert_op2 (set_number_at, laststart, 5, lower_bound, b);
/external/protobuf/src/google/protobuf/
Drepeated_field_unittest.cc688 lower_bound(proto_array_.begin(), proto_array_.end(), v); in TEST_F()
796 lower_bound(proto_array_.pointer_begin(), proto_array_.pointer_end(), in TEST_F()
Ddescriptor_database.cc202 by_extension_.lower_bound(make_pair(containing_type, 0)); in FindAllExtensionNumbers()
Dextension_set_heavy.cc305 for (iter = extensions_.lower_bound(start_field_number); in SerializeWithCachedSizesToArray()
Dextension_set.cc1005 for (iter = extensions_.lower_bound(start_field_number); in SerializeWithCachedSizes()
Ddescriptor.cc629 extensions_.lower_bound(make_pair(extendee, 0)); in FindAllExtensions()
/external/webkit/WebKit/android/nav/
DCachedFrame.cpp894 return std::lower_bound(mCachedLayers.begin(), mCachedLayers.end(), test); in layer()
/external/chromium/base/
Dstring_util.cc1522 r_offsets.insert(std::lower_bound(r_offsets.begin(), in DoReplaceStringPlaceholders()
/external/stlport/etc/
DChangeLog-5.11352 count, erase, lower_bound, upper_bound, equal_range.
3148 anymore when lower_bound returned value is already not equivalent to the search value.
3311 * stlport/stl/_tree.h: check iterator returned from lower_bound
7438 * _algo.c : relaxed type requirements for lower_bound, upper_bound, binary_search