SDSL 3.0.3
Succinct Data Structure Library
Loading...
Searching...
No Matches
Class Hierarchy
This inheritance list is sorted roughly, but not completely, alphabetically:
[detail level 12]
 Csdsl::_balanced_shape< t_wt >
 Csdsl::_byte_tree< t_dfs_shape, t_wt >
 Csdsl::_fuzzy_isa_sampling_support< t_csa, t_select_sa >
 Csdsl::_fuzzy_sa_sampling< t_csa, t_bv_sa, t_bv_isa, t_rank_sa, t_select_isa >
 Csdsl::_huff_shape< t_wt >
 Csdsl::_hutu_shape< t_wt >
 Csdsl::_int_tree< t_dfs_shape, t_wt >
 Csdsl::_interval_symbols_wt< t_wt, t_has_interval_symbols >
 Csdsl::_interval_symbols_wt< t_wt, false >
 Csdsl::_lcp_support_sada< t_csa, t_bitvec, t_select >A class to represent the LCP array in compressed form
 Csdsl::_lcp_support_tree< t_lcp, t_cst >This class composes a virtual LCP array from a LCP arrays which is in suffix array order (e.g
 Csdsl::_lcp_support_tree2< t_dens, t_cst >An lcp array class for cst_sct3 and cst_sada
 Csdsl::_node< t_tree_strat_fat >
 Csdsl::_symbols_calls_wt< t_wt, t_has_interval_symbols >
 Csdsl::_symbols_calls_wt< t_wt, false >
 Csdsl::_text_order_isa_sampling_support< t_csa, t_inv_perm, t_sel >
 Csdsl::_trbudget_t< saidx_t >
 Csdsl::alphabet_tag
 Csdsl::alphabet_trait< t_alphabet_strategy >
 Csdsl::alphabet_trait< int_alphabet_tag >
 Csdsl::balanced_shape
 Csdsl::bfoot
 Ccereal::BinaryData< t >
 Csdsl::binomial15_impl< T >
 Csdsl::binomial_coefficients< n >A struct for the binomial coefficients $ n \choose k $
 Csdsl::binomial_coefficients_trait< log_n >Trait struct for the binomial coefficient struct to handle different type of integers
 Csdsl::binomial_coefficients_trait< 7 >Specialization of binomial_coefficients_trait for 128-bit integers
 Csdsl::binomial_coefficients_trait< 8 >Specialization of binomial_coefficients_trait for 256-bit integers
 Csdsl::binomial_table< n, number_type >
 Csdsl::detail::bit_compressed_word< value_t, bits_per_value >A bit compressed word
 Csdsl::bit_vector_il< t_bs >A bit vector which interleaves the original bit_vector with rank information
 Csdsl::bits_impl< T >A helper class for bitwise tricks on 64 bit words
 Csdsl::bp_interval< t_int >
 Csdsl::bp_support_g< t_nnd, t_rank, t_select, t_rmq, t_bs >A class that provides support for bit_vectors that represent a BP sequence
 Csdsl::bp_support_gg< t_nnd, t_rank, t_select, t_bs >A class that provides support for bit_vectors that represent a BP sequence
 Csdsl::bp_support_sada< t_sml_blk, t_med_deg, t_rank, t_select >A class that provides support for bit_vectors that represent a BP sequence
 Csdsl::buffered_char_queue
 Csdsl::bv_tag
 Csdsl::bwt_of_csa_psi< t_csa >A wrapper for the bwt of a compressed suffix array that is based on the $\psi$ function
 Csdsl::bwt_of_csa_wt< t_csa >
 Csdsl::byte_alphabetA simple space greedy representation for byte alphabets
 Csdsl::byte_alphabet_tag
 Csdsl::byte_tree< t_dfs_shape >
 Csdsl::cache_configHelper class for construction process
 Csdsl::int_alphabet< bit_vector_type, rank_support_type, select_support_type, C_array_type >::char2comp_wrapperHelper class for the char2comp mapping
 Csdsl::succinct_byte_alphabet< bit_vector_type, rank_support_type, select_support_type, C_array_type >::char2comp_wrapperHelper class for the char2comp mapping
 Csdsl::coder::comma< t_width >A class to encode and decode between comma code and binary code
 Csdsl::int_alphabet< bit_vector_type, rank_support_type, select_support_type, C_array_type >::comp2char_wrapperHelper class for the comp2char mapping
 Csdsl::succinct_byte_alphabet< bit_vector_type, rank_support_type, select_support_type, C_array_type >::comp2char_wrapperHelper class for the comp2char mapping
 Csdsl::construct_config_data
 Csdsl::csa_bitcompressed< t_alphabet_strat >A class for the uncompressed suffix array (SA)
 Csdsl::csa_member_tag
 Csdsl::csa_sada< t_enc_vec, t_dens, t_inv_dens, t_sa_sample_strat, t_isa_sample_strat, t_alphabet_strat >A class for the Compressed Suffix Array (CSA) proposed by Sadakane for practical implementation
 Csdsl::csa_tag
 Csdsl::csa_wt< t_wt, t_dens, t_inv_dens, t_sa_sample_strat, t_isa_sample_strat, t_alphabet_strat >A class for the Compressed Suffix Array (CSA) based on a Wavelet Tree (WT) of the Burrow Wheeler Transform of the original text
 Csdsl::cst_bfs_iterator< Cst, Queue >A forward iterator for a breath first traversal of a tree
 Csdsl::cst_bottom_up_const_forward_iterator< Cst >A forward iterator for a bottom up traversal of a suffix tree
 Csdsl::cst_dfs_const_forward_iterator< Cst, cache_size >An forward iterator for (compressed) suffix trees
 Csdsl::cst_fully< t_csa, t_delta, t_s_support, t_b, t_depth, t_sample_leaves >A class for the Fully-Compressed Suffix Tree (FCST) proposed by Russo et al
 Csdsl::cst_node_child_proxy< t_cst >
 Csdsl::cst_node_child_proxy_iterator< t_cst >
 Csdsl::cst_sada< t_csa, t_lcp, t_bp_support, t_rank_10, t_select_10 >A class for the Compressed Suffix Tree (CST) proposed by Sadakane
 Csdsl::cst_sct3< t_csa, t_lcp, t_bp_support, t_bv, t_rank, t_sel >A class for the Compressed Suffix Tree (CST) proposed by Ohlebusch and Gog
 Csdsl::cst_tag
 Csdsl::dac_vector< t_b, t_rank >A generic immutable space-saving vector class for unsigned integers
 Csdsl::default_sentinel< t_csx, t_alph >
 Csdsl::default_sentinel< t_csx, byte_alphabet_tag >
 Csdsl::default_sentinel< t_csx, int_alphabet_tag >
 Csdsl::coder::elias_delta< T >A class to encode and decode between Elias- $\delta$ and binary code
 Csdsl::coder::elias_gamma< T >A class to encode and decode between Elias- $\delta$ and binary code
 Csdsl::enable_if_type< t_T, t_r >
 Csdsl::enc_vector< t_coder, t_dens, t_width >A generic immutable space-saving vector class for unsigned integers
 Csdsl::enc_vector_trait< t_width >
 Csdsl::enc_vector_trait< 32 >
 Csdsl::enc_vector_trait< 64 >
 Csdsl::excess< T >
 Csdsl::fast_cache
 Csdsl::coder::fibonacci< T >A class to encode and decode between Fibonacci and binary code
 Csdsl::first_row_of_csa< t_csa >
 Csdsl::fuzzy_isa_sampling_support< t_select_sa >
 Csdsl::fuzzy_sa_sampling< t_bv_sa, t_bv_isa, t_rank_sa, t_select_isa >
 Csdsl::has_expand< typename, T >
 Csdsl::has_expand< t_wt, t_ret(t_args...)>
 Csdsl::has_id< t_wt >
 Csdsl::has_interval_symbols< t_wt >
 Csdsl::has_load< X >
 Csdsl::has_node_type< t_wt, T >
 Csdsl::has_node_type< t_wt, typename void_< typename t_wt::node_type >::type >
 Csdsl::has_range_search_2d< t_wt >
 Csdsl::has_serialize< X >
 Csdsl::has_symbols_wt< t_wt >
 Csdsl::_hutu_shape< t_wt >::heap_node< t_element >Node class used by the leftist heap
 Csdsl::_hutu_shape< t_wt >::ht_node
 Csdsl::huff_shape
 Csdsl::hugepage_allocator
 Csdsl::hutu_shape
 Csdsl::hyb_vector< k_sblock_rate >A hybrid-encoded compressed bitvector representation
 Csdsl::excess< T >::impl
 Csdsl::index_tag< t_idx, t_enable >
 Csdsl::index_tag< t_idx, typename enable_if_type< typename t_idx::index_category >::type >
 Csdsl::int_alphabet< bit_vector_type, rank_support_type, select_support_type, C_array_type >A space-efficient representation for byte alphabets
 Csdsl::int_alphabet_tag
 Csdsl::int_tree< t_dfs_shape >
 Csdsl::int_vec_category_trait< t_width >
 Csdsl::int_vec_category_trait< 1 >
 Csdsl::int_vector< t_width >A generic vector class for integers of width $w\in [1..64]$
 Csdsl::int_vector< 0 >
 Csdsl::int_vector_buffer< t_width >
 Csdsl::int_vector_iterator_base< t_int_vector >
 Csdsl::int_vector_load_vbyte_wrapper< fixedIntWidth >
 Csdsl::int_vector_load_vlen_wrapper< coder_type >
 Csdsl::int_vector_load_wrapper< int_vector_type >
 Csdsl::int_vector_mapper< t_width, t_mode >
 Csdsl::int_vector_reference< t_int_vector >A proxy class that acts as a reference to an integer of length len bits in a int_vector
 Csdsl::int_vector_reference< bit_vector >
 Csdsl::int_vector_serialize_min_overhead< int_vector_serialize_wrapper_type >
 Csdsl::int_vector_serialize_vbyte_wrapper< fixedIntWidth >
 Csdsl::int_vector_serialize_vlen_wrapper< coder_type >
 Csdsl::int_vector_serialize_wrapper< int_vector_type >
 Csdsl::int_vector_trait< t_width >
 Csdsl::int_vector_trait< 16 >
 Csdsl::int_vector_trait< 32 >
 Csdsl::int_vector_trait< 64 >
 Csdsl::int_vector_trait< 8 >
 Csdsl::inv_multi_perm_support< t_s, t_rac, t_bv, t_rank >Class inv_multi_perm_support adds access to the inverse of permutations
 Csdsl::inv_perm_support< t_s, t_bv, t_rank >Class inv_perm_support adds access to the inverse of a permutation
 Csdsl::is_alphabet< t_alphabet, t_enable >
 Csdsl::is_alphabet< t_alphabet, typename enable_if_type< typename t_alphabet::alphabet_category >::type >
 Csdsl::is_enc_vec< t_enc_vec, t_enable >
 Csdsl::is_enc_vec< t_enc_vec, typename enable_if_type< typename t_enc_vec::enc_vec_type >::type >
 Ccereal::traits::is_input_serializable< t1, t2 >
 Ccereal::traits::is_output_serializable< t1, t2 >
 Csdsl::isa_of_csa_psi< t_csa >
 Csdsl::isa_of_csa_wt< t_csa >
 Csdsl::isa_sampling< t_width >
 Csdsl::isa_sampling_tag
 Cstd::istream
 Csdsl::int_vector_buffer< t_width >::iterator
 Csdsl::iv_tag
 Csdsl::k2_treap< t_k, t_bv, t_rank, t_max_vec >A k^2-treap
 Csdsl::k2_tree< k, t_bv, t_rank >A k^2-tree
 Csdsl::key_bwt_trait_impl< width, T >Helper classes to transform width=0 and width=8 to corresponding bwt key
 Csdsl::key_bwt_trait_impl< 0, T >
 Csdsl::key_bwt_trait_impl< 8, T >
 Csdsl::key_text_trait_impl< width, T >Helper classes to transform width=0 and width=8 to corresponding text key
 Csdsl::key_text_trait_impl< 0, T >
 Csdsl::key_text_trait_impl< 8, T >
 Csdsl::_hutu_shape< t_wt >::l_heap< t_element >
 Csdsl::lcp_bitcompressed< t_width >
 Csdsl::lcp_byte< t_width >A class for a simple compressed version of LCP information
 Csdsl::lcp_fully< t_cst >
 Csdsl::lcp_permuted_tag
 Csdsl::lcp_plain_tag
 Csdsl::lcp_support_sada< t_bitvec, t_select >Helper class which provides _lcp_support_sada the context of a CSA
 Csdsl::lcp_support_tree< t_lcp >Helper class which provides _lcp_support_tree the context of a CST
 Csdsl::lcp_support_tree2< t_dens >Helper class which provides _lcp_support_tree2 the context of a CST
 Csdsl::lcp_tag
 Csdsl::lcp_tree_and_lf_compressed_tag
 Csdsl::lcp_tree_compressed_tag
 Csdsl::lcp_vlc< t_vlc_vec >
 Csdsl::lcp_wt< t_width >A class for the compressed version of lcp information of an suffix array
 Csdsl::lf_tag
 Csdsl::libdivsufsort_config< saidx_t >
 Csdsl::libdivsufsort_config< int32_t >
 Csdsl::libdivsufsort_config< int64_t >
 Csdsl::louds_nodeA class for the node representation of louds_tree
 Csdsl::louds_tree< bit_vec_t, select_1_t, select_0_t >A tree class based on the level order unary degree sequence (LOUDS) representation
 Csdsl::_hutu_shape< t_wt >::m_node
 Csdsl::plain_byte_alphabet::mapping_wrapperHelper class for the char2comp and comp2char mapping
 Csdsl::memory_manager
 Csdsl::memory_monitor
 Cmin_max_trait< RandomAccessContainer, Minimum >
 Cmin_max_trait< RandomAccessContainer, false >
 Csdsl::mm_alloc
 Csdsl::mm_block
 Csdsl::mm_event
 Csdsl::memory_monitor::mm_event_proxy
 Csdsl::nearest_neighbour_dictionary< t_sample_dens >Nearest neighbour dictionary for sparse uniform sets (described in Geary et al., A Simple Optimal Representation for Balanced Parentheses, CPM 2004)
 Csdsl::nn_dict_dynamicA class for a dynamic bit vector which also supports the prev and next operations
 Csdsl::node_bv_container< t_bv >
 Csdsl::node_seq_container< t_bv >
 Csdsl::k2_treap_ns::node_type
 Csdsl::wm_int< t_bitvector, t_rank, t_select, t_select_zero >::node_typeRepresents a node in the wavelet tree
 Csdsl::wt_int< t_bitvector, t_rank, t_select, t_select_zero >::node_typeRepresents a node in the wavelet tree
 Cstd::ostream
 Csdsl::pc_node
 Csdsl::plain_byte_alphabetProvides an alphabet mapping that implements an identity map (i.e
 Csdsl::k2_treap_ns::precomp< t_k >
 Csdsl::k2_treap_ns::precomp< 16 >
 Csdsl::k2_treap_ns::precomp< 2 >
 Csdsl::k2_treap_ns::precomp< 4 >
 Csdsl::k2_treap_ns::precomp< 8 >
 Csdsl::psi_tag
 Csdsl::ramfs_storage
 Csdsl::random_access_const_iterator< t_rac >Generic iterator for a random access container
 Csdsl::random_access_container< t_F >
 Csdsl::k2_treap_ns::range_iterator< t_k2_treap >
 Csdsl::range_maximum_sct< t_bp_support >
 Csdsl::range_maximum_support_sada< t_bp_support, t_rank_10, t_select_10 >
 Csdsl::rank_result< t_bp >
 Csdsl::rank_result< 0 >
 Csdsl::rank_supportThe base class of classes supporting rank_queries for a sdsl::bit_vector in constant time
 Csdsl::rank_support_hyb< t_b, k_sblock_rate >Rank_support for the hyb_vector class
 Csdsl::rank_support_il< t_b, t_bs >
 Csdsl::rank_support_int< alphabet_size >The base class of classes supporting rank_queries for a sdsl::int_vector in constant time
 Csdsl::rank_support_rrr< t_b, t_bs, t_rac, t_k >
 Csdsl::rank_support_rrr< t_b, 15, t_rac, t_k >Rank_support for the specialized rrr_vector class of block size 15
 Csdsl::rank_support_rrr_trait< t_bit_pattern >
 Csdsl::rank_support_rrr_trait< 0 >
 Csdsl::rank_support_sd< t_b, t_hi_bit_vector, t_select_1, t_select_0 >Rank data structure for sd_vector
 Csdsl::rank_support_sd_trait< t_b >
 Csdsl::rank_support_sd_trait< 0 >
 Csdsl::rank_support_trait< bit_pattern, pattern_len >
 Csdsl::rank_support_trait< 0, 1 >
 Csdsl::rank_support_trait< 00, 2 >
 Csdsl::rank_support_trait< 01, 2 >
 Csdsl::rank_support_trait< 1, 1 >
 Csdsl::rank_support_trait< 10, 2 >
 Csdsl::rank_support_trait< 11, 2 >
 Csdsl::int_vector< t_width >::raw_wrapper
 Csdsl::int_vector_buffer< t_width >::reference
 Csdsl::nn_dict_dynamic::reference
 Csdsl::rmq_succinct_sada< t_min, t_bp_support, t_rank_10, t_select_10 >A class to support range minimum or range maximum queries on a random access container
 Csdsl::rmq_succinct_sct< t_min, t_bp_support >A class to support range minimum or range maximum queries on a random access container
 Csdsl::rmq_support_sparse_table< t_rac, t_min >A class to support range minimum or range maximum queries on a random access container
 Csdsl::rrr_helper< n >Class to encode and decode binomial coefficients on the fly
 Csdsl::rrr_vector< t_bs, t_rac, t_k >A
 Csdsl::coder::run_length< Coder >
 Csdsl::sa_bwt_sampling< t_bit_vec, t_rank_sup, t_width >
 Csdsl::sa_order_sa_sampling< t_width >
 Csdsl::sa_sampling_tag
 Csdsl::sampling_tag< t_sampling, t_enable >
 Csdsl::sampling_tag< t_sampling, typename enable_if_type< typename t_sampling::sampling_category >::type >
 Csdsl::sd_vector< t_hi_bit_vector, t_select_1, t_select_0 >A bit vector which compresses very sparse populated bit vectors by
 Csdsl::sd_vector_builderClass for in-place construction of sd_vector from a strictly increasing sequence
 Csdsl::select_0_support_sd< t_sd_vector >Select_0 data structure for sd_vector
 Csdsl::select_supportThe base class of classes supporting select queries for a sdsl::bit_vector in constant time
 Csdsl::select_support_hyb< t_b, k_sblock_rate >Select support for the hyb_vector class
 Csdsl::select_support_il< t_b, t_bs >
 Csdsl::select_support_rrr< t_b, t_bs, t_rac, t_k >
 Csdsl::select_support_rrr< t_b, 15, t_rac, t_k >Select support for the specialized rrr_vector class of block size 15
 Csdsl::select_support_sd< t_b, t_hi_bit_vector, t_select_1, t_select_0 >Select data structure for sd_vector
 Csdsl::select_support_sd_trait< t_b, t_sd_vec >
 Csdsl::select_support_sd_trait< 0, t_sd_vec >
 Csdsl::select_support_trait< bit_pattern, pattern_len >
 Csdsl::select_support_trait< 0, 1 >
 Csdsl::select_support_trait< 00, 2 >
 Csdsl::select_support_trait< 01, 2 >
 Csdsl::select_support_trait< 1, 1 >
 Csdsl::select_support_trait< 10, 2 >
 Csdsl::select_support_trait< 11, 2 >
 Csdsl::sorted_int_stackA stack class which can contain integers in strictly increasing order
 Csdsl::sorted_multi_stack_supportStack which contains elements from [0..n] in sorted order. Duplicates are possible
 Csdsl::sorted_stack_supportA stack which contains strictly increasing numbers in the range from $0$ to $n$
 Csdsl::qsufsort::sorter< int_vector_type >
 Csdsl::spin_lock
 Cstd::streambuf
 Csdsl::structure_tree
 Csdsl::structure_tree_node
 Csdsl::succinct_byte_alphabet< bit_vector_type, rank_support_type, select_support_type, C_array_type >A space-efficient representation for byte alphabets
 Csdsl::rank_support_int_v< alphabet_size, words_per_block, blocks_per_superblock >::superblock_entryStores a superblock entry in a cache friendly pattern
 Csdsl::temp_file_buffer< t_width >
 Csdsl::text_of_csa< t_csa >
 Csdsl::text_order_isa_sampling_support< t_inv_perm, t_sel >
 Csdsl::text_order_sa_sampling< t_bit_vec, t_rank_sup, t_width >
 Csdsl::k2_treap_ns::top_k_iterator< t_k2_treap >
 Csdsl::track_allocator< T >
 Csdsl::tracker_storage
 Csdsl::traverse_csa_psi< t_csa, t_direction >
 Csdsl::traverse_csa_psi_trait< t_csa, t_direction >
 Csdsl::traverse_csa_psi_trait< t_csa, false >
 Csdsl::traverse_csa_saisa< t_csa, t_direction >A helper class for the $\Psi$ function for (compressed) suffix arrays which provide also the inverse suffix array values (like sdsl::csa_bitcompressed)
 Csdsl::traverse_csa_saisa_trait< t_csa, t_direction >
 Csdsl::traverse_csa_saisa_trait< t_csa, false >
 Csdsl::traverse_csa_wt< t_csa, t_direction >A wrapper class for the $\Psi$ and LF function for (compressed) suffix arrays that are based on a wavelet tree (like sdsl::csa_wt)
 Csdsl::traverse_csa_wt_traits< t_csa, t_direction >
 Csdsl::traverse_csa_wt_traits< t_csa, false >
 Csdsl::_lcp_support_sada< t_csa, t_bitvec, t_select >::type< Cst >
 Csdsl::_lcp_support_tree2< t_dens, t_cst >::type< CST >
 Csdsl::_lcp_support_tree< t_lcp, t_cst >::type< CST >
 Csdsl::uint128_t
 Csdsl::uint256_t
 Csdsl::vlc_vector< t_coder, t_dens, t_width >A generic immutable space-saving vector class for unsigned integers
 Csdsl::vlc_vector_trait< t_width >
 Csdsl::vlc_vector_trait< 32 >
 Csdsl::void_< T >
 Csdsl::wm_int< t_bitvector, t_rank, t_select, t_select_zero >A wavelet tree class for integer sequences
 Csdsl::write_out_mapper< t_width >
 Csdsl::wt_alphabet_trait< t_wt, t_enable >
 Csdsl::wt_alphabet_trait< t_wt, typename enable_if_type< typename t_wt::alphabet_category >::type >
 Csdsl::wt_ap< t_wt_byte, t_wt_int >A wavelet tree class for integer sequences
 Csdsl::wt_epr< alphabet_size, rank_type, t_tree_strat >An EPR-dictionary based wavelet
 Csdsl::wt_gmr< t_rac, t_inverse_support, t_bitvector, t_select, t_select_zero >A wavelet tree class for integer sequences
 Csdsl::wt_gmr_rs< t_rac, t_bitvector, t_select, t_select_zero >A wavelet tree class for integer sequences
 Csdsl::wt_int< t_bitvector, t_rank, t_select, t_select_zero >A wavelet tree class for integer sequences
 Csdsl::wt_pc< t_shape, t_bitvector, t_rank, t_select, t_select_zero, t_tree_strat >A prefix code-shaped wavelet
 Csdsl::wt_rlmn< t_bitvector, t_rank, t_select, t_wt >A Wavelet Tree class for byte sequences
 Csdsl::wt_rlmn_trait< t_alphabet_cat >
 Csdsl::wt_rlmn_trait< byte_alphabet_tag >
 Csdsl::wt_tag