multipers 2.2.3__cp312-cp312-win_amd64.whl → 2.3.1__cp312-cp312-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/{ml/convolutions.py → filtrations/density.py} +563 -520
  15. multipers/filtrations/filtrations.py +289 -0
  16. multipers/filtrations.pxd +224 -224
  17. multipers/function_rips.cp312-win_amd64.pyd +0 -0
  18. multipers/function_rips.pyx +105 -105
  19. multipers/grids.cp312-win_amd64.pyd +0 -0
  20. multipers/grids.pyx +350 -350
  21. multipers/gudhi/Persistence_slices_interface.h +132 -132
  22. multipers/gudhi/Simplex_tree_interface.h +239 -245
  23. multipers/gudhi/Simplex_tree_multi_interface.h +516 -561
  24. multipers/gudhi/cubical_to_boundary.h +59 -59
  25. multipers/gudhi/gudhi/Bitmap_cubical_complex.h +450 -450
  26. multipers/gudhi/gudhi/Bitmap_cubical_complex_base.h +1070 -1070
  27. multipers/gudhi/gudhi/Bitmap_cubical_complex_periodic_boundary_conditions_base.h +579 -579
  28. multipers/gudhi/gudhi/Debug_utils.h +45 -45
  29. multipers/gudhi/gudhi/Fields/Multi_field.h +484 -484
  30. multipers/gudhi/gudhi/Fields/Multi_field_operators.h +455 -455
  31. multipers/gudhi/gudhi/Fields/Multi_field_shared.h +450 -450
  32. multipers/gudhi/gudhi/Fields/Multi_field_small.h +531 -531
  33. multipers/gudhi/gudhi/Fields/Multi_field_small_operators.h +507 -507
  34. multipers/gudhi/gudhi/Fields/Multi_field_small_shared.h +531 -531
  35. multipers/gudhi/gudhi/Fields/Z2_field.h +355 -355
  36. multipers/gudhi/gudhi/Fields/Z2_field_operators.h +376 -376
  37. multipers/gudhi/gudhi/Fields/Zp_field.h +420 -420
  38. multipers/gudhi/gudhi/Fields/Zp_field_operators.h +400 -400
  39. multipers/gudhi/gudhi/Fields/Zp_field_shared.h +418 -418
  40. multipers/gudhi/gudhi/Flag_complex_edge_collapser.h +337 -337
  41. multipers/gudhi/gudhi/Matrix.h +2107 -2107
  42. multipers/gudhi/gudhi/Multi_critical_filtration.h +1038 -1038
  43. multipers/gudhi/gudhi/Multi_persistence/Box.h +171 -171
  44. multipers/gudhi/gudhi/Multi_persistence/Line.h +282 -282
  45. multipers/gudhi/gudhi/Off_reader.h +173 -173
  46. multipers/gudhi/gudhi/One_critical_filtration.h +1433 -1431
  47. multipers/gudhi/gudhi/Persistence_matrix/Base_matrix.h +769 -769
  48. multipers/gudhi/gudhi/Persistence_matrix/Base_matrix_with_column_compression.h +686 -686
  49. multipers/gudhi/gudhi/Persistence_matrix/Boundary_matrix.h +842 -842
  50. multipers/gudhi/gudhi/Persistence_matrix/Chain_matrix.h +1350 -1350
  51. multipers/gudhi/gudhi/Persistence_matrix/Id_to_index_overlay.h +1105 -1105
  52. multipers/gudhi/gudhi/Persistence_matrix/Position_to_index_overlay.h +859 -859
  53. multipers/gudhi/gudhi/Persistence_matrix/RU_matrix.h +910 -910
  54. multipers/gudhi/gudhi/Persistence_matrix/allocators/entry_constructors.h +139 -139
  55. multipers/gudhi/gudhi/Persistence_matrix/base_pairing.h +230 -230
  56. multipers/gudhi/gudhi/Persistence_matrix/base_swap.h +211 -211
  57. multipers/gudhi/gudhi/Persistence_matrix/boundary_cell_position_to_id_mapper.h +60 -60
  58. multipers/gudhi/gudhi/Persistence_matrix/boundary_face_position_to_id_mapper.h +60 -60
  59. multipers/gudhi/gudhi/Persistence_matrix/chain_pairing.h +136 -136
  60. multipers/gudhi/gudhi/Persistence_matrix/chain_rep_cycles.h +190 -190
  61. multipers/gudhi/gudhi/Persistence_matrix/chain_vine_swap.h +616 -616
  62. multipers/gudhi/gudhi/Persistence_matrix/columns/chain_column_extra_properties.h +150 -150
  63. multipers/gudhi/gudhi/Persistence_matrix/columns/column_dimension_holder.h +106 -106
  64. multipers/gudhi/gudhi/Persistence_matrix/columns/column_utilities.h +219 -219
  65. multipers/gudhi/gudhi/Persistence_matrix/columns/entry_types.h +327 -327
  66. multipers/gudhi/gudhi/Persistence_matrix/columns/heap_column.h +1140 -1140
  67. multipers/gudhi/gudhi/Persistence_matrix/columns/intrusive_list_column.h +934 -934
  68. multipers/gudhi/gudhi/Persistence_matrix/columns/intrusive_set_column.h +934 -934
  69. multipers/gudhi/gudhi/Persistence_matrix/columns/list_column.h +980 -980
  70. multipers/gudhi/gudhi/Persistence_matrix/columns/naive_vector_column.h +1092 -1092
  71. multipers/gudhi/gudhi/Persistence_matrix/columns/row_access.h +192 -192
  72. multipers/gudhi/gudhi/Persistence_matrix/columns/set_column.h +921 -921
  73. multipers/gudhi/gudhi/Persistence_matrix/columns/small_vector_column.h +1093 -1093
  74. multipers/gudhi/gudhi/Persistence_matrix/columns/unordered_set_column.h +1012 -1012
  75. multipers/gudhi/gudhi/Persistence_matrix/columns/vector_column.h +1244 -1244
  76. multipers/gudhi/gudhi/Persistence_matrix/matrix_dimension_holders.h +186 -186
  77. multipers/gudhi/gudhi/Persistence_matrix/matrix_row_access.h +164 -164
  78. multipers/gudhi/gudhi/Persistence_matrix/ru_pairing.h +156 -156
  79. multipers/gudhi/gudhi/Persistence_matrix/ru_rep_cycles.h +376 -376
  80. multipers/gudhi/gudhi/Persistence_matrix/ru_vine_swap.h +540 -540
  81. multipers/gudhi/gudhi/Persistent_cohomology/Field_Zp.h +118 -118
  82. multipers/gudhi/gudhi/Persistent_cohomology/Multi_field.h +173 -173
  83. multipers/gudhi/gudhi/Persistent_cohomology/Persistent_cohomology_column.h +128 -128
  84. multipers/gudhi/gudhi/Persistent_cohomology.h +745 -745
  85. multipers/gudhi/gudhi/Points_off_io.h +171 -171
  86. multipers/gudhi/gudhi/Simple_object_pool.h +69 -69
  87. multipers/gudhi/gudhi/Simplex_tree/Simplex_tree_iterators.h +463 -463
  88. multipers/gudhi/gudhi/Simplex_tree/Simplex_tree_node_explicit_storage.h +83 -83
  89. multipers/gudhi/gudhi/Simplex_tree/Simplex_tree_siblings.h +106 -106
  90. multipers/gudhi/gudhi/Simplex_tree/Simplex_tree_star_simplex_iterators.h +277 -277
  91. multipers/gudhi/gudhi/Simplex_tree/hooks_simplex_base.h +62 -62
  92. multipers/gudhi/gudhi/Simplex_tree/indexing_tag.h +27 -27
  93. multipers/gudhi/gudhi/Simplex_tree/serialization_utils.h +62 -62
  94. multipers/gudhi/gudhi/Simplex_tree/simplex_tree_options.h +157 -157
  95. multipers/gudhi/gudhi/Simplex_tree.h +2794 -2794
  96. multipers/gudhi/gudhi/Simplex_tree_multi.h +152 -163
  97. multipers/gudhi/gudhi/distance_functions.h +62 -62
  98. multipers/gudhi/gudhi/graph_simplicial_complex.h +104 -104
  99. multipers/gudhi/gudhi/persistence_interval.h +253 -253
  100. multipers/gudhi/gudhi/persistence_matrix_options.h +170 -170
  101. multipers/gudhi/gudhi/reader_utils.h +367 -367
  102. multipers/gudhi/mma_interface_coh.h +256 -255
  103. multipers/gudhi/mma_interface_h0.h +223 -231
  104. multipers/gudhi/mma_interface_matrix.h +291 -282
  105. multipers/gudhi/naive_merge_tree.h +536 -575
  106. multipers/gudhi/scc_io.h +310 -289
  107. multipers/gudhi/truc.h +957 -888
  108. multipers/io.cp312-win_amd64.pyd +0 -0
  109. multipers/io.pyx +714 -711
  110. multipers/ml/accuracies.py +90 -90
  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.cp312-win_amd64.pyd +0 -0
  120. multipers/mma_structures.pxd +127 -127
  121. multipers/mma_structures.pyx +4 -8
  122. multipers/mma_structures.pyx.tp +1083 -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 +2298 -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.cp312-win_amd64.pyd +0 -0
  148. multipers/multiparameter_module_approximation.pyx +218 -217
  149. multipers/pickle.py +90 -53
  150. multipers/plots.py +342 -334
  151. multipers/point_measure.cp312-win_amd64.pyd +0 -0
  152. multipers/point_measure.pyx +322 -320
  153. multipers/simplex_tree_multi.cp312-win_amd64.pyd +0 -0
  154. multipers/simplex_tree_multi.pxd +133 -133
  155. multipers/simplex_tree_multi.pyx +115 -48
  156. multipers/simplex_tree_multi.pyx.tp +1947 -1935
  157. multipers/slicer.cp312-win_amd64.pyd +0 -0
  158. multipers/slicer.pxd +281 -100
  159. multipers/slicer.pxd.tp +218 -214
  160. multipers/slicer.pyx +1570 -507
  161. multipers/slicer.pyx.tp +931 -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.1.dist-info}/LICENSE +21 -21
  169. {multipers-2.2.3.dist-info → multipers-2.3.1.dist-info}/METADATA +21 -11
  170. multipers-2.3.1.dist-info/RECORD +182 -0
  171. {multipers-2.2.3.dist-info → multipers-2.3.1.dist-info}/WHEEL +1 -1
  172. multipers/tests/test_diff_helper.py +0 -73
  173. multipers/tests/test_hilbert_function.py +0 -82
  174. multipers/tests/test_mma.py +0 -83
  175. multipers/tests/test_point_clouds.py +0 -49
  176. multipers/tests/test_python-cpp_conversion.py +0 -82
  177. multipers/tests/test_signed_betti.py +0 -181
  178. multipers/tests/test_signed_measure.py +0 -89
  179. multipers/tests/test_simplextreemulti.py +0 -221
  180. multipers/tests/test_slicer.py +0 -221
  181. multipers-2.2.3.dist-info/RECORD +0 -189
  182. {multipers-2.2.3.dist-info → multipers-2.3.1.dist-info}/top_level.txt +0 -0
