de.sciss.lucre.data.DeterministicSkipOctree

LeftChildBranch

final class LeftChildBranch extends LeftBranch with ChildBranch with LeftNonEmptyChild

Attributes
protected
Linear Supertypes
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. LeftChildBranch
  2. LeftNonEmptyChild
  3. LeftChild
  4. ChildBranch
  5. NonEmptyChild
  6. LeftBranch
  7. LeftNonEmpty
  8. Left
  9. BranchLike
  10. Branch
  11. Child
  12. Writable
  13. NonEmpty
  14. Identifiable
  15. AnyRef
  16. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new LeftChildBranch(id: S.ID, parentRef: S.Var[LeftBranch], hyperCube: D.HyperCube, children: Array[S.Var[LeftChildOption]], nextRef: S.Var[NextOption])

Value Members

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

    Definition Classes
    AnyRef
  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any
  3. final def ##(): Int

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

    Definition Classes
    AnyRef
  5. final def ==(arg0: Any): Boolean

    Definition Classes
    Any
  6. final def asBranch: BranchLike

    Definition Classes
    BranchLike
  7. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  8. final def asLeaf: LeafImpl

    Definition Classes
    BranchLike
  9. final def child(idx: Int)(implicit tx: S.Tx): LeftChildOption

    Returns the child for a given orthant index.

    Returns the child for a given orthant index.

    Definition Classes
    LeftBranchBranchLikeBranch
  10. val children: Array[S.Var[LeftChildOption]]

    For a LeftBranch, all its children are more specific -- they are instances of LeftChild and thus support order intervals.

    For a LeftBranch, all its children are more specific -- they are instances of LeftChild and thus support order intervals.

    Attributes
    protected
    Definition Classes
    LeftChildBranchLeftBranch
  11. def clone(): AnyRef

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

    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
    LeftBranchBranchLike
  13. def dispose()(implicit tx: S.Tx): Unit

  14. final def eq(arg0: AnyRef): Boolean

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

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

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

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

    Definition Classes
    NonEmptyIdentifiable → AnyRef → Any
  19. val hyperCube: D.HyperCube

    Returns the hyper-cube covered by this node.

    Returns the hyper-cube covered by this node.

    Definition Classes
    LeftChildBranchBranchLikeBranch
  20. val id: S.ID

    Definition Classes
    LeftChildBranchIdentifiable
  21. final def insert(point: D.PointLike, value: A)(implicit tx: S.Tx): LeafImpl

    Definition Classes
    LeftBranch
  22. final def isBranch: Boolean

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

    Definition Classes
    Any
  24. final def isLeaf: Boolean

    Definition Classes
    BranchLike
  25. def leafRemoved()(implicit tx: S.Tx): Unit

     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
    LeftChildBranchBranchLike
  26. final def ne(arg0: AnyRef): Boolean

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

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

    Definition Classes
    BranchLikeBranch
  29. val nextRef: S.Var[NextOption]

    Attributes
    protected
    Definition Classes
    LeftChildBranchBranchLike
  30. final def next_=(node: NextOption)(implicit tx: S.Tx): Unit

    Sets the corresponding interesting node in Qi+1.

    Sets the corresponding interesting node in Qi+1.

    Definition Classes
    BranchLike
  31. def nodeName: String

    Attributes
    protected
    Definition Classes
    LeftChildBranchBranchLike
  32. final def notify(): Unit

    Definition Classes
    AnyRef
  33. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  34. final def orthantIndexIn(iq: D.HyperCube)(implicit tx: S.Tx): 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.

    Definition Classes
    BranchLikeNonEmpty
  35. def parent(implicit tx: S.Tx): LeftBranch

    Definition Classes
    LeftChildBranchNonEmptyChild
  36. def parent_=(node: LeftBranch)(implicit tx: S.Tx): Unit

  37. final def prevOption: Option[Branch]

    Definition Classes
    LeftBranchBranch
  38. final def shortString: String

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

    Definition Classes
    AnyRef
  40. def toString(): String

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

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

    Definition Classes
    LeftBranch
  43. def updateParentLeft(p: LeftBranch)(implicit tx: S.Tx): Unit

    Definition Classes
    LeftChildBranchLeftNonEmptyChild
  44. final def wait(): Unit

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  47. def write(out: DataOutput): Unit

    Definition Classes
    LeftChildBranch → Writable

Inherited from LeftNonEmptyChild

Inherited from LeftChild

Inherited from ChildBranch

Inherited from NonEmptyChild

Inherited from LeftBranch

Inherited from LeftNonEmpty

Inherited from Left

Inherited from BranchLike

Inherited from Branch

Inherited from Child

Inherited from Writable

Inherited from NonEmpty

Inherited from Identifiable[S.ID]

Inherited from AnyRef

Inherited from Any

Ungrouped