Queries the orthant index for this (leaf's or node's) hyper-cube
with respect to a given outer hyper-cube iq.
Queries the orthant index for this (leaf's or node's) hyper-cube
with respect to a given outer hyper-cube iq.
A marker in the in-order list corresponding to the beginning of the objects 'interval'.
A marker in the in-order list corresponding to
the beginning of the objects 'interval'. That is
to say, if this object is a leaf, this marker is
the leaf's position in the in-order list. If this
object is a node, all children of the node's subtree
appear right to this marker in the in-order. Thus
the startOrder and stopOrder form the interval
borders of the sub-tree.
A marker in the in-order list corresponding to the ending of the objects 'interval'.
A marker in the in-order list corresponding to
the ending of the objects 'interval'. That is
to say, if this object is a leaf, this marker is
the leaf's position in the in-order list. If this
object is a node, all children of the node's subtree
appear left to this marker in the in-order. Thus
the startOrder and stopOrder form the interval
borders of the sub-tree.
Computes the greatest interesting hyper-cube within
a given hyper-cube mq so that this (leaf's or node's)
hyper-cube and the given point will be placed in
separated orthants of this resulting hyper-cube.
Computes the greatest interesting hyper-cube within
a given hyper-cube mq so that this (leaf's or node's)
hyper-cube and the given point will be placed in
separated orthants of this resulting hyper-cube.
A common trait used in pattern matching, comprised of
LeafandLeftChildBranch.