Packages

  • package root
    Definition Classes
    root
  • package de
    Definition Classes
    root
  • package sciss
    Definition Classes
    de
  • package lucre
    Definition Classes
    sciss
  • package data
    Definition Classes
    lucre
  • object TotalOrder

    A transactional data structure to maintain an ordered sequence of elements such that two random elements can be compared in O(1).

    A transactional data structure to maintain an ordered sequence of elements such that two random elements can be compared in O(1).

    This uses an algorithm from the paper Bender, M. and Cole, R. and Demaine, E. and Farach-Colton, M. and Zito, J., Two simplified algorithms for maintaining order in a list, Algorithms—ESA 2002, pp. 219--223, 2002.

    The relabel method is based on the Python implementation by David Eppstein, as published at http://www.ics.uci.edu/~eppstein/PADS/OrderedSequence.py however a bug resulting in a relabel size of 1 was fixed.

    Original note: "Due to rebalancing on the integer tags used to maintain order, the amortized time per insertion in an n-item list is O(log n)."

    Definition Classes
    data
  • object Set
    Definition Classes
    TotalOrder
  • EmptyEntry
  • Entry
  • EntryOption

final class Entry[S <: Base[S]] extends EntryOption[S] with MutableImpl[S] with Ordered[Set.Entry.S.Tx, Entry[S]]

Linear Supertypes
Ordered[S.Tx, Entry[S]], MutableImpl[S], Mutable[S.Id, S.Tx], Disposable[S.Tx], Writable, Identifiable[S.Id], EntryOption[S], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Entry
  2. Ordered
  3. MutableImpl
  4. Mutable
  5. Disposable
  6. Writable
  7. Identifiable
  8. EntryOption
  9. AnyRef
  10. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. type E = Entry[S]
    Attributes
    protected
    Definition Classes
    EntryOption
  2. type EOpt = EntryOption[S]
    Attributes
    protected
    Definition Classes
    EntryOption

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. def append()(implicit tx: S.Tx): E
  5. def appendMax()(implicit tx: S.Tx): E
  6. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  7. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  8. def compare(that: Entry[S])(implicit tx: S.Tx): Int
    Definition Classes
    Entry → Ordered
  9. final def dispose()(implicit tx: S.Tx): Unit
    Definition Classes
    MutableImpl → Disposable
  10. def disposeData()(implicit tx: S.Tx): Unit
    Attributes
    protected
    Definition Classes
    Entry → MutableImpl
  11. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  12. def equals(that: Any): Boolean
    Definition Classes
    Identifiable → AnyRef → Any
  13. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  14. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  15. def hashCode(): Int
    Definition Classes
    Identifiable → AnyRef → Any
  16. val id: S.Id
    Definition Classes
    Entry → Identifiable
  17. def isDefined: Boolean
    Definition Classes
    Entry → EntryOption
  18. def isEmpty: Boolean
    Definition Classes
    Entry → EntryOption
  19. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  20. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  21. def next(implicit tx: S.Tx): EOpt
  22. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  23. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  24. def orNull: E
    Definition Classes
    Entry → EntryOption
  25. def prepend()(implicit tx: S.Tx): E
  26. def prev(implicit tx: S.Tx): EOpt
  27. def remove()(implicit tx: S.Tx): Unit
  28. def removeAndDispose()(implicit tx: S.Tx): Unit
  29. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  30. def tag(implicit tx: S.Tx): Int
  31. def toString(): String
    Definition Classes
    Entry → MutableImpl → AnyRef → Any
  32. def validate(msg: ⇒ String)(implicit tx: S.Tx): Unit
  33. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  34. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  35. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  36. final def write(out: DataOutput): Unit
    Definition Classes
    MutableImpl → Writable
  37. def writeData(out: DataOutput): Unit
    Attributes
    protected
    Definition Classes
    Entry → MutableImpl

Inherited from Ordered[S.Tx, Entry[S]]

Inherited from MutableImpl[S]

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

Inherited from Disposable[S.Tx]

Inherited from Writable

Inherited from Identifiable[S.Id]

Inherited from EntryOption[S]

Inherited from AnyRef

Inherited from Any

Ungrouped