Class

de.sciss.lucre.data.DeterministicSkipOctree

LeftTopBranch

Related Doc: package DeterministicSkipOctree

Permalink

final class LeftTopBranch extends LeftBranch with TopBranch with Mutable[S.ID, S.Tx]

Attributes
protected
Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. LeftTopBranch
  2. Mutable
  3. Disposable
  4. TopBranch
  5. LeftBranch
  6. LeftNonEmpty
  7. Left
  8. BranchLike
  9. Branch
  10. Child
  11. Writable
  12. NonEmpty
  13. Identifiable
  14. AnyRef
  15. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new LeftTopBranch(id: S.ID, children: Array[S.Var[LeftChildOption]], nextRef: S.Var[NextOption])

    Permalink

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): LeftChildOption

    Permalink

    Returns the child for a given orthant index.

    Returns the child for a given orthant index.

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

    Permalink

    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
    LeftTopBranchLeftBranch
  9. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  10. 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
    LeftBranchBranchLike
  11. def dispose()(implicit tx: S.Tx): Unit

    Permalink
    Definition Classes
    LeftTopBranchDisposable
  12. final def eq(arg0: AnyRef): Boolean

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

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

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

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

    Permalink
    Definition Classes
    NonEmptyIdentifiable → AnyRef → Any
  17. final def hyperCube: D.HyperCube

    Permalink

    Returns the hyper-cube covered by this node.

    Returns the hyper-cube covered by this node.

    Definition Classes
    TopBranchBranchLikeBranch
  18. val id: S.ID

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

    Permalink
    Definition Classes
    LeftBranch
  20. final def isBranch: Boolean

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

    Permalink
    Definition Classes
    Any
  22. final def isLeaf: Boolean

    Permalink
    Definition Classes
    BranchLike
  23. 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
    LeftTopBranchBranchLike
  24. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  25. 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
  26. final def nextOption(implicit tx: S.Tx): Option[BranchLike]

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

    Permalink
    Attributes
    protected
    Definition Classes
    LeftTopBranchBranchLike
  28. 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
  29. def nodeName: String

    Permalink
    Attributes
    protected
    Definition Classes
    LeftTopBranchBranchLike
  30. final def notify(): Unit

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

    Permalink
    Definition Classes
    AnyRef
  32. 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
  33. final def prevOption: Option[Branch]

    Permalink
    Definition Classes
    LeftBranchBranch
  34. final def shortString: String

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

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

    Permalink
    Definition Classes
    NonEmpty → AnyRef → Any
  37. 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
  38. final def updateChild(idx: Int, c: LeftChildOption)(implicit tx: S.Tx): Unit

    Permalink
    Definition Classes
    LeftBranch
  39. final def wait(): Unit

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

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

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

    Permalink
    Definition Classes
    LeftTopBranch → Writable

Inherited from Mutable[S.ID, S.Tx]

Inherited from Disposable[S.Tx]

Inherited from TopBranch

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