Release Notes: In some very rare circumstances, enumeration of hash sets or maps combined with massive element removal (using the iterator remove() method) could have led to inconsistent enumeration. This has been fixed.
Release Notes: Array-based priority queues now cache their first element, and fastutil can be found on Maven Central.
Release Notes: More efficient radix sort methods.
Release Notes: This release adds bugfixes in the TextIO.store() methods and rehashing of big sets.
Release Notes: New methods for indirect queues. Doubly linked implementation for hash maps and sets. New array-based FIFO queues. A number of bugfixes.
Release Notes: The main new set of methods implements radix sort both for direct and indirect (possibly stable) sorting. The provided methods are from 2 to 8 times faster than the standard quicksort and mergesort implementations available.
Release Notes: A better structure of the scan loop for hash tables borrowed from HPPC gives some speed improvement to hash-based classes.
Release Notes: Hash-based classes have been rewritten using linear probing. They are now twice as fast and provide true deletions.
Release Notes: A bunch of new classes target the problem of big data structures in Java, such as big arrays and big lists.
Release Notes: An issue where the isEmpty() method of ArraySet was actually returning ! isEmpty() was fixed. A new constructor for FasyMultiByteArrayInputStream makes it possible to pass a MeasurableInputStream.