| /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 | 75 // Find the next comma
76 size_t Comma = S.find(',', Pos);
121 /// Find KV in array using binary search.
122 static const SubtargetFeatureKV *Find(StringRef S, const SubtargetFeatureKV *A,
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/lzma/CPP/Windows/ |
| FileFind.cpp | 201 bool CFileInfo::Find(LPCTSTR wildcard)
223 bool CFileInfoW::Find(LPCWSTR wildcard)
247 return fi.Find(name) && !fi.IsDir();
253 return fi.Find(name) && fi.IsDir();
259 return fi.Find(name);
266 return fi.Find(name) && !fi.IsDir();
272 return fi.Find(name) && fi.IsDir();
277 return fi.Find(name);
|
| /external/openfst/src/include/fst/extensions/far/ |
| stlist.h | 21 // not support the Find() operation but that does support
204 bool Find(const string &key) {
206 << "STListReader::Find: stlist does not support find operation";
|
| /external/openfst/src/include/fst/extensions/pdt/ |
| pdt.h | 85 StackId Find(StackId stack_id, Label label) {
90 = paren_map_.find(label);
124 = paren_map_.find(label);
|
| /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/skia/src/animator/ |
| SkDisplayType.cpp | 377 info = SkMemberInfo::Find(info, infoCount, matchPtr);
529 SkDisplayTypes SkDisplayType::Find(SkAnimateMaker* maker, const SkMemberInfo* match) {
|
| /external/skia/src/pdf/ |
| SkPDFGraphicState.cpp | 59 int index = Find(fPaint);
105 int index = Find(paint);
188 int SkPDFGraphicState::Find(const SkPaint& paint) {
190 return CanonicalPaints().find(search);
|
| /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.
|
| /art/runtime/ |
| zip_archive.cc | 92 LOG(WARNING) << "Zip: didn't find signature at start of LFH, offset " << lfh_offset;
359 ZipEntry* ZipArchive::Find(const char* name) const {
361 DirEntries::const_iterator it = dir_entries_.find(name);
377 // Find the zip Central Directory and memory-map it.
429 // it to find the magic number, parse some values out, and use those
447 // comment, we'll find it on the first try. (We may want to consider
448 // doing an initial minimal read; if we don't find it, retry with a
|
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
| TreeWizard.cs | 135 * dynamic searches; i.e., go find me all PLUS nodes.
212 * TODO: save this index so that find and visit are faster
267 public virtual IList Find(object t, int ttype) {
274 public virtual IList Find(object t, string pattern) {
541 * This data structure allows you to find all nodes with type INT in order.
543 * If you really need to find a node of type, say, FUNC quickly then perhaps
|
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
| TreeWizard.cs | 153 * dynamic searches; i.e., go find me all PLUS nodes.
239 * TODO: save this index so that find and visit are faster
306 public virtual IList Find( object t, int ttype )
314 public virtual IList Find( object t, string pattern )
618 * This data structure allows you to find all nodes with type INT in order.
620 * If you really need to find a node of type, say, FUNC quickly then perhaps
|
| /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/chromium/net/base/ |
| x509_certificate.cc | 56 // between Find() and Remove(). See http://crbug.com/49377
61 scoped_refptr<X509Certificate> Find(const SHA1Fingerprint& fingerprint);
113 // Find a certificate in the cache with the given fingerprint. If one does
115 scoped_refptr<X509Certificate> X509CertificateCache::Find(
119 CertMap::iterator pos(cache_.find(fingerprint));
167 cache->Find(CalculateFingerprint(cert_handle));
482 if (it->empty() || it->find('\0') != std::string::npos) {
520 DVLOG(1) << "Could not find any match for " << hostname
[all...] |
| /external/chromium_org/base/metrics/ |
| field_trial.cc | 263 FieldTrial* existing_trial = Find(trial_name);
311 FieldTrial* FieldTrialList::Find(const std::string& name) {
320 FieldTrial* field_trial = Find(name);
328 FieldTrial* field_trial = Find(name);
336 return Find(name) != NULL;
346 it->trial_name.find(kPersistentStringSeparator));
348 it->group_name.find(kPersistentStringSeparator));
381 size_t name_end = trials_string.find(kPersistentStringSeparator, next_item);
384 size_t group_name_end = trials_string.find(kPersistentStringSeparator,
416 FieldTrial* field_trial = FieldTrialList::Find(name)
[all...] |
| /external/chromium_org/chrome/browser/ui/views/ |
| find_bar_view.cc | 36 // The amount of whitespace to have before the find button.
158 // Background images for the Find edit box.
213 // do a layout and repaint the dialog so that the find text field doesn't
239 // Then we draw the background image for the Find Textfield. We start by
240 // calculating the position of background images for the Find text box.
321 // And whatever space is left in between, gets filled up by the find edit box.
328 // between the find text box and the find button so that when the user clicks
329 // in that area we focus on the find text box.
401 // Call Find() here
[all...] |
| /external/chromium_org/components/autofill/core/browser/ |
| autofill_country.cc | [all...] |
| /external/chromium_org/third_party/protobuf/src/google/protobuf/ |
| extension_set_heavy.cc | 63 virtual bool Find(int number, ExtensionInfo* output);
123 map<int, Extension>::const_iterator iter = extensions_.find(number);
166 map<int, Extension>::iterator iter = extensions_.find(descriptor->number());
221 bool DescriptorPoolExtensionFinder::Find(int number, ExtensionInfo* output) {
|
| /external/chromium_org/third_party/skia/src/animator/ |
| SkMemberInfo.cpp | 483 // Find Nth memberInfo
484 const SkMemberInfo* SkMemberInfo::Find(const SkMemberInfo info[], int count, int* index) {
488 const SkMemberInfo* result = SkMemberInfo::Find(inherited, info->fCount, index);
504 // Find named memberinfo
505 const SkMemberInfo* SkMemberInfo::Find(const SkMemberInfo info[], int count, const char** matchPtr) {
509 const SkMemberInfo* result = SkMemberInfo::Find(inherited, info->fCount, matchPtr);
|
| /external/chromium_org/third_party/tcmalloc/chromium/src/ |
| addressmap-inl.h | 76 // a. A hash-table lookup to find the cluster
116 inline const Value* Find(Key key) const;
128 // Similar to Find but we assume that keys are addresses of non-overlapping
208 // Find cluster object for specified address. If not found
289 inline const Value* AddressMap<Value>::Find(Key key) const {
|
| /external/chromium_org/third_party/tcmalloc/vendor/src/ |
| addressmap-inl.h | 76 // a. A hash-table lookup to find the cluster
116 inline const Value* Find(Key key) const;
128 // Similar to Find but we assume that keys are addresses of non-overlapping
208 // Find cluster object for specified address. If not found
289 inline const Value* AddressMap<Value>::Find(Key key) const {
|
| /external/chromium_org/v8/src/ |
| effects.h | 108 return this->Find(var, &locator)
225 bool Find(Var var, Locator* locator) {
227 return map_->Find(var, locator);
294 bool Find(Var var, Locator* locator) {
297 if (node->effects.Find(var, locator)) return true;
325 if (node->effects.Find(var, &shadowed)) {
|
