Package avail.
Types
A BloomFilter is a conservative, probabilistic set. It can report that an element is probably in the set, or definitely not in the set. This can be a useful, fast prefilter to avoid computing or fetching authoritative data in a large majority of cases, effectively reducing the number of spurious occurrences of the slower activity by orders of magnitude.
An EnumMap is a Map implementation for use with enum type keys only. All of the keys in an EnumMap must come from a single enum that is specified, explicitly as the first parameterized type. EnumMaps are represented internally as arrays. Enum maps are maintained in the natural order of their keys (Enum.ordinals).
A LeftistHeap is a persistent (immutable) priority queue. The first operation is O(1), and with and withoutFirst are O(log(n)). The latter two also produce a new LeftistHeap without modifying the original.
A RunTree maintains a mapping from Long to some value which is expected to be the same for runs of consecutive Longs. This is not thread-safe, and should be protected with an external ReadWriteLock to allow readers and writers to coordinate safely.