summaryrefslogtreecommitdiffstats
path: root/llvm/unittests
diff options
context:
space:
mode:
authorFlorian Hahn <florian.hahn@arm.com>2018-07-11 13:39:59 +0000
committerFlorian Hahn <florian.hahn@arm.com>2018-07-11 13:39:59 +0000
commitb4379c84d36677433bef47ebbdf4344fa1a4309c (patch)
treeb1beff63dc6afc1a0431aef16ce9af7cd93bfdbb /llvm/unittests
parent2f963a7e83df52c31c363cd8336233ba8f71a254 (diff)
downloadbcm5719-llvm-b4379c84d36677433bef47ebbdf4344fa1a4309c.tar.gz
bcm5719-llvm-b4379c84d36677433bef47ebbdf4344fa1a4309c.zip
Recommit r334887: [SmallSet] Add SmallSetIterator.
This version now uses the subset of is_trivially_XXX provided by GCC 4.8 and llvm/Support/type_traits.h llvm-svn: 336805
Diffstat (limited to 'llvm/unittests')
-rw-r--r--llvm/unittests/ADT/SmallSetTest.cpp55
1 files changed, 55 insertions, 0 deletions
diff --git a/llvm/unittests/ADT/SmallSetTest.cpp b/llvm/unittests/ADT/SmallSetTest.cpp
index 7608e65674e..f820c9e5ccf 100644
--- a/llvm/unittests/ADT/SmallSetTest.cpp
+++ b/llvm/unittests/ADT/SmallSetTest.cpp
@@ -13,6 +13,7 @@
#include "llvm/ADT/SmallSet.h"
#include "gtest/gtest.h"
+#include <string>
using namespace llvm;
@@ -68,3 +69,57 @@ 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