Package net.openhft.hashing

API for hashing sequential data and zero-allocation, pretty fast implementations of non-cryptographic hash functions.

See: Description

Class Summary

Class	Description
Access<T>	Strategy of reading bytes, defines the abstraction of T class instances as ordered byte sequence.
ByteBufferAccess
CharSequenceAccess
CompactLatin1CharSequenceAccess
LongHashFunction	Hash function producing long-valued result from byte sequences of any length and a plenty of different sources which "feels like byte sequences".
LongTupleHashFunction	Tuple hash function producing more than 64-bit hash code into a result array of type long[] from any byte sequences.
UnsafeAccess

Package net.openhft.hashing Description

API for hashing sequential data and zero-allocation, pretty fast implementations of non-cryptographic hash functions.

Currently implemented (in alphabetical order):

• long-valued functions: see LongHashFunction
  • CityHash 1.1 without seeds, with one seed and with two seeds.
  • FarmHash 1.0 (farmhashna) without seed, with one seed and with two seeds.
  • FarmHash 1.1 (farmhashuo) without seed, with one seed and with two seeds.
  • MetroHash without seed and with a seed.
  • 64-bit MurmurHash3 without seed and with a seed.
  • WyHash v3 without seed and with a seed.
  • xxHash without seed and with a seed.

API for hashing sequential data to more than 64-bit result, pretty fast implementations of non-cryptographic hash functions.

Currently implemented (in alphabetical order):

• long[]-valued functions: see LongTupleHashFunction
  • 128-bit MurmurHash3 without seed and with a seed.