All Classes and Interfaces
Class
Description
A directed graph which will throw a
DirectedAcyclicGraph.CycleException if any new edge creates a cycle.A map which has floating-point keys, built atop
IntMap, with which it shares performance characteristics.A map which has integer keys, which is an combination of Okasaki and Gill's
Fast Mergeable Integer Maps with the memory layout
suggested by Steindorfer and Vinju used in
Map, with which it shares the same broad
performance
characteristics.A simple implementation of a mutable list combining the best characteristics of
ArrayList and
ArrayDeque, allowing elements to be added and removed from both ends of the collection and
allowing random-access reads and updates.A hash-map implementation which uses Robin Hood hashing for placement, and allows for customized hashing and equality
semantics.
A set which builds atop
LinearMap, and shares the same performance characteristics.An implementation of an immutable list which allows for elements to be added and removed from both ends of the
collection, as well as random-access reads and writes.
Utility functions for classes implementing
IList.An implementation of an immutable hash-map based on the general approach described by Steindorfer and Vinju in
this paper.
Utility functions for classes implementing
IMap.A tree-based immutable string representation, indexed on both full Unicode code points and Java's UTF-16 code
units.
A set which builds atop
Map, and shares the same performance characteristics.Utility functions for classes implementing
ISet.A red-black tree based on Germane 2014.