|
SDSL 3.0.1
Succinct Data Structure Library
|
wt_int.hpp contains a specialized class for a wavelet tree of a sequence of the numbers. More...
#include <algorithm>#include <map>#include <queue>#include <set>#include <stdexcept>#include <utility>#include <vector>#include <sdsl/int_vector.hpp>#include <sdsl/rank_support_v.hpp>#include <sdsl/sdsl_concepts.hpp>#include <sdsl/select_support_mcl.hpp>#include <sdsl/util.hpp>#include <sdsl/wt_helper.hpp>Go to the source code of this file.
Classes | |
| class | sdsl::wt_int< t_bitvector, t_rank, t_select, t_select_zero > |
| A wavelet tree class for integer sequences. More... | |
| struct | sdsl::wt_int< t_bitvector, t_rank, t_select, t_select_zero >::node_type |
| Represents a node in the wavelet tree. More... | |
Namespaces | |
| namespace | sdsl |
| Namespace for the succinct data structure library. | |
wt_int.hpp contains a specialized class for a wavelet tree of a sequence of the numbers.
This wavelet tree class takes less memory than the wt_pc class for large alphabets.
Definition in file wt_int.hpp.