Uses of Interface
org.jhotdraw8.icollection.impl.redblack.RedBlackTree
Packages that use RedBlackTree
-
Uses of RedBlackTree in org.jhotdraw8.icollection.impl.redblack
Classes in org.jhotdraw8.icollection.impl.redblack that implement RedBlackTreeModifier and TypeClassDescriptionfinal classEmpty<K,V> The empty tree node.final classNode<K,V> A non-empty tree node.Methods in org.jhotdraw8.icollection.impl.redblack that return RedBlackTreeModifier and TypeMethodDescriptionEmpty.ceiling(K e, @NonNull Comparator<? super K> comparator) Node.ceiling(K value, @NonNull Comparator<? super K> comparator) RedBlackTree.ceiling(K e, @NonNull Comparator<? super K> comparator) Returns the leastNodein this tree greater than or equal to the given element, orEmptyif there is no such element.default RedBlackTree<K, V> RedBlackTree.delete(K key, Comparator<? super K> comparator) Deletes a value from this RedBlackTree.static <K,V> RedBlackTree <K, V> RedBlackTree.empty()Empty.find(K key, Comparator<? super K> comparator) Node.find(K key, Comparator<? super K> comparator) RedBlackTree.find(K key, Comparator<? super K> comparator) Finds the value stored in this tree, if exists, by applying the underlying comparator to the tree elements and the given element.Empty.floor(K e, @NonNull Comparator<? super K> comparator) Node.floor(K value, @NonNull Comparator<? super K> comparator) RedBlackTree.floor(K e, @NonNull Comparator<? super K> comparator) Returns the greatestNodein this tree less than or equal to the given element, orEmptyif there is no such element.Empty.higher(K e, @NonNull Comparator<? super K> comparator) Node.higher(K value, @NonNull Comparator<? super K> comparator) RedBlackTree.higher(K e, @NonNull Comparator<? super K> comparator) Returns the leastNodein this tree strictly greater than the given element, orEmptyif there is no such element.default RedBlackTree<K, V> RedBlackTree.insert(K key, V value, Comparator<? super K> comparator) Inserts a new value into this tree.Empty.left()Node.left()RedBlackTree.left()Returns the left child if this is a non-empty node, otherwise throws.Empty.lower(K e, @NonNull Comparator<? super K> comparator) Node.lower(K value, @NonNull Comparator<? super K> comparator) RedBlackTree.lower(K e, @NonNull Comparator<? super K> comparator) Returns the greatestNodein this tree strictly less than the given element, orEmptyif there is no such element.default @NonNull RedBlackTree<K, V> RedBlackTree.max()Returns the maximum element of this tree according to the underlying comparator.default @NonNull RedBlackTree<K, V> RedBlackTree.min()Returns the minimum element of this tree according to the underlying comparator.static <K,V> RedBlackTree <K, V> RedBlackTree.of(@NonNull Comparator<? super K> comparator, K... keys) static <K,V> RedBlackTree <K, V> RedBlackTree.of(@NonNull Comparator<? super K> comparator, K key, V value) static <K,V> RedBlackTree <K, V> RedBlackTree.ofAll(@NonNull Comparator<? super K> comparator, Iterable<? extends K> keys) Empty.orElse(RedBlackTree<K, V> other) Node.orElse(RedBlackTree<K, V> other) RedBlackTree.orElse(RedBlackTree<K, V> other) Returns thisRedBlackTreeif it is nonempty, otherwise return the alternative.Empty.right()Node.right()RedBlackTree.right()Returns the right child if this is a non-empty node, otherwise throws.Methods in org.jhotdraw8.icollection.impl.redblack with parameters of type RedBlackTreeModifier and TypeMethodDescriptiondefault booleanRedBlackTree.equals(@NonNull RedBlackTree<K, V> tree) Returns true if the given tree has the same size and the same elements in the same sequence as this tree.Empty.orElse(RedBlackTree<K, V> other) Node.orElse(RedBlackTree<K, V> other) RedBlackTree.orElse(RedBlackTree<K, V> other) Returns thisRedBlackTreeif it is nonempty, otherwise return the alternative.