multipers 2.3.3b6__cp310-cp310-macosx_11_0_arm64.whl

multipers/gudhi/gudhi/Points_off_io.h

@@ -0,0 +1,171 @@
+/*    This file is part of the Gudhi Library - https://gudhi.inria.fr/ - which is released under MIT.
+ *    See file LICENSE or go to https://gudhi.inria.fr/licensing/ for full license details.
+ *    Author(s):       Vincent Rouvreau
+ *
+ *    Copyright (C) 2015 Inria
+ *
+ *    Modification(s):
+ *      - YYYY/MM Author: Description of the modification
+ */
+#ifndef POINTS_OFF_IO_H_
+#define POINTS_OFF_IO_H_
+
+#include <gudhi/Off_reader.h>
+
+#include <string>
+#include <vector>
+#include <fstream>
+#include <map>
+
+namespace Gudhi {
+
+/** 
+ * \brief OFF file visitor implementation according to Off_reader in order to read points from an OFF file.
+ */
+template<typename Point_d>
+class Points_off_visitor_reader {
+ private:
+  std::vector<Point_d> point_cloud;
+
+ public:
+  /** \brief Off_reader visitor init implementation. 
+   * 
+   * The init parameters are set from OFF file header.
+   * Dimension value is required in order to construct a vector of points.
+   *
+   * @param[in] dim space dimension of vertices.
+   * @param[in] num_vertices number of vertices in the OFF file (not used).
+   * @param[in] num_faces number of faces in the OFF file (not used).
+   * @param[in] num_edges number of edges in the OFF file (not used).
+   */
+  void init(int dim, int num_vertices, int num_faces, int num_edges) {
+#ifdef DEBUG_TRACES
+    std::clog << "Points_off_visitor_reader::init - dim=" << dim << " - num_vertices=" <<
+        num_vertices << " - num_faces=" << num_faces << " - num_edges=" << num_edges << std::endl;
+#endif  // DEBUG_TRACES
+    if (num_faces > 0) {
+      std::cerr << "Points_off_visitor_reader::init faces are not taken into account from OFF file for Points.\n";
+    }
+    if (num_edges > 0) {
+      std::cerr << "Points_off_visitor_reader::init edges are not taken into account from OFF file for Points.\n";
+    }
+  }
+
+  /** @brief Off_reader visitor point implementation. 
+   * 
+   * The point function is called on each vertex line from OFF file.
+   * This function inserts the vertex in the vector of points.
+   *
+   * @param[in] point vector of vertex coordinates.
+   * 
+   * @details
+   * Point_d must have a constructor with the following form:
+   * 
+   * @code template<class InputIterator > Point_d::Point_d(InputIterator first, InputIterator last) @endcode
+   * 
+   */
+  void point(const std::vector<double>& point) {
+#ifdef DEBUG_TRACES
+    std::clog << "Points_off_visitor_reader::point ";
+    for (auto coordinate : point) {
+      std::clog << coordinate << " | ";
+    }
+    std::clog << std::endl;
+#endif  // DEBUG_TRACES
+    // Fill the point cloud
+    point_cloud.push_back(Point_d(point.begin(), point.end()));
+  }
+
+  // Off_reader visitor maximal_face implementation - Only points are read
+  void maximal_face(const std::vector<int>& face) { }
+
+  // Off_reader visitor done implementation - Only points are read
+  void done() { }
+
+  /** \brief Point cloud getter.
+   *
+   * @return point_cloud.
+   */
+  const std::vector<Point_d>& get_point_cloud() const {
+    return point_cloud;
+  }
+};
+
+/** 
+ * \brief OFF file reader implementation in order to read points from an OFF file.
+ * 
+ * This class is using the Points_off_visitor_reader to visit the OFF file according to Off_reader.
+ * 
+ * Point_d must have a constructor with the following form:
+ * 
+ * \code template<class InputIterator > Point_d::Point_d(int d, InputIterator first, InputIterator last) \endcode
+ * 
+ * where d is the point dimension. 		
+ * 
+ * \section pointoffioexample Example
+ *
+ * This example loads points from an OFF file and builds a vector of points (vector of double).
+ * Then, it is asked to display the points.
+ * 
+ * \include example_vector_double_points_off_reader.cpp
+ * 
+ * When launching:
+ * 
+ * \code $> ./vector_double_off_reader ../../data/points/alphacomplexdoc.off
+ * \endcode
+ *
+ * the program outputs a file ../../data/points/alphacomplexdoc.off.txt:
+ * 
+ * \include vectordoubleoffreader_result.txt
+ */
+template<typename Point_d>
+class Points_off_reader {
+ public:
+  /** \brief Reads the OFF file and constructs a vector of points from the points
+   * that are in the OFF file.
+   *
+   * @param[in] name_file OFF file to read.
+   * 
+   * \post Check with is_valid() function to see if read operation was successful.
+   */
+  Points_off_reader(const std::string& name_file)
+  : valid_(false) {
+    std::ifstream stream(name_file);
+    if (stream.is_open()) {
+      Off_reader off_reader(stream);
+      Points_off_visitor_reader<Point_d> off_visitor;
+      valid_ = off_reader.read(off_visitor);
+      if (valid_) {
+        point_cloud = off_visitor.get_point_cloud();
+      }
+    } else {
+      std::cerr << "Points_off_reader::Points_off_reader could not open file " << name_file << "\n";
+    }
+  }
+
+  /** \brief Returns if the OFF file read operation was successful or not.
+   *
+   * @return OFF file read status.
+   */
+  bool is_valid() const {
+    return valid_;
+  }
+
+   /** \brief Point cloud getter.
+   *
+   * @return point_cloud.
+   */
+  const std::vector<Point_d>& get_point_cloud() const {
+    return point_cloud;
+  }
+
+ private:
+  /** \brief point_cloud.*/
+  std::vector<Point_d> point_cloud;
+  /** \brief OFF file read status.*/
+  bool valid_;
+};
+
+}  // namespace Gudhi
+
+#endif  // POINTS_OFF_IO_H_

