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

NonEmpty

sealed trait NonEmpty[T <: Exec[T], P, H] extends Identified[T]

A node is an object that can be stored in a orthant of a branch.

trait Identified[T]
class Object
trait Matchable
class Any
trait Branch[T, P, H, A]
trait ChildBranch[T, P, H, A]
trait LeftChildBranch[T, P, H, A]
trait RightChildBranch[T, P, H, A]
trait LeftBranch[T, P, H, A]
trait LeftTopBranch[T, P, H, A]
trait RightBranch[T, P, H, A]
trait RightTopBranch[T, P, H, A]
trait TopBranch[T, P, H, A]
trait LeftNonEmpty[T, P, H]
trait LeftNonEmptyChild[T, P, H, A]
trait Leaf[T, P, H, A]
trait NonEmptyChild[T, P, H, A]
trait RightNonEmptyChild[T, P, H, A]

Value members

Abstract methods

def orthantIndexIn(iq: H)(implicit 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.

protected def shortString: String
def union(mq: H, point: P)(implicit 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.

Concrete methods

override def toString: String
Definition Classes
Any

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