RightBranch

Abstract Value Members

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

Attributes
protected
abstract def hyperCube: D.HyperCube

Returns the hyper-cube covered by this node.
Returns the hyper-cube covered by this node.

Definition Classes
BranchLike → Branch
abstract def id: S.ID

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

Called when a leaf has been removed from the node.
Called when a leaf has been removed from the node. The node may need to cleanup after this, e.g. promote an under-full node upwards.

Attributes
protected
Definition Classes
BranchLike
abstract def nextRef: S.Var[NextOption]

Attributes
protected
Definition Classes
BranchLike
abstract def nodeName: String

Attributes
protected
Definition Classes
BranchLike
abstract def prev: BranchLike
abstract def write(out: DataOutput): Unit

Definition Classes
Writable

Concrete Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def asBranch: BranchLike

Definition Classes
BranchLike
final def asInstanceOf[T0]: T0

Definition Classes
Any
final def asLeaf: LeafImpl

Definition Classes
BranchLike
final def child(idx: Int)(implicit tx: S.Tx): RightChildOption

Returns the child for a given orthant index.
Returns the child for a given orthant index.

Definition Classes
RightBranch → BranchLike → Branch
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
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.
Assuming that the given leaf is a child of this node, removes the child from this node's children. This method will perform further clean-up such as merging this node with its parent if it becomes uninteresting as part of the removal.

Definition Classes
RightBranch → BranchLike
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(that: Any): Boolean

Definition Classes
NonEmpty → Identifiable → AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
NonEmpty → Identifiable → AnyRef → Any
final def insert(point: D.PointLike, leaf: LeafImpl)(implicit tx: S.Tx): Unit

Promotes a leaf that exists in Qi-1 to this tree, by inserting it into this node which is its interesting node in Qi.
Promotes a leaf that exists in Qi-1 to this tree, by inserting it into this node which is its interesting node in Qi.
If the result of insertion is a new child node below this node, this intermediate node will be connected to Qi by looking for the corresponding hyper-cube in the given search path that led here (i.e. that was constructed in findPN).
This method also sets the parent of the leaf accordingly.
final def isBranch: Boolean

Definition Classes
BranchLike
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
final def isLeaf: Boolean

Definition Classes
BranchLike
final def ne(arg0: AnyRef): Boolean

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

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.

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

Definition Classes
BranchLike → Branch
final def next_=(node: NextOption)(implicit tx: S.Tx): Unit

Sets the corresponding interesting node in Qi+1.
Sets the corresponding interesting node in Qi+1.

Definition Classes
BranchLike
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
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.
Queries the orthant index for this (leaf's or node's) hyper-cube with respect to a given outer hyper-cube iq.

Definition Classes
BranchLike → NonEmpty
final def prevOption: Option[Branch]

Definition Classes
RightBranch → Branch
final def shortString: String

Attributes
protected
Definition Classes
BranchLike → NonEmpty
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
NonEmpty → AnyRef → Any
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.
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.

Definition Classes
BranchLike → NonEmpty
final def updateChild(idx: Int, c: RightChildOption)(implicit tx: S.Tx): Unit
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )

Related Doc: package DeterministicSkipOctree

sealed trait RightBranch extends Next with BranchLike

Abstract Value Members

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

abstract def hyperCube: D.HyperCube

abstract def id: S.ID

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

abstract def nextRef: S.Var[NextOption]

abstract def nodeName: String

abstract def prev: BranchLike

abstract def write(out: DataOutput): Unit

Concrete Value Members

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): RightChildOption

def clone(): AnyRef

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

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, leaf: LeafImpl)(implicit tx: S.Tx): Unit

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

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

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

final def notify(): Unit

final def notifyAll(): Unit

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

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

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

final def wait(): Unit

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

final def wait(arg0: Long): Unit

Inherited from BranchLike

Inherited from Branch

Inherited from Child

Inherited from Writable

Inherited from NonEmpty

Inherited from Identifiable[S.ID]

Inherited from Next

Inherited from AnyRef

Inherited from Any

Ungrouped