SDSL
3.0.0
Succinct Data Structure Library
|
nearest_neighbour_dictionary.hpp contains a class which supports rank/select for sparse populated sdsl::bit_vectors. More...
#include <stdexcept>
#include <string>
#include <sdsl/int_vector.hpp>
#include <sdsl/rank_support.hpp>
#include <sdsl/util.hpp>
#include <sdsl/wm_int.hpp>
Go to the source code of this file.
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... | |
Namespaces | |
sdsl | |
Namespace for the succinct data structure library. | |
nearest_neighbour_dictionary.hpp contains a class which supports rank/select for sparse populated sdsl::bit_vectors.
Definition in file nearest_neighbour_dictionary.hpp.