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.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).
|
Modifier and Type | Method and Description |
---|---|
static <K,V> ImMap<K,V> |
StaticImports.map(Map.Entry<K,V>... kvPairs)
Returns a new PersistentHashMap of the given keys and their paired values.
|
Modifier and Type | Class and Description |
---|---|
class |
PersistentHashMap<K,V>
Rich Hickey's immutable rendition of Phil Bagwell's Hash Array Mapped Trie.
|
Modifier and Type | Method and Description |
---|---|
ImMap<K,V> |
ImMap.assoc(K key,
V val)
Returns a new map with the given key/value added
|
default ImMap<K,V> |
ImMap.assoc(Map.Entry<K,V> entry)
Returns a new map with an immutable copy of the given entry added
|
ImMap<K,V> |
MutableUnsortedMap.immutable()
Returns an immutable version of this mutable map.
|
ImMap<K,V> |
ImMap.without(K key)
Returns a new map with the given key/value removed
|
Modifier and Type | Method and Description |
---|---|
static <E> PersistentHashSet<E> |
PersistentHashSet.ofMap(ImMap<E,?> map) |
Modifier and Type | Method and Description |
---|---|
default <K,V> ImMap<K,V> |
Transformable.toImMap(Fn1<? super T,Map.Entry<K,V>> f1)
Realize an unordered immutable hash map to very quickly O(1) look up values by key, but don't
care about ordering.
|
Copyright © 2017. All rights reserved.