Lines Matching full:set

18 // Empty set tests.
20   USet Set;
21   EXPECT_TRUE(Set.empty());
22   EXPECT_TRUE(Set.begin() == Set.end());
23   EXPECT_EQ(0u, Set.size());
25   Set.setUniverse(10);
27   // Lookups on empty set.
28   EXPECT_FALSE(Set.contains(0));
29   EXPECT_FALSE(Set.contains(9));
32   const USet &CSet = Set;
41 // Single entry set tests.
43   USet Set;
44   Set.setUniverse(10);
45   std::pair<USet::iterator, bool> IP = Set.insert(5);
47   EXPECT_TRUE(IP.first == Set.begin());
49   EXPECT_FALSE(Set.empty());
50   EXPECT_FALSE(Set.begin() == Set.end());
51   EXPECT_TRUE(Set.begin() + 1 == Set.end());
52   EXPECT_EQ(1u, Set.size());
54   EXPECT_FALSE(Set.contains(0));
55   EXPECT_FALSE(Set.contains(9));
56   EXPECT_TRUE(Set.contains(5));
58   EXPECT_FALSE(Set.count(0));
59   EXPECT_TRUE(Set.count(5));
62   IP = Set.insert(5);
64   EXPECT_TRUE(IP.first == Set.begin());
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());
74   I = Set.erase(I);
75   EXPECT_FALSE(Set.contains(5));
76   EXPECT_TRUE(I == Set.end());
77   EXPECT_TRUE(Set.empty());
80 // Multiple entry set tests.
82   USet Set;
83   Set.setUniverse(10);
85   Set.insert(5);
86   Set.insert(3);
87   Set.insert(2);
88   Set.insert(1);
89   Set.insert(4);
90   EXPECT_EQ(5u, Set.size());
93   USet::const_iterator I = Set.begin();
104   EXPECT_TRUE(I == Set.end());
107   std::pair<USet::iterator, bool> IP = Set.insert(3);
109   EXPECT_TRUE(IP.first == Set.begin() + 1);
112   EXPECT_TRUE(Set.erase(4));
113   EXPECT_EQ(4u, Set.size());
114   EXPECT_FALSE(Set.count(4));
115   EXPECT_FALSE(Set.erase(4));
116   EXPECT_EQ(4u, Set.size());
117   EXPECT_FALSE(Set.count(4));
120   EXPECT_TRUE(Set.count(5));
121   EXPECT_TRUE(Set.find(5) == Set.begin());
122   EXPECT_TRUE(Set.erase(5));
123   EXPECT_EQ(3u, Set.size());
124   EXPECT_FALSE(Set.count(5));
125   EXPECT_FALSE(Set.erase(5));
126   EXPECT_EQ(3u, Set.size());
127   EXPECT_FALSE(Set.count(5));
129   Set.insert(6);
130   Set.insert(7);
131   EXPECT_EQ(5u, Set.size());
134   I = Set.erase(Set.end() - 1);
135   EXPECT_TRUE(I == Set.end());
136   EXPECT_EQ(4u, Set.size());
139   I = Set.erase(Set.begin() + 1);
140   EXPECT_TRUE(I == Set.begin() + 1);
143   Set.clear();
144   EXPECT_FALSE(Set.count(5));
145   Set.setUniverse(1000);
149     Set.insert(i);
152     Set.erase(i);
155     EXPECT_TRUE(Set.count(i));
157   EXPECT_FALSE(Set.count(99));
158   EXPECT_FALSE(Set.count(800));
159   EXPECT_EQ(700u, Set.size());
170   ASet Set;
171   Set.setUniverse(10);
172   Set.insert(Alt(1005));
174   ASet::iterator I = Set.find(5);
175   ASSERT_TRUE(I == Set.begin());
178   Set.insert(Alt(1006));
179   Set.insert(Alt(1006));
180   I = Set.erase(Set.begin());
181   ASSERT_TRUE(I == Set.begin());
184   EXPECT_FALSE(Set.erase(5));
185   EXPECT_TRUE(Set.erase(6));
189   USet Set;
191   Set.setUniverse(UpperBound);
193     Set.insert(i);
198   while (!Set.empty())
199     ASSERT_TRUE(--Expected == Set.pop_back_val());
201   // Insert again the same elements in the sparse set and make sure
205     ASSERT_TRUE(Set.insert(i).second);
209   USet Set;
210   Set.setUniverse(2);
211   Set.insert(1);
212   EXPECT_FALSE(Set.empty());
214   USet OtherSet(std::move(Set));
215   EXPECT_TRUE(Set.empty());