SDSL  3.0.0
Succinct Data Structure Library
suffix_tree_helper.hpp File Reference
#include <cassert>
#include <cstdlib>
#include <stack>
#include <stdint.h>
#include <sdsl/iterators.hpp>
#include <sdsl/sorted_multi_stack_support.hpp>
#include <sdsl/sorted_stack_support.hpp>

Go to the source code of this file.

Classes

class  sdsl::cst_node_child_proxy_iterator< t_cst >
 
class  sdsl::cst_node_child_proxy< t_cst >
 
struct  sdsl::has_id< t_wt >
 

Namespaces

 sdsl
 Namespace for the succinct data structure library.
 

Functions

template<class t_rac >
void sdsl::construct_supercartesian_tree_bp (const t_rac &vec, bit_vector &bp, const bool minimum=true)
 Calculate the balanced parentheses of the Super-Cartesian tree, described in Ohlebusch and Gog (SPIRE 2009). More...
 
template<class t_rac >
bit_vector sdsl::construct_supercartesian_tree_bp_succinct (const t_rac &vec, const bool minimum=true)
 Calculate the balanced parentheses of the Super-Cartesian tree, described in Ohlebusch and Gog (SPIRE 2009). More...
 
template<uint8_t t_width>
bit_vector sdsl::construct_supercartesian_tree_bp_succinct (int_vector_buffer< t_width > &lcp_buf, const bool minimum=true)
 Calculate the balanced parentheses of the Super-Cartesian tree, described in Ohlebusch and Gog (SPIRE 2009). More...
 
template<uint8_t t_width>
bit_vector::size_type sdsl::construct_supercartesian_tree_bp_succinct_and_first_child (int_vector_buffer< t_width > &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. More...
 
template<class t_csa >
t_csa::size_type sdsl::get_char_pos (typename t_csa::size_type idx, typename t_csa::size_type d, const t_csa &csa)