187fc54596
Summary: We had functions for inserting/removing a specific child, but not for simply replacing the child set with another list. `YGNodeSetChildren()` will unhook child nodes from the parent that don't appear in the new set. We set the disconnected child node layouts to `YGLayout()` b/c that's what the rest of the code does. `YGTraversePreOrder()` walks the tree and calls a labmda for each node. We could very easily add a post-order traversal and the ability to stop traversal if we ever want, but for now this is an MVP. Reviewed By: Woody17 Differential Revision: D7360203 fbshipit-source-id: 32df8e1213ead03bc0a026ec4bf453bc799bb9ce
35 lines
877 B
C++
35 lines
877 B
C++
/**
|
|
* Copyright (c) 2014-present, Facebook, Inc.
|
|
*
|
|
* This source code is licensed under the MIT license found in the
|
|
* LICENSE file in the root directory of this source tree.
|
|
*/
|
|
|
|
#include <gtest/gtest.h>
|
|
#include <yoga/Yoga.h>
|
|
|
|
TEST(YogaTest, pre_order_traversal) {
|
|
YGNodeRef const root = YGNodeNew();
|
|
YGNodeRef const root_child0 = YGNodeNew();
|
|
YGNodeRef const root_child1 = YGNodeNew();
|
|
YGNodeRef const root_child0_child0 = YGNodeNew();
|
|
|
|
YGNodeSetChildren(root, {root_child0, root_child1});
|
|
YGNodeInsertChild(root_child0, root_child0_child0, 0);
|
|
|
|
std::vector<YGNodeRef> visited;
|
|
YGTraversePreOrder(root, [&visited](YGNodeRef node) {
|
|
visited.push_back(node);
|
|
});
|
|
|
|
const std::vector<YGNodeRef> expected = {
|
|
root,
|
|
root_child0,
|
|
root_child0_child0,
|
|
root_child1
|
|
};
|
|
ASSERT_EQ(visited, expected);
|
|
|
|
YGNodeFreeRecursive(root);
|
|
}
|