de.sciss.lucre.data.DeterministicSkipOctree
Returns the child for a given orthant index.
Returns the child for a given orthant index.
Returns the hyper-cube covered by this node.
Returns the hyper-cube covered by this node.
Returns the corresponding interesting
node in Qi+1, or empty
if no such
node exists.
Returns the corresponding interesting
node in Qi+1, or empty
if no such
node exists.
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
.
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 left tree node implementation provides more specialized child nodes of type
LeftChild
. It furthermore defines a resolution methodfindImmediateLeaf
which is typically called after arriving here from afindP0
call.