// Copyright 2021 The Dawn & Tint Authors // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are met: // // 1. Redistributions of source code must retain the above copyright notice, this // list of conditions and the following disclaimer. // // 2. 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. // // 3. Neither the name of the copyright holder 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 COPYRIGHT HOLDERS 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 COPYRIGHT HOLDER 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 SRC_TINT_UTILS_MATH_HASH_H_ #define SRC_TINT_UTILS_MATH_HASH_H_ #include <stdint.h> #include <cstdio> #include <functional> #include <string> #include <tuple> #include <utility> #include <variant> #include <vector> #include "src/tint/utils/math/crc32.h" namespace tint { namespace detail { template <typename T, typename = void> struct HasHashCodeMember : std::false_type { … }; HasHashCodeMember<T, std::enable_if_t<std::is_member_function_pointer_v<decltype(&T::HashCode)>>>; } // namespace detail /// The type of a hash code HashCode; /// Forward declarations (see below) template <typename... ARGS> HashCode Hash(const ARGS&... values); template <typename... ARGS> HashCode HashCombine(HashCode hash, const ARGS&... values); /// A STL-compatible hasher that does a more thorough job than most implementations of std::hash. /// Hasher has been optimized for a better quality hash at the expense of increased computation /// costs. /// Hasher is specialized for various core Tint data types. The default implementation will use a /// `HashCode HashCode()` method on the `T` type, and will fallback to `std::hash<T>` if /// `T::HashCode` is missing. template <typename T> struct Hasher { … }; /// Hasher specialization for pointers Hasher<T *>; /// Hasher specialization for std::vector Hasher<std::vector<T>>; /// Hasher specialization for std::tuple Hasher<std::tuple<TYPES...>>; /// Hasher specialization for std::pair Hasher<std::pair<A, B>>; /// Hasher specialization for std::variant Hasher<std::variant<TYPES...>>; /// Hasher specialization for std::string, which also supports hashing of const char* and /// std::string_view without first constructing a std::string. template <> struct Hasher<std::string> { … }; /// @param args the arguments to hash /// @returns a hash of the variadic list of arguments. /// The returned hash is dependent on the order of the arguments. template <typename... ARGS> HashCode Hash(const ARGS&... args) { … } /// @param hash the hash value to combine with /// @param values the values to hash /// @returns a hash of the variadic list of arguments. /// The returned hash is dependent on the order of the arguments. template <typename... ARGS> HashCode HashCombine(HashCode hash, const ARGS&... values) { … } /// A STL-compatible equal_to implementation that specializes for types. template <typename T> struct EqualTo { … }; /// A specialization for EqualTo for std::string, which supports additional comparision with /// std::string_view and const char*. template <> struct EqualTo<std::string> { … }; /// Wrapper for a hashable type enabling the wrapped value to be used as a key /// for an unordered_map or unordered_set. template <typename T> struct UnorderedKeyWrapper { … }; } // namespace tint namespace std { /// Custom std::hash specialization for tint::UnorderedKeyWrapper hash<tint::UnorderedKeyWrapper<T>>; } // namespace std #endif // SRC_TINT_UTILS_MATH_HASH_H_