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
|
/***************************************************************************
* Copyright (C) 2005 by Joris Guisson *
* joris.guisson@gmail.com *
* *
* 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 2 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. *
***************************************************************************/
#include "bitset.h"
#include <algorithm>
#include <string.h>
BitSet BitSet::null;
BitSet::BitSet(quint32 num_bits) : num_bits(num_bits),data(0)
{
num_bytes = (num_bits / 8) + ((num_bits % 8 > 0) ? 1 : 0);
data = new quint8[num_bytes];
std::fill(data,data+num_bytes,0x00);
num_on = 0;
}
BitSet::BitSet(const quint8* d,quint32 num_bits) : num_bits(num_bits),data(0)
{
num_bytes = (num_bits / 8) + ((num_bits % 8 > 0) ? 1 : 0);
data = new quint8[num_bytes];
memcpy(data,d,num_bytes);
num_on = 0;
quint32 i = 0;
while (i < num_bits)
{
if (get(i))
num_on++;
i++;
}
}
BitSet::BitSet(const BitSet & bs) : num_bits(bs.num_bits),num_bytes(bs.num_bytes),data(0),num_on(bs.num_on)
{
data = new quint8[num_bytes];
std::copy(bs.data,bs.data+num_bytes,data);
}
BitSet::~BitSet()
{
delete [] data;
}
BitSet & BitSet::operator = (const BitSet & bs)
{
if (data)
delete [] data;
num_bytes = bs.num_bytes;
num_bits = bs.num_bits;
data = new quint8[num_bytes];
std::copy(bs.data,bs.data+num_bytes,data);
num_on = bs.num_on;
return *this;
}
void BitSet::setAll(bool on)
{
std::fill(data,data+num_bytes,on ? 0xFF : 0x00);
num_on = on ? num_bits : 0;
}
void BitSet::getContinuousRange(qint32 *start, qint32 *end, bool on)
{
*start = -1;
*end = -1;
const bool nothingFound = on ? allOff() : allOn();
if (nothingFound) {
return;
}
const bool everythingMatches = on ? allOn() : allOff();
if (everythingMatches) {
*start = 0;
*end = num_bits -1;
return;
}
for (quint32 i = 0; i < num_bits; ++i) {
if (get(i) == on) {
if (*start == -1) {
*start = i;
}
*end = i;
} else {
if (*start != -1) {
return;
}
}
}
}
void BitSet::clear()
{
setAll(false);
}
void BitSet::orBitSet(const BitSet & other)
{
quint32 i = 0;
while (i < num_bits)
{
bool val = get(i) || other.get(i);
set(i,val);
i++;
}
}
bool BitSet::allOn() const
{
return num_on == num_bits;
}
bool BitSet::allOff() const
{
return !num_on;
}
bool BitSet::operator == (const BitSet & bs)
{
if (this->getNumBits() != bs.getNumBits())
return false;
return memcmp(data,bs.data,num_bytes) == 0;
}
|
