cst_sct3.hpp File Reference

cst_sct3.hpp contains an implementation of the interval based CST. More...

#include <algorithm>
#include <cassert>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <ostream>
#include <stack>
#include <type_traits>
#include <sdsl/bp_support.hpp>
#include <sdsl/construct.hpp>
#include <sdsl/csa_wt.hpp>
#include <sdsl/cst_iterators.hpp>
#include <sdsl/int_vector.hpp>
#include <sdsl/iterators.hpp>
#include <sdsl/lcp.hpp>
#include <sdsl/rank_support.hpp>
#include <sdsl/sdsl_concepts.hpp>
#include <sdsl/select_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_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, const bp_interval< t_int > &interval)

Detailed Description

cst_sct3.hpp contains an implementation of the interval based CST.

Author

Simon Gog

Definition in file cst_sct3.hpp.