1 //===------ ADT/SparseSetTest.cpp - SparseSet unit tests - -----*- C++ -*-===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 #include "llvm/ADT/SparseSet.h"
11 #include "gtest/gtest.h"
17 typedef SparseSet<unsigned> USet;
20 TEST(SparseSetTest, EmptySet) {
22 EXPECT_TRUE(Set.empty());
23 EXPECT_TRUE(Set.begin() == Set.end());
24 EXPECT_EQ(0u, Set.size());
28 // Lookups on empty set.
29 EXPECT_TRUE(Set.find(0) == Set.end());
30 EXPECT_TRUE(Set.find(9) == Set.end());
32 // Same thing on a const reference.
33 const USet &CSet = Set;
34 EXPECT_TRUE(CSet.empty());
35 EXPECT_TRUE(CSet.begin() == CSet.end());
36 EXPECT_EQ(0u, CSet.size());
37 EXPECT_TRUE(CSet.find(0) == CSet.end());
38 USet::const_iterator I = CSet.find(5);
39 EXPECT_TRUE(I == CSet.end());
42 // Single entry set tests.
43 TEST(SparseSetTest, SingleEntrySet) {
46 std::pair<USet::iterator, bool> IP = Set.insert(5);
47 EXPECT_TRUE(IP.second);
48 EXPECT_TRUE(IP.first == Set.begin());
50 EXPECT_FALSE(Set.empty());
51 EXPECT_FALSE(Set.begin() == Set.end());
52 EXPECT_TRUE(Set.begin() + 1 == Set.end());
53 EXPECT_EQ(1u, Set.size());
55 EXPECT_TRUE(Set.find(0) == Set.end());
56 EXPECT_TRUE(Set.find(9) == Set.end());
58 EXPECT_FALSE(Set.count(0));
59 EXPECT_TRUE(Set.count(5));
63 EXPECT_FALSE(IP.second);
64 EXPECT_TRUE(IP.first == Set.begin());
66 // Erase non-existent element.
67 EXPECT_FALSE(Set.erase(1));
68 EXPECT_EQ(1u, Set.size());
69 EXPECT_EQ(5u, *Set.begin());
72 USet::iterator I = Set.find(5);
73 EXPECT_TRUE(I == Set.begin());
75 EXPECT_TRUE(I == Set.end());
76 EXPECT_TRUE(Set.empty());
79 // Multiple entry set tests.
80 TEST(SparseSetTest, MultipleEntrySet) {
89 EXPECT_EQ(5u, Set.size());
91 // Without deletions, iteration order == insertion order.
92 USet::const_iterator I = Set.begin();
103 EXPECT_TRUE(I == Set.end());
106 std::pair<USet::iterator, bool> IP = Set.insert(3);
107 EXPECT_FALSE(IP.second);
108 EXPECT_TRUE(IP.first == Set.begin() + 1);
110 // Erase last element by key.
111 EXPECT_TRUE(Set.erase(4));
112 EXPECT_EQ(4u, Set.size());
113 EXPECT_FALSE(Set.count(4));
114 EXPECT_FALSE(Set.erase(4));
115 EXPECT_EQ(4u, Set.size());
116 EXPECT_FALSE(Set.count(4));
118 // Erase first element by key.
119 EXPECT_TRUE(Set.count(5));
120 EXPECT_TRUE(Set.find(5) == Set.begin());
121 EXPECT_TRUE(Set.erase(5));
122 EXPECT_EQ(3u, Set.size());
123 EXPECT_FALSE(Set.count(5));
124 EXPECT_FALSE(Set.erase(5));
125 EXPECT_EQ(3u, Set.size());
126 EXPECT_FALSE(Set.count(5));
130 EXPECT_EQ(5u, Set.size());
132 // Erase last element by iterator.
133 I = Set.erase(Set.end() - 1);
134 EXPECT_TRUE(I == Set.end());
135 EXPECT_EQ(4u, Set.size());
137 // Erase second element by iterator.
138 I = Set.erase(Set.begin() + 1);
139 EXPECT_TRUE(I == Set.begin() + 1);
141 // Clear and resize the universe.
143 EXPECT_FALSE(Set.count(5));
144 Set.setUniverse(1000);
146 // Add more than 256 elements.
147 for (unsigned i = 100; i != 800; ++i)
150 for (unsigned i = 0; i != 10; ++i)
153 for (unsigned i = 100; i != 800; ++i)
154 EXPECT_TRUE(Set.count(i));
156 EXPECT_FALSE(Set.count(99));
157 EXPECT_FALSE(Set.count(800));
158 EXPECT_EQ(700u, Set.size());
163 explicit Alt(unsigned x) : Value(x) {}
164 unsigned getSparseSetIndex() const { return Value - 1000; }
167 TEST(SparseSetTest, AltStructSet) {
168 typedef SparseSet<Alt> ASet;
171 Set.insert(Alt(1005));
173 ASet::iterator I = Set.find(5);
174 ASSERT_TRUE(I == Set.begin());
175 EXPECT_EQ(1005u, I->Value);
177 Set.insert(Alt(1006));
178 Set.insert(Alt(1006));
179 I = Set.erase(Set.begin());
180 ASSERT_TRUE(I == Set.begin());
181 EXPECT_EQ(1006u, I->Value);
183 EXPECT_FALSE(Set.erase(5));
184 EXPECT_TRUE(Set.erase(6));