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
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
|
#pragma once
#include "Algorithms.h"
#include <cstdint>
namespace nCine
{
/// A sequence of bits to be manipulated with logical operators
template<class T>
class BitSet
{
public:
BitSet();
explicit BitSet(T value);
bool operator==(const BitSet& other) const;
bool operator!=(const BitSet& other) const;
/// \returns True if the bit at the specified position is set
bool test(std::uint32_t pos) const;
/// \returns True if all bits are set
bool all() const;
/// \returns True if at least one bit is set
bool any() const;
/// \returns True if all bits are not set
bool none() const;
/// \returns The number of bits that are set
std::uint32_t count() const;
/// \returns The total number of bits in the bitset
std::uint32_t size() const;
BitSet& operator&=(const BitSet& other);
BitSet& operator|=(const BitSet& other);
BitSet& operator^=(const BitSet& other);
BitSet operator~() const;
BitSet& operator<<=(std::uint32_t pos);
BitSet& operator>>=(std::uint32_t pos);
BitSet operator<<(std::uint32_t pos) const;
BitSet operator>>(std::uint32_t pos) const;
/// Sets all bits in the bitset
void set();
/// Sets the bit at the specified position
void set(std::uint32_t pos);
/// Sets the bit at the specified position with the specified value
void set(std::uint32_t pos, bool value);
/// Resets all bits in the bitset
void reset();
/// Resets the bit at the specified position
void reset(std::uint32_t pos);
/// Flips the bit at the specified position
void flip(std::uint32_t pos);
friend BitSet operator&(const BitSet& lhs, const BitSet& rhs) {
return BitSet(lhs.bits_ & rhs.bits_);
}
friend BitSet operator|(const BitSet& lhs, const BitSet& rhs) {
return BitSet(lhs.bits_ | rhs.bits_);
}
friend BitSet operator^(const BitSet& lhs, const BitSet& rhs) {
return BitSet(lhs.bits_ ^ rhs.bits_);
}
private:
T bits_;
};
template<class T>
BitSet<T>::BitSet()
: bits_(T(0))
{
static_assert(isIntegral<T>::value, "Integral type is required");
static_assert(T(0) < T(-1), "Unsigned type is required");
}
template<class T>
BitSet<T>::BitSet(T value)
: bits_(value)
{
static_assert(isIntegral<T>::value, "Integral type is required");
static_assert(T(0) < T(-1), "Unsigned type is required");
}
template<class T>
inline bool BitSet<T>::operator==(const BitSet& other) const
{
return other.bits_ == bits_;
}
template<class T>
inline bool BitSet<T>::operator!=(const BitSet& other) const
{
return other.bits_ != bits_;
}
template<class T>
inline bool BitSet<T>::test(std::uint32_t pos) const
{
return ((bits_ >> pos) & T(1)) != T(0);
}
template<class T>
inline bool BitSet<T>::all() const
{
return ~bits_ == T(0);
}
template<class T>
inline bool BitSet<T>::any() const
{
return bits_ != T(0);
}
template<class T>
inline bool BitSet<T>::none() const
{
return bits_ == T(0);
}
template<>
inline std::uint32_t BitSet<uint8_t>::count() const
{
static const uint8_t splitLookup[] = { 0, 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 4 };
return splitLookup[bits_ & 0xF] + splitLookup[bits_ >> 4];
}
template<>
inline std::uint32_t BitSet<uint16_t>::count() const
{
return BitSet<uint8_t>(bits_ & 0xFF).count() + BitSet<uint8_t>(bits_ >> 8).count();
}
template<>
inline std::uint32_t BitSet<uint32_t>::count() const
{
uint32_t bits = bits_;
bits = bits - ((bits >> 1) & 0x55555555);
bits = (bits & 0x33333333) + ((bits >> 2) & 0x33333333);
return (((bits + (bits >> 4)) & 0x0F0F0F0F) * 0x01010101) >> 24;
}
template<>
inline std::uint32_t BitSet<uint64_t>::count() const
{
uint64_t bits = bits_;
bits = bits - ((bits >> 1) & 0x5555555555555555);
bits = (bits & 0x3333333333333333) + ((bits >> 2) & 0x3333333333333333);
return (((bits + (bits >> 4)) & 0x0F0F0F0F0F0F0F0F) * 0x0101010101010101) >> 56;
}
template<class T>
inline std::uint32_t BitSet<T>::size() const
{
return sizeof(T) * 8;
}
template<class T>
inline BitSet<T>& BitSet<T>::operator&=(const BitSet& other)
{
bits_ &= other.bits_;
return *this;
}
template<class T>
inline BitSet<T>& BitSet<T>::operator|=(const BitSet& other)
{
bits_ |= other.bits_;
return *this;
}
template<class T>
inline BitSet<T>& BitSet<T>::operator^=(const BitSet& other)
{
bits_ ^= other.bits_;
return *this;
}
template<class T>
inline BitSet<T> BitSet<T>::operator~() const
{
return BitSet(~bits_);
}
template<class T>
inline BitSet<T>& BitSet<T>::operator<<=(std::uint32_t pos)
{
bits_ <<= pos;
return *this;
}
template<class T>
inline BitSet<T>& BitSet<T>::operator>>=(std::uint32_t pos)
{
bits_ >>= pos;
return *this;
}
template<class T>
inline BitSet<T> BitSet<T>::operator<<(std::uint32_t pos) const
{
return BitSet(bits_ << pos);
}
template<class T>
inline BitSet<T> BitSet<T>::operator>>(std::uint32_t pos) const
{
return BitSet(bits_ >> pos);
}
template<class T>
inline void BitSet<T>::set()
{
bits_ = ~T(0);
}
template<class T>
inline void BitSet<T>::set(std::uint32_t pos)
{
bits_ |= T(1) << pos;
}
template<class T>
inline void BitSet<T>::set(std::uint32_t pos, bool value)
{
value ? set(pos) : reset(pos);
}
template<class T>
inline void BitSet<T>::reset()
{
bits_ = T(0);
}
template<class T>
inline void BitSet<T>::reset(std::uint32_t pos)
{
bits_ &= ~(T(1) << pos);
}
template<class T>
inline void BitSet<T>::flip(std::uint32_t pos)
{
bits_ ^= (T(1) << pos);
}
}
|