multipers/gudhi/gudhi/Simple_object_pool.h

@@ -0,0 +1,69 @@
+/*    This file is part of the Gudhi Library - https://gudhi.inria.fr/ - which is released under MIT.
+ *    See file LICENSE or go to https://gudhi.inria.fr/licensing/ for full license details.
+ *    Author(s):       Marc Glisse
+ *
+ *    Copyright (C) 2015 Inria
+ *
+ *    Modification(s):
+ *      - YYYY/MM Author: Description of the modification
+ */
+
+#ifndef SIMPLE_OBJECT_POOL_H_
+#define SIMPLE_OBJECT_POOL_H_
+
+#include <boost/pool/pool.hpp>
+#include <utility>
+
+namespace Gudhi {
+
+/** \private
+ * This is a simpler version of boost::object_pool, that requires
+ * that users explicitly destroy all objects. This lets the
+ * performance scale much better, see
+ * https://svn.boost.org/trac/boost/ticket/3789 .
+ */
+template <class T>
+class Simple_object_pool : protected boost::pool<boost::default_user_allocator_malloc_free> {
+ protected:
+  typedef boost::pool<boost::default_user_allocator_malloc_free> Base;
+  typedef T* pointer;
+
+  Base& base() {
+    return *this;
+  }
+
+  Base const& base()const {
+    return *this;
+  }
+
+ public:
+  typedef T element_type;
+  typedef boost::default_user_allocator_malloc_free user_allocator;
+  typedef typename Base::size_type size_type;
+  typedef typename Base::difference_type difference_type;
+
+  template<class...U>
+  Simple_object_pool(U&&...u) : Base(sizeof (T), std::forward<U>(u)...) { }
+
+  template<class...U>
+  pointer construct(U&&...u) {
+    void* p = base().malloc BOOST_PREVENT_MACRO_SUBSTITUTION();
+    assert(p);
+    try {
+      new(p) T(std::forward<U>(u)...);
+    }    catch (...) {
+      base().free BOOST_PREVENT_MACRO_SUBSTITUTION(p);
+      throw;
+    }
+    return static_cast<pointer> (p);
+  }
+
+  void destroy(pointer p) {
+    p->~T();
+    base().free BOOST_PREVENT_MACRO_SUBSTITUTION(p);
+  }
+};
+
+}  // namespace Gudhi
+
+#endif  // SIMPLE_OBJECT_POOL_H_

multipers/gudhi/gudhi/Simplex_tree/Simplex_tree_iterators.h

