mirror of https://github.com/tstack/lnav
You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
112 lines
3.1 KiB
C++
112 lines
3.1 KiB
C++
/**
|
|
* 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
|