multipers 2.2.3__cp311-cp311-win_amd64.whl → 2.3.0__cp311-cp311-win_amd64.whl

multipers/gudhi/gudhi/Simplex_tree/Simplex_tree_node_explicit_storage.h

@@ -1,83 +1,83 @@
-/*    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):
- *      - YYYY/MM Author: Description of the modification
- */
-
-#ifndef SIMPLEX_TREE_SIMPLEX_TREE_NODE_EXPLICIT_STORAGE_H_
-#define SIMPLEX_TREE_SIMPLEX_TREE_NODE_EXPLICIT_STORAGE_H_
-
-// Empty base optimization for MSVC - https://learn.microsoft.com/en-us/cpp/cpp/empty-bases
-#if _MSC_VER
- #define GUDHI_EMPTY_BASE_CLASS_OPTIMIZATION __declspec(empty_bases)
-#else
- #define GUDHI_EMPTY_BASE_CLASS_OPTIMIZATION
-#endif
-
-#include <boost/core/empty_value.hpp>
-
-namespace Gudhi {
-
-/** \addtogroup simplex_tree
- * Represents a node of a Simplex_tree.
- * @{
- */
-
-/** \brief Node of a simplex tree with filtration value
- * and simplex key.
- *
- * It stores explicitly its own filtration value and its own Simplex_key.
- */
-template <class SimplexTree>
-struct GUDHI_EMPTY_BASE_CLASS_OPTIMIZATION Simplex_tree_node_explicit_storage
-    : SimplexTree::Filtration_simplex_base,
-      SimplexTree::Key_simplex_base,
-      SimplexTree::Hooks_simplex_base,
-      boost::empty_value<typename SimplexTree::Simplex_data> {
-  typedef typename SimplexTree::Siblings Siblings;
-  typedef typename SimplexTree::Filtration_value Filtration_value;
-  typedef typename SimplexTree::Simplex_key Simplex_key;
-  typedef typename SimplexTree::Simplex_data Simplex_data;
-
-  // Simplex_tree_node_explicit_storage() : children_(nullptr) {}
-
-  // Simplex_tree_node_explicit_storage(Siblings* sib, const Filtration_value& filtration) : children_(sib)
-  // {
-  //   this->assign_filtration(filtration);
-  // }
-  Simplex_tree_node_explicit_storage(Siblings* sib = nullptr, const Filtration_value& filtration = Filtration_value())
-      : SimplexTree::Filtration_simplex_base(filtration), children_(sib)
-  {}
-
-  //will fail to compile when called with SimplexTree::Options::store_key is false.
-  Simplex_tree_node_explicit_storage(Siblings* sib, Filtration_value filtration, Simplex_key key)
-      : SimplexTree::Filtration_simplex_base(filtration), SimplexTree::Key_simplex_base(key), children_(sib)
-  {}
-
-  /*
-   * Assign children to the node
-   */
-  void assign_children(Siblings * children) {
-    children_ = children;
-  }
-
-  /* Careful -> children_ can be NULL*/
-  Siblings * children() {
-    return children_;
-  }
-
-  Simplex_data& data() { return boost::empty_value<Simplex_data>::get(); }
-
- private:
-  Siblings * children_;
-};
-
-/** @}*/  // end addtogroup simplex_tree
-
-}  // namespace Gudhi
-
-#endif  // SIMPLEX_TREE_SIMPLEX_TREE_NODE_EXPLICIT_STORAGE_H_
+/*    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):
+ *      - YYYY/MM Author: Description of the modification
+ */
+
+#ifndef SIMPLEX_TREE_SIMPLEX_TREE_NODE_EXPLICIT_STORAGE_H_
+#define SIMPLEX_TREE_SIMPLEX_TREE_NODE_EXPLICIT_STORAGE_H_
+
+// Empty base optimization for MSVC - https://learn.microsoft.com/en-us/cpp/cpp/empty-bases
+#if _MSC_VER
+ #define GUDHI_EMPTY_BASE_CLASS_OPTIMIZATION __declspec(empty_bases)
+#else
+ #define GUDHI_EMPTY_BASE_CLASS_OPTIMIZATION
+#endif
+
+#include <boost/core/empty_value.hpp>
+
+namespace Gudhi {
+
+/** \addtogroup simplex_tree
+ * Represents a node of a Simplex_tree.
+ * @{
+ */
+
+/** \brief Node of a simplex tree with filtration value
+ * and simplex key.
+ *
+ * It stores explicitly its own filtration value and its own Simplex_key.
+ */
+template <class SimplexTree>
+struct GUDHI_EMPTY_BASE_CLASS_OPTIMIZATION Simplex_tree_node_explicit_storage
+    : SimplexTree::Filtration_simplex_base,
+      SimplexTree::Key_simplex_base,
+      SimplexTree::Hooks_simplex_base,
+      boost::empty_value<typename SimplexTree::Simplex_data> {
+  typedef typename SimplexTree::Siblings Siblings;
+  typedef typename SimplexTree::Filtration_value Filtration_value;
+  typedef typename SimplexTree::Simplex_key Simplex_key;
+  typedef typename SimplexTree::Simplex_data Simplex_data;
+
+  // Simplex_tree_node_explicit_storage() : children_(nullptr) {}
+
+  // Simplex_tree_node_explicit_storage(Siblings* sib, const Filtration_value& filtration) : children_(sib)
+  // {
+  //   this->assign_filtration(filtration);
+  // }
+  Simplex_tree_node_explicit_storage(Siblings* sib = nullptr, const Filtration_value& filtration = Filtration_value())
+      : SimplexTree::Filtration_simplex_base(filtration), children_(sib)
+  {}
+
+  //will fail to compile when called with SimplexTree::Options::store_key is false.
+  Simplex_tree_node_explicit_storage(Siblings* sib, Filtration_value filtration, Simplex_key key)
+      : SimplexTree::Filtration_simplex_base(filtration), SimplexTree::Key_simplex_base(key), children_(sib)
+  {}
+
+  /*
+   * Assign children to the node
+   */
+  void assign_children(Siblings * children) {
+    children_ = children;
+  }
+
+  /* Careful -> children_ can be NULL*/
+  Siblings * children() {
+    return children_;
+  }
+
+  Simplex_data& data() { return boost::empty_value<Simplex_data>::get(); }
+
+ private:
+  Siblings * children_;
+};
+
+/** @}*/  // end addtogroup simplex_tree
+
+}  // namespace Gudhi
+
+#endif  // SIMPLEX_TREE_SIMPLEX_TREE_NODE_EXPLICIT_STORAGE_H_

