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
|
/* Copyright (c) 2003, 2005, 2006 MySQL AB
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; version 2 of the License.
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 */
#ifndef KEY_TABLE2_HPP
#define KEY_TABLE2_HPP
#include <DLHashTable2.hpp>
/**
* KeyTable2 is DLHashTable2 with hardcoded Uint32 key named "key".
*/
template <class T, class U>
class KeyTable2 : public DLHashTable2<T, U> {
public:
KeyTable2(ArrayPool<U>& pool) :
DLHashTable2<T, U>(pool) {
}
bool find(Ptr<T>& ptr, const T& rec) const {
return DLHashTable2<T, U>::find(ptr, rec);
}
bool find(Ptr<T>& ptr, Uint32 key) const {
T rec;
rec.key = key;
return DLHashTable2<T, U>::find(ptr, rec);
}
};
template <class T, class U>
class KeyTable2C : public KeyTable2<T, U> {
Uint32 m_count;
public:
KeyTable2C(ArrayPool<U>& pool) :
KeyTable2<T, U>(pool), m_count(0) {
}
Uint32 get_count() const { return m_count; }
bool seize(Ptr<T> & ptr) {
if (KeyTable2<T, U>::seize(ptr))
{
m_count ++;
return true;
}
return false;
}
void add(Ptr<T> & ptr) {
KeyTable2<T, U>::add(ptr);
m_count ++;
}
void remove(Ptr<T> & ptr, const T & key) {
KeyTable2<T, U>::remove(ptr, key);
if (ptr.i != RNIL)
{
assert(m_count);
m_count --;
}
}
void remove(Uint32 i) {
KeyTable2<T, U>::remove(i);
assert(m_count);
m_count --;
}
void remove(Ptr<T> & ptr) {
KeyTable2<T, U>::remove(ptr);
assert(m_count);
m_count --;
}
void removeAll() {
KeyTable2<T, U>::removeAll();
m_count = 0;
}
void release(Ptr<T> & ptr, const T & key) {
KeyTable2<T, U>::release(ptr, key);
if (ptr.i != RNIL)
{
assert(m_count);
m_count --;
}
}
void release(Uint32 i) {
KeyTable2<T, U>::release(i);
assert(m_count);
m_count --;
}
void release(Ptr<T> & ptr) {
KeyTable2<T, U>::release(ptr);
assert(m_count);
m_count --;
}
};
#endif
|
