Lines Matching defs:hash
56 Q.Score is a measure of quality of the hash function.
186 * 32-bit hash
207 Calculate the 32-bit hash of sequence "length" bytes stored at memory address "input".
222 * Start a new hash by initializing state with a seed, using XXH*_reset().
224 * Then, feed the hash state by calling XXH*_update() as many times as necessary.
227 * Finally, a hash value can be produced anytime, by using XXH*_digest().
228 * This function returns the nn-bits hash as an int or long long.
230 * It's still possible to continue inserting input into the hash state after a digest,
231 * and generate some new hash values later on, by invoking again XXH*_digest().
255 * When writing hash values to storage, sending them over a network, or printing them,
259 * The following functions allow transformation of hash values into and from canonical format.
263 XXH_PUBLIC_API void XXH32_canonicalFromHash(XXH32_canonical_t* dst, XXH32_hash_t hash);
269 * 64-bit hash
282 * Returns the 64-bit hash of sequence of length @length stored at memory address @input.
300 XXH_PUBLIC_API void XXH64_canonicalFromHash(XXH64_canonical_t* dst, XXH64_hash_t hash);
411 * The check costs one initial branch per hash;
634 * 32-bit hash functions
955 * These functions allow transformation of hash result into and from its canonical format.
956 * This way, hash values can be written into a file or buffer, remaining comparable across different systems.
959 XXH_PUBLIC_API void XXH32_canonicalFromHash(XXH32_canonical_t* dst, XXH32_hash_t hash)
962 if (XXH_CPU_LITTLE_ENDIAN) hash = XXH_swap32(hash);
963 memcpy(dst, &hash, sizeof(*dst));
975 * 64-bit hash functions
1416 XXH_PUBLIC_API void XXH64_canonicalFromHash(XXH64_canonical_t* dst, XXH64_hash_t hash)
1419 if (XXH_CPU_LITTLE_ENDIAN) hash = XXH_swap64(hash);
1420 memcpy(dst, &hash, sizeof(*dst));
1432 * New generation hash designed for speed on small keys and vectorization