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
|
/* Copyright (C) 2003 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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */
#ifndef DLC_HASHTABLE_HPP
#define DLC_HASHTABLE_HPP
#include <ndb_global.h>
#include "DLHashTable.hpp"
// Adds "count" to DLHashTable
template <class T, class U = T>
class DLCHashTable : public DLHashTable<T, U> {
public:
// Ctor
DLCHashTable(ArrayPool<T> & thePool) :
DLHashTable<T, U>(thePool),
m_count(0)
{}
// Get count
Uint32 count() const { return m_count; }
// Redefine methods which do add or remove
void add(Ptr<T>& ptr) {
DLHashTable<T, U>::add(ptr);
m_count++;
}
void remove(Ptr<T>& ptr, const T & key) {
DLHashTable<T, U>::remove(ptr, key);
m_count--;
}
void remove(Uint32 i) {
DLHashTable<T, U>::remove(i);
m_count--;
}
void remove(Ptr<T>& ptr) {
DLHashTable<T, U>::remove(ptr);
m_count--;
}
void removeAll() {
DLHashTable<T, U>::removeAll();
m_count = 0;
}
void release(Ptr<T>& ptr, const T & key) {
DLHashTable<T, U>::release(ptr, key);
m_count--;
}
void release(Uint32 i) {
DLHashTable<T, U>::release(i);
m_count--;
}
void release(Ptr<T>& ptr) {
DLHashTable<T, U>::release(ptr);
m_count--;
}
private:
Uint32 m_count;
};
#endif
|
