SDSL 3.0.3
Succinct Data Structure Library
|
rank_support_int_v.hpp contains rank_support_int_v. More...
#include <algorithm>
#include <array>
#include <assert.h>
#include <iosfwd>
#include <iterator>
#include <stddef.h>
#include <stdint.h>
#include <string>
#include <type_traits>
#include <vector>
#include <sdsl/bits.hpp>
#include <sdsl/cereal.hpp>
#include <sdsl/int_vector.hpp>
#include <sdsl/io.hpp>
#include <sdsl/rank_support_int.hpp>
#include <sdsl/structure_tree.hpp>
#include <sdsl/util.hpp>
Go to the source code of this file.
Classes | |
class | sdsl::detail::bit_compressed_word< value_t, bits_per_value > |
A bit compressed word. More... | |
class | sdsl::rank_support_int_v< alphabet_size, words_per_block, blocks_per_superblock > |
A rank structure proposed by Christopher Pockrandt. More... | |
struct | sdsl::rank_support_int_v< alphabet_size, words_per_block, blocks_per_superblock >::superblock_entry |
Stores a superblock entry in a cache friendly pattern. More... | |
Namespaces | |
namespace | sdsl |
Namespace for the succinct data structure library. | |
namespace | sdsl::detail |
rank_support_int_v.hpp contains rank_support_int_v.
Definition in file rank_support_int_v.hpp.