Uses of Interface
com.github.andrewoma.dexx.collection.internal.redblack.Tree

Packages that use Tree

Package	Description
com.github.andrewoma.dexx.collection	Dexx collections are a port of Scala's immutable, persistent collection classes to pure Java.
com.github.andrewoma.dexx.collection.internal.redblack

Uses of Tree in com.github.andrewoma.dexx.collection

Fields in com.github.andrewoma.dexx.collection declared as Tree

Modifier and Type	Field	Description
private Tree<K,V>	TreeMap.tree
private Tree<E,E>	TreeSet.tree

Methods in com.github.andrewoma.dexx.collection with parameters of type Tree

Modifier and Type	Method	Description
private Pair<K,V>	TreeMap.toPair(Tree<K,V> tree)

Constructors in com.github.andrewoma.dexx.collection with parameters of type Tree

Constructor	Description
TreeMap(Tree<K,V> tree, RedBlackTree<K,V> redBlackTree)
TreeSet(Tree<E,E> tree, RedBlackTree<E,E> redBlackTree)

Uses of Tree in com.github.andrewoma.dexx.collection.internal.redblack

Subinterfaces of Tree in com.github.andrewoma.dexx.collection.internal.redblack

Modifier and Type	Interface	Description
interface	BlackTree<K,V>
interface	RedTree<K,V>

Classes in com.github.andrewoma.dexx.collection.internal.redblack that implement Tree

Modifier and Type	Class	Description
(package private) class	AbstractDefaultTree<K,V>
class	AbstractDerivedKeyTree<K,V>
class	AbstractTree<K,V>
(package private) class	DefaultBlackTree<K,V>
(package private) class	DefaultRedTree<K,V>
(package private) class	DerivedKeyBlackTree<K,V>
(package private) class	DerivedKeyRedTree<K,V>

Fields in com.github.andrewoma.dexx.collection.internal.redblack declared as Tree

Modifier and Type	Field	Description
private Tree<K,V>	AbstractTree.left
private Tree<K,V>	TreeIterator.next
private Tree<K,V>[]	TreeIterator.path
private Tree<K,V>	AbstractTree.right

Fields in com.github.andrewoma.dexx.collection.internal.redblack with type parameters of type Tree

Modifier and Type	Field	Description
(package private) java.util.List<Tree<K,V>>	Zipper.zipper

Methods in com.github.andrewoma.dexx.collection.internal.redblack that return Tree

