SDSL
3.0.0
Succinct Data Structure Library
|
cst_sada.hpp contains an implementation of Sadakane's CST. More...
#include <algorithm>
#include <cassert>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <sdsl/bp_support.hpp>
#include <sdsl/bp_support_sada.hpp>
#include <sdsl/construct.hpp>
#include <sdsl/csa_sada.hpp>
#include <sdsl/cst_iterators.hpp>
#include <sdsl/cst_sct3.hpp>
#include <sdsl/int_vector.hpp>
#include <sdsl/iterators.hpp>
#include <sdsl/lcp_support_sada.hpp>
#include <sdsl/sdsl_concepts.hpp>
#include <sdsl/select_support_mcl.hpp>
#include <sdsl/sorted_stack_support.hpp>
#include <sdsl/suffix_tree_algorithm.hpp>
#include <sdsl/suffix_tree_helper.hpp>
#include <sdsl/util.hpp>
Go to the source code of this file.
Classes | |
class | sdsl::cst_sada< t_csa, t_lcp, t_bp_support, t_rank_10, t_select_10 > |
A class for the Compressed Suffix Tree (CST) proposed by Sadakane. More... | |
Namespaces | |
sdsl | |
Namespace for the succinct data structure library. | |
cst_sada.hpp contains an implementation of Sadakane's CST.
Definition in file cst_sada.hpp.