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
|
// Copyright (C) 2003 Davis E. King (davis@dlib.net)
// License: Boost Software License See LICENSE.txt for the full license.
#ifndef DLIB_HASH_TABLe_
#define DLIB_HASH_TABLe_
#include "hash_table/hash_table_kernel_1.h"
#include "hash_table/hash_table_kernel_2.h"
#include "hash_table/hash_table_kernel_c.h"
#include "algs.h"
#include "binary_search_tree.h"
#include <functional>
namespace dlib
{
template <
typename domain,
typename range,
typename mem_manager = default_memory_manager,
typename compare = std::less<domain>
>
class hash_table
{
hash_table() {}
typedef typename binary_search_tree<domain,range,mem_manager,compare>::kernel_1a
bst_1;
typedef typename binary_search_tree<domain,range,mem_manager,compare>::kernel_2a
bst_2;
public:
//----------- kernels ---------------
// kernel_1a
typedef hash_table_kernel_1<domain,range,mem_manager,compare>
kernel_1a;
typedef hash_table_kernel_c<kernel_1a>
kernel_1a_c;
// kernel_2a
typedef hash_table_kernel_2<domain,range,bst_1,mem_manager,compare>
kernel_2a;
typedef hash_table_kernel_c<kernel_2a>
kernel_2a_c;
// kernel_2b
typedef hash_table_kernel_2<domain,range,bst_2,mem_manager,compare>
kernel_2b;
typedef hash_table_kernel_c<kernel_2b>
kernel_2b_c;
};
}
#endif // DLIB_HASH_TABLe_
|