ReactFX 2.0-M5 · org.reactfx.util.FingerTree · APIdia, the JavaDoc alternative

Modifier and Type	Class and Description
private static class	FingerTree.Branch<T, S>
private static class	FingerTree.Empty<T, S>
private static class	FingerTree.Leaf<T, S>
public abstract static class	FingerTree.NonEmptyFingerTree<T, S>

Modifier and Type	Field and Description
pack-priv final ToSemigroup<? super T, S>	semigroup

Access	Constructor and Description
private	FingerTree(ToSemigroup<? super T, S> semigroup)

Method Summary

Modifier and Type	Method and Description
public FingerTree.NonEmptyFingerTree<T, S>	append(T data)
public abstract List<T>	asList() Returns a list view of this tree.
private static <T, S> FingerTree.Branch<T, S>	branch(FingerTree.NonEmptyFingerTree<T, S> left, FingerTree.NonEmptyFingerTree<T, S> right)
private static <T, S> FingerTree.Branch<T, S>	branch(FingerTree.NonEmptyFingerTree<T, S> left, FingerTree.NonEmptyFingerTree<T, S> middle, FingerTree.NonEmptyFingerTree<T, S> right)
private static <T, S> FingerTree.Branch<T, S>	branch(LL.Cons<FingerTree.NonEmptyFingerTree<T, S>> children)
public abstract Either<FingerTree<T, S>, FingerTree.NonEmptyFingerTree<T, S>>	caseEmpty()
private static <T, S> FingerTree<T, S>	concat(LL.Cons<? extends FingerTree<T, S>> nodes)
public static <T, S> FingerTree<T, S>	empty(ToSemigroup<? super T, S> statisticsProvider)
pack-priv FingerTree.Empty<T, S>	empty()
public abstract <R> R	fold(R acc, BiFunction<? super R, ? super T, ? extends R> reduction)
public <R> R	foldBetween(R acc, BiFunction<? super R, ? super T, ? extends R> reduction, int startLeaf, int endLeaf)
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)
pack-priv abstract <R> R	foldBetween0(R acc, BiFunction<? super R, ? super T, ? extends R> reduction, int startLeaf, int endLeaf)
pack-priv abstract <R> R	foldBetween0(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)
public Tuple2<T, BiIndex>	get(ToIntFunction<? super S> metric, int index)
public <E> E	get(ToIntFunction<? super S> metric, int index, BiFunction<? super T, Integer, ? extends E> leafAccessor)
pack-priv abstract T	getData()
public abstract int	getDepth()
public T	getLeaf(int index)
pack-priv abstract T	getLeaf0(int index)
public abstract int	getLeafCount()
public S	getSummary(S whenEmpty)
public Optional<S>	getSummaryBetween(int startLeaf, int endLeaf)
public Optional<S>	getSummaryBetween(ToIntFunction<? super S> metric, int startPosition, int endPosition, TriFunction<? super T, Integer, Integer, ? extends S> subSummary)
pack-priv abstract S	getSummaryBetween0(int startLeaf, int endLeaf)
pack-priv abstract S	getSummaryBetween0(ToIntFunction<? super S> metric, int startPosition, int endPosition, TriFunction<? super T, Integer, Integer, ? extends S> subSummary)
public abstract Optional<S>	getSummaryOpt()
public FingerTree<T, S>	insertLeaf(int position, T data)
public final boolean	isEmpty()
public abstract FingerTree<T, S>	join(FingerTree<T, S> rightTree)
pack-priv FingerTree.Leaf<T, S>	leaf(T data)
public BiIndex	locate(BiFunction<? super S, Integer, Either<Integer, Integer>> navigate, int position)
public BiIndex	locateProgressively(ToIntFunction<? super S> metric, int position)
public BiIndex	locateRegressively(ToIntFunction<? super S> metric, int position)
pack-priv final int	measure(ToIntFunction<? super S> metric)
public static <T> FingerTree<T, Void>	mkTree(List<? extends T> items)
public static <T, S> FingerTree<T, S>	mkTree(List<? extends T> items, ToSemigroup<? super T, S> summaryProvider)
public FingerTree.NonEmptyFingerTree<T, S>	prepend(T data)
public FingerTree<T, S>	removeLeafs(int fromLeaf, int toLeaf)
public Tuple2<FingerTree<T, S>, FingerTree<T, S>>	split(int beforeLeaf)
pack-priv abstract Tuple2<FingerTree<T, S>, FingerTree<T, S>>	split0(int beforeLeaf)
public FingerTree.NonEmptyFingerTree<T, S>	updateLeaf(int index, T data)
pack-priv abstract FingerTree.NonEmptyFingerTree<T, S>	updateLeaf0(int index, T data)

Inherited from java.lang.Object:: clone equals finalize getClass hashCode notify notifyAll toString wait wait wait

public abstract Class FingerTree<T, S>

Nested and Inner Type Summary

Field Summary

Constructor Summary

Method Summary