/external/stlport/test/unit/ |
H A D | equal_test.cpp | 44 pair<int*, int*> range = equal_range((int*)numbers, (int*)numbers + 10, 2); 56 pair<IntVec::iterator, IntVec::iterator> range = equal_range(v.begin(), v.end(), 2); 62 range = equal_range(v.begin(), v.end(), 4); 95 pair<char*, char*> range = equal_range((char*)chars, (char*)chars + count, 'q', less<char>()); 101 range = equal_range((char*)chars, (char*)chars + count, 'm', less<char>()); 121 p = equal_range(tv.begin(), tv.end(), 5);
|
H A D | map_test.cpp | 24 CPPUNIT_TEST(equal_range); 37 void equal_range(); 227 void MapTest::equal_range() function in class:MapTest 235 ret = m.equal_range('x'); 252 ret = m.equal_range('x'); 260 ret = m.equal_range('x'); 354 CPPUNIT_ASSERT( cont.equal_range(2) != make_pair(cont.begin(), cont.end()) ); 360 CPPUNIT_ASSERT( ccont.equal_range(2) != make_pair(ccont.end(), ccont.end()) ); 379 CPPUNIT_ASSERT( cont.equal_range(2) != make_pair(cont.begin(), cont.end()) ); 385 CPPUNIT_ASSERT( ccont.equal_range( [all...] |
H A D | multiset_test.cpp | 72 pair<mset::iterator, mset::iterator> p = s.equal_range(5); 84 cp = s.equal_range(5); 95 cp = crs.equal_range(5);
|
H A D | set_test.cpp | 143 pit = s.equal_range(6); 150 pit = s.equal_range(4); 167 pcit = s.equal_range(6); 184 pcit = crs.equal_range(6); 410 CPPUNIT_ASSERT( keySet.equal_range(2) != make_pair(keySet.begin(), keySet.end()) ); 416 CPPUNIT_ASSERT( ckeySet.equal_range(2) != make_pair(ckeySet.begin(), ckeySet.end()) ); 434 CPPUNIT_ASSERT( keySet.equal_range(2) != make_pair(keySet.begin(), keySet.end()) ); 440 CPPUNIT_ASSERT( ckeySet.equal_range(2) != make_pair(ckeySet.begin(), ckeySet.end()) ); 457 CPPUNIT_ASSERT( keySet.equal_range(2) != make_pair(keySet.begin(), keySet.end()) ); 463 CPPUNIT_ASSERT( ckeySet.equal_range( [all...] |
H A D | unordered_test.cpp | 36 CPPUNIT_TEST(equal_range); 53 void equal_range(); 344 void UnorderedTest::equal_range() function in class:UnorderedTest 366 pair<umset::iterator, umset::iterator> p = iumset.equal_range(1); 377 p = iumset.equal_range(2); 414 pair<umset::iterator, umset::iterator> p = iumset.equal_range(targetedBucket); 584 CPPUNIT_ASSERT( cont.equal_range(2) != make_pair(cont.begin(), cont.end()) ); 589 CPPUNIT_ASSERT( ccont.equal_range(2) != make_pair(ccont.begin(), ccont.end()) ); 605 CPPUNIT_ASSERT( cont.equal_range(2) != make_pair(cont.begin(), cont.end()) ); 610 CPPUNIT_ASSERT( ccont.equal_range( [all...] |
H A D | hash_test.cpp | 175 // Thus, when calling equal_range(key) the begin/end of that block is returned. 178 // After that rehash, equal_range only returns 2 elements with key = 3 whereas there are 65 in it. 209 pair<hashType::iterator,hashType::iterator> range = h.equal_range( i->first ); 230 pair<hashType::iterator,hashType::iterator> range = h.equal_range(mIter->first);
|
/external/stlport/stlport/stl/ |
H A D | _unordered_map.h | 164 pair<iterator, iterator> equal_range(const _KT& __key) function in class:unordered_map 165 { return _M_ht.equal_range(__key); } 167 pair<const_iterator, const_iterator> equal_range(const _KT& __key) const function in class:unordered_map 168 { return _M_ht.equal_range(__key); } 324 pair<iterator, iterator> equal_range(const _KT& __key) function in class:unordered_multimap 325 { return _M_ht.equal_range(__key); } 327 pair<const_iterator, const_iterator> equal_range(const _KT& __key) const function in class:unordered_multimap 328 { return _M_ht.equal_range(__key); }
|
H A D | _unordered_set.h | 150 pair<iterator, iterator> equal_range(const _KT& __key) function in class:unordered_set 151 { return _M_ht.equal_range(__key); } 153 pair<const_iterator, const_iterator> equal_range(const _KT& __key) const function in class:unordered_set 154 { return _M_ht.equal_range(__key); } 300 pair<iterator, iterator> equal_range(const _KT& __key) function in class:unordered_multiset 301 { return _M_ht.equal_range(__key); } 303 pair<const_iterator, const_iterator> equal_range(const _KT& __key) const function in class:unordered_multiset 304 { return _M_ht.equal_range(__key); }
|
H A D | _map.h | 225 pair<iterator,iterator> equal_range(const _KT& __x) function in class:map 228 pair<const_iterator,const_iterator> equal_range(const _KT& __x) const function in class:map 400 pair<iterator,iterator> equal_range(const _KT& __x) function in class:multimap 401 { return _M_t.equal_range(__x); } 403 pair<const_iterator,const_iterator> equal_range(const _KT& __x) const function in class:multimap 404 { return _M_t.equal_range(__x); }
|
H A D | _set.h | 204 pair<iterator, iterator> equal_range(const _KT& __x) function in class:set 207 pair<const_iterator, const_iterator> equal_range(const _KT& __x) const function in class:set 375 pair<iterator, iterator> equal_range(const _KT& __x) { return _M_t.equal_range(__x); } function in class:multiset 377 pair<const_iterator, const_iterator> equal_range(const _KT& __x) const { return _M_t.equal_range(__x); } function in class:multiset
|
H A D | _hash_map.h | 211 pair<iterator, iterator> equal_range(const _KT& __key) function in class:hash_map 212 { return _M_ht.equal_range(__key); } 214 pair<const_iterator, const_iterator> equal_range(const _KT& __key) const function in class:hash_map 215 { return _M_ht.equal_range(__key); } 397 equal_range(const _KT& __key) { return _M_ht.equal_range(__key); } function in class:hash_multimap 400 equal_range(const _KT& __key) const { return _M_ht.equal_range(__key); } function in class:hash_multimap
|
H A D | _hash_set.h | 205 pair<iterator, iterator> equal_range(const _KT& __key) function in class:hash_set 206 { return _M_ht.equal_range(__key); } 208 pair<const_iterator, const_iterator> equal_range(const _KT& __key) const function in class:hash_set 209 { return _M_ht.equal_range(__key); } 387 pair<iterator, iterator> equal_range(const _KT& __key) function in class:hash_multiset 388 { return _M_ht.equal_range(__key); } 390 pair<const_iterator, const_iterator> equal_range(const _KT& __key) const function in class:hash_multiset 391 { return _M_ht.equal_range(__key); }
|
H A D | _tree.h | 503 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) function in class:_Rb_tree 612 pair<const_iterator, const_iterator> equal_range(const _KT& __x) const function in class:_Rb_tree
|
H A D | _hashtable.h | 534 pair<iterator, iterator> equal_range(const _KT& __key) { function in class:hashtable 550 pair<const_iterator, const_iterator> equal_range(const _KT& __key) const { function in class:hashtable
|
/external/oprofile/libutil++/ |
H A D | cverb.cpp | 102 object_map->equal_range(name);
|
H A D | bfd_support.cpp | 487 range = image_sections.equal_range(sym->section->name);
|
/external/stlport/stlport/stl/debug/ |
H A D | _hashtable.h | 271 pair<iterator, iterator> equal_range(const _KT& __key) { function in class:hashtable 272 pair<_Base_iterator, _Base_iterator> __res = _M_non_dbg_impl.equal_range(__key); 278 pair<const_iterator, const_iterator> equal_range(const _KT& __key) const { function in class:hashtable 279 pair <_Base_const_iterator, _Base_const_iterator> __res = _M_non_dbg_impl.equal_range(__key); 285 pair<iterator, iterator> __p = equal_range(__key);
|
H A D | _tree.h | 199 pair<iterator,iterator> equal_range(const _KT& __x) { function in class:_Rb_tree 204 pair<const_iterator, const_iterator> equal_range(const _KT& __x) const { function in class:_Rb_tree 276 pair<iterator, iterator> __p = equal_range(__x);
|
/external/oprofile/libpp/ |
H A D | sample_container.cpp | 126 it_pair itp = samples_by_loc.equal_range(&sample);
|
H A D | symbol_container.cpp | 52 pair<it, it> p_it = symbols_by_loc.equal_range(&symbol);
|
/external/stlport/stlport/stl/pointers/ |
H A D | _set.h | 284 pair<iterator, iterator> equal_range(const _KT& __x) { function in class:set 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 { function in class:set 539 pair<iterator, iterator> equal_range(const _KT& __x) { function in class:multiset 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 { function in class:multiset 548 __ret = _M_t.equal_range(cast_traits::to_storage_type_crefT(__x));
|
/external/chromium/chrome/browser/profiles/ |
H A D | profile_dependency_manager.cc | 96 edges.equal_range(node);
|
/external/llvm/lib/Transforms/Vectorize/ |
H A D | BBVectorize.cpp | 749 VPIteratorPair JPairRange = LoadMoveSet->equal_range(J); 875 VPIteratorPair IPairRange = CandidatePairs.equal_range(*I); 885 VPIteratorPair JPairRange = CandidatePairs.equal_range(*J); 920 VPIteratorPair IPairRange = CandidatePairs.equal_range(*I); 943 VPIteratorPair choiceRange = CandidatePairs.equal_range(*PI); 1009 VPPIteratorPair QPairRange = PairableInstUserMap->equal_range(Q); 1014 VPPIteratorPair PPairRange = PairableInstUserMap->equal_range(P); 1044 VPPIteratorPair QPairRange = PairableInstUserMap.equal_range(QTop); 1083 VPPIteratorPair qtRange = ConnectedPairs.equal_range(QTop.first); 1089 CandidatePairs.equal_range( [all...] |
/external/chromium/net/base/ |
H A D | cookie_monster.cc | 684 for (CookieMapItPair its = cookies_.equal_range(GetKey(host)); 705 for (CookieMapItPair its = cookies_.equal_range(GetKey(cookie.Domain())); 1098 for (CookieMapItPair its = cookies_.equal_range(key); 1143 for (CookieMapItPair its = cookies_.equal_range(key); 1333 current, cookies_.equal_range(key), &cookie_its); 1530 CookieMapItPair its_cookies = cookies_.equal_range(key);
|
/external/chromium/chrome/browser/extensions/ |
H A D | extension_webnavigation_api.cc | 239 tab_contents_map_.equal_range(tab_contents);
|