LeftBranch

abstract def children: Array[S.Var[LeftChildOption]]

For a LeftBranch, all its children are more specific -- they are instances of LeftChild and thus support order intervals.

abstract def hyperCube: D.HyperCube

Returns the hyper-cube covered by this node.

abstract def id: S.ID

abstract def leafRemoved()(implicit tx: S.Tx): Unit

 Called when a leaf has been removed from the node.

abstract def nextRef: S.Var[NextOption]

abstract def nodeName: String

abstract def write(out: DataOutput): Unit

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asBranch: BranchLike

final def asInstanceOf[T0]: T0

final def asLeaf: LeafImpl

final def child(idx: Int)(implicit tx: S.Tx): LeftChildOption

Returns the child for a given orthant index.

def clone(): AnyRef

final def demoteLeaf(point: D.PointLike, leaf: LeafImpl)(implicit tx: S.Tx): Unit

Assuming that the given leaf is a child of this node, removes the child from this node's children.

final def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def insert(point: D.PointLike, value: A)(implicit tx: S.Tx): LeafImpl

final def isBranch: Boolean

final def isInstanceOf[T0]: Boolean

final def isLeaf: Boolean

final def ne(arg0: AnyRef): Boolean

final def next(implicit tx: S.Tx): NextOption

 Returns the corresponding interesting node in Qi+1, or empty if no such node exists.

final def nextOption(implicit tx: S.Tx): Option[BranchLike]

final def next_=(node: NextOption)(implicit tx: S.Tx): Unit

Sets the corresponding interesting node in Qi+1.

final def notify(): Unit

final def notifyAll(): Unit

final def orthantIndexIn(iq: D.HyperCube)(implicit tx: S.Tx): Int

Queries the orthant index for this (leaf's or node's) hyper-cube with respect to a given outer hyper-cube iq.

final def prevOption: Option[Branch]

final def shortString: String

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

final def union(mq: D.HyperCube, point2: D.PointLike)(implicit tx: S.Tx): D.HyperCube

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.

final def updateChild(idx: Int, c: LeftChildOption)(implicit tx: S.Tx): Unit

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit