Lucre-data/de.sciss.lucre.data/DetSkipOctree/NonEmptyChild

NonEmptyChild

sealed trait NonEmptyChild[T <: Exec[T], P, H, A] extends NonEmpty[T, P, H] with Child[T, P, H, A]

An inner non empty tree element has a mutable parent node.

An inner non empty tree element has a mutable parent node.

trait Child[T, P, H, A]
trait Writable
trait NonEmpty[T, P, H]
trait Identified[T]
class Object
trait Matchable
class Any
trait ChildBranch[T, P, H, A]
trait LeftChildBranch[T, P, H, A]
trait RightChildBranch[T, P, H, A]
trait LeftNonEmptyChild[T, P, H, A]
trait Leaf[T, P, H, A]
trait RightNonEmptyChild[T, P, H, A]

Value members

Abstract methods

def parent(tx: T): Branch[T, P, H, A]

Inherited methods

override def equals(that: Any): Boolean
Definition Classes
Identified -> Any
Inherited from
Identified
override def hashCode: Int
Definition Classes
Identified -> Any
Inherited from
Identified
def id: Ident[T]
Inherited from
Identified
def orthantIndexIn(iq: H)(tx: T): 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.

Inherited from
NonEmpty
protected def shortString: String
Inherited from
NonEmpty
override def toString: String
Definition Classes
NonEmpty -> Any
Inherited from
NonEmpty
def union(mq: H, point: P)(tx: T): H

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.

Inherited from
NonEmpty
def write(out: DataOutput): Unit
Inherited from
Writable