de.sciss.lucre.data.HASkipList

Map

object Map

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Map
  2. AnyRef
  3. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Type Members

  1. type Branch[S <: Sys[S], A, B] = HASkipList.Branch[S, A, (A, B)]

  2. type Leaf[S <: Sys[S], A, B] = HASkipList.Leaf[S, A, (A, B)]

  3. type Node[S <: Sys[S], A, B] = HASkipList.Node[S, A, (A, B)]

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. def empty[S <: Sys[S], A, B](minGap: Int = 2, keyObserver: KeyObserver[Map.empty.S.Tx, A] = SkipList.NoKeyObserver)(implicit tx: Map.empty.S.Tx, ord: Ordering[Map.empty.S.Tx, A], keySerializer: Serializer[Map.empty.S.Tx, Map.empty.S.Acc, A], valueSerializer: Serializer[Map.empty.S.Tx, Map.empty.S.Acc, B]): Map[S, A, B]

    Creates a new empty skip list.

    Creates a new empty skip list. Type parameter S specifies the STM system to use. Type parameter A specifies the type of the keys stored in the list.

    minGap

    the minimum gap-size used for the skip list. This value must be between 1 and 126 inclusive.

    keyObserver

    an object which observes key promotions and demotions. Use NoKeyObserver (default) if key motions do not need to be monitored. The monitoring allows the use of the skip list for synchronized decimations of related data structures, such as the deterministic skip quadtree.

    tx

    the transaction in which to initialize the structure

    ord

    the ordering of the keys. This is an instance of txn.Ordering to allow for specialized versions and transactional restrictions.

    keySerializer

    the serializer for the elements, in case a persistent STM is used.

  9. def empty[S <: Sys[S], A, B](implicit tx: Map.empty.S.Tx, ord: Ordering[Map.empty.S.Tx, A], keySerializer: Serializer[Map.empty.S.Tx, Map.empty.S.Acc, A], valueSerializer: Serializer[Map.empty.S.Tx, Map.empty.S.Acc, B]): Map[S, A, B]

    Creates a new empty skip list with default minimum gap parameter of 2 and no key observer.

    Creates a new empty skip list with default minimum gap parameter of 2 and no key observer. Type parameter S specifies the STM system to use. Type parameter A specifies the type of the keys stored in the list.

    tx

    the transaction in which to initialize the structure

    ord

    the ordering of the keys. This is an instance of txn.Ordering to allow for specialized versions and transactional restrictions.

    keySerializer

    the serializer for the elements, in case a persistent STM is used.

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

    Definition Classes
    AnyRef
  11. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any
  12. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  13. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  14. def hashCode(): Int

    Definition Classes
    AnyRef → Any
  15. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  16. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  17. final def notify(): Unit

    Definition Classes
    AnyRef
  18. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  19. def read[S <: Sys[S], A, B](in: DataInput, access: Map.read.S.Acc, keyObserver: KeyObserver[Map.read.S.Tx, A] = SkipList.NoKeyObserver)(implicit tx: Map.read.S.Tx, ordering: Ordering[Map.read.S.Tx, A], keySerializer: Serializer[Map.read.S.Tx, Map.read.S.Acc, A], valueSerializer: Serializer[Map.read.S.Tx, Map.read.S.Acc, B]): Map[S, A, B]

  20. def serializer[S <: Sys[S], A, B](keyObserver: KeyObserver[Map.serializer.S.Tx, A] = SkipList.NoKeyObserver)(implicit ordering: Ordering[Map.serializer.S.Tx, A], keySerializer: Serializer[Map.serializer.S.Tx, Map.serializer.S.Acc, A], valueSerializer: Serializer[Map.serializer.S.Tx, Map.serializer.S.Acc, B]): Serializer[Map.serializer.S.Tx, Map.serializer.S.Acc, Map[S, A, B]]

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

    Definition Classes
    AnyRef
  22. def toString(): String

    Definition Classes
    AnyRef → Any
  23. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  24. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  25. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped