| Package | Description |
|---|---|
| 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.
|
| Modifier and Type | Class and Description |
|---|---|
static class |
RrbTree.ImRrbt<E>
Immutable version of an
RrbTree. |
static class |
RrbTree.MutableRrbt<E>
Mutable version of an
RrbTree. |
| Modifier and Type | Method and Description |
|---|---|
abstract RrbTree<E> |
RrbTree.append(E t)
Adds one item to the end of the ImList.
|
abstract RrbTree<E> |
RrbTree.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.
|
abstract RrbTree<E> |
RrbTree.join(RrbTree<E> that)
Joins the given tree to the right side of this tree (or this to the left side of that one) in
something like O(log n) time.
|
RrbTree<E> |
RrbTree.MutableRrbt.join(RrbTree<E> that)
Joins the given tree to the right side of this tree (or this to the left side of that one) in
something like O(log n) time.
|
RrbTree<E> |
RrbTree.ImRrbt.join(RrbTree<E> that)
Joins the given tree to the right side of this tree (or this to the left side of that one)
in something like O(log n) time.
|
abstract RrbTree<E> |
RrbTree.replace(int index,
E item)
Replace the item at the given index.
|
RrbTree<E> |
RrbTree.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 |
|---|---|
abstract Tuple2<? extends RrbTree<E>,? extends RrbTree<E>> |
RrbTree.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.
|
abstract Tuple2<? extends RrbTree<E>,? extends RrbTree<E>> |
RrbTree.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 |
|---|---|
abstract RrbTree<E> |
RrbTree.join(RrbTree<E> that)
Joins the given tree to the right side of this tree (or this to the left side of that one) in
something like O(log n) time.
|
RrbTree<E> |
RrbTree.MutableRrbt.join(RrbTree<E> that)
Joins the given tree to the right side of this tree (or this to the left side of that one) in
something like O(log n) time.
|
RrbTree<E> |
RrbTree.ImRrbt.join(RrbTree<E> that)
Joins the given tree to the right side of this tree (or this to the left side of that one)
in something like O(log n) time.
|
Copyright © 2019. All rights reserved.