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
  • Map
  • Set

sealed trait Set[S <: Base[S]] extends TotalOrder[S]

Self Type
Set[S]
Linear Supertypes
TotalOrder[S], Mutable[S.Id, S.Tx], Disposable[S.Tx], Writable, Identifiable[S.Id], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Set
  2. TotalOrder
  3. Mutable
  4. Disposable
  5. Writable
  6. Identifiable
  7. AnyRef
  8. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

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

Abstract Value Members

  1. abstract def dispose()(implicit tx: S.Tx): Unit
    Definition Classes
    Disposable
  2. abstract def id: S.Id
    Definition Classes
    Identifiable
  3. abstract def root: E

    The initial element created from which you can start to append and prepend.

    The initial element created from which you can start to append and prepend.

    Definition Classes
    TotalOrder
  4. abstract def sizeVal: S.Var[Int]
    Attributes
    protected
  5. abstract def write(out: DataOutput): Unit
    Definition Classes
    Writable

Concrete 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. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws(classOf[java.lang.CloneNotSupportedException])
  6. final def disposeData()(implicit tx: S.Tx): Unit
    Attributes
    protected
  7. final val empty: EmptyEntry[S]
    Attributes
    protected
  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
    Annotations
    @native()
  12. def hashCode(): Int
    Definition Classes
    Identifiable → AnyRef → Any
  13. final def head(implicit tx: S.Tx): E

    Returns the head element of the structure.

    Returns the head element of the structure. Note that this is O(n) worst case.

    Definition Classes
    Set → TotalOrder
  14. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  15. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  16. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  17. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  18. final def readEntry(in: DataInput, access: S.Acc)(implicit tx: S.Tx): E
  19. final def size(implicit tx: S.Tx): Int

    The number of elements in the order.

    The number of elements in the order. This is 1 for a newly created order (consisting only of the root element). You will rarely need this information except for debugging purpose. The operation is O(1).

    Definition Classes
    Set → TotalOrder
  20. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  21. final def tagList(from: E)(implicit tx: S.Tx): List[Int]
    Definition Classes
    Set → TotalOrder
  22. def toString(): String
    Definition Classes
    Set → AnyRef → Any
  23. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  24. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  25. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws(classOf[java.lang.InterruptedException])
  26. final def writeData(out: DataOutput): Unit
    Attributes
    protected
  27. implicit object EntryOptionSerializer extends Serializer[S.Tx, S.Acc, EOpt]
    Attributes
    protected
  28. implicit object EntrySerializer extends Serializer[S.Tx, S.Acc, E]
    Attributes
    protected

Inherited from TotalOrder[S]

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