| 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 | Class and 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> |
static class |
UnmodList.AbstractUnmodList<E>
Implements equals and hashCode() methods compatible with java.util.List (which ignores order)
to make defining unmod lists easier.
|
Copyright © 2019. All rights reserved.