de.sciss.collection.txn.DeterministicSkipOctree

LeafImpl

final class LeafImpl extends LeftNonEmptyChild with RightNonEmptyChild with LeafOrEmpty with Leaf

A leaf in the octree, carrying a map entry in the form of a point and associated value. Note that a single instance of a leaf is used across the levels of the octree! That means that multiple child pointers may go to the same leaf, while the parent of a leaf always points into the highest level octree that the leaf resides in, according to the skiplist.

Attributes
protected
Linear Supertypes
Leaf, LeafOrEmpty, RightNonEmptyChild, RightChild, LeftNonEmptyChild, Writer, LeftChild, NonEmptyChild, Child, LeftNonEmpty, NonEmpty, Left, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Hide All
  2. Show all
  1. LeafImpl
  2. Leaf
  3. LeafOrEmpty
  4. RightNonEmptyChild
  5. RightChild
  6. LeftNonEmptyChild
  7. Writer
  8. LeftChild
  9. NonEmptyChild
  10. Child
  11. LeftNonEmpty
  12. NonEmpty
  13. Left
  14. AnyRef
  15. Any
Visibility
  1. Public
  2. All

Instance Constructors

  1. new LeafImpl(id: ID, value: A, order: Order, parentRef: Var[BranchLike])

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. def asBranch: BranchLike

  7. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  8. def asLeaf: LeafImpl

  9. def clone(): AnyRef

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

  10. def dispose()(implicit tx: Tx): Unit

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

    Definition Classes
    AnyRef

  12. def equals(that: Any): Boolean

    Definition Classes
    NonEmpty → AnyRef → Any

  13. def finalize(): Unit

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

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

    Definition Classes
    AnyRef → Any

  15. def hashCode(): Int

    Definition Classes
    NonEmpty → AnyRef → Any

  16. val id: ID

    Definition Classes
    LeafImpl → NonEmpty

  17. def isBranch: Boolean

  18. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  19. def isLeaf: Boolean

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

    Definition Classes
    AnyRef

  21. final def notify(): Unit

    Definition Classes
    AnyRef

  22. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  23. val order: Order

  24. 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
    LeafImpl → NonEmpty

  25. def parent(implicit tx: Tx): BranchLike

    Definition Classes
    LeafImpl → NonEmptyChild

  26. def parent_=(p: BranchLike)(implicit tx: Tx): Unit

  27. def remove()(implicit tx: Tx): Unit

  28. def shortString: String

    Definition Classes
    LeafImpl → NonEmpty

  29. def startOrder: Order

    For a leaf (which does not have a subtree), the startOrder is identical to its order.

    For a leaf (which does not have a subtree), the startOrder is identical to its order.

    Definition Classes
    LeafImpl → LeftNonEmpty

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

    For a leaf (which does not have a subtree), the stopOrder is identical to its order.

    For a leaf (which does not have a subtree), the stopOrder is identical to its order.

    Definition Classes
    LeafImpl → LeftNonEmpty

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

    Definition Classes
    AnyRef

  32. def toString(): String

    Definition Classes
    NonEmpty → AnyRef → Any

  33. 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
    LeafImpl → NonEmpty

  34. def updateParentLeft(p: LeftBranch)(implicit tx: Tx): Unit

    Definition Classes
    LeafImpl → LeftNonEmptyChild

  35. def updateParentRight(p: RightBranch)(implicit tx: Tx): Unit

    Definition Classes
    LeafImpl → RightNonEmptyChild

  36. val value: A

    Definition Classes
    LeafImpl → Leaf

  37. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Definition Classes
    AnyRef
    Annotations
    @throws()

  40. def write(out: DataOutput): Unit

    Definition Classes
    LeafImpl → Writer

Inherited from Leaf

Inherited from LeafOrEmpty

Inherited from RightNonEmptyChild

Inherited from RightChild

Inherited from LeftNonEmptyChild

Inherited from Writer

Inherited from LeftChild

Inherited from NonEmptyChild

Inherited from Child

Inherited from LeftNonEmpty

Inherited from NonEmpty

Inherited from Left

Inherited from AnyRef

Inherited from Any