SDSL 3.0.3
Succinct Data Structure Library
Loading...
Searching...
No Matches
rank_support_int.hpp File Reference

rank_support_int.hpp contains classes that support a sdsl::int_vector with constant time rank information. More...

#include <array>
#include <assert.h>
#include <iosfwd>
#include <stddef.h>
#include <stdint.h>
#include <string>
#include <sdsl/bits.hpp>
#include <sdsl/int_vector.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)
 
#define unlikely(x)
 

Functions

constexpr size_t sdsl::floor_log2 (size_t const n)
 
constexpr size_t sdsl::ceil_log2 (size_t const n)
 

Detailed Description

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.

Author
Christopher Pockrandt

Definition in file rank_support_int.hpp.

Macro Definition Documentation

◆ likely

#define likely ( x)
Value:
__builtin_expect((x), 1)

Definition at line 32 of file rank_support_int.hpp.

◆ unlikely

#define unlikely ( x)
Value:
__builtin_expect((x), 0)

Definition at line 33 of file rank_support_int.hpp.