From 6acfe92b329bf5161ab6578322ab7ee9a6ab9543 Mon Sep 17 00:00:00 2001
From: Chris Lattner <sabre@nondot.org>
Date: Thu, 13 Nov 2003 05:04:19 +0000
Subject: [PATCH] Minor code cleanup

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@9962 91177308-0d34-0410-b5e6-96231b3b80d8
---
 lib/Analysis/DataStructure/BottomUpClosure.cpp | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/lib/Analysis/DataStructure/BottomUpClosure.cpp b/lib/Analysis/DataStructure/BottomUpClosure.cpp
index ea4a326fbeb..de83f383c62 100644
--- a/lib/Analysis/DataStructure/BottomUpClosure.cpp
+++ b/lib/Analysis/DataStructure/BottomUpClosure.cpp
@@ -94,7 +94,7 @@ unsigned BUDataStructures::calculateGraphs(Function *F,
                                            std::vector<Function*> &Stack,
                                            unsigned &NextID, 
                                      hash_map<Function*, unsigned> &ValMap) {
-  assert(ValMap.find(F) == ValMap.end() && "Shouldn't revisit functions!");
+  assert(!ValMap.count(F) && "Shouldn't revisit functions!");
   unsigned Min = NextID++, MyID = Min;
   ValMap[F] = Min;
   Stack.push_back(F);
@@ -260,7 +260,7 @@ void BUDataStructures::calculateGraph(DSGraph &Graph) {
 
     if (Callee->isExternal()) {
       // Ignore this case, simple varargs functions we cannot stub out!
-    } else if (ReturnNodes.find(Callee) != ReturnNodes.end()) {
+    } else if (ReturnNodes.count(Callee)) {
       // Self recursion... simply link up the formal arguments with the
       // actual arguments...
       DEBUG(std::cerr << "    Self Inlining: " << Callee->getName() << "\n");
-- 
2.34.1