Uses of Interface
org.organicdesign.fp.collections.Sized

Packages that use Sized

Package	Description
org.organicdesign.fp.collections	Type-safe versions of immutable collections (mostly from Clojure), plus unmodifiable and immutable collection interfaces that fit these collections into the java.util interfaces.

Uses of Sized in org.organicdesign.fp.collections

Subinterfaces of Sized in org.organicdesign.fp.collections

Modifier and Type	Interface	Description
interface	BaseList<E>	Adds copy-on-write, "fluent interface" methods to UnmodList.
interface	BaseMap<K,V>	Adds copy-on-write, "fluent interface" methods to UnmodMap.
interface	BaseSet<E>	Adds copy-on-write, "fluent interface" methods to UnmodSet.
interface	BaseUnsortedMap<K,V>	Adds BaseUnsortedMap.equator() to BaseMap which is an unsorted-only operation.
interface	ImList<E>	Immutable copy-on-write list
interface	ImMap<K,V>	An immutable map with no guarantees about its ordering.
interface	ImSet<E>	An immutable set with no guarantees about its ordering
interface	ImSortedMap<K,V>	An immutable sorted map.
interface	ImSortedSet<E>	An immutable sorted set interface
interface	MutableList<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.
interface	MutableMap<K,V>	Interface for mutable (hash) map builder.
interface	MutableSet<E>	Interface for mutable (hash) set builder.
interface	UnmodCollection<E>	Don't implement this interface directly if you don't have to.
interface	UnmodList<E>	Formalizes the return type of Collections.unmodifiableList(List), deprecating mutator methods and implementing them to throw exceptions.
interface	UnmodMap<K,V>	An unmodifiable map.
interface	UnmodSet<E>	An unmodifiable set
interface	UnmodSortedCollection<E>
interface	UnmodSortedMap<K,V>	An unmodifiable SortedMap.
interface	UnmodSortedSet<E>	An unmodifiable SortedSet.

Classes in org.organicdesign.fp.collections that implement Sized

Modifier and Type	Class	Description
class	AbstractUnmodMap<K,V>	Implements equals() and hashCode() methods compatible with java.util.Map (which ignores order) to make defining unmod Maps easier.
class	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.
class	PersistentHashMap<K,V>	Rich Hickey's immutable rendition of Phil Bagwell's Hash Array Mapped Trie.
static class	PersistentHashMap.MutableHashMap<K,V>
class	PersistentHashSet<E>	A wrapper that turns a PersistentTreeMap into a set.
static class	PersistentHashSet.MutableHashSet<E>
class	PersistentTreeMap<K,V>	Persistent Red Black Tree.
class	PersistentTreeSet<E>	A wrapper that turns a PersistentTreeMap into a set.
class	PersistentVector<E>	This started out as Rich Hickey's PersistentVector class from Clojure in late 2014.
static class	PersistentVector.MutableVector<F>
class	RangeOfInt	An efficient (in both time and memory) implementation of List.
class	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.
static class	RrbTree.ImRrbt<E>	Immutable version of an RrbTree.
static class	RrbTree.MutableRrbt<E>	Mutable version of an RrbTree.
static class	UnmodList.AbstractUnmodList<E>	Implements equals and hashCode() methods compatible with java.util.List (which ignores order) to make defining unmod lists easier.