SDSL 3.0.3
Succinct Data Structure Library
|
This group contains data structures which support an sdsl::bit_vector with the rank method. More...
Classes | |
class | sdsl::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). More... | |
class | sdsl::rank_support_int_scan< alphabet_size > |
A class supporting rank queries in linear time. More... | |
class | sdsl::rank_support_int_v< alphabet_size, words_per_block, blocks_per_superblock > |
A rank structure proposed by Christopher Pockrandt. More... | |
class | sdsl::rank_support_scan< t_b, t_pat_len > |
A class supporting rank queries in linear time. More... | |
class | sdsl::rank_support_v< t_b, t_pat_len > |
A rank structure proposed by Sebastiano Vigna. More... | |
class | sdsl::rank_support_v5< t_b, t_pat_len > |
A class supporting rank queries in constant time. More... |
This group contains data structures which support an sdsl::bit_vector with the rank method.
This group contains data structures which support an sdsl::int_vector with the rank method.