Class FingerTree<T,S>

java.lang.Object

org.reactfx.util.FingerTree<T,S>

Direct Known Subclasses:

FingerTree.NonEmptyFingerTree

public abstract class FingerTree<T,S>
extends Object

Nested Class Summary

Nested Classes

Modifier and Type	Class	Description
static class	FingerTree.NonEmptyFingerTree<T,S>

Method Summary

Modifier and Type	Method	Description
FingerTree.NonEmptyFingerTree<T,S>	append(T data)
abstract List<T>	asList()	Returns a list view of this tree.
abstract Either<FingerTree<T,S>, FingerTree.NonEmptyFingerTree<T,S>>	caseEmpty()
static <T,S> FingerTree<T,S>	empty(ToSemigroup<? super T, S> statisticsProvider)
abstract <R> R	fold(R acc, BiFunction<? super R, ? super T, ? extends R> reduction)
<R> R	foldBetween(R acc, BiFunction<? super R, ? super T, ? extends R> reduction, int startLeaf, int endLeaf)
<R> R	foldBetween(R acc, BiFunction<? super R, ? super T, ? extends R> reduction, ToIntFunction<? super S> metric, int startPosition, int endPosition, TetraFunction<? super R, ? super T, Integer, Integer, ? extends R> rangeReduction)
Tuple2<T,BiIndex>	get(ToIntFunction<? super S> metric, int index)
<E> E	get(ToIntFunction<? super S> metric, int index, BiFunction<? super T, Integer, ? extends E> leafAccessor)
abstract int	getDepth()
T	getLeaf(int index)
abstract int	getLeafCount()
S	getSummary(S whenEmpty)
Optional<S>	getSummaryBetween(int startLeaf, int endLeaf)
Optional<S>	getSummaryBetween(ToIntFunction<? super S> metric, int startPosition, int endPosition, TriFunction<? super T, Integer, Integer, ? extends S> subSummary)
abstract Optional<S>	getSummaryOpt()
FingerTree<T,S>	insertLeaf(int position, T data)
final boolean	isEmpty()
abstract FingerTree<T,S>	join(FingerTree<T,S> rightTree)
BiIndex	locate(BiFunction<? super S, Integer, Either<Integer,Integer>> navigate, int position)
BiIndex	locateProgressively(ToIntFunction<? super S> metric, int position)
BiIndex	locateRegressively(ToIntFunction<? super S> metric, int position)
static <T> FingerTree<T,Void>	mkTree(List<? extends T> items)
static <T,S> FingerTree<T,S>	mkTree(List<? extends T> items, ToSemigroup<? super T, S> summaryProvider)
FingerTree.NonEmptyFingerTree<T,S>	prepend(T data)
FingerTree<T,S>	removeLeafs(int fromLeaf, int toLeaf)
Tuple2<FingerTree<T,S>, FingerTree<T,S>>	split(int beforeLeaf)
FingerTree.NonEmptyFingerTree<T,S>	updateLeaf(int index, T data)

Methods inherited from class Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Method Details

empty

public static <T,S> FingerTree<T,S> empty(ToSemigroup<? super T, S> statisticsProvider)

mkTree

public static <T> FingerTree<T,Void> mkTree(List<? extends T> items)

mkTree

public static <T,S> FingerTree<T,S> mkTree(List<? extends T> items,
 ToSemigroup<? super T, S> summaryProvider)

getDepth

public abstract int getDepth()

getLeafCount

public abstract int getLeafCount()

getSummaryOpt

public abstract Optional<S> getSummaryOpt()

caseEmpty

public abstract Either<FingerTree<T,S>, FingerTree.NonEmptyFingerTree<T,S>> caseEmpty()

isEmpty

public final boolean isEmpty()

getSummary

public S getSummary(S whenEmpty)

getLeaf

public T getLeaf(int index)

get

public Tuple2<T,BiIndex> get(ToIntFunction<? super S> metric,
 int index)

get

public <E> E get(ToIntFunction<? super S> metric,
 int index,
 BiFunction<? super T, Integer, ? extends E> leafAccessor)

updateLeaf

public FingerTree.NonEmptyFingerTree<T,S> updateLeaf(int index,
 T data)

locate

public BiIndex locate(BiFunction<? super S, Integer, Either<Integer,Integer>> navigate,
 int position)

locateProgressively

public BiIndex locateProgressively(ToIntFunction<? super S> metric,
 int position)

locateRegressively

public BiIndex locateRegressively(ToIntFunction<? super S> metric,
 int position)

fold

public abstract <R> R fold(R acc,
 BiFunction<? super R, ? super T, ? extends R> reduction)

foldBetween

public <R> R foldBetween(R acc,
 BiFunction<? super R, ? super T, ? extends R> reduction,
 int startLeaf,
 int endLeaf)

foldBetween

public <R> R foldBetween(R acc,
 BiFunction<? super R, ? super T, ? extends R> reduction,
 ToIntFunction<? super S> metric,
 int startPosition,
 int endPosition,
 TetraFunction<? super R, ? super T, Integer, Integer, ? extends R> rangeReduction)

getSummaryBetween

public Optional<S> getSummaryBetween(int startLeaf,
 int endLeaf)

getSummaryBetween

public Optional<S> getSummaryBetween(ToIntFunction<? super S> metric,
 int startPosition,
 int endPosition,
 TriFunction<? super T, Integer, Integer, ? extends S> subSummary)

split

public Tuple2<FingerTree<T,S>, FingerTree<T,S>> split(int beforeLeaf)

removeLeafs

public FingerTree<T,S> removeLeafs(int fromLeaf,
 int toLeaf)

insertLeaf

public FingerTree<T,S> insertLeaf(int position,
 T data)

join

public abstract FingerTree<T,S> join(FingerTree<T,S> rightTree)

append

public FingerTree.NonEmptyFingerTree<T,S> append(T data)

prepend

public FingerTree.NonEmptyFingerTree<T,S> prepend(T data)

asList

public abstract List<T> asList()

Returns a list view of this tree. Complexity of operations on the returned list:

• size(): O(1);
• get: O(log(n));
• iteration: O(n) in either direction, with O(log(n)) total allocations;
• subList: O(log(n));
• iterative subList, i.e. calling subList on the result of previous subList, up to n times: O(n).