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

Packages that use Tree

com.github.andrewoma.dexx.collection.internal.redblack

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

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

interface	BlackTree<K,V>
interface	RedTree<K,V>

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

class	AbstractDerivedKeyTree<K,V>
class	AbstractTree<K,V>

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

Tree<K,V>	RedBlackTree.append(Tree<K,V> tl, Tree<K,V> tr)
Tree<K,V>	Tree.black()
<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)
Tree<K,V>	RedBlackTree.delete(Tree<K,V> tree, K k)
Tree<K,V>	RedBlackTree.drop(Tree<K,V> tree, int n)
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)
Tree<K,V>	RedBlackTree.range(Tree<K,V> tree, K from, boolean fromInclusive, K until, boolean untilInclusive)
Tree<K,V>	Tree.red()
<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)
Tree<K,V>	RedBlackTree.take(Tree<K,V> tree, int n)
Tree<K,V>	RedBlackTree.until(Tree<K,V> tree, K key, boolean inclusive)
Tree<K,V>	RedBlackTree.update(Tree<K,V> tree, K k, V v, boolean overwrite)

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

Tree<K,V>	RedBlackTree.append(Tree<K,V> tl, Tree<K,V> tr)
Tree<K,V>	RedBlackTree.append(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>	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>	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)
<K,V> Tree<K,V>	TreeFactory.black(K key, V value, Tree<K,V> left, Tree<K,V> right)
boolean	RedBlackTree.contains(Tree<K,V> tree, K x)
static int	RedBlackTree.count(Tree<?,?> tree)
Tree<K,V>	RedBlackTree.delete(Tree<K,V> tree, K k)
Tree<K,V>	RedBlackTree.drop(Tree<K,V> tree, int n)
<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)
boolean	RedBlackTree.isEmpty(Tree<K,V> tree)
Iterator<Pair<K,V>>	RedBlackTree.iterator(Tree<K,V> tree)
Iterator<K>	RedBlackTree.keysIterator(Tree<K,V> tree)
Tree<K,V>	RedBlackTree.lookup(Tree<K,V> tree, K x)
Tree<K,V>	RedBlackTree.range(Tree<K,V> tree, K from, boolean fromInclusive, K until, boolean untilInclusive)
<K,V> Tree<K,V>	DefaultTreeFactory.red(K key, V value, Tree<K,V> left, Tree<K,V> right)
<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>	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)
<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)
Tree<K,V>	RedBlackTree.take(Tree<K,V> tree, int n)
Tree<K,V>	RedBlackTree.until(Tree<K,V> tree, K key, boolean inclusive)
Tree<K,V>	RedBlackTree.update(Tree<K,V> tree, K k, V v, boolean overwrite)
Iterator<V>	RedBlackTree.valuesIterator(Tree<K,V> tree)

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

AbstractDerivedKeyTree(Tree<K,V> left, Tree<K,V> right, V value)

AbstractDerivedKeyTree(Tree<K,V> left, Tree<K,V> right, V value)

AbstractTree(Tree<K,V> left, Tree<K,V> right, V value)

AbstractTree(Tree<K,V> left, Tree<K,V> right, V value)