| 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.
|
| Modifier and Type | Field and Description |
|---|---|
static UnmodList<?> |
FunctionUtils.EMPTY_UNMOD_LIST
Deprecated.
|
| Modifier and Type | Method and Description |
|---|---|
static <T> UnmodList<T> |
FunctionUtils.emptyUnmodList()
Returns an empty unmodifiable list.
|
static <T> UnmodList<T> |
FunctionUtils.unmodList(List<T> inner)
Returns an unmodifiable version of the given list.
|
| 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 |
MutableList<E>
You could think of this as a builder for an immutable map.
|
| Modifier and Type | Class and Description |
|---|---|
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 |
|---|---|
default UnmodList<E> |
UnmodList.subList(int fromIndex,
int toIndex) |
Copyright © 2017. All rights reserved.