TreeDataTest adopted to renamed forEachNode

test/TreeDataTest.cpp

@@ -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());
     });