@@ -0,0 +1,463 @@
+/*    This file is part of the Gudhi Library - https://gudhi.inria.fr/ - which is released under MIT.
+ *    See file LICENSE or go to https://gudhi.inria.fr/licensing/ for full license details.
+ *    Author(s):       Clément Maria
+ *
+ *    Copyright (C) 2014 Inria
+ *
+ *    Modification(s):
+ *      - 2022/04 Vincent Rouvreau: Add Simplex_tree_boundary_opposite_vertex_simplex_iterator for alpha and cech purpose
+ *      - YYYY/MM Author: Description of the modification
+ */
+
+#ifndef SIMPLEX_TREE_SIMPLEX_TREE_ITERATORS_H_
+#define SIMPLEX_TREE_SIMPLEX_TREE_ITERATORS_H_
+
+#include <gudhi/Debug_utils.h>
+
+#include <boost/iterator/iterator_facade.hpp>
+
+#include <vector>
+#include <utility>  // for std::pair
+
+namespace Gudhi {
+
+/** \addtogroup simplex_tree 
+ * Iterators and range types for the Simplex_tree.
+ *  @{
+ */
+
+/** \brief Iterator over the vertices of a simplex
+ * in a SimplexTree.
+ *
+ * Forward iterator, 'value_type' is SimplexTree::Vertex_handle.*/
+template<class SimplexTree>
+class Simplex_tree_simplex_vertex_iterator : public boost::iterator_facade<
+    Simplex_tree_simplex_vertex_iterator<SimplexTree>,
+    typename SimplexTree::Vertex_handle const, boost::forward_traversal_tag,
+    typename SimplexTree::Vertex_handle const> {
+ public:
+  typedef typename SimplexTree::Simplex_handle Simplex_handle;
+  typedef typename SimplexTree::Siblings Siblings;
+  typedef typename SimplexTree::Vertex_handle Vertex_handle;
+
+  explicit Simplex_tree_simplex_vertex_iterator(SimplexTree const* st)
+      :  // any end() iterator
+        sib_(nullptr),
+        v_(st->null_vertex()) {
+  }
+
+  Simplex_tree_simplex_vertex_iterator(SimplexTree const* st, Simplex_handle sh)
+      : sib_(st->self_siblings(sh)),
+        v_(sh->first) {
+  }
+
+ private:
+  friend class boost::iterator_core_access;
+
+  bool equal(Simplex_tree_simplex_vertex_iterator const &other) const {
+    return sib_ == other.sib_ && v_ == other.v_;
+  }
+
+  Vertex_handle const& dereference() const {
+    return v_;
+  }
+
+  void increment() {
+    v_ = sib_->parent();
+    sib_ = sib_->oncles();
+  }
+
+  Siblings * sib_;
+  Vertex_handle v_;
+};
+
+/*---------------------------------------------------------------------------*/
+/** \brief Iterator over the simplices of the boundary of a
+ *  simplex.
+ *
+ * Forward iterator, value_type is SimplexTree::Simplex_handle.*/
+template<class SimplexTree>
+class Simplex_tree_boundary_simplex_iterator : public boost::iterator_facade<
+    Simplex_tree_boundary_simplex_iterator<SimplexTree>,
+    typename SimplexTree::Simplex_handle const, boost::forward_traversal_tag> {
+ public:
+  using Simplex_handle = typename SimplexTree::Simplex_handle;
+  using Vertex_handle = typename SimplexTree::Vertex_handle;
+  using Siblings = typename SimplexTree::Siblings;
+  using Static_vertex_vector = typename SimplexTree::Static_vertex_vector;
+
+  // For cython purpose only. The object it initializes should be overwritten ASAP and never used before it is overwritten.
+  Simplex_tree_boundary_simplex_iterator()
+      : sib_(nullptr),
+        st_(nullptr)  {
+  }
+
+// any end() iterator
+  explicit Simplex_tree_boundary_simplex_iterator(SimplexTree * st)
+      : last_(st->null_vertex()),
+        next_(st->null_vertex()),
+        sib_(nullptr),
+        sh_(st->null_simplex()),
+        st_(st)  {
+  }
+
+  template<class SimplexHandle>
+  Simplex_tree_boundary_simplex_iterator(SimplexTree * st, SimplexHandle sh)
+      : last_(sh->first),
+        next_(st->null_vertex()),
+        sib_(nullptr),
+        sh_(st->null_simplex()),
+        st_(st) {
+    // Only check once at the beginning instead of for every increment, as this is expensive.
+    if constexpr (SimplexTree::Options::contiguous_vertices)
+      GUDHI_CHECK(st_->contiguous_vertices(), "The set of vertices is not { 0, ..., n } without holes");
+    Siblings * sib = st->self_siblings(sh);
+    next_ = sib->parent();
+    sib_ = sib->oncles();
+    if (sib_ != nullptr) {
+      if constexpr (SimplexTree::Options::contiguous_vertices &&
+                    !SimplexTree::Options::stable_simplex_handles)
+      {
+        if (sib_->oncles() == nullptr)  // Only relevant for edges
+          sh_ = sib_->members_.begin() + next_;
+        else
+          sh_ = sib_->find(next_);
+      } else {
+        sh_ = sib_->find(next_);
+      }
+    }
+  }
+
+ private:
+  friend class boost::iterator_core_access;
+  // valid when iterating along the SAME boundary.
+  bool equal(Simplex_tree_boundary_simplex_iterator const& other) const {
+    return sh_ == other.sh_;
+  }
+
+  Simplex_handle const& dereference() const {
+    assert(sh_ != st_->null_simplex());
+    return sh_;
+  }
+
+  void increment() {
+    if (sib_ == nullptr) {
+      sh_ = st_->null_simplex();
+      return;
+    }
+
+    Siblings * for_sib = sib_;
+    Siblings * new_sib = sib_->oncles();
+    auto rit = suffix_.rbegin();
+    if constexpr (SimplexTree::Options::contiguous_vertices && !SimplexTree::Options::stable_simplex_handles) {
+      if (new_sib == nullptr) {
+        // We reached the root, use a short-cut to find a vertex.
+        if (rit == suffix_.rend()) {
+          // Segment, this vertex is the last boundary simplex
+          sh_ = for_sib->members_.begin() + last_;
+          sib_ = nullptr;
+          return;
+        } else {
+          // Dim >= 2, initial step of the descent
+          sh_ = for_sib->members_.begin() + *rit;
+          for_sib = sh_->second.children();
+          ++rit;
+        }
+      }
+    }
+
+    for (; rit != suffix_.rend(); ++rit) {
+      sh_ = for_sib->find(*rit);
+      for_sib = sh_->second.children();
+    }
+    sh_ = for_sib->find(last_);  // sh_ points to the right simplex now
+    suffix_.push_back(next_);
+    next_ = sib_->parent();
+    sib_ = new_sib;
+  }
+
+  // Most of the storage should be moved to the range, iterators should be light.
+  Vertex_handle last_;  // last vertex of the simplex
+  Vertex_handle next_;  // next vertex to push in suffix_
+  Static_vertex_vector suffix_;
+  Siblings * sib_;  // where the next search will start from
+  Simplex_handle sh_;  // current Simplex_handle in the boundary
+  SimplexTree * st_;  // simplex containing the simplicial complex
+};
+
+/** \brief Iterator over the simplices of the boundary of a simplex and their opposite vertices.
+ *
+ * Forward iterator, value_type is std::pair<SimplexTree::Simplex_handle, SimplexTree::Vertex_handle>.*/
+template<class SimplexTree>
+class Simplex_tree_boundary_opposite_vertex_simplex_iterator : public boost::iterator_facade<
+    Simplex_tree_boundary_opposite_vertex_simplex_iterator<SimplexTree>,
+    std::pair<typename SimplexTree::Simplex_handle, typename SimplexTree::Vertex_handle> const, boost::forward_traversal_tag> {
+ public:
+  using Simplex_handle = typename SimplexTree::Simplex_handle;
+  using Vertex_handle = typename SimplexTree::Vertex_handle;
+  using Siblings = typename SimplexTree::Siblings;
+  using Static_vertex_vector = typename SimplexTree::Static_vertex_vector;
+
+  // For cython purpose only. The object it initializes should be overwritten ASAP and never used before it is
+  // overwritten.
+  Simplex_tree_boundary_opposite_vertex_simplex_iterator()
+      : sib_(nullptr),
+        st_(nullptr)  {
+  }
+
+  // any end() iterator
+  explicit Simplex_tree_boundary_opposite_vertex_simplex_iterator(SimplexTree * st)
+      : last_(st->null_vertex()),
+        next_(st->null_vertex()),
+        sib_(nullptr),
+        baov_(st->null_simplex(), st->null_vertex()),
+        st_(st)  {
+  }
+
+  template<class SimplexHandle>
+  Simplex_tree_boundary_opposite_vertex_simplex_iterator(SimplexTree * st, SimplexHandle sh)
+      : last_(sh->first),
+        next_(st->null_vertex()),
+        sib_(nullptr),
+        baov_(st->null_simplex(), sh->first),
+        st_(st) {
+    // Only check once at the beginning instead of for every increment, as this is expensive.
+    if constexpr (SimplexTree::Options::contiguous_vertices)
+      GUDHI_CHECK(st_->contiguous_vertices(), "The set of vertices is not { 0, ..., n } without holes");
+    Siblings * sib = st->self_siblings(sh);
+    next_ = sib->parent();
+    sib_ = sib->oncles();
+    if (sib_ != nullptr) {
+      if constexpr (SimplexTree::Options::contiguous_vertices &&
+                    !SimplexTree::Options::stable_simplex_handles) {
+        if (sib_->oncles() == nullptr)
+          // Only relevant for edges
+          baov_.first = sib_->members_.begin() + next_;
+        else
+          baov_.first = sib_->find(next_);
+      } else {
+        baov_.first = sib_->find(next_);
+      }
+    }
+  }
+
+ private:
+  friend class boost::iterator_core_access;
+
+  // valid when iterating along the SAME boundary.
+  bool equal(Simplex_tree_boundary_opposite_vertex_simplex_iterator const& other) const {
+    return (baov_.first == other.baov_.first);
+  }
+
+  std::pair<Simplex_handle, Vertex_handle> const& dereference() const {
+   return baov_;
+  }
+
+  void increment() {
+    if (sib_ == nullptr) {
+      baov_.first = st_->null_simplex();
+      return;  // ------>>
+    }
+    Siblings * for_sib = sib_;
+    Siblings * new_sib = sib_->oncles();
+    auto rit = suffix_.rbegin();
+    if constexpr (SimplexTree::Options::contiguous_vertices && !SimplexTree::Options::stable_simplex_handles) {
+      if (new_sib == nullptr) {
+        // We reached the root, use a short-cut to find a vertex.
+        if (rit == suffix_.rend()) {
+          baov_.second = baov_.first->first;
+          // Segment, this vertex is the last boundary simplex
+          baov_.first = for_sib->members_.begin() + last_;
+          sib_ = nullptr;
+          return;
+        } else {
+          // Dim >= 2, initial step of the descent
+          baov_.first = for_sib->members_.begin() + *rit;
+          for_sib = baov_.first->second.children();
+          ++rit;
+        }
+      }
+    }
+
+    for (; rit != suffix_.rend(); ++rit) {
+      baov_.first = for_sib->find(*rit);
+      for_sib = baov_.first->second.children();
+    }
+    baov_.first = for_sib->find(last_);  // baov_.first points to the right simplex now
+    suffix_.push_back(next_);
+    next_ = sib_->parent();
+    sib_ = new_sib;
+    baov_.second = suffix_.back();
+  }
+
+  // Most of the storage should be moved to the range, iterators should be light.
+  Vertex_handle last_;  // last vertex of the simplex
+  Vertex_handle next_;  // next vertex to push in suffix_
+  Static_vertex_vector suffix_;
+  Siblings * sib_;  // where the next search will start from
+  std::pair<Simplex_handle, Vertex_handle> baov_;  // a pair containing the current Simplex_handle in the boundary and its opposite vertex
+  SimplexTree * st_;  // simplex containing the simplicial complex
+};
+
+/*---------------------------------------------------------------------------*/
+/** \brief Iterator over the simplices of a simplicial complex.
+ *
+ * Forward iterator, value_type is SimplexTree::Simplex_handle.*/
+template<class SimplexTree>
+class Simplex_tree_complex_simplex_iterator : public boost::iterator_facade<
+    Simplex_tree_complex_simplex_iterator<SimplexTree>,
+    typename SimplexTree::Simplex_handle const, boost::forward_traversal_tag> {
+ public:
+  typedef typename SimplexTree::Simplex_handle Simplex_handle;
+  typedef typename SimplexTree::Siblings Siblings;
+  typedef typename SimplexTree::Vertex_handle Vertex_handle;
+
+// any end() iterator
+  Simplex_tree_complex_simplex_iterator()
+      : sib_(nullptr),
+        st_(nullptr) {
+  }
+
+  explicit Simplex_tree_complex_simplex_iterator(SimplexTree * st)
+      : sib_(nullptr),
+        st_(st) {
+    if (st == nullptr || st->root() == nullptr || st->root()->members().empty()) {
+      st_ = nullptr;
+    } else {
+      sh_ = st->root()->members().begin();
+      sib_ = st->root();
+      while (st->has_children(sh_)) {
+        sib_ = sh_->second.children();
+        sh_ = sib_->members().begin();
+      }
+    }
+  }
+ private:
+  friend class boost::iterator_core_access;
+
+// valid when iterating along the SAME boundary.
+  bool equal(Simplex_tree_complex_simplex_iterator const& other) const {
+    if (other.st_ == nullptr) {
+      return (st_ == nullptr);
+    }
+    if (st_ == nullptr) {
+      return false;
+    }
+    return (&(sh_->second) == &(other.sh_->second));
+  }
+
+  Simplex_handle const& dereference() const {
+    return sh_;
+  }
+
+// Depth first traversal.
+  void increment() {
+    ++sh_;
+    if (sh_ == sib_->members().end()) {
+      if (sib_->oncles() == nullptr) {
+        st_ = nullptr;
+        return;
+      }  // reach the end
+      sh_ = sib_->oncles()->members().find(sib_->parent());
+      sib_ = sib_->oncles();
+      return;
+    }
+    while (st_->has_children(sh_)) {
+      sib_ = sh_->second.children();
+      sh_ = sib_->members().begin();
+    }
+  }
+
+  Simplex_handle sh_;
+  Siblings * sib_;
+  SimplexTree * st_;
+};
+
+/** \brief Iterator over the simplices of the skeleton of a given
+ * dimension of the simplicial complex.
+ *
+ * Forward iterator, value_type is SimplexTree::Simplex_handle.*/
+template<class SimplexTree>
+class Simplex_tree_skeleton_simplex_iterator : public boost::iterator_facade<
+    Simplex_tree_skeleton_simplex_iterator<SimplexTree>,
+    typename SimplexTree::Simplex_handle const, boost::forward_traversal_tag> {
+ public:
+  typedef typename SimplexTree::Simplex_handle Simplex_handle;
+  typedef typename SimplexTree::Siblings Siblings;
+  typedef typename SimplexTree::Vertex_handle Vertex_handle;
+
+// any end() iterator
+  Simplex_tree_skeleton_simplex_iterator()
+      : sib_(nullptr),
+        st_(nullptr),
+        dim_skel_(0),
+        curr_dim_(0) {
+  }
+
+  Simplex_tree_skeleton_simplex_iterator(SimplexTree * st, int dim_skel)
+      : sib_(nullptr),
+        st_(st),
+        dim_skel_(dim_skel),
+        curr_dim_(0) {
+    if (st == nullptr || st->root() == nullptr || st->root()->members().empty()) {
+      st_ = nullptr;
+    } else {
+      sh_ = st->root()->members().begin();
+      sib_ = st->root();
+      while (st->has_children(sh_) && curr_dim_ < dim_skel_) {
+        sib_ = sh_->second.children();
+        sh_ = sib_->members().begin();
+        ++curr_dim_;
+      }
+    }
+  }
+ private:
+  friend class boost::iterator_core_access;
+
+// valid when iterating along the SAME boundary.
+  bool equal(Simplex_tree_skeleton_simplex_iterator const& other) const {
+    if (other.st_ == nullptr) {
+      return (st_ == nullptr);
+    }
+    if (st_ == nullptr) {
+      return false;
+    }
+    return (&(sh_->second) == &(other.sh_->second));
+  }
+
+  Simplex_handle const& dereference() const {
+    return sh_;
+  }
+
+// Depth first traversal of the skeleton.
+  void increment() {
+    ++sh_;
+    if (sh_ == sib_->members().end()) {
+      if (sib_->oncles() == nullptr) {
+        st_ = nullptr;
+        return;
+      }  // reach the end
+      sh_ = sib_->oncles()->members().find(sib_->parent());
+      sib_ = sib_->oncles();
+      --curr_dim_;
+      return;
+    }
+    while (st_->has_children(sh_) && curr_dim_ < dim_skel_) {
+      sib_ = sh_->second.children();
+      sh_ = sib_->members().begin();
+      ++curr_dim_;
+    }
+  }
+
+  Simplex_handle sh_;
+  Siblings * sib_;
+  SimplexTree * st_;
+  int dim_skel_;
+  int curr_dim_;
+};
+
+/** @}*/  // end addtogroup simplex_tree
+
+}  // namespace Gudhi
+
+#endif  // SIMPLEX_TREE_SIMPLEX_TREE_ITERATORS_H_