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

LeftBranch

sealed trait LeftBranch[T <: Exec[T], P, H, A] extends Branch[T, P, H, A] with LeftNonEmpty[T, P, H]

A left tree node implementation provides more specialized child nodes of type LeftChild. It furthermore defines a resolution method findImmediateLeaf which is typically called after arriving here from a findP0 call.

A left tree node implementation provides more specialized child nodes of type LeftChild. It furthermore defines a resolution method findImmediateLeaf which is typically called after arriving here from a findP0 call.

trait LeftNonEmpty[T, P, H]
trait Left
trait Branch[T, P, H, A]
trait NonEmpty[T, P, H]
trait Identified[T]
trait Child[T, P, H, A]
trait Writable
class Object
trait Matchable
class Any
trait LeftTopBranch[T, P, H, A]
trait LeftChildBranch[T, P, H, A]

Value members

Abstract methods

def child(idx: Int)(tx: T): LeftChild[T, P, H, A]
def prevOption: Option[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 hyperCube: H

Returns the hyper-cube covered by this node.

Returns the hyper-cube covered by this node.

Inherited from
Branch
def id: Ident[T]
Inherited from
Identified
def next(tx: T): Next[T, P, H, A]

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.

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