[llvm] 2b69a49 - [Support] Avoid repeated hash lookups (NFC) (#132517)

[via llvm-commits]

Author: Kazu Hirata
Date: 2025-03-22T08:09:28-07:00
New Revision: 2b69a499407a2bfa55f20486e7810b91f20ea910

URL: https://github.com/llvm/llvm-project/commit/2b69a499407a2bfa55f20486e7810b91f20ea910
DIFF: https://github.com/llvm/llvm-project/commit/2b69a499407a2bfa55f20486e7810b91f20ea910.diff

LOG: [Support] Avoid repeated hash lookups (NFC) (#132517)

Added: 
    

Modified: 
    llvm/lib/Support/SuffixTree.cpp

Removed: 
    


################################################################################
diff  --git a/llvm/lib/Support/SuffixTree.cpp b/llvm/lib/Support/SuffixTree.cpp
index 5e58310e1128b..5abcead5037f4 100644
--- a/llvm/lib/Support/SuffixTree.cpp
+++ b/llvm/lib/Support/SuffixTree.cpp
@@ -193,7 +193,8 @@ unsigned SuffixTree::extend(unsigned EndIdx, unsigned SuffixesToAdd) {
     unsigned FirstChar = Str[Active.Idx];
 
     // Have we inserted anything starting with FirstChar at the current node?
-    if (Active.Node->Children.count(FirstChar) == 0) {
+    if (auto It = Active.Node->Children.find(FirstChar);
+        It == Active.Node->Children.end()) {
       // If not, then we can just insert a leaf and move to the next step.
       insertLeaf(*Active.Node, EndIdx, FirstChar);
 
@@ -206,7 +207,7 @@ unsigned SuffixTree::extend(unsigned EndIdx, unsigned SuffixesToAdd) {
     } else {
       // There's a match with FirstChar, so look for the point in the tree to
       // insert a new node.
-      SuffixTreeNode *NextNode = Active.Node->Children[FirstChar];
+      SuffixTreeNode *NextNode = It->second;
 
       unsigned SubstringLen = numElementsInSubstring(NextNode);