SDSL 3.0.3
Succinct Data Structure Library
|
cst_sct3.hpp contains an implementation of the interval based CST. More...
#include <cassert>
#include <iostream>
#include <stddef.h>
#include <stdint.h>
#include <string>
#include <sdsl/bits.hpp>
#include <sdsl/bp_support_sada.hpp>
#include <sdsl/cereal.hpp>
#include <sdsl/config.hpp>
#include <sdsl/csa_wt.hpp>
#include <sdsl/cst_iterators.hpp>
#include <sdsl/int_vector.hpp>
#include <sdsl/int_vector_buffer.hpp>
#include <sdsl/io.hpp>
#include <sdsl/lcp.hpp>
#include <sdsl/lcp_dac.hpp>
#include <sdsl/memory_tracking.hpp>
#include <sdsl/rank_support_v5.hpp>
#include <sdsl/sdsl_concepts.hpp>
#include <sdsl/select_support_scan.hpp>
#include <sdsl/structure_tree.hpp>
#include <sdsl/suffix_tree_helper.hpp>
#include <sdsl/util.hpp>
Go to the source code of this file.
Classes | |
class | sdsl::cst_sct3< t_csa, t_lcp, t_bp_support, t_bv, t_rank, t_sel > |
A class for the Compressed Suffix Tree (CST) proposed by Ohlebusch and Gog. More... | |
struct | sdsl::bp_interval< t_int > |
Namespaces | |
namespace | sdsl |
Namespace for the succinct data structure library. | |
Functions | |
template<class t_int> | |
std::ostream & | sdsl::operator<< (std::ostream &os, bp_interval< t_int > const &interval) |
cst_sct3.hpp contains an implementation of the interval based CST.
Definition in file cst_sct3.hpp.