forked from RobTillaart/Arduino
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSet.cpp
More file actions
290 lines (261 loc) · 5.13 KB
/
Set.cpp
File metadata and controls
290 lines (261 loc) · 5.13 KB
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
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
//
// FILE: Set.cpp
// AUTHOR: Rob Tillaart
// VERSION: 0.1.11
// PURPOSE: SET library for Arduino
// URL:
//
// HISTORY:
// 0.1.11 2017-07-16 fix count() --> 16 bit when set is full !
// 0.1.10 2017-07-16 performance refactor. isEmpty()
// 0.1.09 2015-07-12 const + constructor
// 0.1.08 memset for clr()
// 0.1.07 faster first/next/last/prev; interface
// 0.1.06 added flag to constructor to optimize +,-,*,
// set -> Set
// 0.1.05 bug fixing + performance a.o. count()
// 0.1.04 support for + - *, some optimizations
// 0.1.03 changed &= to *= to follow Pascal conventions
// 0.1.02 documentation
// 0.1.01 extending/refactor etc (09/11/2014)
// 0.1.00 initial version by Rob Tillaart (09/11/2014)
//
// Released to the public domain
//
#include "Set.h"
/////////////////////////////////////////////////////
//
// CONSTRUCTORS
//
Set::Set(const bool clear)
{
if (clear)
{
clr();
}
_current = -1;
}
Set::Set(const Set &t)
{
for (uint8_t i=0; i<32; i++)
{
_mem[i] = t._mem[i];
}
_current = -1;
}
/////////////////////////////////////////////////////
//
// METHODS
//
void Set::add(const uint8_t v)
{
uint8_t idx = v / 8;
_mem[idx] |= masks[v&7];
}
void Set::sub(const uint8_t v)
{
uint8_t idx = v / 8;
_mem[idx] &= ~masks[v&7];
}
void Set::invert(const uint8_t v)
{
uint8_t idx = v / 8;
_mem[idx] ^= masks[v&7];;
}
bool Set::has(const uint8_t v)
{
uint8_t idx = v / 8;
return (_mem[idx] & masks[v&7]) > 0;
}
uint16_t Set::count() const
{
uint16_t cnt = 0;
for (uint8_t i=0; i<32; i++)
{
// kerningham bit count trick
uint8_t b = _mem[i];
for (; b; cnt++)
{
b &= b-1;
}
}
return cnt;
}
void Set::clr()
{
memset(_mem, 0, 32);
}
void Set::invert()
{
for (uint8_t i=0; i<32; i++)
{
_mem[i] ^= 0xFF;
}
}
bool Set::isEmpty()
{
for (uint8_t i=0; i<32; i++)
{
if (_mem[i]) return false;
}
return true;
}
bool Set::isFull()
{
for (uint8_t i=0; i<32; i++)
{
if (_mem[i] != 255) return false;
}
return true;
}
int Set::first()
{
return findNext(0,0);
}
int Set::next()
{
if (_current & 0x8000) return -1; // if current == -1
_current++;
uint8_t p = (uint8_t)_current / 8;
uint8_t q = (uint8_t)_current & 7;
return findNext(p, q);
}
int Set::findNext(const uint8_t p, uint8_t q)
{
for (uint8_t i = p; i < 32; i++)
{
uint8_t b = _mem[i];
if (b != 0)
{
uint8_t mask = 1 << q;
for (uint8_t j = q; j < 8; j++)
{
if (b & mask)
{
_current = i * 8 + j;
return _current;
}
mask <<= 1;
}
}
q = 0;
}
_current = -1;
return _current;
}
int Set::prev()
{
if (_current & 0x8000) return -1;
_current--;
uint8_t p = (uint8_t)_current / 8;
uint8_t q = (uint8_t)_current & 7;
return findPrev(p, q);
}
int Set::last()
{
return findPrev(31, 7);
}
int Set::findPrev(const uint8_t p, uint8_t q)
{
uint8_t m = 1 << q;
for (uint8_t i = p; i != 255; --i) // uint < 0
{
uint8_t b = _mem[i];
if (b != 0)
{
uint8_t mask = m;
for (uint8_t j = q; j != 255; --j)
{
if (b & mask)
{
_current = i * 8 + j;
return _current;
}
mask >>= 1;
}
}
m = 1 << 7;
q = 7;
}
_current = -1;
return _current;
}
/////////////////////////////////////////////////////
//
// OPERATORS
//
Set Set::operator + (const Set &t) // union
{
Set s(false);
for (uint8_t i = 0; i < 32; i++)
{
s._mem[i] = this->_mem[i] | t._mem[i];
}
return s;
}
Set Set::operator - (const Set &t) // diff
{
Set s(false);
for (uint8_t i = 0; i < 32; i++)
{
s._mem[i] = this->_mem[i] & ~t._mem[i];
}
return s;
}
Set Set::operator * (const Set &t) // intersection
{
Set s(false);
for (uint8_t i = 0; i < 32; i++)
{
s._mem[i] = this->_mem[i] & t._mem[i];
}
return s;
}
void Set::operator += (const Set &t) // union
{
for (uint8_t i = 0; i < 32; i++)
{
_mem[i] |= t._mem[i];
}
}
void Set::operator -= (const Set &t) // diff
{
for (uint8_t i = 0; i < 32; i++)
{
_mem[i] &= ~t._mem[i];
}
}
void Set::operator *= (const Set &t) // intersection
{
for (uint8_t i = 0; i < 32; i++)
{
_mem[i] &= t._mem[i];
}
}
bool Set::operator == (const Set &t) const // equal
{
for (uint8_t i = 0; i < 32; i++)
{
if (_mem[i] != t._mem[i]) return false;
}
return true;
}
bool Set::operator != (const Set &t) const // not equal
{
for (uint8_t i = 0; i < 32; i++)
{
if (_mem[i] != t._mem[i]) return true;
}
return false;
}
bool Set::operator <= (const Set &t) const // subSet
{
for (uint8_t i = 0; i < 32; i++)
{
if ((_mem[i] & ~t._mem[i]) > 0) return false;
}
return true;
}
//
// END OF FILE
//