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 <T> ImSet<T> |
StaticImports.set(T... items)
Returns a new PersistentHashSet of the values.
|
Modifier and Type | Class and Description |
---|---|
class |
PersistentHashSet<E>
A wrapper that turns a PersistentTreeMap into a set.
|
Modifier and Type | Method and Description |
---|---|
default ImSet<Map.Entry<K,V>> |
ImMap.entrySet()
Returns a view of the mappings contained in this map.
|
ImSet<E> |
MutableSet.immutable()
Returns an immutable version of this immutable set.
|
default ImSet<K> |
ImMap.keySet()
Returns an immutable view of the keys contained in this map.
|
ImSet<E> |
ImSet.put(E e)
Adds an element, returning a modified version of the set (leaving the original set unchanged).
|
default ImSet<E> |
ImSet.union(Iterable<? extends E> iter)
Returns a new set containing all the items.
|
ImSet<E> |
ImSet.without(E key)
Removes this key from the set
|
Modifier and Type | Method and Description |
---|---|
default ImSet<T> |
Transformable.toImSet()
Realize an unordered immutable hash set to remove duplicates or very quickly O(1) tell whether
the set contains various items, but don't care about ordering.
|
Copyright © 2018. All rights reserved.