Home
last modified time | relevance | path

Searched refs:pair (Results 576 - 600 of 4386) sorted by relevance

1...<<21222324252627282930>>...176

/third_party/gn/src/gn/
H A Dmetadata_unittest.cc20 contents.insert(std::pair<std::string_view, Value>("a", a_expected)); in TEST()
21 contents.insert(std::pair<std::string_view, Value>("b", b_expected)); in TEST()
44 std::pair<std::string_view, Value>("a", a_expected)); in TEST()
78 std::pair<std::string_view, Value>("a", a_expected)); in TEST()
120 metadata.contents().insert(std::pair<std::string_view, Value>("a", a)); in TEST()
165 std::pair<std::string_view, Value>("a", a_expected)); in TEST()
216 std::pair<std::string_view, Value>("a", a_expected)); in TEST()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-subzero/include/llvm/IR/
H A DAttributes.h154 /// Returns the argument numbers for the allocsize attribute (or pair(0, 0)
156 std::pair<unsigned, Optional<unsigned>> getAllocSizeArgs() const;
220 ArrayRef<std::pair<unsigned, Attribute> > Attrs);
222 ArrayRef<std::pair<unsigned,
226 ArrayRef<std::pair<unsigned,
365 /// Get the allocsize argument numbers (or pair(0, 0) if unknown).
366 std::pair<unsigned, Optional<unsigned>>
525 /// doesn't exist, pair(0, 0) is returned.
526 std::pair<unsigned, Optional<unsigned>> getAllocSizeArgs() const;
557 typedef std::pair<st
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/
H A DRDFRegisters.cpp60 std::pair<uint32_t,LaneBitmask> P = *I; in PhysicalRegisterInfo()
140 std::pair<RegisterId,LaneBitmask> PA = *UMA; in aliasRR()
146 std::pair<RegisterId,LaneBitmask> PB = *UMB; in aliasRR()
245 std::pair<uint32_t,LaneBitmask> P = *U; in hasAliasOf()
260 std::pair<uint32_t,LaneBitmask> P = *U; in hasCoverOf()
275 std::pair<uint32_t,LaneBitmask> P = *U; in insert()
357 std::pair<uint32_t,LaneBitmask> P = *I; in makeRegRef()
H A DHexagonTargetTransformInfo.cpp142 std::pair<int, MVT> LT = TLI.getTypeLegalizationCost(DL, RetTy); in getIntrinsicInstrCost()
232 std::pair<int, MVT> LT = TLI.getTypeLegalizationCost(DL, ValTy); in getCmpSelInstrCost()
245 std::pair<int, MVT> LT = TLI.getTypeLegalizationCost(DL, Ty); in getArithmeticInstrCost()
259 std::pair<int, MVT> SrcLT = TLI.getTypeLegalizationCost(DL, SrcTy); in getCastInstrCost()
260 std::pair<int, MVT> DstLT = TLI.getTypeLegalizationCost(DL, DstTy); in getCastInstrCost()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/SystemZ/
H A DSystemZSelectionDAGInfo.cpp179 std::pair<SDValue, SDValue> SystemZSelectionDAGInfo::EmitTargetCodeForMemcmp( in EmitTargetCodeForMemcmp()
194 std::pair<SDValue, SDValue> SystemZSelectionDAGInfo::EmitTargetCodeForMemchr( in EmitTargetCodeForMemchr()
220 std::pair<SDValue, SDValue> SystemZSelectionDAGInfo::EmitTargetCodeForStrcpy( in EmitTargetCodeForStrcpy()
230 std::pair<SDValue, SDValue> SystemZSelectionDAGInfo::EmitTargetCodeForStrcmp( in EmitTargetCodeForStrcmp()
244 // Return a pair of values, the first being the number of nonnull characters
248 static std::pair<SDValue, SDValue> getBoundedStrlen(SelectionDAG &DAG, in getBoundedStrlen()
261 std::pair<SDValue, SDValue> SystemZSelectionDAGInfo::EmitTargetCodeForStrlen( in EmitTargetCodeForStrlen()
268 std::pair<SDValue, SDValue> SystemZSelectionDAGInfo::EmitTargetCodeForStrnlen( in EmitTargetCodeForStrnlen()
/third_party/rust/crates/rust-cexpr/src/
H A Dexpr.rs35 use nom::sequence::{delimited, pair, preceded};
299 pair(one_of_punctuation(&["+", "-", "~"][..]), |i| self.unary(i)), in unary()
308 pair(complete(one_of_punctuation(&["*", "/", "%"][..])), |i| { in mul_div_rem()
327 pair(complete(one_of_punctuation(&["+", "-"][..])), |i| { in add_sub()
345 pair(complete(one_of_punctuation(&["<<", ">>"][..])), |i| { in shl_shr()
461 pair(|i| self.string(i), many0(complete(|i| self.string(i)))), in concat_str()
486 pair(identifier_token, |i| self.expr(i))(input) in macro_definition()
602 pair(
/foundation/arkui/ace_engine/frameworks/core/components_ng/pattern/grid/
H A Dgrid_pattern.h115 std::pair<std::function<bool(float)>, Axis> GetScrollOffsetAbility() override;
275 std::pair<int32_t, int32_t> GetNextIndexByStep(
284 std::pair<bool, bool> IsFirstOrLastFocusableChild(int32_t curMainIndex, int32_t curCrossIndex);
285 std::pair<FocusStep, FocusStep> GetFocusSteps(int32_t curMainIndex, int32_t curCrossIndex, FocusStep step);
341 std::pair<std::optional<float>, std::optional<float>> scrollbarInfo_;
/foundation/multimedia/audio_framework/services/audio_policy/server/include/
H A Daudio_policy_server_handler.h86 std::list<std::pair<AudioInterrupt, AudioFocuState>> focusInfoList;
101 std::pair<int32_t, AudioSessionDeactiveEvent> sessionDeactivePair;
149 const std::list<std::pair<AudioInterrupt, AudioFocuState>> &focusInfoList);
186 bool SendAudioSessionDeactiveCallback(const std::pair<int32_t, AudioSessionDeactiveEvent> &sessionDeactivePair);
237 std::map<std::pair<int32_t, AudioDeviceUsage>,
/foundation/distributeddatamgr/data_share/interfaces/inner_api/consumer/include/
H A Ddatashare_helper.h94 static std::pair<int, std::shared_ptr<DataShareHelper>> Create(const sptr<IRemoteObject> &token,
433 * @return Returns pair<int32_t errCode, int32_t index>, the errCode and the index of the inserted data record.
435 virtual std::pair<int32_t, int32_t> InsertEx(Uri &uri, const DataShareValuesBucket &value);
444 * @return Returns pair<int32_t errCode, int32_t index>, the errCode and the index of data records updated.
446 virtual std::pair<int32_t, int32_t> UpdateEx(
455 * @return Returns pair<int32_t errCode, int32_t index>, the errCode and the index of data records deleted.
457 virtual std::pair<int32_t, int32_t> DeleteEx(Uri &uri, const DataSharePredicates &predicates);
473 static std::pair<int, std::shared_ptr<DataShareHelper>> CreateProxyHelper(const std::string &strUri,
/foundation/distributeddatamgr/datamgr_service/services/distributeddataservice/service/data_share/
H A Ddata_share_service_impl.h48 using ExecuteCallbackEx = std::function<std::pair<int32_t, int32_t>(DataProviderConfig::ProviderInfo &,
86 std::pair<int32_t, int32_t> InsertEx(const std::string &uri, const std::string &extUri,
88 std::pair<int32_t, int32_t> UpdateEx(const std::string &uri, const std::string &extUri,
90 std::pair<int32_t, int32_t> DeleteEx(const std::string &uri, const std::string &extUri,
121 std::pair<int32_t, int32_t> ExecuteEx(const std::string &uri, const std::string &extUri, const int32_t tokenId,
/foundation/distributeddatamgr/datamgr_service/services/distributeddataservice/framework/test/
H A Dserializable_test.cpp184 marshData.insert(std::pair{ "test1", normalEx }); in HWTEST_F()
231 marData.data.insert(std::pair{ "test1", normalEx }); in HWTEST_F()
232 marData.others.push_back({ std::pair{ "test2", normalEx } }); in HWTEST_F()
235 marData.index->insert(std::pair{ "test1", true }); in HWTEST_F()
236 marData.index->insert(std::pair{ "test2", true }); in HWTEST_F()
/foundation/distributeddatamgr/datamgr_service/services/distributeddataservice/rust/extension/
H A Dcloud_cursor_impl.cpp173 std::vector<std::pair<std::string, DBValue>> CloudCursorImpl::GetData(OhCloudExtValueBucket *vb) in GetData()
175 std::vector<std::pair<std::string, DBValue>> result {}; in GetData()
199 std::pair<std::string, DBValue> data { std::move(key), std::move(dBValue) }; in GetData()
277 auto pair = GetData(vBucket); in Get() local
279 for (auto &[first, second] : pair) { in Get()
/foundation/distributeddatamgr/pasteboard/framework/innerkits/src/
H A Dpasteboard_web_controller.cpp50 std::vector<std::pair<std::string, uint32_t>> matchVec = SplitHtmlWithImgLabel(html);
63 std::map<uint32_t, std::pair<std::string, std::string>, Cmp> replaceUris;
95 std::vector<std::pair<std::string, uint32_t>> PasteboardWebController::SplitHtmlWithImgLabel(
103 std::vector<std::pair<std::string, uint32_t>> matchVec;
117 const std::vector<std::pair<std::string, uint32_t>> &matchVec) noexcept
/foundation/distributeddatamgr/relational_store/frameworks/native/rdb/src/
H A Dtrans_db.cpp35 std::pair<int, int64_t> TransDB::Insert(const std::string &table, const Row &row, Resolution resolution) in Insert()
77 std::pair<int, int64_t> TransDB::BatchInsert(const std::string &table, const RefRows &rows) in BatchInsert()
107 std::pair<int, int> TransDB::Update(const std::string &table, const Row &row, const std::string &where, in Update()
193 std::pair<int32_t, ValueObject> TransDB::Execute(const std::string &sql, const Values &args, int64_t trxId) in Execute()
261 std::pair<int32_t, std::shared_ptr<Statement>> TransDB::GetStatement(const std::string &sql) const in GetStatement()
/third_party/glslang/glslang/Include/
H A Darrays.h131 TArraySize pair = { e, n }; in push_back() local
132 sizes->push_back(pair); in push_back()
267 void addInnerSize(TArraySize pair) { in addInnerSize()
268 sizes.push_back(pair.size, pair.node); in addInnerSize()
/third_party/node/deps/v8/src/heap/cppgc/
H A Dpage-memory.cc180 std::pair<NormalPageMemoryRegion*, Address> NormalPageMemoryPool::Take( in Take()
184 std::pair<NormalPageMemoryRegion*, Address> pair = pool_[bucket].back(); in Take()
186 return pair; in Take()
197 std::pair<NormalPageMemoryRegion*, Address> result = page_pool_.Take(bucket); in AllocateNormalPageMemory()
/third_party/skia/third_party/externals/spirv-tools/source/
H A Dcfa.h101 /// The first node in the pair is a node in the graph. The second node in the
102 /// pair is its immediate dominator in the sense of Cooper et.al., where a
106 static std::vector<std::pair<BB*, BB*>> CalculateDominators(
175 std::vector<std::pair<BB*, BB*>> CFA<BB>::CalculateDominators( in CalculateDominators()
233 std::vector<std::pair<bb_ptr, bb_ptr>> out; in CalculateDominators()
244 [&idoms](const std::pair<bb_ptr, bb_ptr>& lhs, in CalculateDominators()
245 const std::pair<bb_ptr, bb_ptr>& rhs) { in CalculateDominators()
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/
H A Dcfa.h101 /// The first node in the pair is a node in the graph. The second node in the
102 /// pair is its immediate dominator in the sense of Cooper et.al., where a
106 static std::vector<std::pair<BB*, BB*>> CalculateDominators(
175 std::vector<std::pair<BB*, BB*>> CFA<BB>::CalculateDominators( in CalculateDominators()
233 std::vector<std::pair<bb_ptr, bb_ptr>> out; in CalculateDominators()
244 [&idoms](const std::pair<bb_ptr, bb_ptr>& lhs, in CalculateDominators()
245 const std::pair<bb_ptr, bb_ptr>& rhs) { in CalculateDominators()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/TextAPI/MachO/
H A DInterfaceFile.h275 const std::vector<std::pair<Target, std::string>> &umbrellas() const { in umbrellas()
280 const std::vector<std::pair<Target, std::string>> getParentUmbrellas() const { in getParentUmbrellas()
315 /// Add an Target/UUID pair.
321 /// Add an Target/UUID pair.
330 const std::vector<std::pair<Target, std::string>> &uuids() const { in uuids()
406 std::vector<std::pair<Target, std::string>> ParentUmbrellas;
409 std::vector<std::pair<Target, std::string>> UUIDs;
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Utils/
H A DSplitModule.cpp153 auto CompareClusters = [](const std::pair<unsigned, unsigned> &a, in findPartitions()
154 const std::pair<unsigned, unsigned> &b) { in findPartitions()
161 std::priority_queue<std::pair<unsigned, unsigned>, in findPartitions()
162 std::vector<std::pair<unsigned, unsigned>>, in findPartitions()
169 using SortType = std::pair<unsigned, ClusterMapType::iterator>; in findPartitions()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/
H A DModuloSchedule.h155 using InstrChangesTy = DenseMap<MachineInstr *, std::pair<unsigned, int64_t>>;
175 /// The first element in the pair is the max difference in stages. The
178 std::map<unsigned, std::pair<unsigned, bool>> RegToStageDiff;
229 std::pair<unsigned, bool> Stages = RegToStageDiff[Reg]; in getStagesForReg()
243 std::pair<unsigned, bool> Stages = RegToStageDiff[Reg]; in getStagesForPhi()
300 DenseMap<std::pair<MachineBasicBlock *, MachineInstr *>, MachineInstr *>
/third_party/protobuf/src/google/protobuf/io/
H A Dprinter.cc76 std::pair<size_t, size_t>* range) { in GetSubstitutionRange()
77 std::map<std::string, std::pair<size_t, size_t> >::const_iterator iter = in GetSubstitutionRange()
99 std::pair<size_t, size_t> begin, end; in Annotate()
162 std::pair<std::map<std::string, std::pair<size_t, size_t> >::iterator, in Print()
/third_party/skia/third_party/externals/abseil-cpp/absl/container/
H A Dflat_hash_map_test.cc53 Alloc<std::pair<const K, V>>>;
233 bool FirstIsEven(std::pair<const int, int> p) { return p.first % 2 == 0; } in FirstIsEven()
239 erase_if(s, [](std::pair<const int, int>) { return true; }); in TEST()
245 erase_if(s, [](std::pair<const int, int>) { return false; }); in TEST()
253 [](std::pair<const int, int> kvp) { return kvp.first % 2 == 1; }); in TEST()
/foundation/arkui/ace_engine/test/unittest/core/syntax/
H A Dlazy_for_each_builder_syntax_test_ng.cpp432 V2::Operation operation1 = {.type = "move", .index = INDEX_0, .count = INDEX_8, .coupleIndex = std::pair(8, 8)}; in HWTEST_F()
437 V2::Operation operation2 = {.type = "move", .index = INDEX_0, .count = INDEX_8, .coupleIndex = std::pair(0, 8)}; in HWTEST_F()
442 V2::Operation operation3 = {.type = "move", .index = INDEX_3, .key = "", .coupleIndex = std::pair(0, 1)}; in HWTEST_F()
475 .coupleIndex = std::pair(1, 3)}; in HWTEST_F()
481 .coupleIndex = std::pair(20, 3)}; in HWTEST_F()
486 V2::Operation operation3 = {.type = "exchange", .index = INDEX_3, .coupleKey = std::pair("", ""), in HWTEST_F()
487 .coupleIndex = std::pair(0, 20)}; in HWTEST_F()
492 V2::Operation operation4 = {.type = "exchange", .index = INDEX_3, .coupleKey = std::pair("1", "1"), in HWTEST_F()
493 .coupleIndex = std::pair(0, 20)}; in HWTEST_F()
525 V2::Operation operation1 = {.type = "reload", .index = INDEX_0, .count = INDEX_8, .coupleIndex = std::pair( in HWTEST_F()
[all...]
/foundation/graphic/graphic_3d/lume/LumeBase/api/base/containers/
H A Dunordered_map.h36 struct pair { struct
221 using value_type = pair<const Key, T>;
229 using value_type = pair<const Key, T>;
364 pair<iterator, bool> insert(value_type&& v) in insert()
373 pair<iterator, bool> insert(const value_type& v) in insert()
403 pair<iterator, bool> insert_or_assign(const key_type& key, M&& value) in insert_or_assign()
764 pair<typename base::iterator, bool> insert(pair<string_view, T>&& v) in insert()
776 pair<typename base::iterator, bool> insert(const pair<string_vie argument
[all...]

Completed in 20 milliseconds

1...<<21222324252627282930>>...176