LeftBranch

abstract def child(idx: Int)(implicit tx: S.Tx): LeftChild[S, D, A]

Returns the child for a given orthant index.

abstract def hyperCube: D.HyperCube

Returns the hyper-cube covered by this node.

abstract def id: S.Id

abstract def next(implicit tx: S.Tx): Next[S, D, A]

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

abstract def nextOption(implicit tx: S.Tx): Option[Branch[S, D, A]]

abstract 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.

abstract def prevOption: Option[Branch[S, D, A]]

abstract def shortString: String

abstract def union(mq: D.HyperCube, point: 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.

abstract def write(out: DataOutput): Unit

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit