SDSL 3.0.2
Succinct Data Structure Library
|
nearest_neighbour_dictionary.hpp contains a class which supports rank/select for sparse populated sdsl::bit_vectors. More...
#include <assert.h>
#include <iosfwd>
#include <stdint.h>
#include <string>
#include <sdsl/bits.hpp>
#include <sdsl/cereal.hpp>
#include <sdsl/int_vector.hpp>
#include <sdsl/io.hpp>
#include <sdsl/rank_support_v.hpp>
#include <sdsl/structure_tree.hpp>
#include <sdsl/util.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 | |
namespace | 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.