/external/stlport/stlport/stl/ |
H A D | _hash_map.h | 195 iterator find(const _KT& __key) { return _M_ht.find(__key); } function in class:hash_map 197 const_iterator find(const _KT& __key) const { return _M_ht.find(__key); } function in class:hash_map 201 iterator __it = _M_ht.find(__key); 388 iterator find(const _KT& __key) { return _M_ht.find(__key); } function in class:hash_multimap 390 const_iterator find(const _KT& __key) const { return _M_ht.find(__key); } function in class:hash_multimap
|
H A D | _hash_set.h | 197 iterator find(const _KT& __key) { return _M_ht.find(__key); } function in class:hash_set 199 const_iterator find(const _KT& __key) const { return _M_ht.find(__key); } function in class:hash_set 378 iterator find(const _KT& __key) { return _M_ht.find(__key); } function in class:hash_multiset 381 const_iterator find(const _KT& __key) const { return _M_ht.find(__key); } function in class:hash_multiset
|
H A D | _string.c | 420 __size_type__ basic_string<_CharT,_Traits,_Alloc>::find( const _CharT* __s, size_type __pos, function in class:_Alloc 438 __size_type__ basic_string<_CharT,_Traits,_Alloc>::find(_CharT __c, size_type __pos) const function in class:_Alloc
|
H A D | _unordered_map.h | 148 iterator find(const _KT& __key) { return _M_ht.find(__key); } function in class:unordered_map 150 const_iterator find(const _KT& __key) const { return _M_ht.find(__key); } function in class:unordered_map 154 iterator __it = _M_ht.find(__key); 316 iterator find(const _KT& __key) { return _M_ht.find(__key); } function in class:unordered_multimap 318 const_iterator find(const _KT& __key) const { return _M_ht.find(__key); } function in class:unordered_multimap
|
H A D | _unordered_set.h | 142 iterator find(const _KT& __key) { return _M_ht.find(__key); } function in class:unordered_set 144 const_iterator find(const _KT& __key) const { return _M_ht.find(__key); } function in class:unordered_set 292 iterator find(const _KT& __key) { return _M_ht.find(__key); } function in class:unordered_multiset 294 const_iterator find(const _KT& __key) const { return _M_ht.find(__key); } function in class:unordered_multiset
|
H A D | _hashtable.h | 511 iterator find(const _KT& __key) { return _M_find(__key); } function in class:hashtable 513 const_iterator find(const _KT& __key) const { return _M_find(__key); } function in class:hashtable
|
H A D | _string_sum.h | 188 //find family 189 size_type find(const _BString& __s, size_type __pos = 0) const { return _M_get_storage().find(__s, __pos); } function in class:__bstr_sum 190 size_type find(const _CharT* __s, size_type __pos = 0) const { return _M_get_storage().find(__s, __pos); } function in class:__bstr_sum 191 size_type find(const _CharT* __s, size_type __pos, size_type __n) const { return _M_get_storage().find(__s, __pos, __n); } function in class:__bstr_sum 192 size_type find(_CharT __c, size_type __pos = 0) const { return _M_get_storage().find(__c, __pos); } function in class:__bstr_sum 206 { return _M_get_storage().find(__ [all...] |
/external/stlport/stlport/stl/debug/ |
H A D | _hashtable.h | 261 iterator find(const _KT& __key) function in class:hashtable 262 { return iterator(&_M_iter_list, _M_non_dbg_impl.find(__key)); } 264 const_iterator find(const _KT& __key) const function in class:hashtable 265 { return const_iterator(&_M_iter_list, _M_non_dbg_impl.find(__key)); }
|
H A D | _string.h | 692 // find. 693 size_type find(const _Self& __s, size_type __pos = 0) const function in class:basic_string 694 { return _M_non_dbg_impl.find(__s._M_non_dbg_impl, __pos); } 695 size_type find(const _CharT* __s, size_type __pos = 0) const { function in class:basic_string 698 return _M_non_dbg_impl.find(__s, __pos); 700 size_type find(const _CharT* __s, size_type __pos, size_type __n) const { function in class:basic_string 703 return _M_non_dbg_impl.find(__s, __pos, __n); 706 size_type find(_CharT __c) const { return find(__c, 0); } function in class:basic_string 707 size_type find(_Char function in class:basic_string [all...] |
/external/stlport/stlport/stl/pointers/ |
H A D | _set.h | 263 const_iterator find(const _KT& __x) const function in class:set 264 { return _S_to_value_ite(_M_t.find(cast_traits::to_storage_type_crefT(__x))); } 266 iterator find(const _KT& __x) function in class:set 267 { return _S_to_value_ite(_M_t.find(cast_traits::to_storage_type_crefT(__x))); } 270 { return _M_t.find(cast_traits::to_storage_type_crefT(__x)) == _M_t.end() ? 0 : 1; } 518 iterator find(const _KT& __x) function in class:multiset 519 { return _S_to_value_ite(_M_t.find(cast_traits::to_storage_type_crefT(__x))); } 521 const_iterator find(const _KT& __x) const function in class:multiset 522 { return _S_to_value_ite(_M_t.find(cast_traits::to_storage_type_crefT(__x))); }
|
/external/xmp_toolkit/XMPCore/src/com/adobe/xmp/impl/ |
H A D | XMPNode.java | 232 return find(getChildren(), expr); 341 return find(qualifier, expr); 869 * Internal find. 874 private XMPNode find(List list, String expr) method in class:XMPNode
|
/external/chromium_org/chrome/installer/mini_installer/ |
H A D | mini_installer.cc | 635 HANDLE find = ::FindFirstFile(path->get(), &find_data); local 636 if (find != INVALID_HANDLE_VALUE) { 653 } while (::FindNextFile(find, &find_data)); 654 ::FindClose(find); 675 HANDLE find = ::FindFirstFileEx(spec.get(), FindExInfoStandard, &find_data, local 677 if (find == INVALID_HANDLE_VALUE) 691 } while (::FindNextFile(find, &find_data)); 692 ::FindClose(find);
|
/external/chromium_org/third_party/WebKit/Source/web/ |
H A D | TextFinder.cpp | 94 bool TextFinder::find(int identifier, const WebString& searchText, const WebFindOptions& options, bool wrapWithinFrame, WebRect* selectionRect) function in class:blink::TextFinder 152 // to find the active rect for us and report it back to the UI. 221 // Now, defer scoping until later to allow find operation to finish quickly. 261 // find an alternative. 281 // the bounding box for it is. In this case we set the first match we find 292 // find this rect during scoping it means we have found the active 652 // Don't scope if we can't find a frame or a view. 654 // Also ignore detached frames, as many find operations report to the main frame. 683 m_deferredScopingWork.remove(m_deferredScopingWork.find(caller));
|
/external/chromium_org/third_party/WebKit/Source/wtf/text/ |
H A D | WTFString.h | 91 // You can find documentation about this class in this doc: 203 size_t find(UChar c, unsigned start = 0) const function in class:WTF::String 204 { return m_impl ? m_impl->find(c, start) : kNotFound; } 206 size_t find(const String& str) const function in class:WTF::String 207 { return m_impl ? m_impl->find(str.impl()) : kNotFound; } 208 size_t find(const String& str, unsigned start) const function in class:WTF::String 209 { return m_impl ? m_impl->find(str.impl(), start) : kNotFound; } 211 size_t find(CharacterMatchFunctionPtr matchFunction, unsigned start = 0) const function in class:WTF::String 212 { return m_impl ? m_impl->find(matchFunction, start) : kNotFound; } 213 size_t find(cons function in class:WTF::String 234 size_t find(const LChar* str, unsigned start, bool caseSensitive) const function in class:WTF::String 236 size_t find(const String& str, unsigned start, bool caseSensitive) const function in class:WTF::String [all...] |
/external/chromium_org/third_party/jinja2/ |
H A D | nodes.py | 177 def find(self, node_type): member in class:Node
|
/external/chromium_org/third_party/skia/src/gpu/ |
H A D | GrRedBlackTree.h | 100 * @param t the item to find. 103 Iter find(const T& t); 106 * @param t the item to find. 113 * @param t the item to find. 255 typename GrRedBlackTree<T,C>::Iter GrRedBlackTree<T,C>::find(const T& t) { function in class:GrRedBlackTree 601 // if x is an interior node then we find it's successor
|
/external/guava/guava/src/com/google/common/collect/ |
H A D | Iterators.java | 715 * #find(Iterator, Predicate, T)} instead. 720 public static <T> T find( method in class:Iterators 735 public static <T> T find(Iterator<T> iterator, Predicate<? super T> predicate, method in class:Iterators
|
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
H A D | Iterators.java | 679 * #find(Iterator, Predicate, T)} instead. 684 public static <T> T find( method in class:Iterators 699 public static <T> T find(Iterator<T> iterator, Predicate<? super T> predicate, method in class:Iterators
|
/external/llvm/include/llvm/ADT/ |
H A D | StringMap.h | 277 iterator find(StringRef Key) { function in class:llvm::StringMap 283 const_iterator find(StringRef Key) const { function in class:llvm::StringMap 292 const_iterator it = find(Key); 304 return find(Key) == end() ? 0 : 1; 391 iterator I = find(Key);
|
/external/llvm/include/llvm/IR/ |
H A D | ValueMap.h | 119 iterator find(const KeyT &Val) { function in class:llvm::ValueMap 122 const_iterator find(const KeyT &Val) const { function in class:llvm::ValueMap 239 typename ValueMapT::MapT::iterator I = Copy.Map->Map.find(Copy);
|
/external/llvm/include/llvm/Support/ |
H A D | OnDiskHashTable.h | 210 /// typedef ExampleKey external_key_type; // The type to pass to find(). 286 iterator find(const external_key_type &EKey, Info *InfoPtr = 0) { function in class:llvm::OnDiskChainedHashTable
|
/external/opencv/cvaux/src/ |
H A D | cv3dtracker.cpp | 395 static const Cv3dTracker2dTrackedObject *find(const Cv3dTracker2dTrackedObject v[], int num_objects, int id) function 440 // find an approximation of the objects location for each pair of cameras that 450 const Cv3dTracker2dTrackedObject *o1 = find(&tracking_info[c1*num_objects], 463 const Cv3dTracker2dTrackedObject *o2 = find(&tracking_info[c2*num_objects], 476 // find the intersection of the two lines (or the points of closest
|
/external/skia/src/gpu/ |
H A D | GrRedBlackTree.h | 100 * @param t the item to find. 103 Iter find(const T& t); 106 * @param t the item to find. 113 * @param t the item to find. 255 typename GrRedBlackTree<T,C>::Iter GrRedBlackTree<T,C>::find(const T& t) { function in class:GrRedBlackTree 601 // if x is an interior node then we find it's successor
|
/external/stlport/test/unit/ |
H A D | string_test.cpp | 62 CPPUNIT_TEST(find); 121 void find(); 638 void StringTest::find() function in class:StringTest 641 CPPUNIT_ASSERT( s.find("one") == 0 ); 642 CPPUNIT_ASSERT( s.find('t') == 4 ); 643 CPPUNIT_ASSERT( s.find('t', 5) == 8 ); 652 CPPUNIT_ASSERT( s.find("four") == npos_local ); 653 CPPUNIT_ASSERT( s.find("one", string::npos) == npos_local ); 660 CPPUNIT_ASSERT( s.substr(s.find(empty), empty.size()) == empty ); 665 /* ISO/IEC 14882 2003, 21.3.6.1 basic_string::find [li [all...] |
/external/chromium_org/cc/resources/ |
H A D | picture_layer_tiling.cc | 121 DCHECK(tiles_.find(key) == tiles_.end()); 160 TileMap::iterator find = tiles_.find(key); local 161 if (find != tiles_.end()) 466 TileMap::iterator found = tiles_.find(TileMapKey(i, j)); 599 TileMap::iterator find = tiles_.find(iter.index()); local 600 if (find == tiles_.end()) 603 Tile* tile = find->second.get(); 621 TileMap::iterator find local 644 TileMap::iterator find = tiles_.find(iter.index()); local 670 TileMap::iterator find = tiles_.find(iter.index()); local [all...] |