cst_fully.hpp File Reference

cst_fully.hpp contains an implementation of Russo et al. More...

#include <assert.h>
#include <iosfwd>
#include <stddef.h>
#include <stdint.h>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#include <sdsl/bits.hpp>
#include <sdsl/bp_support_sada.hpp>
#include <sdsl/cereal.hpp>
#include <sdsl/csa_wt.hpp>
#include <sdsl/cst_iterators.hpp>
#include <sdsl/cst_sada.hpp>
#include <sdsl/dac_vector.hpp>
#include <sdsl/int_vector.hpp>
#include <sdsl/io.hpp>
#include <sdsl/iterators.hpp>
#include <sdsl/lcp_dac.hpp>
#include <sdsl/memory_tracking.hpp>
#include <sdsl/sd_vector.hpp>
#include <sdsl/sdsl_concepts.hpp>
#include <sdsl/structure_tree.hpp>
#include <sdsl/suffix_array_algorithm.hpp>
#include <sdsl/suffix_tree_helper.hpp>
#include <sdsl/util.hpp>
#include <sdsl/wt_pc.hpp>

Go to the source code of this file.

Classes
class	sdsl::lcp_fully< t_cst >
class	sdsl::cst_fully< t_csa, t_delta, t_s_support, t_b, t_depth, t_sample_leaves >
	A class for the Fully-Compressed Suffix Tree (FCST) proposed by Russo et al. More...

Namespaces
namespace	sdsl
	Namespace for the succinct data structure library.

Detailed Description

cst_fully.hpp contains an implementation of Russo et al.

's Fully-Compressed Suffix Tree.

Author

Christian Ocker, Simon Gog

Definition in file cst_fully.hpp.