Uses of Interface
io.vavr.collection.RedBlackTree

Packages that use RedBlackTree

Package	Description
io.vavr.collection	Purely functional collections based on Traversable.

Uses of RedBlackTree in io.vavr.collection

Classes in io.vavr.collection that implement RedBlackTree

Modifier and Type	Class	Description
static final class	RedBlackTreeModule.Empty<T>	The empty tree node.
static final class	RedBlackTreeModule.Node<T>	A non-empty tree node.

Fields in io.vavr.collection declared as RedBlackTree

Modifier and Type	Field	Description
private final RedBlackTree<Tuple2<K,V>>	TreeMap.entries
(package private) final RedBlackTree<T>	RedBlackTreeModule.Node.left
(package private) final RedBlackTree<T>	RedBlackTreeModule.Node.right
private final RedBlackTree<T>	TreeSet.tree

Methods in io.vavr.collection that return RedBlackTree

Modifier and Type	Method	Description
(package private) static <T> RedBlackTree<T>	RedBlackTreeModule.Node.color(RedBlackTree<T> tree, RedBlackTree.Color color)
default RedBlackTree<T>	RedBlackTree.delete(T value)	Deletes a value from this RedBlackTree.
default RedBlackTree<T>	RedBlackTree.difference(RedBlackTree<T> tree)
static <T> RedBlackTree<T>	RedBlackTree.empty(Comparator<? super T> comparator)
RedBlackTree<T>	RedBlackTree.emptyInstance()	Returns the empty instance of this RedBlackTree.
default RedBlackTree<T>	RedBlackTree.insert(T value)	Inserts a new value into this tree.
default RedBlackTree<T>	RedBlackTree.intersection(RedBlackTree<T> tree)
(package private) static <T> RedBlackTree<T>	RedBlackTreeModule.Node.join(RedBlackTree<T> t1, T value, RedBlackTree<T> t2)
RedBlackTree<T>	RedBlackTree.left()	Returns the left child if this is a non-empty node, otherwise throws.
RedBlackTree<T>	RedBlackTreeModule.Empty.left()
RedBlackTree<T>	RedBlackTreeModule.Node.left()
(package private) static <T> RedBlackTree<T>	RedBlackTreeModule.Node.merge(RedBlackTree<T> t1, RedBlackTree<T> t2)
static <T> RedBlackTree<T>	RedBlackTree.of(Comparator<? super T> comparator, T value)
static <T> RedBlackTree<T>	RedBlackTree.of(Comparator<? super T> comparator, T... values)
static <T> RedBlackTree<T>	RedBlackTree.ofAll(Comparator<? super T> comparator, Iterable<? extends T> values)
RedBlackTree<T>	RedBlackTree.right()	Returns the right child if this is a non-empty node, otherwise throws.
RedBlackTree<T>	RedBlackTreeModule.Empty.right()
RedBlackTree<T>	RedBlackTreeModule.Node.right()
default RedBlackTree<T>	RedBlackTree.union(RedBlackTree<T> tree)	Adds all of the elements of the given tree to this tree, if not already present.

Methods in io.vavr.collection that return types with arguments of type RedBlackTree

Modifier and Type	Method	Description
private static <T> Tuple2<? extends RedBlackTree<T>, Boolean>	RedBlackTreeModule.Node.blackify(RedBlackTree<T> tree)
(package private) static <T> Tuple2<? extends RedBlackTree<T>, Boolean>	RedBlackTreeModule.Node.delete(RedBlackTree<T> tree, T value)
private static <T> Tuple3<? extends RedBlackTree<T>, Boolean, T>	RedBlackTreeModule.Node.deleteMin(RedBlackTreeModule.Node<T> node)
(package private) static <T> Tuple2<RedBlackTree<T>, RedBlackTree<T>>	RedBlackTreeModule.Node.split(RedBlackTree<T> tree, T value)
(package private) static <T> Tuple2<RedBlackTree<T>, RedBlackTree<T>>	RedBlackTreeModule.Node.split(RedBlackTree<T> tree, T value)

Methods in io.vavr.collection with parameters of type RedBlackTree

Modifier and Type	Method	Description
private static <T> RedBlackTreeModule.Node<T>	RedBlackTreeModule.Node.balanceLeft(RedBlackTree.Color color, int blackHeight, RedBlackTree<T> left, T value, RedBlackTree<T> right, RedBlackTreeModule.Empty<T> empty)
private static <T> RedBlackTreeModule.Node<T>	RedBlackTreeModule.Node.balanceRight(RedBlackTree.Color color, int blackHeight, RedBlackTree<T> left, T value, RedBlackTree<T> right, RedBlackTreeModule.Empty<T> empty)
private static <T> Tuple2<? extends RedBlackTree<T>, Boolean>	RedBlackTreeModule.Node.blackify(RedBlackTree<T> tree)
(package private) static <T> RedBlackTree<T>	RedBlackTreeModule.Node.color(RedBlackTree<T> tree, RedBlackTree.Color color)
(package private) static <T> Tuple2<? extends RedBlackTree<T>, Boolean>	RedBlackTreeModule.Node.delete(RedBlackTree<T> tree, T value)
default RedBlackTree<T>	RedBlackTree.difference(RedBlackTree<T> tree)
(package private) static <T> RedBlackTreeModule.Node<T>	RedBlackTreeModule.Node.insert(RedBlackTree<T> tree, T value)
default RedBlackTree<T>	RedBlackTree.intersection(RedBlackTree<T> tree)
private static boolean	RedBlackTreeModule.Node.isRed(RedBlackTree<?> tree)
(package private) static <T> RedBlackTree<T>	RedBlackTreeModule.Node.join(RedBlackTree<T> t1, T value, RedBlackTree<T> t2)
(package private) static <T> RedBlackTree<T>	RedBlackTreeModule.Node.merge(RedBlackTree<T> t1, RedBlackTree<T> t2)
(package private) static <T> Tuple2<RedBlackTree<T>, RedBlackTree<T>>	RedBlackTreeModule.Node.split(RedBlackTree<T> tree, T value)
private static String	RedBlackTreeModule.Node.toLispString(RedBlackTree<?> tree)
private static <T> Tuple2<RedBlackTreeModule.Node<T>, Boolean>	RedBlackTreeModule.Node.unbalancedLeft(RedBlackTree.Color color, int blackHeight, RedBlackTree<T> left, T value, RedBlackTree<T> right, RedBlackTreeModule.Empty<T> empty)
private static <T> Tuple2<RedBlackTreeModule.Node<T>, Boolean>	RedBlackTreeModule.Node.unbalancedRight(RedBlackTree.Color color, int blackHeight, RedBlackTree<T> left, T value, RedBlackTree<T> right, RedBlackTreeModule.Empty<T> empty)
default RedBlackTree<T>	RedBlackTree.union(RedBlackTree<T> tree)	Adds all of the elements of the given tree to this tree, if not already present.

Constructors in io.vavr.collection with parameters of type RedBlackTree

Modifier	Constructor	Description
(package private)	Node(RedBlackTree.Color color, int blackHeight, RedBlackTree<T> left, T value, RedBlackTree<T> right, RedBlackTreeModule.Empty<T> empty)
private	TreeMap(RedBlackTree<Tuple2<K,V>> entries)
(package private)	TreeSet(RedBlackTree<T> tree)