Modifier and Type	Method	Description
Tree<K,V>	RedBlackTree.append(Tree<K,V> tl, Tree<K,V> tr)
private Tree<K,V>	RedBlackTree.balance(K x, V xv, Tree<K,V> tl, Tree<K,V> tr)
private Tree<K,V>	RedBlackTree.balanceLeft(boolean isBlack, K z, V zv, Tree<K,V> l, Tree<K,V> d)
private Tree<K,V>	RedBlackTree.balanceRight(boolean isBlack, K x, V xv, Tree<K,V> a, Tree<K,V> r)
private Tree<K,V>	RedBlackTree.balLeft(K x, V xv, Tree<K,V> tl, Tree<K,V> tr)
private Tree<K,V>	RedBlackTree.balRight(K x, V xv, Tree<K,V> tl, Tree<K,V> tr)
Tree<K,V>	DefaultBlackTree.black()
Tree<K,V>	DefaultRedTree.black()
<K,V> Tree<K,V>	DefaultTreeFactory.black(K key, V value, Tree<K,V> left, Tree<K,V> right)
Tree<K,V>	DerivedKeyBlackTree.black()
<K,V> Tree<K,V>	DerivedKeyFactory.black(K key, V value, Tree<K,V> left, Tree<K,V> right)
Tree<K,V>	DerivedKeyRedTree.black()
Tree<K,V>	Tree.black()
<K,V> Tree<K,V>	TreeFactory.black(K key, V value, Tree<K,V> left, Tree<K,V> right)
private Tree<K,V>	RedBlackTree.blacken(Tree<K,V> t)
private Tree<K,V>	RedBlackTree.del(Tree<K,V> tree, K k)
Tree<K,V>	RedBlackTree.delete(Tree<K,V> tree, K k)
private Tree<K,V>	RedBlackTree.delLeft(Tree<K,V> tree, K k)
private Tree<K,V>	RedBlackTree.delRight(Tree<K,V> tree, K k)
private Tree<K,V>	RedBlackTree.doDrop(Tree<K,V> tree, int n)
private Tree<K,V>	RedBlackTree.doFrom(Tree<K,V> tree, K from, boolean inclusive)
private Tree<K,V>	RedBlackTree.doRange(Tree<K,V> tree, K from, boolean fromInclusive, K until, boolean untilInclusive)
private Tree<K,V>	RedBlackTree.doSlice(Tree<K,V> tree, int from, int until)
private Tree<K,V>	RedBlackTree.doTake(Tree<K,V> tree, int n)
private Tree<K,V>	RedBlackTree.doUntil(Tree<K,V> tree, K until, boolean inclusive)
Tree<K,V>	RedBlackTree.drop(Tree<K,V> tree, int n)
private Tree<K,V>	TreeIterator.findNext(Tree<K,V> tree)
Tree<K,V>	RedBlackTree.from(Tree<K,V> tree, K from, boolean inclusive)
Tree<K,V>	AbstractTree.getLeft()
Tree<K,V>	Tree.getLeft()
Tree<K,V>	AbstractTree.getRight()
Tree<K,V>	Tree.getRight()
Tree<K,V>	RedBlackTree.greatest(Tree<K,V> tree)
Tree<K,V>	RedBlackTree.lookup(Tree<K,V> tree, K x)
private Tree<K,V>	RedBlackTree.mkTree(boolean isBlack, K k, V v, Tree<K,V> l, Tree<K,V> r)
private Tree<K,V>	TreeIterator.popPath()
Tree<K,V>	RedBlackTree.range(Tree<K,V> tree, K from, boolean fromInclusive, K until, boolean untilInclusive)
private Tree<K,V>	RedBlackTree.rebalance(Tree<K,V> tree, Tree<K,V> newLeft, Tree<K,V> newRight)
Tree<K,V>	DefaultBlackTree.red()
Tree<K,V>	DefaultRedTree.red()
<K,V> Tree<K,V>	DefaultTreeFactory.red(K key, V value, Tree<K,V> left, Tree<K,V> right)
Tree<K,V>	DerivedKeyBlackTree.red()
<K,V> Tree<K,V>	DerivedKeyFactory.red(K key, V value, Tree<K,V> left, Tree<K,V> right)
Tree<K,V>	DerivedKeyRedTree.red()
Tree<K,V>	Tree.red()
<K,V> Tree<K,V>	TreeFactory.red(K key, V value, Tree<K,V> left, Tree<K,V> right)
Tree<K,V>	RedBlackTree.slice(Tree<K,V> tree, int from, int until)
Tree<K,V>	RedBlackTree.smallest(Tree<K,V> tree)
private Tree<K,V>	RedBlackTree.subl(Tree<K,V> t)
Tree<K,V>	RedBlackTree.take(Tree<K,V> tree, int n)
Tree<K,V>	RedBlackTree.until(Tree<K,V> tree, K key, boolean inclusive)
private Tree<K,V>	RedBlackTree.upd(Tree<K,V> tree, K k, V v, boolean overwrite)
Tree<K,V>	RedBlackTree.update(Tree<K,V> tree, K k, V v, boolean overwrite)
private Tree<K,V>	RedBlackTree.updNth(Tree<K,V> tree, int idx, K k, V v, boolean overwrite)

Methods in com.github.andrewoma.dexx.collection.internal.redblack that return types with arguments of type Tree

Modifier and Type	Method	Description
private java.util.List<Tree<K,V>>	RedBlackTree.findDepth(java.util.List<Tree<K,V>> zipper, int depth)
private java.util.List<Tree<K,V>>	RedBlackTree.unzip(java.util.List<Tree<K,V>> zipper, boolean leftMost)

