SDSL 3.0.2
Succinct Data Structure Library
|
bp_support_algorithm.hpp contains algorithms for balanced parentheses sequences. More...
#include <algorithm>
#include <assert.h>
#include <cstdint>
#include <map>
#include <stack>
#include <utility>
#include <sdsl/bits.hpp>
#include <sdsl/int_vector.hpp>
#include <sdsl/sorted_stack_support.hpp>
Go to the source code of this file.
Classes | |
struct | sdsl::excess< T > |
struct | sdsl::excess< T >::impl |
Namespaces | |
namespace | sdsl |
Namespace for the succinct data structure library. | |
Functions | |
bit_vector | sdsl::calculate_pioneers_bitmap (bit_vector const &bp, uint64_t block_size) |
Calculate pioneers as defined in the paper of Geary et al. (CPM 2004) | |
bit_vector | sdsl::calculate_pioneers_bitmap_succinct (bit_vector const &bp, uint64_t block_size) |
Space-efficient version of calculate_pioneers_bitmap. | |
template<class int_vector > | |
void | sdsl::calculate_matches (bit_vector const &bp, int_vector &matches) |
find_open/find_close for closing/opening parentheses. | |
template<class int_vector > | |
void | sdsl::calculate_enclose (bit_vector const &bp, int_vector &enclose) |
Calculates enclose answers for a balanced parentheses sequence. | |
uint64_t | sdsl::near_find_close (bit_vector const &bp, const uint64_t i, const uint64_t block_size) |
uint64_t | sdsl::near_find_closing (bit_vector const &bp, uint64_t i, uint64_t closings, const uint64_t block_size) |
uint64_t | sdsl::near_fwd_excess (bit_vector const &bp, uint64_t i, bit_vector::difference_type rel, const uint64_t block_size) |
uint64_t | sdsl::near_rmq (bit_vector const &bp, uint64_t l, uint64_t r, bit_vector::difference_type &min_rel_ex) |
Calculate the position with minimal excess value in the interval [l..r]. | |
uint64_t | sdsl::near_bwd_excess (bit_vector const &bp, uint64_t i, bit_vector::difference_type rel, const uint64_t block_size) |
Near backward excess. | |
uint64_t | sdsl::near_find_open (bit_vector const &bp, uint64_t i, const uint64_t block_size) |
uint64_t | sdsl::near_find_opening (bit_vector const &bp, uint64_t i, const uint64_t openings, const uint64_t block_size) |
uint64_t | sdsl::near_enclose (bit_vector const &bp, uint64_t i, const uint64_t block_size) |
Find the opening parenthesis of the enclosing pair if this parenthesis is near. | |
uint64_t | sdsl::near_rmq_open (bit_vector const &bp, const uint64_t begin, const uint64_t end) |
bp_support_algorithm.hpp contains algorithms for balanced parentheses sequences.
Definition in file bp_support_algorithm.hpp.