blob: 9cf146dcbf4f79ab2064930a3e23351b6c14c8f1 (
plain)
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
|
// Copyright (C) 2023 Joel Rosdahl and other contributors
//
// See doc/AUTHORS.adoc for a complete list of contributors.
//
// This program 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.
//
// This program 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, write to the Free Software Foundation, Inc., 51
// Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
#pragma once
#include <type_traits>
namespace util {
template<typename T> class BitSet
{
public:
explicit BitSet(T value = {});
BitSet(const BitSet& set);
BitSet& operator=(const BitSet& set);
bool contains(T value) const;
bool empty() const;
void clear();
void insert(T value);
void insert(const BitSet& set);
void erase(T value);
template<typename U> static BitSet<T> from_bitmask(U mask);
typename std::underlying_type<T>::type to_bitmask() const;
private:
typename std::underlying_type<T>::type m_value;
};
// --- Inline implementations ---
template<typename T>
inline BitSet<T>::BitSet(T value)
: m_value(static_cast<typename std::underlying_type<T>::type>(value))
{
}
template<typename T>
inline BitSet<T>::BitSet(const BitSet& set) : m_value(set.m_value)
{
}
template<typename T>
inline BitSet<T>&
BitSet<T>::operator=(const BitSet& set)
{
m_value = set.m_value;
return *this;
}
template<typename T>
inline bool
BitSet<T>::contains(T value) const
{
return m_value & static_cast<typename std::underlying_type<T>::type>(value);
}
template<typename T>
inline bool
BitSet<T>::empty() const
{
return to_bitmask() == 0;
}
template<typename T>
inline void
BitSet<T>::insert(T value)
{
m_value |= static_cast<typename std::underlying_type<T>::type>(value);
}
template<typename T>
inline void
BitSet<T>::insert(const BitSet& set)
{
m_value |= static_cast<typename std::underlying_type<T>::type>(set.m_value);
}
template<typename T>
inline void
BitSet<T>::erase(T value)
{
m_value &= ~static_cast<typename std::underlying_type<T>::type>(value);
}
template<typename T>
template<typename U>
inline BitSet<T>
BitSet<T>::from_bitmask(U mask)
{
BitSet result;
result.m_value = mask;
return result;
}
template<typename T>
inline typename std::underlying_type<T>::type
BitSet<T>::to_bitmask() const
{
return m_value;
}
} // namespace util
|
