libcruft-util/hash/fasthash.cpp

55 lines
1.4 KiB
C++
Raw Normal View History

2015-05-28 12:17:25 +10:00
/*
2018-08-04 15:14:06 +10:00
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
2015-05-28 12:17:25 +10:00
*
* Copyright 2015 Danny Robson <danny@nerdcruft.net>
*/
#include "fasthash.hpp"
2018-05-03 18:32:08 +10:00
#include "../endian.hpp"
#include "../debug.hpp"
using cruft::hash::fasthash;
2015-05-28 12:17:25 +10:00
///////////////////////////////////////////////////////////////////////////////
template <>
2015-05-28 12:17:25 +10:00
uint64_t
fasthash<uint64_t>::operator() (uint64_t seed, const cruft::view<const uint8_t*> data) const
2015-05-28 12:17:25 +10:00
{
static const uint64_t m = 0x880355f21e6d1965;
uint64_t result = seed ^ (data.size () * m);
2015-05-28 12:17:25 +10:00
2018-05-03 18:32:08 +10:00
auto cursor = data.begin ();
for (auto last = data.end () - data.size () % 8; cursor < last; cursor += 8) {
result ^= mix (readle<uint64_t> (cursor));
2015-05-28 12:17:25 +10:00
result *= m;
}
2018-05-03 18:32:08 +10:00
size_t remain = data.size () % 8;
2015-05-28 12:17:25 +10:00
if (remain) {
uint64_t accum = 0;
for (size_t i = 0; i < remain; ++i)
2018-05-03 18:32:08 +10:00
accum ^= uint64_t {cursor[i]} << i * 8;
2015-05-28 12:17:25 +10:00
result ^= mix (accum);
result *= m;
}
return mix (result);
}
//-----------------------------------------------------------------------------
template <>
2015-05-28 12:17:25 +10:00
uint32_t
fasthash<uint32_t>::operator() (uint64_t seed, const cruft::view<const uint8_t*> data) const
2015-05-28 12:17:25 +10:00
{
auto h = fasthash<uint64_t> {} (seed, data);
return (h & 0xffffffff) - (h >> 32);
2015-05-28 12:17:25 +10:00
}