| Package | Description |
|---|---|
| org.organicdesign.fp |
A data definition language, and other tools for writing functional Java.
|
| org.organicdesign.fp.collections |
Type-safe versions of the immutable Clojure collections, plus unmodifiable and immutable
collection interfaces that extend the java.util collections, deprecating the mutate-in-place
methods (Unmod____) and adding methods that return a new, immutable, modified version of the
collection (Im____).
|
| 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 | Interface and Description |
|---|---|
interface |
ImSortedSet<E>
An immutable sorted set interface
|
interface |
ImUnsortedSet<E>
The super-interface of PersistentHashSet (excludes TreeSet).
|
interface |
MutableUnsortedSet<E>
Declare your set as MutableUnsortedSet, call mutable(), build it, then call
mySet = mySet.immutable() without having to declare a new variable.
|
| Modifier and Type | Class and Description |
|---|---|
class |
PersistentHashSet<E>
A wrapper that turns a PersistentTreeMap into a set.
|
static class |
PersistentHashSet.MutableHashSet<E> |
class |
PersistentTreeSet<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.
|
default ImSet<K> |
ImMapTrans.keySet()
Deprecated.
Returns a view of the keys contained in this map.
|
default ImSet<K> |
ImUnsortedMap.keySet()
Returns a view of the keys contained in this map.
|
ImSet<K> |
ImMap.keySet()
Returns a 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) |
ImSet<E> |
ImSet.without(E key)
Removes the given item, returning a modified version of the set (leaving the original set
unchanged).
|
| 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 © 2017. All rights reserved.