TestTree 37 Source/wtf/TreeNodeTest.cpp class TestTree : public RefCounted<TestTree>, public TreeNode<TestTree> { TestTree 39 Source/wtf/TreeNodeTest.cpp static PassRefPtr<TestTree> create() { return adoptRef(new TestTree()); } TestTree 44 Source/wtf/TreeNodeTest.cpp RefPtr<TestTree> root = TestTree::create(); TestTree 45 Source/wtf/TreeNodeTest.cpp RefPtr<TestTree> firstChild = TestTree::create(); TestTree 46 Source/wtf/TreeNodeTest.cpp RefPtr<TestTree> lastChild = TestTree::create(); TestTree 63 Source/wtf/TreeNodeTest.cpp RefPtr<TestTree> root = TestTree::create(); TestTree 64 Source/wtf/TreeNodeTest.cpp RefPtr<TestTree> firstChild = TestTree::create(); TestTree 65 Source/wtf/TreeNodeTest.cpp RefPtr<TestTree> middleChild = TestTree::create(); TestTree 66 Source/wtf/TreeNodeTest.cpp RefPtr<TestTree> lastChild = TestTree::create(); TestTree 96 Source/wtf/TreeNodeTest.cpp RefPtr<TestTree> root = TestTree::create(); TestTree 97 Source/wtf/TreeNodeTest.cpp RefPtr<TestTree> child = TestTree::create(); TestTree 98 Source/wtf/TreeNodeTest.cpp RefPtr<TestTree> nullNode; TestTree 112 Source/wtf/TreeNodeTest.cpp : root(TestTree::create()) TestTree 113 Source/wtf/TreeNodeTest.cpp , firstChild(TestTree::create()) TestTree 114 Source/wtf/TreeNodeTest.cpp , middleChild(TestTree::create()) TestTree 115 Source/wtf/TreeNodeTest.cpp , lastChild(TestTree::create()) TestTree 126 Source/wtf/TreeNodeTest.cpp RefPtr<TestTree> root; TestTree 127 Source/wtf/TreeNodeTest.cpp RefPtr<TestTree> firstChild; TestTree 128 Source/wtf/TreeNodeTest.cpp RefPtr<TestTree> middleChild; TestTree 129 Source/wtf/TreeNodeTest.cpp RefPtr<TestTree> lastChild; TestTree 147 Source/wtf/TreeNodeTest.cpp RefPtr<TestTree> nullNode; TestTree 160 Source/wtf/TreeNodeTest.cpp RefPtr<TestTree> nullNode; TestTree 174 Source/wtf/TreeNodeTest.cpp : grandChild(TestTree::create()) TestTree 184 Source/wtf/TreeNodeTest.cpp RefPtr<TestTree> grandChild; TestTree 192 Source/wtf/TreeNodeTest.cpp TestTree* order[] = { TestTree 198 Source/wtf/TreeNodeTest.cpp for (TestTree* node = trio.root.get(); node; node = traverseNext(node), orderIndex++) TestTree 200 Source/wtf/TreeNodeTest.cpp ASSERT_EQ(orderIndex, sizeof(order) / sizeof(TestTree*)); TestTree 209 Source/wtf/TreeNodeTest.cpp TestTree* order[] = { TestTree 215 Source/wtf/TreeNodeTest.cpp for (TestTree* node = traverseFirstPostOrder(trio.root.get()); node; node = traverseNextPostOrder(node), orderIndex++) TestTree 217 Source/wtf/TreeNodeTest.cpp ASSERT_EQ(orderIndex, sizeof(order) / sizeof(TestTree*));