Methods in com.github.andrewoma.dexx.collection.internal.redblack with parameters of type Tree

Modifier and Type	Method	Description
Tree<K,V>	RedBlackTree.append(Tree<K,V> tl, Tree<K,V> tr)
private Tree<K,V>	RedBlackTree.balance(K x, V xv, Tree<K,V> tl, Tree<K,V> tr)
private Tree<K,V>	RedBlackTree.balanceLeft(boolean isBlack, K z, V zv, Tree<K,V> l, Tree<K,V> d)
private Tree<K,V>	RedBlackTree.balanceRight(boolean isBlack, K x, V xv, Tree<K,V> a, Tree<K,V> r)
private Tree<K,V>	RedBlackTree.balLeft(K x, V xv, Tree<K,V> tl, Tree<K,V> tr)
private Tree<K,V>	RedBlackTree.balRight(K x, V xv, Tree<K,V> tl, Tree<K,V> tr)
<K,V> Tree<K,V>	DefaultTreeFactory.black(K key, V value, Tree<K,V> left, Tree<K,V> right)
<K,V> Tree<K,V>	DerivedKeyFactory.black(K key, V value, Tree<K,V> left, Tree<K,V> right)
<K,V> Tree<K,V>	TreeFactory.black(K key, V value, Tree<K,V> left, Tree<K,V> right)
private Tree<K,V>	RedBlackTree.blacken(Tree<K,V> t)
private Zipper<K,V>	RedBlackTree.compareDepth(Tree<K,V> left, Tree<K,V> right)
boolean	RedBlackTree.contains(Tree<K,V> tree, K x)
static int	RedBlackTree.count(Tree<?,?> tree)
private Tree<K,V>	RedBlackTree.del(Tree<K,V> tree, K k)
Tree<K,V>	RedBlackTree.delete(Tree<K,V> tree, K k)
private Tree<K,V>	RedBlackTree.delLeft(Tree<K,V> tree, K k)
private Tree<K,V>	RedBlackTree.delRight(Tree<K,V> tree, K k)
private Tree<K,V>	RedBlackTree.doDrop(Tree<K,V> tree, int n)
private Tree<K,V>	RedBlackTree.doFrom(Tree<K,V> tree, K from, boolean inclusive)
private Tree<K,V>	RedBlackTree.doRange(Tree<K,V> tree, K from, boolean fromInclusive, K until, boolean untilInclusive)
private Tree<K,V>	RedBlackTree.doSlice(Tree<K,V> tree, int from, int until)
private Tree<K,V>	RedBlackTree.doTake(Tree<K,V> tree, int n)
private Tree<K,V>	RedBlackTree.doUntil(Tree<K,V> tree, K until, boolean inclusive)
Tree<K,V>	RedBlackTree.drop(Tree<K,V> tree, int n)
private Tree<K,V>	TreeIterator.findNext(Tree<K,V> tree)
<U> void	RedBlackTree.forEach(Tree<K,V> tree, Function<Pair<K,V>,U> f)
Tree<K,V>	RedBlackTree.from(Tree<K,V> tree, K from, boolean inclusive)
V	RedBlackTree.get(Tree<K,V> tree, K x)
Tree<K,V>	RedBlackTree.greatest(Tree<K,V> tree)
private boolean	RedBlackTree.isBlackTree(Tree<?,?> tree)
boolean	RedBlackTree.isEmpty(Tree<K,V> tree)
private boolean	RedBlackTree.isRedTree(Tree<?,?> tree)
java.util.Iterator<Pair<K,V>>	RedBlackTree.iterator(Tree<K,V> tree)
java.util.Iterator<K>	RedBlackTree.keysIterator(Tree<K,V> tree)
Tree<K,V>	RedBlackTree.lookup(Tree<K,V> tree, K x)
private Tree<K,V>	RedBlackTree.mkTree(boolean isBlack, K k, V v, Tree<K,V> l, Tree<K,V> r)
protected Pair<K,V>	EntriesIterator.nextResult(Tree<K,V> tree)
protected K	KeysIterator.nextResult(Tree<K,V> tree)
protected abstract R	TreeIterator.nextResult(Tree<K,V> tree)
protected V	ValuesIterator.nextResult(Tree<K,V> tree)
private void	TreeIterator.pushPath(Tree<K,V> tree)
Tree<K,V>	RedBlackTree.range(Tree<K,V> tree, K from, boolean fromInclusive, K until, boolean untilInclusive)
private Tree<K,V>	RedBlackTree.rebalance(Tree<K,V> tree, Tree<K,V> newLeft, Tree<K,V> newRight)
<K,V> Tree<K,V>	DefaultTreeFactory.red(K key, V value, Tree<K,V> left, Tree<K,V> right)
<K,V> Tree<K,V>	DerivedKeyFactory.red(K key, V value, Tree<K,V> left, Tree<K,V> right)
<K,V> Tree<K,V>	TreeFactory.red(K key, V value, Tree<K,V> left, Tree<K,V> right)
Tree<K,V>	RedBlackTree.slice(Tree<K,V> tree, int from, int until)
Tree<K,V>	RedBlackTree.smallest(Tree<K,V> tree)
private Tree<K,V>	RedBlackTree.subl(Tree<K,V> t)
Tree<K,V>	RedBlackTree.take(Tree<K,V> tree, int n)
Tree<K,V>	RedBlackTree.until(Tree<K,V> tree, K key, boolean inclusive)
private Zipper<K,V>	RedBlackTree.unzipBoth(Tree<K,V> left, Tree<K,V> right, java.util.List<Tree<K,V>> leftZipper, java.util.List<Tree<K,V>> rightZipper, int smallerDepth)
private Tree<K,V>	RedBlackTree.upd(Tree<K,V> tree, K k, V v, boolean overwrite)
Tree<K,V>	RedBlackTree.update(Tree<K,V> tree, K k, V v, boolean overwrite)
private Tree<K,V>	RedBlackTree.updNth(Tree<K,V> tree, int idx, K k, V v, boolean overwrite)
java.util.Iterator<V>	RedBlackTree.valuesIterator(Tree<K,V> tree)

