|
TTK
|
#include "ripser.h"Go to the source code of this file.
Classes | |
| class | binomial_coeff_table |
| struct | diameter_entry_t |
| struct | greater_diameter_or_smaller_index< Entry > |
| class | compressed_distance_matrix< Layout > |
| struct | sparse_distance_matrix |
| struct | euclidean_distance_matrix |
| class | union_find |
| class | compressed_sparse_matrix< ValueType > |
| class | Ripser< DistanceMatrix > |
| class | Ripser< DistanceMatrix >::simplex_coboundary_enumerator |
Typedefs | |
| template<class Key , class T , class H , class E > | |
| using | hash_map = std::unordered_map< Key, T, H, E > |
| template<class Key > | |
| using | hash = std::hash< Key > |
| using | entry_t = index_t |
| using | diameter_index_t = std::pair< value_t, index_t > |
| using | index_diameter_t = std::pair< index_t, value_t > |
| using | compressed_lower_distance_matrix = compressed_distance_matrix< LOWER_TRIANGULAR > |
| using | compressed_upper_distance_matrix = compressed_distance_matrix< UPPER_TRIANGULAR > |
Enumerations | |
| enum | compressed_matrix_layout : std::uint8_t { LOWER_TRIANGULAR , UPPER_TRIANGULAR } |
Definition at line 358 of file ripserpy.cpp.
Definition at line 360 of file ripserpy.cpp.
| using diameter_index_t = std::pair<value_t, index_t> |
Definition at line 250 of file ripserpy.cpp.
Definition at line 225 of file ripserpy.cpp.
| using hash = std::hash<Key> |
Definition at line 82 of file ripserpy.cpp.
| using hash_map = std::unordered_map<Key, T, H, E> |
Definition at line 80 of file ripserpy.cpp.
| using index_diameter_t = std::pair<index_t, value_t> |
Definition at line 260 of file ripserpy.cpp.
| enum compressed_matrix_layout : std::uint8_t |
| Enumerator | |
|---|---|
| LOWER_TRIANGULAR | |
| UPPER_TRIANGULAR | |
Definition at line 322 of file ripserpy.cpp.
| T begin | ( | std::pair< T, T > & | p | ) |
Definition at line 479 of file ripserpy.cpp.
| void check_overflow | ( | index_t | i | ) |
Definition at line 114 of file ripserpy.cpp.
| T end | ( | std::pair< T, T > & | p | ) |
Definition at line 483 of file ripserpy.cpp.
| coefficient_t get_coefficient | ( | const diameter_entry_t & | p | ) |
Definition at line 303 of file ripserpy.cpp.
Definition at line 234 of file ripserpy.cpp.
| const value_t & get_diameter | ( | const diameter_entry_t & | p | ) |
Definition at line 306 of file ripserpy.cpp.
| value_t get_diameter | ( | const diameter_index_t & | i | ) |
Definition at line 253 of file ripserpy.cpp.
| value_t get_diameter | ( | const index_diameter_t & | i | ) |
Definition at line 266 of file ripserpy.cpp.
| const entry_t & get_entry | ( | const diameter_entry_t & | p | ) |
Definition at line 294 of file ripserpy.cpp.
Definition at line 246 of file ripserpy.cpp.
| entry_t & get_entry | ( | diameter_entry_t & | p | ) |
Definition at line 297 of file ripserpy.cpp.
| index_t get_index | ( | const diameter_entry_t & | p | ) |
Definition at line 300 of file ripserpy.cpp.
| index_t get_index | ( | const diameter_index_t & | i | ) |
Definition at line 256 of file ripserpy.cpp.
Definition at line 231 of file ripserpy.cpp.
| index_t get_index | ( | const index_diameter_t & | i | ) |
Definition at line 263 of file ripserpy.cpp.
| coefficient_t get_modulo | ( | const coefficient_t | val, |
| const coefficient_t | modulus | ||
| ) |
Definition at line 155 of file ripserpy.cpp.
| entry_t make_entry | ( | index_t | _index, |
| coefficient_t | |||
| ) |
Definition at line 237 of file ripserpy.cpp.
| std::vector< coefficient_t > multiplicative_inverse_vector | ( | const coefficient_t | m | ) |
Definition at line 164 of file ripserpy.cpp.
| coefficient_t normalize | ( | const coefficient_t | n, |
| const coefficient_t | modulus | ||
| ) |
Definition at line 159 of file ripserpy.cpp.
| void set_coefficient | ( | diameter_entry_t & | p, |
| const coefficient_t | c | ||
| ) |
Definition at line 309 of file ripserpy.cpp.
| void set_coefficient | ( | entry_t & | , |
| const coefficient_t | |||
| ) |
Definition at line 240 of file ripserpy.cpp.