multipers 2.3.3b6__cp312-cp312-macosx_11_0_arm64.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.
- multipers/.dylibs/libc++.1.0.dylib +0 -0
- multipers/.dylibs/libtbb.12.16.dylib +0 -0
- multipers/__init__.py +33 -0
- multipers/_signed_measure_meta.py +453 -0
- multipers/_slicer_meta.py +211 -0
- multipers/array_api/__init__.py +45 -0
- multipers/array_api/numpy.py +41 -0
- multipers/array_api/torch.py +58 -0
- multipers/data/MOL2.py +458 -0
- multipers/data/UCR.py +18 -0
- multipers/data/__init__.py +1 -0
- multipers/data/graphs.py +466 -0
- multipers/data/immuno_regions.py +27 -0
- multipers/data/minimal_presentation_to_st_bf.py +0 -0
- multipers/data/pytorch2simplextree.py +91 -0
- multipers/data/shape3d.py +101 -0
- multipers/data/synthetic.py +113 -0
- multipers/distances.py +202 -0
- multipers/filtration_conversions.pxd +229 -0
- multipers/filtration_conversions.pxd.tp +84 -0
- multipers/filtrations/__init__.py +18 -0
- multipers/filtrations/density.py +574 -0
- multipers/filtrations/filtrations.py +361 -0
- multipers/filtrations.pxd +224 -0
- multipers/function_rips.cpython-312-darwin.so +0 -0
- multipers/function_rips.pyx +105 -0
- multipers/grids.cpython-312-darwin.so +0 -0
- multipers/grids.pyx +433 -0
- multipers/gudhi/Persistence_slices_interface.h +132 -0
- multipers/gudhi/Simplex_tree_interface.h +239 -0
- multipers/gudhi/Simplex_tree_multi_interface.h +551 -0
- multipers/gudhi/cubical_to_boundary.h +59 -0
- multipers/gudhi/gudhi/Bitmap_cubical_complex.h +450 -0
- multipers/gudhi/gudhi/Bitmap_cubical_complex_base.h +1070 -0
- multipers/gudhi/gudhi/Bitmap_cubical_complex_periodic_boundary_conditions_base.h +579 -0
- multipers/gudhi/gudhi/Debug_utils.h +45 -0
- multipers/gudhi/gudhi/Fields/Multi_field.h +484 -0
- multipers/gudhi/gudhi/Fields/Multi_field_operators.h +455 -0
- multipers/gudhi/gudhi/Fields/Multi_field_shared.h +450 -0
- multipers/gudhi/gudhi/Fields/Multi_field_small.h +531 -0
- multipers/gudhi/gudhi/Fields/Multi_field_small_operators.h +507 -0
- multipers/gudhi/gudhi/Fields/Multi_field_small_shared.h +531 -0
- multipers/gudhi/gudhi/Fields/Z2_field.h +355 -0
- multipers/gudhi/gudhi/Fields/Z2_field_operators.h +376 -0
- multipers/gudhi/gudhi/Fields/Zp_field.h +420 -0
- multipers/gudhi/gudhi/Fields/Zp_field_operators.h +400 -0
- multipers/gudhi/gudhi/Fields/Zp_field_shared.h +418 -0
- multipers/gudhi/gudhi/Flag_complex_edge_collapser.h +337 -0
- multipers/gudhi/gudhi/Matrix.h +2107 -0
- multipers/gudhi/gudhi/Multi_critical_filtration.h +1038 -0
- multipers/gudhi/gudhi/Multi_persistence/Box.h +174 -0
- multipers/gudhi/gudhi/Multi_persistence/Line.h +282 -0
- multipers/gudhi/gudhi/Off_reader.h +173 -0
- multipers/gudhi/gudhi/One_critical_filtration.h +1441 -0
- multipers/gudhi/gudhi/Persistence_matrix/Base_matrix.h +769 -0
- multipers/gudhi/gudhi/Persistence_matrix/Base_matrix_with_column_compression.h +686 -0
- multipers/gudhi/gudhi/Persistence_matrix/Boundary_matrix.h +842 -0
- multipers/gudhi/gudhi/Persistence_matrix/Chain_matrix.h +1350 -0
- multipers/gudhi/gudhi/Persistence_matrix/Id_to_index_overlay.h +1105 -0
- multipers/gudhi/gudhi/Persistence_matrix/Position_to_index_overlay.h +859 -0
- multipers/gudhi/gudhi/Persistence_matrix/RU_matrix.h +910 -0
- multipers/gudhi/gudhi/Persistence_matrix/allocators/entry_constructors.h +139 -0
- multipers/gudhi/gudhi/Persistence_matrix/base_pairing.h +230 -0
- multipers/gudhi/gudhi/Persistence_matrix/base_swap.h +211 -0
- multipers/gudhi/gudhi/Persistence_matrix/boundary_cell_position_to_id_mapper.h +60 -0
- multipers/gudhi/gudhi/Persistence_matrix/boundary_face_position_to_id_mapper.h +60 -0
- multipers/gudhi/gudhi/Persistence_matrix/chain_pairing.h +136 -0
- multipers/gudhi/gudhi/Persistence_matrix/chain_rep_cycles.h +190 -0
- multipers/gudhi/gudhi/Persistence_matrix/chain_vine_swap.h +616 -0
- multipers/gudhi/gudhi/Persistence_matrix/columns/chain_column_extra_properties.h +150 -0
- multipers/gudhi/gudhi/Persistence_matrix/columns/column_dimension_holder.h +106 -0
- multipers/gudhi/gudhi/Persistence_matrix/columns/column_utilities.h +219 -0
- multipers/gudhi/gudhi/Persistence_matrix/columns/entry_types.h +327 -0
- multipers/gudhi/gudhi/Persistence_matrix/columns/heap_column.h +1140 -0
- multipers/gudhi/gudhi/Persistence_matrix/columns/intrusive_list_column.h +934 -0
- multipers/gudhi/gudhi/Persistence_matrix/columns/intrusive_set_column.h +934 -0
- multipers/gudhi/gudhi/Persistence_matrix/columns/list_column.h +980 -0
- multipers/gudhi/gudhi/Persistence_matrix/columns/naive_vector_column.h +1092 -0
- multipers/gudhi/gudhi/Persistence_matrix/columns/row_access.h +192 -0
- multipers/gudhi/gudhi/Persistence_matrix/columns/set_column.h +921 -0
- multipers/gudhi/gudhi/Persistence_matrix/columns/small_vector_column.h +1093 -0
- multipers/gudhi/gudhi/Persistence_matrix/columns/unordered_set_column.h +1012 -0
- multipers/gudhi/gudhi/Persistence_matrix/columns/vector_column.h +1244 -0
- multipers/gudhi/gudhi/Persistence_matrix/matrix_dimension_holders.h +186 -0
- multipers/gudhi/gudhi/Persistence_matrix/matrix_row_access.h +164 -0
- multipers/gudhi/gudhi/Persistence_matrix/ru_pairing.h +156 -0
- multipers/gudhi/gudhi/Persistence_matrix/ru_rep_cycles.h +376 -0
- multipers/gudhi/gudhi/Persistence_matrix/ru_vine_swap.h +540 -0
- multipers/gudhi/gudhi/Persistent_cohomology/Field_Zp.h +118 -0
- multipers/gudhi/gudhi/Persistent_cohomology/Multi_field.h +173 -0
- multipers/gudhi/gudhi/Persistent_cohomology/Persistent_cohomology_column.h +128 -0
- multipers/gudhi/gudhi/Persistent_cohomology.h +745 -0
- multipers/gudhi/gudhi/Points_off_io.h +171 -0
- multipers/gudhi/gudhi/Simple_object_pool.h +69 -0
- multipers/gudhi/gudhi/Simplex_tree/Simplex_tree_iterators.h +463 -0
- multipers/gudhi/gudhi/Simplex_tree/Simplex_tree_node_explicit_storage.h +83 -0
- multipers/gudhi/gudhi/Simplex_tree/Simplex_tree_siblings.h +106 -0
- multipers/gudhi/gudhi/Simplex_tree/Simplex_tree_star_simplex_iterators.h +277 -0
- multipers/gudhi/gudhi/Simplex_tree/hooks_simplex_base.h +62 -0
- multipers/gudhi/gudhi/Simplex_tree/indexing_tag.h +27 -0
- multipers/gudhi/gudhi/Simplex_tree/serialization_utils.h +62 -0
- multipers/gudhi/gudhi/Simplex_tree/simplex_tree_options.h +157 -0
- multipers/gudhi/gudhi/Simplex_tree.h +2794 -0
- multipers/gudhi/gudhi/Simplex_tree_multi.h +152 -0
- multipers/gudhi/gudhi/distance_functions.h +62 -0
- multipers/gudhi/gudhi/graph_simplicial_complex.h +104 -0
- multipers/gudhi/gudhi/persistence_interval.h +253 -0
- multipers/gudhi/gudhi/persistence_matrix_options.h +170 -0
- multipers/gudhi/gudhi/reader_utils.h +367 -0
- multipers/gudhi/mma_interface_coh.h +256 -0
- multipers/gudhi/mma_interface_h0.h +223 -0
- multipers/gudhi/mma_interface_matrix.h +293 -0
- multipers/gudhi/naive_merge_tree.h +536 -0
- multipers/gudhi/scc_io.h +310 -0
- multipers/gudhi/truc.h +1403 -0
- multipers/io.cpython-312-darwin.so +0 -0
- multipers/io.pyx +644 -0
- multipers/ml/__init__.py +0 -0
- multipers/ml/accuracies.py +90 -0
- multipers/ml/invariants_with_persistable.py +79 -0
- multipers/ml/kernels.py +176 -0
- multipers/ml/mma.py +713 -0
- multipers/ml/one.py +472 -0
- multipers/ml/point_clouds.py +352 -0
- multipers/ml/signed_measures.py +1589 -0
- multipers/ml/sliced_wasserstein.py +461 -0
- multipers/ml/tools.py +113 -0
- multipers/mma_structures.cpython-312-darwin.so +0 -0
- multipers/mma_structures.pxd +128 -0
- multipers/mma_structures.pyx +2786 -0
- multipers/mma_structures.pyx.tp +1094 -0
- multipers/multi_parameter_rank_invariant/diff_helpers.h +84 -0
- multipers/multi_parameter_rank_invariant/euler_characteristic.h +97 -0
- multipers/multi_parameter_rank_invariant/function_rips.h +322 -0
- multipers/multi_parameter_rank_invariant/hilbert_function.h +769 -0
- multipers/multi_parameter_rank_invariant/persistence_slices.h +148 -0
- multipers/multi_parameter_rank_invariant/rank_invariant.h +369 -0
- multipers/multiparameter_edge_collapse.py +41 -0
- multipers/multiparameter_module_approximation/approximation.h +2330 -0
- multipers/multiparameter_module_approximation/combinatory.h +129 -0
- multipers/multiparameter_module_approximation/debug.h +107 -0
- multipers/multiparameter_module_approximation/euler_curves.h +0 -0
- multipers/multiparameter_module_approximation/format_python-cpp.h +286 -0
- multipers/multiparameter_module_approximation/heap_column.h +238 -0
- multipers/multiparameter_module_approximation/images.h +79 -0
- multipers/multiparameter_module_approximation/list_column.h +174 -0
- multipers/multiparameter_module_approximation/list_column_2.h +232 -0
- multipers/multiparameter_module_approximation/ru_matrix.h +347 -0
- multipers/multiparameter_module_approximation/set_column.h +135 -0
- multipers/multiparameter_module_approximation/structure_higher_dim_barcode.h +36 -0
- multipers/multiparameter_module_approximation/unordered_set_column.h +166 -0
- multipers/multiparameter_module_approximation/utilities.h +403 -0
- multipers/multiparameter_module_approximation/vector_column.h +223 -0
- multipers/multiparameter_module_approximation/vector_matrix.h +331 -0
- multipers/multiparameter_module_approximation/vineyards.h +464 -0
- multipers/multiparameter_module_approximation/vineyards_trajectories.h +649 -0
- multipers/multiparameter_module_approximation.cpython-312-darwin.so +0 -0
- multipers/multiparameter_module_approximation.pyx +235 -0
- multipers/pickle.py +90 -0
- multipers/plots.py +456 -0
- multipers/point_measure.cpython-312-darwin.so +0 -0
- multipers/point_measure.pyx +395 -0
- multipers/simplex_tree_multi.cpython-312-darwin.so +0 -0
- multipers/simplex_tree_multi.pxd +134 -0
- multipers/simplex_tree_multi.pyx +10840 -0
- multipers/simplex_tree_multi.pyx.tp +2009 -0
- multipers/slicer.cpython-312-darwin.so +0 -0
- multipers/slicer.pxd +3034 -0
- multipers/slicer.pxd.tp +234 -0
- multipers/slicer.pyx +20481 -0
- multipers/slicer.pyx.tp +1088 -0
- multipers/tensor/tensor.h +672 -0
- multipers/tensor.pxd +13 -0
- multipers/test.pyx +44 -0
- multipers/tests/__init__.py +62 -0
- multipers/torch/__init__.py +1 -0
- multipers/torch/diff_grids.py +240 -0
- multipers/torch/rips_density.py +310 -0
- multipers-2.3.3b6.dist-info/METADATA +128 -0
- multipers-2.3.3b6.dist-info/RECORD +183 -0
- multipers-2.3.3b6.dist-info/WHEEL +6 -0
- multipers-2.3.3b6.dist-info/licenses/LICENSE +21 -0
- multipers-2.3.3b6.dist-info/top_level.txt +1 -0
|
@@ -0,0 +1,450 @@
|
|
|
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, Clément Maria
|
|
4
|
+
*
|
|
5
|
+
* Copyright (C) 2022-24 Inria
|
|
6
|
+
*
|
|
7
|
+
* Modification(s):
|
|
8
|
+
* - YYYY/MM Author: Description of the modification
|
|
9
|
+
*/
|
|
10
|
+
|
|
11
|
+
/**
|
|
12
|
+
* @file Multi_field_shared.h
|
|
13
|
+
* @author Hannah Schreiber, Clément Maria
|
|
14
|
+
* @brief Contains the @ref Gudhi::persistence_fields::Shared_multi_field_element class.
|
|
15
|
+
*/
|
|
16
|
+
|
|
17
|
+
#ifndef MATRIX_FIELD_MULTI_SHARED_H_
|
|
18
|
+
#define MATRIX_FIELD_MULTI_SHARED_H_
|
|
19
|
+
|
|
20
|
+
#include <utility>
|
|
21
|
+
#include <vector>
|
|
22
|
+
#include <gmpxx.h>
|
|
23
|
+
#include <stdexcept>
|
|
24
|
+
|
|
25
|
+
namespace Gudhi {
|
|
26
|
+
namespace persistence_fields {
|
|
27
|
+
|
|
28
|
+
/**
|
|
29
|
+
* @class Shared_multi_field_element Multi_field_shared.h gudhi/Fields/Multi_field_shared.h
|
|
30
|
+
* @ingroup persistence_fields
|
|
31
|
+
*
|
|
32
|
+
* @brief Class representing an element of a multi-field. If each instantiation of the class can represent another
|
|
33
|
+
* element, they all share the same characteristics. That is if the characteristics are set for one, they will be
|
|
34
|
+
* set for all the others. The characteristics can be set before instantiating the elements with the static
|
|
35
|
+
* @ref Shared_multi_field_element::initialize method.
|
|
36
|
+
*/
|
|
37
|
+
class Shared_multi_field_element
|
|
38
|
+
{
|
|
39
|
+
public:
|
|
40
|
+
using Element = mpz_class; /**< Type for the elements in the field. */
|
|
41
|
+
using Characteristic = Element; /**< Type for the field characteristic. */
|
|
42
|
+
|
|
43
|
+
/**
|
|
44
|
+
* @brief Default constructor. Sets the element to 0.
|
|
45
|
+
*/
|
|
46
|
+
Shared_multi_field_element();
|
|
47
|
+
/**
|
|
48
|
+
* @brief Constructor setting the element to the given value.
|
|
49
|
+
*
|
|
50
|
+
* @param element Value of the element.
|
|
51
|
+
*/
|
|
52
|
+
Shared_multi_field_element(Element element);
|
|
53
|
+
/**
|
|
54
|
+
* @brief Copy constructor.
|
|
55
|
+
*
|
|
56
|
+
* @param toCopy Element to copy.
|
|
57
|
+
*/
|
|
58
|
+
Shared_multi_field_element(const Shared_multi_field_element& toCopy);
|
|
59
|
+
/**
|
|
60
|
+
* @brief Move constructor.
|
|
61
|
+
*
|
|
62
|
+
* @param toMove Element to move.
|
|
63
|
+
*/
|
|
64
|
+
Shared_multi_field_element(Shared_multi_field_element&& toMove) noexcept;
|
|
65
|
+
|
|
66
|
+
/**
|
|
67
|
+
* @brief Initialize the multi-field to the characteristics (primes) contained in the given interval.
|
|
68
|
+
* Should be called first before constructing the field elements.
|
|
69
|
+
*
|
|
70
|
+
* @param minimum Lowest value in the interval.
|
|
71
|
+
* @param maximum Highest value in the interval.
|
|
72
|
+
*/
|
|
73
|
+
static void initialize(unsigned int minimum, unsigned int maximum);
|
|
74
|
+
|
|
75
|
+
/**
|
|
76
|
+
* @brief operator+=
|
|
77
|
+
*/
|
|
78
|
+
friend void operator+=(Shared_multi_field_element& f1, Shared_multi_field_element const& f2) {
|
|
79
|
+
f1.element_ += f2.element_;
|
|
80
|
+
mpz_mod(f1.element_.get_mpz_t(), f1.element_.get_mpz_t(), productOfAllCharacteristics_.get_mpz_t());
|
|
81
|
+
}
|
|
82
|
+
/**
|
|
83
|
+
* @brief operator+
|
|
84
|
+
*/
|
|
85
|
+
friend Shared_multi_field_element operator+(Shared_multi_field_element f1, Shared_multi_field_element const& f2) {
|
|
86
|
+
f1 += f2;
|
|
87
|
+
return f1;
|
|
88
|
+
}
|
|
89
|
+
/**
|
|
90
|
+
* @brief operator+=
|
|
91
|
+
*/
|
|
92
|
+
friend void operator+=(Shared_multi_field_element& f, Element const v) {
|
|
93
|
+
f.element_ += v;
|
|
94
|
+
mpz_mod(f.element_.get_mpz_t(), f.element_.get_mpz_t(), productOfAllCharacteristics_.get_mpz_t());
|
|
95
|
+
}
|
|
96
|
+
/**
|
|
97
|
+
* @brief operator+
|
|
98
|
+
*/
|
|
99
|
+
friend Shared_multi_field_element operator+(Shared_multi_field_element f, Element const v) {
|
|
100
|
+
f += v;
|
|
101
|
+
return f;
|
|
102
|
+
}
|
|
103
|
+
/**
|
|
104
|
+
* @brief operator+
|
|
105
|
+
*/
|
|
106
|
+
friend Element operator+(Element v, Shared_multi_field_element const& f) {
|
|
107
|
+
v += f.element_;
|
|
108
|
+
mpz_mod(v.get_mpz_t(), v.get_mpz_t(), productOfAllCharacteristics_.get_mpz_t());
|
|
109
|
+
return v;
|
|
110
|
+
}
|
|
111
|
+
|
|
112
|
+
/**
|
|
113
|
+
* @brief operator-=
|
|
114
|
+
*/
|
|
115
|
+
friend void operator-=(Shared_multi_field_element& f1, Shared_multi_field_element const& f2) {
|
|
116
|
+
f1.element_ -= f2.element_;
|
|
117
|
+
mpz_mod(f1.element_.get_mpz_t(), f1.element_.get_mpz_t(), productOfAllCharacteristics_.get_mpz_t());
|
|
118
|
+
}
|
|
119
|
+
/**
|
|
120
|
+
* @brief operator-
|
|
121
|
+
*/
|
|
122
|
+
friend Shared_multi_field_element operator-(Shared_multi_field_element f1, Shared_multi_field_element const& f2) {
|
|
123
|
+
f1 -= f2;
|
|
124
|
+
return f1;
|
|
125
|
+
}
|
|
126
|
+
/**
|
|
127
|
+
* @brief operator-=
|
|
128
|
+
*/
|
|
129
|
+
friend void operator-=(Shared_multi_field_element& f, Element const v) {
|
|
130
|
+
f.element_ -= v;
|
|
131
|
+
mpz_mod(f.element_.get_mpz_t(), f.element_.get_mpz_t(), productOfAllCharacteristics_.get_mpz_t());
|
|
132
|
+
}
|
|
133
|
+
/**
|
|
134
|
+
* @brief operator-
|
|
135
|
+
*/
|
|
136
|
+
friend Shared_multi_field_element operator-(Shared_multi_field_element f, Element const v) {
|
|
137
|
+
f -= v;
|
|
138
|
+
return f;
|
|
139
|
+
}
|
|
140
|
+
/**
|
|
141
|
+
* @brief operator-
|
|
142
|
+
*/
|
|
143
|
+
friend Element operator-(Element v, Shared_multi_field_element const& f) {
|
|
144
|
+
if (v >= productOfAllCharacteristics_)
|
|
145
|
+
mpz_mod(v.get_mpz_t(), v.get_mpz_t(), productOfAllCharacteristics_.get_mpz_t());
|
|
146
|
+
if (f.element_ > v) v += productOfAllCharacteristics_;
|
|
147
|
+
v -= f.element_;
|
|
148
|
+
return v;
|
|
149
|
+
}
|
|
150
|
+
|
|
151
|
+
/**
|
|
152
|
+
* @brief operator*=
|
|
153
|
+
*/
|
|
154
|
+
friend void operator*=(Shared_multi_field_element& f1, Shared_multi_field_element const& f2) {
|
|
155
|
+
f1.element_ *= f2.element_;
|
|
156
|
+
mpz_mod(f1.element_.get_mpz_t(), f1.element_.get_mpz_t(), productOfAllCharacteristics_.get_mpz_t());
|
|
157
|
+
}
|
|
158
|
+
/**
|
|
159
|
+
* @brief operator*
|
|
160
|
+
*/
|
|
161
|
+
friend Shared_multi_field_element operator*(Shared_multi_field_element f1, Shared_multi_field_element const& f2) {
|
|
162
|
+
f1 *= f2;
|
|
163
|
+
return f1;
|
|
164
|
+
}
|
|
165
|
+
/**
|
|
166
|
+
* @brief operator*=
|
|
167
|
+
*/
|
|
168
|
+
friend void operator*=(Shared_multi_field_element& f, Element const v) {
|
|
169
|
+
f.element_ *= v;
|
|
170
|
+
mpz_mod(f.element_.get_mpz_t(), f.element_.get_mpz_t(), productOfAllCharacteristics_.get_mpz_t());
|
|
171
|
+
}
|
|
172
|
+
/**
|
|
173
|
+
* @brief operator*
|
|
174
|
+
*/
|
|
175
|
+
friend Shared_multi_field_element operator*(Shared_multi_field_element f, Element const v) {
|
|
176
|
+
f *= v;
|
|
177
|
+
return f;
|
|
178
|
+
}
|
|
179
|
+
/**
|
|
180
|
+
* @brief operator*
|
|
181
|
+
*/
|
|
182
|
+
friend Element operator*(Element v, Shared_multi_field_element const& f) {
|
|
183
|
+
v *= f.element_;
|
|
184
|
+
mpz_mod(v.get_mpz_t(), v.get_mpz_t(), productOfAllCharacteristics_.get_mpz_t());
|
|
185
|
+
return v;
|
|
186
|
+
}
|
|
187
|
+
|
|
188
|
+
/**
|
|
189
|
+
* @brief operator==
|
|
190
|
+
*/
|
|
191
|
+
friend bool operator==(const Shared_multi_field_element& f1, const Shared_multi_field_element& f2) {
|
|
192
|
+
return f1.element_ == f2.element_;
|
|
193
|
+
}
|
|
194
|
+
/**
|
|
195
|
+
* @brief operator==
|
|
196
|
+
*/
|
|
197
|
+
friend bool operator==(const Element& v, const Shared_multi_field_element& f) {
|
|
198
|
+
if (v < productOfAllCharacteristics_) return v == f.element_;
|
|
199
|
+
Element e(v);
|
|
200
|
+
mpz_mod(e.get_mpz_t(), e.get_mpz_t(), productOfAllCharacteristics_.get_mpz_t());
|
|
201
|
+
return e == f.element_;
|
|
202
|
+
}
|
|
203
|
+
/**
|
|
204
|
+
* @brief operator==
|
|
205
|
+
*/
|
|
206
|
+
friend bool operator==(const Shared_multi_field_element& f, const Element& v) {
|
|
207
|
+
if (v < productOfAllCharacteristics_) return v == f.element_;
|
|
208
|
+
Element e(v);
|
|
209
|
+
mpz_mod(e.get_mpz_t(), e.get_mpz_t(), productOfAllCharacteristics_.get_mpz_t());
|
|
210
|
+
return e == f.element_;
|
|
211
|
+
}
|
|
212
|
+
/**
|
|
213
|
+
* @brief operator!=
|
|
214
|
+
*/
|
|
215
|
+
friend bool operator!=(const Shared_multi_field_element& f1, const Shared_multi_field_element& f2) {
|
|
216
|
+
return !(f1 == f2);
|
|
217
|
+
}
|
|
218
|
+
/**
|
|
219
|
+
* @brief operator!=
|
|
220
|
+
*/
|
|
221
|
+
friend bool operator!=(const Element& v, const Shared_multi_field_element& f) { return !(v == f); }
|
|
222
|
+
/**
|
|
223
|
+
* @brief operator!=
|
|
224
|
+
*/
|
|
225
|
+
friend bool operator!=(const Shared_multi_field_element& f, const Element& v) { return !(v == f); }
|
|
226
|
+
|
|
227
|
+
/**
|
|
228
|
+
* @brief Assign operator.
|
|
229
|
+
*/
|
|
230
|
+
Shared_multi_field_element& operator=(Shared_multi_field_element other);
|
|
231
|
+
/**
|
|
232
|
+
* @brief Assign operator.
|
|
233
|
+
*/
|
|
234
|
+
Shared_multi_field_element& operator=(const Element& value);
|
|
235
|
+
/**
|
|
236
|
+
* @brief Swap operator.
|
|
237
|
+
*/
|
|
238
|
+
friend void swap(Shared_multi_field_element& f1, Shared_multi_field_element& f2) {
|
|
239
|
+
std::swap(f1.element_, f2.element_);
|
|
240
|
+
}
|
|
241
|
+
|
|
242
|
+
/**
|
|
243
|
+
* @brief Casts the element into an unsigned int.
|
|
244
|
+
*/
|
|
245
|
+
operator unsigned int() const;
|
|
246
|
+
/**
|
|
247
|
+
* @brief Casts the element into a mpz_class.
|
|
248
|
+
*/
|
|
249
|
+
operator mpz_class() const;
|
|
250
|
+
|
|
251
|
+
/**
|
|
252
|
+
* @brief Returns the inverse of the element in the multi-field, see @cite boissonnat:hal-00922572.
|
|
253
|
+
*
|
|
254
|
+
* @return The inverse.
|
|
255
|
+
*/
|
|
256
|
+
Shared_multi_field_element get_inverse() const;
|
|
257
|
+
/**
|
|
258
|
+
* @brief Returns the inverse of the element with respect to a sub-product of the characteristics in the multi-field,
|
|
259
|
+
* see @cite boissonnat:hal-00922572.
|
|
260
|
+
*
|
|
261
|
+
* @param productOfCharacteristics Sub-product of the characteristics.
|
|
262
|
+
* @return Pair of the inverse and the characteristic the inverse corresponds to.
|
|
263
|
+
*/
|
|
264
|
+
std::pair<Shared_multi_field_element, Characteristic> get_partial_inverse(
|
|
265
|
+
const Characteristic& productOfCharacteristics) const;
|
|
266
|
+
|
|
267
|
+
/**
|
|
268
|
+
* @brief Returns the additive identity of a field.
|
|
269
|
+
*
|
|
270
|
+
* @return The additive identity of a field.
|
|
271
|
+
*/
|
|
272
|
+
static Shared_multi_field_element get_additive_identity();
|
|
273
|
+
/**
|
|
274
|
+
* @brief Returns the multiplicative identity of a field.
|
|
275
|
+
*
|
|
276
|
+
* @return The multiplicative identity of a field.
|
|
277
|
+
*/
|
|
278
|
+
static Shared_multi_field_element get_multiplicative_identity();
|
|
279
|
+
/**
|
|
280
|
+
* @brief Returns the partial multiplicative identity of the multi-field from the given product.
|
|
281
|
+
* See @cite boissonnat:hal-00922572 for more details.
|
|
282
|
+
*
|
|
283
|
+
* @param productOfCharacteristics Product of the different characteristics to take into account in the multi-field.
|
|
284
|
+
* @return The partial multiplicative identity of the multi-field.
|
|
285
|
+
*/
|
|
286
|
+
static Shared_multi_field_element get_partial_multiplicative_identity(
|
|
287
|
+
const Characteristic& productOfCharacteristics);
|
|
288
|
+
/**
|
|
289
|
+
* @brief Returns the product of all characteristics.
|
|
290
|
+
*
|
|
291
|
+
* @return The product of all characteristics.
|
|
292
|
+
*/
|
|
293
|
+
static Characteristic get_characteristic();
|
|
294
|
+
|
|
295
|
+
/**
|
|
296
|
+
* @brief Returns the value of the element.
|
|
297
|
+
*
|
|
298
|
+
* @return Value of the element.
|
|
299
|
+
*/
|
|
300
|
+
Element get_value() const;
|
|
301
|
+
|
|
302
|
+
// static constexpr bool handles_only_z2() { return false; }
|
|
303
|
+
|
|
304
|
+
private:
|
|
305
|
+
Element element_; /**< Element. */
|
|
306
|
+
static inline std::vector<unsigned int> primes_; /**< All characteristics. */
|
|
307
|
+
static inline Characteristic productOfAllCharacteristics_ = 0; /**< Product of all characteristics. */
|
|
308
|
+
static inline std::vector<Element> partials_; /**< Partial products of the characteristics. */
|
|
309
|
+
static inline const Element multiplicativeID_ = 1; /**< Multiplicative identity. */
|
|
310
|
+
|
|
311
|
+
static constexpr bool _is_prime(const int p);
|
|
312
|
+
};
|
|
313
|
+
|
|
314
|
+
inline Shared_multi_field_element::Shared_multi_field_element() : element_(0) {}
|
|
315
|
+
|
|
316
|
+
inline Shared_multi_field_element::Shared_multi_field_element(Element element) : element_(element) {
|
|
317
|
+
mpz_mod(element_.get_mpz_t(), element_.get_mpz_t(), productOfAllCharacteristics_.get_mpz_t());
|
|
318
|
+
}
|
|
319
|
+
|
|
320
|
+
inline Shared_multi_field_element::Shared_multi_field_element(const Shared_multi_field_element& toCopy)
|
|
321
|
+
: element_(toCopy.element_) {}
|
|
322
|
+
|
|
323
|
+
inline Shared_multi_field_element::Shared_multi_field_element(Shared_multi_field_element&& toMove) noexcept
|
|
324
|
+
: element_(std::move(toMove.element_)) {}
|
|
325
|
+
|
|
326
|
+
inline void Shared_multi_field_element::initialize(unsigned int minimum, unsigned int maximum) {
|
|
327
|
+
if (maximum < 2) throw std::invalid_argument("Characteristic must be strictly positive");
|
|
328
|
+
if (minimum > maximum) throw std::invalid_argument("The given interval is not valid.");
|
|
329
|
+
if (minimum == maximum && !_is_prime(minimum))
|
|
330
|
+
throw std::invalid_argument("The given interval does not contain a prime number.");
|
|
331
|
+
|
|
332
|
+
unsigned int curr_prime = minimum;
|
|
333
|
+
mpz_t tmp_prime;
|
|
334
|
+
mpz_init_set_ui(tmp_prime, minimum);
|
|
335
|
+
// test if min_prime is prime
|
|
336
|
+
int is_prime = mpz_probab_prime_p(tmp_prime, 25); // probabilistic primality test
|
|
337
|
+
|
|
338
|
+
if (is_prime == 0) { // min_prime is composite
|
|
339
|
+
mpz_nextprime(tmp_prime, tmp_prime);
|
|
340
|
+
curr_prime = mpz_get_ui(tmp_prime);
|
|
341
|
+
}
|
|
342
|
+
|
|
343
|
+
primes_.clear();
|
|
344
|
+
while (curr_prime <= maximum) {
|
|
345
|
+
primes_.push_back(curr_prime);
|
|
346
|
+
mpz_nextprime(tmp_prime, tmp_prime);
|
|
347
|
+
curr_prime = mpz_get_ui(tmp_prime);
|
|
348
|
+
}
|
|
349
|
+
mpz_clear(tmp_prime);
|
|
350
|
+
|
|
351
|
+
if (primes_.empty()) throw std::invalid_argument("The given interval does not contain a prime number.");
|
|
352
|
+
|
|
353
|
+
productOfAllCharacteristics_ = 1;
|
|
354
|
+
for (const unsigned int p : primes_) {
|
|
355
|
+
productOfAllCharacteristics_ *= p;
|
|
356
|
+
}
|
|
357
|
+
|
|
358
|
+
partials_.resize(primes_.size());
|
|
359
|
+
for (unsigned int i = 0; i < primes_.size(); ++i) {
|
|
360
|
+
unsigned int p = primes_[i];
|
|
361
|
+
partials_[i] = productOfAllCharacteristics_ / p;
|
|
362
|
+
mpz_powm_ui(partials_[i].get_mpz_t(), partials_[i].get_mpz_t(), p - 1, productOfAllCharacteristics_.get_mpz_t());
|
|
363
|
+
}
|
|
364
|
+
|
|
365
|
+
// If I understood the paper well, multiplicativeID_ always equals to 1. But in Clement's code,
|
|
366
|
+
// multiplicativeID_ is computed (see commented loop below). TODO: verify with Clement.
|
|
367
|
+
// for (unsigned int i = 0; i < partials_.size(); ++i){
|
|
368
|
+
// multiplicativeID_ = (multiplicativeID_ + partials_[i]) % productOfAllCharacteristics_;
|
|
369
|
+
// }
|
|
370
|
+
}
|
|
371
|
+
|
|
372
|
+
inline Shared_multi_field_element& Shared_multi_field_element::operator=(Shared_multi_field_element other) {
|
|
373
|
+
std::swap(element_, other.element_);
|
|
374
|
+
return *this;
|
|
375
|
+
}
|
|
376
|
+
|
|
377
|
+
inline Shared_multi_field_element& Shared_multi_field_element::operator=(const Element& value) {
|
|
378
|
+
mpz_mod(element_.get_mpz_t(), value.get_mpz_t(), productOfAllCharacteristics_.get_mpz_t());
|
|
379
|
+
return *this;
|
|
380
|
+
}
|
|
381
|
+
|
|
382
|
+
inline Shared_multi_field_element::operator unsigned int() const { return element_.get_ui(); }
|
|
383
|
+
|
|
384
|
+
inline Shared_multi_field_element::operator mpz_class() const { return element_; }
|
|
385
|
+
|
|
386
|
+
inline Shared_multi_field_element Shared_multi_field_element::get_inverse() const {
|
|
387
|
+
return get_partial_inverse(productOfAllCharacteristics_).first;
|
|
388
|
+
}
|
|
389
|
+
|
|
390
|
+
inline std::pair<Shared_multi_field_element, Shared_multi_field_element::Characteristic>
|
|
391
|
+
Shared_multi_field_element::get_partial_inverse(const Characteristic& productOfCharacteristics) const {
|
|
392
|
+
Element QR;
|
|
393
|
+
mpz_gcd(QR.get_mpz_t(), element_.get_mpz_t(), productOfCharacteristics.get_mpz_t()); // QR <- gcd(x,QS)
|
|
394
|
+
|
|
395
|
+
if (QR == productOfCharacteristics) return {Shared_multi_field_element(), multiplicativeID_}; // partial inverse is 0
|
|
396
|
+
|
|
397
|
+
Element QT = productOfCharacteristics / QR;
|
|
398
|
+
|
|
399
|
+
Element inv_qt;
|
|
400
|
+
mpz_invert(inv_qt.get_mpz_t(), element_.get_mpz_t(), QT.get_mpz_t());
|
|
401
|
+
|
|
402
|
+
auto res = get_partial_multiplicative_identity(QT);
|
|
403
|
+
res *= inv_qt;
|
|
404
|
+
|
|
405
|
+
return {res, QT};
|
|
406
|
+
}
|
|
407
|
+
|
|
408
|
+
inline Shared_multi_field_element Shared_multi_field_element::get_additive_identity() {
|
|
409
|
+
return Shared_multi_field_element();
|
|
410
|
+
}
|
|
411
|
+
|
|
412
|
+
inline Shared_multi_field_element Shared_multi_field_element::get_multiplicative_identity() {
|
|
413
|
+
return Shared_multi_field_element(multiplicativeID_);
|
|
414
|
+
}
|
|
415
|
+
|
|
416
|
+
inline Shared_multi_field_element Shared_multi_field_element::get_partial_multiplicative_identity(
|
|
417
|
+
const Characteristic& productOfCharacteristics) {
|
|
418
|
+
if (productOfCharacteristics == 0) {
|
|
419
|
+
return Shared_multi_field_element(multiplicativeID_);
|
|
420
|
+
}
|
|
421
|
+
Shared_multi_field_element mult;
|
|
422
|
+
for (unsigned int idx = 0; idx < primes_.size(); ++idx) {
|
|
423
|
+
if ((productOfCharacteristics % primes_[idx]) == 0) {
|
|
424
|
+
mult += partials_[idx];
|
|
425
|
+
}
|
|
426
|
+
}
|
|
427
|
+
return mult;
|
|
428
|
+
}
|
|
429
|
+
|
|
430
|
+
inline Shared_multi_field_element::Characteristic Shared_multi_field_element::get_characteristic() {
|
|
431
|
+
return productOfAllCharacteristics_;
|
|
432
|
+
}
|
|
433
|
+
|
|
434
|
+
inline Shared_multi_field_element::Element Shared_multi_field_element::get_value() const { return element_; }
|
|
435
|
+
|
|
436
|
+
inline constexpr bool Shared_multi_field_element::_is_prime(const int p) {
|
|
437
|
+
if (p <= 1) return false;
|
|
438
|
+
if (p <= 3) return true;
|
|
439
|
+
if (p % 2 == 0 || p % 3 == 0) return false;
|
|
440
|
+
|
|
441
|
+
for (long i = 5; i * i <= p; i = i + 6)
|
|
442
|
+
if (p % i == 0 || p % (i + 2) == 0) return false;
|
|
443
|
+
|
|
444
|
+
return true;
|
|
445
|
+
}
|
|
446
|
+
|
|
447
|
+
} // namespace persistence_fields
|
|
448
|
+
} // namespace Gudhi
|
|
449
|
+
|
|
450
|
+
#endif // MATRIX_FIELD_MULTI_SHARED_H_
|