Skip to content
Snippets Groups Projects
Commit 9f7667fc authored by Praetorius, Simon's avatar Praetorius, Simon
Browse files

TreeDataTest adopted to renamed forEachNode

parent 074f8e52
No related branches found
No related tags found
No related merge requests found
......@@ -25,7 +25,7 @@ bool operator==(TreeData<Tree,NodeData,false> const& t1, TreeData<Tree,NodeData,
AMDIS_TEST(t1.tree() == t2.tree() && t1.tree() != nullptr);
bool same = true;
forEachNode(*t1.tree(), [&](auto const& node, auto) {
AMDiS::forEachNode_(*t1.tree(), [&](auto const& node, auto) {
same = same && (t1[node] == t2[node]);
});
......@@ -38,7 +38,7 @@ bool operator==(TreeData<Tree,NodeData,true> const& t1, TreeData<Tree,NodeData,t
AMDIS_TEST(t1.tree() == t2.tree() && t1.tree() != nullptr);
bool same = true;
forEachLeafNode(*t1.tree(), [&](auto const& node, auto) {
AMDiS::forEachLeafNode_(*t1.tree(), [&](auto const& node, auto) {
same = same && (t1[node] == t2[node]);
});
......@@ -73,7 +73,7 @@ int main ()
TreeData<Tree, NodeData, false> treeData;
treeData.init(tree);
forEachNode(tree, [&](auto const& node, auto) {
AMDiS::forEachNode_(tree, [&](auto const& node, auto) {
treeData[node] = double(node.treeIndex());
});
......@@ -109,7 +109,7 @@ int main ()
TreeData<Tree, NodeData, true> treeData;
treeData.init(tree);
forEachLeafNode(tree, [&](auto const& node, auto) {
AMDiS::forEachLeafNode_(tree, [&](auto const& node, auto) {
treeData[node] = double(node.treeIndex());
});
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment