#include <cassert>
#include <iterator>
#include <stack>
#include <stdint.h>
#include <type_traits>
#include <sdsl/int_vector.hpp>
#include <sdsl/int_vector_buffer.hpp>
#include <sdsl/sorted_multi_stack_support.hpp>
#include <sdsl/sorted_stack_support.hpp>
#include <sdsl/util.hpp>
Go to the source code of this file.
|
namespace | sdsl |
| Namespace for the succinct data structure library.
|
|
template<class t_rac> |
void | sdsl::construct_supercartesian_tree_bp (t_rac const &vec, bit_vector &bp, bool const minimum=true) |
| Calculate the balanced parentheses of the Super-Cartesian tree, described in Ohlebusch and Gog (SPIRE 2009).
|
template<class t_rac> |
bit_vector | sdsl::construct_supercartesian_tree_bp_succinct (t_rac const &vec, bool const minimum=true) |
| Calculate the balanced parentheses of the Super-Cartesian tree, described in Ohlebusch and Gog (SPIRE 2009).
|
template<uint8_t t_width> |
bit_vector | sdsl::construct_supercartesian_tree_bp_succinct (int_vector_buffer< t_width > &lcp_buf, bool const minimum=true) |
| Calculate the balanced parentheses of the Super-Cartesian tree, described in Ohlebusch and Gog (SPIRE 2009).
|
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, bool const 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<class t_csa> |
t_csa::size_type | sdsl::get_char_pos (typename t_csa::size_type idx, typename t_csa::size_type d, t_csa const &csa) |