X-Git-Url: http://plrg.eecs.uci.edu/git/?a=blobdiff_plain;ds=sidebyside;f=folly%2FHash.h;h=0f0afc5baf71ac4c4ca301becf5f84e98fca6da5;hb=0fa941367b87fe3e127a5de3ad85535bef321397;hp=f40f4ec27d620512239a7d85fa6f7cac83600863;hpb=879db739d6bb0cd6a7035d4606c34c877077c88e;p=folly.git diff --git a/folly/Hash.h b/folly/Hash.h index f40f4ec2..0f0afc5b 100644 --- a/folly/Hash.h +++ b/folly/Hash.h @@ -1,5 +1,5 @@ /* - * Copyright 2015 Facebook, Inc. + * Copyright 2017 Facebook, Inc. * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. @@ -14,16 +14,17 @@ * limitations under the License. */ -#ifndef FOLLY_BASE_HASH_H_ -#define FOLLY_BASE_HASH_H_ +#pragma once +#include #include -#include #include -#include #include +#include +#include #include +#include #include #include @@ -73,6 +74,8 @@ uint64_t hash_range(Iter begin, return hash; } +inline uint32_t twang_32from64(uint64_t key); + template size_t hash_combine_generic(const T& t, const Ts&... ts) { size_t seed = Hasher::hash(t); @@ -80,7 +83,11 @@ size_t hash_combine_generic(const T& t, const Ts&... ts) { return seed; } size_t remainder = hash_combine_generic(ts...); - return hash_128_to_64(seed, remainder); + /* static */ if (sizeof(size_t) == sizeof(uint32_t)) { + return twang_32from64((uint64_t(seed) << 32) | remainder); + } else { + return static_cast(hash_128_to_64(seed, remainder)); + } } // Simply uses std::hash to hash. Note that std::hash is not guaranteed @@ -220,7 +227,8 @@ inline uint32_t fnv32(const char* s, inline uint32_t fnv32_buf(const void* buf, size_t n, uint32_t hash = FNV_32_HASH_START) { - const char* char_buf = reinterpret_cast(buf); + // forcing signed char, since other platforms can use unsigned + const signed char* char_buf = reinterpret_cast(buf); for (size_t i = 0; i < n; ++i) { hash += (hash << 1) + (hash << 4) + (hash << 7) + @@ -249,7 +257,8 @@ inline uint64_t fnv64(const char* s, inline uint64_t fnv64_buf(const void* buf, size_t n, uint64_t hash = FNV_64_HASH_START) { - const char* char_buf = reinterpret_cast(buf); + // forcing signed char, since other platforms can use unsigned + const signed char* char_buf = reinterpret_cast(buf); for (size_t i = 0; i < n; ++i) { hash += (hash << 1) + (hash << 4) + (hash << 5) + (hash << 7) + @@ -268,10 +277,11 @@ inline uint64_t fnv64(const std::string& str, * Paul Hsieh: http://www.azillionmonkeys.com/qed/hash.html */ -#define get16bits(d) (*((const uint16_t*) (d))) +#define get16bits(d) folly::loadUnaligned(d) inline uint32_t hsieh_hash32_buf(const void* buf, size_t len) { - const char* s = reinterpret_cast(buf); + // forcing signed char, since other platforms can use unsigned + const unsigned char* s = reinterpret_cast(buf); uint32_t hash = static_cast(len); uint32_t tmp; size_t rem; @@ -351,6 +361,14 @@ struct Hash { } }; +template <> +struct hasher { + size_t operator()(bool key) const { + // Make sure that all the output bits depend on the input. + return -static_cast(key); + } +}; + template<> struct hasher { size_t operator()(int32_t key) const { return hash::jenkins_rev_mix32(uint32_t(key)); @@ -365,13 +383,20 @@ template<> struct hasher { template<> struct hasher { size_t operator()(int64_t key) const { - return hash::twang_mix64(uint64_t(key)); + return static_cast(hash::twang_mix64(uint64_t(key))); } }; template<> struct hasher { size_t operator()(uint64_t key) const { - return hash::twang_mix64(key); + return static_cast(hash::twang_mix64(key)); + } +}; + +template<> struct hasher { + size_t operator()(const std::string& key) const { + return static_cast( + hash::SpookyHashV2::Hash64(key.data(), key.size(), 0)); } }; @@ -442,5 +467,3 @@ namespace std { } }; } // namespace std - -#endif