1 //===- llvm/unittest/ADT/SmallVectorTest.cpp ------------------------------===//
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 // SmallVector unit tests.
12 //===----------------------------------------------------------------------===//
14 #include "gtest/gtest.h"
15 #include "llvm/ADT/SmallVector.h"
16 #include "llvm/Support/Compiler.h"
24 /// A helper class that counts the total number of constructor and
28 static int numConstructorCalls
;
29 static int numDestructorCalls
;
30 static int numAssignmentCalls
;
35 Constructable() : value(0) {
36 ++numConstructorCalls
;
39 Constructable(int val
) : value(val
) {
40 ++numConstructorCalls
;
43 Constructable(const Constructable
& src
) {
45 ++numConstructorCalls
;
52 Constructable
& operator=(const Constructable
& src
) {
58 int getValue() const {
63 numConstructorCalls
= 0;
64 numDestructorCalls
= 0;
65 numAssignmentCalls
= 0;
68 static int getNumConstructorCalls() {
69 return numConstructorCalls
;
72 static int getNumDestructorCalls() {
73 return numDestructorCalls
;
76 friend bool operator==(const Constructable
& c0
, const Constructable
& c1
) {
77 return c0
.getValue() == c1
.getValue();
80 friend bool LLVM_ATTRIBUTE_UNUSED
81 operator!=(const Constructable
& c0
, const Constructable
& c1
) {
82 return c0
.getValue() != c1
.getValue();
86 int Constructable::numConstructorCalls
;
87 int Constructable::numDestructorCalls
;
88 int Constructable::numAssignmentCalls
;
91 class SmallVectorTest
: public testing::Test
{
93 typedef SmallVector
<Constructable
, 4> VectorType
;
96 VectorType otherVector
;
99 Constructable::reset();
102 void assertEmpty(VectorType
& v
) {
104 EXPECT_EQ(0u, v
.size());
105 EXPECT_TRUE(v
.empty());
108 EXPECT_TRUE(v
.begin() == v
.end());
111 // Assert that theVector contains the specified values, in order.
112 void assertValuesInOrder(VectorType
& v
, size_t size
, ...) {
113 EXPECT_EQ(size
, v
.size());
117 for (size_t i
= 0; i
< size
; ++i
) {
118 int value
= va_arg(ap
, int);
119 EXPECT_EQ(value
, v
[i
].getValue());
125 // Generate a sequence of values to initialize the vector.
126 void makeSequence(VectorType
& v
, int start
, int end
) {
127 for (int i
= start
; i
<= end
; ++i
) {
128 v
.push_back(Constructable(i
));
134 TEST_F(SmallVectorTest
, EmptyVectorTest
) {
135 SCOPED_TRACE("EmptyVectorTest");
136 assertEmpty(theVector
);
137 EXPECT_TRUE(theVector
.rbegin() == theVector
.rend());
138 EXPECT_EQ(0, Constructable::getNumConstructorCalls());
139 EXPECT_EQ(0, Constructable::getNumDestructorCalls());
142 // Simple insertions and deletions.
143 TEST_F(SmallVectorTest
, PushPopTest
) {
144 SCOPED_TRACE("PushPopTest");
147 theVector
.push_back(Constructable(1));
150 assertValuesInOrder(theVector
, 1u, 1);
151 EXPECT_FALSE(theVector
.begin() == theVector
.end());
152 EXPECT_FALSE(theVector
.empty());
154 // Push another element
155 theVector
.push_back(Constructable(2));
156 assertValuesInOrder(theVector
, 2u, 1, 2);
158 // Insert at beginning
159 theVector
.insert(theVector
.begin(), theVector
[1]);
160 assertValuesInOrder(theVector
, 3u, 2, 1, 2);
163 theVector
.pop_back();
164 assertValuesInOrder(theVector
, 2u, 2, 1);
166 // Pop remaining elements
167 theVector
.pop_back();
168 theVector
.pop_back();
169 assertEmpty(theVector
);
171 // Check number of constructor calls. Should be 2 for each list element,
172 // one for the argument to push_back, one for the argument to insert,
173 // and one for the list element itself.
174 EXPECT_EQ(5, Constructable::getNumConstructorCalls());
175 EXPECT_EQ(5, Constructable::getNumDestructorCalls());
179 TEST_F(SmallVectorTest
, ClearTest
) {
180 SCOPED_TRACE("ClearTest");
182 makeSequence(theVector
, 1, 2);
185 assertEmpty(theVector
);
186 EXPECT_EQ(4, Constructable::getNumConstructorCalls());
187 EXPECT_EQ(4, Constructable::getNumDestructorCalls());
190 // Resize smaller test.
191 TEST_F(SmallVectorTest
, ResizeShrinkTest
) {
192 SCOPED_TRACE("ResizeShrinkTest");
194 makeSequence(theVector
, 1, 3);
197 assertValuesInOrder(theVector
, 1u, 1);
198 EXPECT_EQ(6, Constructable::getNumConstructorCalls());
199 EXPECT_EQ(5, Constructable::getNumDestructorCalls());
202 // Resize bigger test.
203 TEST_F(SmallVectorTest
, ResizeGrowTest
) {
204 SCOPED_TRACE("ResizeGrowTest");
208 // The extra constructor/destructor calls come from the temporary object used
209 // to initialize the contents of the resized array (via copy construction).
210 EXPECT_EQ(3, Constructable::getNumConstructorCalls());
211 EXPECT_EQ(1, Constructable::getNumDestructorCalls());
212 EXPECT_EQ(2u, theVector
.size());
215 // Resize with fill value.
216 TEST_F(SmallVectorTest
, ResizeFillTest
) {
217 SCOPED_TRACE("ResizeFillTest");
219 theVector
.resize(3, Constructable(77));
220 assertValuesInOrder(theVector
, 3u, 77, 77, 77);
223 // Overflow past fixed size.
224 TEST_F(SmallVectorTest
, OverflowTest
) {
225 SCOPED_TRACE("OverflowTest");
227 // Push more elements than the fixed size.
228 makeSequence(theVector
, 1, 10);
230 // Test size and values.
231 EXPECT_EQ(10u, theVector
.size());
232 for (int i
= 0; i
< 10; ++i
) {
233 EXPECT_EQ(i
+1, theVector
[i
].getValue());
236 // Now resize back to fixed size.
239 assertValuesInOrder(theVector
, 1u, 1);
243 TEST_F(SmallVectorTest
, IterationTest
) {
244 makeSequence(theVector
, 1, 2);
247 VectorType::iterator it
= theVector
.begin();
248 EXPECT_TRUE(*it
== theVector
.front());
249 EXPECT_TRUE(*it
== theVector
[0]);
250 EXPECT_EQ(1, it
->getValue());
252 EXPECT_TRUE(*it
== theVector
[1]);
253 EXPECT_TRUE(*it
== theVector
.back());
254 EXPECT_EQ(2, it
->getValue());
256 EXPECT_TRUE(it
== theVector
.end());
258 EXPECT_TRUE(*it
== theVector
[1]);
259 EXPECT_EQ(2, it
->getValue());
261 EXPECT_TRUE(*it
== theVector
[0]);
262 EXPECT_EQ(1, it
->getValue());
265 VectorType::reverse_iterator rit
= theVector
.rbegin();
266 EXPECT_TRUE(*rit
== theVector
[1]);
267 EXPECT_EQ(2, rit
->getValue());
269 EXPECT_TRUE(*rit
== theVector
[0]);
270 EXPECT_EQ(1, rit
->getValue());
272 EXPECT_TRUE(rit
== theVector
.rend());
274 EXPECT_TRUE(*rit
== theVector
[0]);
275 EXPECT_EQ(1, rit
->getValue());
277 EXPECT_TRUE(*rit
== theVector
[1]);
278 EXPECT_EQ(2, rit
->getValue());
282 TEST_F(SmallVectorTest
, SwapTest
) {
283 SCOPED_TRACE("SwapTest");
285 makeSequence(theVector
, 1, 2);
286 std::swap(theVector
, otherVector
);
288 assertEmpty(theVector
);
289 assertValuesInOrder(otherVector
, 2u, 1, 2);
293 TEST_F(SmallVectorTest
, AppendTest
) {
294 SCOPED_TRACE("AppendTest");
296 makeSequence(otherVector
, 2, 3);
298 theVector
.push_back(Constructable(1));
299 theVector
.append(otherVector
.begin(), otherVector
.end());
301 assertValuesInOrder(theVector
, 3u, 1, 2, 3);
304 // Append repeated test
305 TEST_F(SmallVectorTest
, AppendRepeatedTest
) {
306 SCOPED_TRACE("AppendRepeatedTest");
308 theVector
.push_back(Constructable(1));
309 theVector
.append(2, Constructable(77));
310 assertValuesInOrder(theVector
, 3u, 1, 77, 77);
314 TEST_F(SmallVectorTest
, AssignTest
) {
315 SCOPED_TRACE("AssignTest");
317 theVector
.push_back(Constructable(1));
318 theVector
.assign(2, Constructable(77));
319 assertValuesInOrder(theVector
, 2u, 77, 77);
322 // Erase a single element
323 TEST_F(SmallVectorTest
, EraseTest
) {
324 SCOPED_TRACE("EraseTest");
326 makeSequence(theVector
, 1, 3);
327 theVector
.erase(theVector
.begin());
328 assertValuesInOrder(theVector
, 2u, 2, 3);
331 // Erase a range of elements
332 TEST_F(SmallVectorTest
, EraseRangeTest
) {
333 SCOPED_TRACE("EraseRangeTest");
335 makeSequence(theVector
, 1, 3);
336 theVector
.erase(theVector
.begin(), theVector
.begin() + 2);
337 assertValuesInOrder(theVector
, 1u, 3);
340 // Insert a single element.
341 TEST_F(SmallVectorTest
, InsertTest
) {
342 SCOPED_TRACE("InsertTest");
344 makeSequence(theVector
, 1, 3);
345 theVector
.insert(theVector
.begin() + 1, Constructable(77));
346 assertValuesInOrder(theVector
, 4u, 1, 77, 2, 3);
349 // Insert repeated elements.
350 TEST_F(SmallVectorTest
, InsertRepeatedTest
) {
351 SCOPED_TRACE("InsertRepeatedTest");
353 makeSequence(theVector
, 10, 15);
354 theVector
.insert(theVector
.begin() + 1, 2, Constructable(16));
355 assertValuesInOrder(theVector
, 8u, 10, 16, 16, 11, 12, 13, 14, 15);
359 TEST_F(SmallVectorTest
, InsertRangeTest
) {
360 SCOPED_TRACE("InsertRepeatedTest");
362 makeSequence(theVector
, 1, 3);
363 theVector
.insert(theVector
.begin() + 1, 3, Constructable(77));
364 assertValuesInOrder(theVector
, 6u, 1, 77, 77, 77, 2, 3);
368 TEST_F(SmallVectorTest
, ComparisonTest
) {
369 SCOPED_TRACE("ComparisonTest");
371 makeSequence(theVector
, 1, 3);
372 makeSequence(otherVector
, 1, 3);
374 EXPECT_TRUE(theVector
== otherVector
);
375 EXPECT_FALSE(theVector
!= otherVector
);
378 makeSequence(otherVector
, 2, 4);
380 EXPECT_FALSE(theVector
== otherVector
);
381 EXPECT_TRUE(theVector
!= otherVector
);
384 // Constant vector tests.
385 TEST_F(SmallVectorTest
, ConstVectorTest
) {
386 const VectorType constVector
;
388 EXPECT_EQ(0u, constVector
.size());
389 EXPECT_TRUE(constVector
.empty());
390 EXPECT_TRUE(constVector
.begin() == constVector
.end());
393 // Direct array access.
394 TEST_F(SmallVectorTest
, DirectVectorTest
) {
395 EXPECT_EQ(0u, theVector
.size());
396 EXPECT_LE(4u, theVector
.capacity());
397 EXPECT_EQ(0, Constructable::getNumConstructorCalls());
398 theVector
.end()[0] = 1;
399 theVector
.end()[1] = 2;
400 theVector
.end()[2] = 3;
401 theVector
.end()[3] = 4;
402 theVector
.set_size(4);
403 EXPECT_EQ(4u, theVector
.size());
404 EXPECT_EQ(4, Constructable::getNumConstructorCalls());
405 EXPECT_EQ(1, theVector
[0].getValue());
406 EXPECT_EQ(2, theVector
[1].getValue());
407 EXPECT_EQ(3, theVector
[2].getValue());
408 EXPECT_EQ(4, theVector
[3].getValue());
411 TEST_F(SmallVectorTest
, IteratorTest
) {
413 theVector
.insert(theVector
.end(), L
.begin(), L
.end());