blob: 95b75354f34d054dbc7f76089476d864d8547a89 (
plain)
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
|
/***************************************************************************
* 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 <util/bitset.h>
#include "chunkcounter.h"
namespace bt
{
ChunkCounter::ChunkCounter(Uint32 num_chunks) : cnt(num_chunks)
{
// fill with 0
cnt.fill(0);
}
ChunkCounter::~ChunkCounter()
{
}
void ChunkCounter::reset()
{
cnt.fill(0);
}
void ChunkCounter::incBitSet(const BitSet & bs)
{
for (Uint32 i = 0;i < cnt.size();i++)
{
if(bs.get(i))
cnt[i]++;
}
}
void ChunkCounter::decBitSet(const BitSet & bs)
{
for (Uint32 i = 0;i < cnt.size();i++)
{
if(bs.get(i))
dec(i);
}
}
void ChunkCounter::inc(Uint32 idx)
{
if (idx < cnt.size())
cnt[idx]++;
}
void ChunkCounter::dec(Uint32 idx)
{
if (idx < cnt.size() && cnt[idx] > 0)
cnt[idx]--;
}
Uint32 ChunkCounter::get(Uint32 idx) const
{
if (idx < cnt.size())
return cnt[idx];
else
return 0;
}
}
|
