[llvm] [Support] Use std::map::try_emplace (NFC) (PR #141374)
via llvm-commits
llvm-commits at lists.llvm.org
Sat May 24 13:43:45 PDT 2025
llvmbot wrote:
<!--LLVM PR SUMMARY COMMENT-->
@llvm/pr-subscribers-llvm-support
Author: Kazu Hirata (kazutakahirata)
<details>
<summary>Changes</summary>
try_emplace can default-construct values, so we do not need to do so
on our own.
---
Full diff: https://github.com/llvm/llvm-project/pull/141374.diff
1 Files Affected:
- (modified) llvm/lib/Support/DAGDeltaAlgorithm.cpp (+3-3)
``````````diff
diff --git a/llvm/lib/Support/DAGDeltaAlgorithm.cpp b/llvm/lib/Support/DAGDeltaAlgorithm.cpp
index 48302b8cb0621..981536473d124 100644
--- a/llvm/lib/Support/DAGDeltaAlgorithm.cpp
+++ b/llvm/lib/Support/DAGDeltaAlgorithm.cpp
@@ -179,8 +179,8 @@ DAGDeltaAlgorithmImpl::DAGDeltaAlgorithmImpl(
const std::vector<edge_ty> &Dependencies)
: DDA(DDA) {
for (change_ty Change : Changes) {
- Predecessors.insert(std::make_pair(Change, std::vector<change_ty>()));
- Successors.insert(std::make_pair(Change, std::vector<change_ty>()));
+ Predecessors.try_emplace(Change);
+ Successors.try_emplace(Change);
}
for (const edge_ty &Dep : Dependencies) {
Predecessors[Dep.second].push_back(Dep.first);
@@ -210,7 +210,7 @@ DAGDeltaAlgorithmImpl::DAGDeltaAlgorithmImpl(
// Invert to form the predecessor closure map.
for (change_ty Change : Changes)
- PredClosure.insert(std::make_pair(Change, std::set<change_ty>()));
+ PredClosure.try_emplace(Change);
for (change_ty Change : Changes)
for (succ_closure_iterator_ty it2 = succ_closure_begin(Change),
ie2 = succ_closure_end(Change);
``````````
</details>
https://github.com/llvm/llvm-project/pull/141374
More information about the llvm-commits
mailing list