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
|
/*
//
// Copyright 1997-2009 Torsten Rohlfing
//
// Copyright 2004-2011 SRI International
//
// This file is part of the Computational Morphometry Toolkit.
//
// http://www.nitrc.org/projects/cmtk/
//
// The Computational Morphometry Toolkit 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.
//
// The Computational Morphometry Toolkit 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 the Computational Morphometry Toolkit. If not, see
// <http://www.gnu.org/licenses/>.
//
// $Revision: 5436 $
//
// $LastChangedDate: 2018-12-10 19:01:20 -0800 (Mon, 10 Dec 2018) $
//
// $LastChangedBy: torstenrohlfing $
//
*/
#include "cmtkBitVector.h"
#include <System/cmtkMemory.h>
#include <memory.h>
namespace
cmtk
{
/** \addtogroup Base */
//@{
BitVector::BitVector( const size_t size, const bool initial )
{
this->m_Size = (size+7) / 8; // +7 to allocate an extra byte for 8n+1...8n+7 bits
this->m_BitVector = Memory::ArrayC::Allocate<byte>( this->m_Size );
if ( initial )
this->Set();
else
this->Reset();
}
BitVector::BitVector( const size_t size, byte *const bitSet )
{
this->m_Size = (size+7) / 8; // +7 to allocate an extra byte for 8n+1...8n+7 bits
this->m_BitVector = bitSet;
}
BitVector::~BitVector()
{
Memory::ArrayC::Delete( this->m_BitVector );
}
BitVector*
BitVector::Clone() const
{
byte *newBitVector = Memory::ArrayC::Allocate<byte>( this->m_Size );
memcpy( newBitVector, this->m_BitVector, this->m_Size );
return new BitVector( 8*this->m_Size, newBitVector );
}
void
BitVector::Set()
{
memset( this->m_BitVector, 255, sizeof( *this->m_BitVector ) * this->m_Size );
}
void
BitVector::Set( const size_t pos, const bool val )
{
if ( val )
{
this->m_BitVector[pos/8] |= (1<<(pos%8));
}
else
{
this->m_BitVector[pos/8] &= ~(1<<(pos%8));
}
}
void
BitVector::Reset( const bool value )
{
if ( value )
memset( this->m_BitVector, 255, sizeof( *this->m_BitVector ) * this->m_Size );
else
memset( this->m_BitVector, 0, sizeof( *this->m_BitVector ) * this->m_Size );
}
void
BitVector::Reset( const size_t pos )
{
this->m_BitVector[pos/8] &= ~(1<<(pos%8));
}
void
BitVector::Flip()
{
for ( size_t i=0; i<this->m_Size; ++i )
this->m_BitVector[i] = ~this->m_BitVector[i];
}
void
BitVector::Flip( const size_t pos )
{
this->m_BitVector[pos/8] ^= (1<<(pos%8));
}
bool
BitVector::operator[]( const size_t pos ) const
{
return ( this->m_BitVector[pos/8] >> (pos%8) ) & 1;
}
} // namespace cmtk
|
