Uses of Interface org.organicdesign.fp.collections.ImMap (Paguro 3.1.4 API)

Packages that use ImMap
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).

Uses of ImMap in org.organicdesign.fp

Methods in org.organicdesign.fp that return ImMap
Modifier and Type	Method	Description
`static <K,V> ImMap<K,V>`	StaticImports.`map(java.util.Map.Entry<K,V>... kvPairs)`	Returns a new PersistentHashMap of the given keys and their paired values.

Uses of ImMap in org.organicdesign.fp.collections

Classes in org.organicdesign.fp.collections that implement ImMap
Modifier and Type	Class	Description
`class`	`PersistentHashMap<K,V>`	Rich Hickey's immutable rendition of Phil Bagwell's Hash Array Mapped Trie.

Methods in org.organicdesign.fp.collections that return ImMap
Modifier and Type	Method	Description
`default ImMap<K,V>`	ImMap.`assoc(java.util.Map.Entry<K,V> entry)`	Returns a new map with an immutable copy of the given entry added
`ImMap<K,V>`	ImMap.`assoc(K key, V val)`	Returns a new map with the given key/value added
`ImMap<K,V>`	MutableMap.`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

Methods in org.organicdesign.fp.collections with parameters of type ImMap
Modifier and Type	Method	Description
`static <E> PersistentHashSet<E>`	PersistentHashSet.`ofMap(ImMap<E,?> map)`

Uses of ImMap in org.organicdesign.fp.xform

Methods in org.organicdesign.fp.xform that return ImMap
Modifier and Type	Method	Description
`default <K,V> ImMap<K,V>`	Transformable.`toImMap(Fn1<? super T,java.util.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.