All Classes

Class	Description
AbstractUnmodIterable<T>	Implements equals and hashCode() methods compatible with all java.util collections (this algorithm is not order-dependent) and toString which takes the name of the sub-class.
AbstractUnmodMap<K,V>	Implements equals() and hashCode() methods compatible with java.util.Map (which ignores order) to make defining unmod Maps easier.
AbstractUnmodSet<T>	Implements equals and hashCode() methods compatible with java.util.Set (which ignores order) to make defining unmod sets easier, especially for implementing Map.keySet() and such.
BaseList<E>	Adds copy-on-write, "fluent interface" methods to UnmodList.
BaseMap<K,V>	Adds copy-on-write, "fluent interface" methods to UnmodMap.
BaseSet<E>	Adds copy-on-write, "fluent interface" methods to UnmodSet.
BaseUnsortedMap<K,V>	Adds BaseUnsortedMap.equator() to BaseMap which is an unsorted-only operation.
ComparisonContext<T>	Represents a context for comparison because sometimes you order the same things differently.
ComparisonContext.CompCtx	Please access this type-safely through ComparisonContext.defCompCtx() instead of calling directly.
Cowry	Cowry is short for Copy On Write aRraY and contains utilities for doing this quickly and correctly.
Equator<T>	An Equator represents an equality context in a way that is analgous to the java.util.Comparator interface.
Equator.Comp
Equator.Equat
Fn0<U>	This is like Java 8's java.util.function.Supplier, but retrofitted to turn checked exceptions into unchecked ones.
Fn1<T,U>	This is like Java 8's java.util.function.Function, but retrofitted to turn checked exceptions into unchecked ones.
Fn1.BooleanCombiner
Fn1.ConstObjBool	Constant functions that take an Object and return a Boolean
Fn1.ConstObjObj	Constant functions that take an Object and return an Object
Fn2<A,B,R>	This is like Java 8's java.util.function.BiFunction, but retrofitted to turn checked exceptions into unchecked ones.
Fn2.Singletons
Fn3<A,B,C,R>	A three-argument, exception-safe functional interface.
FunctionUtils	A dumping ground for utility functions that aren't useful enough to belong in StaticImports.
ImList<E>	Immutable copy-on-write list
ImMap<K,V>	An immutable map with no guarantees about its ordering.
ImSet<E>	An immutable set with no guarantees about its ordering
ImSortedMap<K,V>	An immutable sorted map.
ImSortedSet<E>	An immutable sorted set interface
Indented	Created by gpeterso on 5/21/17.
IndentUtils
LazyRef<T>	Lazily initialize a value (and free the initialization resources) on the first call to get().
MutList<E>	A mutate-in-place interface using the same copy-on-write methods as BaseList and ImList so that you can treat mutable and immutable lists the same.
MutMap<K,V>	Interface for mutable (hash) map builder.
MutSet<E>	Interface for mutable (hash) set builder.
None<T>	Represents the absence of a value
OneOf2<A,B>	This is designed to represent a union of 2 types, meaning an object that can be one type, or another.
OneOf3<A,B,C>	Holds one of 3 types of value.
OneOf4<A,B,C,D>	Holds one of 4 types of value.
OneOf5<A,B,C,D,E>	Holds one of 5 types of value.
Option<T>	Indicates presence or absence of a value (null is a valid, present value).
Option.Some<T>	Represents the presence of a value, even if that value is null.
Or<G,B>	`Or` represents the presence of a successful outcome, or an error.
Or.Bad<G,B>	Represents the presence of a Bad value (and absence of a Good).
Or.Good<G,B>	Represents the presence of a Good value (and absence of a Bad).
PersistentHashMap<K,V>	Rich Hickey's immutable rendition of Phil Bagwell's Hash Array Mapped Trie.
PersistentHashMap.MutHashMap<K,V>
PersistentHashSet<E>	A wrapper that turns a PersistentTreeMap into a set.
PersistentHashSet.MutHashSet<E>
PersistentTreeMap<K,V>	Persistent Red Black Tree.
PersistentTreeSet<E>	A wrapper that turns a PersistentTreeMap into a set.
PersistentVector<E>	This started out as Rich Hickey's PersistentVector class from Clojure in late 2014.
PersistentVector.MutVector<F>
RangeOfInt	An efficient (in both time and memory) implementation of List.
RangeOfInt.Equat
RrbTree<E>	An RRB Tree is an immutable List (like Clojure's PersistentVector) that also supports random inserts, deletes, and can be split and joined back together in logarithmic time.
RrbTree.ImRrbt<E>	Immutable version of an RrbTree.
RrbTree.MutRrbt<E>	Mutable version of an RrbTree.
RuntimeTypes	Stores the classes from the compile-time generic type parameters in a vector in the *same order* as the generics in the type signature of that class.
Sized
StaticImports	A mini data definition language composed of short methods like vec(), tup(), map(), set(), plus xform() which makes java.util collections transformable.
Transformable<T>	Represents transformations to be carried out on a collection.
Tuple10<A,B,C,D,E,F,G,H,I,J>	Holds 10 items of potentially different types.
Tuple11<A,B,C,D,E,F,G,H,I,J,K>	Holds 11 items of potentially different types.
Tuple12<A,B,C,D,E,F,G,H,I,J,K,L>	Holds 12 items of potentially different types.
Tuple2<A,B>	Holds 2 items of potentially different types, and implements Map.Entry (and UnmodMap.UnEntry (there is no ImMap.ImEntry)).
Tuple3<A,B,C>	Holds 3 items of potentially different types.
Tuple4<A,B,C,D>	Holds 4 items of potentially different types.
Tuple5<A,B,C,D,E>	Holds 5 items of potentially different types.
Tuple6<A,B,C,D,E,F>	Holds 6 items of potentially different types.
Tuple7<A,B,C,D,E,F,G>	Holds 7 items of potentially different types.
Tuple8<A,B,C,D,E,F,G,H>	Holds 8 items of potentially different types.
Tuple9<A,B,C,D,E,F,G,H,I>	Holds 9 items of potentially different types.
UnmodCollection<E>	Don't implement this interface directly if you don't have to.
UnmodIterable<T>	An unmodifiable Iterable, without any guarantee about order.
UnmodIterable.UnIterable
UnmodIterator<E>	A one-time use, mutable, not-thread-safe way to get each value of the underling collection in turn.
UnmodIterator.UnIterator	Instead of calling this directly, please use UnmodIterator.emptyUnmodIterator() instead
UnmodList<E>	Formalizes the return type of Collections.unmodifiableList(List), deprecating mutator methods and implementing them to throw exceptions.
UnmodList.AbstractUnmodList<E>	Implements equals and hashCode() methods compatible with java.util.List (which ignores order) to make defining unmod lists easier.
UnmodListIterator<E>	An unmodifiable ListIterator
UnmodMap<K,V>	An unmodifiable map.
UnmodMap.UnEntry<K,V>	A map entry (key-value pair).
UnmodMap.UnEntry.EntryToUnEntryIter<K,V>
UnmodMap.UnEntry.EntryToUnEntrySortedIter<K,V>
UnmodMap.UnEntry.UnmodKeyIter<K,V>
UnmodMap.UnEntry.UnmodSortedKeyIter<K,V>
UnmodMap.UnEntry.UnmodSortedValIter<K,V>
UnmodMap.UnEntry.UnmodValIter<K,V>
UnmodSet<E>	An unmodifiable set
UnmodSortedCollection<E>
UnmodSortedIterable<T>	An unmodifiable Iterable, with guaranteed order.
UnmodSortedIterator<E>	This represents an iterator with a guaranteed ordering.
UnmodSortedIterator.Wrapper<E>
UnmodSortedMap<K,V>	An unmodifiable SortedMap.
UnmodSortedSet<E>	An unmodifiable SortedSet.
Xform<A>	An immutable description of operations to be performed (a transformation, transform, or x-form).
Xform.RunList	A RunList is a list of Operations "compiled" from an Xform.