From: Torok Edwin <edwintorok@gmail.com>
Date: Wed, 7 Oct 2009 09:23:56 +0000 (+0000)
Subject: Add a comment explaining how DenseMap::insert works, because it is not
X-Git-Url: http://demsky.eecs.uci.edu/git/?a=commitdiff_plain;h=127445818efd810b138dd5362129ab3c7f8b9963;p=oota-llvm.git

Add a comment explaining how DenseMap::insert works, because it is not
intuitive.
It does NOT update the value if the key is already in the map,
it also returns false if the key is already in the map, regardless
if the value matched.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@83458 91177308-0d34-0410-b5e6-96231b3b80d8
---

diff --git a/include/llvm/ADT/DenseMap.h b/include/llvm/ADT/DenseMap.h
index daeda28d129..0ed2d5a2525 100644
--- a/include/llvm/ADT/DenseMap.h
+++ b/include/llvm/ADT/DenseMap.h
@@ -145,6 +145,9 @@ public:
     return ValueT();
   }
 
+  // Inserts key,value pair into the map if the key isn't already in the map.
+  // If the key is already in the map, it returns false and doesn't update the
+  // value.
   std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV) {
     BucketT *TheBucket;
     if (LookupBucketFor(KV.first, TheBucket))