summaryrefslogtreecommitdiffstats
path: root/llvm/unittests/ADT/SmallSetTest.cpp
diff options
context:
space:
mode:
authorFlorian Hahn <florian.hahn@arm.com>2018-06-16 13:00:33 +0000
committerFlorian Hahn <florian.hahn@arm.com>2018-06-16 13:00:33 +0000
commit0939fea8b4614efaf61cc3e59596d72fabfaf790 (patch)
tree60b1ec9e31a55efa9cf564105dae1dd016ee51af /llvm/unittests/ADT/SmallSetTest.cpp
parent9d47ce784d5db964cc2a46d81dde3439f0a693a3 (diff)
downloadbcm5719-llvm-0939fea8b4614efaf61cc3e59596d72fabfaf790.tar.gz
bcm5719-llvm-0939fea8b4614efaf61cc3e59596d72fabfaf790.zip
Revert r334887, as GCC 4.8 does not have is_trivially_copy_constructible & co
llvm-svn: 334889
Diffstat (limited to 'llvm/unittests/ADT/SmallSetTest.cpp')
-rw-r--r--llvm/unittests/ADT/SmallSetTest.cpp55
1 files changed, 0 insertions, 55 deletions
diff --git a/llvm/unittests/ADT/SmallSetTest.cpp b/llvm/unittests/ADT/SmallSetTest.cpp
index f820c9e5ccf..7608e65674e 100644
--- a/llvm/unittests/ADT/SmallSetTest.cpp
+++ b/llvm/unittests/ADT/SmallSetTest.cpp
@@ -13,7 +13,6 @@
#include "llvm/ADT/SmallSet.h"
#include "gtest/gtest.h"
-#include <string>
using namespace llvm;
@@ -69,57 +68,3 @@ TEST(SmallSetTest, Erase) {
EXPECT_EQ(0u, s1.count(8));
}
-
-TEST(SmallSetTest, IteratorInt) {
- SmallSet<int, 4> s1;
-
- // Test the 'small' case.
- for (int i = 0; i < 3; i++)
- s1.insert(i);
-
- std::vector<int> V(s1.begin(), s1.end());
- // Make sure the elements are in the expected order.
- std::sort(V.begin(), V.end());
- for (int i = 0; i < 3; i++)
- EXPECT_EQ(i, V[i]);
-
- // Test the 'big' case by adding a few more elements to switch to std::set
- // internally.
- for (int i = 3; i < 6; i++)
- s1.insert(i);
-
- V.assign(s1.begin(), s1.end());
- // Make sure the elements are in the expected order.
- std::sort(V.begin(), V.end());
- for (int i = 0; i < 6; i++)
- EXPECT_EQ(i, V[i]);
-}
-
-TEST(SmallSetTest, IteratorString) {
- // Test SmallSetIterator for SmallSet with a type with non-trivial
- // ctors/dtors.
- SmallSet<std::string, 2> s1;
-
- s1.insert("str 1");
- s1.insert("str 2");
- s1.insert("str 1");
-
- std::vector<std::string> V(s1.begin(), s1.end());
- std::sort(V.begin(), V.end());
- EXPECT_EQ(2u, s1.size());
- EXPECT_EQ("str 1", V[0]);
- EXPECT_EQ("str 2", V[1]);
-
- s1.insert("str 4");
- s1.insert("str 0");
- s1.insert("str 4");
-
- V.assign(s1.begin(), s1.end());
- // Make sure the elements are in the expected order.
- std::sort(V.begin(), V.end());
- EXPECT_EQ(4u, s1.size());
- EXPECT_EQ("str 0", V[0]);
- EXPECT_EQ("str 1", V[1]);
- EXPECT_EQ("str 2", V[2]);
- EXPECT_EQ("str 4", V[3]);
-}
OpenPOWER on IntegriCloud