de.sciss.lucre.data

SkipList

sealed trait SkipList[S <: Sys[S], A, E] extends Mutable[data.SkipList.S.ID, data.SkipList.S.Tx]

Linear Supertypes
Mutable[S.ID, S.Tx], Disposable[S.Tx], Writable, Identifiable[S.ID], AnyRef, Any
Known Subclasses
Map, Map, Set, Set
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. SkipList
  2. Mutable
  3. Disposable
  4. Writable
  5. Identifiable
  6. AnyRef
  7. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract def +=(entry: E)(implicit tx: S.Tx): SkipList.this.type

  2. abstract def -=(key: A)(implicit tx: S.Tx): SkipList.this.type

  3. abstract def ceil(key: A)(implicit tx: S.Tx): Option[E]

     Finds the entry with the smallest key which is greater than or equal to the search key.

     Finds the entry with the smallest key which is greater than or equal to the search key.

    key

    the search key

    returns

    the found entry, or None if there is no key greater than or equal to the search key (e.g. the list is empty)

  4. abstract def clear()(implicit tx: S.Tx): Unit

  5. abstract def contains(key: A)(implicit tx: S.Tx): Boolean

    Searches for the Branch of a given key.

    Searches for the Branch of a given key.

    key

    the key to search for

    returns

    true if the key is in the list, false otherwise

  6. abstract def debugPrint()(implicit tx: S.Tx): String

  7. abstract def dispose()(implicit tx: S.Tx): Unit

    Definition Classes
    Disposable

  8. abstract def floor(key: A)(implicit tx: S.Tx): Option[E]

    Finds the entry with the largest key which is smaller than or equal to the search key.

    Finds the entry with the largest key which is smaller than or equal to the search key.

    key

    the search key

    returns

    the found entry, or None if there is no key smaller than or equal to the search key (e.g. the list is empty)

  9. abstract def height(implicit tx: S.Tx): Int

    The number of levels in the skip list.

  10. abstract def id: S.ID

    Definition Classes
    Identifiable

  11. abstract def isEmpty(implicit tx: S.Tx): Boolean

  12. abstract def isomorphicQuery(ord: Ordered[S.Tx, A])(implicit tx: S.Tx): (E, Int)

    Finds the nearest item equal or greater than an unknown item from an isomorphic set.

    Finds the nearest item equal or greater than an unknown item from an isomorphic set. The isomorphism is represented by a comparison function which guides the binary search.

    ord

    a function that guides the search. should return -1 if the argument is smaller than the search key, 0 if both are equivalent, or 1 if the argument is greater than the search key. E.g., using some mapping, the function could look like mapping.apply(_).compare(queryKey)

    returns

    the nearest item, or the maximum item

  13. abstract def iterator(implicit tx: S.Tx): Iterator[E]

  14. abstract def keySerializer: Serializer[S.Tx, S.Acc, A]

  15. abstract def maxGap: Int

    The maximum gap within elements of each skip level.

  16. abstract def minGap: Int

    The minimum gap within elements of each skip level.

  17. abstract def nonEmpty(implicit tx: S.Tx): Boolean

  18. implicit abstract def ordering: Ordering[S.Tx, A]

    The ordering used for the keys of this list.

  19. abstract def size(implicit tx: S.Tx): Int

    Reports the number of keys in the skip list (size of the bottom level).

    Reports the number of keys in the skip list (size of the bottom level). This operation may take up to O(n) time, depending on the implementation.

  20. abstract def toIndexedSeq(implicit tx: S.Tx): IndexedSeq[E]

  21. abstract def toList(implicit tx: S.Tx): List[E]

  22. abstract def toSeq(implicit tx: S.Tx): Seq[E]

  23. abstract def toSet(implicit tx: S.Tx): Set[E]

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

    Definition Classes
    SkipList → Writable

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 asInstanceOf[T0]: T0

    Definition Classes
    Any

  7. def clone(): AnyRef

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

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

    Definition Classes
    AnyRef

  9. def equals(that: Any): Boolean

    Definition Classes
    Identifiable → AnyRef → Any

  10. def finalize(): Unit

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

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

    Definition Classes
    AnyRef → Any

  12. def hashCode(): Int

    Definition Classes
    Identifiable → AnyRef → Any

  13. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

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

    Definition Classes
    AnyRef

  15. final def notify(): Unit

    Definition Classes
    AnyRef

  16. final def notifyAll(): Unit

    Definition Classes
    AnyRef

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

    Definition Classes
    AnyRef

  18. def toString(): String

    Definition Classes
    AnyRef → Any

  19. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

Inherited from Disposable[S.Tx]

Inherited from Writable

Inherited from Identifiable[S.ID]

Inherited from AnyRef

Inherited from Any

Ungrouped