| Package | Description |
|---|---|
| net.lecousin.framework.collections.sort |
Sorted collections.
|
| Modifier and Type | Method and Description |
|---|---|
RedBlackTreeInteger.Node<T> |
RedBlackTreeInteger.get(int value)
Returns the node associated to the given key, or null if no such key exists.
|
RedBlackTreeInteger.Node<T> |
RedBlackTreeInteger.getMax() |
RedBlackTreeInteger.Node<T> |
RedBlackTreeInteger.getMin() |
RedBlackTreeInteger.Node<T> |
RedBlackTreeInteger.getNext(int value)
Returns the node containing the key just before the given key.
|
RedBlackTreeInteger.Node<T> |
RedBlackTreeInteger.getNext(RedBlackTreeInteger.Node<T> node)
Returns the node containing the key just before the key of the given node.
|
RedBlackTreeInteger.Node<T> |
RedBlackTreeInteger.getPrevious(int value)
Returns the node containing the key just before the given key.
|
RedBlackTreeInteger.Node<T> |
RedBlackTreeInteger.getPrevious(RedBlackTreeInteger.Node<T> node)
Returns the node containing the key just before the key of the given node.
|
RedBlackTreeInteger.Node<T> |
RedBlackTreeInteger.searchNearestHigher(int value,
boolean acceptEquals)
Returns the node containing the lowest value strictly higher than the given one.
|
RedBlackTreeInteger.Node<T> |
RedBlackTreeInteger.searchNearestLower(int value,
boolean acceptEquals)
Returns the node containing the highest value strictly lower than the given one.
|
| Modifier and Type | Method and Description |
|---|---|
Iterator<RedBlackTreeInteger.Node<T>> |
RedBlackTreeInteger.nodeIterator() |
Iterator<RedBlackTreeInteger.Node<T>> |
RedBlackTreeInteger.nodeIteratorOrdered() |
Iterator<RedBlackTreeInteger.Node<T>> |
RedBlackTreeInteger.nodeIteratorReverse() |
| Modifier and Type | Method and Description |
|---|---|
RedBlackTreeInteger.Node<T> |
RedBlackTreeInteger.getNext(RedBlackTreeInteger.Node<T> node)
Returns the node containing the key just before the key of the given node.
|
RedBlackTreeInteger.Node<T> |
RedBlackTreeInteger.getPrevious(RedBlackTreeInteger.Node<T> node)
Returns the node containing the key just before the key of the given node.
|
void |
RedBlackTreeInteger.remove(RedBlackTreeInteger.Node<T> node)
Remove the given node.
|
Copyright © 2019. All rights reserved.