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
|
/*
Copyright (C) 2001-2004 Stephane Magnenat & Luc-Olivier de Charrière
for any question or comment contact us at <stephane at magnenat dot net> or <NuageBleu at gmail dot 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 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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
#include "BitArray.h"
#include <assert.h>
#include <algorithm>
#include <iostream>
namespace Utilities
{
BitArray::BitArray(size_t size, bool defaultValue)
{
resize(size, defaultValue);
}
void BitArray::assertPos(size_t pos)
{
size_t wordPos = pos / 8;
if (wordPos >= values.size())
{
std::cerr << "BitArray::assertPos(" << pos << ") : index out of bounds. Max size is " << bitLength << std::endl;
assert(false);
}
}
void BitArray::resize(size_t size, bool defaultValue)
{
bitLength = size;
if (defaultValue)
values.resize(bitToByte(size), 1);
else
values.resize(bitToByte(size), 0);
}
size_t BitArray::bitToByte(size_t v)
{
if (v&0x7)
return (v>>3)+1;
else
return v>>3;
}
void BitArray::set(size_t pos, bool value)
{
assertPos(pos);
size_t wordPos = pos / 8;
size_t bitPos = pos % 8;
if (value)
values[wordPos] |= (1<<bitPos);
else
values[wordPos] &= ~(1<<bitPos);
}
bool BitArray::get(size_t pos)
{
assertPos(pos);
size_t wordPos = pos / 8;
size_t bitPos = pos % 8;
return (values[wordPos] & (1<<bitPos)) != 0;
}
void BitArray::serialize(unsigned char *stream)
{
size_t l = values.size();
std::copy(&values[0], &values[l], stream);
}
void BitArray::deserialize(const unsigned char *stream, size_t size)
{
bitLength = size;
values.resize(bitToByte(size));
std::copy(stream, stream+values.size(), &values[0]);
}
}
|
