This project provides a Java API for hashing any sequences of bytes in Java, including all kinds of primitive arrays, buffers, `CharSequence`s and more.
Written for Java 7+ under Apache 2.0 license.
The key difference compared to other similar projects, e.g.
Guava hashing,
is that this has no object allocations during the hash computation and does not use ThreadLocal
.
The implementation utilises native access where possible, but is also platform-endianness-agnostic. This provides consistent results whatever the byte order, while only moderately affecting performance.
Currently long
-valued hash function interface is defined, with the following
implementations:
These are thoroughly tested with JDK 7, 8, 9, 10, and 11 on little-endian platform. However they are believed to be independent from the native byte order.
Tested on Intel Core i7-4870HQ CPU @ 2.50GHz
Algorithm | Speed, GB/s | Bootstrap, ns |
---|---|---|
xxHash |
9.5 |
6 |
FarmHash |
9.0 |
6 |
FarmHash |
7.2 |
7 |
CityHash |
7.0 |
7 |
MurmurHash |
5.3 |
12 |
To sum up,
-
You need to hash plain byte sequences, memory blocks or "flat" objects.
-
You want zero-allocation and good performance (at Java scale).
-
You need hashing to be agile with regards to byte ordering.
-
You need to hash POJOs whose actual data is scattered in memory between managed objects. There is no simple way to hash these using this project, for example, classes such as:
class Person { String givenName, surName; int salary; }
-
You need to hash byte sequences of unknown length, for the simpliest example,
Iterator<Byte>
. -
You need to transform the byte sequence (e.g. encode or decode it with a specific coding), and hash the resulting byte sequence on the way without dumping it to memory.
Gradle:
dependencies {
compile 'net.openhft:zero-allocation-hashing:0.9'
}
Or Maven:
<dependency>
<groupId>net.openhft</groupId>
<artifactId>zero-allocation-hashing</artifactId>
<version>0.9</version>
</dependency>
In Java:
long hash = LongHashFunction.xx().hashChars("hello");
See JavaDocs for more information.
See the list of open issues.