All Classes and Interfaces

Class	Description
BiConverter<T,R>	Similar to Converter, but able to convert bi-directionally.
Converter<T,R>	Converts elements from T to R.
Graph<T,E>	A collection of values connected by weighted outbound and inbound edges to other values.
Graph.Node<T,E>	An individual vertex with outbound and inbound edges in a Graph.
Graph.Node.RelatedNode<T,E>	A connected Graph.Node along with additional connection metadata.
Iterables	Additional utility methods for generating or otherwise working with Iterables.
Memoizer<T,R>	Memoizes results of function invocations.
ShortestPath<T,E>	Shortest path procedure on a graph.
SparseMultiset<T,K>	A collection of T elements supporting multiple K keys/markers on individual elements.
ThrowingBiConsumer<T,U,E>	A BiConsumer which may throw a checked exception.
ThrowingBiFunction<T,U,R,E>	A BiFunction which may throw a checked exception.
ThrowingBiPredicate<T,U,E>	A BiPredicate which may throw a checked exception.
ThrowingConsumer<T,E>	A Consumer which may throw a checked exception.
ThrowingFunction<T,R,E>	A Function which may throw a checked exception.
ThrowingPredicate<T,E>	A Predicate which may throw a checked exception.
ThrowingRunnable<E>	A Runnable which may throw a checked exception.
ThrowingSupplier<T,E>	A Supplier which may throw a checked exception.
TopologicalSort<T>	Topological sorting procedure on a graph.
Trie<T>	A tree with nodes connected to other nodes by a given iterable element.
WeightedDistribution<T>	A distribution of randomly-selectable weighted values.