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
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
|
// Copyright (C) 2003 Davis E. King (davis@dlib.net)
// License: Boost Software License See LICENSE.txt for the full license.
#ifndef DLIB_HASH_TABLE_KERNEl_C_
#define DLIB_HASH_TABLE_KERNEl_C_
#include "hash_table_kernel_abstract.h"
#include "../algs.h"
#include "../interfaces/map_pair.h"
#include "../assert.h"
namespace dlib
{
template <
typename ht_base
>
class hash_table_kernel_c : public ht_base
{
typedef typename ht_base::domain_type domain;
typedef typename ht_base::range_type range;
public:
explicit hash_table_kernel_c (
unsigned long expnum
) :
ht_base(expnum)
{
DLIB_CASSERT(expnum < 32,
"\thash_table::hash_table(unsigned long)"
<< "\n\tyou can't set expnum >= 32"
<< "\n\tthis: " << this
<< "\n\texpnum: " << expnum
);
}
void remove (
const domain& d,
domain& d_copy,
range& r
);
void remove_any (
domain& d,
range& r
);
void add (
domain& d,
range& r
);
void destroy (
const domain& d
);
const map_pair<domain,range>& element (
) const;
map_pair<domain,range>& element (
);
};
template <
typename ht_base
>
inline void swap (
hash_table_kernel_c<ht_base>& a,
hash_table_kernel_c<ht_base>& b
) { a.swap(b); }
// ----------------------------------------------------------------------------------------
// ----------------------------------------------------------------------------------------
// member function definitions
// ----------------------------------------------------------------------------------------
// ----------------------------------------------------------------------------------------
template <
typename ht_base
>
void hash_table_kernel_c<ht_base>::
remove (
const domain& d,
domain& d_copy,
range& r
)
{
DLIB_CASSERT(this->operator[](d) != 0 &&
(static_cast<const void*>(&d) != static_cast<void*>(&d_copy)) &&
(static_cast<const void*>(&d) != static_cast<void*>(&r)) &&
(static_cast<const void*>(&r) != static_cast<void*>(&d_copy)),
"\tvoid binary_search_tree::remove"
<< "\n\tthe element must be in the table for it to be removed"
<< "\n\tthis: " << this
<< "\n\t&d: " << &d
<< "\n\t&d_copy: " << &d_copy
<< "\n\t&r: " << &r
);
ht_base::remove(d,d_copy,r);
}
// ----------------------------------------------------------------------------------------
template <
typename ht_base
>
void hash_table_kernel_c<ht_base>::
add(
domain& d,
range& r
)
{
DLIB_CASSERT( static_cast<const void*>(&d) != static_cast<void*>(&r),
"\tvoid binary_search_tree::add"
<< "\n\tyou can't call add() and give the same object to both arguments."
<< "\n\tthis: " << this
<< "\n\t&d: " << &d
<< "\n\t&r: " << &r
<< "\n\tsize(): " << this->size()
);
ht_base::add(d,r);
}
// ----------------------------------------------------------------------------------------
template <
typename ht_base
>
void hash_table_kernel_c<ht_base>::
destroy(
const domain& d
)
{
DLIB_CASSERT((*this)[d] != 0,
"\tvoid hash_table::destroy"
<< "\n\tthe element must be in the table for it to be destroyed"
<< "\n\tthis: " << this
<< "\n\t&d: " << &d
);
ht_base::destroy(d);
}
// ----------------------------------------------------------------------------------------
template <
typename ht_base
>
void hash_table_kernel_c<ht_base>::
remove_any(
domain& d,
range& r
)
{
DLIB_CASSERT(this->size() != 0 &&
(static_cast<const void*>(&d) != static_cast<void*>(&r)),
"\tvoid hash_table::remove_any"
<< "\n\ttable must not be empty if something is going to be removed"
<< "\n\tthis: " << this
<< "\n\t&d: " << &d
<< "\n\t&r: " << &r
);
ht_base::remove_any(d,r);
}
// ----------------------------------------------------------------------------------------
template <
typename ht_base
>
const map_pair<typename ht_base::domain_type,typename ht_base::range_type>& hash_table_kernel_c<ht_base>::
element (
) const
{
DLIB_CASSERT(this->current_element_valid() == true,
"\tconst map_pair<domain,range>& hash_table::element() const"
<< "\n\tyou can't access the current element if it doesn't exist"
<< "\n\tthis: " << this
);
return ht_base::element();
}
// ----------------------------------------------------------------------------------------
template <
typename ht_base
>
map_pair<typename ht_base::domain_type,typename ht_base::range_type>& hash_table_kernel_c<ht_base>::
element (
)
{
DLIB_CASSERT(this->current_element_valid() == true,
"\tmap_pair<domain,range>& hash_table::element()"
<< "\n\tyou can't access the current element if it doesn't exist"
<< "\n\tthis: " << this
);
return ht_base::element();
}
// ----------------------------------------------------------------------------------------
}
#endif // DLIB_HASH_TABLE_KERNEl_C_
|
