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,420 +1,420 @@
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): Hannah Schreiber
4
- *
5
- * Copyright (C) 2022-24 Inria
6
- *
7
- * Modification(s):
8
- * - YYYY/MM Author: Description of the modification
9
- */
10
-
11
- /**
12
- * @file Zp_field.h
13
- * @author Hannah Schreiber
14
- * @brief Contains the @ref Gudhi::persistence_fields::Zp_field_element class.
15
- */
16
-
17
- #ifndef MATRIX_FIELD_ZP_H_
18
- #define MATRIX_FIELD_ZP_H_
19
-
20
- #include <utility>
21
- #include <array>
22
- #include <limits.h>
23
-
24
- namespace Gudhi {
25
- namespace persistence_fields {
26
-
27
- /**
28
- * @class Zp_field_element Zp_field.h gudhi/Fields/Zp_field.h
29
- * @ingroup persistence_fields
30
- *
31
- * @brief Class representing an element of the \f$ \mathbb{F}_p \f$ field for any prime number \f$ p \f$.
32
- *
33
- * @tparam characteristic Value of the characteristic of the field. Has to be a positive prime number.
34
- * @tparam Unsigned_integer_type A native unsigned integer type: unsigned int, long unsigned int, etc.
35
- * Will be used as the field element type.
36
- */
37
- template <unsigned int characteristic, typename Unsigned_integer_type = unsigned int,
38
- class = std::enable_if_t<std::is_unsigned_v<Unsigned_integer_type> > >
39
- class Zp_field_element {
40
- public:
41
- using Element = Unsigned_integer_type; /**< Type for the elements in the field. */
42
- using Characteristic = Element; /**< Type for the field characteristic. */
43
- template <class T>
44
- using isInteger = std::enable_if_t<std::is_integral_v<T> >;
45
-
46
- /**
47
- * @brief Default constructor. Sets the element to 0.
48
- */
49
- Zp_field_element() : element_(0) { static_assert(_is_prime(), "Characteristic has to be a prime number."); }
50
- /**
51
- * @brief Constructor setting the element to the given value.
52
- *
53
- * @tparam Integer_type A native integer type. Should be able to contain the characteristic if signed.
54
- * @param element Value of the element.
55
- */
56
- template <typename Integer_type, class = isInteger<Integer_type> >
57
- Zp_field_element(Integer_type element) : element_(_get_value(element)) {
58
- static_assert(_is_prime(), "Characteristic has to be a prime number.");
59
- }
60
- /**
61
- * @brief Copy constructor.
62
- *
63
- * @param toCopy Element to copy.
64
- */
65
- Zp_field_element(const Zp_field_element& toCopy) : element_(toCopy.element_) {}
66
- /**
67
- * @brief Move constructor.
68
- *
69
- * @param toMove Element to move.
70
- */
71
- Zp_field_element(Zp_field_element&& toMove) noexcept : element_(std::exchange(toMove.element_, 0)) {}
72
-
73
- /**
74
- * @brief operator+=
75
- */
76
- friend void operator+=(Zp_field_element& f1, const Zp_field_element& f2) {
77
- f1.element_ = Zp_field_element::_add(f1.element_, f2.element_);
78
- }
79
- /**
80
- * @brief operator+
81
- */
82
- friend Zp_field_element operator+(Zp_field_element f1, const Zp_field_element& f2) {
83
- f1 += f2;
84
- return f1;
85
- }
86
- /**
87
- * @brief operator+=
88
- */
89
- template <typename Integer_type, class = isInteger<Integer_type> >
90
- friend void operator+=(Zp_field_element& f, const Integer_type& v) {
91
- f.element_ = Zp_field_element::_add(f.element_, _get_value(v));
92
- }
93
- /**
94
- * @brief operator+
95
- *
96
- * @tparam Integer_type A native integer type. Should be able to contain the characteristic if signed.
97
- */
98
- template <typename Integer_type, class = isInteger<Integer_type> >
99
- friend Zp_field_element operator+(Zp_field_element f, const Integer_type& v) {
100
- f += v;
101
- return f;
102
- }
103
- /**
104
- * @brief operator+
105
- *
106
- * @tparam Integer_type A native integer type. Should be able to contain the characteristic if signed.
107
- */
108
- template <typename Integer_type, class = isInteger<Integer_type> >
109
- friend Integer_type operator+(const Integer_type& v, Zp_field_element f) {
110
- f += v;
111
- return f.element_;
112
- }
113
-
114
- /**
115
- * @brief operator-=
116
- */
117
- friend void operator-=(Zp_field_element& f1, const Zp_field_element& f2) {
118
- f1.element_ = Zp_field_element::_subtract(f1.element_, f2.element_);
119
- }
120
- /**
121
- * @brief operator-
122
- */
123
- friend Zp_field_element operator-(Zp_field_element f1, const Zp_field_element& f2) {
124
- f1 -= f2;
125
- return f1;
126
- }
127
- /**
128
- * @brief operator-=
129
- */
130
- template <typename Integer_type, class = isInteger<Integer_type> >
131
- friend void operator-=(Zp_field_element& f, const Integer_type& v) {
132
- f.element_ = Zp_field_element::_subtract(f.element_, _get_value(v));
133
- }
134
- /**
135
- * @brief operator-
136
- *
137
- * @tparam Integer_type A native integer type. Should be able to contain the characteristic if signed.
138
- */
139
- template <typename Integer_type, class = isInteger<Integer_type> >
140
- friend Zp_field_element operator-(Zp_field_element f, const Integer_type& v) {
141
- f -= v;
142
- return f;
143
- }
144
- /**
145
- * @brief operator-
146
- *
147
- * @tparam Integer_type A native integer type. Should be able to contain the characteristic if signed.
148
- */
149
- template <typename Integer_type, class = isInteger<Integer_type> >
150
- friend Integer_type operator-(const Integer_type& v, const Zp_field_element& f) {
151
- return Zp_field_element::_subtract(_get_value(v), f.element_);
152
- }
153
-
154
- /**
155
- * @brief operator*=
156
- */
157
- friend void operator*=(Zp_field_element& f1, const Zp_field_element& f2) {
158
- f1.element_ = Zp_field_element::_multiply(f1.element_, f2.element_);
159
- }
160
- /**
161
- * @brief operator*
162
- */
163
- friend Zp_field_element operator*(Zp_field_element f1, const Zp_field_element& f2) {
164
- f1 *= f2;
165
- return f1;
166
- }
167
- /**
168
- * @brief operator*=
169
- */
170
- template <typename Integer_type, class = isInteger<Integer_type> >
171
- friend void operator*=(Zp_field_element& f, const Integer_type& v) {
172
- f.element_ = Zp_field_element::_multiply(f.element_, _get_value(v));
173
- }
174
- /**
175
- * @brief operator*
176
- *
177
- * @tparam Integer_type A native integer type. Should be able to contain the characteristic if signed.
178
- */
179
- template <typename Integer_type, class = isInteger<Integer_type> >
180
- friend Zp_field_element operator*(Zp_field_element f, const Integer_type& v) {
181
- f *= v;
182
- return f;
183
- }
184
- /**
185
- * @brief operator*
186
- *
187
- * @tparam Integer_type A native integer type. Should be able to contain the characteristic if signed.
188
- */
189
- template <typename Integer_type, class = isInteger<Integer_type> >
190
- friend Integer_type operator*(const Integer_type& v, Zp_field_element f) {
191
- f *= v;
192
- return f.element_;
193
- }
194
-
195
- /**
196
- * @brief operator==
197
- */
198
- friend bool operator==(const Zp_field_element& f1, const Zp_field_element& f2) {
199
- return f1.element_ == f2.element_;
200
- }
201
- /**
202
- * @brief operator==
203
- *
204
- * @tparam Integer_type A native integer type. Should be able to contain the characteristic if signed.
205
- */
206
- template <typename Integer_type, class = isInteger<Integer_type> >
207
- friend bool operator==(const Integer_type& v, const Zp_field_element& f) {
208
- return Zp_field_element::_get_value(v) == f.element_;
209
- }
210
- /**
211
- * @brief operator==
212
- *
213
- * @tparam Integer_type A native integer type. Should be able to contain the characteristic if signed.
214
- */
215
- template <typename Integer_type, class = isInteger<Integer_type> >
216
- friend bool operator==(const Zp_field_element& f, const Integer_type& v) {
217
- return Zp_field_element::_get_value(v) == f.element_;
218
- }
219
- /**
220
- * @brief operator!=
221
- */
222
- friend bool operator!=(const Zp_field_element& f1, const Zp_field_element& f2) { return !(f1 == f2); }
223
- /**
224
- * @brief operator!=
225
- *
226
- * @tparam Integer_type A native integer type. Should be able to contain the characteristic if signed.
227
- */
228
- template <typename Integer_type, class = isInteger<Integer_type> >
229
- friend bool operator!=(const Integer_type& v, const Zp_field_element& f) {
230
- return !(v == f);
231
- }
232
- /**
233
- * @brief operator!=
234
- *
235
- * @tparam Integer_type A native integer type. Should be able to contain the characteristic if signed.
236
- */
237
- template <typename Integer_type, class = isInteger<Integer_type> >
238
- friend bool operator!=(const Zp_field_element& f, const Integer_type& v) {
239
- return !(v == f);
240
- }
241
-
242
- /**
243
- * @brief Assign operator.
244
- */
245
- Zp_field_element& operator=(Zp_field_element other) {
246
- std::swap(element_, other.element_);
247
- return *this;
248
- }
249
- /**
250
- * @brief Assign operator.
251
- *
252
- * @tparam Integer_type A native integer type. Should be able to contain the characteristic if signed.
253
- */
254
- template <typename Integer_type, class = isInteger<Integer_type> >
255
- Zp_field_element& operator=(const Integer_type& value) {
256
- element_ = _get_value(value);
257
- return *this;
258
- }
259
- /**
260
- * @brief Swap operator.
261
- */
262
- friend void swap(Zp_field_element& f1, Zp_field_element& f2) { std::swap(f1.element_, f2.element_); }
263
-
264
- /**
265
- * @brief Casts the element into an unsigned int.
266
- */
267
- operator unsigned int() const { return element_; }
268
-
269
- /**
270
- * @brief Returns the inverse of the element in the field.
271
- *
272
- * @return The inverse.
273
- */
274
- Zp_field_element get_inverse() const {
275
- if (element_ != 0 && inverse_[element_] == 0) { // initialize everything at instantiation instead?
276
- inverse_[element_] = _get_inverse(element_);
277
- }
278
-
279
- return Zp_field_element<characteristic>(inverse_[element_]);
280
- }
281
- /**
282
- * @brief For interface purposes with multi-fields. Returns the inverse together with the argument.
283
- *
284
- * @param productOfCharacteristics Some value.
285
- * @return Pair whose first element is the inverse and the second element is @p productOfCharacteristics.
286
- */
287
- std::pair<Zp_field_element, unsigned int> get_partial_inverse(unsigned int productOfCharacteristics) const {
288
- return {get_inverse(), productOfCharacteristics};
289
- }
290
-
291
- /**
292
- * @brief Returns the additive identity of the field.
293
- *
294
- * @return 0.
295
- */
296
- static Zp_field_element get_additive_identity() { return Zp_field_element<characteristic>(); }
297
- /**
298
- * @brief Returns the multiplicative identity of the field.
299
- *
300
- * @return 1.
301
- */
302
- static Zp_field_element get_multiplicative_identity() { return Zp_field_element<characteristic>(1); }
303
- /**
304
- * @brief For interface purposes with multi-fields. Returns the multiplicative identity of the field.
305
- *
306
- * @param productOfCharacteristics Some value.
307
- * @return 1.
308
- */
309
- static Zp_field_element get_partial_multiplicative_identity([[maybe_unused]] unsigned int productOfCharacteristics) {
310
- return Zp_field_element<characteristic>(1);
311
- }
312
- /**
313
- * @brief Returns the current characteristic.
314
- *
315
- * @return The value of the current characteristic.
316
- */
317
- static constexpr unsigned int get_characteristic() { return characteristic; }
318
-
319
- /**
320
- * @brief Returns the value of the element.
321
- *
322
- * @return Value of the element.
323
- */
324
- Element get_value() const { return element_; }
325
-
326
- // static constexpr bool handles_only_z2() { return false; }
327
-
328
- private:
329
- Element element_; /**< Field element. */
330
- static inline std::array<unsigned int, characteristic> inverse_; /**< All inverse elements. */
331
-
332
- static Element _add(Element element, Element v) {
333
- if (UINT_MAX - element < v) {
334
- // automatic unsigned integer overflow behaviour will make it work
335
- element += v;
336
- element -= characteristic;
337
- return element;
338
- }
339
-
340
- element += v;
341
- if (element >= characteristic) element -= characteristic;
342
-
343
- return element;
344
- }
345
- static Element _subtract(Element element, Element v) {
346
- if (element < v) {
347
- element += characteristic;
348
- }
349
- element -= v;
350
-
351
- return element;
352
- }
353
- static Element _multiply(Element element, Element v) {
354
- Element a = element;
355
- element = 0;
356
- Element temp_b;
357
-
358
- while (a != 0) {
359
- if (a & 1) {
360
- if (v >= characteristic - element) element -= characteristic;
361
- element += v;
362
- }
363
- a >>= 1;
364
-
365
- temp_b = v;
366
- if (v >= characteristic - v) temp_b -= characteristic;
367
- v += temp_b;
368
- }
369
-
370
- return element;
371
- }
372
- static int _get_inverse(Element element) {
373
- // to solve: Ax + My = 1
374
- int M = characteristic;
375
- int A = element;
376
- int y = 0, x = 1;
377
- // extended euclidean division
378
- while (A > 1) {
379
- int quotient = A / M;
380
- int temp = M;
381
-
382
- M = A % M, A = temp;
383
- temp = y;
384
-
385
- y = x - quotient * y;
386
- x = temp;
387
- }
388
-
389
- if (x < 0) x += characteristic;
390
-
391
- return x;
392
- }
393
-
394
- template <typename Integer_type, class = isInteger<Integer_type> >
395
- static constexpr Element _get_value(Integer_type e) {
396
- if constexpr (std::is_signed_v<Integer_type>) {
397
- if (e < -static_cast<Integer_type>(characteristic)) e = e % characteristic;
398
- if (e < 0) return e += characteristic;
399
- return e < static_cast<Integer_type>(characteristic) ? e : e % characteristic;
400
- } else {
401
- return e < characteristic ? e : e % characteristic;
402
- }
403
- }
404
-
405
- static constexpr bool _is_prime() {
406
- if (characteristic <= 1) return false;
407
- if (characteristic <= 3) return true;
408
- if (characteristic % 2 == 0 || characteristic % 3 == 0) return false;
409
-
410
- for (long i = 5; i * i <= characteristic; i = i + 6)
411
- if (characteristic % i == 0 || characteristic % (i + 2) == 0) return false;
412
-
413
- return true;
414
- }
415
- };
416
-
417
- } // namespace persistence_fields
418
- } // namespace Gudhi
419
-
420
- #endif // MATRIX_FIELD_ZP_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): Hannah Schreiber
4
+ *
5
+ * Copyright (C) 2022-24 Inria
6
+ *
7
+ * Modification(s):
8
+ * - YYYY/MM Author: Description of the modification
9
+ */
10
+
11
+ /**
12
+ * @file Zp_field.h
13
+ * @author Hannah Schreiber
14
+ * @brief Contains the @ref Gudhi::persistence_fields::Zp_field_element class.
15
+ */
16
+
17
+ #ifndef MATRIX_FIELD_ZP_H_
18
+ #define MATRIX_FIELD_ZP_H_
19
+
20
+ #include <utility>
21
+ #include <array>
22
+ #include <limits.h>
23
+
24
+ namespace Gudhi {
25
+ namespace persistence_fields {
26
+
27
+ /**
28
+ * @class Zp_field_element Zp_field.h gudhi/Fields/Zp_field.h
29
+ * @ingroup persistence_fields
30
+ *
31
+ * @brief Class representing an element of the \f$ \mathbb{F}_p \f$ field for any prime number \f$ p \f$.
32
+ *
33
+ * @tparam characteristic Value of the characteristic of the field. Has to be a positive prime number.
34
+ * @tparam Unsigned_integer_type A native unsigned integer type: unsigned int, long unsigned int, etc.
35
+ * Will be used as the field element type.
36
+ */
37
+ template <unsigned int characteristic, typename Unsigned_integer_type = unsigned int,
38
+ class = std::enable_if_t<std::is_unsigned_v<Unsigned_integer_type> > >
39
+ class Zp_field_element {
40
+ public:
41
+ using Element = Unsigned_integer_type; /**< Type for the elements in the field. */
42
+ using Characteristic = Element; /**< Type for the field characteristic. */
43
+ template <class T>
44
+ using isInteger = std::enable_if_t<std::is_integral_v<T> >;
45
+
46
+ /**
47
+ * @brief Default constructor. Sets the element to 0.
48
+ */
49
+ Zp_field_element() : element_(0) { static_assert(_is_prime(), "Characteristic has to be a prime number."); }
50
+ /**
51
+ * @brief Constructor setting the element to the given value.
52
+ *
53
+ * @tparam Integer_type A native integer type. Should be able to contain the characteristic if signed.
54
+ * @param element Value of the element.
55
+ */
56
+ template <typename Integer_type, class = isInteger<Integer_type> >
57
+ Zp_field_element(Integer_type element) : element_(_get_value(element)) {
58
+ static_assert(_is_prime(), "Characteristic has to be a prime number.");
59
+ }
60
+ /**
61
+ * @brief Copy constructor.
62
+ *
63
+ * @param toCopy Element to copy.
64
+ */
65
+ Zp_field_element(const Zp_field_element& toCopy) : element_(toCopy.element_) {}
66
+ /**
67
+ * @brief Move constructor.
68
+ *
69
+ * @param toMove Element to move.
70
+ */
71
+ Zp_field_element(Zp_field_element&& toMove) noexcept : element_(std::exchange(toMove.element_, 0)) {}
72
+
73
+ /**
74
+ * @brief operator+=
75
+ */
76
+ friend void operator+=(Zp_field_element& f1, const Zp_field_element& f2) {
77
+ f1.element_ = Zp_field_element::_add(f1.element_, f2.element_);
78
+ }
79
+ /**
80
+ * @brief operator+
81
+ */
82
+ friend Zp_field_element operator+(Zp_field_element f1, const Zp_field_element& f2) {
83
+ f1 += f2;
84
+ return f1;
85
+ }
86
+ /**
87
+ * @brief operator+=
88
+ */
89
+ template <typename Integer_type, class = isInteger<Integer_type> >
90
+ friend void operator+=(Zp_field_element& f, const Integer_type& v) {
91
+ f.element_ = Zp_field_element::_add(f.element_, _get_value(v));
92
+ }
93
+ /**
94
+ * @brief operator+
95
+ *
96
+ * @tparam Integer_type A native integer type. Should be able to contain the characteristic if signed.
97
+ */
98
+ template <typename Integer_type, class = isInteger<Integer_type> >
99
+ friend Zp_field_element operator+(Zp_field_element f, const Integer_type& v) {
100
+ f += v;
101
+ return f;
102
+ }
103
+ /**
104
+ * @brief operator+
105
+ *
106
+ * @tparam Integer_type A native integer type. Should be able to contain the characteristic if signed.
107
+ */
108
+ template <typename Integer_type, class = isInteger<Integer_type> >
109
+ friend Integer_type operator+(const Integer_type& v, Zp_field_element f) {
110
+ f += v;
111
+ return f.element_;
112
+ }
113
+
114
+ /**
115
+ * @brief operator-=
116
+ */
117
+ friend void operator-=(Zp_field_element& f1, const Zp_field_element& f2) {
118
+ f1.element_ = Zp_field_element::_subtract(f1.element_, f2.element_);
119
+ }
120
+ /**
121
+ * @brief operator-
122
+ */
123
+ friend Zp_field_element operator-(Zp_field_element f1, const Zp_field_element& f2) {
124
+ f1 -= f2;
125
+ return f1;
126
+ }
127
+ /**
128
+ * @brief operator-=
129
+ */
130
+ template <typename Integer_type, class = isInteger<Integer_type> >
131
+ friend void operator-=(Zp_field_element& f, const Integer_type& v) {
132
+ f.element_ = Zp_field_element::_subtract(f.element_, _get_value(v));
133
+ }
134
+ /**
135
+ * @brief operator-
136
+ *
137
+ * @tparam Integer_type A native integer type. Should be able to contain the characteristic if signed.
138
+ */
139
+ template <typename Integer_type, class = isInteger<Integer_type> >
140
+ friend Zp_field_element operator-(Zp_field_element f, const Integer_type& v) {
141
+ f -= v;
142
+ return f;
143
+ }
144
+ /**
145
+ * @brief operator-
146
+ *
147
+ * @tparam Integer_type A native integer type. Should be able to contain the characteristic if signed.
148
+ */
149
+ template <typename Integer_type, class = isInteger<Integer_type> >
150
+ friend Integer_type operator-(const Integer_type& v, const Zp_field_element& f) {
151
+ return Zp_field_element::_subtract(_get_value(v), f.element_);
152
+ }
153
+
154
+ /**
155
+ * @brief operator*=
156
+ */
157
+ friend void operator*=(Zp_field_element& f1, const Zp_field_element& f2) {
158
+ f1.element_ = Zp_field_element::_multiply(f1.element_, f2.element_);
159
+ }
160
+ /**
161
+ * @brief operator*
162
+ */
163
+ friend Zp_field_element operator*(Zp_field_element f1, const Zp_field_element& f2) {
164
+ f1 *= f2;
165
+ return f1;
166
+ }
167
+ /**
168
+ * @brief operator*=
169
+ */
170
+ template <typename Integer_type, class = isInteger<Integer_type> >
171
+ friend void operator*=(Zp_field_element& f, const Integer_type& v) {
172
+ f.element_ = Zp_field_element::_multiply(f.element_, _get_value(v));
173
+ }
174
+ /**
175
+ * @brief operator*
176
+ *
177
+ * @tparam Integer_type A native integer type. Should be able to contain the characteristic if signed.
178
+ */
179
+ template <typename Integer_type, class = isInteger<Integer_type> >
180
+ friend Zp_field_element operator*(Zp_field_element f, const Integer_type& v) {
181
+ f *= v;
182
+ return f;
183
+ }
184
+ /**
185
+ * @brief operator*
186
+ *
187
+ * @tparam Integer_type A native integer type. Should be able to contain the characteristic if signed.
188
+ */
189
+ template <typename Integer_type, class = isInteger<Integer_type> >
190
+ friend Integer_type operator*(const Integer_type& v, Zp_field_element f) {
191
+ f *= v;
192
+ return f.element_;
193
+ }
194
+
195
+ /**
196
+ * @brief operator==
197
+ */
198
+ friend bool operator==(const Zp_field_element& f1, const Zp_field_element& f2) {
199
+ return f1.element_ == f2.element_;
200
+ }
201
+ /**
202
+ * @brief operator==
203
+ *
204
+ * @tparam Integer_type A native integer type. Should be able to contain the characteristic if signed.
205
+ */
206
+ template <typename Integer_type, class = isInteger<Integer_type> >
207
+ friend bool operator==(const Integer_type& v, const Zp_field_element& f) {
208
+ return Zp_field_element::_get_value(v) == f.element_;
209
+ }
210
+ /**
211
+ * @brief operator==
212
+ *
213
+ * @tparam Integer_type A native integer type. Should be able to contain the characteristic if signed.
214
+ */
215
+ template <typename Integer_type, class = isInteger<Integer_type> >
216
+ friend bool operator==(const Zp_field_element& f, const Integer_type& v) {
217
+ return Zp_field_element::_get_value(v) == f.element_;
218
+ }
219
+ /**
220
+ * @brief operator!=
221
+ */
222
+ friend bool operator!=(const Zp_field_element& f1, const Zp_field_element& f2) { return !(f1 == f2); }
223
+ /**
224
+ * @brief operator!=
225
+ *
226
+ * @tparam Integer_type A native integer type. Should be able to contain the characteristic if signed.
227
+ */
228
+ template <typename Integer_type, class = isInteger<Integer_type> >
229
+ friend bool operator!=(const Integer_type& v, const Zp_field_element& f) {
230
+ return !(v == f);
231
+ }
232
+ /**
233
+ * @brief operator!=
234
+ *
235
+ * @tparam Integer_type A native integer type. Should be able to contain the characteristic if signed.
236
+ */
237
+ template <typename Integer_type, class = isInteger<Integer_type> >
238
+ friend bool operator!=(const Zp_field_element& f, const Integer_type& v) {
239
+ return !(v == f);
240
+ }
241
+
242
+ /**
243
+ * @brief Assign operator.
244
+ */
245
+ Zp_field_element& operator=(Zp_field_element other) {
246
+ std::swap(element_, other.element_);
247
+ return *this;
248
+ }
249
+ /**
250
+ * @brief Assign operator.
251
+ *
252
+ * @tparam Integer_type A native integer type. Should be able to contain the characteristic if signed.
253
+ */
254
+ template <typename Integer_type, class = isInteger<Integer_type> >
255
+ Zp_field_element& operator=(const Integer_type& value) {
256
+ element_ = _get_value(value);
257
+ return *this;
258
+ }
259
+ /**
260
+ * @brief Swap operator.
261
+ */
262
+ friend void swap(Zp_field_element& f1, Zp_field_element& f2) { std::swap(f1.element_, f2.element_); }
263
+
264
+ /**
265
+ * @brief Casts the element into an unsigned int.
266
+ */
267
+ operator unsigned int() const { return element_; }
268
+
269
+ /**
270
+ * @brief Returns the inverse of the element in the field.
271
+ *
272
+ * @return The inverse.
273
+ */
274
+ Zp_field_element get_inverse() const {
275
+ if (element_ != 0 && inverse_[element_] == 0) { // initialize everything at instantiation instead?
276
+ inverse_[element_] = _get_inverse(element_);
277
+ }
278
+
279
+ return Zp_field_element<characteristic>(inverse_[element_]);
280
+ }
281
+ /**
282
+ * @brief For interface purposes with multi-fields. Returns the inverse together with the argument.
283
+ *
284
+ * @param productOfCharacteristics Some value.
285
+ * @return Pair whose first element is the inverse and the second element is @p productOfCharacteristics.
286
+ */
287
+ std::pair<Zp_field_element, unsigned int> get_partial_inverse(unsigned int productOfCharacteristics) const {
288
+ return {get_inverse(), productOfCharacteristics};
289
+ }
290
+
291
+ /**
292
+ * @brief Returns the additive identity of the field.
293
+ *
294
+ * @return 0.
295
+ */
296
+ static Zp_field_element get_additive_identity() { return Zp_field_element<characteristic>(); }
297
+ /**
298
+ * @brief Returns the multiplicative identity of the field.
299
+ *
300
+ * @return 1.
301
+ */
302
+ static Zp_field_element get_multiplicative_identity() { return Zp_field_element<characteristic>(1); }
303
+ /**
304
+ * @brief For interface purposes with multi-fields. Returns the multiplicative identity of the field.
305
+ *
306
+ * @param productOfCharacteristics Some value.
307
+ * @return 1.
308
+ */
309
+ static Zp_field_element get_partial_multiplicative_identity([[maybe_unused]] unsigned int productOfCharacteristics) {
310
+ return Zp_field_element<characteristic>(1);
311
+ }
312
+ /**
313
+ * @brief Returns the current characteristic.
314
+ *
315
+ * @return The value of the current characteristic.
316
+ */
317
+ static constexpr unsigned int get_characteristic() { return characteristic; }
318
+
319
+ /**
320
+ * @brief Returns the value of the element.
321
+ *
322
+ * @return Value of the element.
323
+ */
324
+ Element get_value() const { return element_; }
325
+
326
+ // static constexpr bool handles_only_z2() { return false; }
327
+
328
+ private:
329
+ Element element_; /**< Field element. */
330
+ static inline std::array<unsigned int, characteristic> inverse_; /**< All inverse elements. */
331
+
332
+ static Element _add(Element element, Element v) {
333
+ if (UINT_MAX - element < v) {
334
+ // automatic unsigned integer overflow behaviour will make it work
335
+ element += v;
336
+ element -= characteristic;
337
+ return element;
338
+ }
339
+
340
+ element += v;
341
+ if (element >= characteristic) element -= characteristic;
342
+
343
+ return element;
344
+ }
345
+ static Element _subtract(Element element, Element v) {
346
+ if (element < v) {
347
+ element += characteristic;
348
+ }
349
+ element -= v;
350
+
351
+ return element;
352
+ }
353
+ static Element _multiply(Element element, Element v) {
354
+ Element a = element;
355
+ element = 0;
356
+ Element temp_b;
357
+
358
+ while (a != 0) {
359
+ if (a & 1) {
360
+ if (v >= characteristic - element) element -= characteristic;
361
+ element += v;
362
+ }
363
+ a >>= 1;
364
+
365
+ temp_b = v;
366
+ if (v >= characteristic - v) temp_b -= characteristic;
367
+ v += temp_b;
368
+ }
369
+
370
+ return element;
371
+ }
372
+ static int _get_inverse(Element element) {
373
+ // to solve: Ax + My = 1
374
+ int M = characteristic;
375
+ int A = element;
376
+ int y = 0, x = 1;
377
+ // extended euclidean division
378
+ while (A > 1) {
379
+ int quotient = A / M;
380
+ int temp = M;
381
+
382
+ M = A % M, A = temp;
383
+ temp = y;
384
+
385
+ y = x - quotient * y;
386
+ x = temp;
387
+ }
388
+
389
+ if (x < 0) x += characteristic;
390
+
391
+ return x;
392
+ }
393
+
394
+ template <typename Integer_type, class = isInteger<Integer_type> >
395
+ static constexpr Element _get_value(Integer_type e) {
396
+ if constexpr (std::is_signed_v<Integer_type>) {
397
+ if (e < -static_cast<Integer_type>(characteristic)) e = e % characteristic;
398
+ if (e < 0) return e += characteristic;
399
+ return e < static_cast<Integer_type>(characteristic) ? e : e % characteristic;
400
+ } else {
401
+ return e < characteristic ? e : e % characteristic;
402
+ }
403
+ }
404
+
405
+ static constexpr bool _is_prime() {
406
+ if (characteristic <= 1) return false;
407
+ if (characteristic <= 3) return true;
408
+ if (characteristic % 2 == 0 || characteristic % 3 == 0) return false;
409
+
410
+ for (long i = 5; i * i <= characteristic; i = i + 6)
411
+ if (characteristic % i == 0 || characteristic % (i + 2) == 0) return false;
412
+
413
+ return true;
414
+ }
415
+ };
416
+
417
+ } // namespace persistence_fields
418
+ } // namespace Gudhi
419
+
420
+ #endif // MATRIX_FIELD_ZP_H_