| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2011 Apple Inc. All rights reserved. | 2 * Copyright (C) 2011 Apple Inc. All rights reserved. |
| 3 * | 3 * |
| 4 * Redistribution and use in source and binary forms, with or without | 4 * Redistribution and use in source and binary forms, with or without |
| 5 * modification, are permitted provided that the following conditions | 5 * modification, are permitted provided that the following conditions |
| 6 * are met: | 6 * are met: |
| 7 * 1. Redistributions of source code must retain the above copyright | 7 * 1. Redistributions of source code must retain the above copyright |
| 8 * notice, this list of conditions and the following disclaimer. | 8 * notice, this list of conditions and the following disclaimer. |
| 9 * 2. Redistributions in binary form must reproduce the above copyright | 9 * 2. Redistributions in binary form must reproduce the above copyright |
| 10 * notice, this list of conditions and the following disclaimer in the | 10 * notice, this list of conditions and the following disclaimer in the |
| 11 * documentation and/or other materials provided with the distribution. | 11 * documentation and/or other materials provided with the distribution. |
| 12 * | 12 * |
| 13 * THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS'' | 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, | 14 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, |
| 15 * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | 15 * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR |
| 16 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS | 16 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS |
| 17 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR | 17 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
| 18 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF | 18 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
| 19 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS | 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 | 20 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
| 21 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | 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 | 22 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF |
| 23 * THE POSSIBILITY OF SUCH DAMAGE. | 23 * THE POSSIBILITY OF SUCH DAMAGE. |
| 24 */ | 24 */ |
| 25 | 25 |
| 26 #include "config.h" | 26 #include "config.h" |
| 27 | |
| 28 #include "wtf/Deque.h" | 27 #include "wtf/Deque.h" |
| 29 | 28 |
| 30 #include "wtf/HashSet.h" | 29 #include "wtf/HashSet.h" |
| 31 #include "wtf/OwnPtr.h" | 30 #include "wtf/OwnPtr.h" |
| 32 #include "wtf/PassOwnPtr.h" | 31 #include "wtf/PassOwnPtr.h" |
| 33 #include <gtest/gtest.h> | 32 #include <gtest/gtest.h> |
| 34 | 33 |
| 34 namespace WTF { |
| 35 |
| 35 namespace { | 36 namespace { |
| 36 | 37 |
| 37 TEST(DequeTest, Basic) | 38 TEST(DequeTest, Basic) |
| 38 { | 39 { |
| 39 Deque<int> intDeque; | 40 Deque<int> intDeque; |
| 40 EXPECT_TRUE(intDeque.isEmpty()); | 41 EXPECT_TRUE(intDeque.isEmpty()); |
| 41 EXPECT_EQ(0ul, intDeque.size()); | 42 EXPECT_EQ(0ul, intDeque.size()); |
| 42 } | 43 } |
| 43 | 44 |
| 44 void checkNumberSequence(Deque<int>& deque, int from, int to, bool increment) | 45 void checkNumberSequence(Deque<int>& deque, int from, int to, bool increment) |
| (...skipping 111 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 156 { } | 157 { } |
| 157 | 158 |
| 158 ~DestructCounter() { ++(*m_destructNumber); } | 159 ~DestructCounter() { ++(*m_destructNumber); } |
| 159 int get() const { return m_i; } | 160 int get() const { return m_i; } |
| 160 | 161 |
| 161 private: | 162 private: |
| 162 int m_i; | 163 int m_i; |
| 163 int* m_destructNumber; | 164 int* m_destructNumber; |
| 164 }; | 165 }; |
| 165 | 166 |
| 166 typedef WTF::Deque<OwnPtr<DestructCounter>> OwnPtrDeque; | 167 using OwnPtrDeque = Deque<OwnPtr<DestructCounter>>; |
| 167 | 168 |
| 168 TEST(DequeTest, OwnPtr) | 169 TEST(DequeTest, OwnPtr) |
| 169 { | 170 { |
| 170 int destructNumber = 0; | 171 int destructNumber = 0; |
| 171 OwnPtrDeque deque; | 172 OwnPtrDeque deque; |
| 172 deque.append(adoptPtr(new DestructCounter(0, &destructNumber))); | 173 deque.append(adoptPtr(new DestructCounter(0, &destructNumber))); |
| 173 deque.append(adoptPtr(new DestructCounter(1, &destructNumber))); | 174 deque.append(adoptPtr(new DestructCounter(1, &destructNumber))); |
| 174 EXPECT_EQ(2u, deque.size()); | 175 EXPECT_EQ(2u, deque.size()); |
| 175 | 176 |
| 176 OwnPtr<DestructCounter>& counter0 = deque.first(); | 177 OwnPtr<DestructCounter>& counter0 = deque.first(); |
| (...skipping 48 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 225 deque.swap(copyDeque); | 226 deque.swap(copyDeque); |
| 226 EXPECT_EQ(0, destructNumber); | 227 EXPECT_EQ(0, destructNumber); |
| 227 EXPECT_EQ(count, copyDeque.size()); | 228 EXPECT_EQ(count, copyDeque.size()); |
| 228 EXPECT_EQ(0u, deque.size()); | 229 EXPECT_EQ(0u, deque.size()); |
| 229 | 230 |
| 230 copyDeque.clear(); | 231 copyDeque.clear(); |
| 231 EXPECT_EQ(count, static_cast<size_t>(destructNumber)); | 232 EXPECT_EQ(count, static_cast<size_t>(destructNumber)); |
| 232 } | 233 } |
| 233 | 234 |
| 234 // WrappedInt class will fail if it was memmoved or memcpyed. | 235 // WrappedInt class will fail if it was memmoved or memcpyed. |
| 235 static HashSet<void*> constructedWrappedInts; | 236 HashSet<void*> constructedWrappedInts; |
| 237 |
| 236 class WrappedInt { | 238 class WrappedInt { |
| 237 public: | 239 public: |
| 238 WrappedInt(int i = 0) | 240 WrappedInt(int i = 0) |
| 239 : m_originalThisPtr(this) | 241 : m_originalThisPtr(this) |
| 240 , m_i(i) | 242 , m_i(i) |
| 241 { | 243 { |
| 242 constructedWrappedInts.add(this); | 244 constructedWrappedInts.add(this); |
| 243 } | 245 } |
| 244 | 246 |
| 245 WrappedInt(const WrappedInt& other) | 247 WrappedInt(const WrappedInt& other) |
| (...skipping 60 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 306 dequeA.swap(dequeB); | 308 dequeA.swap(dequeB); |
| 307 | 309 |
| 308 ASSERT_EQ(1u, dequeA.size()); | 310 ASSERT_EQ(1u, dequeA.size()); |
| 309 EXPECT_EQ(1, dequeA.first().get()); | 311 EXPECT_EQ(1, dequeA.first().get()); |
| 310 ASSERT_EQ(3u, dequeB.size()); | 312 ASSERT_EQ(3u, dequeB.size()); |
| 311 EXPECT_EQ(2, dequeB.first().get()); | 313 EXPECT_EQ(2, dequeB.first().get()); |
| 312 | 314 |
| 313 dequeB.swap(dequeA); | 315 dequeB.swap(dequeA); |
| 314 } | 316 } |
| 315 | 317 |
| 316 } // namespace | 318 } // anonymous namespace |
| 319 |
| 320 } // namespace WTF |
| OLD | NEW |