| 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> ImSortedSet<T> |
StaticImports.sortedSet(Comparator<? super T> comp,
Iterable<T> elements)
Returns a new PersistentTreeSet of the given comparator and items.
|
static <T extends Comparable<T>> |
StaticImports.sortedSet(Iterable<T> items)
Returns a new PersistentTreeSet of the given comparable items.
|
| Modifier and Type | Class and Description |
|---|---|
class |
PersistentTreeSet<E>
A wrapper that turns a PersistentTreeMap into a set.
|
| Modifier and Type | Method and Description |
|---|---|
ImSortedSet<Map.Entry<K,V>> |
ImSortedMap.entrySet()
Returns a view of the mappings contained in this map.
|
ImSortedSet<Map.Entry<K,V>> |
PersistentTreeMap.entrySet()
Returns a view of the mappings contained in this map.
|
default ImSortedSet<E> |
ImSortedSet.headSet(E toElement) |
default ImSortedSet<K> |
ImSortedMap.keySet()
Returns a view of the keys contained in this map.
|
ImSortedSet<E> |
ImSortedSet.put(E e)
Adds an element.
|
ImSortedSet<E> |
ImSortedSet.subSet(E fromElement,
E toElement)
Return the elements in this set from the start element (inclusive) to the end element
(exclusive)
|
ImSortedSet<E> |
PersistentTreeSet.subSet(E fromElement,
E toElement)
Return the elements in this set from the start element (inclusive) to the end element
(exclusive)
|
ImSortedSet<E> |
ImSortedSet.tailSet(E fromElement) |
ImSortedSet<E> |
PersistentTreeSet.tailSet(E fromElement) |
default ImSortedSet<E> |
ImSortedSet.union(Iterable<? extends E> iter) |
ImSortedSet<E> |
ImSortedSet.without(E key)
Removes this key from the set
|
| Modifier and Type | Method and Description |
|---|---|
default ImSortedSet<T> |
Transformable.toImSortedSet(Comparator<? super T> comparator)
Realize an immutable, sorted (tree) set to quickly O(log2 n) test it contains items, but still
retrieve entries in order.
|
Copyright © 2019. All rights reserved.