| /external/llvm/include/llvm/CodeGen/ |
| LiveIntervalUnion.h | 72 SegmentIter find(SlotIndex x) { return Segments.find(x); } function in class:llvm::LiveIntervalUnion
|
| /external/marisa-trie/lib/marisa/ |
| trie-inline.h | 28 inline std::size_t Trie::find(const std::string &str, function in class:marisa::Trie
31 return find(str.c_str(), str.length(),
35 inline std::size_t Trie::find(const std::string &str, function in class:marisa::Trie
38 return find(str.c_str(), str.length(),
|
| trie-search.cc | 78 std::size_t Trie::find(const char *str, function in class:marisa::Trie
87 std::size_t Trie::find(const char *ptr, std::size_t length, function in class:marisa::Trie
96 std::size_t Trie::find(const char *str, function in class:marisa::Trie
105 std::size_t Trie::find(const char *ptr, std::size_t length, function in class:marisa::Trie
|
| /external/marisa-trie/v0_1_5/lib/marisa_alpha/ |
| trie-inline.h | 28 inline std::size_t Trie::find(const std::string &str, function in class:marisa_alpha::Trie
31 return find(str.c_str(), str.length(),
35 inline std::size_t Trie::find(const std::string &str, function in class:marisa_alpha::Trie
38 return find(str.c_str(), str.length(),
|
| trie-search.cc | 79 std::size_t Trie::find(const char *str, function in class:marisa_alpha::Trie
88 std::size_t Trie::find(const char *ptr, std::size_t length, function in class:marisa_alpha::Trie
98 std::size_t Trie::find(const char *str, function in class:marisa_alpha::Trie
107 std::size_t Trie::find(const char *ptr, std::size_t length, function in class:marisa_alpha::Trie
|
| /external/regex-re2/util/ |
| sparse_array.h | 169 iterator find(int i);
171 const_iterator find(int i) const;
342 typename SparseArray<Value>::iterator SparseArray<Value>::find(int i) { function in class:re2::SparseArray
350 SparseArray<Value>::find(int i) const { function in class:re2::SparseArray
|
| /external/skia/include/core/ |
| SkString.h | 140 int find(const char substring[]) const { function in class:SkString
|
| /external/skia/src/animator/ |
| SkAnimateMaker.h | 60 bool find(const char* str, SkDisplayable** displayablePtr) const { function in class:SkAnimateMaker
61 return fIDs.find(str, displayablePtr);
63 bool find(const char* str, size_t len, SkDisplayable** displayablePtr) const { function in class:SkAnimateMaker
64 return fIDs.find(str, len, displayablePtr);
69 // bool find(SkString& string, SkDisplayable** displayablePtr) {
70 // return fIDs.find(string.c_str(), displayablePtr);
|
| /external/skia/src/core/ |
| SkMetaData.cpp | 147 const Rec* rec = this->find(name, kS32_Type);
160 const Rec* rec = this->find(name, kScalar_Type);
173 const Rec* rec = this->find(name, kScalar_Type);
186 const Rec* rec = this->find(name, kPtr_Type);
203 const Rec* rec = this->find(name, kString_Type);
210 const Rec* rec = this->find(name, kBool_Type);
222 const Rec* rec = this->find(name, kData_Type);
233 const SkMetaData::Rec* SkMetaData::find(const char name[], Type type) const function in class:SkMetaData
|
| /external/skia/src/gpu/ |
| GrResourceCache.cpp | 171 GrResource* GrResourceCache::find(const GrResourceKey& key, uint32_t ownershipFlags) { function in class:GrResourceCache
179 entry = fCache.find<GrTFindUnreffedFunctor>(key, functor);
181 entry = fCache.find(key);
309 // default find functor that gives us back resources whether we own
315 GrResourceEntry* entry = fCache.find(invalidated[i].key, GrTFindUnreffedFunctor());
450 SkASSERT(fCache.find(entry->key()));
|
| /external/skia/src/utils/ |
| SkJSON.cpp | 267 bool SkJSON::Object::find(const char name[], Type t) const { function in class:SkJSON::Object
|
| /external/skia/src/views/ |
| SkEventSink.cpp | 94 return fTagHead ? SkTagList::Find(fTagHead, tag) : NULL;
99 SkASSERT(fTagHead == NULL || SkTagList::Find(fTagHead, rec->fTag) == NULL);
126 int find(SkEventSinkID id) const function in struct:SkListenersTagList
148 if (prev->find(id) >= 0)
186 int index = list->find(id);
289 (void)gNamedSinkIDs.find(name, &id);
|
| /external/smali/util/src/main/java/ds/tree/ |
| RadixTreeImpl.java | 58 public T find(String key) { method in class:RadixTreeImpl
|
| /external/stlport/stlport/stl/ |
| _algobase.c | 221 _InputIter find(_InputIter __first, _InputIter __last, const _Tp& __val) { function
|
| _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
|
| _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
|
| _map.h | 210 iterator find(const _KT& __x) { return _M_t.find(__x); } function in class:map
212 const_iterator find(const _KT& __x) const { return _M_t.find(__x); } function in class:map
214 size_type count(const _KT& __x) const { return _M_t.find(__x) == _M_t.end() ? 0 : 1; }
386 iterator find(const _KT& __x) { return _M_t.find(__x); } function in class:multimap
388 const_iterator find(const _KT& __x) const { return _M_t.find(__x); } function in class:multimap
|
| _set.h | 189 const_iterator find(const _KT& __x) const { return _M_t.find(__x); } function in class:set
191 iterator find(const _KT& __x) { return _M_t.find(__x); } function in class:set
194 { return _M_t.find(__x) == _M_t.end() ? 0 : 1 ; }
361 iterator find(const _KT& __x) { return _M_t.find(__x); } function in class:multiset
363 const_iterator find(const _KT& __x) const { return _M_t.find(__x); } function in class:multiset
|
| _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
|
| _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
|
| /external/stlport/stlport/stl/debug/ |
| _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)); }
|
| _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(_CharT __c, size_type __pos /* = 0 */) cons function in class:basic_string
[all...] |
| _tree.h | 178 iterator find(const _KT& __k) function in class:_Rb_tree
179 { return iterator(&_M_iter_list, _M_non_dbg_impl.find(__k)); }
181 const_iterator find(const _KT& __k) const function in class:_Rb_tree
182 { return const_iterator(&_M_iter_list, _M_non_dbg_impl.find(__k)); }
283 _Base_iterator __i = _M_non_dbg_impl.find(__x);
|
| /external/stlport/test/unit/ |
| set_test.cpp | 24 CPPUNIT_TEST(find);
41 void find();
112 void SetTest::find() function in class:SetTest
116 CPPUNIT_ASSERT( s.find(0) == s.end() );
120 CPPUNIT_ASSERT( crs.find(0) == crs.end() );
407 CPPUNIT_ASSERT( keySet.find(2) != keySet.end() );
413 CPPUNIT_ASSERT( ckeySet.find(2) != ckeySet.end() );
431 CPPUNIT_ASSERT( keySet.find(2) != keySet.end() );
437 CPPUNIT_ASSERT( ckeySet.find(2) != ckeySet.end() );
454 CPPUNIT_ASSERT( keySet.find(2) != keySet.end() )
[all...] |
| /external/v8/src/ |
| hashmap.h | 121 // Find a matching entry.
189 // Find the initial position for the entry at position q.
333 Iterator find(Key* key, bool insert = false) { function in class:v8::TemplateHashMap
|
