2 * Copyright (C) 2011 Apple Inc. All rights reserved.
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions
7 * 1. Redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer.
9 * 2. Redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution.
13 * THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS''
14 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
15 * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
16 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS
17 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
18 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
19 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
20 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
21 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
22 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
23 * THE POSSIBILITY OF SUCH DAMAGE.
28 #include "wtf/Deque.h"
30 #include "wtf/HashSet.h"
31 #include "wtf/OwnPtr.h"
32 #include "wtf/PassOwnPtr.h"
33 #include <gtest/gtest.h>
37 TEST(DequeTest, Basic)
40 EXPECT_TRUE(intDeque.isEmpty());
41 EXPECT_EQ(0ul, intDeque.size());
44 void checkNumberSequence(Deque<int>& deque, int from, int to, bool increment)
46 Deque<int>::iterator it = increment ? deque.begin() : deque.end();
47 size_t index = increment ? 0 : deque.size();
48 int step = from < to ? 1 : -1;
49 for (int i = from; i != to + step; i += step) {
56 EXPECT_EQ(i, deque[index]);
63 EXPECT_EQ(increment ? deque.end() : deque.begin(), it);
64 EXPECT_EQ(increment ? deque.size() : 0, index);
67 void checkNumberSequenceReverse(Deque<int>& deque, int from, int to, bool increment)
69 Deque<int>::reverse_iterator it = increment ? deque.rbegin() : deque.rend();
70 size_t index = increment ? 0 : deque.size();
71 int step = from < to ? 1 : -1;
72 for (int i = from; i != to + step; i += step) {
79 EXPECT_EQ(i, deque.at(deque.size() - 1 - index));
86 EXPECT_EQ(increment ? deque.rend() : deque.rbegin(), it);
87 EXPECT_EQ(increment ? deque.size() : 0, index);
90 TEST(DequeTest, Reverse)
98 checkNumberSequence(intDeque, 10, 13, true);
99 checkNumberSequence(intDeque, 13, 10, false);
100 checkNumberSequenceReverse(intDeque, 13, 10, true);
101 checkNumberSequenceReverse(intDeque, 10, 13, false);
105 EXPECT_EQ(10, intDeque.takeFirst());
106 EXPECT_EQ(15, intDeque.takeLast());
107 checkNumberSequence(intDeque, 11, 14, true);
108 checkNumberSequence(intDeque, 14, 11, false);
109 checkNumberSequenceReverse(intDeque, 14, 11, true);
110 checkNumberSequenceReverse(intDeque, 11, 14, false);
112 for (int i = 15; i < 200; ++i)
114 checkNumberSequence(intDeque, 11, 199, true);
115 checkNumberSequence(intDeque, 199, 11, false);
116 checkNumberSequenceReverse(intDeque, 199, 11, true);
117 checkNumberSequenceReverse(intDeque, 11, 199, false);
119 for (int i = 0; i < 180; ++i) {
120 EXPECT_EQ(i + 11, intDeque[0]);
121 EXPECT_EQ(i + 11, intDeque.takeFirst());
123 checkNumberSequence(intDeque, 191, 199, true);
124 checkNumberSequence(intDeque, 199, 191, false);
125 checkNumberSequenceReverse(intDeque, 199, 191, true);
126 checkNumberSequenceReverse(intDeque, 191, 199, false);
128 Deque<int> intDeque2;
129 swap(intDeque, intDeque2);
131 checkNumberSequence(intDeque2, 191, 199, true);
132 checkNumberSequence(intDeque2, 199, 191, false);
133 checkNumberSequenceReverse(intDeque2, 199, 191, true);
134 checkNumberSequenceReverse(intDeque2, 191, 199, false);
136 intDeque.swap(intDeque2);
138 checkNumberSequence(intDeque, 191, 199, true);
139 checkNumberSequence(intDeque, 199, 191, false);
140 checkNumberSequenceReverse(intDeque, 199, 191, true);
141 checkNumberSequenceReverse(intDeque, 191, 199, false);
143 intDeque.swap(intDeque2);
145 checkNumberSequence(intDeque2, 191, 199, true);
146 checkNumberSequence(intDeque2, 199, 191, false);
147 checkNumberSequenceReverse(intDeque2, 199, 191, true);
148 checkNumberSequenceReverse(intDeque2, 191, 199, false);
151 class DestructCounter {
153 explicit DestructCounter(int i, int* destructNumber)
155 , m_destructNumber(destructNumber)
158 ~DestructCounter() { ++(*m_destructNumber); }
159 int get() const { return m_i; }
163 int* m_destructNumber;
166 typedef WTF::Deque<OwnPtr<DestructCounter> > OwnPtrDeque;
168 TEST(DequeTest, OwnPtr)
170 int destructNumber = 0;
172 deque.append(adoptPtr(new DestructCounter(0, &destructNumber)));
173 deque.append(adoptPtr(new DestructCounter(1, &destructNumber)));
174 EXPECT_EQ(2u, deque.size());
176 OwnPtr<DestructCounter>& counter0 = deque.first();
177 EXPECT_EQ(0, counter0->get());
178 int counter1 = deque.last()->get();
179 EXPECT_EQ(1, counter1);
180 EXPECT_EQ(0, destructNumber);
183 for (OwnPtrDeque::iterator iter = deque.begin(); iter != deque.end(); ++iter) {
184 OwnPtr<DestructCounter>& refCounter = *iter;
185 EXPECT_EQ(index, static_cast<size_t>(refCounter->get()));
186 EXPECT_EQ(index, static_cast<size_t>((*refCounter).get()));
189 EXPECT_EQ(0, destructNumber);
191 OwnPtrDeque::iterator it = deque.begin();
192 for (index = 0; index < deque.size(); ++index) {
193 OwnPtr<DestructCounter>& refCounter = *it;
194 EXPECT_EQ(index, static_cast<size_t>(refCounter->get()));
198 EXPECT_EQ(0, destructNumber);
200 EXPECT_EQ(0, deque.first()->get());
202 EXPECT_EQ(1, deque.first()->get());
203 EXPECT_EQ(1u, deque.size());
204 EXPECT_EQ(1, destructNumber);
206 OwnPtr<DestructCounter> ownCounter1 = deque.first().release();
208 EXPECT_EQ(counter1, ownCounter1->get());
209 EXPECT_EQ(0u, deque.size());
210 EXPECT_EQ(1, destructNumber);
213 EXPECT_EQ(2, destructNumber);
217 for (size_t i = 0; i < count; ++i)
218 deque.prepend(adoptPtr(new DestructCounter(i, &destructNumber)));
220 // Deque relocation must not destruct OwnPtr element.
221 EXPECT_EQ(0, destructNumber);
222 EXPECT_EQ(count, deque.size());
224 OwnPtrDeque copyDeque;
225 deque.swap(copyDeque);
226 EXPECT_EQ(0, destructNumber);
227 EXPECT_EQ(count, copyDeque.size());
228 EXPECT_EQ(0u, deque.size());
231 EXPECT_EQ(count, static_cast<size_t>(destructNumber));
234 // WrappedInt class will fail if it was memmoved or memcpyed.
235 static HashSet<void*> constructedWrappedInts;
238 WrappedInt(int i = 0)
239 : m_originalThisPtr(this)
242 constructedWrappedInts.add(this);
245 WrappedInt(const WrappedInt& other)
246 : m_originalThisPtr(this)
249 constructedWrappedInts.add(this);
252 WrappedInt& operator=(const WrappedInt& other)
260 EXPECT_EQ(m_originalThisPtr, this);
261 EXPECT_TRUE(constructedWrappedInts.contains(this));
262 constructedWrappedInts.remove(this);
265 int get() const { return m_i; }
268 void* m_originalThisPtr;
272 TEST(DequeTest, SwapWithoutInlineCapacity)
274 Deque<WrappedInt> dequeA;
275 dequeA.append(WrappedInt(1));
276 Deque<WrappedInt> dequeB;
277 dequeB.append(WrappedInt(2));
279 ASSERT_EQ(dequeA.size(), dequeB.size());
282 ASSERT_EQ(1u, dequeA.size());
283 EXPECT_EQ(2, dequeA.first().get());
284 ASSERT_EQ(1u, dequeB.size());
285 EXPECT_EQ(1, dequeB.first().get());
287 dequeA.append(WrappedInt(3));
289 ASSERT_GT(dequeA.size(), dequeB.size());
292 ASSERT_EQ(1u, dequeA.size());
293 EXPECT_EQ(1, dequeA.first().get());
294 ASSERT_EQ(2u, dequeB.size());
295 EXPECT_EQ(2, dequeB.first().get());
297 ASSERT_LT(dequeA.size(), dequeB.size());
300 ASSERT_EQ(2u, dequeA.size());
301 EXPECT_EQ(2, dequeA.first().get());
302 ASSERT_EQ(1u, dequeB.size());
303 EXPECT_EQ(1, dequeB.first().get());
305 dequeA.append(WrappedInt(4));
308 ASSERT_EQ(1u, dequeA.size());
309 EXPECT_EQ(1, dequeA.first().get());
310 ASSERT_EQ(3u, dequeB.size());
311 EXPECT_EQ(2, dequeB.first().get());