public abstract class SimpleRedBlackTree<T extends java.lang.Comparable<T>,N extends ContainerNode<T,N>> extends ComparableRedBlackTree<T,N> implements java.util.Collection<T>
Created by covers1624 on 16/5/21.
ComparableRedBlackTree.ComparableEntriesBaseRedBlackTree.Entriescount| Constructor and Description |
|---|
SimpleRedBlackTree() |
| Modifier and Type | Method and Description |
|---|---|
boolean |
add(T t) |
void |
buildFromValues(java.util.List<T> list) |
boolean |
contains(java.lang.Object o) |
N |
find(T value) |
protected T |
getValue(N node) |
boolean |
remove(java.lang.Object o) |
closest, insertRange, insertRangeAt, makeEntriesCollection, orderConsistencyCheckaddAll, clear, containsAll, 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 T getValue(N node)
getValue in class CollectionRedBlackTree<T extends java.lang.Comparable<T>,N extends ContainerNode<T,N>>public void buildFromValues(java.util.List<T> list)
public boolean contains(java.lang.Object o)
public boolean add(T t)