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