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
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
|
/* Bitset.cpp
Copyright (c) 2021 by quyykk
Endless Sky is free software: you can redistribute it and/or modify it under the
terms of the GNU General Public License as published by the Free Software
Foundation, either version 3 of the License, or (at your option) any later version.
Endless Sky is distributed in the hope that it will be useful, but WITHOUT ANY
WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A
PARTICULAR PURPOSE. See the GNU General Public License for more details.
You should have received a copy of the GNU General Public License along with
this program. If not, see <https://www.gnu.org/licenses/>.
*/
#include "Bitset.h"
#include <algorithm>
using namespace std;
// Returns the number of bits this bitset can hold.
size_t Bitset::Size() const noexcept
{
return bits.size() * BITS_PER_BLOCK;
}
// Returns the number of bits this bitset has reserved.
size_t Bitset::Capacity() const noexcept
{
return bits.capacity() * BITS_PER_BLOCK;
}
// Resizes the bitset to hold at least the specific amount of bits.
void Bitset::Resize(size_t size)
{
bits.resize(size / BITS_PER_BLOCK + 1);
}
// Clears the bitset. After this call this bitset is empty.
void Bitset::Clear() noexcept
{
bits.clear();
}
// Whether the given bitset has any bits that are also set in this bitset.
bool Bitset::Intersects(const Bitset &other) const noexcept
{
const auto size = min(bits.size(), other.bits.size());
for(size_t i = 0; i < size; ++i)
if(bits[i] & other.bits[i])
return true;
return false;
}
// Returns the value of the bit at the specified index.
bool Bitset::Test(size_t index) const noexcept
{
const auto blockIndex = index / BITS_PER_BLOCK;
const auto pos = index % BITS_PER_BLOCK;
return bits[blockIndex] & (uint64_t(1) << pos);
}
// Sets the bit at the specified index.
void Bitset::Set(size_t index) noexcept
{
const auto blockIndex = index / BITS_PER_BLOCK;
const auto pos = index % BITS_PER_BLOCK;
bits[blockIndex] |= (uint64_t(1) << pos);
}
// Resets all bits in the bitset.
void Bitset::Reset() noexcept
{
for(auto &it : bits)
it = uint64_t(0);
}
// Whether any bits are set.
bool Bitset::Any() const noexcept
{
for(uint64_t block : bits)
if(block)
return true;
return false;
}
// Whether no bits are set.
bool Bitset::None() const noexcept
{
return !Any();
}
// Fills the current bitset with the bits of other.
void Bitset::UpdateWith(const Bitset &other)
{
const auto size = min(bits.size(), other.bits.size());
for(size_t i = 0; i < size; ++i)
bits[i] = other.bits[i];
}
|
