/**************************************************************************/ /* hashfuncs.h */ /**************************************************************************/ /* This file is part of: */ /* GODOT ENGINE */ /* https://godotengine.org */ /**************************************************************************/ /* Copyright (c) 2014-present Godot Engine contributors (see AUTHORS.md). */ /* Copyright (c) 2007-2014 Juan Linietsky, Ariel Manzur. */ /* */ /* Permission is hereby granted, free of charge, to any person obtaining */ /* a copy of this software and associated documentation files (the */ /* "Software"), to deal in the Software without restriction, including */ /* without limitation the rights to use, copy, modify, merge, publish, */ /* distribute, sublicense, and/or sell copies of the Software, and to */ /* permit persons to whom the Software is furnished to do so, subject to */ /* the following conditions: */ /* */ /* The above copyright notice and this permission notice shall be */ /* included in all copies or substantial portions of the Software. */ /* */ /* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, */ /* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF */ /* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. */ /* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY */ /* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, */ /* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE */ /* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. */ /**************************************************************************/ #ifndef HASHFUNCS_H #define HASHFUNCS_H #include "core/math/aabb.h" #include "core/math/math_defs.h" #include "core/math/math_funcs.h" #include "core/math/rect2.h" #include "core/math/rect2i.h" #include "core/math/vector2.h" #include "core/math/vector2i.h" #include "core/math/vector3.h" #include "core/math/vector3i.h" #include "core/math/vector4.h" #include "core/math/vector4i.h" #include "core/object/object_id.h" #include "core/string/node_path.h" #include "core/string/string_name.h" #include "core/string/ustring.h" #include "core/templates/rid.h" #include "core/typedefs.h" /** * Hashing functions */ /** * DJB2 Hash function * @param C String * @return 32-bits hashcode */ static _FORCE_INLINE_ uint32_t hash_djb2(const char *p_cstr) { … } static _FORCE_INLINE_ uint32_t hash_djb2_buffer(const uint8_t *p_buff, int p_len, uint32_t p_prev = 5381) { … } static _FORCE_INLINE_ uint32_t hash_djb2_one_32(uint32_t p_in, uint32_t p_prev = 5381) { … } /** * Thomas Wang's 64-bit to 32-bit Hash function: * https://web.archive.org/web/20071223173210/https:/www.concentric.net/~Ttwang/tech/inthash.htm * * @param p_int - 64-bit unsigned integer key to be hashed * @return unsigned 32-bit value representing hashcode */ static _FORCE_INLINE_ uint32_t hash_one_uint64(const uint64_t p_int) { … } #define HASH_MURMUR3_SEED … // Murmurhash3 32-bit version. // All MurmurHash versions are public domain software, and the author disclaims all copyright to their code. static _FORCE_INLINE_ uint32_t hash_murmur3_one_32(uint32_t p_in, uint32_t p_seed = HASH_MURMUR3_SEED) { … } static _FORCE_INLINE_ uint32_t hash_murmur3_one_float(float p_in, uint32_t p_seed = HASH_MURMUR3_SEED) { … } static _FORCE_INLINE_ uint32_t hash_murmur3_one_64(uint64_t p_in, uint32_t p_seed = HASH_MURMUR3_SEED) { … } static _FORCE_INLINE_ uint32_t hash_murmur3_one_double(double p_in, uint32_t p_seed = HASH_MURMUR3_SEED) { … } static _FORCE_INLINE_ uint32_t hash_murmur3_one_real(real_t p_in, uint32_t p_seed = HASH_MURMUR3_SEED) { … } static _FORCE_INLINE_ uint32_t hash_rotl32(uint32_t x, int8_t r) { … } static _FORCE_INLINE_ uint32_t hash_fmix32(uint32_t h) { … } static _FORCE_INLINE_ uint32_t hash_murmur3_buffer(const void *key, int length, const uint32_t seed = HASH_MURMUR3_SEED) { … } static _FORCE_INLINE_ uint32_t hash_djb2_one_float(double p_in, uint32_t p_prev = 5381) { … } template <typename T> static _FORCE_INLINE_ uint32_t hash_make_uint32_t(T p_in) { … } static _FORCE_INLINE_ uint64_t hash_djb2_one_float_64(double p_in, uint64_t p_prev = 5381) { … } static _FORCE_INLINE_ uint64_t hash_djb2_one_64(uint64_t p_in, uint64_t p_prev = 5381) { … } template <typename T> static _FORCE_INLINE_ uint64_t hash_make_uint64_t(T p_in) { … } template <typename T> class Ref; struct HashMapHasherDefault { … }; // TODO: Fold this into HashMapHasherDefault once C++20 concepts are allowed template <typename T> struct HashableHasher { … }; template <typename T> struct HashMapComparatorDefault { … }; template <> struct HashMapComparatorDefault<float> { … }; template <> struct HashMapComparatorDefault<double> { … }; template <> struct HashMapComparatorDefault<Vector2> { … }; template <> struct HashMapComparatorDefault<Vector3> { … }; constexpr uint32_t HASH_TABLE_SIZE_MAX = …; inline constexpr uint32_t hash_table_size_primes[HASH_TABLE_SIZE_MAX] = …; // Computed with elem_i = UINT64_C (0 x FFFFFFFF FFFFFFFF ) / d_i + 1, where d_i is the i-th element of the above array. inline constexpr uint64_t hash_table_size_primes_inv[HASH_TABLE_SIZE_MAX] = …; /** * Fastmod computes ( n mod d ) given the precomputed c much faster than n % d. * The implementation of fastmod is based on the following paper by Daniel Lemire et al. * Faster Remainder by Direct Computation: Applications to Compilers and Software Libraries * https://arxiv.org/abs/1902.01961 */ static _FORCE_INLINE_ uint32_t fastmod(const uint32_t n, const uint64_t c, const uint32_t d) { … } #endif // HASHFUNCS_H
Codebase Browser
godot