blob: 145b40a2c2d61b500716e18b3a54b053d67484a9 (
plain)
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
|
#include "kbest_repository.h"
#include <boost/functional/hash.hpp>
using namespace std;
struct ApproxVectorHasher {
static const size_t MASK = 0xFFFFFFFFull;
union UType {
double f; // leave as double
size_t i;
};
static inline double round(const double x) {
UType t;
t.f = x;
size_t r = t.i & MASK;
if ((r << 1) > MASK)
t.i += MASK - r + 1;
else
t.i &= (1ull - MASK);
return t.f;
}
size_t operator()(const SparseVector<double>& x) const {
size_t h = 0x573915839;
for (SparseVector<double>::const_iterator it = x.begin(); it != x.end(); ++it) {
UType t;
t.f = it->second;
if (t.f) {
size_t z = (t.i >> 32);
boost::hash_combine(h, it->first);
boost::hash_combine(h, z);
}
}
return h;
}
};
|