react-native-windows 0.73.11 → 0.74.0-preview.2

package/Folly/TEMP_UntilFollyUpdate/hash/Hash.h

@@ -1,1016 +0,0 @@
-/*
- * Copyright (c) Meta Platforms, Inc. and affiliates.
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- *     http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
-
-/**
- * folly::hash provides hashing algorithms, as well as algorithms to combine
- * multiple hashes/hashable objects together.
- *
- * @refcode folly/docs/examples/folly/hash/Hash.cpp
- * @file hash/Hash.h
- */
-
-#pragma once
-
-#include <cstdint>
-#include <cstring>
-#include <limits>
-#include <memory>
-#include <string>
-#include <tuple>
-#include <type_traits>
-#include <utility>
-
-#include <folly/CPortability.h>
-#include <folly/Traits.h>
-#include <folly/Utility.h>
-#include <folly/functional/ApplyTuple.h>
-#include <folly/hash/SpookyHashV1.h>
-#include <folly/hash/SpookyHashV2.h>
-#include <folly/lang/Bits.h>
-
-#if FOLLY_HAS_STRING_VIEW
-#include <string_view>
-#endif
-
-namespace folly {
-namespace hash {
-
-namespace detail {
-
-namespace {
-
-template <typename T>
-constexpr bool is_hashable_byte_v = false;
-template <>
-constexpr bool is_hashable_byte_v<char> = true;
-template <>
-constexpr bool is_hashable_byte_v<signed char> = true;
-template <>
-constexpr bool is_hashable_byte_v<unsigned char> = true;
-
-} // namespace
-
-} // namespace detail
-
-/**
- * Reduce two 64-bit hashes into one.
- *
- * hash_128_to_64 uses the Hash128to64 function from Google's cityhash (under
- * the MIT License).
- */
-FOLLY_DISABLE_UNDEFINED_BEHAVIOR_SANITIZER("unsigned-integer-overflow")
-constexpr uint64_t hash_128_to_64(
-    const uint64_t upper, const uint64_t lower) noexcept {
-  // Murmur-inspired hashing.
-  const uint64_t kMul = 0x9ddfea08eb382d69ULL;
-  uint64_t a = (lower ^ upper) * kMul;
-  a ^= (a >> 47);
-  uint64_t b = (upper ^ a) * kMul;
-  b ^= (b >> 47);
-  b *= kMul;
-  return b;
-}
-
-/**
- * Order-independent reduction of two 64-bit hashes into one.
- *
- * Commutative accumulator taken from this paper:
- * https://www.preprints.org/manuscript/201710.0192/v1/download
- */
-FOLLY_DISABLE_UNDEFINED_BEHAVIOR_SANITIZER("unsigned-integer-overflow")
-constexpr uint64_t commutative_hash_128_to_64(
-    const uint64_t upper, const uint64_t lower) noexcept {
-  return 3860031 + (upper + lower) * 2779 + (upper * lower * 2);
-}
-
-/**
- * Thomas Wang 64 bit mix hash function.
- *
- * @methodset twang
- */
-FOLLY_DISABLE_UNDEFINED_BEHAVIOR_SANITIZER("unsigned-integer-overflow")
-constexpr uint64_t twang_mix64(uint64_t key) noexcept {
-  key = (~key) + (key << 21); // key *= (1 << 21) - 1; key -= 1;
-  key = key ^ (key >> 24);
-  key = key + (key << 3) + (key << 8); // key *= 1 + (1 << 3) + (1 << 8)
-  key = key ^ (key >> 14);
-  key = key + (key << 2) + (key << 4); // key *= 1 + (1 << 2) + (1 << 4)
-  key = key ^ (key >> 28);
-  key = key + (key << 31); // key *= 1 + (1 << 31)
-  return key;
-}
-
-/**
- * Inverse of twang_mix64.
- *
- * @methodset twang
- */
-constexpr uint64_t twang_unmix64(uint64_t key) noexcept {
-  // See the comments in jenkins_rev_unmix32 for an explanation as to how this
-  // was generated
-  key *= 4611686016279904257U;
-  key ^= (key >> 28) ^ (key >> 56);
-  key *= 14933078535860113213U;
-  key ^= (key >> 14) ^ (key >> 28) ^ (key >> 42) ^ (key >> 56);
-  key *= 15244667743933553977U;
-  key ^= (key >> 24) ^ (key >> 48);
-  key = (key + 1) * 9223367638806167551U;
-  return key;
-}
-
-/**
- * Thomas Wang downscaling hash function.
- *
- * @methodset twang
- */
-constexpr uint32_t twang_32from64(uint64_t key) noexcept {
-  key = (~key) + (key << 18);
-  key = key ^ (key >> 31);
-  key = key * 21;
-  key = key ^ (key >> 11);
-  key = key + (key << 6);
-  key = key ^ (key >> 22);
-  return static_cast<uint32_t>(key);
-}
-
-/**
- * Robert Jenkins' reversible 32 bit mix hash function.
- *
- * @methodset jenkins
- */
-constexpr uint32_t jenkins_rev_mix32(uint32_t key) noexcept {
-  key += (key << 12); // key *= (1 + (1 << 12))
-  key ^= (key >> 22);
-  key += (key << 4); // key *= (1 + (1 << 4))
-  key ^= (key >> 9);
-  key += (key << 10); // key *= (1 + (1 << 10))
-  key ^= (key >> 2);
-  // key *= (1 + (1 << 7)) * (1 + (1 << 12))
-  key += (key << 7);
-  key += (key << 12);
-  return key;
-}
-
-/**
- * Inverse of jenkins_rev_mix32.
- *
- * @methodset jenkins
- */
-constexpr uint32_t jenkins_rev_unmix32(uint32_t key) noexcept {
-  // These are the modular multiplicative inverses (in Z_2^32) of the
-  // multiplication factors in jenkins_rev_mix32, in reverse order.  They were
-  // computed using the Extended Euclidean algorithm, see
-  // http://en.wikipedia.org/wiki/Modular_multiplicative_inverse
-  key *= 2364026753U;
-
-  // The inverse of a ^= (a >> n) is
-  // b = a
-  // for (int i = n; i < 32; i += n) {
-  //   b ^= (a >> i);
-  // }
-  key ^= (key >> 2) ^ (key >> 4) ^ (key >> 6) ^ (key >> 8) ^ (key >> 10) ^
-      (key >> 12) ^ (key >> 14) ^ (key >> 16) ^ (key >> 18) ^ (key >> 20) ^
-      (key >> 22) ^ (key >> 24) ^ (key >> 26) ^ (key >> 28) ^ (key >> 30);
-  key *= 3222273025U;
-  key ^= (key >> 9) ^ (key >> 18) ^ (key >> 27);
-  key *= 4042322161U;
-  key ^= (key >> 22);
-  key *= 16773121U;
-  return key;
-}
-
-//  fnv
-//
-//  Fowler / Noll / Vo (FNV) Hash
-//    http://www.isthe.com/chongo/tech/comp/fnv/
-//
-//  Discouraged for poor performance in the smhasher suite.
-
-constexpr uint32_t fnv32_hash_start = 2166136261UL;
-constexpr uint64_t fnv64_hash_start = 14695981039346656037ULL;
-constexpr uint64_t fnva64_hash_start = 14695981039346656037ULL;
-
-/**
- * Append byte to FNV hash.
- *
- * @see fnv32
- * @methodset fnv
- */
-constexpr uint32_t fnv32_append_byte(uint32_t hash, uint8_t c) {
-  hash = hash //
-      + (hash << 1) //
-      + (hash << 4) //
-      + (hash << 7) //
-      + (hash << 8) //
-      + (hash << 24);
-  // forcing signed char, since other platforms can use unsigned
-  hash ^= static_cast<int8_t>(c);
-  return hash;
-}
-
-/**
- * FNV hash of a byte-range.
- *
- * @param hash  The initial hash seed.
- *
- * @see fnv32
- * @methodset fnv
- */
-template <typename C, std::enable_if_t<detail::is_hashable_byte_v<C>, int> = 0>
-constexpr uint32_t fnv32_buf(
-    const C* buf, size_t n, uint32_t hash = fnv32_hash_start) noexcept {
-  for (size_t i = 0; i < n; ++i) {
-    hash = fnv32_append_byte(hash, static_cast<uint8_t>(buf[i]));
-  }
-  return hash;
-}
-inline uint32_t fnv32_buf(
-    const void* buf, size_t n, uint32_t hash = fnv32_hash_start) noexcept {
-  return fnv32_buf(reinterpret_cast<const uint8_t*>(buf), n, hash);
-}
-
-/**
- * FNV hash of a c-str.
- *
- * Continues hashing until a null byte is reached.
- *
- * @param hash  The initial hash seed.
- *
- * @methodset fnv
- */
-constexpr uint32_t fnv32(
-    const char* buf, uint32_t hash = fnv32_hash_start) noexcept {
-  for (; *buf; ++buf) {
-    hash = fnv32_append_byte(hash, static_cast<uint8_t>(*buf));
-  }
-  return hash;
-}
-
-/**
- * @overloadbrief FNV hash of a string.
- *
- * FNV is the Fowler / Noll / Vo Hash:
- * http://www.isthe.com/chongo/tech/comp/fnv/
- *
- * Discouraged for poor performance in the smhasher suite.
- *
- * @param hash  The initial hash seed.
- *
- * @methodset fnv
- */
-inline uint32_t fnv32(
-    const std::string& str, uint32_t hash = fnv32_hash_start) noexcept {
-  return fnv32_buf(str.data(), str.size(), hash);
-}
-
-/**
- * Append a byte to FNV hash.
- *
- * @see fnv32
- * @methodset fnv
- */
-constexpr uint64_t fnv64_append_byte(uint64_t hash, uint8_t c) {
-  hash = hash //
-      + (hash << 1) //
-      + (hash << 4) //
-      + (hash << 5) //
-      + (hash << 7) //
-      + (hash << 8) //
-      + (hash << 40);
-  // forcing signed char, since other platforms can use unsigned
-  hash ^= static_cast<int8_t>(c);
-  return hash;
-}
-
-/**
- * FNV hash of a byte-range.
- *
- * @param hash  The initial hash seed.
- *
- * @see fnv32
- * @methodset fnv
- */
-template <typename C, std::enable_if_t<detail::is_hashable_byte_v<C>, int> = 0>
-constexpr uint64_t fnv64_buf(
-    const C* buf, size_t n, uint64_t hash = fnv64_hash_start) noexcept {
-  for (size_t i = 0; i < n; ++i) {
-    hash = fnv64_append_byte(hash, static_cast<uint8_t>(buf[i]));
-  }
-  return hash;
-}
-inline uint64_t fnv64_buf(
-    const void* buf, size_t n, uint64_t hash = fnv64_hash_start) noexcept {
-  return fnv64_buf(reinterpret_cast<const uint8_t*>(buf), n, hash);
-}
-
-/**
- * FNV hash of a c-str.
- *
- * Continues hashing until a null byte is reached.
- *
- * @param hash  The initial hash seed.
- *
- * @see fnv32
- * @methodset fnv
- */
-constexpr uint64_t fnv64(
-    const char* buf, uint64_t hash = fnv64_hash_start) noexcept {
-  for (; *buf; ++buf) {
-    hash = fnv64_append_byte(hash, static_cast<uint8_t>(*buf));
-  }
-  return hash;
-}
-
-/**
- * @overloadbrief FNV hash of a string.
- *
- * FNV is the Fowler / Noll / Vo Hash:
- * http://www.isthe.com/chongo/tech/comp/fnv/
- *
- * Discouraged for poor performance in the smhasher suite.
- *
- * @param hash  The initial hash seed.
- *
- * @see fnv32
- * @methodset fnv
- */
-inline uint64_t fnv64(
-    const std::string& str, uint64_t hash = fnv64_hash_start) noexcept {
-  return fnv64_buf(str.data(), str.size(), hash);
-}
-
-/**
- * Append a byte to FNVA hash.
- *
- * @see fnv32
- * @methodset fnv
- */
-constexpr uint64_t fnva64_append_byte(uint64_t hash, uint8_t c) {
-  hash ^= c;
-  hash = hash //
-      + (hash << 1) //
-      + (hash << 4) //
-      + (hash << 5) //
-      + (hash << 7) //
-      + (hash << 8) //
-      + (hash << 40);
-  return hash;
-}
-
-/**
- * FNVA hash of a byte-range.
- *
- * @param hash  The initial hash seed.
- *
- * @see fnv32
- * @methodset fnv
- */
-template <typename C, std::enable_if_t<detail::is_hashable_byte_v<C>, int> = 0>
-constexpr uint64_t fnva64_buf(
-    const C* buf, size_t n, uint64_t hash = fnva64_hash_start) noexcept {
-  for (size_t i = 0; i < n; ++i) {
-    hash = fnva64_append_byte(hash, static_cast<uint8_t>(buf[i]));
-  }
-  return hash;
-}
-inline uint64_t fnva64_buf(
-    const void* buf, size_t n, uint64_t hash = fnva64_hash_start) noexcept {
-  return fnva64_buf(reinterpret_cast<const uint8_t*>(buf), n, hash);
-}
-
-/**
- * FNVA hash of a string.
- *
- * @param hash  The initial hash seed.
- *
- * @see fnv32
- * @methodset fnv
- */
-inline uint64_t fnva64(
-    const std::string& str, uint64_t hash = fnva64_hash_start) noexcept {
-  return fnva64_buf(str.data(), str.size(), hash);
-}
-
-//  hsieh
-//
-//  Paul Hsieh: http://www.azillionmonkeys.com/qed/hash.html
-
-#define get16bits(d) folly::loadUnaligned<uint16_t>(d)
-
-/**
- * hsieh hash a byte-range.
- *
- * @see hsieh_hash32_str
- * @methodset hsieh
- */
-inline constexpr uint32_t hsieh_hash32_buf_constexpr(
-    const unsigned char* buf, size_t len) noexcept {
-  // forcing signed char, since other platforms can use unsigned
-  const unsigned char* s = buf;
-  uint32_t hash = static_cast<uint32_t>(len);
-  uint32_t tmp = 0;
-  size_t rem = 0;
-
-  if (len <= 0 || buf == nullptr) {
-    return 0;
-  }
-
-  rem = len & 3;
-  len >>= 2;
-
-  /* Main loop */
-  for (; len > 0; len--) {
-    hash += get16bits(s);
-    tmp = (get16bits(s + 2) << 11) ^ hash;
-    hash = (hash << 16) ^ tmp;
-    s += 2 * sizeof(uint16_t);
-    hash += hash >> 11;
-  }
-
-  /* Handle end cases */
-  switch (rem) {
-    case 3:
-      hash += get16bits(s);
-      hash ^= hash << 16;
-      hash ^= s[sizeof(uint16_t)] << 18;
-      hash += hash >> 11;
-      break;
-    case 2:
-      hash += get16bits(s);
-      hash ^= hash << 11;
-      hash += hash >> 17;
-      break;
-    case 1:
-      hash += *s;
-      hash ^= hash << 10;
-      hash += hash >> 1;
-  }
-
-  /* Force "avalanching" of final 127 bits */
-  hash ^= hash << 3;
-  hash += hash >> 5;
-  hash ^= hash << 4;
-  hash += hash >> 17;
-  hash ^= hash << 25;
-  hash += hash >> 6;
-
-  return hash;
-}
-
-#undef get16bits
-
-/**
- * hsieh hash a void* byte-range.
- *
- * @see hsieh_hash32_str
- * @methodset hsieh
- */
-inline uint32_t hsieh_hash32_buf(const void* buf, size_t len) noexcept {
-  return hsieh_hash32_buf_constexpr(
-      reinterpret_cast<const unsigned char*>(buf), len);
-}
-
-/**
- * hsieh hash a c-str.
- *
- * Computes the strlen of the input, then byte-range hashes it.
- *
- * @see hsieh_hash32_str
- * @methodset hsieh
- */
-inline uint32_t hsieh_hash32(const char* s) noexcept {
-  return hsieh_hash32_buf(s, std::strlen(s));
-}
-
-/**
- * hsieh hash a string.
- *
- * Paul Hsieh: http://www.azillionmonkeys.com/qed/hash.html
- *
- * @methodset hsieh
- */
-inline uint32_t hsieh_hash32_str(const std::string& str) noexcept {
-  return hsieh_hash32_buf(str.data(), str.size());
-}
-
-} // namespace hash
-
-namespace detail {
-
-template <typename Int>
-struct integral_hasher {
-  using folly_is_avalanching =
-      bool_constant<(sizeof(Int) >= 8 || sizeof(size_t) == 4)>;
-
-  constexpr size_t operator()(Int const& i) const noexcept {
-    static_assert(sizeof(Int) <= 16, "Input type is too wide");
-    /* constexpr */ if (sizeof(Int) <= 4) {
-      auto const i32 = static_cast<int32_t>(i); // impl accident: sign-extends
-      auto const u32 = static_cast<uint32_t>(i32);
-      return static_cast<size_t>(hash::jenkins_rev_mix32(u32));
-    } else if (sizeof(Int) <= 8) {
-      auto const u64 = static_cast<uint64_t>(i);
-      return static_cast<size_t>(hash::twang_mix64(u64));
-    } else {
-      auto const u = to_unsigned(i);
-      auto const hi = static_cast<uint64_t>(u >> sizeof(Int) * 4);
-      auto const lo = static_cast<uint64_t>(u);
-      // [Win] Added static_cast
-      return static_cast<size_t>(hash::hash_128_to_64(hi, lo));
-    }
-  }
-};
-
-template <typename F>
-struct float_hasher {
-  using folly_is_avalanching = std::true_type;
-
-  size_t operator()(F const& f) const noexcept {
-    static_assert(sizeof(F) <= 8, "Input type is too wide");
-
-    if (f == F{}) { // Ensure 0 and -0 get the same hash.
-      return 0;
-    }
-
-    uint64_t u64 = 0;
-    memcpy(&u64, &f, sizeof(F));
-    return static_cast<size_t>(hash::twang_mix64(u64));
-  }
-};
-
-} // namespace detail
-
-template <class Key, class Enable = void>
-struct hasher;
-
-struct Hash {
-  template <class T>
-  constexpr size_t operator()(const T& v) const
-      noexcept(noexcept(hasher<T>()(v))) {
-    return hasher<T>()(v);
-  }
-
-  template <class T, class... Ts>
-  constexpr size_t operator()(const T& t, const Ts&... ts) const {
-    return hash::hash_128_to_64((*this)(t), (*this)(ts...));
-  }
-
-  constexpr size_t operator()() const noexcept { return 0; }
-};
-
-// IsAvalanchingHasher<H, K> extends std::integral_constant<bool, V>.
-// V will be true if it is known that when a hasher of type H computes
-// the hash of a key of type K, any subset of B bits from the resulting
-// hash value is usable in a context that can tolerate a collision rate
-// of about 1/2^B.  (Input bits lost implicitly converting between K and
-// the argument of H::operator() are not considered here; K is separate
-// to handle the case of generic hashers like folly::Hash).
-//
-// If std::hash<T> or folly::hasher<T> is specialized for a new type T and
-// the implementation avalanches input entropy across all of the bits of a
-// std::size_t result, the specialization should be marked as avalanching.
-// This can be done either by adding a member type folly_is_avalanching
-// to the functor H that contains a constexpr bool value of true, or by
-// specializing IsAvalanchingHasher<H, K>.  The member type mechanism is
-// more convenient, but specializing IsAvalanchingHasher may be required
-// if a hasher is polymorphic on the key type or if its definition cannot
-// be modified.
-//
-// The standard's definition of hash quality is based on the chance hash
-// collisions using the entire hash value.  No requirement is made that
-// this property holds for subsets of the bits.  In addition, hashed keys
-// in real-world workloads are not chosen uniformly from the entire domain
-// of keys, which can further increase the collision rate for a subset
-// of bits.  For example, std::hash<uint64_t> in libstdc++-v3 and libc++
-// is the identity function.  This hash function has no collisions when
-// considering hash values in their entirety, but for real-world workloads
-// the high bits are likely to always be zero.
-//
-// Some hash functions provide a stronger guarantee -- the standard's
-// collision property is also preserved for subsets of the output bits and
-// for sub-domains of keys.  Another way to say this is that each bit of
-// the hash value contains entropy from the entire input, changes to the
-// input avalanche across all of the bits of the output.  The distinction
-// is useful when mapping the hash value onto a smaller space efficiently
-// (such as when implementing a hash table).
-template <typename Hasher, typename Key>
-struct IsAvalanchingHasher;
-
-namespace detail {
-template <typename Hasher, typename Void = void>
-struct IsAvalanchingHasherFromMemberType : std::false_type {};
-
-template <typename Hasher>
-struct IsAvalanchingHasherFromMemberType<
-    Hasher,
-    void_t<typename Hasher::folly_is_avalanching>>
-    : bool_constant<Hasher::folly_is_avalanching::value> {};
-} // namespace detail
-
-template <typename Hasher, typename Key>
-struct IsAvalanchingHasher : detail::IsAvalanchingHasherFromMemberType<Hasher> {
-};
-
-// It's ugly to put this here, but folly::transparent isn't hash specific
-// so it seems even more ugly to put this near its declaration
-template <typename H, typename K>
-struct IsAvalanchingHasher<transparent<H>, K> : IsAvalanchingHasher<H, K> {};
-
-template <typename K>
-struct IsAvalanchingHasher<Hash, K> : IsAvalanchingHasher<hasher<K>, K> {};
-
-template <>
-struct hasher<bool> {
-  using folly_is_avalanching = std::true_type;
-
-  constexpr size_t operator()(bool key) const noexcept {
-    // Make sure that all the output bits depend on the input.
-    return key ? std::numeric_limits<size_t>::max() : 0;
-  }
-};
-template <typename K>
-struct IsAvalanchingHasher<hasher<bool>, K> : std::true_type {};
-
-template <>
-struct hasher<unsigned long long>
-    : detail::integral_hasher<unsigned long long> {};
-
-template <>
-struct hasher<signed long long> : detail::integral_hasher<signed long long> {};
-
-template <>
-struct hasher<unsigned long> : detail::integral_hasher<unsigned long> {};
-
-template <>
-struct hasher<signed long> : detail::integral_hasher<signed long> {};
-
-template <>
-struct hasher<unsigned int> : detail::integral_hasher<unsigned int> {};
-
-template <>
-struct hasher<signed int> : detail::integral_hasher<signed int> {};
-
-template <>
-struct hasher<unsigned short> : detail::integral_hasher<unsigned short> {};
-
-template <>
-struct hasher<signed short> : detail::integral_hasher<signed short> {};
-
-template <>
-struct hasher<unsigned char> : detail::integral_hasher<unsigned char> {};
-
-template <>
-struct hasher<signed char> : detail::integral_hasher<signed char> {};
-
-template <> // char is a different type from both signed char and unsigned char
-struct hasher<char> : detail::integral_hasher<char> {};
-
-#if FOLLY_HAVE_INT128_T
-template <>
-struct hasher<signed __int128> : detail::integral_hasher<signed __int128> {};
-
-template <>
-struct hasher<unsigned __int128> : detail::integral_hasher<unsigned __int128> {
-};
-#endif
-
-template <>
-struct hasher<float> : detail::float_hasher<float> {};
-
-template <>
-struct hasher<double> : detail::float_hasher<double> {};
-
-template <>
-struct hasher<std::string> {
-  using folly_is_avalanching = std::true_type;
-
-  size_t operator()(const std::string& key) const {
-    return static_cast<size_t>(
-        hash::SpookyHashV2::Hash64(key.data(), key.size(), 0));
-  }
-};
-template <typename K>
-struct IsAvalanchingHasher<hasher<std::string>, K> : std::true_type {};
-
-#if FOLLY_HAS_STRING_VIEW
-template <>
-struct hasher<std::string_view> {
-  using folly_is_avalanching = std::true_type;
-
-  size_t operator()(const std::string_view& key) const {
-    return static_cast<size_t>(
-        hash::SpookyHashV2::Hash64(key.data(), key.size(), 0));
-  }
-};
-template <typename K>
-struct IsAvalanchingHasher<hasher<std::string_view>, K> : std::true_type {};
-#endif
-
-template <typename T>
-struct hasher<T, std::enable_if_t<std::is_enum<T>::value>> {
-  size_t operator()(T key) const noexcept { return Hash()(to_underlying(key)); }
-};
-
-template <typename T, typename K>
-struct IsAvalanchingHasher<
-    hasher<T, std::enable_if_t<std::is_enum<T>::value>>,
-    K> : IsAvalanchingHasher<hasher<std::underlying_type_t<T>>, K> {};
-
-template <typename T1, typename T2>
-struct hasher<std::pair<T1, T2>> {
-  using folly_is_avalanching = std::true_type;
-
-  size_t operator()(const std::pair<T1, T2>& key) const {
-    return Hash()(key.first, key.second);
-  }
-};
-
-template <typename... Ts>
-struct hasher<std::tuple<Ts...>> {
-  size_t operator()(const std::tuple<Ts...>& key) const {
-    return apply(Hash(), key);
-  }
-};
-
-template <typename T>
-struct hasher<T*> {
-  using folly_is_avalanching = hasher<std::uintptr_t>::folly_is_avalanching;
-
-  size_t operator()(T* key) const {
-    return Hash()(bit_cast<std::uintptr_t>(key));
-  }
-};
-
-template <typename T>
-struct hasher<std::unique_ptr<T>> {
-  using folly_is_avalanching = typename hasher<T*>::folly_is_avalanching;
-
-  size_t operator()(const std::unique_ptr<T>& key) const {
-    return Hash()(key.get());
-  }
-};
-
-template <typename T>
-struct hasher<std::shared_ptr<T>> {
-  using folly_is_avalanching = typename hasher<T*>::folly_is_avalanching;
-
-  size_t operator()(const std::shared_ptr<T>& key) const {
-    return Hash()(key.get());
-  }
-};
-
-// combiner for multi-arg tuple also mixes bits
-template <typename T, typename K>
-struct IsAvalanchingHasher<hasher<std::tuple<T>>, K>
-    : IsAvalanchingHasher<hasher<T>, K> {};
-template <typename T1, typename T2, typename... Ts, typename K>
-struct IsAvalanchingHasher<hasher<std::tuple<T1, T2, Ts...>>, K>
-    : std::true_type {};
-
-namespace hash {
-// Simply uses std::hash to hash.  Note that std::hash is not guaranteed
-// to be a very good hash function; provided std::hash doesn't collide on
-// the individual inputs, you are fine, but that won't be true for, say,
-// strings or pairs
-class StdHasher {
- public:
-  // The standard requires all explicit and partial specializations of std::hash
-  // supplied by either the standard library or by users to be default
-  // constructible.
-  template <typename T>
-  size_t operator()(const T& t) const noexcept(noexcept(std::hash<T>()(t))) {
-    return std::hash<T>()(t);
-  }
-};
-
-// This is a general-purpose way to create a single hash from multiple
-// hashable objects. hash_combine_generic takes a class Hasher implementing
-// hash<T>; hash_combine uses a default hasher StdHasher that uses std::hash.
-// hash_combine_generic hashes each argument and combines those hashes in
-// an order-dependent way to yield a new hash; hash_range does so (also in an
-// order-dependent way) for items in the range [first, last);
-// commutative_hash_combine_* hashes values but combines them in an
-// order-independent way to yield a new hash.
-
-/**
- * Hash a value, and combine it with a seed. Commutative.
- *
- * @param hasher  The function/callable which will hash the value.
- *
- * @methodset ranges
- */
-template <class Hash, class Value>
-uint64_t commutative_hash_combine_value_generic(
-    uint64_t seed, Hash const& hasher, Value const& value) {
-  auto const x = hasher(value);
-  auto const y = IsAvalanchingHasher<Hash, Value>::value ? x : twang_mix64(x);
-  return commutative_hash_128_to_64(seed, y);
-}
-
-/**
- * Combine hashes of items in the range [first, last), order-dependently.
- *
- * For order-independent hashing, such as for hashing an unordered container
- * (e.g. folly::dynamic::object) use commutative_hash_combine_range instead.
- *
- * @param hash  The base-case hash to use.
- * @param hasher  The function/callable which will hash the value.
- *
- * @methodset ranges
- */
-template <
-    class Iter,
-    class Hash = std::hash<typename std::iterator_traits<Iter>::value_type>>
-uint64_t hash_range(
-    Iter begin, Iter end, uint64_t hash = 0, Hash hasher = Hash()) {
-  for (; begin != end; ++begin) {
-    hash = hash_128_to_64(hash, hasher(*begin));
-  }
-  return hash;
-}
-
-/**
- * Create a hash from multiple hashable objects, order-independently.
- *
- * For order-dependent hashing use hash_range.
- *
- * @param seed  The base-case hash to use.
- * @param hasher  The function/callable which will hash the value.
- *
- * @methodset ranges
- */
-template <class Hash, class Iter>
-uint64_t commutative_hash_combine_range_generic(
-    uint64_t seed, Hash const& hasher, Iter first, Iter last) {
-  while (first != last) {
-    seed = commutative_hash_combine_value_generic(seed, hasher, *first++);
-  }
-  return seed;
-}
-
-/**
- * Create a hash from multiple hashable objects, order-independently.
- *
- * @methodset ranges
- */
-template <class Iter>
-uint64_t commutative_hash_combine_range(Iter first, Iter last) {
-  return commutative_hash_combine_range_generic(0, Hash{}, first, last);
-}
-
-namespace detail {
-using c_array_size_t = size_t[];
-} // namespace detail
-
-// Never used, but gcc demands it.
-template <class Hasher>
-inline size_t hash_combine_generic(const Hasher&) noexcept {
-  return 0;
-}
-
-/**
- * Combine hashes of multiple items, order-dependently.
- *
- * @param h  The function/callable which will hash the value.
- *
- * @methodset ranges
- */
-template <class Hasher, typename T, typename... Ts>
-size_t hash_combine_generic(
-    const Hasher& h,
-    const T& t,
-    const Ts&... ts) noexcept(noexcept(detail::c_array_size_t{
-    h(t), h(ts)...})) {
-  size_t seed = h(t);
-  if (sizeof...(ts) == 0) {
-    return seed;
-  }
-  size_t remainder = hash_combine_generic(h, ts...);
-  if /* constexpr */ (sizeof(size_t) == sizeof(uint32_t)) {
-    return twang_32from64((uint64_t(seed) << 32) | remainder);
-  } else {
-    return static_cast<size_t>(hash_128_to_64(seed, remainder));
-  }
-}
-
-/**
- * Combine hashes of multiple items, order-independently.
- *
- * @param hasher  The function/callable which will hash the value.
- *
- * @methodset ranges
- */
-template <typename Hash, typename... Value>
-uint64_t commutative_hash_combine_generic(
-    uint64_t seed, Hash const& hasher, Value const&... value) {
-  // variadic foreach:
-  uint64_t _[] = {
-      0, seed = commutative_hash_combine_value_generic(seed, hasher, value)...};
-  (void)_;
-  return seed;
-}
-
-/**
- * Combine hashes of multiple items, order-dependently.
- *
- * @methodset ranges
- */
-template <typename T, typename... Ts>
-FOLLY_NODISCARD size_t hash_combine(const T& t, const Ts&... ts) noexcept(
-    noexcept(hash_combine_generic(StdHasher{}, t, ts...))) {
-  return hash_combine_generic(StdHasher{}, t, ts...);
-}
-
-/**
- * Combine hashes of multiple items, order-independently.
- *
- */
-template <typename... Value>
-uint64_t commutative_hash_combine(Value const&... value) {
-  return commutative_hash_combine_generic(0, Hash{}, value...);
-}
-} // namespace hash
-
-// recursion
-template <size_t index, typename... Ts>
-struct TupleHasher {
-  size_t operator()(std::tuple<Ts...> const& key) const {
-    return hash::hash_combine(
-        TupleHasher<index - 1, Ts...>()(key), std::get<index>(key));
-  }
-};
-
-// base
-template <typename... Ts>
-struct TupleHasher<0, Ts...> {
-  size_t operator()(std::tuple<Ts...> const& key) const {
-    // we could do std::hash here directly, but hash_combine hides all the
-    // ugly templating implicitly
-    return hash::hash_combine(std::get<0>(key));
-  }
-};
-
-} // namespace folly
-
-// Custom hash functions.
-namespace std {
-// Hash function for pairs. Requires default hash functions for both
-// items in the pair.
-template <typename T1, typename T2>
-struct hash<std::pair<T1, T2>> {
-  using folly_is_avalanching = std::true_type;
-
-  size_t operator()(const std::pair<T1, T2>& x) const {
-    return folly::hash::hash_combine(x.first, x.second);
-  }
-};
-
-// Hash function for tuples. Requires default hash functions for all types.
-template <typename... Ts>
-struct hash<std::tuple<Ts...>> {
- private:
-  using FirstT = std::decay_t<std::tuple_element_t<0, std::tuple<Ts..., bool>>>;
-
- public:
-  using folly_is_avalanching = folly::bool_constant<(
-      sizeof...(Ts) != 1 ||
-      folly::IsAvalanchingHasher<std::hash<FirstT>, FirstT>::value)>;
-
-  size_t operator()(std::tuple<Ts...> const& key) const {
-    folly::TupleHasher<
-        sizeof...(Ts) - 1, // start index
-        Ts...>
-        hasher;
-
-    return hasher(key);
-  }
-};
-} // namespace std
-
-namespace folly {
-
-// std::hash<std::string> is avalanching on libstdc++-v3 (code checked),
-// libc++ (code checked), and MSVC (based on online information).
-// std::hash for float and double on libstdc++-v3 are avalanching,
-// but they are not on libc++.  std::hash for integral types is not
-// avalanching for libstdc++-v3 or libc++.  We're conservative here and
-// just mark std::string as avalanching.  std::string_view will also be
-// so, once it exists.
-template <typename... Args, typename K>
-struct IsAvalanchingHasher<std::hash<std::basic_string<Args...>>, K>
-    : std::true_type {};
-
-} // namespace folly