| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2012 Apple Inc. All rights reserved. | 2 * Copyright (C) 2012 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/TreeNode.h" | 27 #include "wtf/TreeNode.h" |
| 29 | 28 |
| 30 #include "wtf/PassRefPtr.h" | 29 #include "wtf/PassRefPtr.h" |
| 31 #include "wtf/RefCounted.h" | 30 #include "wtf/RefCounted.h" |
| 32 #include "wtf/RefPtr.h" | 31 #include "wtf/RefPtr.h" |
| 33 #include <gtest/gtest.h> | 32 #include <gtest/gtest.h> |
| 34 | 33 |
| 35 namespace { | 34 namespace WTF { |
| 36 | 35 |
| 37 class TestTree : public RefCounted<TestTree>, public TreeNode<TestTree> { | 36 class TestTree : public RefCounted<TestTree>, public TreeNode<TestTree> { |
| 38 public: | 37 public: |
| 39 static PassRefPtr<TestTree> create() { return adoptRef(new TestTree()); } | 38 static PassRefPtr<TestTree> create() { return adoptRef(new TestTree()); } |
| 40 }; | 39 }; |
| 41 | 40 |
| 42 TEST(TreeNodeTest, AppendChild) | 41 TEST(TreeNodeTest, AppendChild) |
| 43 { | 42 { |
| 44 RefPtr<TestTree> root = TestTree::create(); | 43 RefPtr<TestTree> root = TestTree::create(); |
| 45 RefPtr<TestTree> firstChild = TestTree::create(); | 44 RefPtr<TestTree> firstChild = TestTree::create(); |
| (...skipping 180 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 226 trio.grandChild.get(), trio.middleChild.get(), trio.lastChild.get(), tri
o.root.get() | 225 trio.grandChild.get(), trio.middleChild.get(), trio.lastChild.get(), tri
o.root.get() |
| 227 }; | 226 }; |
| 228 | 227 |
| 229 unsigned orderIndex = 0; | 228 unsigned orderIndex = 0; |
| 230 for (TestTree* node = traverseFirstPostOrder(trio.root.get()); node; node =
traverseNextPostOrder(node), orderIndex++) | 229 for (TestTree* node = traverseFirstPostOrder(trio.root.get()); node; node =
traverseNextPostOrder(node), orderIndex++) |
| 231 EXPECT_EQ(node, order[orderIndex]); | 230 EXPECT_EQ(node, order[orderIndex]); |
| 232 EXPECT_EQ(orderIndex, sizeof(order) / sizeof(TestTree*)); | 231 EXPECT_EQ(orderIndex, sizeof(order) / sizeof(TestTree*)); |
| 233 | 232 |
| 234 } | 233 } |
| 235 | 234 |
| 236 | 235 } // namespace WTF |
| 237 } // namespace | |
| OLD | NEW |