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
|
/**
* Copyright (c) 2023, Timothy Stack
*
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* * Redistributions of source code must retain the above copyright notice, this
* list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
* * Neither the name of Timothy Stack nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ''AS IS'' AND ANY
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE FOR ANY
* DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#ifndef lnav_hasher_hh
#define lnav_hasher_hh
#include <stdint.h>
#include "base/auto_mem.hh"
#include "base/intern_string.hh"
#include "byte_array.hh"
#include "spookyhash/SpookyV2.h"
class hasher {
public:
using array_t = byte_array<2, uint64_t>;
static constexpr size_t STRING_SIZE = array_t::STRING_SIZE;
hasher() { this->h_context.Init(0, 0); }
hasher& update(const std::string& str)
{
this->h_context.Update(str.data(), str.length());
return *this;
}
hasher& update(const string_fragment& str)
{
this->h_context.Update(str.data(), str.length());
return *this;
}
hasher& update(const char* bits, size_t len)
{
this->h_context.Update(bits, len);
return *this;
}
hasher& update(int64_t value)
{
value = SPOOKYHASH_LITTLE_ENDIAN_64(value);
this->h_context.Update(&value, sizeof(value));
return *this;
}
array_t to_array()
{
uint64_t h1;
uint64_t h2;
array_t retval;
this->h_context.Final(&h1, &h2);
*retval.out(0) = SPOOKYHASH_LITTLE_ENDIAN_64(h1);
*retval.out(1) = SPOOKYHASH_LITTLE_ENDIAN_64(h2);
return retval;
}
void to_string(auto_buffer& buf)
{
array_t bits = this->to_array();
bits.to_string(std::back_inserter(buf));
}
std::string to_string()
{
array_t bits = this->to_array();
return bits.to_string();
}
std::string to_uuid_string()
{
array_t bits = this->to_array();
return bits.to_uuid_string();
}
private:
SpookyHash h_context;
};
#endif
|
