sdsl/include/sdsl/algorithms_for_compressed_suffix_trees.hpp File Reference

algorithms_for_compressed_suffix_trees.hpp contains algorithms for compressed suffix trees. More...

#include "int_vector.hpp"
#include "sorted_stack_support.hpp"
#include "sorted_multi_stack_support.hpp"
#include "util.hpp"
#include <stack>

Go to the source code of this file.

Namespaces
namespace	sdsl
	Namespace for the succinct data structure library.
namespace	sdsl::algorithm
	A helper class containing algorithms for succinct data structures.
Functions
template<class RandomAccessContainer >
void	sdsl::algorithm::construct_supercartesian_tree_bp (const RandomAccessContainer &vec, bit_vector &bp, const bool minimum=true)
	Calculate the balanced parentheses of the Super-Cartesian tree, described in Ohlebusch and Gog (SPIRE 2009).
template<class RandomAccessContainer >
void	sdsl::algorithm::construct_supercartesian_tree_bp_succinct (const RandomAccessContainer &vec, bit_vector &bp, const bool minimum=true)
	Calculate the balanced parentheses of the Super-Cartesian tree, described in Ohlebusch and Gog (SPIRE 2009).
template<uint8_t fixedIntWidth, class size_type_class >
void	sdsl::algorithm::construct_supercartesian_tree_bp_succinct (int_vector_file_buffer< fixedIntWidth, size_type_class > &lcp_buf, bit_vector &bp, const bool minimum=true)
	Calculate the balanced parentheses of the Super-Cartesian tree, described in Ohlebusch and Gog (SPIRE 2009).
template<uint8_t fixedIntWidth, class size_type_class >
size_type_class	sdsl::algorithm::construct_supercartesian_tree_bp_succinct_and_first_child (int_vector_file_buffer< fixedIntWidth, size_type_class > &lcp_buf, bit_vector &bp, bit_vector &bp_fc, const bool minimum=true)
	Calculate the balanced parentheses of the Super-Cartesian tree, described in Ohlebusch and Gog (SPIRE 2009) and the first_child bit_vector.
template<uint8_t fixedIntWidth, class size_type_class >
size_type_class	sdsl::algorithm::construct_first_child_lcp (int_vector_file_buffer< fixedIntWidth, size_type_class > &lcp_buf, int_vector< fixedIntWidth, size_type_class > &fc_lcp, size_type_class first_child_size=0)
template<uint32_t SampleDens, uint8_t fixedIntWidth, class size_type_class >
size_type_class	sdsl::algorithm::construct_first_child_and_lf_lcp (int_vector_file_buffer< fixedIntWidth, size_type_class > &lcp_buf, int_vector_file_buffer< 8, size_type_class > &bwt_buf, std::string small_lcp_file_name, std::string big_lcp_file_name, int_vector<> &big_lcp, size_type_class first_child_size=0)
template<class RandomAccessContainer >
void	sdsl::algorithm::construct_supercartesian_tree_bp_succinct2 (const RandomAccessContainer &vec, bit_vector &bp, const bool minimum=true)
template<class RandomAccessContainer >
RandomAccessContainer::size_type	sdsl::algorithm::construct_first_p_index (const RandomAccessContainer &vec, bit_vector &bp, const bool minimum=true)
template<uint8_t fixedIntWidth, class size_type_class >
bit_vector::size_type	sdsl::algorithm::construct_first_p_index (int_vector_file_buffer< fixedIntWidth, size_type_class > &lcp_buf, bit_vector &bp, const bool minimum=true)

---

Detailed Description

algorithms_for_compressed_suffix_trees.hpp contains algorithms for compressed suffix trees.

Author:

Simon Gog