/external/chromium_org/third_party/skia/src/views/ |
H A D | SkEventSink.cpp | 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/chromium_org/tools/deep_memory_profiler/lib/ |
H A D | sorter.py | 382 def find(self, unit): member in class:AbstractSorter 399 def find(self, unit): member in class:VMSorter 412 def find(self, unit): member in class:MallocSorter
|
/external/chromium_org/tools/emacs/ |
H A D | flymake-chromium.el | 61 "Strip cruft from the passed-in filename to help flymake find the real file." 88 ;; couldn't find a way to have it tell me what the relevant error for this 92 (nth 0 (flymake-find-err-info flymake-err-info line-no))) 96 (defun cr-flymake-find-file () 110 (flymake-find-file-hook) 115 (add-hook 'find-file-hook 'cr-flymake-find-file 'append)
|
/external/chromium_org/ui/events/ |
H A D | event_rewriter_unittest.cc | 119 RewriteRules::iterator find = variable 120 rules_.find(RewriteCase(state_, event.type())); 121 if (find == rules_.end()) 123 if ((find->second.status == EVENT_REWRITE_REWRITTEN) || 124 (find->second.status == EVENT_REWRITE_DISPATCH_ANOTHER)) { 125 last_rewritten_event_ = new TestEvent(find->second.type); 130 state_ = find->second.state; 131 return find->second.status;
|
/external/chromium_org/v8/src/ |
H A D | hashmap.h | 339 Iterator find(Key* key, bool insert = false, function in class:v8::TemplateHashMap
|
/external/clang/unittests/Tooling/ |
H A D | CompilationDatabaseTest.cpp | 140 StringRef find(StringRef Path) { function in class:clang::tooling::FileMatchTrieTest 152 EXPECT_EQ("//net/path/file.cc", find("//net/path/file.cc")); 156 EXPECT_EQ("", find("file.cc")); 162 EXPECT_EQ("//net/d/b/b.cc", find("//net/d/b/b.cc")); 167 EXPECT_EQ("//net/AA/file.cc", find("//net/aa/file.cc")); 173 EXPECT_TRUE(find("//net/aa/file.cc").empty()); 181 EXPECT_EQ("//net/SRC/aa/file.cc", find("//net/src/aa/file.cc")); 185 EXPECT_TRUE(find("//net/some/path").empty()); 191 EXPECT_EQ("", find("//net/somepath/somefile.cc")); 197 EXPECT_EQ("//net/path/file.cc", find("//ne [all...] |
/external/javassist/src/main/javassist/bytecode/stackmap/ |
H A D | BasicBlock.java | 41 public static BasicBlock find(BasicBlock[] blocks, int pos) method in class:BasicBlock 382 BasicBlock handler = find(blocks, et.handlerPc(i));
|
/external/libphonenumber/java/src/com/android/i18n/phonenumbers/ |
H A D | PhoneNumberMatcher.java | 45 * The phone number pattern used by {@link #find}, similar to 242 * Attempts to find the next subsequence in the searched sequence on or after {@code searchIndex} 248 private PhoneNumberMatch find(int index) { method in class:PhoneNumberMatcher 250 while ((maxTries > 0) && matcher.find(index)) { 277 if (trailingCharsMatcher.find()) { 316 if (SLASH_SEPARATED_DATES.matcher(candidate).find()) { 321 if (TIME_STAMPS.matcher(candidate).find()) { 335 // If that failed, try to find an "inner match" - there might be a phone number within this 353 while (groupMatcher.find() && maxTries > 0) { 391 if (!MATCHING_BRACKETS.matcher(candidate).matches() || PUB_PAGES.matcher(candidate).find()) { [all...] |
/external/llvm/include/llvm/ADT/ |
H A D | DenseSet.h | 112 iterator find(const ValueT &V) { return Iterator(TheMap.find(V)); } function in class:llvm::DenseSet
|
/external/llvm/include/llvm/CodeGen/ |
H A D | LiveIntervalUnion.h | 72 SegmentIter find(SlotIndex x) { return Segments.find(x); } function in class:llvm::LiveIntervalUnion
|
/external/mesa3d/src/gallium/state_trackers/clover/core/ |
H A D | compat.hpp | 265 find(const string &s) const { function in class:clover::compat::string
|
/external/oprofile/libpp/ |
H A D | profile_container.cpp | 265 return symbols->find(filename, linenr); 272 return symbols->find(filename); 320 symbol_entry const * profile_container::find(symbol_entry const & symbol) const function in class:profile_container 322 return symbols->find(symbol);
|
/external/regex-re2/util/ |
H A D | 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/src/animator/ |
H A D | 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);
|
H A D | SkTDArray_Experimental.h | 48 int find(const int32_t& elem) const; 120 int find(const T& elem) const { return SkDS32Array::find((const int32_t&) elem); } function in class:SkTDS32Array
|
/external/skia/src/core/ |
H A D | 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
|
H A D | SkTDynamicHash.h | 63 T* find(const Key& key) const { function in class:SkTDynamicHash 81 SkASSERT(NULL == this->find(GetKey(*newEntry))); 89 SkASSERT(NULL != this->find(key)); 135 SKTDYNAMICHASH_CHECK(NULL != this->find(GetKey(*fArray[i])));
|
/external/skia/src/gpu/ |
H A D | GrResourceCache.cpp | 200 GrCacheable* GrResourceCache::find(const GrResourceKey& key, uint32_t ownershipFlags) { function in class:GrResourceCache 208 entry = fCache.find<GrTFindUnreffedFunctor>(key, functor); 210 entry = fCache.find(key); 363 // default find functor that gives us back resources whether we own 369 while (GrResourceCacheEntry* entry = fCache.find(invalidated[i].key, GrTFindUnreffedFunctor())) { 500 SkASSERT(fCache.find(entry->key()));
|
/external/skia/src/pdf/ |
H A D | SkTSet.h | 19 Main operations supported now are: add, merge, find and contains. 125 int i = find(elem, &pos); 213 return (this->find(elem) >= 0); 321 int find(const T& elem, int* posToInsertSorted = NULL) const { function in class:SkTSet
|
/external/skia/src/views/ |
H A D | SkEventSink.cpp | 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/stlport/stlport/stl/ |
H A D | _algobase.c | 221 _InputIter find(_InputIter __first, _InputIter __last, const _Tp& __val) { function
|
H A D | _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
|
H A D | _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
|
H A D | char_traits.h | 160 static const char_type* _STLP_CALL find(const char_type* __s, size_t __n, const char_type& __c) { function in class:__char_traits_base
|
/external/stlport/stlport/stl/debug/ |
H A D | _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);
|