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

LeftNonEmptyChild

sealed trait LeftNonEmptyChild[T <: Exec[T], P, H, A] extends LeftNonEmpty[T, P, H] with NonEmptyChild[T, P, H, A] with LeftChild[T, P, H, A] with Writable

A common trait used in pattern matching, comprised of Leaf and LeftChildBranch.

A common trait used in pattern matching, comprised of Leaf and LeftChildBranch.

trait LeftChild[T, P, H, A]
trait NonEmptyChild[T, P, H, A]
trait Child[T, P, H, A]
trait Writable
trait LeftNonEmpty[T, P, H]
trait NonEmpty[T, P, H]
trait Identified[T]
trait Left
class Object
trait Matchable
class Any
trait Leaf[T, P, H, A]
trait LeftChildBranch[T, P, H, A]

Value members

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
def parent(tx: T): Branch[T, P, H, A]
Inherited from
NonEmptyChild
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