Trait

de.sciss.lucre.data.HASkipList

Leaf

Related Doc: package HASkipList

Permalink

sealed trait Leaf[S <: Sys[S], A, E] extends Node[S, A, E]

Linear Supertypes
Node[S, A, E], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Leaf
  2. Node
  3. AnyRef
  4. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract def copy(newEntries: Vector[E]): Leaf[S, A, E]

    Permalink
    Attributes
    protected

  2. abstract def key(i: Int): A

    Permalink
    Definition Classes
    Node

Concrete 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: Branch[S, A, E]

    Permalink
    Definition Classes
    Leaf → Node

  5. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  6. final def asLeaf: Leaf[S, A, E]

    Permalink
    Definition Classes
    Leaf → Node

  7. def clone(): AnyRef

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

  8. final def entry(idx: Int): E

    Permalink

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

    Permalink
    Definition Classes
    AnyRef

  10. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    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
    AnyRef → Any

  14. final def isBranch: Boolean

    Permalink
    Definition Classes
    Leaf → Node

  15. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  16. final def isLeaf: Boolean

    Permalink
    Definition Classes
    Leaf → Node

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

    Permalink
    Definition Classes
    AnyRef

  18. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  19. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  20. final def size: Int

    Permalink
    Definition Classes
    Leaf → Node

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

    Permalink
    Definition Classes
    AnyRef

  22. def toString(): String

    Permalink
    Definition Classes
    Leaf → AnyRef → Any

  23. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Node[S, A, E]

Inherited from AnyRef

Inherited from Any

Ungrouped