Class

de.sciss.lucre.data.DeterministicSkipOctree

LeafImpl

Related Doc: package DeterministicSkipOctree

Permalink

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, Writable, LeftChild, NonEmptyChild, Child, LeftNonEmpty, NonEmpty, Identifiable[S.ID], Left, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. LeafImpl
  2. Leaf
  3. LeafOrEmpty
  4. RightNonEmptyChild
  5. RightChild
  6. LeftNonEmptyChild
  7. Writable
  8. LeftChild
  9. NonEmptyChild
  10. Child
  11. LeftNonEmpty
  12. NonEmpty
  13. Identifiable
  14. Left
  15. AnyRef
  16. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

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

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

    Permalink

  5. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  6. def asLeaf: LeafImpl

    Permalink

  7. def clone(): AnyRef

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

  8. def dispose()(implicit tx: S.Tx): Unit

    Permalink

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

    Permalink
    Definition Classes
    AnyRef

  10. def equals(that: Any): Boolean

    Permalink
    Definition Classes
    NonEmpty → Identifiable → AnyRef → Any

  11. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  12. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any

  13. def hashCode(): Int

    Permalink
    Definition Classes
    NonEmpty → Identifiable → AnyRef → Any

  14. val id: S.ID

    Permalink
    Definition Classes
    LeafImpl → Identifiable

  15. def isBranch: Boolean

    Permalink

  16. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  17. def isLeaf: Boolean

    Permalink

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

    Permalink
    Definition Classes
    AnyRef

  19. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  20. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

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

  22. def parent(implicit tx: S.Tx): BranchLike

    Permalink
    Definition Classes
    LeafImpl → NonEmptyChild

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

    Permalink

  24. def remove()(implicit tx: S.Tx): Unit

    Permalink

  25. def shortString: String

    Permalink
    Definition Classes
    LeafImpl → NonEmpty

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

    Permalink
    Definition Classes
    AnyRef

  27. def toString(): String

    Permalink
    Definition Classes
    NonEmpty → AnyRef → Any

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

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

    Permalink
    Definition Classes
    LeafImpl → LeftNonEmptyChild

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

    Permalink
    Definition Classes
    LeafImpl → RightNonEmptyChild

  31. val value: A

    Permalink
    Definition Classes
    LeafImpl → Leaf

  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( ... )

  35. def write(out: DataOutput): Unit

    Permalink
    Definition Classes
    LeafImpl → Writable

Inherited from Leaf

Inherited from LeafOrEmpty

Inherited from RightNonEmptyChild

Inherited from RightChild

Inherited from LeftNonEmptyChild

Inherited from Writable

Inherited from LeftChild

Inherited from NonEmptyChild

Inherited from Child

Inherited from LeftNonEmpty

Inherited from NonEmpty

Inherited from Identifiable[S.ID]

Inherited from Left

Inherited from AnyRef

Inherited from Any

Ungrouped