multipers 2.2.3__cp310-cp310-win_amd64.whl → 2.3.0__cp310-cp310-win_amd64.whl

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Potentially problematic release.


This version of multipers might be problematic. Click here for more details.

Files changed (182) hide show
  1. multipers/__init__.py +33 -31
  2. multipers/_signed_measure_meta.py +430 -430
  3. multipers/_slicer_meta.py +211 -212
  4. multipers/data/MOL2.py +458 -458
  5. multipers/data/UCR.py +18 -18
  6. multipers/data/graphs.py +466 -466
  7. multipers/data/immuno_regions.py +27 -27
  8. multipers/data/pytorch2simplextree.py +90 -90
  9. multipers/data/shape3d.py +101 -101
  10. multipers/data/synthetic.py +113 -111
  11. multipers/distances.py +198 -198
  12. multipers/filtration_conversions.pxd.tp +84 -84
  13. multipers/filtrations/__init__.py +18 -0
  14. multipers/filtrations/filtrations.py +289 -0
  15. multipers/filtrations.pxd +224 -224
  16. multipers/function_rips.cp310-win_amd64.pyd +0 -0
  17. multipers/function_rips.pyx +105 -105
  18. multipers/grids.cp310-win_amd64.pyd +0 -0
  19. multipers/grids.pyx +350 -350
  20. multipers/gudhi/Persistence_slices_interface.h +132 -132
  21. multipers/gudhi/Simplex_tree_interface.h +239 -245
  22. multipers/gudhi/Simplex_tree_multi_interface.h +516 -561
  23. multipers/gudhi/cubical_to_boundary.h +59 -59
  24. multipers/gudhi/gudhi/Bitmap_cubical_complex.h +450 -450
  25. multipers/gudhi/gudhi/Bitmap_cubical_complex_base.h +1070 -1070
  26. multipers/gudhi/gudhi/Bitmap_cubical_complex_periodic_boundary_conditions_base.h +579 -579
  27. multipers/gudhi/gudhi/Debug_utils.h +45 -45
  28. multipers/gudhi/gudhi/Fields/Multi_field.h +484 -484
  29. multipers/gudhi/gudhi/Fields/Multi_field_operators.h +455 -455
  30. multipers/gudhi/gudhi/Fields/Multi_field_shared.h +450 -450
  31. multipers/gudhi/gudhi/Fields/Multi_field_small.h +531 -531
  32. multipers/gudhi/gudhi/Fields/Multi_field_small_operators.h +507 -507
  33. multipers/gudhi/gudhi/Fields/Multi_field_small_shared.h +531 -531
  34. multipers/gudhi/gudhi/Fields/Z2_field.h +355 -355
  35. multipers/gudhi/gudhi/Fields/Z2_field_operators.h +376 -376
  36. multipers/gudhi/gudhi/Fields/Zp_field.h +420 -420
  37. multipers/gudhi/gudhi/Fields/Zp_field_operators.h +400 -400
  38. multipers/gudhi/gudhi/Fields/Zp_field_shared.h +418 -418
  39. multipers/gudhi/gudhi/Flag_complex_edge_collapser.h +337 -337
  40. multipers/gudhi/gudhi/Matrix.h +2107 -2107
  41. multipers/gudhi/gudhi/Multi_critical_filtration.h +1038 -1038
  42. multipers/gudhi/gudhi/Multi_persistence/Box.h +171 -171
  43. multipers/gudhi/gudhi/Multi_persistence/Line.h +282 -282
  44. multipers/gudhi/gudhi/Off_reader.h +173 -173
  45. multipers/gudhi/gudhi/One_critical_filtration.h +1432 -1431
  46. multipers/gudhi/gudhi/Persistence_matrix/Base_matrix.h +769 -769
  47. multipers/gudhi/gudhi/Persistence_matrix/Base_matrix_with_column_compression.h +686 -686
  48. multipers/gudhi/gudhi/Persistence_matrix/Boundary_matrix.h +842 -842
  49. multipers/gudhi/gudhi/Persistence_matrix/Chain_matrix.h +1350 -1350
  50. multipers/gudhi/gudhi/Persistence_matrix/Id_to_index_overlay.h +1105 -1105
  51. multipers/gudhi/gudhi/Persistence_matrix/Position_to_index_overlay.h +859 -859
  52. multipers/gudhi/gudhi/Persistence_matrix/RU_matrix.h +910 -910
  53. multipers/gudhi/gudhi/Persistence_matrix/allocators/entry_constructors.h +139 -139
  54. multipers/gudhi/gudhi/Persistence_matrix/base_pairing.h +230 -230
  55. multipers/gudhi/gudhi/Persistence_matrix/base_swap.h +211 -211
  56. multipers/gudhi/gudhi/Persistence_matrix/boundary_cell_position_to_id_mapper.h +60 -60
  57. multipers/gudhi/gudhi/Persistence_matrix/boundary_face_position_to_id_mapper.h +60 -60
  58. multipers/gudhi/gudhi/Persistence_matrix/chain_pairing.h +136 -136
  59. multipers/gudhi/gudhi/Persistence_matrix/chain_rep_cycles.h +190 -190
  60. multipers/gudhi/gudhi/Persistence_matrix/chain_vine_swap.h +616 -616
  61. multipers/gudhi/gudhi/Persistence_matrix/columns/chain_column_extra_properties.h +150 -150
  62. multipers/gudhi/gudhi/Persistence_matrix/columns/column_dimension_holder.h +106 -106
  63. multipers/gudhi/gudhi/Persistence_matrix/columns/column_utilities.h +219 -219
  64. multipers/gudhi/gudhi/Persistence_matrix/columns/entry_types.h +327 -327
  65. multipers/gudhi/gudhi/Persistence_matrix/columns/heap_column.h +1140 -1140
  66. multipers/gudhi/gudhi/Persistence_matrix/columns/intrusive_list_column.h +934 -934
  67. multipers/gudhi/gudhi/Persistence_matrix/columns/intrusive_set_column.h +934 -934
  68. multipers/gudhi/gudhi/Persistence_matrix/columns/list_column.h +980 -980
  69. multipers/gudhi/gudhi/Persistence_matrix/columns/naive_vector_column.h +1092 -1092
  70. multipers/gudhi/gudhi/Persistence_matrix/columns/row_access.h +192 -192
  71. multipers/gudhi/gudhi/Persistence_matrix/columns/set_column.h +921 -921
  72. multipers/gudhi/gudhi/Persistence_matrix/columns/small_vector_column.h +1093 -1093
  73. multipers/gudhi/gudhi/Persistence_matrix/columns/unordered_set_column.h +1012 -1012
  74. multipers/gudhi/gudhi/Persistence_matrix/columns/vector_column.h +1244 -1244
  75. multipers/gudhi/gudhi/Persistence_matrix/matrix_dimension_holders.h +186 -186
  76. multipers/gudhi/gudhi/Persistence_matrix/matrix_row_access.h +164 -164
  77. multipers/gudhi/gudhi/Persistence_matrix/ru_pairing.h +156 -156
  78. multipers/gudhi/gudhi/Persistence_matrix/ru_rep_cycles.h +376 -376
  79. multipers/gudhi/gudhi/Persistence_matrix/ru_vine_swap.h +540 -540
  80. multipers/gudhi/gudhi/Persistent_cohomology/Field_Zp.h +118 -118
  81. multipers/gudhi/gudhi/Persistent_cohomology/Multi_field.h +173 -173
  82. multipers/gudhi/gudhi/Persistent_cohomology/Persistent_cohomology_column.h +128 -128
  83. multipers/gudhi/gudhi/Persistent_cohomology.h +745 -745
  84. multipers/gudhi/gudhi/Points_off_io.h +171 -171
  85. multipers/gudhi/gudhi/Simple_object_pool.h +69 -69
  86. multipers/gudhi/gudhi/Simplex_tree/Simplex_tree_iterators.h +463 -463
  87. multipers/gudhi/gudhi/Simplex_tree/Simplex_tree_node_explicit_storage.h +83 -83
  88. multipers/gudhi/gudhi/Simplex_tree/Simplex_tree_siblings.h +106 -106
  89. multipers/gudhi/gudhi/Simplex_tree/Simplex_tree_star_simplex_iterators.h +277 -277
  90. multipers/gudhi/gudhi/Simplex_tree/hooks_simplex_base.h +62 -62
  91. multipers/gudhi/gudhi/Simplex_tree/indexing_tag.h +27 -27
  92. multipers/gudhi/gudhi/Simplex_tree/serialization_utils.h +62 -62
  93. multipers/gudhi/gudhi/Simplex_tree/simplex_tree_options.h +157 -157
  94. multipers/gudhi/gudhi/Simplex_tree.h +2794 -2794
  95. multipers/gudhi/gudhi/Simplex_tree_multi.h +152 -163
  96. multipers/gudhi/gudhi/distance_functions.h +62 -62
  97. multipers/gudhi/gudhi/graph_simplicial_complex.h +104 -104
  98. multipers/gudhi/gudhi/persistence_interval.h +253 -253
  99. multipers/gudhi/gudhi/persistence_matrix_options.h +170 -170
  100. multipers/gudhi/gudhi/reader_utils.h +367 -367
  101. multipers/gudhi/mma_interface_coh.h +256 -255
  102. multipers/gudhi/mma_interface_h0.h +223 -231
  103. multipers/gudhi/mma_interface_matrix.h +284 -282
  104. multipers/gudhi/naive_merge_tree.h +536 -575
  105. multipers/gudhi/scc_io.h +310 -289
  106. multipers/gudhi/truc.h +890 -888
  107. multipers/io.cp310-win_amd64.pyd +0 -0
  108. multipers/io.pyx +711 -711
  109. multipers/ml/accuracies.py +90 -90
  110. multipers/ml/convolutions.py +520 -520
  111. multipers/ml/invariants_with_persistable.py +79 -79
  112. multipers/ml/kernels.py +176 -176
  113. multipers/ml/mma.py +713 -714
  114. multipers/ml/one.py +472 -472
  115. multipers/ml/point_clouds.py +352 -346
  116. multipers/ml/signed_measures.py +1589 -1589
  117. multipers/ml/sliced_wasserstein.py +461 -461
  118. multipers/ml/tools.py +113 -113
  119. multipers/mma_structures.cp310-win_amd64.pyd +0 -0
  120. multipers/mma_structures.pxd +127 -127
  121. multipers/mma_structures.pyx +4 -4
  122. multipers/mma_structures.pyx.tp +1085 -1085
  123. multipers/multi_parameter_rank_invariant/diff_helpers.h +84 -93
  124. multipers/multi_parameter_rank_invariant/euler_characteristic.h +97 -97
  125. multipers/multi_parameter_rank_invariant/function_rips.h +322 -322
  126. multipers/multi_parameter_rank_invariant/hilbert_function.h +769 -769
  127. multipers/multi_parameter_rank_invariant/persistence_slices.h +148 -148
  128. multipers/multi_parameter_rank_invariant/rank_invariant.h +369 -369
  129. multipers/multiparameter_edge_collapse.py +41 -41
  130. multipers/multiparameter_module_approximation/approximation.h +2296 -2295
  131. multipers/multiparameter_module_approximation/combinatory.h +129 -129
  132. multipers/multiparameter_module_approximation/debug.h +107 -107
  133. multipers/multiparameter_module_approximation/format_python-cpp.h +286 -286
  134. multipers/multiparameter_module_approximation/heap_column.h +238 -238
  135. multipers/multiparameter_module_approximation/images.h +79 -79
  136. multipers/multiparameter_module_approximation/list_column.h +174 -174
  137. multipers/multiparameter_module_approximation/list_column_2.h +232 -232
  138. multipers/multiparameter_module_approximation/ru_matrix.h +347 -347
  139. multipers/multiparameter_module_approximation/set_column.h +135 -135
  140. multipers/multiparameter_module_approximation/structure_higher_dim_barcode.h +36 -36
  141. multipers/multiparameter_module_approximation/unordered_set_column.h +166 -166
  142. multipers/multiparameter_module_approximation/utilities.h +403 -419
  143. multipers/multiparameter_module_approximation/vector_column.h +223 -223
  144. multipers/multiparameter_module_approximation/vector_matrix.h +331 -331
  145. multipers/multiparameter_module_approximation/vineyards.h +464 -464
  146. multipers/multiparameter_module_approximation/vineyards_trajectories.h +649 -649
  147. multipers/multiparameter_module_approximation.cp310-win_amd64.pyd +0 -0
  148. multipers/multiparameter_module_approximation.pyx +216 -217
  149. multipers/pickle.py +90 -53
  150. multipers/plots.py +342 -334
  151. multipers/point_measure.cp310-win_amd64.pyd +0 -0
  152. multipers/point_measure.pyx +322 -320
  153. multipers/simplex_tree_multi.cp310-win_amd64.pyd +0 -0
  154. multipers/simplex_tree_multi.pxd +133 -133
  155. multipers/simplex_tree_multi.pyx +18 -15
  156. multipers/simplex_tree_multi.pyx.tp +1939 -1935
  157. multipers/slicer.cp310-win_amd64.pyd +0 -0
  158. multipers/slicer.pxd +81 -20
  159. multipers/slicer.pxd.tp +215 -214
  160. multipers/slicer.pyx +1091 -308
  161. multipers/slicer.pyx.tp +924 -914
  162. multipers/tensor/tensor.h +672 -672
  163. multipers/tensor.pxd +13 -13
  164. multipers/test.pyx +44 -44
  165. multipers/tests/__init__.py +57 -57
  166. multipers/torch/diff_grids.py +217 -217
  167. multipers/torch/rips_density.py +310 -304
  168. {multipers-2.2.3.dist-info → multipers-2.3.0.dist-info}/LICENSE +21 -21
  169. {multipers-2.2.3.dist-info → multipers-2.3.0.dist-info}/METADATA +21 -11
  170. multipers-2.3.0.dist-info/RECORD +182 -0
  171. multipers/tests/test_diff_helper.py +0 -73
  172. multipers/tests/test_hilbert_function.py +0 -82
  173. multipers/tests/test_mma.py +0 -83
  174. multipers/tests/test_point_clouds.py +0 -49
  175. multipers/tests/test_python-cpp_conversion.py +0 -82
  176. multipers/tests/test_signed_betti.py +0 -181
  177. multipers/tests/test_signed_measure.py +0 -89
  178. multipers/tests/test_simplextreemulti.py +0 -221
  179. multipers/tests/test_slicer.py +0 -221
  180. multipers-2.2.3.dist-info/RECORD +0 -189
  181. {multipers-2.2.3.dist-info → multipers-2.3.0.dist-info}/WHEEL +0 -0
  182. {multipers-2.2.3.dist-info → multipers-2.3.0.dist-info}/top_level.txt +0 -0
