|
SDSL 3.0.3
Succinct Data Structure Library
|
k2_tree_helper.hpp contains helper functions and definitions for a k^2-tree implementation. More...
#include <cmath>#include <deque>#include <stdint.h>#include <utility>#include <vector>#include <sdsl/int_vector.hpp>Go to the source code of this file.
Namespaces | |
| namespace | sdsl |
| Namespace for the succinct data structure library. | |
| namespace | sdsl::k2_tree_ns |
| Namespace for the k2_tree. | |
Typedefs | |
| typedef int_vector ::size_type | sdsl::k2_tree_ns::idx_type |
| typedef int_vector ::size_type | sdsl::k2_tree_ns::size_type |
Functions | |
| template<typename t_bv = bit_vector> | |
| int | sdsl::k2_tree_ns::_build_from_matrix (std::vector< std::vector< int > > const &matrix, const uint8_t k, int n, int const height, int l, int p, int q, std::vector< std::deque< t_bv > > &acc) |
| uint16_t | sdsl::k2_tree_ns::get_chunk_idx (idx_type v, idx_type u, idx_type c_0, idx_type r_0, size_type l, uint8_t k) |
| Get the chunk index ([0, k^2[) of a submatrix point. | |
| template<typename t_bv = bit_vector> | |
| void | sdsl::k2_tree_ns::build_template_vector (bit_vector &k_t_, bit_vector &k_l_, t_bv &k_t, t_bv &k_l) |
| template<> | |
| void | sdsl::k2_tree_ns::build_template_vector< bit_vector > (bit_vector &k_t_, bit_vector &k_l_, bit_vector &k_t, bit_vector &k_l) |
k2_tree_helper.hpp contains helper functions and definitions for a k^2-tree implementation.
Definition in file k2_tree_helper.hpp.