de.sciss.collection.txn.DeterministicSkipOctree

LeftBranch

sealed trait LeftBranch extends BranchLike with LeftNonEmpty with Writer

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.

Attributes
protected
Linear Supertypes
LeftNonEmpty, Left, BranchLike, Branch, Child, Writer, NonEmpty, AnyRef, Any
Known Subclasses
LeftTopBranch
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Hide All
  2. Show all
  1. LeftBranch
  2. LeftNonEmpty
  3. Left
  4. BranchLike
  5. Branch
  6. Child
  7. Writer
  8. NonEmpty
  9. AnyRef
  10. Any
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract def children: Array[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

  2. abstract def hyperCube: HyperCube

    Returns the hyper-cube covered by this node

    Returns the hyper-cube covered by this node

    Definition Classes
    BranchLike → Branch

  3. abstract def id: ID

    Definition Classes
    NonEmpty

  4. abstract def leafRemoved()(implicit tx: 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 underfull node upwards.

    Attributes
    protected
    Definition Classes
    BranchLike

  5. abstract def nextRef: Var[NextOption]

    Attributes
    protected
    Definition Classes
    BranchLike

  6. abstract def nodeName: String

    Attributes
    protected
    Definition Classes
    BranchLike

  7. abstract def startOrder: Order

    A marker in the in-order list corresponding to the beginning of the objects 'interval'.

    A marker in the in-order list corresponding to the beginning of the objects 'interval'. That is to say, if this object is a leaf, this marker is the leaf's position in the in-order list. If this object is a node, all children of the node's subtree appear right to this marker in the in-order. Thus the startOrder and stopOrder form the interval borders of the sub-tree.

    Definition Classes
    LeftNonEmpty

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

    Definition Classes
    Writer

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

    Returns the child for a given orthant index

    Returns the child for a given orthant index

    Definition Classes
    LeftBranch → BranchLike → Branch

  10. def clone(): AnyRef

    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()

  11. final def demoteLeaf(point: PointLike, leaf: LeafImpl)(implicit tx: 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
    LeftBranch → BranchLike

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

    Definition Classes
    AnyRef

  13. def equals(that: Any): Boolean

    Definition Classes
    NonEmpty → AnyRef → Any

  14. def finalize(): Unit

    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()

  15. final def getClass(): java.lang.Class[_]

    Definition Classes
    AnyRef → Any

  16. def hashCode(): Int

    Definition Classes
    NonEmpty → AnyRef → Any

  17. final def insert(point: PointLike, value: A)(implicit tx: Tx): LeafImpl

  18. final def isBranch: Boolean

    Definition Classes
    BranchLike

  19. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  20. final def isLeaf: Boolean

    Definition Classes
    BranchLike

  21. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  22. final def next(implicit tx: 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

  23. final def nextOption(implicit tx: Tx): Option[BranchLike]

    Definition Classes
    BranchLike → Branch

  24. final def next_=(node: NextOption)(implicit tx: Tx): Unit

    Sets the corresponding interesting node in Qi+1.

    Sets the corresponding interesting node in Qi+1.

    Definition Classes
    BranchLike

  25. final def notify(): Unit

    Definition Classes
    AnyRef

  26. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  27. final def orthantIndexIn(iq: HyperCube)(implicit tx: 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
    BranchLike → NonEmpty

  28. final def prevOption: Option[Branch]

    Definition Classes
    LeftBranch → Branch

  29. final def shortString: String

    Attributes
    protected
    Definition Classes
    BranchLike → NonEmpty

  30. final def stopOrder(implicit tx: Tx): Order

    The stop-order of a left node is now always implicitly defined.

    The stop-order of a left node is now always implicitly defined. It is not a real entry in the total-order. Instead it is either the start-order, if the node is empty, otherwise the stop-order of the right-most non-empty child of the node. Since only append is used on the order entries, this totally suffices for maintaining the tree's binarization.

    Definition Classes
    LeftBranch → LeftNonEmpty

  31. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef

  32. def toString(): String

    Definition Classes
    NonEmpty → AnyRef → Any

  33. final def union(mq: HyperCube, point2: PointLike)(implicit tx: Tx): 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
    BranchLike → NonEmpty

  34. final def updateChild(idx: Int, c: LeftChildOption)(implicit tx: Tx): Unit

  35. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

  36. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

  37. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

Inherited from LeftNonEmpty

Inherited from Left

Inherited from BranchLike

Inherited from Branch

Inherited from Child

Inherited from Writer

Inherited from NonEmpty

Inherited from AnyRef

Inherited from Any