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
|
// Copyright (C) 2011 Davis E. King (davis@dlib.net)
// License: Boost Software License See LICENSE.txt for the full license.
#ifndef DLIB_HAsH_Hh_
#define DLIB_HAsH_Hh_
#include "hash_abstract.h"
#include <vector>
#include <string>
#include <map>
#include "murmur_hash3.h"
#include "../algs.h"
namespace dlib
{
// ----------------------------------------------------------------------------------------
inline uint32 hash (
const std::string& item,
uint32 seed = 0
)
{
if (item.size() == 0)
return 0;
else
return murmur_hash3(&item[0], sizeof(item[0])*item.size(), seed);
}
// ----------------------------------------------------------------------------------------
inline uint32 hash (
const std::wstring& item,
uint32 seed = 0
)
{
if (item.size() == 0)
return 0;
else
return murmur_hash3(&item[0], sizeof(item[0])*item.size(), seed);
}
// ----------------------------------------------------------------------------------------
template <typename T, typename alloc>
uint32 hash (
const std::vector<T,alloc>& item,
uint32 seed = 0
)
{
DLIB_ASSERT_HAS_STANDARD_LAYOUT(T);
if (item.size() == 0)
return 0;
else
return murmur_hash3(&item[0], sizeof(T)*item.size(), seed);
}
// ----------------------------------------------------------------------------------------
template <typename T, typename U, typename alloc>
uint32 hash (
const std::vector<std::pair<T,U>,alloc>& item,
uint32 seed = 0
)
{
DLIB_ASSERT_HAS_STANDARD_LAYOUT(T);
DLIB_ASSERT_HAS_STANDARD_LAYOUT(U);
if (item.size() == 0)
return 0;
else
return murmur_hash3(&item[0], sizeof(item[0])*item.size(), seed);
}
// ----------------------------------------------------------------------------------------
template <typename T, typename U, typename comp, typename alloc>
uint32 hash (
const std::map<T,U,comp,alloc>& item,
uint32 seed = 0
)
{
return hash(std::vector<std::pair<T,U> >(item.begin(), item.end()), seed);
}
// ----------------------------------------------------------------------------------------
inline uint32 hash (
uint32 val,
uint32 seed = 0
)
{
return murmur_hash3_2(val,seed);
}
// ----------------------------------------------------------------------------------------
inline uint32 hash (
uint64 val,
uint32 seed = 0
)
{
return static_cast<uint32>(murmur_hash3_128bit_3(val,seed,0).first);
}
// ----------------------------------------------------------------------------------------
inline uint32 hash (
const std::pair<uint64,uint64>& item,
uint32 seed = 0
)
{
return static_cast<uint32>(murmur_hash3_128bit_3(item.first,item.second,seed).first);
}
// ----------------------------------------------------------------------------------------
inline uint32 hash (
const std::pair<uint32,uint32>& item,
uint32 seed = 0
)
{
return murmur_hash3_3(item.first,item.second,seed);
}
// ----------------------------------------------------------------------------------------
template <typename T, typename U>
uint32 hash (
const std::pair<T,U>& item,
uint32 seed = 0
)
{
return hash(item.first, seed) ^ hash(item.second, seed+1);
}
// ----------------------------------------------------------------------------------------
}
#endif // DLIB_HAsH_Hh_
|
