Package | Description |
---|---|
org.apache.commons.collections.bidimap |
Modifier and Type | Field and Description |
---|---|
protected TreeBidiMap.Node |
TreeBidiMap.ViewIterator.lastReturnedNode
The last node returned by the iterator.
|
private TreeBidiMap.Node[] |
TreeBidiMap.Node.leftNode |
protected TreeBidiMap.Node |
TreeBidiMap.ViewIterator.nextNode
The next node to be returned by the iterator.
|
private TreeBidiMap.Node[] |
TreeBidiMap.Node.parentNode |
protected TreeBidiMap.Node |
TreeBidiMap.ViewIterator.previousNode
The previous node in the sequence returned by the iterator.
|
private TreeBidiMap.Node[] |
TreeBidiMap.Node.rightNode |
private TreeBidiMap.Node[] |
TreeBidiMap.rootNode |
Modifier and Type | Method and Description |
---|---|
private static TreeBidiMap.Node |
TreeBidiMap.getGrandParent(TreeBidiMap.Node node,
int index)
get a node's grandparent.
|
private TreeBidiMap.Node |
TreeBidiMap.Node.getLeft(int index)
Get the left node.
|
private static TreeBidiMap.Node |
TreeBidiMap.getLeftChild(TreeBidiMap.Node node,
int index)
get a node's left child.
|
private TreeBidiMap.Node |
TreeBidiMap.Node.getParent(int index)
Get the parent node.
|
private static TreeBidiMap.Node |
TreeBidiMap.getParent(TreeBidiMap.Node node,
int index)
get a node's parent.
|
private TreeBidiMap.Node |
TreeBidiMap.Node.getRight(int index)
Get the right node.
|
private static TreeBidiMap.Node |
TreeBidiMap.getRightChild(TreeBidiMap.Node node,
int index)
get a node's right child.
|
private static TreeBidiMap.Node |
TreeBidiMap.greatestNode(TreeBidiMap.Node node,
int index)
Find the greatest node from a given node.
|
private static TreeBidiMap.Node |
TreeBidiMap.leastNode(TreeBidiMap.Node node,
int index)
Find the least node from a given node.
|
private TreeBidiMap.Node |
TreeBidiMap.lookup(java.lang.Comparable data,
int index)
do the actual lookup of a piece of data
|
private TreeBidiMap.Node |
TreeBidiMap.nextGreater(TreeBidiMap.Node node,
int index)
get the next larger node from the specified node
|
private TreeBidiMap.Node |
TreeBidiMap.nextSmaller(TreeBidiMap.Node node,
int index)
get the next larger node from the specified node
|
Modifier and Type | Method and Description |
---|---|
private void |
TreeBidiMap.Node.copyColor(TreeBidiMap.Node node,
int index)
Make this node the same color as another
|
private static void |
TreeBidiMap.copyColor(TreeBidiMap.Node from,
TreeBidiMap.Node to,
int index)
copy the color from one node to another, dealing with the fact
that one or both nodes may, in fact, be null
|
private void |
TreeBidiMap.doRedBlackDelete(TreeBidiMap.Node deletedNode)
complicated red-black delete stuff.
|
private void |
TreeBidiMap.doRedBlackDeleteFixup(TreeBidiMap.Node replacementNode,
int index)
complicated red-black delete stuff.
|
private void |
TreeBidiMap.doRedBlackInsert(TreeBidiMap.Node insertedNode,
int index)
complicated red-black insert stuff.
|
private static TreeBidiMap.Node |
TreeBidiMap.getGrandParent(TreeBidiMap.Node node,
int index)
get a node's grandparent.
|
private static TreeBidiMap.Node |
TreeBidiMap.getLeftChild(TreeBidiMap.Node node,
int index)
get a node's left child.
|
private static TreeBidiMap.Node |
TreeBidiMap.getParent(TreeBidiMap.Node node,
int index)
get a node's parent.
|
private static TreeBidiMap.Node |
TreeBidiMap.getRightChild(TreeBidiMap.Node node,
int index)
get a node's right child.
|
private static TreeBidiMap.Node |
TreeBidiMap.greatestNode(TreeBidiMap.Node node,
int index)
Find the greatest node from a given node.
|
private void |
TreeBidiMap.insertValue(TreeBidiMap.Node newNode)
insert a node by its value
|
private static boolean |
TreeBidiMap.isBlack(TreeBidiMap.Node node,
int index)
is the specified black red? if the node does not exist, sure,
it's black, thank you
|
private static boolean |
TreeBidiMap.isLeftChild(TreeBidiMap.Node node,
int index)
is this node its parent's left child? mind you, the node, or
its parent, may not exist.
|
private static boolean |
TreeBidiMap.isRed(TreeBidiMap.Node node,
int index)
is the specified node red? if the node does not exist, no, it's
black, thank you
|
private static boolean |
TreeBidiMap.isRightChild(TreeBidiMap.Node node,
int index)
is this node its parent's right child? mind you, the node, or
its parent, may not exist.
|
private static TreeBidiMap.Node |
TreeBidiMap.leastNode(TreeBidiMap.Node node,
int index)
Find the least node from a given node.
|
private static void |
TreeBidiMap.makeBlack(TreeBidiMap.Node node,
int index)
force a node (if it exists) black
|
private static void |
TreeBidiMap.makeRed(TreeBidiMap.Node node,
int index)
force a node (if it exists) red
|
private TreeBidiMap.Node |
TreeBidiMap.nextGreater(TreeBidiMap.Node node,
int index)
get the next larger node from the specified node
|
private TreeBidiMap.Node |
TreeBidiMap.nextSmaller(TreeBidiMap.Node node,
int index)
get the next larger node from the specified node
|
private void |
TreeBidiMap.rotateLeft(TreeBidiMap.Node node,
int index)
do a rotate left.
|
private void |
TreeBidiMap.rotateRight(TreeBidiMap.Node node,
int index)
do a rotate right.
|
private void |
TreeBidiMap.Node.setLeft(TreeBidiMap.Node node,
int index)
Set this node's left node.
|
private void |
TreeBidiMap.Node.setParent(TreeBidiMap.Node node,
int index)
Set this node's parent node.
|
private void |
TreeBidiMap.Node.setRight(TreeBidiMap.Node node,
int index)
Set this node's right node.
|
private void |
TreeBidiMap.Node.swapColors(TreeBidiMap.Node node,
int index)
Exchange colors with another node.
|
private void |
TreeBidiMap.swapPosition(TreeBidiMap.Node x,
TreeBidiMap.Node y,
int index)
swap two nodes (except for their content), taking care of
special cases where one is the other's parent ...
|