| 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> RrbTree.ImRrbt<T> |
StaticImports.rrb(T... items)
Returns a new immutable RRB Tree
RrbTree.ImRrbt of the given items. |
| Modifier and Type | Method and Description |
|---|---|
RrbTree.ImRrbt<E> |
RrbTree.ImRrbt.append(E val)
Adds one item to the end of the ImList.
|
RrbTree.ImRrbt<E> |
RrbTree.ImRrbt.concat(Iterable<? extends E> es)
Efficiently adds items to the end of this ImList.
|
static <T> RrbTree.ImRrbt<T> |
RrbTree.empty()
Returns the empty, immutable RRB-Tree (there is only one)
|
RrbTree.ImRrbt<E> |
RrbTree.MutableRrbt.immutable()
Returns a immutable version of this mutable list.
|
RrbTree.ImRrbt<E> |
RrbTree.ImRrbt.insert(int idx,
E element)
Inserts an item in the RRB tree pushing the current element at that index and all subsequent
elements to the right.
|
RrbTree.ImRrbt<E> |
RrbTree.ImRrbt.replace(int index,
E item)
Replace the item at the given index.
|
RrbTree.ImRrbt<E> |
RrbTree.ImRrbt.without(int index)
Returns a new RrbTree minus the given item (all items to the right are shifted left one)
This is O(log n).
|
| Modifier and Type | Method and Description |
|---|---|
Tuple2<RrbTree.ImRrbt<E>,RrbTree.ImRrbt<E>> |
RrbTree.ImRrbt.split(int splitIndex)
Divides this RRB-Tree such that every index less-than the given index ends up in the left-hand
tree and the indexed item and all subsequent ones end up in the right-hand tree.
|
Tuple2<RrbTree.ImRrbt<E>,RrbTree.ImRrbt<E>> |
RrbTree.ImRrbt.split(int splitIndex)
Divides this RRB-Tree such that every index less-than the given index ends up in the left-hand
tree and the indexed item and all subsequent ones end up in the right-hand tree.
|
| Modifier and Type | Method and Description |
|---|---|
default RrbTree.ImRrbt<T> |
Transformable.toImRrbt()
Realize a thread-safe immutable RRB-Tree to access items quickly O(log32 n) by index.
|
Copyright © 2019. All rights reserved.