| Package | Description | 
|---|---|
| com.tangosol.util | 
 Contains various generic utilities. 
 | 
| Modifier and Type | Class and Description | 
|---|---|
protected static class  | 
PrimitiveSparseArray.PrimitiveNode
Node mapping long key to Object value. 
 | 
protected static class  | 
SparseArray.ObjectNode<V>
Node mapping long key to Object value. 
 | 
| Modifier and Type | Field and Description | 
|---|---|
protected AbstractSparseArray.Node<V> | 
AbstractSparseArray.Crawler.current  | 
protected AbstractSparseArray.Node<V> | 
AbstractSparseArray.Node.left
The left child of this node. 
 | 
protected AbstractSparseArray.Node<V> | 
AbstractSparseArray.m_head
The first node of the tree (or null if the tree is empty). 
 | 
protected AbstractSparseArray.Node<V> | 
AbstractSparseArray.Node.parent
The parent of this node. 
 | 
protected AbstractSparseArray.Node<V> | 
AbstractSparseArray.Node.right
The right child of this node. 
 | 
| Modifier and Type | Method and Description | 
|---|---|
AbstractSparseArray.Node<V> | 
AbstractSparseArray.Node.clone()
Make a shallow copy of the node and its sub-nodes. 
 | 
protected AbstractSparseArray.Node<V> | 
AbstractSparseArray.Crawler.currentNode()
Returns the current Node in the iteration. 
 | 
protected AbstractSparseArray.Node<V> | 
AbstractSparseArray.doubleRotate(AbstractSparseArray.Node<V> node,
            boolean fLeft)
Double rotate a node in a given direction. 
 | 
protected AbstractSparseArray.Node<V> | 
AbstractSparseArray.find(long lIndex)
Find the specified key and return its node. 
 | 
protected AbstractSparseArray.Node<V> | 
AbstractSparseArray.findInsertionPoint(long lIndex)
Find the point at which a Node with the specified index would be inserted. 
 | 
protected AbstractSparseArray.Node | 
PrimitiveSparseArray.instantiateNode(long lKey,
               long lValue)
Create a new Node with the specified key and value. 
 | 
protected AbstractSparseArray.Node | 
PrimitiveSparseArray.instantiateNode(long lKey,
               Long value)
Factory pattern: create a new Node with the specified key and value. 
 | 
protected AbstractSparseArray.Node<V> | 
SparseArray.instantiateNode(long lKey,
               V oValue)
Factory pattern: create a new Node with the specified key and value. 
 | 
protected abstract AbstractSparseArray.Node<V> | 
AbstractSparseArray.instantiateNode(long lKey,
               V oValue)
Factory pattern: create a new Node with the specified key and value. 
 | 
protected AbstractSparseArray.Node<V> | 
AbstractSparseArray.Crawler.nextNode()
Returns the next Node in the iteration. 
 | 
protected AbstractSparseArray.Node<V> | 
AbstractSparseArray.replace(AbstractSparseArray.Node<V> nodeA,
       AbstractSparseArray.Node<V> nodeB)
Replace one node with another. 
 | 
protected AbstractSparseArray.Node<V> | 
AbstractSparseArray.rotate(AbstractSparseArray.Node<V> node,
      boolean fLeft)
Rotate a node in a given direction. 
 | 
| Modifier and Type | Method and Description | 
|---|---|
protected void | 
AbstractSparseArray.adjustDoubleBalance(AbstractSparseArray.Node<V> node,
                   AbstractSparseArray.Node<V> child,
                   int iBal)
Adjust the balance factor of a node and its descendants prior to a
 a double rotation. 
 | 
protected void | 
AbstractSparseArray.adjustDoubleBalance(AbstractSparseArray.Node<V> node,
                   AbstractSparseArray.Node<V> child,
                   int iBal)
Adjust the balance factor of a node and its descendants prior to a
 a double rotation. 
 | 
protected void | 
AbstractSparseArray.Node.adopt(AbstractSparseArray.Node<V> child,
     boolean fLeft)
Adopt a child node 
 | 
protected void | 
AbstractSparseArray.balancedInsertion(AbstractSparseArray.Node<V> parent,
                 AbstractSparseArray.Node<V> child)
Insert a node into a tree and rebalance. 
 | 
protected void | 
AbstractSparseArray.balancedInsertion(AbstractSparseArray.Node<V> parent,
                 AbstractSparseArray.Node<V> child)
Insert a node into a tree and rebalance. 
 | 
protected void | 
AbstractSparseArray.balancePostRemove(AbstractSparseArray.Node<V> pruned,
                 boolean fPrunedLeft)
Rebalance the tree following the removal of a node. 
 | 
protected AbstractSparseArray.Node<V> | 
AbstractSparseArray.doubleRotate(AbstractSparseArray.Node<V> node,
            boolean fLeft)
Double rotate a node in a given direction. 
 | 
protected AbstractSparseArray.Crawler | 
AbstractSparseArray.instantiateCrawler(AbstractSparseArray.Node<V> head,
                  int fromdir,
                  boolean fForward)
Instantiate a new Crawler at the specified location and direction. 
 | 
protected AbstractSparseArray.Crawler | 
PrimitiveSparseArray.instantiateCrawler(AbstractSparseArray.Node head,
                  int fromdir,
                  boolean fForward)
Instantiate a new Crawler at the specified location and direction. 
 | 
protected void | 
AbstractSparseArray.remove(AbstractSparseArray.Node<V> node)
Remove the specified node from the tree. 
 | 
protected AbstractSparseArray.Node<V> | 
AbstractSparseArray.replace(AbstractSparseArray.Node<V> nodeA,
       AbstractSparseArray.Node<V> nodeB)
Replace one node with another. 
 | 
protected AbstractSparseArray.Node<V> | 
AbstractSparseArray.replace(AbstractSparseArray.Node<V> nodeA,
       AbstractSparseArray.Node<V> nodeB)
Replace one node with another. 
 | 
protected AbstractSparseArray.Node<V> | 
AbstractSparseArray.rotate(AbstractSparseArray.Node<V> node,
      boolean fLeft)
Rotate a node in a given direction. 
 | 
| Constructor and Description | 
|---|
Crawler(AbstractSparseArray.Node<V> head,
       int fromdir,
       boolean fForward)
Crawler constructor. 
 | 
Iterator(AbstractSparseArray.Node head,
        int fromdir,
        boolean fForward)
Instantiate a new PrimitiveIterator at the specified location and
 direction. 
 |