simplify insert interface

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

diff --git a/include/llvm/ADT/SmallSet.h b/include/llvm/ADT/SmallSet.h
index f0481fcef335aef5e6e7ca5f25510bd8a77ae95a..ef1470501abe92d7090b8c5a2aad2e5a60639ae0 100644 (file)
--- a/include/llvm/ADT/SmallSet.h
+++ b/include/llvm/ADT/SmallSet.h
@@ -55,12 +55,12 @@ public:
   }
   
   /// insert - Insert an element into the set if it isn't already there.
-  std::pair<iterator,bool> insert(const T &V) {
+  bool insert(const T &V) {
     iterator I = find(V);
     if (I != end())    // Don't reinsert if it already exists.
-      return std::make_pair(I, false);
+      return false;
     Vector.push_back(V);
-    return std::make_pair(end()-1, true);
+    return true;
   }
   
   void erase(const T &V) {