This repository was archived by the owner on Sep 24, 2024. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBitField.cpp
More file actions
249 lines (204 loc) · 4.18 KB
/
BitField.cpp
File metadata and controls
249 lines (204 loc) · 4.18 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
#include "BitField.h"
void BitField::TurnOn(unsigned int index)
{
bitarray[index >> 5] = (bitarray[index >> 5] | BitMask(0, (index & 31)));
}
void BitField::TurnOff(unsigned int index)
{
bitarray[index >> 5] = (bitarray[index >> 5] & BitMask(1, (index & 31)));
}
bool BitField::CheckState(unsigned int index)
{
int op1;
int op2;
int res1;
int res2;
int res3;
bool res_final;
op1 = (index >> 5);
res1 = bitarray[op1];
op2 = (31 & index);
res2 = BitMask(2, op2);
res3 = res1 & res2;
res_final = res3 != 0;
return res_final;
}
unsigned int BitField::BitMask(unsigned int task, unsigned int location)
{
unsigned int result;
switch (task)
{
case 0:
result = 1 << location;
break;
case 1:
result = ~(1 << location);
break;
case 2:
result = 1 << location;
break;
}
return result;
}
BitField::BitField()
{
bitarray = new unsigned int[1];
used_bits = 0;
reserved_ints = 1;
for (unsigned int i = 0; i < reserved_ints; i++)
{
bitarray[i] = 0;
}
}
BitField::BitField(unsigned int& n)
{
bitarray = new unsigned int[n];
used_bits = 0;
reserved_ints = n;
for (unsigned int i = 0; i < reserved_ints; i++)
{
bitarray[i] = 0;
}
}
BitField::BitField(BitField& obj2)
{
used_bits = obj2.used_bits;
reserved_ints = obj2.reserved_ints;
bitarray = new unsigned int[obj2.reserved_ints];
for (unsigned int i = 0; i < reserved_ints; i++)
{
bitarray[i] = obj2.bitarray[i];
}
}
BitField::~BitField()
{
delete[] bitarray;
}
bool BitField::operator ==(const BitField& obj2)
{
bool result = 1;
if (reserved_ints != obj2.reserved_ints || used_bits != obj2.used_bits)
{
result = 0;
}
else
{
for (unsigned int i = 0; i < reserved_ints; i++)
{
if (bitarray[i] != obj2.bitarray[i])
{
result = 0;
break;
}
}
}
return result;
}
BitField& BitField::operator =(const BitField& obj2)
{
if (this != &obj2)
{
if (reserved_ints != obj2.reserved_ints)
{
reserved_ints = obj2.reserved_ints;
bitarray = new unsigned int[obj2.reserved_ints];
}
for (unsigned int i = 0; i < reserved_ints; i++)
{
bitarray[i] = obj2.bitarray[i];
}
used_bits = obj2.used_bits;
}
return *this;
}
BitField BitField::operator &(const BitField& obj2)
{
unsigned int result_bitfield_size;
int smaller_bitfield_size;
if (reserved_ints >= obj2.reserved_ints)
{
result_bitfield_size = reserved_ints;
smaller_bitfield_size = obj2.reserved_ints;
}
else
{
result_bitfield_size = obj2.reserved_ints;
smaller_bitfield_size = reserved_ints;
}
BitField result(result_bitfield_size);
if (used_bits > obj2.used_bits)
{
result.used_bits = used_bits;
}
else
{
result.used_bits = obj2.used_bits;
}
for (int i = 0; i < smaller_bitfield_size; i++)
{
result.bitarray[i] = (bitarray[i] & obj2.bitarray[i]);
}
return result;
}
BitField BitField::operator |(const BitField& obj2)
{
unsigned int result_bitfield_size;
int smaller_bitfield_size;
if (reserved_ints >= obj2.reserved_ints)
{
result_bitfield_size = reserved_ints;
smaller_bitfield_size = obj2.reserved_ints;
}
else
{
result_bitfield_size = obj2.reserved_ints;
smaller_bitfield_size = reserved_ints;
}
BitField result(result_bitfield_size);
if (used_bits > obj2.used_bits)
{
result.used_bits = used_bits;
}
else
{
result.used_bits = obj2.used_bits;
}
for (int i = 0; i < smaller_bitfield_size; i++)
{
result.bitarray[i] = (bitarray[i] | obj2.bitarray[i]);
}
if (smaller_bitfield_size == reserved_ints)
{
for (unsigned int i = smaller_bitfield_size; i < obj2.reserved_ints; i++)
{
result.bitarray[i] = obj2.bitarray[i];
}
}
else if (smaller_bitfield_size == obj2.reserved_ints)
{
for (unsigned int i = smaller_bitfield_size; i < reserved_ints; i++)
{
result.bitarray[i] = bitarray[i];
}
}
return result;
}
void BitField::ChangeSize(unsigned int size)
{
unsigned int int_size = ((size >> 5) + 1);
if (reserved_ints < int_size)
{
BitField temp = *this;
bitarray = new unsigned int[int_size];
used_bits = size;
reserved_ints = int_size;
for (unsigned int i = 0; i < ((temp.used_bits >> 5) + 1); i++)
{
bitarray[i] = temp.bitarray[i];
}
for (unsigned int i = ((temp.used_bits >> 5) + 1); i < reserved_ints; i++)
{
bitarray[i] = 0;
}
}
}