Method parameters in com.github.andrewoma.dexx.collection.internal.redblack with type arguments of type Tree

Modifier and Type	Method	Description
private java.util.List<Tree<K,V>>	RedBlackTree.findDepth(java.util.List<Tree<K,V>> zipper, int depth)
private java.util.List<Tree<K,V>>	RedBlackTree.unzip(java.util.List<Tree<K,V>> zipper, boolean leftMost)
private Zipper<K,V>	RedBlackTree.unzipBoth(Tree<K,V> left, Tree<K,V> right, java.util.List<Tree<K,V>> leftZipper, java.util.List<Tree<K,V>> rightZipper, int smallerDepth)

Constructors in com.github.andrewoma.dexx.collection.internal.redblack with parameters of type Tree

Constructor	Description
AbstractDefaultTree(K key, V value, Tree<K,V> left, Tree<K,V> right)
AbstractDerivedKeyTree(Tree<K,V> left, Tree<K,V> right, V value)
AbstractTree(Tree<K,V> left, Tree<K,V> right, V value)
DefaultBlackTree(K key, V value, Tree<K,V> left, Tree<K,V> right)
DefaultRedTree(K key, V value, Tree<K,V> left, Tree<K,V> right)
DerivedKeyBlackTree(Tree<K,V> left, Tree<K,V> right, V value)
DerivedKeyRedTree(Tree<K,V> left, Tree<K,V> right, V value)
EntriesIterator(Tree<K,V> tree)
KeysIterator(Tree<K,V> tree, KeyFunction<K,V> kf)
TreeIterator(Tree<K,V> tree)
ValuesIterator(Tree<K,V> tree)

Constructor parameters in com.github.andrewoma.dexx.collection.internal.redblack with type arguments of type Tree

Constructor	Description
Zipper(java.util.List<Tree<K,V>> zipper, boolean levelled, boolean leftMost, int smallerDepth)