| Package | Description |
|---|---|
| org.organicdesign.fp |
A data definition language, and other tools for writing functional Java.
|
| org.organicdesign.fp.collections |
Type-safe versions of the immutable Clojure collections, plus unmodifiable and immutable
collection interfaces that extend the java.util collections, deprecating the mutate-in-place
methods (Unmod____) and adding methods that return a new, immutable, modified version of the
collection (Im____).
|
| Modifier and Type | Class and Description |
|---|---|
static class |
FunctionUtils.UnmodifiableList<T>
Wraps a list.
|
static class |
FunctionUtils.UnmodifiableSortedMap<K,V>
Wraps a sorted map.
|
static class |
FunctionUtils.UnmodifiableSortedSet<T>
Wraps a sorted set.
|
| Modifier and Type | Interface and Description |
|---|---|
interface |
ImList<E>
Holds Immutable "modification" methods that return a new ImList reflecting the modification while
sharing as much data structure with the previous ImList as possible (for performance).
|
interface |
ImSortedMap<K,V>
An immutable sorted map.
|
interface |
ImSortedSet<E>
An immutable sorted set interface
|
interface |
MutableList<E>
You could think of this as a builder for an immutable map.
|
interface |
UnmodList<E>
An unmodifiable version of
List which formalizes the return type of
Collections.unmodifiableList() |
interface |
UnmodSortedCollection<E> |
interface |
UnmodSortedMap<K,V>
An unmodifiable SortedMap.
|
interface |
UnmodSortedSet<E>
An unmodifiable SortedSet.
|
| Modifier and Type | Class and Description |
|---|---|
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.
|
static class |
UnmodList.AbstractUnmodList<E>
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.
|
| Modifier and Type | Method and Description |
|---|---|
static <E> UnmodSortedIterable<E> |
UnmodSortedIterable.castFromList(List<E> s) |
static <K,V> UnmodSortedIterable<UnmodMap.UnEntry<K,V>> |
UnmodSortedIterable.castFromSortedMap(SortedMap<K,V> sm) |
static <E> UnmodSortedIterable<E> |
UnmodSortedIterable.castFromSortedSet(SortedSet<E> s) |
| Modifier and Type | Method and Description |
|---|---|
static boolean |
UnmodSortedIterable.equal(UnmodSortedIterable a,
UnmodSortedIterable b)
This is correct, but O(n).
|
static boolean |
UnmodSortedIterable.equal(UnmodSortedIterable a,
UnmodSortedIterable b)
This is correct, but O(n).
|
static boolean |
UnmodSortedIterable.equals(UnmodSortedIterable a,
UnmodSortedIterable b)
Deprecated.
|
static boolean |
UnmodSortedIterable.equals(UnmodSortedIterable a,
UnmodSortedIterable b)
Deprecated.
|
Copyright © 2017. All rights reserved.