suffix_tree_algorithm.hpp File Reference

suffix_tree_algorithm.hpp contains algorithms on CSTs More...

#include <math.h>
#include <set>
#include <stddef.h>
#include <type_traits>
#include <utility>
#include <sdsl/config.hpp>
#include <sdsl/int_vector.hpp>
#include <sdsl/sdsl_concepts.hpp>
#include <sdsl/suffix_array_algorithm.hpp>

Go to the source code of this file.

Namespaces
namespace	sdsl
	Namespace for the succinct data structure library.

Functions
template<class t_cst>
t_cst::size_type	sdsl::forward_search (t_cst const &cst, typename t_cst::node_type &v, const typename t_cst::size_type d, const typename t_cst::char_type c, typename t_cst::size_type &char_pos, SDSL_UNUSED typename std::enable_if< std::is_same< cst_tag, typename t_cst::index_category >::value, cst_tag >::type x=cst_tag())
	Forward search for a character c on the path on depth to node .
template<class t_cst, class t_pat_iter>
t_cst::size_type	sdsl::forward_search (t_cst const &cst, typename t_cst::node_type &v, typename t_cst::size_type d, t_pat_iter begin, t_pat_iter end, typename t_cst::size_type &char_pos, SDSL_UNUSED typename std::enable_if< std::is_same< cst_tag, typename t_cst::index_category >::value, cst_tag >::type x=cst_tag())
	Forward search for a pattern pat on the path on depth to node .
template<class t_cst, class t_pat_iter>
t_cst::size_type	sdsl::count (t_cst const &cst, t_pat_iter begin, t_pat_iter end, cst_tag)
	Counts the number of occurrences of a pattern in a CST.
template<class t_cst, class t_pat_iter, class t_rac = int_vector<64>>
t_rac	sdsl::locate (t_cst const &cst, t_pat_iter begin, t_pat_iter end, SDSL_UNUSED typename std::enable_if< std::is_same< cst_tag, typename t_cst::index_category >::value, cst_tag >::type x=cst_tag())
	Calculates all occurrences of a pattern pat in a CST.
template<class t_cst, class t_text_iter>
t_cst::size_type	sdsl::extract (t_cst const &cst, const typename t_cst::node_type &v, t_text_iter text, SDSL_UNUSED typename std::enable_if< std::is_same< cst_tag, typename t_cst::index_category >::value, cst_tag >::type x=cst_tag())
	Calculate the concatenation of edge labels from the root to the node v of a CST.
template<class t_cst>
t_cst::csa_type::string_type	sdsl::extract (t_cst const &cst, const typename t_cst::node_type &v, SDSL_UNUSED typename std::enable_if< std::is_same< cst_tag, typename t_cst::index_category >::value, cst_tag >::type x=cst_tag())
	Calculate the concatenation of edge labels from the root to the node v of of c CST.
template<class t_cst>
double	sdsl::H0 (const typename t_cst::node_type &v, t_cst const &cst)
	Calculate the zeroth order entropy of the text that follows a certain substring s.
template<class t_cst>
std::pair< double, size_t >	sdsl::Hk (t_cst const &cst, typename t_cst::size_type k)
	Calculate the k-th order entropy of a text.

Detailed Description

suffix_tree_algorithm.hpp contains algorithms on CSTs

Author

Simon Gog

Definition in file suffix_tree_algorithm.hpp.