Uses of Class
loci.poi.util.BinaryTree.Node

Packages that use BinaryTree.Node

Package	Description
loci.poi.util	Top-level util package are classes that are useful throughout the project.

Uses of BinaryTree.Node in loci.poi.util

Fields in loci.poi.util declared as BinaryTree.Node

Modifier and Type	Field and Description
protected BinaryTree.Node	BinaryTree.BinaryTreeIterator._last_returned_node
private BinaryTree.Node[]	BinaryTree.Node._left
private BinaryTree.Node	BinaryTree.BinaryTreeIterator._next_node
private BinaryTree.Node[]	BinaryTree.Node._parent
private BinaryTree.Node[]	BinaryTree.Node._right
private BinaryTree.Node[]	BinaryTree._root

Methods in loci.poi.util that return BinaryTree.Node

Modifier and Type	Method and Description
private static BinaryTree.Node	BinaryTree.getGrandParent(BinaryTree.Node node, int index) get a node's grandparent.
private BinaryTree.Node	BinaryTree.Node.getLeft(int index) get the left node
private static BinaryTree.Node	BinaryTree.getLeftChild(BinaryTree.Node node, int index) get a node's left child.
private static BinaryTree.Node	BinaryTree.getParent(BinaryTree.Node node, int index) get a node's parent.
private BinaryTree.Node	BinaryTree.Node.getParent(int index) get the parent node
private BinaryTree.Node	BinaryTree.Node.getRight(int index) get the right node
private static BinaryTree.Node	BinaryTree.getRightChild(BinaryTree.Node node, int index) get a node's right child.
private static BinaryTree.Node	BinaryTree.leastNode(BinaryTree.Node node, int index) find the least node from a given node.
private BinaryTree.Node	BinaryTree.lookup(Comparable data, int index) do the actual lookup of a piece of data
private BinaryTree.Node	BinaryTree.nextGreater(BinaryTree.Node node, int index) get the next larger node from the specified node

Methods in loci.poi.util with parameters of type BinaryTree.Node

Modifier and Type	Method and Description
private static void	BinaryTree.copyColor(BinaryTree.Node from, BinaryTree.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	BinaryTree.Node.copyColor(BinaryTree.Node node, int index) make this node the same color as another
private void	BinaryTree.doRedBlackDelete(BinaryTree.Node deleted_node) complicated red-black delete stuff.
private void	BinaryTree.doRedBlackDeleteFixup(BinaryTree.Node replacement_node, int index) complicated red-black delete stuff.
private void	BinaryTree.doRedBlackInsert(BinaryTree.Node inserted_node, int index) complicated red-black insert stuff.
private static BinaryTree.Node	BinaryTree.getGrandParent(BinaryTree.Node node, int index) get a node's grandparent.
private static BinaryTree.Node	BinaryTree.getLeftChild(BinaryTree.Node node, int index) get a node's left child.
private static BinaryTree.Node	BinaryTree.getParent(BinaryTree.Node node, int index) get a node's parent.
private static BinaryTree.Node	BinaryTree.getRightChild(BinaryTree.Node node, int index) get a node's right child.
private void	BinaryTree.insertValue(BinaryTree.Node newNode) insert a node by its value
private static boolean	BinaryTree.isBlack(BinaryTree.Node node, int index) is the specified black red? if the node does not exist, sure, it's black, thank you
private static boolean	BinaryTree.isLeftChild(BinaryTree.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	BinaryTree.isRed(BinaryTree.Node node, int index) is the specified node red? if the node does not exist, no, it's black, thank you
private static boolean	BinaryTree.isRightChild(BinaryTree.Node node, int index) is this node its parent's right child? mind you, the node, or its parent, may not exist.
private static BinaryTree.Node	BinaryTree.leastNode(BinaryTree.Node node, int index) find the least node from a given node.
private static void	BinaryTree.makeBlack(BinaryTree.Node node, int index) force a node (if it exists) black
private static void	BinaryTree.makeRed(BinaryTree.Node node, int index) force a node (if it exists) red
private BinaryTree.Node	BinaryTree.nextGreater(BinaryTree.Node node, int index) get the next larger node from the specified node
private void	BinaryTree.rotateLeft(BinaryTree.Node node, int index) do a rotate left.
private void	BinaryTree.rotateRight(BinaryTree.Node node, int index) do a rotate right.
private void	BinaryTree.Node.setLeft(BinaryTree.Node node, int index) Set this node's left node
private void	BinaryTree.Node.setParent(BinaryTree.Node node, int index) Set this node's parent node
private void	BinaryTree.Node.setRight(BinaryTree.Node node, int index) Set this node's right node
private void	BinaryTree.Node.swapColors(BinaryTree.Node node, int index) exchange colors with another node
private void	BinaryTree.swapPosition(BinaryTree.Node x, BinaryTree.Node y, int index) swap two nodes (except for their content), taking care of special cases where one is the other's parent ...