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 "wtf/TreeNode.h" | 26 #include "platform/wtf/TreeNode.h" |
27 | 27 |
| 28 #include "platform/wtf/PassRefPtr.h" |
| 29 #include "platform/wtf/RefCounted.h" |
| 30 #include "platform/wtf/RefPtr.h" |
28 #include "testing/gtest/include/gtest/gtest.h" | 31 #include "testing/gtest/include/gtest/gtest.h" |
29 #include "wtf/PassRefPtr.h" | |
30 #include "wtf/RefCounted.h" | |
31 #include "wtf/RefPtr.h" | |
32 | 32 |
33 namespace WTF { | 33 namespace WTF { |
34 | 34 |
35 class TestTree : public RefCounted<TestTree>, public TreeNode<TestTree> { | 35 class TestTree : public RefCounted<TestTree>, public TreeNode<TestTree> { |
36 public: | 36 public: |
37 static PassRefPtr<TestTree> create() { return adoptRef(new TestTree()); } | 37 static PassRefPtr<TestTree> create() { return adoptRef(new TestTree()); } |
38 }; | 38 }; |
39 | 39 |
40 TEST(TreeNodeTest, AppendChild) { | 40 TEST(TreeNodeTest, AppendChild) { |
41 RefPtr<TestTree> root = TestTree::create(); | 41 RefPtr<TestTree> root = TestTree::create(); |
(...skipping 164 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
206 trio.root.get()}; | 206 trio.root.get()}; |
207 | 207 |
208 unsigned orderIndex = 0; | 208 unsigned orderIndex = 0; |
209 for (TestTree *node = traverseFirstPostOrder(trio.root.get()); node; | 209 for (TestTree *node = traverseFirstPostOrder(trio.root.get()); node; |
210 node = traverseNextPostOrder(node), orderIndex++) | 210 node = traverseNextPostOrder(node), orderIndex++) |
211 EXPECT_EQ(node, order[orderIndex]); | 211 EXPECT_EQ(node, order[orderIndex]); |
212 EXPECT_EQ(orderIndex, sizeof(order) / sizeof(TestTree*)); | 212 EXPECT_EQ(orderIndex, sizeof(order) / sizeof(TestTree*)); |
213 } | 213 } |
214 | 214 |
215 } // namespace WTF | 215 } // namespace WTF |
OLD | NEW |