Home
last modified time | relevance | path

Searched refs:Find (Results 1 - 25 of 167) sorted by relevance

1234567

/third_party/protobuf/
H A Dupdate_version.py42 def Find(elem, tagname): function
50 return Find(elem, tagname).cloneNode(True)
182 Find(Find(document.documentElement, 'PropertyGroup'), 'VersionPrefix'),
188 Find(Find(document.documentElement, 'metadata'), 'version'),
195 Find(document.documentElement, 'version'), GetFullVersion()))
199 Find(document.documentElement, 'version'), GetFullVersion()))
203 Find(Find(documen
[all...]
/third_party/node/deps/v8/src/ast/
H A Dprettyprinter.cc58 Find(program); in Print()
63 void CallPrinter::Find(AstNode* node, bool print) { in Find() function in v8::internal::CallPrinter
106 Find(node->expression()); in VisitExpressionStatement()
115 Find(node->statement()); in VisitSloppyBlockFunctionStatement()
120 Find(node->condition()); in VisitIfStatement()
121 Find(node->then_statement()); in VisitIfStatement()
123 Find(node->else_statement()); in VisitIfStatement()
135 Find(node->expression()); in VisitReturnStatement()
140 Find(node->expression()); in VisitWithStatement()
141 Find(nod in VisitWithStatement()
[all...]
H A Dsource-range-ast-visitor.cc21 AstNodeSourceRanges* enclosingSourceRanges = source_range_map_->Find(stmt); in VisitBlock()
55 AstNodeSourceRanges* range = source_range_map_->Find(node); in VisitNode()
82 last_range = source_range_map_->Find( in MaybeRemoveContinuationRange()
85 last_range = source_range_map_->Find(last_statement); in MaybeRemoveContinuationRange()
/third_party/node/deps/v8/src/compiler/
H A Dcommon-node-cache.h43 return int32_constants_.Find(value); in FindInt32Constant()
47 return int64_constants_.Find(value); in FindInt64Constant()
51 return tagged_index_constants_.Find(value); in FindTaggedIndexConstant()
56 return float32_constants_.Find(bit_cast<int32_t>(value)); in FindFloat32Constant()
61 return float64_constants_.Find(bit_cast<int64_t>(value)); in FindFloat64Constant()
67 return pointer_constants_.Find(value); in FindPointerConstant()
72 return number_constants_.Find(bit_cast<int64_t>(value)); in FindNumberConstant()
78 return relocatable_int32_constants_.Find(std::make_pair(value, rmode)); in FindRelocatableInt32Constant()
82 return relocatable_int64_constants_.Find(std::make_pair(value, rmode)); in FindRelocatableInt64Constant()
H A Dcommon-node-cache.cc15 return external_constants_.Find(bit_cast<intptr_t>(value.address())); in FindExternalConstant()
20 return heap_constants_.Find(bit_cast<intptr_t>(value.address())); in FindHeapConstant()
/third_party/skia/third_party/externals/abseil-cpp/absl/strings/
H A Dstr_split.cc52 found_pos = find_policy.Find(text, delimiter, pos); in GenericFind()
63 size_t Find(absl::string_view text, absl::string_view delimiter, size_t pos) { in Find() function
72 size_t Find(absl::string_view text, absl::string_view delimiter, size_t pos) { in Find() function
86 absl::string_view ByString::Find(absl::string_view text, size_t pos) const { in Find() function in absl::ByString
102 absl::string_view ByChar::Find(absl::string_view text, size_t pos) const { in Find() function in absl::ByChar
115 absl::string_view ByAnyChar::Find(absl::string_view text, size_t pos) const { in Find() function in absl::ByAnyChar
126 absl::string_view ByLength::Find(absl::string_view text, in Find() function in absl::ByLength
H A Dstr_split.h65 // A `Delimiter` is an object with a `Find()` function that knows how to find
76 // A Delimiter's `Find()` member function will be passed an input `text` that is
92 // single char and will look for that char in the text passed to the `Find()`
98 // absl::string_view Find(absl::string_view text, size_t pos) {
127 absl::string_view Find(absl::string_view text, size_t pos) const;
159 absl::string_view Find(absl::string_view text, size_t pos) const;
185 absl::string_view Find(absl::string_view text, size_t pos) const;
216 absl::string_view Find(absl::string_view text, size_t pos) const;
263 absl::string_view Find(absl::string_view text, size_t pos) { in Find() function in absl::strings_internal::MaxSplitsImpl
268 return delimiter_.Find(tex in Find()
[all...]
/third_party/typescript/tests/baselines/reference/
H A DrecursiveClassReferenceTest.js33 module Sample.Actions.Thing.Find {
129 var Find;
130 (function (Find) {
140 Find.StartFindAction = StartFindAction;
141 })(Find = Thing_1.Find || (Thing_1.Find = {}));
/third_party/skia/third_party/externals/spirv-tools/source/fuzz/
H A Dequivalence_relation.h92 // Find the representative for each value's equivalence class, and if they in MakeEquivalent()
94 const T* representative1 = Find(value1_ptr); in MakeEquivalent()
95 const T* representative2 = Find(value2_ptr); in MakeEquivalent()
147 stack.push_back(Find(*value_set_.find(&value))); in GetEquivalenceClass()
163 return Find(&value1) == Find(&value2); in IsEquivalent()
182 // already be known to the equivalence relation. This is the 'Find' operation
184 const T* Find(const T* value) const { in Find() function in spvtools::fuzz::EquivalenceRelation
224 // Mutable because the intuitively const method, 'Find', performs path
232 // Mutable because the intuitively const method, 'Find', perform
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/fuzz/
H A Dequivalence_relation.h92 // Find the representative for each value's equivalence class, and if they in MakeEquivalent()
94 const T* representative1 = Find(value1_ptr); in MakeEquivalent()
95 const T* representative2 = Find(value2_ptr); in MakeEquivalent()
147 stack.push_back(Find(*value_set_.find(&value))); in GetEquivalenceClass()
163 return Find(&value1) == Find(&value2); in IsEquivalent()
182 // already be known to the equivalence relation. This is the 'Find' operation
184 const T* Find(const T* value) const { in Find() function in spvtools::fuzz::EquivalenceRelation
224 // Mutable because the intuitively const method, 'Find', performs path
232 // Mutable because the intuitively const method, 'Find', perform
[all...]
/third_party/spirv-tools/source/fuzz/
H A Dequivalence_relation.h92 // Find the representative for each value's equivalence class, and if they in MakeEquivalent()
94 const T* representative1 = Find(value1_ptr); in MakeEquivalent()
95 const T* representative2 = Find(value2_ptr); in MakeEquivalent()
147 stack.push_back(Find(*value_set_.find(&value))); in GetEquivalenceClass()
163 return Find(&value1) == Find(&value2); in IsEquivalent()
182 // already be known to the equivalence relation. This is the 'Find' operation
184 const T* Find(const T* value) const { in Find() function in spvtools::fuzz::EquivalenceRelation
224 // Mutable because the intuitively const method, 'Find', performs path
232 // Mutable because the intuitively const method, 'Find', perform
[all...]
/third_party/skia/third_party/externals/piex/src/tiff_directory/
H A Dtiff_directory.cc45 const DirectoryEntry* directory_entry = Find(tag); in Get()
57 const DirectoryEntry* directory_entry = Find(tag); in Get()
77 const DirectoryEntry* directory_entry = Find(tag); in Get()
114 const DirectoryEntry* directory_entry = Find(tag); in Get()
169 const DirectoryEntry* directory_entry = Find(tag); in Get()
217 const DirectoryEntry* directory_entry = Find(tag); in GetOffsetAndLength()
245 const TiffDirectory::DirectoryEntry* TiffDirectory::Find(const Tag tag) const { in Find() function in piex::tiff_directory::TiffDirectory
/third_party/lzma/CPP/7zip/UI/Common/
H A DArchiveName.cpp58 if (fi3.Find(us2fs(path))) in CreateArchiveName()
84 else if (fi3.Find(dirPrefix)) in CreateArchiveName()
98 const int dotPos = name.Find(L'.'); in CreateArchiveName()
99 if (dotPos > 0 && name.Find(L'.', (unsigned)dotPos + 1) < 0) in CreateArchiveName()
/third_party/skia/third_party/externals/tint/src/ast/
H A Dfunction_test.cc149 EXPECT_EQ(func, list.Find(Symbols().Register("main"))); in TEST_F()
154 EXPECT_EQ(nullptr, list.Find(Symbols().Register("Missing"))); in TEST_F()
170 list.Find(Symbols().Register("main"), PipelineStage::kFragment)); in TEST_F()
171 EXPECT_EQ(vs, list.Find(Symbols().Register("main"), PipelineStage::kVertex)); in TEST_F()
181 list.Find(Symbols().Register("main"), PipelineStage::kVertex)); in TEST_F()
H A Dfunction.h101 const Function* Find(Symbol sym) const;
107 const Function* Find(Symbol sym, PipelineStage stage) const;
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/MC/
H A DMCSubtargetInfo.cpp23 /// Find KV in array using binary search.
25 static const T *Find(StringRef S, ArrayRef<T> A) { in Find() function
63 // Find feature in table. in ApplyFeatureFlag()
65 Find(SubtargetFeatures::StripFlag(Feature), FeatureTable); in ApplyFeatureFlag()
169 // Find CPU entry if CPU name is specified. in getFeatures()
171 const SubtargetSubTypeKV *CPUEntry = Find(CPU, ProcDesc); in getFeatures()
249 // Find feature in table. in ToggleFeature()
251 Find(SubtargetFeatures::StripFlag(Feature), ProcFeatures); in ToggleFeature()
294 // Find entry in getSchedModelForCPU()
295 const SubtargetSubTypeKV *CPUEntry = Find(CP in getSchedModelForCPU()
[all...]
/third_party/lzma/CPP/Common/
H A DMyString.h243 void Find(t) const; \
244 void Find(t, unsigned startIndex) const; \
436 int Find(char c) const { return FindCharPosInString(_chars, c); } in Find() function in AString
437 int Find(char c, unsigned startIndex) const in Find() function in AString
442 int Find(char c, int startIndex) const in Find() function in AString
444 return Find(c, (unsigned)startIndex); in Find()
451 int Find(const char *s) const { return Find(s, 0); } in Find() function in AString
452 int Find(const char *s, unsigned startIndex) const throw();
728 int Find(wchar_ in IsAscii() function in UString
729 int Find(wchar_t c, unsigned startIndex) const Find() function in UString
739 int Find(const wchar_t *s) const { return Find(s, 0); } Find() function in UString
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Support/
H A DDynamicLibrary.cpp42 HandleList::iterator Find(void *Handle) { in Find() function in DynamicLibrary::HandleSet
47 return Handle == Process || Find(Handle) != Handles.end(); in Contains()
56 if (Find(Handle) != Handles.end()) { in AddLibrary()
/third_party/skia/third_party/externals/spirv-tools/source/fuzz/fact_manager/
H A Ddata_synonym_and_id_equation_facts.cpp133 auto lhs_dd_representative = synonymous_.Find(&lhs_dd); in AddEquationFactRecursive()
274 assert(synonymous_.Find(&dd1) == synonymous_.Find(&dd2) && in AddDataSynonymFactRecursive()
729 auto dd1_original_representative = synonymous_.Find(&dd1); in MakeEquivalent()
730 auto dd2_original_representative = synonymous_.Find(&dd2); in MakeEquivalent()
744 auto still_representative = synonymous_.Find(dd1_original_representative) == in MakeEquivalent()
786 return synonymous_.Exists(dd) ? synonymous_.Find(&dd) in RegisterDataDescriptor()
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/fuzz/fact_manager/
H A Ddata_synonym_and_id_equation_facts.cpp133 auto lhs_dd_representative = synonymous_.Find(&lhs_dd); in AddEquationFactRecursive()
274 assert(synonymous_.Find(&dd1) == synonymous_.Find(&dd2) && in AddDataSynonymFactRecursive()
729 auto dd1_original_representative = synonymous_.Find(&dd1); in MakeEquivalent()
730 auto dd2_original_representative = synonymous_.Find(&dd2); in MakeEquivalent()
744 auto still_representative = synonymous_.Find(dd1_original_representative) == in MakeEquivalent()
786 return synonymous_.Exists(dd) ? synonymous_.Find(&dd) in RegisterDataDescriptor()
/third_party/spirv-tools/source/fuzz/fact_manager/
H A Ddata_synonym_and_id_equation_facts.cpp134 auto lhs_dd_representative = synonymous_.Find(&lhs_dd); in AddEquationFactRecursive()
275 assert(synonymous_.Find(&dd1) == synonymous_.Find(&dd2) && in AddDataSynonymFactRecursive()
730 auto dd1_original_representative = synonymous_.Find(&dd1); in MakeEquivalent()
731 auto dd2_original_representative = synonymous_.Find(&dd2); in MakeEquivalent()
745 auto still_representative = synonymous_.Find(dd1_original_representative) == in MakeEquivalent()
787 return synonymous_.Exists(dd) ? synonymous_.Find(&dd) in RegisterDataDescriptor()
/third_party/node/deps/v8/src/interpreter/
H A Dblock-coverage-builder.h33 AstNodeSourceRanges* ranges = source_range_map_->Find(node); in AllocateBlockCoverageSlot()
46 static_cast<NaryOperationSourceRanges*>(source_range_map_->Find(node)); in AllocateNaryBlockCoverageSlot()
/third_party/protobuf/csharp/compatibility_tests/v3.0.0/src/Google.Protobuf.Test/Reflection/
H A DTypeRegistryTest.cs86 Assert.AreSame(descriptor, registry.Find(descriptor.FullName)); in AssertDescriptorPresent()
91 Assert.IsNull(registry.Find(descriptor.FullName)); in AssertDescriptorAbsent()
/third_party/protobuf/csharp/src/Google.Protobuf.Test/Reflection/
H A DTypeRegistryTest.cs86 Assert.AreSame(descriptor, registry.Find(descriptor.FullName)); in AssertDescriptorPresent()
91 Assert.IsNull(registry.Find(descriptor.FullName)); in AssertDescriptorAbsent()
/third_party/node/deps/v8/src/utils/
H A Didentity-map.h133 V* Find(Handle<Object> key) const { return Find(*key); } in Find() function in v8::internal::IdentityMap
134 V* Find(Object key) const { in Find() function in v8::internal::IdentityMap

Completed in 15 milliseconds

1234567