/external/skia/src/views/ |
SkTagList.cpp | 24 SkTagList* SkTagList::Find(SkTagList* rec, U8CPU tag)
|
/external/easymock/src/org/easymock/internal/matchers/ |
Find.java | 23 public class Find implements IArgumentMatcher, Serializable {
29 public Find(String regex) {
35 && Pattern.compile(regex).matcher((String) actual).find();
39 buffer.append("find(\"" + regex.replaceAll("\\\\", "\\\\\\\\") + "\")");
|
/external/skia/src/core/ |
SkGlobals.cpp | 25 SkGlobals::Rec* SkGlobals::Find(uint32_t tag, Rec* (*create_proc)())
|
/external/webkit/Source/WebKit/android/plugins/ |
PluginTimer.cpp | 84 PluginTimer* PluginTimer::Find(PluginTimer* list, uint32_t timerID) 130 PluginTimer* timer = PluginTimer::Find(m_list, timerID);
|
/external/skia/src/animator/ |
SkGetCondensedInfo.cpp | 72 const SkMemberInfo* info = SkMemberInfo::Find(type, matchPtr); 98 const SkMemberInfo* SkMemberInfo::Find(SkDisplayTypes type, int* index) { 103 const SkMemberInfo* result = Find(baseTypeLookup, index); 118 const SkMemberInfo* SkMemberInfo::Find(SkDisplayTypes type, const char** matchPtr) {
|
SkDisplayType.cpp | 385 info = SkMemberInfo::Find(info, infoCount, matchPtr); 537 SkDisplayTypes SkDisplayType::Find(SkAnimateMaker* maker, const SkMemberInfo* match) {
|
SkMemberInfo.cpp | 490 // Find Nth memberInfo 491 const SkMemberInfo* SkMemberInfo::Find(const SkMemberInfo info[], int count, int* index) { 495 const SkMemberInfo* result = SkMemberInfo::Find(inherited, info->fCount, index); 511 // Find named memberinfo 512 const SkMemberInfo* SkMemberInfo::Find(const SkMemberInfo info[], int count, const char** matchPtr) { 516 const SkMemberInfo* result = SkMemberInfo::Find(inherited, info->fCount, matchPtr);
|
/external/webrtc/src/system_wrappers/source/ |
map.cc | 100 std::map<int, MapItem*>::const_iterator it = map_.find(item->item_id_); 119 std::map<int, MapItem*>::const_iterator it = map_.find(item->item_id_); 129 MapItem* MapWrapper::Find(int id) const 131 std::map<int, MapItem*>::const_iterator it = map_.find(id); 145 std::map<int, MapItem*>::iterator it = map_.find(item->item_id_); 157 std::map<int, MapItem*>::iterator it = map_.find(id);
|
map_no_stl.cc | 145 MapNoStlItem* MapNoStl::Find(int id) const
|
/external/webkit/Source/WebKit/android/wds/ |
Command.cpp | 133 Command* Command::Find(const Connection* conn) {
|
/external/chromium/base/metrics/ |
field_trial.cc | 169 FieldTrial* FieldTrialList::Find(const std::string& name) { 178 FieldTrial* field_trial = Find(name); 186 FieldTrial* field_trial = Find(name); 206 DCHECK_EQ(name.find(kPersistentStringSeparator), std::string::npos); 207 DCHECK_EQ(group_name.find(kPersistentStringSeparator), std::string::npos); 230 size_t name_end = parent_trials.find(kPersistentStringSeparator, next_item); 233 size_t group_name_end = parent_trials.find(kPersistentStringSeparator, 242 FieldTrial *field_trial(FieldTrialList::Find(name)); 267 RegistrationList::iterator it = registered_.find(name);
|
/external/llvm/include/llvm/ADT/ |
ImmutableIntervalMap.h | 106 TreeTy *Find(TreeTy *T, key_type_ref K) { 115 return Find(this->getLeft(T), K); 117 return Find(this->getRight(T), K); 232 TreeTy *T = F.Find(M.getRoot(), K);
|
/external/llvm/lib/MC/ |
SubtargetFeature.cpp | 76 // Find the next comma 77 size_t Comma = S.find(',', Pos); 122 /// Find KV in array using binary search. 123 template<typename T> const T *Find(const StringRef S, const T *A, size_t L) { 232 // Find feature in table. 234 Find(StripFlag(Feature), FeatureTable, FeatureTableSize); 284 // Find CPU entry if CPU name is specified. 286 const SubtargetFeatureKV *CPUEntry = Find(CPU, CPUTable, CPUTableSize); 313 // Find feature in table. 315 Find(StripFlag(Feature), FeatureTable, FeatureTableSize) [all...] |
/external/protobuf/src/google/protobuf/ |
extension_set_heavy.cc | 60 virtual bool Find(int number, ExtensionInfo* output); 115 map<int, Extension>::const_iterator iter = extensions_.find(number); 180 bool DescriptorPoolExtensionFinder::Find(int number, ExtensionInfo* output) {
|
/external/v8/src/ |
splay-tree-inl.h | 93 bool SplayTree<Config, Allocator>::Find(const Key& key, Locator* locator) {
|
/sdk/emulator/qtools/ |
hash_table.h | 25 T Find(const char *key); 150 typename HashTable<T>::value_type HashTable<T>::Find(const char *key) 161 // If we get here, then we didn't find the key 168 // Find the first non-NULL table entry. 199 // Find the next non-NULL table entry.
|
/external/pcre/ |
pcregexp.pas | 325 function Find(ARegExp:shortstring;var P: PpcRegExp):boolean; virtual;
736 function TRegExpCollection.Find(ARegExp:shortstring;var P: PpcRegExp):boolean;
744 Find:=true;
749 Find:=false;
758 if not Find(ARegExp,P) then
|
/external/chromium/chrome/browser/autofill/ |
autofill_country.cc | 297 static const Iterator Find(const std::string& country_code); 345 const CountryDataMap::Iterator CountryDataMap::Find( 347 return GetInstance()->country_data_.find(country_code); 444 common_names_.find(country_utf8); 510 localized_names.find(sort_key); 573 const CountryDataMap::Iterator result = CountryDataMap::Find(country_code); 615 if (CountryDataMap::Find(country_code) == CountryDataMap::End())
|
/external/chromium/chrome/browser/metrics/ |
thread_watcher.cc | 221 return NULL != ThreadWatcherList::Find(thread_id); 329 ThreadWatcher* ThreadWatcherList::Find(const BrowserThread::ID& thread_id) { 338 RegistrationList::iterator it = registered_.find(thread_id);
|
/external/chromium/chrome/browser/sync/glue/ |
bookmark_model_associator.cc | 67 // Provides the following abstraction: given a parent bookmark node, find best 106 BookmarkNodesSet::iterator iter = child_nodes_.find(&temp_node); 128 const BookmarkNode* Find(int64 id) const; 154 const BookmarkNode* BookmarkNodeIdIndex::Find(int64 id) const { 155 BookmarkIdMap::const_iterator iter = node_index_.find(id); 186 BookmarkIdToSyncIdMap::const_iterator iter = id_map_.find(node_id); 192 SyncIdToBookmarkNodeMap::const_iterator iter = id_map_inverse_.find(sync_id); 214 DCHECK(id_map_.find(node_id) == id_map_.end()); 215 DCHECK(id_map_inverse_.find(sync_id) == id_map_inverse_.end()); 224 SyncIdToBookmarkNodeMap::iterator iter = id_map_inverse_.find(sync_id) [all...] |
/external/clang/lib/StaticAnalyzer/Checkers/ |
CallAndMessageChecker.cpp | 121 bool Find(const TypedValueRegion *R) { 132 if (Find(FR)) 154 if (F.Find(D->getRegion())) {
|
/external/srec/tools/thirdparty/OpenFst/fst/lib/ |
symbol-table.h | 51 int64 key = Find(symbol); 72 string Find(int64 key) const { 74 key_map_.find(key); 84 int64 Find(const string& symbol) const { 85 return Find(symbol.c_str()); 91 int64 Find(const char* symbol) const { 93 symbol_map_.find(symbol); 284 string Find(int64 key) const { 285 return impl_->Find(key); 290 int64 Find(const string& symbol) const [all...] |
/external/chromium/net/base/ |
x509_certificate.cc | 56 // between Find() and Remove(). See http://crbug.com/49377 61 X509Certificate* Find(const SHA1Fingerprint& fingerprint); 101 CertMap::iterator pos(cache_.find(cert->fingerprint())); 107 // Find a certificate in the cache with the given fingerprint. If one does 109 X509Certificate* X509CertificateCache::Find( 113 CertMap::iterator pos(cache_.find(fingerprint)); 161 cache->Find(CalculateFingerprint(cert_handle)); 476 if (it->empty() || it->find('\0') != std::string::npos) { 514 DVLOG(1) << "Could not find any match for " << hostname [all...] |
/external/llvm/utils/TableGen/ |
SubtargetEmitter.cpp | 432 unsigned Find = ItinClassesMap[Name]; 435 unsigned NumUOps = ItinClassList[Find]->getValueAsInt("NumMicroOps"); 441 ItinList[Find] = Intinerary;
|
/external/protobuf/src/google/protobuf/compiler/ |
parser.cc | 1009 TypeNameMap::const_iterator iter = kTypeNames.find(input_->current().text); 1022 TypeNameMap::const_iterator iter = kTypeNames.find(input_->current().text); [all...] |