Remove non-const access to root node

Octree/include/CGAL/Octree.h

@@ -263,13 +263,6 @@ class Octree {
   /// \name Accessors
   /// @{
 
-  /*!
-   * \brief Provides read and write access to the root node, and by extension the rest of the tree
-   *
-   * \return a reference to the root node of the tree
-   */
-  Node &root() { return m_root; }
-
   /*!
    * \brief Provides read-only access to the root node, and by extension the rest of the tree
    *
@@ -464,6 +457,7 @@ class Octree {
 
 private: // functions :
 
+  // TODO: Could this method name be reduced to just "center" ?
   Point barycenter(const Node &node) const {
 
     // Determine the side length of this node

Octree/include/CGAL/Octree/IO.h

@@ -27,7 +27,8 @@ template<class PointRange,
 ostream &operator<<(ostream &os, const CGAL::Octree::Octree<PointRange, PointMap> &octree) {
 
   // Create a range of nodes
-  auto nodes = octree.template walk<CGAL::Octree::Walker::Preorder>();
+//  auto nodes = octree.template walk<CGAL::Octree::Walker::Preorder>();
+  auto nodes = octree.walk(CGAL::Octree::Walker::Preorder());
 
   // Iterate over the range and print each node
 //  for (auto &n : nodes) {

Octree/test/Octree/test_node.cpp

@@ -7,15 +7,5 @@ typedef CGAL::Octree::Node::Node<int> Node;
 
 int main(void) {
 
-  Node n{};
-
-  n.split();
-
-  std::cout << n;
-  for (int i = 0; i < 8; ++i) {
-    std::cout << n[i];
-  }
-
-
   return 0;
 }

Octree/test/Octree/test_octree_refine.cpp

@@ -29,7 +29,7 @@ void test_1_point() {
 
   // Check that the topology matches
   Octree::Node single_node{};
-  single_node.value() = octree.root().value();
+  single_node.points() = octree.root().points();
   assert(single_node == octree.root());
 
 }