| Method Summary |
|
| abstract public boolean | contains(Comparable value)
|
| abstract public boolean | deleteEntry(NodeEntry entry)
Removes an entry from the list of entries in the Node. If the deleted node is the current right value, then the right
value is updated with the next lowest value in the node.
Parameters:
entry - - the entry to remove. |
| abstract public Object[] | getEntries()
Retrieves the entries in the node as an array. |
| abstract public int | getEntryNumber()
|
| abstract public NodeLink | getLinkNode()
Returns the sibling righthand node for this node. |
| abstract public ReadWriteLock | getNodeLock()
|
| abstract public Comparable | getRightValue()
Gets the rightmost value for the node. |
| abstract public Object[] | insertEntry(NodeEntry entry)
Inserts the entry into the correct position in the node. |
| abstract public boolean | isDeleted()
Checks whether a node has been marked as deleted as a result of a remove. |
| abstract public boolean | isEmpty()
|
| abstract public boolean | isLeaf()
|
| abstract public boolean | isUnderFull()
Used to check if the node has exceeded or equaled the maximum number of allowed entries. |
| abstract public void | setDeleted(boolean deleted)
Sets a node to be deleted. |
| abstract public void | setEntries(Object[] entries)
Replaces the current entries with a new list of entries. |
| abstract public void | setLinkNode(NodeLink node)
|
| abstract public void | setRightValue(Comparable value)
Sets the right value for the node. |
| abstract public Node | splitNode(Object[] entries)
Splits the current node into two new nodes. |