An implementation of the Koloboke Collections API.
Compatibility with the Java Collections Framework
- Fail-fast semantics everywhere
nullkeys are (optionally) supported, just like in
Double.NaNkeys are treated consistently with boxed version (all
NaNs are considered equal)
Here are several performance/memory footprint comparisons (covering different use cases) of collections frameworks, evidencing that in most cases Koloboke implementation library is the fastest and the most memory efficient library implementing hash maps and sets, typically beating the closest competitor by a large margin:
- Time – memory tradeoff with the example of Java Maps
- Large HashMap overview: JDK, FastUtil, Goldman Sachs, HPPC, Koloboke, Trove
- Most efficient way to increment a Map value in Java
The only thing that is faster than the Koloboke implementation library is Koloboke Compile.
The library is fat
The major disadvantage of the Koloboke implementation library is that it is very fat, total size of it’s jars with dependencies is almost 20 MB. Koloboke Compile is much thinner.
To start with the Koloboke implementation library, read the Quick start section on Github.