public abstract class ComparableRedBlackTree<T,N extends RedBlackNode<N> & java.lang.Comparable<N>> extends CollectionRedBlackTree<T,N>
Created by covers1624 on 16/5/21.
| Modifier and Type | Class and Description |
|---|---|
protected class |
ComparableRedBlackTree.ComparableEntries |
BaseRedBlackTree.Entriescount| Constructor and Description |
|---|
ComparableRedBlackTree() |
| Modifier and Type | Method and Description |
|---|---|
Object2IntPair<N> |
closest(N node) |
void |
insertRange(java.lang.Iterable<N> nodes) |
void |
insertRangeAt(N loc,
java.lang.Iterable<N> nodes) |
protected BaseRedBlackTree.Entries |
makeEntriesCollection() |
protected void |
orderConsistencyCheck(N left,
N right) |
addAll, clear, containsAll, getValue, isEmpty, iterator, newNode, removeAll, retainAll, size, toArray, toArraybuildFrom, buildFrom, closest, entries, find, getLeftMost, getRightMost, getRoot, insertAt, insertRange, removeRange, replace, setRootclone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitprotected BaseRedBlackTree.Entries makeEntriesCollection()
makeEntriesCollection in class BaseRedBlackTree<N extends RedBlackNode<N> & java.lang.Comparable<N>>public Object2IntPair<N> closest(N node)
protected void orderConsistencyCheck(@Nullable
N left,
@Nullable
N right)
orderConsistencyCheck in class BaseRedBlackTree<N extends RedBlackNode<N> & java.lang.Comparable<N>>public void insertRange(java.lang.Iterable<N> nodes)