Uses of Interface
org.organicdesign.fp.collections.ImMap
-
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>
@NotNull ImMap<K,V>StaticImports. map(@Nullable Map.Entry<K,V> @Nullable ... 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 classPersistentHashMap<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 @NotNull ImMap<K,V>ImMap. assoc(Map.Entry<K,V> entry)Returns a new map with an immutable copy of the given entry added@NotNull ImMap<K,V>ImMap. assoc(K key, V val)Returns a new map with the given key/value added@NotNull ImMap<K,V>MutMap. immutable()Returns an immutable version of this mutable map.@NotNull ImMap<K,V>ImMap. without(K key)Returns a new map with the given key/value removedMethods 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>
@NotNull ImMap<K,V>Transformable. toImMap(@NotNull 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.
-