Uses of Class
fj.data.fingertrees.FingerTree

Packages that use FingerTree

Package	Description
fj	Types that set the premise for the existence of Functional Java.
fj.data	Common algebraic data types.
fj.data.fingertrees	Provides 2-3 finger trees, a functional representation of persistent sequences supporting access to the ends in amortized O(1) time.

Uses of FingerTree in fj

Methods in fj that return types with arguments of type FingerTree

Modifier and Type	Method	Description
static <V,A> Show<FingerTree<V,A>>	Show.fingerTreeShow(Show<V> sv, Show<A> sa)

Uses of FingerTree in fj.data

Methods in fj.data with parameters of type FingerTree

Modifier and Type	Method	Description
static <K,A> PriorityQueue<K,A>	PriorityQueue.priorityQueue(Equal<K> e, FingerTree<K,P2<K,A>> ft)	Creates a priority queue from a finger tree.

Uses of FingerTree in fj.data.fingertrees

Subclasses of FingerTree in fj.data.fingertrees

Modifier and Type	Class	Description
final class	Deep<V,A>	A finger tree with 1-4-digits on the left and right, and a finger tree of 2-3-nodes in the middle.
final class	Empty<V,A>	The empty tree.
final class	Single<V,A>	A tree with a single element.

Methods in fj.data.fingertrees that return FingerTree

Modifier and Type	Method	Description
FingerTree<V,A>	Deep.append(FingerTree<V,A> t)
FingerTree<V,A>	Empty.append(FingerTree<V,A> t)
abstract FingerTree<V,A>	FingerTree.append(FingerTree<V,A> t)	Appends one finger tree to another.
FingerTree<V,A>	Single.append(FingerTree<V,A> t)
FingerTree<V,A>	Deep.cons(A a)
FingerTree<V,A>	Empty.cons(A a)
abstract FingerTree<V,A>	FingerTree.cons(A a)	Adds the given element to this tree as the first element.
FingerTree<V,A>	Single.cons(A b)
FingerTree<V,A>	MakeTree.deep(Digit<V,A> prefix, FingerTree<V, Node<V,A>> middle, Digit<V,A> suffix)	Constructs a deep tree.
FingerTree<V,A>	MakeTree.deep(V v, Digit<V,A> prefix, FingerTree<V, Node<V,A>> middle, Digit<V,A> suffix)	Constructs a deep tree with the given annotation value.
static <V,A> FingerTree<V,A>	FingerTree.empty(Monoid<V> m, F<A,V> f)	Creates an empty finger tree with elements of type A and node annotations of type V.
FingerTree<V,A>	MakeTree.empty()	Constructs an empty tree.
static <A> FingerTree<Integer,A>	FingerTree.emptyIntAddition()
static <A> FingerTree<Integer, P2<Integer,A>>	FingerTree.emptyIntMax()	Returns a finger tree which combines the integer node annotations with the maximum function.
final <B> FingerTree<V,A>	FingerTree.filter(F<A,Boolean> f)
FingerTree<V,A>	Deep.init()
FingerTree<V,A>	Empty.init()
abstract FingerTree<V,A>	FingerTree.init()	The tree without the last element.
FingerTree<V,A>	Single.init()
<B> FingerTree<V,B>	Deep.map(F<A,B> abf, Measured<V,B> m)
<B> FingerTree<V,B>	Empty.map(F<A,B> abf, Measured<V,B> m)
abstract <B> FingerTree<V,B>	FingerTree.map(F<A,B> f, Measured<V,B> m)	Maps the given function across this tree, measuring with the given Measured instance.
<B> FingerTree<V,B>	Single.map(F<A,B> abf, Measured<V,B> m)
FingerTree<V, Node<V,A>>	Deep.middle()	Returns a finger tree of the inner nodes of this tree.
FingerTree<V,A>	MakeTree.single(A a)	Constructs a singleton tree.
FingerTree<V,A>	Deep.snoc(A a)
FingerTree<V,A>	Empty.snoc(A a)
abstract FingerTree<V,A>	FingerTree.snoc(A a)	Adds the given element to this tree as the last element.
FingerTree<V,A>	Single.snoc(A b)
FingerTree<V,A>	Deep.tail()
FingerTree<V,A>	Empty.tail()
abstract FingerTree<V,A>	FingerTree.tail()	The tree without the first element.
FingerTree<V,A>	Single.tail()
final FingerTree<V,A>	Digit.toTree()	Returns the tree representation of this digit.

Methods in fj.data.fingertrees that return types with arguments of type FingerTree

Modifier and Type	Method	Description
final P2<FingerTree<V,A>, FingerTree<V,A>>	FingerTree.split(F<V,Boolean> predicate)	Splits this tree into a pair of subtrees at the point where the given predicate, based on the measure, changes from false to true.
final P2<FingerTree<V,A>, FingerTree<V,A>>	FingerTree.split(F<V,Boolean> predicate)	Splits this tree into a pair of subtrees at the point where the given predicate, based on the measure, changes from false to true.
final P3<FingerTree<V,A>, A, FingerTree<V,A>>	FingerTree.split1(F<V,Boolean> predicate)	Like split, but returns the element where pred first holds separately.
final P3<FingerTree<V,A>, A, FingerTree<V,A>>	FingerTree.split1(F<V,Boolean> predicate)	Like split, but returns the element where pred first holds separately.

Methods in fj.data.fingertrees with parameters of type FingerTree

Modifier and Type	Method	Description
FingerTree<V,A>	Deep.append(FingerTree<V,A> t)
FingerTree<V,A>	Empty.append(FingerTree<V,A> t)
abstract FingerTree<V,A>	FingerTree.append(FingerTree<V,A> t)	Appends one finger tree to another.
FingerTree<V,A>	Single.append(FingerTree<V,A> t)
FingerTree<V,A>	MakeTree.deep(Digit<V,A> prefix, FingerTree<V, Node<V,A>> middle, Digit<V,A> suffix)	Constructs a deep tree.
FingerTree<V,A>	MakeTree.deep(V v, Digit<V,A> prefix, FingerTree<V, Node<V,A>> middle, Digit<V,A> suffix)	Constructs a deep tree with the given annotation value.

Method parameters in fj.data.fingertrees with type arguments of type FingerTree

Modifier and Type	Method	Description
final <B> B	FingerTree.uncons(B nil, F2<A, FingerTree<V,A>, B> cons)	Performs a reduction on this finger tree using the given arguments.