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
|
/*
* Copyright (C) 2010 Regents of the University of Michigan
*
* 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, see <http://www.gnu.org/licenses/>.
*/
#include "LongLongCounter.h"
LongCounter::LongCounter() : LongHash<int>()
{
SetAllowDuplicateKeys(false);
}
void LongCounter::IncrementCount(long long key)
{
unsigned int slot = Find(key);
if (slot == LH_NOTFOUND)
Add(key, 1);
else if (Object(slot) == -1)
Delete(slot);
else
Object(slot)++;
}
void LongCounter::DecrementCount(long long key)
{
unsigned int slot = Find(key);
if (slot == LH_NOTFOUND)
Add(key, -1);
else if (Object(slot) == 1)
Delete(slot);
else
Object(slot)--;
}
int LongCounter::GetCount(long long key)
{
unsigned int slot = Find(key);
if (slot == LH_NOTFOUND)
return 0;
else
return Object(slot)--;
}
|
