SDSL 3.0.1
Succinct Data Structure Library
|
rank_support_int.hpp contains classes that support a sdsl::int_vector with constant time rank information. More...
#include <sdsl/int_vector.hpp>
#include <sdsl/uint128_t.hpp>
#include <sdsl/rank_support_int_scan.hpp>
#include <sdsl/rank_support_int_v.hpp>
Go to the source code of this file.
Classes | |
class | sdsl::rank_support_int< alphabet_size > |
The base class of classes supporting rank_queries for a sdsl::int_vector in constant time. More... | |
Namespaces | |
namespace | sdsl |
Namespace for the succinct data structure library. | |
Macros | |
#define | likely(x) __builtin_expect((x), 1) |
#define | unlikely(x) __builtin_expect((x), 0) |
Functions | |
constexpr size_t | sdsl::floor_log2 (size_t const n) |
constexpr size_t | sdsl::ceil_log2 (size_t const n) |
rank_support_int.hpp contains classes that support a sdsl::int_vector with constant time rank information.
Rank is defined as the number of occurrences of a value up to a given position.
Definition in file rank_support_int.hpp.
#define likely | ( | x | ) | __builtin_expect((x), 1) |
Definition at line 20 of file rank_support_int.hpp.
#define unlikely | ( | x | ) | __builtin_expect((x), 0) |
Definition at line 21 of file rank_support_int.hpp.