#include <algorithm>
#include <cassert>
#include <chrono>
#include <cmath>
#include <fstream>
#include <numeric>
#include <queue>
#include <unordered_map>
#include <ripser.h>
Go to the source code of this file.
|
| void | check_overflow (index_t i) |
| |
| coefficient_t | get_modulo (const coefficient_t val, const coefficient_t modulus) |
| |
| coefficient_t | normalize (const coefficient_t n, const coefficient_t modulus) |
| |
| std::vector< coefficient_t > | multiplicative_inverse_vector (const coefficient_t m) |
| |
| | PACK (struct entry_t { index_t index :8 *sizeof(index_t) - num_coefficient_bits;index_t coefficient :num_coefficient_bits;entry_t(index_t _index, coefficient_t _coefficient) :index(_index), coefficient(_coefficient) { } entry_t(index_t _index) :index(_index), coefficient(0) { } entry_t() :index(0), coefficient(0) { } }) |
| |
| entry_t | make_entry (index_t i, coefficient_t c) |
| |
| index_t | get_index (const entry_t &e) |
| |
| index_t | get_coefficient (const entry_t &e) |
| |
| void | set_coefficient (entry_t &e, const coefficient_t c) |
| |
| std::ostream & | operator<< (std::ostream &stream, const entry_t &e) |
| |
| const entry_t & | get_entry (const entry_t &e) |
| |
| value_t | get_diameter (const diameter_index_t &i) |
| |
| index_t | get_index (const diameter_index_t &i) |
| |
| index_t | get_index (const index_diameter_t &i) |
| |
| value_t | get_diameter (const index_diameter_t &i) |
| |
| const entry_t & | get_entry (const diameter_entry_t &p) |
| |
| entry_t & | get_entry (diameter_entry_t &p) |
| |
| index_t | get_index (const diameter_entry_t &p) |
| |
| coefficient_t | get_coefficient (const diameter_entry_t &p) |
| |
| const value_t & | get_diameter (const diameter_entry_t &p) |
| |
| void | set_coefficient (diameter_entry_t &p, const coefficient_t c) |
| |
| template<typename T> |
| T | begin (std::pair< T, T > &p) |
| |
| template<typename T> |
| T | end (std::pair< T, T > &p) |
| |
◆ PACK
Value:__VA_ARGS__ __attribute__((__packed__))
Definition at line 193 of file ripser.cpp.
◆ USE_COEFFICIENTS
◆ compressed_lower_distance_matrix
◆ compressed_upper_distance_matrix
◆ diameter_index_t
◆ hash
template<class Key>
| using hash = std::hash<Key> |
◆ hash_map
template<class Key, class T, class H, class E>
| using hash_map = std::unordered_map<Key, T, H, E> |
◆ index_diameter_t
◆ compressed_matrix_layout
| Enumerator |
|---|
| LOWER_TRIANGULAR | |
| UPPER_TRIANGULAR | |
Definition at line 334 of file ripser.cpp.
◆ begin()
template<typename T>
| T begin |
( |
std::pair< T, T > & | p | ) |
|
◆ check_overflow()
◆ end()
template<typename T>
| T end |
( |
std::pair< T, T > & | p | ) |
|
◆ get_coefficient() [1/2]
◆ get_coefficient() [2/2]
| index_t get_coefficient |
( |
const entry_t & | e | ) |
|
◆ get_diameter() [1/3]
◆ get_diameter() [2/3]
◆ get_diameter() [3/3]
◆ get_entry() [1/3]
◆ get_entry() [2/3]
| const entry_t & get_entry |
( |
const entry_t & | e | ) |
|
◆ get_entry() [3/3]
◆ get_index() [1/4]
◆ get_index() [2/4]
◆ get_index() [3/4]
| index_t get_index |
( |
const entry_t & | e | ) |
|
◆ get_index() [4/4]
◆ get_modulo()
◆ make_entry()
◆ multiplicative_inverse_vector()
◆ normalize()
◆ operator<<()
| std::ostream & operator<< |
( |
std::ostream & | stream, |
|
|
const entry_t & | e ) |
◆ PACK()
| PACK |
( |
struct entry_t { index_t index :8 *sizeof(index_t) - num_coefficient_bits;index_t coefficient :num_coefficient_bits;entry_t(index_t _index, coefficient_t _coefficient) :index(_index), coefficient(_coefficient) { } entry_t(index_t _index) :index(_index), coefficient(0) { } entry_t() :index(0), coefficient(0) { } } | | ) |
|
◆ set_coefficient() [1/2]
◆ set_coefficient() [2/2]