f2568() is a variable length tabulation hashing function which returns a 64 bit hash result of input data up to a size of 256 bytes. It’s quite fast (basically requiring as many XOR operations as the data length in bytes), easy to understand and very strong at the same time. f2568() is publicly available under the BSD-3-Clause License.
f448() is another tabulation hashing function which maps two uint32_t to an uniform hash result of type uint64_t. This is useful to implement a skiplist based consistent hash ring with 2^64 possible ring slots (or positions).
f82() is hash function which hashes a unt64_t 8 byte unsigned integer key to a uint16_t 2 byte hash value. It belongs to the class of tabulation hashing functions and is perfect for implementing lock-less hash tables and other data structures that require an uniform and perfect distribution.