| 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.
|
| Modifier and Type | Interface and Description |
|---|---|
interface |
BaseList<E>
Adds copy-on-write, "fluent interface" methods to
UnmodList. |
interface |
ImList<E>
Immutable copy-on-write list
|
interface |
ImSortedSet<E>
An immutable sorted set interface
|
interface |
MutableList<E>
|
interface |
UnmodList<E>
Formalizes the return type of
Collections.unmodifiableList(List), deprecating
mutator methods and implementing them to throw exceptions. |
interface |
UnmodSortedSet<E>
An unmodifiable SortedSet.
|
| Modifier and Type | Class and Description |
|---|---|
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.
|
| Modifier and Type | Method and Description |
|---|---|
default UnmodSortedCollection<V> |
UnmodSortedMap.values()
This method is deprecated on UnmodMap because equals() and hashCode() cannot be implemented
on the resulting collection, but the guaranteed order of the result in a SortedMap makes this
able to return a List.
|
Copyright © 2019. All rights reserved.