| Package | Description |
|---|---|
| org.organicdesign.fp |
A tiny data definition language for Java, in Java.
|
| 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.
|
| org.organicdesign.fp.tuple |
Immutable, type-safe, heterogeneous containers - ML calls these "records."
ML, Haskell, and Scala use tuples - why not Java?
Actually, tuples are *more* important in Java because Java does not have type aliases.
|
| org.organicdesign.fp.type |
Some ideas for runtime types.
|
| org.organicdesign.fp.xform |
Immutable descriptions of data transformations (Transformable), and a highly efficient
single-pass, short-circuiting implementation that carries out those transforms in a single pass
(Xform).
|
| Class and Description |
|---|
| ImList
Immutable copy-on-write list
|
| ImMap
An immutable map with no guarantees about its ordering.
|
| ImSet
An immutable set with no guarantees about its ordering
|
| ImSortedMap
An immutable sorted map.
|
| ImSortedSet
An immutable sorted set interface
|
| MutableList |
| MutableMap
Interface for mutable (hash) map builder.
|
| MutableSet
Interface for mutable (hash) set builder.
|
| RrbTree.ImRrbt
Immutable version of an
RrbTree. |
| RrbTree.MutableRrbt
Mutable version of an
RrbTree. |
| UnmodIterable
An unmodifiable Iterable, without any guarantee about order.
|
| Class and Description |
|---|
| AbstractUnmodIterable
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
Implements equals() and hashCode() methods compatible with java.util.Map (which ignores order)
to make defining unmod Maps easier.
|
| AbstractUnmodSet
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
Adds copy-on-write, "fluent interface" methods to
UnmodList. |
| BaseMap
Adds copy-on-write, "fluent interface" methods to
UnmodMap. |
| BaseSet
Adds copy-on-write, "fluent interface" methods to
UnmodSet. |
| BaseUnsortedMap
Adds
BaseUnsortedMap.equator() to BaseMap which is an unsorted-only operation. |
| ComparisonContext
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. |
| Equator
An Equator represents an equality context in a way that is analgous to the java.util.Comparator
interface.
|
| Equator.Comp |
| Equator.Equat |
| ImList
Immutable copy-on-write list
|
| ImMap
An immutable map with no guarantees about its ordering.
|
| ImSet
An immutable set with no guarantees about its ordering
|
| ImSortedMap
An immutable sorted map.
|
| ImSortedSet
An immutable sorted set interface
|
| MutableList |
| MutableMap
Interface for mutable (hash) map builder.
|
| MutableSet
Interface for mutable (hash) set builder.
|
| PersistentHashMap
Rich Hickey's immutable rendition of Phil Bagwell's Hash Array Mapped Trie.
|
| PersistentHashMap.MutableHashMap |
| PersistentHashSet
A wrapper that turns a PersistentTreeMap into a set.
|
| PersistentHashSet.MutableHashSet |
| PersistentTreeMap
Persistent Red Black Tree.
|
| PersistentTreeSet
A wrapper that turns a PersistentTreeMap into a set.
|
| PersistentVector
This started out as Rich Hickey's PersistentVector class from Clojure in late 2014.
|
| PersistentVector.MutableVector |
| RangeOfInt
An efficient (in both time and memory) implementation of List.
|
| RangeOfInt.Equat |
| RrbTree
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
Immutable version of an
RrbTree. |
| RrbTree.MutableRrbt
Mutable version of an
RrbTree. |
| Sized |
| UnmodCollection
Don't implement this interface directly if you don't have to.
|
| UnmodIterable
An unmodifiable Iterable, without any guarantee about order.
|
| UnmodIterator
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
Formalizes the return type of
Collections.unmodifiableList(List), deprecating
mutator methods and implementing them to throw exceptions. |
| UnmodList.AbstractUnmodList
Implements equals and hashCode() methods compatible with java.util.List (which ignores order)
to make defining unmod lists easier.
|
| UnmodListIterator
An unmodifiable ListIterator
|
| UnmodMap
An unmodifiable map.
|
| UnmodMap.UnEntry
A map entry (key-value pair).
|
| UnmodMap.UnEntry.EntryToUnEntryIter |
| UnmodMap.UnEntry.UnmodKeyIter |
| UnmodMap.UnEntry.UnmodValIter |
| UnmodSet
An unmodifiable set
|
| UnmodSortedCollection |
| UnmodSortedIterable
An unmodifiable Iterable, with guaranteed order.
|
| UnmodSortedIterator
This represents an iterator with a guaranteed ordering.
|
| UnmodSortedMap
An unmodifiable SortedMap.
|
| UnmodSortedSet
An unmodifiable SortedSet.
|
| Class and Description |
|---|
| UnmodMap.UnEntry
A map entry (key-value pair).
|
| Class and Description |
|---|
| ImList
Immutable copy-on-write list
|
| Class and Description |
|---|
| ImList
Immutable copy-on-write list
|
| ImMap
An immutable map with no guarantees about its ordering.
|
| ImSet
An immutable set with no guarantees about its ordering
|
| ImSortedMap
An immutable sorted map.
|
| ImSortedSet
An immutable sorted set interface
|
| MutableList |
| MutableMap
Interface for mutable (hash) map builder.
|
| MutableSet
Interface for mutable (hash) set builder.
|
| RrbTree.ImRrbt
Immutable version of an
RrbTree. |
| RrbTree.MutableRrbt
Mutable version of an
RrbTree. |
| UnmodIterable
An unmodifiable Iterable, without any guarantee about order.
|
| UnmodIterator
A one-time use, mutable, not-thread-safe way to get each value of the underling collection in
turn.
|
Copyright © 2019. All rights reserved.