From bdbf0154769dd2f2565068a51fd49e4be0005f55 Mon Sep 17 00:00:00 2001
From: Eric Christopher <echristo@apple.com>
Date: Wed, 25 Apr 2012 17:51:00 +0000
Subject: Revert "First implementation of:"

This reverts commit 76271a3366731d4c372fdebcd8d3437e6e09a61b.

as it's breaking the bots.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@155562 91177308-0d34-0410-b5e6-96231b3b80d8
---
 unittests/ADT/SmallMapTest.cpp | 133 -----------------------------------------
 1 file changed, 133 deletions(-)
 delete mode 100644 unittests/ADT/SmallMapTest.cpp

(limited to 'unittests')

diff --git a/unittests/ADT/SmallMapTest.cpp b/unittests/ADT/SmallMapTest.cpp
deleted file mode 100644
index 361f0126bf..0000000000
--- a/unittests/ADT/SmallMapTest.cpp
+++ /dev/null
@@ -1,133 +0,0 @@
-//===- llvm/unittest/ADT/SmallMapTest.cpp ------------------------------===//
-//
-//                     The LLVM Compiler Infrastructure
-//
-// This file is distributed under the University of Illinois Open Source
-// License. See LICENSE.TXT for details.
-//
-//===----------------------------------------------------------------------===//
-//
-// SmallMap unit tests.
-//
-//===----------------------------------------------------------------------===//
-
-#include "gtest/gtest.h"
-#include "llvm/ADT/SmallMap.h"
-
-using namespace llvm;
-
-// SmallMap test.
-TEST(SmallMapTest, GeneralTest) {
-
-  int buf[10];
-
-  SmallMap<int *, int, 3> a;
-  SmallMap<int *, int, 3> b;
-  SmallMap<int *, int, 3>::iterator found;
-  std::pair<SmallMap<int *, int, 3>::iterator, bool> insRes;
-  SmallMap<int *, int, 3>::const_iterator foundc;
-
-  a.insert(std::make_pair(&buf[0], 0));
-  insRes = a.insert(std::make_pair(&buf[1], 1));
-  EXPECT_TRUE(insRes.second);
-
-  // Check insertion, looking up, and data editing in small mode.
-  insRes = a.insert(std::make_pair(&buf[1], 6));
-  EXPECT_FALSE(insRes.second);
-  EXPECT_EQ(insRes.first->second, 1);
-  insRes.first->second = 5;
-  found = a.find(&buf[1]);
-  EXPECT_NE(found, a.end());
-  EXPECT_EQ(found->second, 5);
-  a[&buf[1]] = 10;
-  EXPECT_EQ(found->second, 10);
-  // Check "not found" case.
-  found = a.find(&buf[8]);
-  EXPECT_EQ(found, a.end());
-  
-  // Check increment for small mode.
-  found = a.begin();
-  ++found;
-  EXPECT_EQ(found->second, 10);
-
-  b.insert(std::make_pair(&buf[2], 2));
-
-  std::swap(a, b);
-  a.swap(b);
-  std::swap(a, b);
-
-  EXPECT_EQ(1U, a.size());
-  EXPECT_EQ(2U, b.size());
-  EXPECT_TRUE(a.count(&buf[2]));
-  EXPECT_TRUE(b.count(&buf[0]));
-  EXPECT_TRUE(b.count(&buf[1]));
-
-  insRes = b.insert(std::make_pair(&buf[3], 3));
-  EXPECT_TRUE(insRes.second);
-
-  // Check insertion, looking up, and data editing in big mode.
-  insRes = b.insert(std::make_pair(&buf[3], 6));
-  EXPECT_FALSE(insRes.second);
-  EXPECT_EQ(insRes.first->second, 3);
-  insRes.first->second = 7;
-  found = b.find(&buf[3]);
-  EXPECT_EQ(found->second, 7);
-  b[&buf[3]] = 14;
-  EXPECT_EQ(found->second, 14);
-  // Check constant looking up.
-  foundc = b.find(&buf[3]);  
-  EXPECT_EQ(foundc->first, &buf[3]);
-  EXPECT_EQ(foundc->second, 14);
-  // Check not found case.
-  found = b.find(&buf[8]);
-  EXPECT_EQ(found, b.end());
-  
-  // Check increment for big mode.
-  found = b.find(&buf[1]);
-  ++found;
-  EXPECT_EQ(found->second, 14);
-  
-  std::swap(a, b);
-  a.swap(b);
-  std::swap(a, b);
-
-  EXPECT_EQ(3U, a.size());
-  EXPECT_EQ(1U, b.size());
-  EXPECT_TRUE(a.count(&buf[0]));
-  EXPECT_TRUE(a.count(&buf[1]));
-  EXPECT_TRUE(a.count(&buf[3]));
-  EXPECT_TRUE(b.count(&buf[2]));
-  EXPECT_EQ(b.find(&buf[2])->second, 2);
-
-  std::swap(a, b);
-  a.swap(b);
-  std::swap(a, b);
-
-  EXPECT_EQ(1U, a.size());
-  EXPECT_EQ(3U, b.size());
-  EXPECT_TRUE(a.count(&buf[2]));
-  EXPECT_TRUE(b.count(&buf[0]));
-  EXPECT_TRUE(b.count(&buf[1]));
-  EXPECT_TRUE(b.count(&buf[3]));
-
-  a.insert(std::make_pair(&buf[4], 4));
-  a.insert(std::make_pair(&buf[5], 5));
-  a.insert(std::make_pair(&buf[6], 6));
-
-  std::swap(b, a);
-
-  EXPECT_EQ(3U, a.size());
-  EXPECT_EQ(4U, b.size());
-  EXPECT_TRUE(b.count(&buf[2]));
-  EXPECT_TRUE(b.count(&buf[4]));
-  EXPECT_TRUE(b.count(&buf[5]));
-  EXPECT_TRUE(b.count(&buf[6]));
-  EXPECT_TRUE(a.count(&buf[0]));
-  EXPECT_TRUE(a.count(&buf[1]));
-  EXPECT_TRUE(a.count(&buf[3]));
-  
-  // Check findAndConstruct
-  SmallMap<int *, int, 3>::value_type Buf7;
-  Buf7 = a.FindAndConstruct(&buf[7]);
-  EXPECT_EQ(Buf7.second, 0);
-}
-- 
cgit v1.2.3-18-g5258