public class RedBlackList<T extends java.lang.Comparable<T>> extends SimpleRedBlackTree<T,RedBlackList.Node> implements java.util.List<T>
Created by covers1624 on 16/5/21.
| Modifier and Type | Class and Description |
|---|---|
class |
RedBlackList.Node |
ComparableRedBlackTree.ComparableEntriesBaseRedBlackTree.Entriescount| Constructor and Description |
|---|
RedBlackList() |
| Modifier and Type | Method and Description |
|---|---|
void |
add(int index,
T element) |
boolean |
addAll(int index,
java.util.Collection<? extends T> c) |
T |
get(int index) |
static <N extends RedBlackNode<N>> |
getByIndex(BaseRedBlackTree<N> tree,
int index,
Object2IntFunction<N> countGetter) |
static <N extends RedBlackNode<N>> |
indexOf(BaseRedBlackTree<N> tree,
N node,
Object2IntFunction<N> countGetter) |
int |
indexOf(java.lang.Object o) |
int |
indexOf(@Nullable RedBlackList.Node node) |
int |
lastIndexOf(java.lang.Object o) |
java.util.ListIterator<T> |
listIterator() |
java.util.ListIterator<T> |
listIterator(int index) |
protected RedBlackList.Node |
newNode(T value) |
RedBlackList.Node |
nodeAt(int index) |
T |
remove(int index) |
T |
set(int index,
T element) |
java.util.List<T> |
subList(int fromIndex,
int toIndex) |
add, buildFromValues, contains, find, getValue, removeclosest, insertRange, insertRangeAt, makeEntriesCollection, orderConsistencyCheckaddAll, clear, containsAll, isEmpty, iterator, 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 RedBlackList.Node newNode(T value)
newNode in class CollectionRedBlackTree<T extends java.lang.Comparable<T>,RedBlackList.Node>public RedBlackList.Node nodeAt(int index)
public int indexOf(@Nullable
@Nullable RedBlackList.Node node)
public T get(int index)
public void add(int index,
T element)
public T remove(int index)
public int indexOf(java.lang.Object o)
public boolean addAll(int index,
java.util.Collection<? extends T> c)
public int lastIndexOf(java.lang.Object o)
public java.util.ListIterator<T> listIterator()
public java.util.ListIterator<T> listIterator(int index)
public java.util.List<T> subList(int fromIndex, int toIndex)
public static <N extends RedBlackNode<N>> N getByIndex(BaseRedBlackTree<N> tree, int index, Object2IntFunction<N> countGetter)
public static <N extends RedBlackNode<N>> int indexOf(BaseRedBlackTree<N> tree, @Nullable N node, Object2IntFunction<N> countGetter)