Home
last modified time | relevance | path

Searched refs:equal_range (Results 1 – 25 of 34) sorted by relevance

12

/external/stlport/test/unit/
Dmap_test.cpp24 CPPUNIT_TEST(equal_range);
37 void equal_range();
227 void MapTest::equal_range() in equal_range() function in MapTest
235 ret = m.equal_range('x'); in equal_range()
252 ret = m.equal_range('x'); in equal_range()
260 ret = m.equal_range('x'); in equal_range()
354 CPPUNIT_ASSERT( cont.equal_range(2) != make_pair(cont.begin(), cont.end()) ); in template_methods()
360 CPPUNIT_ASSERT( ccont.equal_range(2) != make_pair(ccont.end(), ccont.end()) ); in template_methods()
379 CPPUNIT_ASSERT( cont.equal_range(2) != make_pair(cont.begin(), cont.end()) ); in template_methods()
385 CPPUNIT_ASSERT( ccont.equal_range(2) != make_pair(ccont.begin(), ccont.end()) ); in template_methods()
[all …]
Dequal_test.cpp44 pair<int*, int*> range = equal_range((int*)numbers, (int*)numbers + 10, 2); in equal_range0()
56 pair<IntVec::iterator, IntVec::iterator> range = equal_range(v.begin(), v.end(), 2); in equal_range1()
62 range = equal_range(v.begin(), v.end(), 4); in equal_range1()
95 pair<char*, char*> range = equal_range((char*)chars, (char*)chars + count, 'q', less<char>()); in equal_range2()
101 range = equal_range((char*)chars, (char*)chars + count, 'm', less<char>()); in equal_range2()
121 p = equal_range(tv.begin(), tv.end(), 5); in equal_range2()
Dset_test.cpp143 pit = s.equal_range(6); in bounds()
150 pit = s.equal_range(4); in bounds()
167 pcit = s.equal_range(6); in bounds()
184 pcit = crs.equal_range(6); in bounds()
410 CPPUNIT_ASSERT( keySet.equal_range(2) != make_pair(keySet.begin(), keySet.end()) ); in template_methods()
416 CPPUNIT_ASSERT( ckeySet.equal_range(2) != make_pair(ckeySet.begin(), ckeySet.end()) ); in template_methods()
434 CPPUNIT_ASSERT( keySet.equal_range(2) != make_pair(keySet.begin(), keySet.end()) ); in template_methods()
440 CPPUNIT_ASSERT( ckeySet.equal_range(2) != make_pair(ckeySet.begin(), ckeySet.end()) ); in template_methods()
457 CPPUNIT_ASSERT( keySet.equal_range(2) != make_pair(keySet.begin(), keySet.end()) ); in template_methods()
463 CPPUNIT_ASSERT( ckeySet.equal_range(2) != make_pair(ckeySet.begin(), ckeySet.end()) ); in template_methods()
[all …]
Dunordered_test.cpp36 CPPUNIT_TEST(equal_range);
53 void equal_range();
344 void UnorderedTest::equal_range() in equal_range() function in UnorderedTest
366 pair<umset::iterator, umset::iterator> p = iumset.equal_range(1); in equal_range()
377 p = iumset.equal_range(2); in equal_range()
414 pair<umset::iterator, umset::iterator> p = iumset.equal_range(targetedBucket); in equal_range()
584 CPPUNIT_ASSERT( cont.equal_range(2) != make_pair(cont.begin(), cont.end()) ); in template_methods()
589 CPPUNIT_ASSERT( ccont.equal_range(2) != make_pair(ccont.begin(), ccont.end()) ); in template_methods()
605 CPPUNIT_ASSERT( cont.equal_range(2) != make_pair(cont.begin(), cont.end()) ); in template_methods()
610 CPPUNIT_ASSERT( ccont.equal_range(2) != make_pair(ccont.begin(), ccont.end()) ); in template_methods()
[all …]
Dmultiset_test.cpp72 pair<mset::iterator, mset::iterator> p = s.equal_range(5); in mset3()
84 cp = s.equal_range(5); in mset3()
95 cp = crs.equal_range(5); in mset3()
Dhash_test.cpp209 pair<hashType::iterator,hashType::iterator> range = h.equal_range( i->first ); in check_keys()
230 pair<hashType::iterator,hashType::iterator> range = h.equal_range(mIter->first); in check_keys()
/external/stlport/stlport/stl/
D_unordered_set.h150 pair<iterator, iterator> equal_range(const _KT& __key) in _STLP_CREATE_HASH_ITERATOR_TRAITS()
151 { return _M_ht.equal_range(__key); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
153 pair<const_iterator, const_iterator> equal_range(const _KT& __key) const in _STLP_CREATE_HASH_ITERATOR_TRAITS()
154 { return _M_ht.equal_range(__key); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
300 pair<iterator, iterator> equal_range(const _KT& __key) in _STLP_CREATE_HASH_ITERATOR_TRAITS()
301 { return _M_ht.equal_range(__key); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
303 pair<const_iterator, const_iterator> equal_range(const _KT& __key) const in _STLP_CREATE_HASH_ITERATOR_TRAITS()
304 { return _M_ht.equal_range(__key); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
D_unordered_map.h164 pair<iterator, iterator> equal_range(const _KT& __key) in _STLP_CREATE_HASH_ITERATOR_TRAITS()
165 { return _M_ht.equal_range(__key); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
167 pair<const_iterator, const_iterator> equal_range(const _KT& __key) const in _STLP_CREATE_HASH_ITERATOR_TRAITS()
168 { return _M_ht.equal_range(__key); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
324 pair<iterator, iterator> equal_range(const _KT& __key) in _STLP_CREATE_HASH_ITERATOR_TRAITS()
325 { return _M_ht.equal_range(__key); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
327 pair<const_iterator, const_iterator> equal_range(const _KT& __key) const in _STLP_CREATE_HASH_ITERATOR_TRAITS()
328 { return _M_ht.equal_range(__key); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
D_hash_set.h205 pair<iterator, iterator> equal_range(const _KT& __key) in _STLP_CREATE_HASH_ITERATOR_TRAITS()
206 { return _M_ht.equal_range(__key); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
208 pair<const_iterator, const_iterator> equal_range(const _KT& __key) const in _STLP_CREATE_HASH_ITERATOR_TRAITS()
209 { return _M_ht.equal_range(__key); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
387 pair<iterator, iterator> equal_range(const _KT& __key) in _STLP_CREATE_HASH_ITERATOR_TRAITS()
388 { return _M_ht.equal_range(__key); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
390 pair<const_iterator, const_iterator> equal_range(const _KT& __key) const in _STLP_CREATE_HASH_ITERATOR_TRAITS()
391 { return _M_ht.equal_range(__key); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
D_hash_map.h211 pair<iterator, iterator> equal_range(const _KT& __key) in _STLP_CREATE_HASH_ITERATOR_TRAITS()
212 { return _M_ht.equal_range(__key); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
214 pair<const_iterator, const_iterator> equal_range(const _KT& __key) const in _STLP_CREATE_HASH_ITERATOR_TRAITS()
215 { return _M_ht.equal_range(__key); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
397 equal_range(const _KT& __key) { return _M_ht.equal_range(__key); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
400 equal_range(const _KT& __key) const { return _M_ht.equal_range(__key); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
D_map.h225 pair<iterator,iterator> equal_range(const _KT& __x) in _STLP_CREATE_ITERATOR_TRAITS()
228 pair<const_iterator,const_iterator> equal_range(const _KT& __x) const in _STLP_CREATE_ITERATOR_TRAITS()
400 pair<iterator,iterator> equal_range(const _KT& __x) in _STLP_CREATE_ITERATOR_TRAITS()
401 { return _M_t.equal_range(__x); } in _STLP_CREATE_ITERATOR_TRAITS()
403 pair<const_iterator,const_iterator> equal_range(const _KT& __x) const in _STLP_CREATE_ITERATOR_TRAITS()
404 { return _M_t.equal_range(__x); } in _STLP_CREATE_ITERATOR_TRAITS()
D_set.h204 pair<iterator, iterator> equal_range(const _KT& __x) in _STLP_CREATE_ITERATOR_TRAITS()
207 pair<const_iterator, const_iterator> equal_range(const _KT& __x) const in _STLP_CREATE_ITERATOR_TRAITS()
375 pair<iterator, iterator> equal_range(const _KT& __x) { return _M_t.equal_range(__x); } in _STLP_CREATE_ITERATOR_TRAITS()
377 …pair<const_iterator, const_iterator> equal_range(const _KT& __x) const { return _M_t.equal_range(_… in _STLP_CREATE_ITERATOR_TRAITS()
D_tree.h503 pair<iterator,iterator> __p = equal_range(__x);
597 pair<const_iterator, const_iterator> __p = equal_range(__x);
609 pair<iterator,iterator> equal_range(const _KT& __x)
612 pair<const_iterator, const_iterator> equal_range(const _KT& __x) const
D_hashtable.h534 pair<iterator, iterator> equal_range(const _KT& __key) {
550 pair<const_iterator, const_iterator> equal_range(const _KT& __key) const {
/external/stlport/stlport/stl/debug/
D_hashtable.h271 pair<iterator, iterator> equal_range(const _KT& __key) { in equal_range() function
272 pair<_Base_iterator, _Base_iterator> __res = _M_non_dbg_impl.equal_range(__key); in equal_range()
278 pair<const_iterator, const_iterator> equal_range(const _KT& __key) const { in equal_range() function
279 pair <_Base_const_iterator, _Base_const_iterator> __res = _M_non_dbg_impl.equal_range(__key); in equal_range()
285 pair<iterator, iterator> __p = equal_range(__key); in erase()
D_tree.h199 pair<iterator,iterator> equal_range(const _KT& __x) { in equal_range() function
204 pair<const_iterator, const_iterator> equal_range(const _KT& __x) const { in equal_range() function
276 pair<iterator, iterator> __p = equal_range(__x); in erase()
/external/stlport/stlport/stl/pointers/
D_set.h284 pair<iterator, iterator> equal_range(const _KT& __x) {
286 __ret = _M_t.equal_range(cast_traits::to_storage_type_crefT(__x));
291 pair<const_iterator, const_iterator> equal_range(const _KT& __x) const {
539 pair<iterator, iterator> equal_range(const _KT& __x) {
541 __ret = _M_t.equal_range(cast_traits::to_storage_type_crefT(__x));
546 pair<const_iterator, const_iterator> equal_range(const _KT& __x) const {
548 __ret = _M_t.equal_range(cast_traits::to_storage_type_crefT(__x));
/external/llvm/lib/Transforms/Vectorize/
DBBVectorize.cpp749 VPIteratorPair JPairRange = LoadMoveSet->equal_range(J); in trackUsesOfI()
875 VPIteratorPair IPairRange = CandidatePairs.equal_range(*I); in computePairsConnectedTo()
885 VPIteratorPair JPairRange = CandidatePairs.equal_range(*J); in computePairsConnectedTo()
920 VPIteratorPair IPairRange = CandidatePairs.equal_range(*I); in computePairsConnectedTo()
943 VPIteratorPair choiceRange = CandidatePairs.equal_range(*PI); in computeConnectedPairs()
1009 VPPIteratorPair QPairRange = PairableInstUserMap->equal_range(Q); in pairsConflict()
1014 VPPIteratorPair PPairRange = PairableInstUserMap->equal_range(P); in pairsConflict()
1044 VPPIteratorPair QPairRange = PairableInstUserMap.equal_range(QTop); in pairWillFormCycle()
1083 VPPIteratorPair qtRange = ConnectedPairs.equal_range(QTop.first); in buildInitialTreeFor()
1089 CandidatePairs.equal_range(k->second.first); in buildInitialTreeFor()
[all …]
/external/oprofile/libutil++/
Dcverb.cpp102 object_map->equal_range(name); in setup()
Dbfd_support.cpp487 range = image_sections.equal_range(sym->section->name); in translate_debuginfo_syms()
/external/oprofile/libpp/
Dsample_container.cpp126 it_pair itp = samples_by_loc.equal_range(&sample); in accumulate_samples()
Dsymbol_container.cpp52 pair<it, it> p_it = symbols_by_loc.equal_range(&symbol); in find()
/external/chromium/chrome/browser/profiles/
Dprofile_dependency_manager.cc96 edges.equal_range(node); in BuildDestructionOrder()
/external/chromium/net/base/
Dcookie_monster.cc684 for (CookieMapItPair its = cookies_.equal_range(GetKey(host)); in DeleteAllForHost()
705 for (CookieMapItPair its = cookies_.equal_range(GetKey(cookie.Domain())); in DeleteCanonicalCookie()
1098 for (CookieMapItPair its = cookies_.equal_range(key); in FindCookiesForKey()
1143 for (CookieMapItPair its = cookies_.equal_range(key); in DeleteAnyEquivalentCookie()
1333 current, cookies_.equal_range(key), &cookie_its); in GarbageCollect()
1530 CookieMapItPair its_cookies = cookies_.equal_range(key); in RecordPeriodicStats()
/external/llvm/lib/CodeGen/
DAggressiveAntiDepBreaker.cpp525 Range = State->GetRegRefs().equal_range(Reg); in GetRenameRegisters()
922 Range = RegRefs.equal_range(CurrReg); in BreakAntiDependencies()

12