|
SDSL: Succinct Data Structure Library
A C++ template library for succinct data structures
|
wt_int.hpp contains a specialized class for a wavelet tree of a permutation of the numbers from 0..n. This wavelet tree class takes less memory than the generic class for wavelet trees. More...
#include "int_vector.hpp"#include "rank_support_v.hpp"#include "select_support_mcl.hpp"#include "bitmagic.hpp"#include "testutils.hpp"#include "temp_write_read_buffer.hpp"#include "util.hpp"#include <set>#include <map>#include <algorithm>#include <stdexcept>#include <vector>Go to the source code of this file.
Classes | |
| class | sdsl::wt_int< RandomAccessContainer, BitVector, RankSupport, SelectSupport, SelectSupportZero > |
| A wavelet tree class for sequences of big alphabet size (like integer alphabet) More... | |
Namespaces | |
| namespace | sdsl |
| Namespace for the succinct data structure library. | |
wt_int.hpp contains a specialized class for a wavelet tree of a permutation of the numbers from 0..n. This wavelet tree class takes less memory than the generic class for wavelet trees.
1.8.0