Uses of Class
com.tangosol.util.SafeSortedMap.EntryNode

Packages that use SafeSortedMap.EntryNode

Package	Description
com.tangosol.util	Contains various generic utilities.

Uses of SafeSortedMap.EntryNode in com.tangosol.util

Subclasses of SafeSortedMap.EntryNode in com.tangosol.util

Modifier and Type	Class and Description
protected static class	SafeSortedMap.BaseEntryNode BaseEntryNode is a synthetic EntryNode that serves as the "head" of the base entry list.

Fields in com.tangosol.util declared as SafeSortedMap.EntryNode

Modifier and Type	Field and Description
protected SafeSortedMap.EntryNode	SafeSortedMap.SkipNode.m_nodeEntry The EntryNode indexed by this node in the lattice.
protected SafeSortedMap.EntryNode	SafeSortedMap.EntryNode.m_nodeNext The next SkipNode in the list.
protected SafeSortedMap.EntryNode	SafeSortedMap.ViewMap.EntryIterator.m_nodeNext The next node in the iteration, or null.

Methods in com.tangosol.util that return SafeSortedMap.EntryNode

Modifier and Type	Method and Description
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 SafeSortedMap.EntryNode	SafeSortedMap.firstNode() Return the first valid EntryNode, or null if there are none.
protected SafeSortedMap.EntryNode	SafeSortedMap.ViewMap.firstNode() Return the first Node in this ViewMap, or null if there are none.
protected SafeSortedMap.EntryNode	SafeSortedMap.SkipNode.getEntryNode() Return the EntryNode below this one in the skip-list.
protected SafeSortedMap.EntryNode	SafeSortedMap.EntryNode.getNext() Return the next EntryNode in the entry list.
protected SafeSortedMap.EntryNode	SafeSortedMap.lastNode() Return the last valid EntryNode, or null if there are none.
protected SafeSortedMap.EntryNode	SafeSortedMap.ViewMap.lastNode() Return the last SkipNode in this ViewMap, or null if there are none.

Methods in com.tangosol.util with parameters of type SafeSortedMap.EntryNode

Modifier and Type	Method and Description
void	SafeSortedMap.EntryNode.helpDelete(SafeSortedMap.EntryNode nodePrev, SafeSortedMap.EntryNode nodeNext) Called when a deleted EntryNode is encountered during a map traversal to help the deletion process complete.
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.
boolean	SafeSortedMap.EntryNode.markForDelete(SafeSortedMap.EntryNode nodeNext) Attempt to mark this EntryNode for deletion by appending a delete marker to follow this EntryNode, assuming that the expected nex EntryNode is the next.
protected void	SafeSortedMap.EntryNode.setNext(SafeSortedMap.EntryNode nodeNext) Set the next EntryNode in the entry list.

Constructors in com.tangosol.util with parameters of type SafeSortedMap.EntryNode

Constructor and Description
EntryNode(Object oKey, Object oValue, SafeSortedMap.EntryNode nodeNext) Construct an EntryNode for the specified key, value and next node.
IndexNode(int nLevel, SafeSortedMap.IndexNode nodeBelow, SafeSortedMap.EntryNode nodeEntry) Create a new IndexNode for the specified index-level.
SkipNode(SafeSortedMap.SkipNode nodeBelow, SafeSortedMap.EntryNode nodeEntry) Construct a SkipNode according to the specified parameters.