Trait

de.sciss.lucre.data.DeterministicSkipOctree

RightBranch

Related Doc: package DeterministicSkipOctree

Permalink

sealed trait RightBranch extends Next with BranchLike

A right tree node implementation provides more specialized child nodes of type RightChild. It furthermore defines the node in Qi-1 via the prev method.

Attributes
protected
Linear Supertypes
Known Subclasses
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. RightBranch
  2. BranchLike
  3. Branch
  4. Child
  5. Writable
  6. NonEmpty
  7. Identifiable
  8. Next
  9. AnyRef
  10. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Abstract Value Members

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

    Permalink
    Attributes
    protected
  2. abstract def hyperCube: D.HyperCube

    Permalink

    Returns the hyper-cube covered by this node.

    Returns the hyper-cube covered by this node.

    Definition Classes
    BranchLikeBranch
  3. abstract def id: S.ID

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

    Permalink

     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
  5. abstract def nextRef: S.Var[NextOption]

    Permalink
    Attributes
    protected
    Definition Classes
    BranchLike
  6. abstract def nodeName: String

    Permalink
    Attributes
    protected
    Definition Classes
    BranchLike
  7. abstract def prev: BranchLike

    Permalink
  8. abstract def write(out: DataOutput): Unit

    Permalink
    Definition Classes
    Writable

Concrete Value Members

  1. final def !=(arg0: Any): Boolean

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

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

    Permalink
    Definition Classes
    AnyRef → Any
  4. final def asBranch: BranchLike

    Permalink
    Definition Classes
    BranchLike
  5. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  6. final def asLeaf: LeafImpl

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

    Permalink

    Returns the child for a given orthant index.

    Returns the child for a given orthant index.

    Definition Classes
    RightBranchBranchLikeBranch
  8. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  9. final def demoteLeaf(point: D.PointLike, leaf: LeafImpl)(implicit tx: S.Tx): Unit

    Permalink

    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
    RightBranchBranchLike
  10. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  11. def equals(that: Any): Boolean

    Permalink
    Definition Classes
    NonEmptyIdentifiable → AnyRef → Any
  12. def finalize(): Unit

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

    Permalink
    Definition Classes
    AnyRef → Any
  14. def hashCode(): Int

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

    Permalink

    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.

  16. final def isBranch: Boolean

    Permalink
    Definition Classes
    BranchLike
  17. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  18. final def isLeaf: Boolean

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

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

    Permalink

     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
  21. final def nextOption(implicit tx: S.Tx): Option[BranchLike]

    Permalink
    Definition Classes
    BranchLikeBranch
  22. final def next_=(node: NextOption)(implicit tx: S.Tx): Unit

    Permalink

    Sets the corresponding interesting node in Qi+1.

    Sets the corresponding interesting node in Qi+1.

    Definition Classes
    BranchLike
  23. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  24. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  25. final def orthantIndexIn(iq: D.HyperCube)(implicit tx: S.Tx): Int

    Permalink

    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
    BranchLikeNonEmpty
  26. final def prevOption: Option[Branch]

    Permalink
    Definition Classes
    RightBranchBranch
  27. final def shortString: String

    Permalink
    Attributes
    protected
    Definition Classes
    BranchLikeNonEmpty
  28. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  29. def toString(): String

    Permalink
    Definition Classes
    NonEmpty → AnyRef → Any
  30. final def union(mq: D.HyperCube, point2: D.PointLike)(implicit tx: S.Tx): D.HyperCube

    Permalink

    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
    BranchLikeNonEmpty
  31. final def updateChild(idx: Int, c: RightChildOption)(implicit tx: S.Tx): Unit

    Permalink
  32. final def wait(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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