b-tree-plus-alpha
|
A dynamic data structure supporting rank and select queries on a string. More...
#include <dynamic_wavelet_tree.hpp>
Public Member Functions | |
DynamicWaveletTree (const std::vector< uint8_t > &_alphabet) | |
DynamicWaveletTree & | operator= (const DynamicWaveletTree &)=delete |
DynamicWaveletTree (DynamicWaveletTree &&) noexcept=default | |
DynamicWaveletTree & | operator= (DynamicWaveletTree &&) noexcept=default |
void | swap (DynamicWaveletTree &item) |
void | set_alphabet (const std::vector< uint8_t > &_alphabet) |
uint64_t | get_alphabet_size () const |
void | clear () |
uint64_t | size () const |
uint64_t | height () const |
bool | has_empty_alphabet () const |
int64_t | rank (uint64_t i, uint64_t c) const |
int64_t | select (uint64_t i, uint64_t c) const |
void | push_many (const std::vector< uint8_t > &str) |
void | push_back (uint8_t c) |
uint64_t | get_nth_char_rank (uint64_t nth) const |
uint64_t | at (uint64_t nth) const |
void | remove (uint64_t nth) |
void | insert (uint64_t nth, uint8_t c) |
std::string | to_string () const |
std::vector< uint8_t > | to_uint8_str () const |
int64_t | get_rank_of_character_in_alphabet (uint8_t c) const |
void | print () const |
uint8_t | operator[] (uint64_t n) const |
uint64_t | get_smallest_character_in_alphabet () const |
uint64_t | count_c (uint8_t c) const |
uint64_t | size_in_bytes () const |
void | print_statistics (int message_paragraph=stool::Message::SHOW_MESSAGE) const |
std::vector< std::string > | get_memory_usage_info (int message_paragraph=stool::Message::SHOW_MESSAGE) const |
void | print_content (int message_paragraph=stool::Message::SHOW_MESSAGE) const |
void | print_memory_usage (int message_paragraph=stool::Message::SHOW_MESSAGE) const |
Static Public Member Functions | |
static DynamicWaveletTree | build (const std::vector< uint8_t > &_text, const std::vector< uint8_t > &_alphabet) |
static void | save (DynamicWaveletTree &item, std::ofstream &os) |
static DynamicWaveletTree | build_from_data (std::ifstream &ifs) |
A dynamic data structure supporting rank and select queries on a string.