Summary:
Detail:
NodeIndex(long valueIn)
NodeIndex(LeafIndex leaf)
List<NodeIndex>
copath(TreeSize size)
boolean
equals(Object o)
int
hashCode()
isBelow(NodeIndex other)
isLeaf()
NodeIndex
left()
long
level()
parent()
right()
static NodeIndex
root(TreeSize size)
sibling()
sibling(NodeIndex ancestor)
value()
clone, finalize, getClass, notify, notifyAll, toString, wait, wait, wait
equals
Object
hashCode
Exception