multipers 2.4.0b1__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.
- multipers/.dylibs/libboost_timer.dylib +0 -0
- multipers/.dylibs/libc++.1.0.dylib +0 -0
- multipers/.dylibs/libtbb.12.17.dylib +0 -0
- multipers/__init__.py +33 -0
- multipers/_signed_measure_meta.py +426 -0
- multipers/_slicer_meta.py +231 -0
- multipers/array_api/__init__.py +62 -0
- multipers/array_api/numpy.py +124 -0
- multipers/array_api/torch.py +133 -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 +736 -0
- multipers/filtration_conversions.pxd.tp +226 -0
- multipers/filtrations/__init__.py +21 -0
- multipers/filtrations/density.py +529 -0
- multipers/filtrations/filtrations.py +480 -0
- multipers/filtrations.pxd +534 -0
- multipers/filtrations.pxd.tp +332 -0
- multipers/function_rips.cpython-312-darwin.so +0 -0
- multipers/function_rips.pyx +104 -0
- multipers/grids.cpython-312-darwin.so +0 -0
- multipers/grids.pyx +538 -0
- multipers/gudhi/Persistence_slices_interface.h +213 -0
- multipers/gudhi/Simplex_tree_interface.h +274 -0
- multipers/gudhi/Simplex_tree_multi_interface.h +648 -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 +52 -0
- multipers/gudhi/gudhi/Degree_rips_bifiltration.h +2307 -0
- multipers/gudhi/gudhi/Dynamic_multi_parameter_filtration.h +2524 -0
- multipers/gudhi/gudhi/Fields/Multi_field.h +453 -0
- multipers/gudhi/gudhi/Fields/Multi_field_operators.h +460 -0
- multipers/gudhi/gudhi/Fields/Multi_field_shared.h +444 -0
- multipers/gudhi/gudhi/Fields/Multi_field_small.h +584 -0
- multipers/gudhi/gudhi/Fields/Multi_field_small_operators.h +490 -0
- multipers/gudhi/gudhi/Fields/Multi_field_small_shared.h +580 -0
- multipers/gudhi/gudhi/Fields/Z2_field.h +391 -0
- multipers/gudhi/gudhi/Fields/Z2_field_operators.h +389 -0
- multipers/gudhi/gudhi/Fields/Zp_field.h +493 -0
- multipers/gudhi/gudhi/Fields/Zp_field_operators.h +384 -0
- multipers/gudhi/gudhi/Fields/Zp_field_shared.h +492 -0
- multipers/gudhi/gudhi/Flag_complex_edge_collapser.h +337 -0
- multipers/gudhi/gudhi/Matrix.h +2200 -0
- multipers/gudhi/gudhi/Multi_filtration/Multi_parameter_generator.h +1712 -0
- multipers/gudhi/gudhi/Multi_filtration/multi_filtration_conversions.h +237 -0
- multipers/gudhi/gudhi/Multi_filtration/multi_filtration_utils.h +225 -0
- multipers/gudhi/gudhi/Multi_parameter_filtered_complex.h +485 -0
- multipers/gudhi/gudhi/Multi_parameter_filtration.h +2643 -0
- multipers/gudhi/gudhi/Multi_persistence/Box.h +233 -0
- multipers/gudhi/gudhi/Multi_persistence/Line.h +309 -0
- multipers/gudhi/gudhi/Multi_persistence/Multi_parameter_filtered_complex_pcoh_interface.h +268 -0
- multipers/gudhi/gudhi/Multi_persistence/Persistence_interface_cohomology.h +159 -0
- multipers/gudhi/gudhi/Multi_persistence/Persistence_interface_matrix.h +463 -0
- multipers/gudhi/gudhi/Multi_persistence/Point.h +853 -0
- multipers/gudhi/gudhi/Off_reader.h +173 -0
- multipers/gudhi/gudhi/Persistence_matrix/Base_matrix.h +834 -0
- multipers/gudhi/gudhi/Persistence_matrix/Base_matrix_with_column_compression.h +838 -0
- multipers/gudhi/gudhi/Persistence_matrix/Boundary_matrix.h +833 -0
- multipers/gudhi/gudhi/Persistence_matrix/Chain_matrix.h +1367 -0
- multipers/gudhi/gudhi/Persistence_matrix/Id_to_index_overlay.h +1157 -0
- multipers/gudhi/gudhi/Persistence_matrix/Position_to_index_overlay.h +869 -0
- multipers/gudhi/gudhi/Persistence_matrix/RU_matrix.h +905 -0
- multipers/gudhi/gudhi/Persistence_matrix/allocators/entry_constructors.h +122 -0
- multipers/gudhi/gudhi/Persistence_matrix/base_pairing.h +260 -0
- multipers/gudhi/gudhi/Persistence_matrix/base_swap.h +288 -0
- multipers/gudhi/gudhi/Persistence_matrix/chain_pairing.h +170 -0
- multipers/gudhi/gudhi/Persistence_matrix/chain_rep_cycles.h +247 -0
- multipers/gudhi/gudhi/Persistence_matrix/chain_vine_swap.h +571 -0
- multipers/gudhi/gudhi/Persistence_matrix/columns/chain_column_extra_properties.h +182 -0
- multipers/gudhi/gudhi/Persistence_matrix/columns/column_dimension_holder.h +130 -0
- multipers/gudhi/gudhi/Persistence_matrix/columns/column_utilities.h +235 -0
- multipers/gudhi/gudhi/Persistence_matrix/columns/entry_types.h +312 -0
- multipers/gudhi/gudhi/Persistence_matrix/columns/heap_column.h +1092 -0
- multipers/gudhi/gudhi/Persistence_matrix/columns/intrusive_list_column.h +923 -0
- multipers/gudhi/gudhi/Persistence_matrix/columns/intrusive_set_column.h +914 -0
- multipers/gudhi/gudhi/Persistence_matrix/columns/list_column.h +930 -0
- multipers/gudhi/gudhi/Persistence_matrix/columns/naive_vector_column.h +1071 -0
- multipers/gudhi/gudhi/Persistence_matrix/columns/row_access.h +203 -0
- multipers/gudhi/gudhi/Persistence_matrix/columns/set_column.h +886 -0
- multipers/gudhi/gudhi/Persistence_matrix/columns/unordered_set_column.h +984 -0
- multipers/gudhi/gudhi/Persistence_matrix/columns/vector_column.h +1213 -0
- multipers/gudhi/gudhi/Persistence_matrix/index_mapper.h +58 -0
- multipers/gudhi/gudhi/Persistence_matrix/matrix_dimension_holders.h +227 -0
- multipers/gudhi/gudhi/Persistence_matrix/matrix_row_access.h +200 -0
- multipers/gudhi/gudhi/Persistence_matrix/ru_pairing.h +166 -0
- multipers/gudhi/gudhi/Persistence_matrix/ru_rep_cycles.h +319 -0
- multipers/gudhi/gudhi/Persistence_matrix/ru_vine_swap.h +562 -0
- multipers/gudhi/gudhi/Persistence_on_a_line.h +152 -0
- multipers/gudhi/gudhi/Persistence_on_rectangle.h +617 -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 +769 -0
- multipers/gudhi/gudhi/Points_off_io.h +171 -0
- multipers/gudhi/gudhi/Projective_cover_kernel.h +379 -0
- multipers/gudhi/gudhi/Simple_object_pool.h +69 -0
- multipers/gudhi/gudhi/Simplex_tree/Simplex_tree_iterators.h +559 -0
- multipers/gudhi/gudhi/Simplex_tree/Simplex_tree_node_explicit_storage.h +83 -0
- multipers/gudhi/gudhi/Simplex_tree/Simplex_tree_siblings.h +121 -0
- multipers/gudhi/gudhi/Simplex_tree/Simplex_tree_star_simplex_iterators.h +277 -0
- multipers/gudhi/gudhi/Simplex_tree/filtration_value_utils.h +155 -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 +60 -0
- multipers/gudhi/gudhi/Simplex_tree/simplex_tree_options.h +105 -0
- multipers/gudhi/gudhi/Simplex_tree.h +3170 -0
- multipers/gudhi/gudhi/Slicer.h +848 -0
- multipers/gudhi/gudhi/Thread_safe_slicer.h +393 -0
- multipers/gudhi/gudhi/distance_functions.h +62 -0
- multipers/gudhi/gudhi/graph_simplicial_complex.h +104 -0
- multipers/gudhi/gudhi/multi_simplex_tree_helpers.h +147 -0
- multipers/gudhi/gudhi/persistence_interval.h +263 -0
- multipers/gudhi/gudhi/persistence_matrix_options.h +188 -0
- multipers/gudhi/gudhi/reader_utils.h +367 -0
- multipers/gudhi/gudhi/simple_mdspan.h +484 -0
- multipers/gudhi/gudhi/slicer_helpers.h +779 -0
- multipers/gudhi/tmp_h0_pers/mma_interface_h0.h +223 -0
- multipers/gudhi/tmp_h0_pers/naive_merge_tree.h +536 -0
- multipers/io.cpython-312-darwin.so +0 -0
- multipers/io.pyx +472 -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 +1667 -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 +134 -0
- multipers/mma_structures.pyx +1483 -0
- multipers/mma_structures.pyx.tp +1126 -0
- multipers/multi_parameter_rank_invariant/diff_helpers.h +85 -0
- multipers/multi_parameter_rank_invariant/euler_characteristic.h +95 -0
- multipers/multi_parameter_rank_invariant/function_rips.h +317 -0
- multipers/multi_parameter_rank_invariant/hilbert_function.h +761 -0
- multipers/multi_parameter_rank_invariant/persistence_slices.h +149 -0
- multipers/multi_parameter_rank_invariant/rank_invariant.h +350 -0
- multipers/multiparameter_edge_collapse.py +41 -0
- multipers/multiparameter_module_approximation/approximation.h +2541 -0
- multipers/multiparameter_module_approximation/debug.h +107 -0
- multipers/multiparameter_module_approximation/format_python-cpp.h +292 -0
- multipers/multiparameter_module_approximation/utilities.h +428 -0
- multipers/multiparameter_module_approximation.cpython-312-darwin.so +0 -0
- multipers/multiparameter_module_approximation.pyx +286 -0
- multipers/ops.cpython-312-darwin.so +0 -0
- multipers/ops.pyx +231 -0
- multipers/pickle.py +89 -0
- multipers/plots.py +550 -0
- multipers/point_measure.cpython-312-darwin.so +0 -0
- multipers/point_measure.pyx +409 -0
- multipers/simplex_tree_multi.cpython-312-darwin.so +0 -0
- multipers/simplex_tree_multi.pxd +136 -0
- multipers/simplex_tree_multi.pyx +11719 -0
- multipers/simplex_tree_multi.pyx.tp +2102 -0
- multipers/slicer.cpython-312-darwin.so +0 -0
- multipers/slicer.pxd +2097 -0
- multipers/slicer.pxd.tp +263 -0
- multipers/slicer.pyx +13042 -0
- multipers/slicer.pyx.tp +1259 -0
- multipers/tensor/tensor.h +672 -0
- multipers/tensor.pxd +13 -0
- multipers/test.pyx +44 -0
- multipers/tests/__init__.py +70 -0
- multipers/torch/__init__.py +1 -0
- multipers/torch/diff_grids.py +240 -0
- multipers/torch/rips_density.py +310 -0
- multipers/vector_interface.pxd +46 -0
- multipers-2.4.0b1.dist-info/METADATA +131 -0
- multipers-2.4.0b1.dist-info/RECORD +184 -0
- multipers-2.4.0b1.dist-info/WHEEL +6 -0
- multipers-2.4.0b1.dist-info/licenses/LICENSE +21 -0
- multipers-2.4.0b1.dist-info/top_level.txt +1 -0
|
@@ -0,0 +1,534 @@
|
|
|
1
|
+
from libcpp.utility cimport pair
|
|
2
|
+
from libcpp cimport bool
|
|
3
|
+
from libcpp.vector cimport vector
|
|
4
|
+
from libcpp cimport tuple
|
|
5
|
+
from libc.stdint cimport uintptr_t,intptr_t
|
|
6
|
+
from cpython cimport Py_buffer
|
|
7
|
+
from libc.stdint cimport int32_t, int64_t
|
|
8
|
+
|
|
9
|
+
cdef extern from "gudhi/Persistence_slices_interface.h" namespace "multipers::tmp_interface":
|
|
10
|
+
cdef cppclass KFlat_i32 "Gudhi::multi_filtration::Degree_rips_bifiltration<int32_t,false,!true>":
|
|
11
|
+
KFlat_i32() except + nogil
|
|
12
|
+
KFlat_i32(int) except + nogil
|
|
13
|
+
KFlat_i32(int, int32_t) except + nogil
|
|
14
|
+
KFlat_i32(vector[int32_t]&) except + nogil
|
|
15
|
+
KFlat_i32(vector[int32_t].iterator, vector[int32_t].iterator, int) except + nogil
|
|
16
|
+
KFlat_i32& operator=(const KFlat_i32&) except + nogil
|
|
17
|
+
int32_t& operator()(size_t, size_t) nogil
|
|
18
|
+
size_t num_parameters() nogil
|
|
19
|
+
size_t num_generators() nogil
|
|
20
|
+
size_t num_entries() nogil
|
|
21
|
+
void set_num_generators(size_t) nogil
|
|
22
|
+
@staticmethod
|
|
23
|
+
KFlat_i32 inf(int)
|
|
24
|
+
@staticmethod
|
|
25
|
+
KFlat_i32 minus_inf(int)
|
|
26
|
+
@staticmethod
|
|
27
|
+
KFlat_i32 nan(int)
|
|
28
|
+
bool is_plus_inf() nogil
|
|
29
|
+
bool is_minus_inf() nogil
|
|
30
|
+
bool is_nan() nogil
|
|
31
|
+
bool is_finite() nogil
|
|
32
|
+
bool add_generator(vector[int32_t] &x) nogil
|
|
33
|
+
bool add_generator(vector[int32_t] x) nogil
|
|
34
|
+
void add_guaranteed_generator(vector[int32_t] &x) nogil
|
|
35
|
+
void simplify() nogil
|
|
36
|
+
void remove_empty_generators(bool) nogil
|
|
37
|
+
bool push_to_least_common_upper_bound(vector[int32_t] &, bool) nogil
|
|
38
|
+
bool push_to_least_common_upper_bound(const KFlat_i32 &, bool) nogil
|
|
39
|
+
bool pull_to_greatest_common_lower_bound(vector[int32_t] &, bool) nogil
|
|
40
|
+
cdef cppclass Flat_i32 "Gudhi::multi_filtration::Degree_rips_bifiltration<int32_t,false,!false>":
|
|
41
|
+
Flat_i32() except + nogil
|
|
42
|
+
Flat_i32(int) except + nogil
|
|
43
|
+
Flat_i32(int, int32_t) except + nogil
|
|
44
|
+
Flat_i32(vector[int32_t]&) except + nogil
|
|
45
|
+
Flat_i32(vector[int32_t].iterator, vector[int32_t].iterator, int) except + nogil
|
|
46
|
+
Flat_i32& operator=(const Flat_i32&) except + nogil
|
|
47
|
+
int32_t& operator()(size_t, size_t) nogil
|
|
48
|
+
size_t num_parameters() nogil
|
|
49
|
+
size_t num_generators() nogil
|
|
50
|
+
size_t num_entries() nogil
|
|
51
|
+
void set_num_generators(size_t) nogil
|
|
52
|
+
@staticmethod
|
|
53
|
+
Flat_i32 inf(int)
|
|
54
|
+
@staticmethod
|
|
55
|
+
Flat_i32 minus_inf(int)
|
|
56
|
+
@staticmethod
|
|
57
|
+
Flat_i32 nan(int)
|
|
58
|
+
bool is_plus_inf() nogil
|
|
59
|
+
bool is_minus_inf() nogil
|
|
60
|
+
bool is_nan() nogil
|
|
61
|
+
bool is_finite() nogil
|
|
62
|
+
bool add_generator(vector[int32_t] &x) nogil
|
|
63
|
+
bool add_generator(vector[int32_t] x) nogil
|
|
64
|
+
void add_guaranteed_generator(vector[int32_t] &x) nogil
|
|
65
|
+
void simplify() nogil
|
|
66
|
+
void remove_empty_generators(bool) nogil
|
|
67
|
+
bool push_to_least_common_upper_bound(vector[int32_t] &, bool) nogil
|
|
68
|
+
bool push_to_least_common_upper_bound(const Flat_i32 &, bool) nogil
|
|
69
|
+
bool pull_to_greatest_common_lower_bound(vector[int32_t] &, bool) nogil
|
|
70
|
+
cdef cppclass KFlat_f64 "Gudhi::multi_filtration::Degree_rips_bifiltration<double,false,!true>":
|
|
71
|
+
KFlat_f64() except + nogil
|
|
72
|
+
KFlat_f64(int) except + nogil
|
|
73
|
+
KFlat_f64(int, double) except + nogil
|
|
74
|
+
KFlat_f64(vector[double]&) except + nogil
|
|
75
|
+
KFlat_f64(vector[double].iterator, vector[double].iterator, int) except + nogil
|
|
76
|
+
KFlat_f64& operator=(const KFlat_f64&) except + nogil
|
|
77
|
+
double& operator()(size_t, size_t) nogil
|
|
78
|
+
size_t num_parameters() nogil
|
|
79
|
+
size_t num_generators() nogil
|
|
80
|
+
size_t num_entries() nogil
|
|
81
|
+
void set_num_generators(size_t) nogil
|
|
82
|
+
@staticmethod
|
|
83
|
+
KFlat_f64 inf(int)
|
|
84
|
+
@staticmethod
|
|
85
|
+
KFlat_f64 minus_inf(int)
|
|
86
|
+
@staticmethod
|
|
87
|
+
KFlat_f64 nan(int)
|
|
88
|
+
bool is_plus_inf() nogil
|
|
89
|
+
bool is_minus_inf() nogil
|
|
90
|
+
bool is_nan() nogil
|
|
91
|
+
bool is_finite() nogil
|
|
92
|
+
bool add_generator(vector[double] &x) nogil
|
|
93
|
+
bool add_generator(vector[double] x) nogil
|
|
94
|
+
void add_guaranteed_generator(vector[double] &x) nogil
|
|
95
|
+
void simplify() nogil
|
|
96
|
+
void remove_empty_generators(bool) nogil
|
|
97
|
+
bool push_to_least_common_upper_bound(vector[double] &, bool) nogil
|
|
98
|
+
bool push_to_least_common_upper_bound(const KFlat_f64 &, bool) nogil
|
|
99
|
+
bool pull_to_greatest_common_lower_bound(vector[double] &, bool) nogil
|
|
100
|
+
cdef cppclass Flat_f64 "Gudhi::multi_filtration::Degree_rips_bifiltration<double,false,!false>":
|
|
101
|
+
Flat_f64() except + nogil
|
|
102
|
+
Flat_f64(int) except + nogil
|
|
103
|
+
Flat_f64(int, double) except + nogil
|
|
104
|
+
Flat_f64(vector[double]&) except + nogil
|
|
105
|
+
Flat_f64(vector[double].iterator, vector[double].iterator, int) except + nogil
|
|
106
|
+
Flat_f64& operator=(const Flat_f64&) except + nogil
|
|
107
|
+
double& operator()(size_t, size_t) nogil
|
|
108
|
+
size_t num_parameters() nogil
|
|
109
|
+
size_t num_generators() nogil
|
|
110
|
+
size_t num_entries() nogil
|
|
111
|
+
void set_num_generators(size_t) nogil
|
|
112
|
+
@staticmethod
|
|
113
|
+
Flat_f64 inf(int)
|
|
114
|
+
@staticmethod
|
|
115
|
+
Flat_f64 minus_inf(int)
|
|
116
|
+
@staticmethod
|
|
117
|
+
Flat_f64 nan(int)
|
|
118
|
+
bool is_plus_inf() nogil
|
|
119
|
+
bool is_minus_inf() nogil
|
|
120
|
+
bool is_nan() nogil
|
|
121
|
+
bool is_finite() nogil
|
|
122
|
+
bool add_generator(vector[double] &x) nogil
|
|
123
|
+
bool add_generator(vector[double] x) nogil
|
|
124
|
+
void add_guaranteed_generator(vector[double] &x) nogil
|
|
125
|
+
void simplify() nogil
|
|
126
|
+
void remove_empty_generators(bool) nogil
|
|
127
|
+
bool push_to_least_common_upper_bound(vector[double] &, bool) nogil
|
|
128
|
+
bool push_to_least_common_upper_bound(const Flat_f64 &, bool) nogil
|
|
129
|
+
bool pull_to_greatest_common_lower_bound(vector[double] &, bool) nogil
|
|
130
|
+
cdef cppclass KContiguous_i32 "Gudhi::multi_filtration::Multi_parameter_filtration<int32_t,false,!true>":
|
|
131
|
+
KContiguous_i32() except + nogil
|
|
132
|
+
KContiguous_i32(int) except + nogil
|
|
133
|
+
KContiguous_i32(int, int32_t) except + nogil
|
|
134
|
+
KContiguous_i32(vector[int32_t]&) except + nogil
|
|
135
|
+
KContiguous_i32(vector[int32_t].iterator, vector[int32_t].iterator, int) except + nogil
|
|
136
|
+
KContiguous_i32& operator=(const KContiguous_i32&) except + nogil
|
|
137
|
+
int32_t& operator()(size_t, size_t) nogil
|
|
138
|
+
size_t num_parameters() nogil
|
|
139
|
+
size_t num_generators() nogil
|
|
140
|
+
size_t num_entries() nogil
|
|
141
|
+
void set_num_generators(size_t) nogil
|
|
142
|
+
@staticmethod
|
|
143
|
+
KContiguous_i32 inf(int)
|
|
144
|
+
@staticmethod
|
|
145
|
+
KContiguous_i32 minus_inf(int)
|
|
146
|
+
@staticmethod
|
|
147
|
+
KContiguous_i32 nan(int)
|
|
148
|
+
bool is_plus_inf() nogil
|
|
149
|
+
bool is_minus_inf() nogil
|
|
150
|
+
bool is_nan() nogil
|
|
151
|
+
bool is_finite() nogil
|
|
152
|
+
bool add_generator(vector[int32_t] &x) nogil
|
|
153
|
+
bool add_generator(vector[int32_t] x) nogil
|
|
154
|
+
void add_guaranteed_generator(vector[int32_t] &x) nogil
|
|
155
|
+
void simplify() nogil
|
|
156
|
+
void remove_empty_generators(bool) nogil
|
|
157
|
+
bool push_to_least_common_upper_bound(vector[int32_t] &, bool) nogil
|
|
158
|
+
bool push_to_least_common_upper_bound(const KContiguous_i32 &, bool) nogil
|
|
159
|
+
bool pull_to_greatest_common_lower_bound(vector[int32_t] &, bool) nogil
|
|
160
|
+
cdef cppclass Contiguous_i32 "Gudhi::multi_filtration::Multi_parameter_filtration<int32_t,false,!false>":
|
|
161
|
+
Contiguous_i32() except + nogil
|
|
162
|
+
Contiguous_i32(int) except + nogil
|
|
163
|
+
Contiguous_i32(int, int32_t) except + nogil
|
|
164
|
+
Contiguous_i32(vector[int32_t]&) except + nogil
|
|
165
|
+
Contiguous_i32(vector[int32_t].iterator, vector[int32_t].iterator, int) except + nogil
|
|
166
|
+
Contiguous_i32& operator=(const Contiguous_i32&) except + nogil
|
|
167
|
+
int32_t& operator()(size_t, size_t) nogil
|
|
168
|
+
size_t num_parameters() nogil
|
|
169
|
+
size_t num_generators() nogil
|
|
170
|
+
size_t num_entries() nogil
|
|
171
|
+
void set_num_generators(size_t) nogil
|
|
172
|
+
@staticmethod
|
|
173
|
+
Contiguous_i32 inf(int)
|
|
174
|
+
@staticmethod
|
|
175
|
+
Contiguous_i32 minus_inf(int)
|
|
176
|
+
@staticmethod
|
|
177
|
+
Contiguous_i32 nan(int)
|
|
178
|
+
bool is_plus_inf() nogil
|
|
179
|
+
bool is_minus_inf() nogil
|
|
180
|
+
bool is_nan() nogil
|
|
181
|
+
bool is_finite() nogil
|
|
182
|
+
bool add_generator(vector[int32_t] &x) nogil
|
|
183
|
+
bool add_generator(vector[int32_t] x) nogil
|
|
184
|
+
void add_guaranteed_generator(vector[int32_t] &x) nogil
|
|
185
|
+
void simplify() nogil
|
|
186
|
+
void remove_empty_generators(bool) nogil
|
|
187
|
+
bool push_to_least_common_upper_bound(vector[int32_t] &, bool) nogil
|
|
188
|
+
bool push_to_least_common_upper_bound(const Contiguous_i32 &, bool) nogil
|
|
189
|
+
bool pull_to_greatest_common_lower_bound(vector[int32_t] &, bool) nogil
|
|
190
|
+
cdef cppclass KContiguous_f64 "Gudhi::multi_filtration::Multi_parameter_filtration<double,false,!true>":
|
|
191
|
+
KContiguous_f64() except + nogil
|
|
192
|
+
KContiguous_f64(int) except + nogil
|
|
193
|
+
KContiguous_f64(int, double) except + nogil
|
|
194
|
+
KContiguous_f64(vector[double]&) except + nogil
|
|
195
|
+
KContiguous_f64(vector[double].iterator, vector[double].iterator, int) except + nogil
|
|
196
|
+
KContiguous_f64& operator=(const KContiguous_f64&) except + nogil
|
|
197
|
+
double& operator()(size_t, size_t) nogil
|
|
198
|
+
size_t num_parameters() nogil
|
|
199
|
+
size_t num_generators() nogil
|
|
200
|
+
size_t num_entries() nogil
|
|
201
|
+
void set_num_generators(size_t) nogil
|
|
202
|
+
@staticmethod
|
|
203
|
+
KContiguous_f64 inf(int)
|
|
204
|
+
@staticmethod
|
|
205
|
+
KContiguous_f64 minus_inf(int)
|
|
206
|
+
@staticmethod
|
|
207
|
+
KContiguous_f64 nan(int)
|
|
208
|
+
bool is_plus_inf() nogil
|
|
209
|
+
bool is_minus_inf() nogil
|
|
210
|
+
bool is_nan() nogil
|
|
211
|
+
bool is_finite() nogil
|
|
212
|
+
bool add_generator(vector[double] &x) nogil
|
|
213
|
+
bool add_generator(vector[double] x) nogil
|
|
214
|
+
void add_guaranteed_generator(vector[double] &x) nogil
|
|
215
|
+
void simplify() nogil
|
|
216
|
+
void remove_empty_generators(bool) nogil
|
|
217
|
+
bool push_to_least_common_upper_bound(vector[double] &, bool) nogil
|
|
218
|
+
bool push_to_least_common_upper_bound(const KContiguous_f64 &, bool) nogil
|
|
219
|
+
bool pull_to_greatest_common_lower_bound(vector[double] &, bool) nogil
|
|
220
|
+
cdef cppclass Contiguous_f64 "Gudhi::multi_filtration::Multi_parameter_filtration<double,false,!false>":
|
|
221
|
+
Contiguous_f64() except + nogil
|
|
222
|
+
Contiguous_f64(int) except + nogil
|
|
223
|
+
Contiguous_f64(int, double) except + nogil
|
|
224
|
+
Contiguous_f64(vector[double]&) except + nogil
|
|
225
|
+
Contiguous_f64(vector[double].iterator, vector[double].iterator, int) except + nogil
|
|
226
|
+
Contiguous_f64& operator=(const Contiguous_f64&) except + nogil
|
|
227
|
+
double& operator()(size_t, size_t) nogil
|
|
228
|
+
size_t num_parameters() nogil
|
|
229
|
+
size_t num_generators() nogil
|
|
230
|
+
size_t num_entries() nogil
|
|
231
|
+
void set_num_generators(size_t) nogil
|
|
232
|
+
@staticmethod
|
|
233
|
+
Contiguous_f64 inf(int)
|
|
234
|
+
@staticmethod
|
|
235
|
+
Contiguous_f64 minus_inf(int)
|
|
236
|
+
@staticmethod
|
|
237
|
+
Contiguous_f64 nan(int)
|
|
238
|
+
bool is_plus_inf() nogil
|
|
239
|
+
bool is_minus_inf() nogil
|
|
240
|
+
bool is_nan() nogil
|
|
241
|
+
bool is_finite() nogil
|
|
242
|
+
bool add_generator(vector[double] &x) nogil
|
|
243
|
+
bool add_generator(vector[double] x) nogil
|
|
244
|
+
void add_guaranteed_generator(vector[double] &x) nogil
|
|
245
|
+
void simplify() nogil
|
|
246
|
+
void remove_empty_generators(bool) nogil
|
|
247
|
+
bool push_to_least_common_upper_bound(vector[double] &, bool) nogil
|
|
248
|
+
bool push_to_least_common_upper_bound(const Contiguous_f64 &, bool) nogil
|
|
249
|
+
bool pull_to_greatest_common_lower_bound(vector[double] &, bool) nogil
|
|
250
|
+
|
|
251
|
+
cdef extern from "gudhi/Persistence_slices_interface.h" namespace "multipers::tmp_interface":
|
|
252
|
+
cdef cppclass One_critical_filtration[T]:
|
|
253
|
+
## Copied from cython vector
|
|
254
|
+
# ctypedef size_t size_type
|
|
255
|
+
# ctypedef ptrdiff_t difference_type
|
|
256
|
+
# ctypedef T value_type
|
|
257
|
+
|
|
258
|
+
One_critical_filtration() except + nogil
|
|
259
|
+
One_critical_filtration(int) except + nogil
|
|
260
|
+
One_critical_filtration(int, T) except + nogil
|
|
261
|
+
One_critical_filtration(vector[T]&) except + nogil
|
|
262
|
+
One_critical_filtration(vector[T].iterator, vector[T].iterator, int) except + nogil
|
|
263
|
+
One_critical_filtration[T]& operator=(const One_critical_filtration[T]&) except + nogil
|
|
264
|
+
T& operator()(size_t, size_t) nogil
|
|
265
|
+
size_t num_parameters() nogil
|
|
266
|
+
size_t num_generators() nogil
|
|
267
|
+
size_t num_entries() nogil
|
|
268
|
+
void set_num_generators(size_t) nogil
|
|
269
|
+
@staticmethod
|
|
270
|
+
One_critical_filtration inf(int)
|
|
271
|
+
@staticmethod
|
|
272
|
+
One_critical_filtration minus_inf(int)
|
|
273
|
+
@staticmethod
|
|
274
|
+
One_critical_filtration nan(int)
|
|
275
|
+
bool is_plus_inf() nogil
|
|
276
|
+
bool is_minus_inf() nogil
|
|
277
|
+
bool is_nan() nogil
|
|
278
|
+
bool is_finite() nogil
|
|
279
|
+
bool add_generator(vector[T] &x) nogil
|
|
280
|
+
bool add_generator(vector[T] x) nogil
|
|
281
|
+
void add_guaranteed_generator(vector[T] &x) nogil
|
|
282
|
+
void simplify() nogil
|
|
283
|
+
void remove_empty_generators(bool) nogil
|
|
284
|
+
bool push_to_least_common_upper_bound(vector[T] &, bool) nogil
|
|
285
|
+
bool push_to_least_common_upper_bound(const One_critical_filtration &, bool) nogil
|
|
286
|
+
bool pull_to_greatest_common_lower_bound(vector[T] &, bool) nogil
|
|
287
|
+
# bool pull_to_greatest_common_lower_bound(const One_critical_filtration &, bool) nogil
|
|
288
|
+
|
|
289
|
+
cdef extern from "gudhi/Persistence_slices_interface.h" namespace "multipers::tmp_interface":
|
|
290
|
+
cdef cppclass Multi_critical_filtration[T]:
|
|
291
|
+
## Copied from cython vector
|
|
292
|
+
# ctypedef size_t size_type
|
|
293
|
+
# ctypedef ptrdiff_t difference_type
|
|
294
|
+
# ctypedef T value_type
|
|
295
|
+
|
|
296
|
+
Multi_critical_filtration() except + nogil
|
|
297
|
+
Multi_critical_filtration(int) except + nogil
|
|
298
|
+
Multi_critical_filtration(int, T) except + nogil
|
|
299
|
+
Multi_critical_filtration(vector[T]&) except + nogil
|
|
300
|
+
Multi_critical_filtration(vector[T].iterator, vector[T].iterator, int) except + nogil
|
|
301
|
+
Multi_critical_filtration[T]& operator=(const Multi_critical_filtration[T]&) except + nogil
|
|
302
|
+
T& operator()(size_t, size_t) nogil
|
|
303
|
+
size_t num_parameters() nogil
|
|
304
|
+
size_t num_generators() nogil
|
|
305
|
+
size_t num_entries() nogil
|
|
306
|
+
void set_num_generators(size_t) nogil
|
|
307
|
+
@staticmethod
|
|
308
|
+
Multi_critical_filtration inf(int)
|
|
309
|
+
@staticmethod
|
|
310
|
+
Multi_critical_filtration minus_inf(int)
|
|
311
|
+
@staticmethod
|
|
312
|
+
Multi_critical_filtration nan(int)
|
|
313
|
+
bool is_plus_inf() nogil
|
|
314
|
+
bool is_minus_inf() nogil
|
|
315
|
+
bool is_nan() nogil
|
|
316
|
+
bool is_finite() nogil
|
|
317
|
+
bool add_generator(vector[T] &x) nogil
|
|
318
|
+
bool add_generator(vector[T] x) nogil
|
|
319
|
+
void add_guaranteed_generator(vector[T] &x) nogil
|
|
320
|
+
void simplify() nogil
|
|
321
|
+
void remove_empty_generators(bool) nogil
|
|
322
|
+
# "push_to_least_common_upper_bound<std::vector<T>>"
|
|
323
|
+
bool push_to_least_common_upper_bound(vector[T] &, bool) nogil
|
|
324
|
+
bool push_to_least_common_upper_bound(const Multi_critical_filtration[T] &, bool) nogil
|
|
325
|
+
bool pull_to_greatest_common_lower_bound(vector[T] &, bool) nogil
|
|
326
|
+
# bool pull_to_greatest_common_lower_bound(const Multi_critical_filtration[T] &, bool) nogil
|
|
327
|
+
|
|
328
|
+
|
|
329
|
+
cdef extern from "gudhi/Multi_persistence/Point.h" namespace "Gudhi::multi_persistence":
|
|
330
|
+
cdef cppclass Point[T]:
|
|
331
|
+
ctypedef size_t size_type
|
|
332
|
+
ctypedef ptrdiff_t difference_type
|
|
333
|
+
ctypedef T value_type
|
|
334
|
+
ctypedef T& reference
|
|
335
|
+
ctypedef T* pointer
|
|
336
|
+
|
|
337
|
+
cppclass const_iterator
|
|
338
|
+
cppclass iterator:
|
|
339
|
+
iterator() except +
|
|
340
|
+
iterator(iterator&) except +
|
|
341
|
+
value_type& operator*()
|
|
342
|
+
iterator operator++()
|
|
343
|
+
iterator operator--()
|
|
344
|
+
iterator operator++(int)
|
|
345
|
+
iterator operator--(int)
|
|
346
|
+
iterator operator+(size_type)
|
|
347
|
+
iterator operator-(size_type)
|
|
348
|
+
difference_type operator-(iterator)
|
|
349
|
+
difference_type operator-(const_iterator)
|
|
350
|
+
bint operator==(iterator)
|
|
351
|
+
bint operator==(const_iterator)
|
|
352
|
+
bint operator!=(iterator)
|
|
353
|
+
bint operator!=(const_iterator)
|
|
354
|
+
bint operator<(iterator)
|
|
355
|
+
bint operator<(const_iterator)
|
|
356
|
+
bint operator>(iterator)
|
|
357
|
+
bint operator>(const_iterator)
|
|
358
|
+
bint operator<=(iterator)
|
|
359
|
+
bint operator<=(const_iterator)
|
|
360
|
+
bint operator>=(iterator)
|
|
361
|
+
bint operator>=(const_iterator)
|
|
362
|
+
cppclass const_iterator:
|
|
363
|
+
const_iterator() except +
|
|
364
|
+
const_iterator(iterator&) except +
|
|
365
|
+
const_iterator(const_iterator&) except +
|
|
366
|
+
operator=(iterator&) except +
|
|
367
|
+
const value_type& operator*()
|
|
368
|
+
const_iterator operator++()
|
|
369
|
+
const_iterator operator--()
|
|
370
|
+
const_iterator operator++(int)
|
|
371
|
+
const_iterator operator--(int)
|
|
372
|
+
const_iterator operator+(size_type)
|
|
373
|
+
const_iterator operator-(size_type)
|
|
374
|
+
difference_type operator-(iterator)
|
|
375
|
+
difference_type operator-(const_iterator)
|
|
376
|
+
bint operator==(iterator)
|
|
377
|
+
bint operator==(const_iterator)
|
|
378
|
+
bint operator!=(iterator)
|
|
379
|
+
bint operator!=(const_iterator)
|
|
380
|
+
bint operator<(iterator)
|
|
381
|
+
bint operator<(const_iterator)
|
|
382
|
+
bint operator>(iterator)
|
|
383
|
+
bint operator>(const_iterator)
|
|
384
|
+
bint operator<=(iterator)
|
|
385
|
+
bint operator<=(const_iterator)
|
|
386
|
+
bint operator>=(iterator)
|
|
387
|
+
bint operator>=(const_iterator)
|
|
388
|
+
|
|
389
|
+
cppclass const_reverse_iterator
|
|
390
|
+
cppclass reverse_iterator:
|
|
391
|
+
reverse_iterator() except +
|
|
392
|
+
reverse_iterator(reverse_iterator&) except +
|
|
393
|
+
value_type& operator*()
|
|
394
|
+
reverse_iterator operator++()
|
|
395
|
+
reverse_iterator operator--()
|
|
396
|
+
reverse_iterator operator++(int)
|
|
397
|
+
reverse_iterator operator--(int)
|
|
398
|
+
reverse_iterator operator+(size_type)
|
|
399
|
+
reverse_iterator operator-(size_type)
|
|
400
|
+
difference_type operator-(iterator)
|
|
401
|
+
difference_type operator-(const_iterator)
|
|
402
|
+
bint operator==(reverse_iterator)
|
|
403
|
+
bint operator==(const_reverse_iterator)
|
|
404
|
+
bint operator!=(reverse_iterator)
|
|
405
|
+
bint operator!=(const_reverse_iterator)
|
|
406
|
+
bint operator<(reverse_iterator)
|
|
407
|
+
bint operator<(const_reverse_iterator)
|
|
408
|
+
bint operator>(reverse_iterator)
|
|
409
|
+
bint operator>(const_reverse_iterator)
|
|
410
|
+
bint operator<=(reverse_iterator)
|
|
411
|
+
bint operator<=(const_reverse_iterator)
|
|
412
|
+
bint operator>=(reverse_iterator)
|
|
413
|
+
bint operator>=(const_reverse_iterator)
|
|
414
|
+
cppclass const_reverse_iterator:
|
|
415
|
+
const_reverse_iterator() except +
|
|
416
|
+
const_reverse_iterator(reverse_iterator&) except +
|
|
417
|
+
operator=(reverse_iterator&) except +
|
|
418
|
+
const value_type& operator*()
|
|
419
|
+
const_reverse_iterator operator++()
|
|
420
|
+
const_reverse_iterator operator--()
|
|
421
|
+
const_reverse_iterator operator++(int)
|
|
422
|
+
const_reverse_iterator operator--(int)
|
|
423
|
+
const_reverse_iterator operator+(size_type)
|
|
424
|
+
const_reverse_iterator operator-(size_type)
|
|
425
|
+
difference_type operator-(iterator)
|
|
426
|
+
difference_type operator-(const_iterator)
|
|
427
|
+
bint operator==(reverse_iterator)
|
|
428
|
+
bint operator==(const_reverse_iterator)
|
|
429
|
+
bint operator!=(reverse_iterator)
|
|
430
|
+
bint operator!=(const_reverse_iterator)
|
|
431
|
+
bint operator<(reverse_iterator)
|
|
432
|
+
bint operator<(const_reverse_iterator)
|
|
433
|
+
bint operator>(reverse_iterator)
|
|
434
|
+
bint operator>(const_reverse_iterator)
|
|
435
|
+
bint operator<=(reverse_iterator)
|
|
436
|
+
bint operator<=(const_reverse_iterator)
|
|
437
|
+
bint operator>=(reverse_iterator)
|
|
438
|
+
bint operator>=(const_reverse_iterator)
|
|
439
|
+
|
|
440
|
+
Point() except + nogil
|
|
441
|
+
Point(size_type) except + nogil
|
|
442
|
+
Point(size_type, const T &) except + nogil
|
|
443
|
+
Point(const vector[T]&) except + nogil
|
|
444
|
+
Point& operator=(Point&) except + nogil
|
|
445
|
+
reference at(size_type) except +
|
|
446
|
+
reference operator[](size_type)
|
|
447
|
+
reference front()
|
|
448
|
+
reference back()
|
|
449
|
+
pointer data()
|
|
450
|
+
const value_type* const_data "data"()
|
|
451
|
+
iterator begin()
|
|
452
|
+
const_iterator const_begin "begin"()
|
|
453
|
+
const_iterator cbegin()
|
|
454
|
+
iterator end()
|
|
455
|
+
const_iterator const_end "end"()
|
|
456
|
+
const_iterator cend()
|
|
457
|
+
reverse_iterator rbegin()
|
|
458
|
+
const_reverse_iterator const_rbegin "rbegin"()
|
|
459
|
+
const_reverse_iterator crbegin()
|
|
460
|
+
reverse_iterator rend()
|
|
461
|
+
const_reverse_iterator const_rend "rend"()
|
|
462
|
+
const_reverse_iterator crend()
|
|
463
|
+
size_type size()
|
|
464
|
+
|
|
465
|
+
bint operator<(const Point &, const Point &)
|
|
466
|
+
bint operator<=(const Point &, const Point &)
|
|
467
|
+
bint operator>(const Point &, const Point &)
|
|
468
|
+
bint operator>=(const Point &, const Point &)
|
|
469
|
+
bint operator==(const Point &, const Point &)
|
|
470
|
+
bint operator!=(const Point &, const Point &)
|
|
471
|
+
Point operator-(const Point &)
|
|
472
|
+
Point operator-(Point, const Point &)
|
|
473
|
+
Point operator-(Point, double)
|
|
474
|
+
Point operator-(Point, float)
|
|
475
|
+
Point operator-(Point, int)
|
|
476
|
+
Point operator-(double, Point)
|
|
477
|
+
Point operator-(float, Point)
|
|
478
|
+
Point operator-(int, Point)
|
|
479
|
+
Point operator+(Point, const Point &)
|
|
480
|
+
Point operator+(Point, double)
|
|
481
|
+
Point operator+(Point, float)
|
|
482
|
+
Point operator+(Point, int)
|
|
483
|
+
Point operator+(double, Point)
|
|
484
|
+
Point operator+(float, Point)
|
|
485
|
+
Point operator+(int, Point)
|
|
486
|
+
Point operator*(Point, const Point &)
|
|
487
|
+
Point operator*(Point, double)
|
|
488
|
+
Point operator*(Point, float)
|
|
489
|
+
Point operator*(Point, int)
|
|
490
|
+
Point operator*(double, Point)
|
|
491
|
+
Point operator*(float, Point)
|
|
492
|
+
Point operator*(int, Point)
|
|
493
|
+
Point operator/(Point, const Point &)
|
|
494
|
+
Point operator/(Point, double)
|
|
495
|
+
Point operator/(Point, float)
|
|
496
|
+
Point operator/(Point, int)
|
|
497
|
+
Point operator/(double, Point)
|
|
498
|
+
Point operator/(float, Point)
|
|
499
|
+
Point operator/(int, Point)
|
|
500
|
+
|
|
501
|
+
cdef extern from "gudhi/Multi_persistence/Box.h" namespace "Gudhi::multi_persistence":
|
|
502
|
+
cdef cppclass Box[T=*]:
|
|
503
|
+
ctypedef Point[T] corner_type
|
|
504
|
+
Box() except +
|
|
505
|
+
# Box(corner_type&, corner_type&) nogil
|
|
506
|
+
# Box(pair[Point[T], Point[T]]&) nogil
|
|
507
|
+
Box(vector[T]&, vector[T]&) nogil
|
|
508
|
+
Box(pair[vector[T], vector[T]]&) nogil
|
|
509
|
+
void inflate(T) nogil
|
|
510
|
+
# const corner_type& get_lower_corner() nogil
|
|
511
|
+
# const corner_type& get_upper_corner() nogil
|
|
512
|
+
const vector[T]& get_lower_corner() nogil
|
|
513
|
+
const vector[T]& get_upper_corner() nogil
|
|
514
|
+
# bool contains(corner_type&) nogil
|
|
515
|
+
bool contains(vector[T]&) nogil
|
|
516
|
+
# pair[corner_type, corner_type] get_bounding_corners() nogil
|
|
517
|
+
pair[vector[T], vector[T]] get_bounding_corners() nogil
|
|
518
|
+
|
|
519
|
+
cdef extern from "gudhi/Multi_persistence/Line.h" namespace "Gudhi::multi_persistence":
|
|
520
|
+
cdef cppclass Line[T=*]:
|
|
521
|
+
ctypedef Point[T] point_type
|
|
522
|
+
Line() except + nogil
|
|
523
|
+
# Line(point_type&) except + nogil
|
|
524
|
+
# Line(point_type&, point_type&) except + nogil
|
|
525
|
+
Line(vector[T]&) except + nogil
|
|
526
|
+
Line(vector[T]&, vector[T]&) except + nogil
|
|
527
|
+
|
|
528
|
+
|
|
529
|
+
|
|
530
|
+
|
|
531
|
+
|
|
532
|
+
# ------ useful types:
|
|
533
|
+
# ctypedef One_critical_filtration[float] Generator
|
|
534
|
+
# ctypedef Multi_critical_filtration[float] kcritical
|