Lines Matching refs:tree
144 WidgetTree tree("tree"); in TEST() local
145 tree.ConstructFromDom(dom, false); in TEST()
149 tree.DfsTraverse(visitor); in TEST()
167 WidgetTree tree("tree"); in TEST() local
168 tree.ConstructFromDom(dom, false); in TEST()
170 tree.DfsTraverse(visitor); in TEST()
181 WidgetTree tree("tree"); in TEST() local
182 tree.ConstructFromDom(dom, false); in TEST()
184 tree.DfsTraverse(visitor); in TEST()
186 auto rootPtr = tree.GetRootWidget(); in TEST()
188 ASSERT_EQ(nullptr, tree.GetParentWidget(*rootPtr)) << "Root node should have no parent"; in TEST()
191 auto child1Ptr = tree.GetChildWidget(*rootPtr, 1); in TEST()
195 ASSERT_TRUE(tree.GetChildWidget(*rootPtr, 2) == nullptr) << "Unexpected child not"; in TEST()
201 WidgetTree tree("tree"); in TEST() local
202 tree.ConstructFromDom(dom, false); in TEST()
204 auto rootPtr = tree.GetRootWidget(); in TEST()
206 ASSERT_EQ(nullptr, tree.GetParentWidget(*rootPtr)) << "Root node should have no parent"; in TEST()
208 auto child0Ptr = tree.GetChildWidget(*rootPtr, 0); in TEST()
212 tree.DfsTraverseDescendants(attrVisitor, *child0Ptr); in TEST()
220 WidgetTree tree("tree"); in TEST() local
221 tree.ConstructFromDom(dom, false); in TEST()
223 auto rootPtr = tree.GetRootWidget(); in TEST()
225 ASSERT_EQ(nullptr, tree.GetParentWidget(*rootPtr)) << "Root node should have no parent"; in TEST()
227 auto child1Ptr = tree.GetChildWidget(*rootPtr, 1); in TEST()
231 tree.DfsTraverseFronts(attrVisitor, *child1Ptr); in TEST()
239 WidgetTree tree("tree"); in TEST() local
240 tree.ConstructFromDom(dom, false); in TEST()
242 auto rootPtr = tree.GetRootWidget(); in TEST()
244 ASSERT_EQ(nullptr, tree.GetParentWidget(*rootPtr)) << "Root node should have no parent"; in TEST()
246 auto child0Ptr = tree.GetChildWidget(*rootPtr, 0); in TEST()
250 tree.DfsTraverseRears(attrVisitor, *child0Ptr); in TEST()
281 WidgetTree tree("tree"); in TEST() local
282 tree.ConstructFromDom(dom, true); // enable bounds amending in TEST()
284 tree.DfsTraverse(attrVisitor); in TEST()
288 tree.DfsTraverse(boundsVisitor); in TEST()
306 WidgetTree tree("tree"); in TEST() local
307 tree.ConstructFromDom(dom, false); in TEST()
309 tree.MarshalIntoDom(dom1); in TEST()
316 WidgetTree tree(""); in CheckMergedTree() local
323 WidgetTree::MergeTrees(subTrees, tree); in CheckMergedTree()
327 tree.DfsTraverse(visitor); in CheckMergedTree()
336 tree.DfsTraverse(visitor); in CheckMergedTree()