@@ -1,171 +1,171 @@
1
- /* This file is part of the Gudhi Library - https://gudhi.inria.fr/ - which is released under MIT.
2
- * See file LICENSE or go to https://gudhi.inria.fr/licensing/ for full license details.
3
- * Author(s): Vincent Rouvreau
4
- *
5
- * Copyright (C) 2015 Inria
6
- *
7
- * Modification(s):
8
- * - YYYY/MM Author: Description of the modification
9
- */
10
- #ifndef POINTS_OFF_IO_H_
11
- #define POINTS_OFF_IO_H_
12
-
13
- #include <gudhi/Off_reader.h>
14
-
15
- #include <string>
16
- #include <vector>
17
- #include <fstream>
18
- #include <map>
19
-
20
- namespace Gudhi {
21
-
22
- /**
23
- * \brief OFF file visitor implementation according to Off_reader in order to read points from an OFF file.
24
- */
25
- template<typename Point_d>
26
- class Points_off_visitor_reader {
27
- private:
28
- std::vector<Point_d> point_cloud;
29
-
30
- public:
31
- /** \brief Off_reader visitor init implementation.
32
- *
33
- * The init parameters are set from OFF file header.
34
- * Dimension value is required in order to construct a vector of points.
35
- *
36
- * @param[in] dim space dimension of vertices.
37
- * @param[in] num_vertices number of vertices in the OFF file (not used).
38
- * @param[in] num_faces number of faces in the OFF file (not used).
39
- * @param[in] num_edges number of edges in the OFF file (not used).
40
- */
41
- void init(int dim, int num_vertices, int num_faces, int num_edges) {
42
- #ifdef DEBUG_TRACES
43
- std::clog << "Points_off_visitor_reader::init - dim=" << dim << " - num_vertices=" <<
44
- num_vertices << " - num_faces=" << num_faces << " - num_edges=" << num_edges << std::endl;
45
- #endif // DEBUG_TRACES
46
- if (num_faces > 0) {
47
- std::cerr << "Points_off_visitor_reader::init faces are not taken into account from OFF file for Points.\n";
48
- }
49
- if (num_edges > 0) {
50
- std::cerr << "Points_off_visitor_reader::init edges are not taken into account from OFF file for Points.\n";
51
- }
52
- }
53
-
54
- /** @brief Off_reader visitor point implementation.
55
- *
56
- * The point function is called on each vertex line from OFF file.
57
- * This function inserts the vertex in the vector of points.
58
- *
59
- * @param[in] point vector of vertex coordinates.
60
- *
61
- * @details
62
- * Point_d must have a constructor with the following form:
63
- *
64
- * @code template<class InputIterator > Point_d::Point_d(InputIterator first, InputIterator last) @endcode
65
- *
66
- */
67
- void point(const std::vector<double>& point) {
68
- #ifdef DEBUG_TRACES
69
- std::clog << "Points_off_visitor_reader::point ";
70
- for (auto coordinate : point) {
71
- std::clog << coordinate << " | ";
72
- }
73
- std::clog << std::endl;
74
- #endif // DEBUG_TRACES
75
- // Fill the point cloud
76
- point_cloud.push_back(Point_d(point.begin(), point.end()));
77
- }
78
-
79
- // Off_reader visitor maximal_face implementation - Only points are read
80
- void maximal_face(const std::vector<int>& face) { }
81
-
82
- // Off_reader visitor done implementation - Only points are read
83
- void done() { }
84
-
85
- /** \brief Point cloud getter.
86
- *
87
- * @return point_cloud.
88
- */
89
- const std::vector<Point_d>& get_point_cloud() const {
90
- return point_cloud;
91
- }
92
- };
93
-
94
- /**
95
- * \brief OFF file reader implementation in order to read points from an OFF file.
96
- *
97
- * This class is using the Points_off_visitor_reader to visit the OFF file according to Off_reader.
98
- *
99
- * Point_d must have a constructor with the following form:
100
- *
101
- * \code template<class InputIterator > Point_d::Point_d(int d, InputIterator first, InputIterator last) \endcode
102
- *
103
- * where d is the point dimension.
104
- *
105
- * \section pointoffioexample Example
106
- *
107
- * This example loads points from an OFF file and builds a vector of points (vector of double).
108
- * Then, it is asked to display the points.
109
- *
110
- * \include example_vector_double_points_off_reader.cpp
111
- *
112
- * When launching:
113
- *
114
- * \code $> ./vector_double_off_reader ../../data/points/alphacomplexdoc.off
115
- * \endcode
116
- *
117
- * the program outputs a file ../../data/points/alphacomplexdoc.off.txt:
118
- *
119
- * \include vectordoubleoffreader_result.txt
120
- */
121
- template<typename Point_d>
122
- class Points_off_reader {
123
- public:
124
- /** \brief Reads the OFF file and constructs a vector of points from the points
125
- * that are in the OFF file.
126
- *
127
- * @param[in] name_file OFF file to read.
128
- *
129
- * \post Check with is_valid() function to see if read operation was successful.
130
- */
131
- Points_off_reader(const std::string& name_file)
132
- : valid_(false) {
133
- std::ifstream stream(name_file);
134
- if (stream.is_open()) {
135
- Off_reader off_reader(stream);
136
- Points_off_visitor_reader<Point_d> off_visitor;
137
- valid_ = off_reader.read(off_visitor);
138
- if (valid_) {
139
- point_cloud = off_visitor.get_point_cloud();
140
- }
141
- } else {
142
- std::cerr << "Points_off_reader::Points_off_reader could not open file " << name_file << "\n";
143
- }
144
- }
145
-
146
- /** \brief Returns if the OFF file read operation was successful or not.
147
- *
148
- * @return OFF file read status.
149
- */
150
- bool is_valid() const {
151
- return valid_;
152
- }
153
-
154
- /** \brief Point cloud getter.
155
- *
156
- * @return point_cloud.
157
- */
158
- const std::vector<Point_d>& get_point_cloud() const {
159
- return point_cloud;
160
- }
161
-
162
- private:
163
- /** \brief point_cloud.*/
164
- std::vector<Point_d> point_cloud;
165
- /** \brief OFF file read status.*/
166
- bool valid_;
167
- };
168
-
169
- } // namespace Gudhi
170
-
171
- #endif // POINTS_OFF_IO_H_
1
+ /* This file is part of the Gudhi Library - https://gudhi.inria.fr/ - which is released under MIT.
2
+ * See file LICENSE or go to https://gudhi.inria.fr/licensing/ for full license details.
3
+ * Author(s): Vincent Rouvreau
4
+ *
5
+ * Copyright (C) 2015 Inria
6
+ *
7
+ * Modification(s):
8
+ * - YYYY/MM Author: Description of the modification
9
+ */
10
+ #ifndef POINTS_OFF_IO_H_
11
+ #define POINTS_OFF_IO_H_
12
+
13
+ #include <gudhi/Off_reader.h>
14
+
15
+ #include <string>
16
+ #include <vector>
17
+ #include <fstream>
18
+ #include <map>
19
+
20
+ namespace Gudhi {
21
+
22
+ /**
23
+ * \brief OFF file visitor implementation according to Off_reader in order to read points from an OFF file.
24
+ */
25
+ template<typename Point_d>
26
+ class Points_off_visitor_reader {
27
+ private:
28
+ std::vector<Point_d> point_cloud;
29
+
30
+ public:
31
+ /** \brief Off_reader visitor init implementation.
32
+ *
33
+ * The init parameters are set from OFF file header.
34
+ * Dimension value is required in order to construct a vector of points.
35
+ *
36
+ * @param[in] dim space dimension of vertices.
37
+ * @param[in] num_vertices number of vertices in the OFF file (not used).
38
+ * @param[in] num_faces number of faces in the OFF file (not used).
39
+ * @param[in] num_edges number of edges in the OFF file (not used).
40
+ */
41
+ void init(int dim, int num_vertices, int num_faces, int num_edges) {
42
+ #ifdef DEBUG_TRACES
43
+ std::clog << "Points_off_visitor_reader::init - dim=" << dim << " - num_vertices=" <<
44
+ num_vertices << " - num_faces=" << num_faces << " - num_edges=" << num_edges << std::endl;
45
+ #endif // DEBUG_TRACES
46
+ if (num_faces > 0) {
47
+ std::cerr << "Points_off_visitor_reader::init faces are not taken into account from OFF file for Points.\n";
48
+ }
49
+ if (num_edges > 0) {
50
+ std::cerr << "Points_off_visitor_reader::init edges are not taken into account from OFF file for Points.\n";
51
+ }
52
+ }
53
+
54
+ /** @brief Off_reader visitor point implementation.
55
+ *
56
+ * The point function is called on each vertex line from OFF file.
57
+ * This function inserts the vertex in the vector of points.
58
+ *
59
+ * @param[in] point vector of vertex coordinates.
60
+ *
61
+ * @details
62
+ * Point_d must have a constructor with the following form:
63
+ *
64
+ * @code template<class InputIterator > Point_d::Point_d(InputIterator first, InputIterator last) @endcode
65
+ *
66
+ */
67
+ void point(const std::vector<double>& point) {
68
+ #ifdef DEBUG_TRACES
69
+ std::clog << "Points_off_visitor_reader::point ";
70
+ for (auto coordinate : point) {
71
+ std::clog << coordinate << " | ";
72
+ }
73
+ std::clog << std::endl;
74
+ #endif // DEBUG_TRACES
75
+ // Fill the point cloud
76
+ point_cloud.push_back(Point_d(point.begin(), point.end()));
77
+ }
78
+
79
+ // Off_reader visitor maximal_face implementation - Only points are read
80
+ void maximal_face(const std::vector<int>& face) { }
81
+
82
+ // Off_reader visitor done implementation - Only points are read
83
+ void done() { }
84
+
85
+ /** \brief Point cloud getter.
86
+ *
87
+ * @return point_cloud.
88
+ */
89
+ const std::vector<Point_d>& get_point_cloud() const {
90
+ return point_cloud;
91
+ }
92
+ };
93
+
94
+ /**
95
+ * \brief OFF file reader implementation in order to read points from an OFF file.
96
+ *
97
+ * This class is using the Points_off_visitor_reader to visit the OFF file according to Off_reader.
98
+ *
99
+ * Point_d must have a constructor with the following form:
100
+ *
101
+ * \code template<class InputIterator > Point_d::Point_d(int d, InputIterator first, InputIterator last) \endcode
102
+ *
103
+ * where d is the point dimension.
104
+ *
105
+ * \section pointoffioexample Example
106
+ *
107
+ * This example loads points from an OFF file and builds a vector of points (vector of double).
108
+ * Then, it is asked to display the points.
109
+ *
110
+ * \include example_vector_double_points_off_reader.cpp
111
+ *
112
+ * When launching:
113
+ *
114
+ * \code $> ./vector_double_off_reader ../../data/points/alphacomplexdoc.off
115
+ * \endcode
116
+ *
117
+ * the program outputs a file ../../data/points/alphacomplexdoc.off.txt:
118
+ *
119
+ * \include vectordoubleoffreader_result.txt
120
+ */
121
+ template<typename Point_d>
122
+ class Points_off_reader {
123
+ public:
124
+ /** \brief Reads the OFF file and constructs a vector of points from the points
125
+ * that are in the OFF file.
126
+ *
127
+ * @param[in] name_file OFF file to read.
128
+ *
129
+ * \post Check with is_valid() function to see if read operation was successful.
130
+ */
131
+ Points_off_reader(const std::string& name_file)
132
+ : valid_(false) {
133
+ std::ifstream stream(name_file);
134
+ if (stream.is_open()) {
135
+ Off_reader off_reader(stream);
136
+ Points_off_visitor_reader<Point_d> off_visitor;
137
+ valid_ = off_reader.read(off_visitor);
138
+ if (valid_) {
139
+ point_cloud = off_visitor.get_point_cloud();
140
+ }
141
+ } else {
142
+ std::cerr << "Points_off_reader::Points_off_reader could not open file " << name_file << "\n";
143
+ }
144
+ }
145
+
146
+ /** \brief Returns if the OFF file read operation was successful or not.
147
+ *
148
+ * @return OFF file read status.
149
+ */
150
+ bool is_valid() const {
151
+ return valid_;
152
+ }
153
+
154
+ /** \brief Point cloud getter.
155
+ *
156
+ * @return point_cloud.
157
+ */
158
+ const std::vector<Point_d>& get_point_cloud() const {
159
+ return point_cloud;
160
+ }
161
+
162
+ private:
163
+ /** \brief point_cloud.*/
164
+ std::vector<Point_d> point_cloud;
165
+ /** \brief OFF file read status.*/
166
+ bool valid_;
167
+ };
168
+
169
+ } // namespace Gudhi
170
+
171
+ #endif // POINTS_OFF_IO_H_
@@ -1,69 +1,69 @@
1
- /* This file is part of the Gudhi Library - https://gudhi.inria.fr/ - which is released under MIT.
2
- * See file LICENSE or go to https://gudhi.inria.fr/licensing/ for full license details.
3
- * Author(s): Marc Glisse
4
- *
5
- * Copyright (C) 2015 Inria
6
- *
7
- * Modification(s):
8
- * - YYYY/MM Author: Description of the modification
9
- */
10
-
11
- #ifndef SIMPLE_OBJECT_POOL_H_
12
- #define SIMPLE_OBJECT_POOL_H_
13
-
14
- #include <boost/pool/pool.hpp>
15
- #include <utility>
16
-
17
- namespace Gudhi {
18
-
19
- /** \private
20
- * This is a simpler version of boost::object_pool, that requires
21
- * that users explicitly destroy all objects. This lets the
22
- * performance scale much better, see
23
- * https://svn.boost.org/trac/boost/ticket/3789 .
24
- */
25
- template <class T>
26
- class Simple_object_pool : protected boost::pool<boost::default_user_allocator_malloc_free> {
27
- protected:
28
- typedef boost::pool<boost::default_user_allocator_malloc_free> Base;
29
- typedef T* pointer;
30
-
31
- Base& base() {
32
- return *this;
33
- }
34
-
35
- Base const& base()const {
36
- return *this;
37
- }
38
-
39
- public:
40
- typedef T element_type;
41
- typedef boost::default_user_allocator_malloc_free user_allocator;
42
- typedef typename Base::size_type size_type;
43
- typedef typename Base::difference_type difference_type;
44
-
45
- template<class...U>
46
- Simple_object_pool(U&&...u) : Base(sizeof (T), std::forward<U>(u)...) { }
47
-
48
- template<class...U>
49
- pointer construct(U&&...u) {
50
- void* p = base().malloc BOOST_PREVENT_MACRO_SUBSTITUTION();
51
- assert(p);
52
- try {
53
- new(p) T(std::forward<U>(u)...);
54
- } catch (...) {
55
- base().free BOOST_PREVENT_MACRO_SUBSTITUTION(p);
56
- throw;
57
- }
58
- return static_cast<pointer> (p);
59
- }
60
-
61
- void destroy(pointer p) {
62
- p->~T();
63
- base().free BOOST_PREVENT_MACRO_SUBSTITUTION(p);
64
- }
65
- };
66
-
67
- } // namespace Gudhi
68
-
69
- #endif // SIMPLE_OBJECT_POOL_H_
1
+ /* This file is part of the Gudhi Library - https://gudhi.inria.fr/ - which is released under MIT.
2
+ * See file LICENSE or go to https://gudhi.inria.fr/licensing/ for full license details.
3
+ * Author(s): Marc Glisse
4
+ *
5
+ * Copyright (C) 2015 Inria
6
+ *
7
+ * Modification(s):
8
+ * - YYYY/MM Author: Description of the modification
9
+ */
10
+
11
+ #ifndef SIMPLE_OBJECT_POOL_H_
12
+ #define SIMPLE_OBJECT_POOL_H_
13
+
14
+ #include <boost/pool/pool.hpp>
15
+ #include <utility>
16
+
17
+ namespace Gudhi {
18
+
19
+ /** \private
20
+ * This is a simpler version of boost::object_pool, that requires
21
+ * that users explicitly destroy all objects. This lets the
22
+ * performance scale much better, see
23
+ * https://svn.boost.org/trac/boost/ticket/3789 .
24
+ */
25
+ template <class T>
26
+ class Simple_object_pool : protected boost::pool<boost::default_user_allocator_malloc_free> {
27
+ protected:
28
+ typedef boost::pool<boost::default_user_allocator_malloc_free> Base;
29
+ typedef T* pointer;
30
+
31
+ Base& base() {
32
+ return *this;
33
+ }
34
+
35
+ Base const& base()const {
36
+ return *this;
37
+ }
38
+
39
+ public:
40
+ typedef T element_type;
41
+ typedef boost::default_user_allocator_malloc_free user_allocator;
42
+ typedef typename Base::size_type size_type;
43
+ typedef typename Base::difference_type difference_type;
44
+
45
+ template<class...U>
46
+ Simple_object_pool(U&&...u) : Base(sizeof (T), std::forward<U>(u)...) { }
47
+
48
+ template<class...U>
49
+ pointer construct(U&&...u) {
50
+ void* p = base().malloc BOOST_PREVENT_MACRO_SUBSTITUTION();
51
+ assert(p);
52
+ try {
53
+ new(p) T(std::forward<U>(u)...);
54
+ } catch (...) {
55
+ base().free BOOST_PREVENT_MACRO_SUBSTITUTION(p);
56
+ throw;
57
+ }
58
+ return static_cast<pointer> (p);
59
+ }
60
+
61
+ void destroy(pointer p) {
62
+ p->~T();
63
+ base().free BOOST_PREVENT_MACRO_SUBSTITUTION(p);
64
+ }
65
+ };
66
+
67
+ } // namespace Gudhi
68
+
69
+ #endif // SIMPLE_OBJECT_POOL_H_