@@ -1,331 +1,331 @@
1
- /* This file is part of the MMA Library - https://gitlab.inria.fr/dloiseau/multipers - which is released under MIT.
2
- * See file LICENSE for full license details.
3
- * Author(s): Hannah Schreiber
4
- *
5
- * Copyright (C) 2022 Inria
6
- *
7
- * Modification(s):
8
- * - YYYY/MM Author: Description of the modification
9
- */
10
-
11
- #ifndef VECTOR_MATRIX_H
12
- #define VECTOR_MATRIX_H
13
-
14
- #include <utility>
15
- #include <vector>
16
- #include <unordered_map>
17
- #include <iostream>
18
- #include <algorithm>
19
-
20
- #include "utilities.h" //type definitions
21
-
22
- namespace Gudhi::multiparameter::mma {
23
-
24
- template<class Column_type>
25
- class Vector_matrix
26
- {
27
- public:
28
- Vector_matrix();
29
- Vector_matrix(std::vector<boundary_type>& orderedBoundaries);
30
- Vector_matrix(unsigned int numberOfColumns);
31
- Vector_matrix(Vector_matrix<Column_type>& matrixToCopy);
32
- Vector_matrix(Vector_matrix&& other) noexcept;
33
-
34
- void insert_boundary(index columnIndex, boundary_type& boundary);
35
- void get_boundary(index columnIndex, boundary_type& container);
36
- void insert_column(index columnIndex, Column_type column);
37
- Column_type& get_column(index columnIndex);
38
-
39
- void reduce(barcode_type& barcode);
40
-
41
- index get_last_index() const;
42
- dimension_type get_max_dim() const;
43
- unsigned int get_number_of_columns() const;
44
-
45
- void swap_columns(index columnIndex1, index columnIndex2);
46
- void swap_rows(index rowIndex1, index rowIndex2);
47
- void swap_at_indices(index index1, index index2);
48
-
49
- void zero_cell(index columnIndex, index rowIndex);
50
- void zero_column(index columnIndex);
51
-
52
- void add_to(index sourceColumnIndex, index targetColumnIndex);
53
- bool is_zero_cell(index columnIndex, index rowIndex) const;
54
- bool is_zero_column(index columnIndex);
55
-
56
- dimension_type get_column_dimension(index columnIndex) const;
57
-
58
- Vector_matrix<Column_type>& operator=(Vector_matrix<Column_type> other);
59
- template<class Friend_column_type>
60
- friend void swap(Vector_matrix<Friend_column_type>& matrix1,
61
- Vector_matrix<Friend_column_type>& matrix2);
62
-
63
- private:
64
- std::vector<Column_type> matrix_;
65
- dimension_type maxDim_;
66
- std::vector<unsigned int> indexToRow_;
67
- std::vector<index> rowToIndex_;
68
- bool rowSwapped_;
69
-
70
- void _clear_column(index columnIndex);
71
- void _orderRows();
72
- };
73
-
74
- template<class Column_type>
75
- inline Vector_matrix<Column_type>::Vector_matrix() : maxDim_(0), rowSwapped_(false)
76
- {}
77
-
78
- template<class Column_type>
79
- inline Vector_matrix<Column_type>::Vector_matrix(
80
- std::vector<boundary_type>& orderedBoundaries) : maxDim_(0), rowSwapped_(false)
81
- {
82
- matrix_.resize(orderedBoundaries.size());
83
- indexToRow_.resize(orderedBoundaries.size());
84
- rowToIndex_.resize(orderedBoundaries.size());
85
- for (unsigned int i = 0; i < orderedBoundaries.size(); i++){
86
- boundary_type& b = orderedBoundaries.at(i);
87
- matrix_.at(i) = Column_type(b);
88
- if (maxDim_ < static_cast<int>(b.size()) - 1) maxDim_ = b.size() - 1;
89
- indexToRow_.at(i) = i;
90
- rowToIndex_.at(i) = i;
91
- }
92
- if (maxDim_ == -1) maxDim_ = 0;
93
- }
94
-
95
- template<class Column_type>
96
- inline Vector_matrix<Column_type>::Vector_matrix(unsigned int numberOfColumns)
97
- : maxDim_(0), rowSwapped_(false)
98
- {
99
- matrix_.resize(numberOfColumns);
100
- indexToRow_.resize(numberOfColumns);
101
- rowToIndex_.resize(numberOfColumns);
102
- for (unsigned int i = 0; i < numberOfColumns; i++){
103
- indexToRow_.at(i) = i;
104
- rowToIndex_.at(i) = i;
105
- }
106
- }
107
-
108
- template<class Column_type>
109
- inline Vector_matrix<Column_type>::Vector_matrix(
110
- Vector_matrix<Column_type>& matrixToCopy) : maxDim_(0), rowSwapped_(false)
111
- {
112
- matrix_.resize(matrixToCopy.get_number_of_columns());
113
- indexToRow_.resize(matrix_.size());
114
- rowToIndex_.resize(matrix_.size());
115
- for (unsigned int i = 0; i < matrix_.size(); i++){
116
- matrix_.at(i) = Column_type(matrixToCopy.get_column(i));
117
- indexToRow_.at(i) = i;
118
- rowToIndex_.at(i) = i;
119
- }
120
- maxDim_ = matrixToCopy.get_max_dim();
121
- }
122
-
123
- template<class Column_type>
124
- inline Vector_matrix<Column_type>::Vector_matrix(Vector_matrix<Column_type> &&other) noexcept
125
- : matrix_(std::move(other.matrix_)),
126
- maxDim_(std::exchange(other.maxDim_, 0)),
127
- indexToRow_(std::move(other.indexToRow_)),
128
- rowToIndex_(std::move(other.rowToIndex_)),
129
- rowSwapped_(std::exchange(other.rowSwapped_, 0))
130
- {}
131
-
132
- template<class Column_type>
133
- inline void Vector_matrix<Column_type>::insert_boundary(
134
- index columnIndex, boundary_type& boundary)
135
- {
136
- if (rowSwapped_) _orderRows();
137
-
138
- if (matrix_.size() <= columnIndex) {
139
- for (int i = matrix_.size(); i <= columnIndex; i++){
140
- indexToRow_.push_back(i);
141
- rowToIndex_.push_back(i);
142
- }
143
- matrix_.resize(columnIndex + 1);
144
- }
145
- matrix_.at(columnIndex) = Column_type(boundary);
146
- if (maxDim_ < boundary.size() - 1) maxDim_ = boundary.size() - 1;
147
- }
148
-
149
- template<class Column_type>
150
- inline void Vector_matrix<Column_type>::get_boundary(
151
- index columnIndex, boundary_type& container)
152
- {
153
- matrix_.at(columnIndex).get_content(container);
154
- for (unsigned int& v : container) v = rowToIndex_.at(v);
155
- std::sort(container.begin(), container.end());
156
- }
157
-
158
- template<class Column_type>
159
- inline void Vector_matrix<Column_type>::insert_column(
160
- index columnIndex, Column_type column)
161
- {
162
- if (rowSwapped_) _orderRows();
163
-
164
- dimension_type dim = column.get_dimension();
165
- if (matrix_.size() <= columnIndex) {
166
- for (unsigned int i = matrix_.size(); i <= columnIndex; i++){
167
- indexToRow_.push_back(i);
168
- rowToIndex_.push_back(i);
169
- }
170
- matrix_.resize(columnIndex + 1);
171
- }
172
- std::swap(matrix_.at(columnIndex), column);
173
- if (maxDim_ < dim) maxDim_ = dim;
174
- }
175
-
176
- template<class Column_type>
177
- inline Column_type& Vector_matrix<Column_type>::get_column(index columnIndex)
178
- {
179
- if (rowSwapped_) _orderRows();
180
- return matrix_.at(columnIndex);
181
- }
182
-
183
- template<class Column_type>
184
- inline void Vector_matrix<Column_type>::reduce(barcode_type& barcode)
185
- {
186
- if (rowSwapped_) _orderRows();
187
- std::unordered_map<index, index> pivotsToColumn;
188
-
189
- for (int d = maxDim_; d > 0; d--){
190
- for (unsigned int i = 0; i < matrix_.size(); i++){
191
- if (!(matrix_.at(i).is_empty()) && matrix_.at(i).get_dimension() == d)
192
- {
193
- Column_type &curr = matrix_.at(i);
194
- int pivot = curr.get_pivot();
195
-
196
- while (pivot != -1 && pivotsToColumn.find(pivot) != pivotsToColumn.end()){
197
- curr.add(matrix_.at(pivotsToColumn.at(pivot)));
198
- pivot = curr.get_pivot();
199
- }
200
-
201
- if (pivot != -1){
202
- pivotsToColumn.emplace(pivot, i);
203
- _clear_column(pivot);
204
- barcode.push_back(Bar(d - 1, pivot, i));
205
- } else {
206
- _clear_column(i);
207
- }
208
- }
209
- }
210
- }
211
- }
212
-
213
- template<class Column_type>
214
- inline index Vector_matrix<Column_type>::get_last_index() const
215
- {
216
- return matrix_.size() - 1;
217
- }
218
-
219
- template<class Column_type>
220
- inline dimension_type Vector_matrix<Column_type>::get_max_dim() const
221
- {
222
- return maxDim_;
223
- }
224
-
225
- template<class Column_type>
226
- inline unsigned int Vector_matrix<Column_type>::get_number_of_columns() const
227
- {
228
- return matrix_.size();
229
- }
230
-
231
- template<class Column_type>
232
- inline void Vector_matrix<Column_type>::swap_columns(index columnIndex1, index columnIndex2)
233
- {
234
- std::swap(matrix_.at(columnIndex1), matrix_.at(columnIndex2));
235
- }
236
-
237
- template<class Column_type>
238
- inline void Vector_matrix<Column_type>::swap_rows(index rowIndex1, index rowIndex2)
239
- {
240
- rowSwapped_ = true;
241
- std::swap(rowToIndex_.at(indexToRow_.at(rowIndex1)), rowToIndex_.at(indexToRow_.at(rowIndex2)));
242
- std::swap(indexToRow_.at(rowIndex1), indexToRow_.at(rowIndex2));
243
- }
244
-
245
- template<class Column_type>
246
- inline void Vector_matrix<Column_type>::swap_at_indices(index index1, index index2)
247
- {
248
- swap_columns(index1, index2);
249
- swap_rows(index1, index2);
250
- }
251
-
252
- template<class Column_type>
253
- inline void Vector_matrix<Column_type>::zero_cell(index columnIndex, index rowIndex)
254
- {
255
- matrix_.at(columnIndex).clear(indexToRow_.at(rowIndex));
256
- }
257
-
258
- template<class Column_type>
259
- inline void Vector_matrix<Column_type>::zero_column(index columnIndex)
260
- {
261
- _clear_column(columnIndex);
262
- }
263
-
264
- template<class Column_type>
265
- inline void Vector_matrix<Column_type>::add_to(index sourceColumnIndex, index targetColumnIndex)
266
- {
267
- matrix_.at(targetColumnIndex).add(matrix_.at(sourceColumnIndex));
268
- }
269
-
270
- template<class Column_type>
271
- inline bool Vector_matrix<Column_type>::is_zero_cell(index columnIndex, index rowIndex) const
272
- {
273
- return !(matrix_.at(columnIndex).contains(indexToRow_.at(rowIndex)));
274
- }
275
-
276
- template<class Column_type>
277
- inline bool Vector_matrix<Column_type>::is_zero_column(index columnIndex)
278
- {
279
- return matrix_.at(columnIndex).is_empty();
280
- }
281
-
282
- template<class Column_type>
283
- inline dimension_type Vector_matrix<Column_type>::get_column_dimension(index columnIndex) const
284
- {
285
- return matrix_.at(columnIndex).get_dimension();
286
- }
287
-
288
- template<class Column_type>
289
- inline Vector_matrix<Column_type> &Vector_matrix<Column_type>::operator=(
290
- Vector_matrix<Column_type> other)
291
- {
292
- std::swap(matrix_, other.matrix_);
293
- std::swap(maxDim_, other.maxDim_);
294
- std::swap(indexToRow_, other.indexToRow_);
295
- std::swap(rowToIndex_, other.rowToIndex_);
296
- std::swap(rowSwapped_, other.rowSwapped_);
297
- return *this;
298
- }
299
-
300
- template<class Column_type>
301
- inline void Vector_matrix<Column_type>::_clear_column(index columnIndex)
302
- {
303
- matrix_.at(columnIndex).clear();
304
- }
305
-
306
- template<class Column_type>
307
- inline void Vector_matrix<Column_type>::_orderRows()
308
- {
309
- for (unsigned int i = 0; i < matrix_.size(); i++){
310
- matrix_.at(i).reorder(rowToIndex_);
311
- }
312
- for (unsigned int i = 0; i < matrix_.size(); i++){
313
- indexToRow_.at(i) = i;
314
- rowToIndex_.at(i) = i;
315
- }
316
- rowSwapped_ = false;
317
- }
318
-
319
- template<class Column_type>
320
- inline void swap(Vector_matrix<Column_type>& matrix1, Vector_matrix<Column_type>& matrix2)
321
- {
322
- std::swap(matrix1.matrix_, matrix2.matrix_);
323
- std::swap(matrix1.maxDim_, matrix2.maxDim_);
324
- std::swap(matrix1.indexToRow_, matrix2.indexToRow_);
325
- std::swap(matrix1.rowToIndex_, matrix2.rowToIndex_);
326
- std::swap(matrix1.rowSwapped_, matrix2.rowSwapped_);
327
- }
328
-
329
- } //namespace Vineyard
330
-
331
- #endif // VECTOR_MATRIX_H
1
+ /* This file is part of the MMA Library - https://gitlab.inria.fr/dloiseau/multipers - which is released under MIT.
2
+ * See file LICENSE for full license details.
3
+ * Author(s): Hannah Schreiber
4
+ *
5
+ * Copyright (C) 2022 Inria
6
+ *
7
+ * Modification(s):
8
+ * - YYYY/MM Author: Description of the modification
9
+ */
10
+
11
+ #ifndef VECTOR_MATRIX_H
12
+ #define VECTOR_MATRIX_H
13
+
14
+ #include <utility>
15
+ #include <vector>
16
+ #include <unordered_map>
17
+ #include <iostream>
18
+ #include <algorithm>
19
+
20
+ #include "utilities.h" //type definitions
21
+
22
+ namespace Gudhi::multiparameter::mma {
23
+
24
+ template<class Column_type>
25
+ class Vector_matrix
26
+ {
27
+ public:
28
+ Vector_matrix();
29
+ Vector_matrix(std::vector<boundary_type>& orderedBoundaries);
30
+ Vector_matrix(unsigned int numberOfColumns);
31
+ Vector_matrix(Vector_matrix<Column_type>& matrixToCopy);
32
+ Vector_matrix(Vector_matrix&& other) noexcept;
33
+
34
+ void insert_boundary(index columnIndex, boundary_type& boundary);
35
+ void get_boundary(index columnIndex, boundary_type& container);
36
+ void insert_column(index columnIndex, Column_type column);
37
+ Column_type& get_column(index columnIndex);
38
+
39
+ void reduce(barcode_type& barcode);
40
+
41
+ index get_last_index() const;
42
+ dimension_type get_max_dim() const;
43
+ unsigned int get_number_of_columns() const;
44
+
45
+ void swap_columns(index columnIndex1, index columnIndex2);
46
+ void swap_rows(index rowIndex1, index rowIndex2);
47
+ void swap_at_indices(index index1, index index2);
48
+
49
+ void zero_cell(index columnIndex, index rowIndex);
50
+ void zero_column(index columnIndex);
51
+
52
+ void add_to(index sourceColumnIndex, index targetColumnIndex);
53
+ bool is_zero_cell(index columnIndex, index rowIndex) const;
54
+ bool is_zero_column(index columnIndex);
55
+
56
+ dimension_type get_column_dimension(index columnIndex) const;
57
+
58
+ Vector_matrix<Column_type>& operator=(Vector_matrix<Column_type> other);
59
+ template<class Friend_column_type>
60
+ friend void swap(Vector_matrix<Friend_column_type>& matrix1,
61
+ Vector_matrix<Friend_column_type>& matrix2);
62
+
63
+ private:
64
+ std::vector<Column_type> matrix_;
65
+ dimension_type maxDim_;
66
+ std::vector<unsigned int> indexToRow_;
67
+ std::vector<index> rowToIndex_;
68
+ bool rowSwapped_;
69
+
70
+ void _clear_column(index columnIndex);
71
+ void _orderRows();
72
+ };
73
+
74
+ template<class Column_type>
75
+ inline Vector_matrix<Column_type>::Vector_matrix() : maxDim_(0), rowSwapped_(false)
76
+ {}
77
+
78
+ template<class Column_type>
79
+ inline Vector_matrix<Column_type>::Vector_matrix(
80
+ std::vector<boundary_type>& orderedBoundaries) : maxDim_(0), rowSwapped_(false)
81
+ {
82
+ matrix_.resize(orderedBoundaries.size());
83
+ indexToRow_.resize(orderedBoundaries.size());
84
+ rowToIndex_.resize(orderedBoundaries.size());
85
+ for (unsigned int i = 0; i < orderedBoundaries.size(); i++){
86
+ boundary_type& b = orderedBoundaries.at(i);
87
+ matrix_.at(i) = Column_type(b);
88
+ if (maxDim_ < static_cast<int>(b.size()) - 1) maxDim_ = b.size() - 1;
89
+ indexToRow_.at(i) = i;
90
+ rowToIndex_.at(i) = i;
91
+ }
92
+ if (maxDim_ == -1) maxDim_ = 0;
93
+ }
94
+
95
+ template<class Column_type>
96
+ inline Vector_matrix<Column_type>::Vector_matrix(unsigned int numberOfColumns)
97
+ : maxDim_(0), rowSwapped_(false)
98
+ {
99
+ matrix_.resize(numberOfColumns);
100
+ indexToRow_.resize(numberOfColumns);
101
+ rowToIndex_.resize(numberOfColumns);
102
+ for (unsigned int i = 0; i < numberOfColumns; i++){
103
+ indexToRow_.at(i) = i;
104
+ rowToIndex_.at(i) = i;
105
+ }
106
+ }
107
+
108
+ template<class Column_type>
109
+ inline Vector_matrix<Column_type>::Vector_matrix(
110
+ Vector_matrix<Column_type>& matrixToCopy) : maxDim_(0), rowSwapped_(false)
111
+ {
112
+ matrix_.resize(matrixToCopy.get_number_of_columns());
113
+ indexToRow_.resize(matrix_.size());
114
+ rowToIndex_.resize(matrix_.size());
115
+ for (unsigned int i = 0; i < matrix_.size(); i++){
116
+ matrix_.at(i) = Column_type(matrixToCopy.get_column(i));
117
+ indexToRow_.at(i) = i;
118
+ rowToIndex_.at(i) = i;
119
+ }
120
+ maxDim_ = matrixToCopy.get_max_dim();
121
+ }
122
+
123
+ template<class Column_type>
124
+ inline Vector_matrix<Column_type>::Vector_matrix(Vector_matrix<Column_type> &&other) noexcept
125
+ : matrix_(std::move(other.matrix_)),
126
+ maxDim_(std::exchange(other.maxDim_, 0)),
127
+ indexToRow_(std::move(other.indexToRow_)),
128
+ rowToIndex_(std::move(other.rowToIndex_)),
129
+ rowSwapped_(std::exchange(other.rowSwapped_, 0))
130
+ {}
131
+
132
+ template<class Column_type>
133
+ inline void Vector_matrix<Column_type>::insert_boundary(
134
+ index columnIndex, boundary_type& boundary)
135
+ {
136
+ if (rowSwapped_) _orderRows();
137
+
138
+ if (matrix_.size() <= columnIndex) {
139
+ for (int i = matrix_.size(); i <= columnIndex; i++){
140
+ indexToRow_.push_back(i);
141
+ rowToIndex_.push_back(i);
142
+ }
143
+ matrix_.resize(columnIndex + 1);
144
+ }
145
+ matrix_.at(columnIndex) = Column_type(boundary);
146
+ if (maxDim_ < boundary.size() - 1) maxDim_ = boundary.size() - 1;
147
+ }
148
+
149
+ template<class Column_type>
150
+ inline void Vector_matrix<Column_type>::get_boundary(
151
+ index columnIndex, boundary_type& container)
152
+ {
153
+ matrix_.at(columnIndex).get_content(container);
154
+ for (unsigned int& v : container) v = rowToIndex_.at(v);
155
+ std::sort(container.begin(), container.end());
156
+ }
157
+
158
+ template<class Column_type>
159
+ inline void Vector_matrix<Column_type>::insert_column(
160
+ index columnIndex, Column_type column)
161
+ {
162
+ if (rowSwapped_) _orderRows();
163
+
164
+ dimension_type dim = column.get_dimension();
165
+ if (matrix_.size() <= columnIndex) {
166
+ for (unsigned int i = matrix_.size(); i <= columnIndex; i++){
167
+ indexToRow_.push_back(i);
168
+ rowToIndex_.push_back(i);
169
+ }
170
+ matrix_.resize(columnIndex + 1);
171
+ }
172
+ std::swap(matrix_.at(columnIndex), column);
173
+ if (maxDim_ < dim) maxDim_ = dim;
174
+ }
175
+
176
+ template<class Column_type>
177
+ inline Column_type& Vector_matrix<Column_type>::get_column(index columnIndex)
178
+ {
179
+ if (rowSwapped_) _orderRows();
180
+ return matrix_.at(columnIndex);
181
+ }
182
+
183
+ template<class Column_type>
184
+ inline void Vector_matrix<Column_type>::reduce(barcode_type& barcode)
185
+ {
186
+ if (rowSwapped_) _orderRows();
187
+ std::unordered_map<index, index> pivotsToColumn;
188
+
189
+ for (int d = maxDim_; d > 0; d--){
190
+ for (unsigned int i = 0; i < matrix_.size(); i++){
191
+ if (!(matrix_.at(i).is_empty()) && matrix_.at(i).get_dimension() == d)
192
+ {
193
+ Column_type &curr = matrix_.at(i);
194
+ int pivot = curr.get_pivot();
195
+
196
+ while (pivot != -1 && pivotsToColumn.find(pivot) != pivotsToColumn.end()){
197
+ curr.add(matrix_.at(pivotsToColumn.at(pivot)));
198
+ pivot = curr.get_pivot();
199
+ }
200
+
201
+ if (pivot != -1){
202
+ pivotsToColumn.emplace(pivot, i);
203
+ _clear_column(pivot);
204
+ barcode.push_back(Bar(d - 1, pivot, i));
205
+ } else {
206
+ _clear_column(i);
207
+ }
208
+ }
209
+ }
210
+ }
211
+ }
212
+
213
+ template<class Column_type>
214
+ inline index Vector_matrix<Column_type>::get_last_index() const
215
+ {
216
+ return matrix_.size() - 1;
217
+ }
218
+
219
+ template<class Column_type>
220
+ inline dimension_type Vector_matrix<Column_type>::get_max_dim() const
221
+ {
222
+ return maxDim_;
223
+ }
224
+
225
+ template<class Column_type>
226
+ inline unsigned int Vector_matrix<Column_type>::get_number_of_columns() const
227
+ {
228
+ return matrix_.size();
229
+ }
230
+
231
+ template<class Column_type>
232
+ inline void Vector_matrix<Column_type>::swap_columns(index columnIndex1, index columnIndex2)
233
+ {
234
+ std::swap(matrix_.at(columnIndex1), matrix_.at(columnIndex2));
235
+ }
236
+
237
+ template<class Column_type>
238
+ inline void Vector_matrix<Column_type>::swap_rows(index rowIndex1, index rowIndex2)
239
+ {
240
+ rowSwapped_ = true;
241
+ std::swap(rowToIndex_.at(indexToRow_.at(rowIndex1)), rowToIndex_.at(indexToRow_.at(rowIndex2)));
242
+ std::swap(indexToRow_.at(rowIndex1), indexToRow_.at(rowIndex2));
243
+ }
244
+
245
+ template<class Column_type>
246
+ inline void Vector_matrix<Column_type>::swap_at_indices(index index1, index index2)
247
+ {
248
+ swap_columns(index1, index2);
249
+ swap_rows(index1, index2);
250
+ }
251
+
252
+ template<class Column_type>
253
+ inline void Vector_matrix<Column_type>::zero_cell(index columnIndex, index rowIndex)
254
+ {
255
+ matrix_.at(columnIndex).clear(indexToRow_.at(rowIndex));
256
+ }
257
+
258
+ template<class Column_type>
259
+ inline void Vector_matrix<Column_type>::zero_column(index columnIndex)
260
+ {
261
+ _clear_column(columnIndex);
262
+ }
263
+
264
+ template<class Column_type>
265
+ inline void Vector_matrix<Column_type>::add_to(index sourceColumnIndex, index targetColumnIndex)
266
+ {
267
+ matrix_.at(targetColumnIndex).add(matrix_.at(sourceColumnIndex));
268
+ }
269
+
270
+ template<class Column_type>
271
+ inline bool Vector_matrix<Column_type>::is_zero_cell(index columnIndex, index rowIndex) const
272
+ {
273
+ return !(matrix_.at(columnIndex).contains(indexToRow_.at(rowIndex)));
274
+ }
275
+
276
+ template<class Column_type>
277
+ inline bool Vector_matrix<Column_type>::is_zero_column(index columnIndex)
278
+ {
279
+ return matrix_.at(columnIndex).is_empty();
280
+ }
281
+
282
+ template<class Column_type>
283
+ inline dimension_type Vector_matrix<Column_type>::get_column_dimension(index columnIndex) const
284
+ {
285
+ return matrix_.at(columnIndex).get_dimension();
286
+ }
287
+
288
+ template<class Column_type>
289
+ inline Vector_matrix<Column_type> &Vector_matrix<Column_type>::operator=(
290
+ Vector_matrix<Column_type> other)
291
+ {
292
+ std::swap(matrix_, other.matrix_);
293
+ std::swap(maxDim_, other.maxDim_);
294
+ std::swap(indexToRow_, other.indexToRow_);
295
+ std::swap(rowToIndex_, other.rowToIndex_);
296
+ std::swap(rowSwapped_, other.rowSwapped_);
297
+ return *this;
298
+ }
299
+
300
+ template<class Column_type>
301
+ inline void Vector_matrix<Column_type>::_clear_column(index columnIndex)
302
+ {
303
+ matrix_.at(columnIndex).clear();
304
+ }
305
+
306
+ template<class Column_type>
307
+ inline void Vector_matrix<Column_type>::_orderRows()
308
+ {
309
+ for (unsigned int i = 0; i < matrix_.size(); i++){
310
+ matrix_.at(i).reorder(rowToIndex_);
311
+ }
312
+ for (unsigned int i = 0; i < matrix_.size(); i++){
313
+ indexToRow_.at(i) = i;
314
+ rowToIndex_.at(i) = i;
315
+ }
316
+ rowSwapped_ = false;
317
+ }
318
+
319
+ template<class Column_type>
320
+ inline void swap(Vector_matrix<Column_type>& matrix1, Vector_matrix<Column_type>& matrix2)
321
+ {
322
+ std::swap(matrix1.matrix_, matrix2.matrix_);
323
+ std::swap(matrix1.maxDim_, matrix2.maxDim_);
324
+ std::swap(matrix1.indexToRow_, matrix2.indexToRow_);
325
+ std::swap(matrix1.rowToIndex_, matrix2.rowToIndex_);
326
+ std::swap(matrix1.rowSwapped_, matrix2.rowSwapped_);
327
+ }
328
+
329
+ } //namespace Vineyard
330
+
331
+ #endif // VECTOR_MATRIX_H