| Package | Description |
|---|---|
| com.tangosol.util |
Contains various generic utilities.
|
| Modifier and Type | Field and Description |
|---|---|
protected SafeSortedMap.IndexNode |
SafeSortedMap.m_nodeTop
The top index node.
|
| Modifier and Type | Method and Description |
|---|---|
protected SafeSortedMap.IndexNode |
SafeSortedMap.getTopNode()
Return the top index node in the map.
|
| Modifier and Type | Method and Description |
|---|---|
protected boolean |
SafeSortedMap.casTopNode(SafeSortedMap.IndexNode nodeTopAssume,
SafeSortedMap.IndexNode nodeTopNew)
Atomically set specified IndexNode to the top node iff the current top
node is the expected top node.
|
protected SafeSortedMap.EntryNode |
SafeSortedMap.findNearest(SafeSortedMap.IndexNode nodeTop,
Object oKey,
int nMode,
boolean fFixLinks)
Return the SkipNode closest to the specified key, or null.
|
protected SafeSortedMap.EntryNode |
SafeSortedMap.findNearestIndexedEntry(SafeSortedMap.IndexNode nodeTop,
Object oKey,
int nMode)
Return the EntryNode nearest to the specified key according to the
specified search mode, or the synthetic base node if there is none.
|
protected SafeSortedMap.EntryNode |
SafeSortedMap.findPredecessor(SafeSortedMap.IndexNode nodeTop,
Object oKey)
Return an EntryNode that compares strictly less than the specified key, or
the synthetic base node if there is none.
|
protected void |
SafeSortedMap.insertIndex(SafeSortedMap.IndexNode nodeTop,
SafeSortedMap.EntryNode nodeNew,
int nLevelThis)
Insert a index nodes for the specified newly inserted EntryNode, up to a
random index-level.
|
protected void |
SafeSortedMap.setTopNode(SafeSortedMap.IndexNode nodeTop)
Set the top index node in the map.
|
| Constructor and Description |
|---|
IndexNode(int nLevel,
SafeSortedMap.IndexNode nodeBelow,
SafeSortedMap.EntryNode nodeEntry)
Create a new IndexNode for the specified index-level.
|