multipers/gudhi/gudhi/Simplex_tree/Simplex_tree_siblings.h

@@ -1,106 +1,106 @@
-/*    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):
- *      - YYYY/MM Author: Description of the modification
- */
-
-#ifndef SIMPLEX_TREE_SIMPLEX_TREE_SIBLINGS_H_
-#define SIMPLEX_TREE_SIMPLEX_TREE_SIBLINGS_H_
-
-#include <gudhi/Simplex_tree/simplex_tree_options.h>
-#include <gudhi/Simplex_tree/Simplex_tree_node_explicit_storage.h>
-
-#include <boost/container/flat_map.hpp>
-
-namespace Gudhi {
-
-/** \addtogroup simplex_tree
- * Represents a set of node of a Simplex_tree that share the same parent.
- * @{
- */
-
-/** \brief Data structure to store a set of nodes in a SimplexTree sharing
- * the same parent node.*/
-template<class SimplexTree, class MapContainer>
-class Simplex_tree_siblings {
-// private:
-//  friend SimplexTree;
- public:
-  template<class T> friend class Simplex_tree_simplex_vertex_iterator;
-  template<class T> friend class Simplex_tree_boundary_simplex_iterator;
-  template<class T> friend class Simplex_tree_complex_simplex_iterator;
-  template<class T> friend class Simplex_tree_skeleton_simplex_iterator;
-  template<class T> friend class Simplex_tree_boundary_opposite_vertex_simplex_iterator;
-
-  typedef typename SimplexTree::Vertex_handle Vertex_handle;
-  typedef typename SimplexTree::Filtration_value Filtration_value;
-  typedef typename SimplexTree::Node Node;
-  typedef MapContainer Dictionary;
-  typedef typename MapContainer::iterator Dictionary_it;
-
-  /* Default constructor.*/
-  Simplex_tree_siblings()
-      : oncles_(nullptr),
-        parent_(-1),
-        members_() {
-  }
-
-  /* Constructor with values.*/
-  Simplex_tree_siblings(Simplex_tree_siblings * oncles, Vertex_handle parent)
-      : oncles_(oncles),
-        parent_(parent),
-        members_() {
-  }
-
-  /** \brief Constructor with initialized set of members.
-   *
-   * 'members' must be sorted and unique.*/
-  template<typename RandomAccessVertexRange>
-  Simplex_tree_siblings(Simplex_tree_siblings * oncles, Vertex_handle parent, const RandomAccessVertexRange & members)
-      : oncles_(oncles),
-        parent_(parent),
-        members_(boost::container::ordered_unique_range, members.begin(),
-                 members.end()) {
-    for (auto& map_el : members_) {
-      map_el.second.assign_children(this);
-    }
-  }
-
-  Dictionary_it find(Vertex_handle v) {
-    return members_.find(v);
-  }
-
-  Simplex_tree_siblings * oncles() {
-    return oncles_;
-  }
-
-  Vertex_handle parent() const {
-    return parent_;
-  }
-
-  Dictionary & members() {
-    return members_;
-  }
-
-  size_t size() const {
-    return members_.size();
-  }
-
-  void erase(const Dictionary_it iterator) {
-    members_.erase(iterator);
-  }
-
-  Simplex_tree_siblings * oncles_;
-  Vertex_handle parent_;
-  Dictionary members_;
-};
-
-/** @}*/  // end addtogroup simplex_tree
-
-}  // namespace Gudhi
-
-#endif  // SIMPLEX_TREE_SIMPLEX_TREE_SIBLINGS_H_
+/*    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):
+ *      - YYYY/MM Author: Description of the modification
+ */
+
+#ifndef SIMPLEX_TREE_SIMPLEX_TREE_SIBLINGS_H_
+#define SIMPLEX_TREE_SIMPLEX_TREE_SIBLINGS_H_
+
+#include <gudhi/Simplex_tree/simplex_tree_options.h>
+#include <gudhi/Simplex_tree/Simplex_tree_node_explicit_storage.h>
+
+#include <boost/container/flat_map.hpp>
+
+namespace Gudhi {
+
+/** \addtogroup simplex_tree
+ * Represents a set of node of a Simplex_tree that share the same parent.
+ * @{
+ */
+
+/** \brief Data structure to store a set of nodes in a SimplexTree sharing
+ * the same parent node.*/
+template<class SimplexTree, class MapContainer>
+class Simplex_tree_siblings {
+// private:
+//  friend SimplexTree;
+ public:
+  template<class T> friend class Simplex_tree_simplex_vertex_iterator;
+  template<class T> friend class Simplex_tree_boundary_simplex_iterator;
+  template<class T> friend class Simplex_tree_complex_simplex_iterator;
+  template<class T> friend class Simplex_tree_skeleton_simplex_iterator;
+  template<class T> friend class Simplex_tree_boundary_opposite_vertex_simplex_iterator;
+
+  typedef typename SimplexTree::Vertex_handle Vertex_handle;
+  typedef typename SimplexTree::Filtration_value Filtration_value;
+  typedef typename SimplexTree::Node Node;
+  typedef MapContainer Dictionary;
+  typedef typename MapContainer::iterator Dictionary_it;
+
+  /* Default constructor.*/
+  Simplex_tree_siblings()
+      : oncles_(nullptr),
+        parent_(-1),
+        members_() {
+  }
+
+  /* Constructor with values.*/
+  Simplex_tree_siblings(Simplex_tree_siblings * oncles, Vertex_handle parent)
+      : oncles_(oncles),
+        parent_(parent),
+        members_() {
+  }
+
+  /** \brief Constructor with initialized set of members.
+   *
+   * 'members' must be sorted and unique.*/
+  template<typename RandomAccessVertexRange>
+  Simplex_tree_siblings(Simplex_tree_siblings * oncles, Vertex_handle parent, const RandomAccessVertexRange & members)
+      : oncles_(oncles),
+        parent_(parent),
+        members_(boost::container::ordered_unique_range, members.begin(),
+                 members.end()) {
+    for (auto& map_el : members_) {
+      map_el.second.assign_children(this);
+    }
+  }
+
+  Dictionary_it find(Vertex_handle v) {
+    return members_.find(v);
+  }
+
+  Simplex_tree_siblings * oncles() {
+    return oncles_;
+  }
+
+  Vertex_handle parent() const {
+    return parent_;
+  }
+
+  Dictionary & members() {
+    return members_;
+  }
+
+  size_t size() const {
+    return members_.size();
+  }
+
+  void erase(const Dictionary_it iterator) {
+    members_.erase(iterator);
+  }
+
+  Simplex_tree_siblings * oncles_;
+  Vertex_handle parent_;
+  Dictionary members_;
+};
+
+/** @}*/  // end addtogroup simplex_tree
+
+}  // namespace Gudhi
+
+#endif  // SIMPLEX_TREE_SIMPLEX_TREE_SIBLINGS_H_