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
multipers/gudhi/scc_io.h CHANGED
@@ -1,289 +1,310 @@
1
- #ifndef MULTIPERS_SCC_IO_H
2
- #define MULTIPERS_SCC_IO_H
3
-
4
- #include <algorithm>
5
- #include <cassert>
6
- #include <cstddef>
7
- #include <ostream>
8
- #include <fstream>
9
- #include <iostream>
10
- #include <stdexcept>
11
- #include <string>
12
- #include <vector>
13
- #include <limits>
14
- #include <iomanip>
15
- #include <cmath>
16
-
17
- template <class Slicer>
18
- inline Slicer read_scc_file(const std::string& inFilePath,
19
- bool isRivetCompatible = false,
20
- bool isReversed = false,
21
- int shiftDimensions = 0) {
22
- using Filtration_value = typename Slicer::Filtration_value;
23
-
24
- std::string line;
25
- std::ifstream file(inFilePath);
26
- Slicer slicer;
27
- unsigned int numberOfParameters;
28
-
29
- if (file.is_open()) {
30
- auto error = [&file](std::string msg){
31
- file.close();
32
- throw std::invalid_argument(msg);
33
- };
34
- auto is_comment_or_empty_line = [](const std::string& line)->bool{
35
- size_t current = line.find_first_not_of(' ', 0);
36
- if (current == std::string::npos) return true; // is empty line
37
- if (line[current] == '#') return true; // is comment
38
- return false;
39
- };
40
-
41
- while (getline(file, line, '\n') && is_comment_or_empty_line(line));
42
- if (!file) error("Empty file!");
43
-
44
- if (isRivetCompatible && line.compare("firep") != 0) error("Wrong file format. Should start with 'firep'.");
45
- if (!isRivetCompatible && line.compare("scc2020") != 0) error("Wrong file format. Should start with 'scc2020'.");
46
-
47
- while (getline(file, line, '\n') && is_comment_or_empty_line(line));
48
- if (!file) error("Premature ending of the file. Stops before numbers of parameters.");
49
-
50
- if (isRivetCompatible){
51
- numberOfParameters = 2;
52
- getline(file, line, '\n'); //second rivet label
53
- } else {
54
- std::size_t current = line.find_first_not_of(' ', 0);
55
- std::size_t next = line.find_first_of(' ', current);
56
- numberOfParameters = std::stoi(line.substr(current, next - current));
57
- }
58
-
59
- while (getline(file, line, '\n') && is_comment_or_empty_line(line));
60
- if (!file) error("Premature ending of the file. Not a single cell was specified.");
61
-
62
- std::vector<unsigned int> counts;
63
- unsigned int numberOfCells = 0;
64
- counts.reserve(line.size() + shiftDimensions);
65
- std::size_t current = line.find_first_not_of(' ', 0);
66
- if (shiftDimensions != 0 && isReversed && current != std::string::npos){
67
- if (shiftDimensions > 0){
68
- counts.resize(shiftDimensions, 0);}
69
- else {
70
- for (int i = shiftDimensions; i < 0 && current != std::string::npos; ++i){
71
- std::size_t next = line.find_first_of(' ', current);
72
- current = line.find_first_not_of(' ', next);
73
- }
74
- }
75
- }
76
- while (current != std::string::npos) {
77
- std::size_t next = line.find_first_of(' ', current);
78
- counts.push_back(std::stoi(line.substr(current, next - current)));
79
- numberOfCells += counts.back();
80
- current = line.find_first_not_of(' ', next);
81
- }
82
- if (shiftDimensions != 0 && !isReversed) {
83
- counts.resize(counts.size() + shiftDimensions, 0);
84
- }
85
-
86
- std::size_t dimIt = 0;
87
- while (dimIt < counts.size() && counts[dimIt] == 0) ++dimIt;
88
-
89
- if (dimIt == counts.size()) return slicer;
90
-
91
- std::size_t shift = isReversed ? 0 : counts[dimIt];
92
- unsigned int nextShift = isReversed ? 0 : counts.size() == 1 ? 0 : counts[dimIt + 1];
93
- unsigned int tmpNextShift = counts[dimIt];
94
-
95
- auto get_boundary = [&isReversed, &numberOfCells](const std::string& line,
96
- std::size_t start,
97
- std::size_t shift) -> std::vector<unsigned int> {
98
- std::vector<unsigned int> res;
99
- res.reserve(line.size() - start);
100
- std::size_t current = line.find_first_not_of(' ', start);
101
- while (current != std::string::npos) {
102
- std::size_t next = line.find_first_of(' ', current);
103
- unsigned int idx = std::stoi(line.substr(current, next - current)) + shift;
104
- res.push_back(isReversed ? idx : numberOfCells - 1 - idx);
105
- current = line.find_first_not_of(' ', next);
106
- }
107
- std::sort(res.begin(), res.end());
108
- return res;
109
- };
110
- auto get_filtration_value = [](const std::string& line, std::size_t end)->Filtration_value{
111
- Filtration_value res(0);
112
- res.reserve(end);
113
- bool isPlusInf = true;
114
- bool isMinusInf = true;
115
- std::size_t current = line.find_first_not_of(' ', 0);
116
- while (current < end) {
117
- std::size_t next = line.find_first_of(' ', current);
118
- res.push_back(std::stod(line.substr(current, next - current)));
119
- if (isPlusInf && res.back() != Filtration_value::T_inf) isPlusInf = false;
120
- if (isMinusInf && res.back() != -Filtration_value::T_inf) isMinusInf = false;
121
- current = line.find_first_not_of(' ', next);
122
- }
123
- if (isPlusInf) res = Filtration_value::inf();
124
- if (isMinusInf) res = Filtration_value::minus_inf();
125
- return res;
126
- };
127
-
128
- std::vector<std::vector<unsigned int> > generator_maps(numberOfCells);
129
- std::vector<int> generator_dimensions(numberOfCells);
130
- std::vector<typename Slicer::Filtration_value> generator_filtrations(numberOfCells);
131
- std::size_t i = 0;
132
- //because of possible negative dimension shifts, the document should not always be read to the end
133
- //therefore `dimIt < counts.size()` is also a stop condition
134
- while (getline(file, line, '\n') && dimIt < counts.size()){
135
- if (!is_comment_or_empty_line(line)){
136
- std::size_t sep = line.find_first_of(';', 0);
137
- generator_filtrations[i] = get_filtration_value(line, sep);
138
- if (generator_filtrations[i].is_finite() && generator_filtrations[i].num_parameters() != numberOfParameters)
139
- error("Wrong format. The number of parameters does not match.");
140
- generator_maps[i] = get_boundary(line, sep + 1, shift);
141
- generator_dimensions[i] = isReversed ? dimIt : counts.size() - 1 - dimIt;
142
-
143
- --counts[dimIt];
144
- while (dimIt < counts.size() && counts[dimIt] == 0){
145
- ++dimIt;
146
- if (dimIt != counts.size()) {
147
- shift += nextShift;
148
- nextShift = isReversed ? tmpNextShift : dimIt < counts.size() - 1 ? counts[dimIt + 1] : 0;
149
- tmpNextShift = counts[dimIt];
150
- }
151
- }
152
- ++i;
153
- }
154
- }
155
-
156
- if (!isReversed){ //to order by dimension
157
- std::reverse(generator_dimensions.begin(), generator_dimensions.end());
158
- std::reverse(generator_maps.begin(), generator_maps.end());
159
- std::reverse(generator_filtrations.begin(), generator_filtrations.end());
160
- }
161
-
162
- slicer = Slicer(generator_maps, generator_dimensions, generator_filtrations);
163
-
164
- file.close();
165
- } else {
166
- std::cerr << "Unable to open input file: " << inFilePath << std::endl;
167
- file.setstate(std::ios::failbit);
168
- }
169
-
170
- return slicer;
171
- };
172
-
173
- template <class Slicer>
174
- inline void write_scc_file(const std::string& outFilePath,
175
- const Slicer& slicer,
176
- int numberOfParameters = -1,
177
- int degree = -1,
178
- bool rivetCompatible = false,
179
- bool IgnoreLastGenerators = false,
180
- bool stripComments = false,
181
- bool reverse = false) {
182
- if (numberOfParameters < 0){
183
- numberOfParameters = slicer.num_parameters();
184
- }
185
- assert(numberOfParameters > 0 && "Invalid number of parameters!");
186
-
187
- std::ofstream file(outFilePath);
188
-
189
- if (rivetCompatible) file << "firep\n";
190
- else file << "scc2020\n";
191
-
192
- if (!stripComments && !rivetCompatible)
193
- file << "# This file was generated by multipers (https://github.com/DavidLapous/multipers).\n";
194
-
195
- if (!stripComments && !rivetCompatible) file << "# Number of parameters\n";
196
-
197
- if (rivetCompatible){
198
- assert(numberOfParameters == 2 && "Rivet only handles bifiltrations.");
199
- file << "Filtration 1\n";
200
- file << "Filtration 2\n";
201
- } else {
202
- file << std::to_string(numberOfParameters) << "\n";
203
- }
204
-
205
- if (!stripComments) file << "# Sizes of generating sets\n";
206
-
207
- using Filtration_value = typename Slicer::Filtration_value;
208
-
209
- const auto& boundaries = slicer.get_structure();
210
- int maxDim = boundaries.max_dimension();
211
- int minDim = maxDim;
212
-
213
- std::vector<std::vector<std::size_t> > indicesByDim(maxDim + 1);
214
- std::vector<std::size_t> shiftedIndices(boundaries.size());
215
- for (std::size_t i = 0; i < boundaries.size(); ++i) {
216
- auto dim = boundaries.dimension(i);
217
- minDim = dim < minDim ? dim : minDim;
218
- auto& atDim = indicesByDim[reverse ? dim : maxDim - dim];
219
- shiftedIndices[i] = atDim.size();
220
- atDim.push_back(i);
221
- }
222
- if (degree < 0) degree = minDim;
223
- int minIndex = reverse ? degree - 1 : 0;
224
- int maxIndex = reverse ? maxDim : maxDim - degree + 1;
225
- if (maxIndex < -1) maxIndex = -1;
226
- if (rivetCompatible || IgnoreLastGenerators) maxIndex--;
227
-
228
- auto print_fil_values = [&](const Filtration_value& fil) {
229
- if (fil.is_finite()) {
230
- assert(fil.size() == static_cast<unsigned int>(numberOfParameters));
231
- for (auto f : fil) file << f << " ";
232
- } else {
233
- assert(fil.size() == 1);
234
- for (int p = 0; p < numberOfParameters; ++p) file << fil[0] << " ";
235
- }
236
- };
237
-
238
- if (minIndex < 0) file << 0 << " ";
239
- for (int i = 0; i < minIndex; ++i) file << 0 << " ";
240
- for (int i = std::max(minIndex, 0); i <= std::min(maxDim, maxIndex); ++i) {
241
- file << indicesByDim[i].size() << " ";
242
- }
243
- for (int i = maxIndex + 1; i <= maxDim; ++i) file << 0 << " ";
244
- if (maxIndex > maxDim) file << 0;
245
- file << "\n";
246
-
247
- file << std::setprecision(std::numeric_limits<typename Filtration_value::value_type>::digits);
248
-
249
- std::size_t startIndex = reverse ? minIndex + 1 : minIndex;
250
- std::size_t endIndex = reverse ? maxIndex : maxIndex - 1;
251
- const auto& filtValues = slicer.get_filtrations();
252
- int currDim;
253
- if (reverse) currDim = minIndex == -1 ? 0 : minIndex;
254
- else currDim = maxIndex == maxDim + 1 ? maxDim + 1 : maxDim;
255
-
256
- if (reverse){
257
- if (!stripComments) file << "# Block of dimension " << currDim++ << "\n";
258
- if (minIndex >= 0) {
259
- for (auto index : indicesByDim[minIndex]) {
260
- print_fil_values(filtValues[index]);
261
- file << ";\n";
262
- }
263
- }
264
- }
265
- for (std::size_t i = startIndex; i <= endIndex; ++i) {
266
- if (!stripComments) {
267
- file << "# Block of dimension " << currDim << "\n";
268
- if (reverse) ++currDim;
269
- else --currDim;
270
- }
271
- for (auto index : indicesByDim[i]) {
272
- print_fil_values(filtValues[index]);
273
- file << "; ";
274
- for (auto b : boundaries[index]) file << shiftedIndices[b] << " ";
275
- file << "\n";
276
- }
277
- }
278
- if (!reverse){
279
- if (!stripComments) file << "# Block of dimension " << currDim << "\n";
280
- if (maxIndex <= maxDim) {
281
- for (auto index : indicesByDim[maxIndex]) {
282
- print_fil_values(filtValues[index]);
283
- file << ";\n";
284
- }
285
- }
286
- }
287
- };
288
-
289
- #endif // MULTIPERS_SCC_IO_H
1
+ #ifndef MULTIPERS_SCC_IO_H
2
+ #define MULTIPERS_SCC_IO_H
3
+
4
+ #include <algorithm>
5
+ #include <cassert>
6
+ #include <cstddef>
7
+ #include <ostream>
8
+ #include <fstream>
9
+ #include <iostream>
10
+ #include <stdexcept>
11
+ #include <string>
12
+ #include <vector>
13
+ #include <limits>
14
+ #include <iomanip>
15
+ #include <cmath>
16
+
17
+ template <class Slicer>
18
+ inline Slicer read_scc_file(const std::string& inFilePath,
19
+ bool isRivetCompatible = false,
20
+ bool isReversed = false,
21
+ int shiftDimensions = 0) {
22
+ using Filtration_value = typename Slicer::Filtration_value;
23
+
24
+ std::string line;
25
+ std::ifstream file(inFilePath);
26
+ Slicer slicer;
27
+ unsigned int numberOfParameters;
28
+
29
+ if (file.is_open()) {
30
+ auto error = [&file](std::string msg) {
31
+ file.close();
32
+ throw std::invalid_argument(msg);
33
+ };
34
+ auto is_comment_or_empty_line = [](const std::string& line) -> bool {
35
+ size_t current = line.find_first_not_of(' ', 0);
36
+ if (current == std::string::npos) return true; // is empty line
37
+ if (line[current] == '#') return true; // is comment
38
+ return false;
39
+ };
40
+
41
+ while (getline(file, line, '\n') && is_comment_or_empty_line(line));
42
+ if (!file) error("Empty file!");
43
+
44
+ if (isRivetCompatible && line.compare("firep") != 0) error("Wrong file format. Should start with 'firep'.");
45
+ if (!isRivetCompatible && line.compare("scc2020") != 0) error("Wrong file format. Should start with 'scc2020'.");
46
+
47
+ while (getline(file, line, '\n') && is_comment_or_empty_line(line));
48
+ if (!file) error("Premature ending of the file. Stops before numbers of parameters.");
49
+
50
+ if (isRivetCompatible) {
51
+ numberOfParameters = 2;
52
+ getline(file, line, '\n'); // second rivet label
53
+ } else {
54
+ std::size_t current = line.find_first_not_of(' ', 0);
55
+ std::size_t next = line.find_first_of(' ', current);
56
+ numberOfParameters = std::stoi(line.substr(current, next - current));
57
+ }
58
+
59
+ while (getline(file, line, '\n') && is_comment_or_empty_line(line));
60
+ if (!file) error("Premature ending of the file. Not a single cell was specified.");
61
+
62
+ std::vector<unsigned int> counts;
63
+ unsigned int numberOfCells = 0;
64
+ counts.reserve(line.size() + shiftDimensions);
65
+ std::size_t current = line.find_first_not_of(' ', 0);
66
+ if (shiftDimensions != 0 && isReversed && current != std::string::npos) {
67
+ if (shiftDimensions > 0) {
68
+ counts.resize(shiftDimensions, 0);
69
+ } else {
70
+ for (int i = shiftDimensions; i < 0 && current != std::string::npos; ++i) {
71
+ std::size_t next = line.find_first_of(' ', current);
72
+ current = line.find_first_not_of(' ', next);
73
+ }
74
+ }
75
+ }
76
+ while (current != std::string::npos) {
77
+ std::size_t next = line.find_first_of(' ', current);
78
+ counts.push_back(std::stoi(line.substr(current, next - current)));
79
+ numberOfCells += counts.back();
80
+ current = line.find_first_not_of(' ', next);
81
+ }
82
+ if (shiftDimensions != 0 && !isReversed) {
83
+ counts.resize(counts.size() + shiftDimensions, 0);
84
+ }
85
+
86
+ std::size_t dimIt = 0;
87
+ while (dimIt < counts.size() && counts[dimIt] == 0) ++dimIt;
88
+
89
+ if (dimIt == counts.size()) return slicer;
90
+
91
+ std::size_t shift = isReversed ? 0 : counts[dimIt];
92
+ unsigned int nextShift = isReversed ? 0 : counts.size() == 1 ? 0 : counts[dimIt + 1];
93
+ unsigned int tmpNextShift = counts[dimIt];
94
+
95
+ auto get_boundary = [&isReversed, &numberOfCells](const std::string& line,
96
+ std::size_t start,
97
+ std::size_t shift) -> std::vector<unsigned int> {
98
+ std::vector<unsigned int> res;
99
+ res.reserve(line.size() - start);
100
+ std::size_t current = line.find_first_not_of(' ', start);
101
+ while (current != std::string::npos) {
102
+ std::size_t next = line.find_first_of(' ', current);
103
+ unsigned int idx = std::stoi(line.substr(current, next - current)) + shift;
104
+ res.push_back(isReversed ? idx : numberOfCells - 1 - idx);
105
+ current = line.find_first_not_of(' ', next);
106
+ }
107
+ std::sort(res.begin(), res.end());
108
+ return res;
109
+ };
110
+ auto get_filtration_value = [](const std::string& line, std::size_t end) -> Filtration_value {
111
+ Filtration_value res(0);
112
+ res.reserve(end);
113
+ bool isPlusInf = true;
114
+ bool isMinusInf = true;
115
+ std::size_t current = line.find_first_not_of(' ', 0);
116
+ while (current < end) {
117
+ std::size_t next = line.find_first_of(' ', current);
118
+ res.push_back(std::stod(line.substr(current, next - current)));
119
+ if (isPlusInf && res.back() != Filtration_value::T_inf) isPlusInf = false;
120
+ if (isMinusInf && res.back() != -Filtration_value::T_inf) isMinusInf = false;
121
+ current = line.find_first_not_of(' ', next);
122
+ }
123
+ if (isPlusInf) res = Filtration_value::inf();
124
+ if (isMinusInf) res = Filtration_value::minus_inf();
125
+ return res;
126
+ };
127
+
128
+ std::vector<std::vector<unsigned int> > generator_maps(numberOfCells);
129
+ std::vector<int> generator_dimensions(numberOfCells);
130
+ std::vector<typename Slicer::Filtration_value> generator_filtrations(numberOfCells);
131
+ std::size_t i = 0;
132
+ // because of possible negative dimension shifts, the document should not always be read to the end
133
+ // therefore `dimIt < counts.size()` is also a stop condition
134
+ while (getline(file, line, '\n') && dimIt < counts.size()) {
135
+ if (!is_comment_or_empty_line(line)) {
136
+ std::size_t sep = line.find_first_of(';', 0);
137
+ generator_filtrations[i] = get_filtration_value(line, sep);
138
+ if (generator_filtrations[i].is_finite() && generator_filtrations[i].num_parameters() != numberOfParameters)
139
+ error("Wrong format. The number of parameters does not match.");
140
+ generator_maps[i] = get_boundary(line, sep + 1, shift);
141
+ generator_dimensions[i] = isReversed ? dimIt : counts.size() - 1 - dimIt;
142
+
143
+ --counts[dimIt];
144
+ while (dimIt < counts.size() && counts[dimIt] == 0) {
145
+ ++dimIt;
146
+ if (dimIt != counts.size()) {
147
+ shift += nextShift;
148
+ nextShift = isReversed ? tmpNextShift : dimIt < counts.size() - 1 ? counts[dimIt + 1] : 0;
149
+ tmpNextShift = counts[dimIt];
150
+ }
151
+ }
152
+ ++i;
153
+ }
154
+ }
155
+
156
+ if (!isReversed) { // to order by dimension
157
+ std::reverse(generator_dimensions.begin(), generator_dimensions.end());
158
+ std::reverse(generator_maps.begin(), generator_maps.end());
159
+ std::reverse(generator_filtrations.begin(), generator_filtrations.end());
160
+ }
161
+
162
+ slicer = Slicer(generator_maps, generator_dimensions, generator_filtrations);
163
+
164
+ file.close();
165
+ } else {
166
+ std::cerr << "Unable to open input file: " << inFilePath << std::endl;
167
+ file.setstate(std::ios::failbit);
168
+ }
169
+
170
+ return slicer;
171
+ };
172
+
173
+ template <class Slicer>
174
+ inline void write_scc_file(const std::string& outFilePath,
175
+ const Slicer& slicer,
176
+ int numberOfParameters = -1,
177
+ int degree = -1,
178
+ bool rivetCompatible = false,
179
+ bool IgnoreLastGenerators = false,
180
+ bool stripComments = false,
181
+ bool reverse = false) {
182
+ constexpr bool verbose = false;
183
+ if (numberOfParameters < 0) {
184
+ numberOfParameters = slicer.num_parameters();
185
+ }
186
+ assert(numberOfParameters > 0 && "Invalid number of parameters!");
187
+
188
+ std::ofstream file(outFilePath);
189
+
190
+ if (rivetCompatible)
191
+ file << "firep\n";
192
+ else
193
+ file << "scc2020\n";
194
+
195
+ if (!stripComments && !rivetCompatible)
196
+ file << "# This file was generated by multipers (https://github.com/DavidLapous/multipers).\n";
197
+
198
+ if (!stripComments && !rivetCompatible) file << "# Number of parameters\n";
199
+
200
+ if (rivetCompatible) {
201
+ assert(numberOfParameters == 2 && "Rivet only handles bifiltrations.");
202
+ file << "Filtration 1\n";
203
+ file << "Filtration 2\n";
204
+ } else {
205
+ file << std::to_string(numberOfParameters) << "\n";
206
+ }
207
+
208
+ if (!stripComments) file << "# Sizes of generating sets\n";
209
+
210
+ using Filtration_value = typename Slicer::Filtration_value;
211
+
212
+ const auto& boundaries = slicer.get_structure();
213
+ int maxDim = boundaries.max_dimension();
214
+ int minDim = maxDim;
215
+
216
+ std::vector<std::vector<std::size_t> > indicesByDim(maxDim + 1);
217
+ std::vector<std::size_t> shiftedIndices(boundaries.size());
218
+ for (std::size_t i = 0; i < boundaries.size(); ++i) {
219
+ auto dim = boundaries.dimension(i);
220
+ minDim = dim < minDim ? dim : minDim;
221
+ auto& atDim = indicesByDim[reverse ? dim : maxDim - dim];
222
+ shiftedIndices[i] = atDim.size();
223
+ atDim.push_back(i);
224
+ }
225
+ if (degree < 0) degree = minDim;
226
+ int minIndex = reverse ? degree - 1 : 0;
227
+ int maxIndex = reverse ? maxDim : maxDim - degree + 1;
228
+ if (maxIndex < -1) maxIndex = -1;
229
+ if (IgnoreLastGenerators) maxIndex--;
230
+ if (rivetCompatible)
231
+ minIndex = maxIndex -2;
232
+
233
+ if constexpr (verbose) {
234
+ std::cout << "minDim = " << minDim << " maxDim = " << maxDim << " minIndex = " << minIndex
235
+ << " maxIndex = " << maxIndex << " degree = " << degree << std::endl;
236
+ }
237
+
238
+ auto print_fil_values = [&](const Filtration_value& fil) {
239
+ if (fil.is_finite()) {
240
+ if constexpr (Filtration_value::is_multicritical()) {
241
+ for (const auto& ifil : fil) {
242
+ for (auto f : ifil) file << f << " ";
243
+ }
244
+ } else {
245
+ assert(fil.size() == static_cast<unsigned int>(numberOfParameters));
246
+ for (auto f : fil) file << f << " ";
247
+ }
248
+ } else {
249
+ // assert(fil.size() == 1);
250
+ for (int p = 0; p < numberOfParameters; ++p) file << fil[0] << " ";
251
+ }
252
+ };
253
+
254
+ if (minIndex < 0) file << 0 << " ";
255
+ for (int i = 0; i < minIndex; ++i) file << 0 << " ";
256
+ for (int i = std::max(minIndex, 0); i <= std::min(maxDim, maxIndex); ++i) {
257
+ file << indicesByDim[i].size() << " ";
258
+ }
259
+ if (!rivetCompatible)
260
+ for (int i = maxIndex + 1; i <= maxDim; ++i) file << 0 << " ";
261
+ if (maxIndex > maxDim) file << 0;
262
+ file << "\n";
263
+
264
+ file << std::setprecision(std::numeric_limits<typename Filtration_value::value_type>::digits);
265
+
266
+ std::size_t startIndex = reverse ? minIndex + 1 : minIndex;
267
+ std::size_t endIndex = reverse ? maxIndex : maxIndex - 1;
268
+ const auto& filtValues = slicer.get_filtrations();
269
+ int currDim;
270
+ if (reverse)
271
+ currDim = minIndex == -1 ? 0 : minIndex;
272
+ else
273
+ currDim = maxIndex == maxDim + 1 ? maxDim + 1 : maxDim;
274
+
275
+ if (reverse) {
276
+ if (!stripComments) file << "# Block of dimension " << currDim++ << "\n";
277
+ if (minIndex >= 0) {
278
+ for (auto index : indicesByDim[minIndex]) {
279
+ print_fil_values(filtValues[index]);
280
+ file << ";\n";
281
+ }
282
+ }
283
+ }
284
+ for (std::size_t i = startIndex; i <= endIndex; ++i) {
285
+ if (!stripComments) {
286
+ file << "# Block of dimension " << currDim << "\n";
287
+ if (reverse)
288
+ ++currDim;
289
+ else
290
+ --currDim;
291
+ }
292
+ for (auto index : indicesByDim[i]) {
293
+ print_fil_values(filtValues[index]);
294
+ file << "; ";
295
+ for (auto b : boundaries[index]) file << shiftedIndices[b] << " ";
296
+ file << "\n";
297
+ }
298
+ }
299
+ if (!reverse) {
300
+ if (!stripComments) file << "# Block of dimension " << currDim << "\n";
301
+ if (maxIndex <= maxDim) {
302
+ for (auto index : indicesByDim[maxIndex]) {
303
+ print_fil_values(filtValues[index]);
304
+ file << ";\n";
305
+ }
306
+ }
307
+ }
308
+ };
309
+
310
+ #endif // MULTIPERS_SCC_IO_H