forked from scylladb/scylladb
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathdynamic_bitset.hh
68 lines (58 loc) · 2.01 KB
/
dynamic_bitset.hh
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
/*
* Copyright 2015-present ScyllaDB
*/
/*
* SPDX-License-Identifier: LicenseRef-ScyllaDB-Source-Available-1.0
*/
#pragma once
#include <cstdint>
#include <limits>
#include <vector>
#include <seastar/core/bitops.hh>
namespace utils {
class dynamic_bitset {
using int_type = uint64_t;
static constexpr size_t bits_per_int = std::numeric_limits<int_type>::digits;
static constexpr int_type all_set = std::numeric_limits<int_type>::max();
static constexpr unsigned level_shift = seastar::log2ceil(bits_per_int);
private:
std::vector<std::vector<int_type>> _bits; // level n+1 = 64:1 summary of level n
size_t _bits_count = 0;
private:
// For n in range 0..(bits_per_int-1), produces a mask with all bits < n set
static int_type mask_lower_bits(size_t n) noexcept {
return (int_type(1) << n) - 1;
}
// For n in range 0..(bits_per_int-1), produces a mask with all bits >= n set
static int_type mask_higher_bits(size_t n) noexcept {
return ~mask_lower_bits(n);
}
// For bit n, produce index into _bits[level]
static size_t level_idx(unsigned level, size_t n) noexcept {
return n >> ((level + 1) * level_shift);
}
// For bit n, produce bit number in _bits[level][level_idx]
static unsigned level_remainder(unsigned level, size_t n) noexcept {
return (n >> (level * level_shift)) & (bits_per_int - 1);
}
public:
enum : size_t {
npos = std::numeric_limits<size_t>::max()
};
public:
explicit dynamic_bitset(size_t nr_bits);
// undefined if n >= size
bool test(size_t n) const noexcept {
auto idx = n / bits_per_int;
return _bits[0][idx] & (int_type(1u) << (n % bits_per_int));
}
// undefined if n >= size
void set(size_t n) noexcept;
// undefined if n >= size
void clear(size_t n) noexcept;
size_t size() const noexcept { return _bits_count; }
size_t find_first_set() const noexcept;
size_t find_next_set(size_t n) const noexcept;
size_t find_last_set() const noexcept;
};
}