loci.poi.util

Class BinaryTree.Node

java.lang.Object

loci.poi.util.BinaryTree.Node

All Implemented Interfaces:

Map.Entry

Enclosing class:

BinaryTree

private static final class BinaryTree.Node
extends Object
implements Map.Entry

Field Summary

Fields

Modifier and Type	Field and Description
private boolean[]	_black
private boolean	_calculated_hashcode
private Comparable[]	_data
private int	_hashcode
private BinaryTree.Node[]	_left
private BinaryTree.Node[]	_parent
private BinaryTree.Node[]	_right

Constructor Summary

Constructors

Constructor and Description
BinaryTree.Node(Comparable key, Comparable value) Make a new cell with given key and value, and with null links, and black (true) colors.

Method Summary

Methods

Modifier and Type	Method and Description
private void	copyColor(BinaryTree.Node node, int index) make this node the same color as another
boolean	equals(Object o) Compares the specified object with this entry for equality.
private Comparable	getData(int index) get the specified data
Object	getKey()
private BinaryTree.Node	getLeft(int index) get the left node
private BinaryTree.Node	getParent(int index) get the parent node
private BinaryTree.Node	getRight(int index) get the right node
Object	getValue()
int	hashCode()
private boolean	isBlack(int index) is this node black?
private boolean	isRed(int index) is this node red?
private void	setBlack(int index) make this node black
private void	setLeft(BinaryTree.Node node, int index) Set this node's left node
private void	setParent(BinaryTree.Node node, int index) Set this node's parent node
private void	setRed(int index) make this node red
private void	setRight(BinaryTree.Node node, int index) Set this node's right node
Object	setValue(Object ignored) Optional operation that is not permitted in this implementation
private void	swapColors(BinaryTree.Node node, int index) exchange colors with another node

Methods inherited from class java.lang.Object

clone, finalize, getClass, notify, notifyAll, toString, wait, wait, wait

Field Detail

_data

private Comparable[] _data

_left

private BinaryTree.Node[] _left

_right

private BinaryTree.Node[] _right

_parent

private BinaryTree.Node[] _parent

_black

private boolean[] _black

_hashcode

private int _hashcode

_calculated_hashcode

private boolean _calculated_hashcode

Constructor Detail

BinaryTree.Node

BinaryTree.Node(Comparable key,
               Comparable value)

Make a new cell with given key and value, and with null links, and black (true) colors.

Parameters:

key -

value -

Method Detail

getData

private Comparable getData(int index)

get the specified data

Parameters:

index - _KEY or _VALUE

Returns:

the key or value

setLeft

private void setLeft(BinaryTree.Node node,
           int index)

Set this node's left node

Parameters:

node - the new left node

index - _KEY or _VALUE

getLeft

private BinaryTree.Node getLeft(int index)

get the left node

Parameters:

index - _KEY or _VALUE

Returns:

the left node -- may be null

setRight

private void setRight(BinaryTree.Node node,
            int index)

Set this node's right node

Parameters:

node - the new right node

index - _KEY or _VALUE

getRight

private BinaryTree.Node getRight(int index)

get the right node

Parameters:

index - _KEY or _VALUE

Returns:

the right node -- may be null

setParent

private void setParent(BinaryTree.Node node,
             int index)

Set this node's parent node

Parameters:

node - the new parent node

index - _KEY or _VALUE

getParent

private BinaryTree.Node getParent(int index)

get the parent node

Parameters:

index - _KEY or _VALUE

Returns:

the parent node -- may be null

swapColors

private void swapColors(BinaryTree.Node node,
              int index)

exchange colors with another node

Parameters:

node - the node to swap with

index - _KEY or _VALUE

isBlack

private boolean isBlack(int index)

is this node black?

Parameters:

index - _KEY or _VALUE

Returns:

true if black (which is represented as a true boolean)

isRed

private boolean isRed(int index)

is this node red?

Parameters:

index - _KEY or _VALUE

Returns:

true if non-black

setBlack

private void setBlack(int index)

make this node black

Parameters:

index - _KEY or _VALUE

setRed

private void setRed(int index)

make this node red

Parameters:

index - _KEY or _VALUE

copyColor

private void copyColor(BinaryTree.Node node,
             int index)

make this node the same color as another

Parameters:

node - the node whose color we're adopting

index - _KEY or _VALUE

getKey

public Object getKey()

Specified by:

getKey in interface Map.Entry

Returns:

the key corresponding to this entry.

getValue

public Object getValue()

Specified by:

getValue in interface Map.Entry

Returns:

the value corresponding to this entry.

setValue

public Object setValue(Object ignored)
                throws UnsupportedOperationException

Optional operation that is not permitted in this implementation

Specified by:

setValue in interface Map.Entry

Parameters:

ignored -

Returns:

does not return

Throws:

UnsupportedOperationException

equals

public boolean equals(Object o)

Compares the specified object with this entry for equality. Returns true if the given object is also a map entry and the two entries represent the same mapping.

Specified by:

equals in interface Map.Entry

Overrides:

equals in class Object

Parameters:

o - object to be compared for equality with this map entry.

Returns:

true if the specified object is equal to this map entry.

hashCode

public int hashCode()

Specified by:

hashCode in interface Map.Entry

Overrides:

hashCode in class Object

Returns:

the hash code value for this map entry.