|
SDSL 3.0.3
Succinct Data Structure Library
|
| ►Ncereal | |
| ►Ntraits | |
| Cis_input_serializable | |
| Cis_output_serializable | |
| CBinaryData | |
| ►Nsdsl | Namespace for the succinct data structure library |
| ►Ncoder | Namespace for the different coder of the sdsl |
| Ccomma | A class to encode and decode between comma code and binary code |
| Celias_delta | A class to encode and decode between Elias- ![]() |
| Celias_gamma | A class to encode and decode between Elias- ![]() |
| Cfibonacci | A class to encode and decode between Fibonacci and binary code |
| Crun_length | |
| ►Ndetail | |
| Cbit_compressed_word | A bit compressed word |
| ►Nk2_treap_ns | |
| Cnode_type | |
| Cprecomp | |
| Cprecomp< 16 > | |
| Cprecomp< 2 > | |
| Cprecomp< 4 > | |
| Cprecomp< 8 > | |
| Crange_iterator | |
| Ctop_k_iterator | |
| ►Nqsufsort | |
| Csorter | |
| C_balanced_shape | |
| C_bwt_sampling | |
| C_byte_tree | |
| C_fuzzy_isa_sampling_support | |
| C_fuzzy_sa_sampling | |
| C_huff_shape | |
| ►C_hutu_shape | |
| Cheap_node | Node class used by the leftist heap |
| Cht_node | |
| Cl_heap | |
| Cm_node | |
| C_int_tree | |
| C_interval_symbols_wt | |
| C_interval_symbols_wt< t_wt, false > | |
| C_isa_sampling | |
| ►C_lcp_support_sada | A class to represent the LCP array in compressed form |
| Ctype | |
| ►C_lcp_support_tree | This class composes a virtual LCP array from a LCP arrays which is in suffix array order (e.g |
| Ctype | |
| ►C_lcp_support_tree2 | An lcp array class for cst_sct3 and cst_sada |
| Ctype | |
| C_node | |
| C_sa_order_sampling | |
| C_symbols_calls_wt | |
| C_symbols_calls_wt< t_wt, false > | |
| C_text_order_isa_sampling_support | |
| C_text_order_sampling | |
| C_trbudget_t | |
| Calphabet_tag | |
| Calphabet_trait | |
| Calphabet_trait< int_alphabet_tag > | |
| Cbalanced_shape | |
| Cbfoot | |
| Cbinomial15_impl | |
| Cbinomial_coefficients | A struct for the binomial coefficients ![]() |
| Cbinomial_coefficients_trait | Trait struct for the binomial coefficient struct to handle different type of integers |
| Cbinomial_coefficients_trait< 7 > | Specialization of binomial_coefficients_trait for 128-bit integers |
| Cbinomial_coefficients_trait< 8 > | Specialization of binomial_coefficients_trait for 256-bit integers |
| Cbinomial_table | |
| Cbit_vector_il | A bit vector which interleaves the original bit_vector with rank information |
| Cbits_impl | A helper class for bitwise tricks on 64 bit words |
| Cbp_interval | |
| Cbp_support_g | A class that provides support for bit_vectors that represent a BP sequence |
| Cbp_support_gg | A class that provides support for bit_vectors that represent a BP sequence |
| Cbp_support_sada | A class that provides support for bit_vectors that represent a BP sequence |
| Cbuffered_char_queue | |
| Cbv_tag | |
| Cbwt_of_csa_psi | A wrapper for the bwt of a compressed suffix array that is based on the ![]() |
| Cbwt_of_csa_wt | |
| Cbyte_alphabet | A simple space greedy representation for byte alphabets |
| Cbyte_alphabet_tag | |
| Cbyte_tree | |
| Ccache_config | Helper class for construction process |
| Cconstruct_config_data | |
| Ccsa_bitcompressed | A class for the uncompressed suffix array (SA) |
| Ccsa_member_tag | |
| Ccsa_sada | A class for the Compressed Suffix Array (CSA) proposed by Sadakane for practical implementation |
| Ccsa_tag | |
| Ccsa_wt | A class for the Compressed Suffix Array (CSA) based on a Wavelet Tree (WT) of the Burrow Wheeler Transform of the original text |
| Ccst_bfs_iterator | A forward iterator for a breath first traversal of a tree |
| Ccst_bottom_up_const_forward_iterator | A forward iterator for a bottom up traversal of a suffix tree |
| Ccst_dfs_const_forward_iterator | An forward iterator for (compressed) suffix trees |
| Ccst_fully | A class for the Fully-Compressed Suffix Tree (FCST) proposed by Russo et al |
| Ccst_node_child_proxy | |
| Ccst_node_child_proxy_iterator | |
| Ccst_sada | A class for the Compressed Suffix Tree (CST) proposed by Sadakane |
| Ccst_sct3 | A class for the Compressed Suffix Tree (CST) proposed by Ohlebusch and Gog |
| Ccst_tag | |
| Cdac_vector | A generic immutable space-saving vector class for unsigned integers |
| Cdefault_sentinel | |
| Cdefault_sentinel< t_csx, byte_alphabet_tag > | |
| Cdefault_sentinel< t_csx, int_alphabet_tag > | |
| Cenable_if_type | |
| Cenc_vector | A generic immutable space-saving vector class for unsigned integers |
| Cenc_vector_trait | |
| Cenc_vector_trait< 32 > | |
| Cenc_vector_trait< 64 > | |
| ►Cexcess | |
| Cimpl | |
| Cfast_cache | |
| Cfirst_row_of_csa | |
| Cfuzzy_isa_sampling_support | |
| Cfuzzy_sa_sampling | |
| Chas_expand | |
| Chas_expand< t_wt, t_ret(t_args...)> | |
| Chas_id | |
| Chas_interval_symbols | |
| Chas_load | |
| Chas_node_type | |
| Chas_node_type< t_wt, typename void_< typename t_wt::node_type >::type > | |
| Chas_range_search_2d | |
| Chas_serialize | |
| Chas_symbols_wt | |
| Chuff_shape | |
| Chugepage_allocator | |
| Chutu_shape | |
| Chyb_vector | A hybrid-encoded compressed bitvector representation |
| Cindex_tag | |
| Cindex_tag< t_idx, typename enable_if_type< typename t_idx::index_category >::type > | |
| ►Cint_alphabet | A space-efficient representation for byte alphabets |
| Cchar2comp_wrapper | Helper class for the char2comp mapping |
| Ccomp2char_wrapper | Helper class for the comp2char mapping |
| Cint_alphabet_tag | |
| Cint_tree | |
| Cint_vec_category_trait | |
| Cint_vec_category_trait< 1 > | |
| ►Cint_vector | A generic vector class for integers of width ![]() |
| Craw_wrapper | |
| ►Cint_vector_buffer | |
| Citerator | |
| Creference | |
| Cint_vector_const_iterator | |
| Cint_vector_iterator | |
| Cint_vector_iterator_base | |
| Cint_vector_load_vbyte_wrapper | |
| Cint_vector_load_vlen_wrapper | |
| Cint_vector_load_wrapper | |
| Cint_vector_mapper | |
| Cint_vector_reference | A proxy class that acts as a reference to an integer of length len bits in a int_vector |
| Cint_vector_reference< bit_vector > | |
| Cint_vector_serialize_min_overhead | |
| Cint_vector_serialize_vbyte_wrapper | |
| Cint_vector_serialize_vlen_wrapper | |
| Cint_vector_serialize_wrapper | |
| Cint_vector_trait | |
| Cint_vector_trait< 16 > | |
| Cint_vector_trait< 32 > | |
| Cint_vector_trait< 64 > | |
| Cint_vector_trait< 8 > | |
| Cinv_multi_perm_support | Class inv_multi_perm_support adds access to the inverse of permutations |
| Cinv_perm_support | Class inv_perm_support adds access to the inverse of a permutation |
| Cis_alphabet | |
| Cis_alphabet< t_alphabet, typename enable_if_type< typename t_alphabet::alphabet_category >::type > | |
| Cis_enc_vec | |
| Cis_enc_vec< t_enc_vec, typename enable_if_type< typename t_enc_vec::enc_vec_type >::type > | |
| Cisa_of_csa_psi | |
| Cisa_of_csa_wt | |
| Cisa_sampling | |
| Cisa_sampling_tag | |
| Cisfstream | |
| Civ_tag | |
| Ck2_treap | A k^2-treap |
| Ck2_tree | A k^2-tree |
| Ckey_bwt_trait_impl | Helper classes to transform width=0 and width=8 to corresponding bwt key |
| Ckey_bwt_trait_impl< 0, T > | |
| Ckey_bwt_trait_impl< 8, T > | |
| Ckey_text_trait_impl | Helper classes to transform width=0 and width=8 to corresponding text key |
| Ckey_text_trait_impl< 0, T > | |
| Ckey_text_trait_impl< 8, T > | |
| Clcp_bitcompressed | |
| Clcp_byte | A class for a simple compressed version of LCP information |
| Clcp_fully | |
| Clcp_permuted_tag | |
| Clcp_plain_tag | |
| Clcp_support_sada | Helper class which provides _lcp_support_sada the context of a CSA |
| Clcp_support_tree | Helper class which provides _lcp_support_tree the context of a CST |
| Clcp_support_tree2 | Helper class which provides _lcp_support_tree2 the context of a CST |
| Clcp_tag | |
| Clcp_tree_and_lf_compressed_tag | |
| Clcp_tree_compressed_tag | |
| Clcp_vlc | |
| Clcp_wt | A class for the compressed version of lcp information of an suffix array |
| Clf_tag | |
| Clibdivsufsort_config | |
| Clibdivsufsort_config< int32_t > | |
| Clibdivsufsort_config< int64_t > | |
| Clouds_node | A class for the node representation of louds_tree |
| Clouds_tree | A tree class based on the level order unary degree sequence (LOUDS) representation |
| Cmemory_manager | |
| ►Cmemory_monitor | |
| Cmm_event_proxy | |
| Cmm_alloc | |
| Cmm_block | |
| Cmm_event | |
| Cnearest_neighbour_dictionary | Nearest neighbour dictionary for sparse uniform sets (described in Geary et al., A Simple Optimal Representation for Balanced Parentheses, CPM 2004) |
| ►Cnn_dict_dynamic | A class for a dynamic bit vector which also supports the prev and next operations |
| Creference | |
| Cnode_bv_container | |
| Cnode_seq_container | |
| ►Cnullstream | |
| Cnullbuf | |
| Cosfstream | |
| Cpc_node | |
| ►Cplain_byte_alphabet | Provides an alphabet mapping that implements an identity map (i.e |
| Cmapping_wrapper | Helper class for the char2comp and comp2char mapping |
| Cpsi_tag | |
| Cram_filebuf | |
| Cramfs_storage | |
| Crandom_access_const_iterator | Generic iterator for a random access container |
| Crandom_access_container | |
| Crange_maximum_sct | |
| Crange_maximum_support_sada | |
| Crank_result | |
| Crank_result< 0 > | |
| Crank_support | The base class of classes supporting rank_queries for a sdsl::bit_vector in constant time |
| Crank_support_hyb | Rank_support for the hyb_vector class |
| Crank_support_il | |
| Crank_support_int | The base class of classes supporting rank_queries for a sdsl::int_vector in constant time |
| Crank_support_int_scan | A class supporting rank queries in linear time |
| ►Crank_support_int_v | A rank structure proposed by Christopher Pockrandt |
| Csuperblock_entry | Stores a superblock entry in a cache friendly pattern |
| Crank_support_rrr | |
| Crank_support_rrr< t_b, 15, t_rac, t_k > | Rank_support for the specialized rrr_vector class of block size 15 |
| Crank_support_rrr_trait | |
| Crank_support_rrr_trait< 0 > | |
| Crank_support_scan | A class supporting rank queries in linear time |
| Crank_support_sd | Rank data structure for sd_vector |
| Crank_support_sd_trait | |
| Crank_support_sd_trait< 0 > | |
| Crank_support_trait | |
| Crank_support_trait< 0, 1 > | |
| Crank_support_trait< 00, 2 > | |
| Crank_support_trait< 01, 2 > | |
| Crank_support_trait< 1, 1 > | |
| Crank_support_trait< 10, 2 > | |
| Crank_support_trait< 11, 2 > | |
| Crank_support_v | A rank structure proposed by Sebastiano Vigna |
| Crank_support_v5 | A class supporting rank queries in constant time |
| Crmq_succinct_sada | A class to support range minimum or range maximum queries on a random access container |
| Crmq_succinct_sct | A class to support range minimum or range maximum queries on a random access container |
| Crmq_support_sparse_table | A class to support range minimum or range maximum queries on a random access container |
| Crrr_helper | Class to encode and decode binomial coefficients on the fly |
| Crrr_vector | A |
| Csa_bwt_sampling | |
| Csa_order_sa_sampling | |
| Csa_sampling_tag | |
| Csampling_tag | |
| Csampling_tag< t_sampling, typename enable_if_type< typename t_sampling::sampling_category >::type > | |
| Csd_vector | A bit vector which compresses very sparse populated bit vectors by |
| Csd_vector_builder | Class for in-place construction of sd_vector from a strictly increasing sequence |
| Cselect_0_support_sd | Select_0 data structure for sd_vector |
| Cselect_support | The base class of classes supporting select queries for a sdsl::bit_vector in constant time |
| Cselect_support_hyb | Select support for the hyb_vector class |
| Cselect_support_il | |
| Cselect_support_mcl | A class supporting constant time select queries |
| Cselect_support_rrr | |
| Cselect_support_rrr< t_b, 15, t_rac, t_k > | Select support for the specialized rrr_vector class of block size 15 |
| Cselect_support_scan | A class supporting linear time select queries |
| Cselect_support_sd | Select data structure for sd_vector |
| Cselect_support_sd_trait | |
| Cselect_support_sd_trait< 0, t_sd_vec > | |
| Cselect_support_trait | |
| Cselect_support_trait< 0, 1 > | |
| Cselect_support_trait< 00, 2 > | |
| Cselect_support_trait< 01, 2 > | |
| Cselect_support_trait< 1, 1 > | |
| Cselect_support_trait< 10, 2 > | |
| Cselect_support_trait< 11, 2 > | |
| Csorted_int_stack | A stack class which can contain integers in strictly increasing order |
| Csorted_multi_stack_support | Stack which contains elements from [0..n] in sorted order. Duplicates are possible |
| Csorted_stack_support | A stack which contains strictly increasing numbers in the range from ![]() ![]() |
| Cspin_lock | |
| Cstructure_tree | |
| Cstructure_tree_node | |
| ►Csuccinct_byte_alphabet | A space-efficient representation for byte alphabets |
| Cchar2comp_wrapper | Helper class for the char2comp mapping |
| Ccomp2char_wrapper | Helper class for the comp2char mapping |
| Ctemp_file_buffer | |
| Ctext_of_csa | |
| Ctext_order_isa_sampling_support | |
| Ctext_order_sa_sampling | |
| Ctrack_allocator | |
| Ctracker_storage | |
| Ctraverse_csa_psi | |
| Ctraverse_csa_psi_trait | |
| Ctraverse_csa_psi_trait< t_csa, false > | |
| Ctraverse_csa_saisa | A helper class for the ![]() |
| Ctraverse_csa_saisa_trait | |
| Ctraverse_csa_saisa_trait< t_csa, false > | |
| Ctraverse_csa_wt | A wrapper class for the ![]() |
| Ctraverse_csa_wt_traits | |
| Ctraverse_csa_wt_traits< t_csa, false > | |
| Cuint128_t | |
| Cuint256_t | |
| Cvlc_vector | A generic immutable space-saving vector class for unsigned integers |
| Cvlc_vector_trait | |
| Cvlc_vector_trait< 32 > | |
| Cvoid_ | |
| ►Cwm_int | A wavelet tree class for integer sequences |
| Cnode_type | Represents a node in the wavelet tree |
| Cwrite_out_mapper | |
| Cwt_alphabet_trait | |
| Cwt_alphabet_trait< t_wt, typename enable_if_type< typename t_wt::alphabet_category >::type > | |
| Cwt_ap | A wavelet tree class for integer sequences |
| Cwt_epr | An EPR-dictionary based wavelet |
| Cwt_gmr | A wavelet tree class for integer sequences |
| Cwt_gmr_rs | A wavelet tree class for integer sequences |
| ►Cwt_int | A wavelet tree class for integer sequences |
| Cnode_type | Represents a node in the wavelet tree |
| Cwt_pc | A prefix code-shaped wavelet |
| Cwt_rlmn | A Wavelet Tree class for byte sequences |
| Cwt_rlmn_trait | |
| Cwt_rlmn_trait< byte_alphabet_tag > | |
| Cwt_tag | |
| Cmin_max_trait | |
| Cmin_max_trait< RandomAccessContainer, false > |