[mlir] Simplify code with MapVector::operator[] (NFC) (llvm#113407)

kazutakahirata · web-flow · commit 5d6cb6f78ac9 · 2024-11-04T09:40:21.000-08:00
diff --git a/mlir/lib/Conversion/PDLToPDLInterp/PredicateTree.cpp b/mlir/lib/Conversion/PDLToPDLInterp/PredicateTree.cpp
@@ -818,7 +818,7 @@ std::unique_ptr<MatcherNode> &getOrCreateChild(SwitchNode *node,
   auto it = predicate->patternToAnswer.find(pattern);
   assert(it != predicate->patternToAnswer.end() &&
          "expected pattern to exist in predicate");
-  return node->getChildren().insert({it->second, nullptr}).first->second;
+  return node->getChildren()[it->second];
 }
 
 /// Build the matcher CFG by "pushing" patterns through by sorted predicate

Original file line number	Diff line number	Diff line change
`@@ -818,7 +818,7 @@ std::unique_ptr<MatcherNode> &getOrCreateChild(SwitchNode *node,`
`818`	`818`	`auto it = predicate->patternToAnswer.find(pattern);`
`819`	`819`	`assert(it != predicate->patternToAnswer.end() &&`
`820`	`820`	`"expected pattern to exist in predicate");`
`821`		`- return node->getChildren().insert({it->second, nullptr}).first->second;`
	`821`	`+ return node->getChildren()[it->second];`
`822`	`822`	`}`
`823`	`823`
`824`	`824`	`/// Build the matcher CFG by "pushing" patterns through by sorted predicate`