Trait/Object

de.sciss.lucre.data.HASkipList

Map

Related Docs: object Map | package HASkipList

Permalink

sealed trait Map[S <: Sys[S], A, B] extends SkipList.Map[S, A, B]

Linear Supertypes
SkipList.Map[S, A, B], SkipList[S, A, (A, B)], Mutable[S.ID, S.Tx], Disposable[S.Tx], Writable, Identifiable[S.ID], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Map
  2. Map
  3. SkipList
  4. Mutable
  5. Disposable
  6. Writable
  7. Identifiable
  8. AnyRef
  9. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract def +=(entry: (A, B))(implicit tx: S.Tx): Map.this.type

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

    Permalink
    Definition Classes
    SkipList
  3. abstract def add(entry: (A, B))(implicit tx: S.Tx): Option[B]

    Permalink

    Inserts a new entry into the map.

    Inserts a new entry into the map.

    entry

    the key-value pair to insert

    returns

    the previous value stored at the key, or None if the key was not in the map

    Definition Classes
    Map
  4. abstract def ceil(key: A)(implicit tx: S.Tx): Option[(A, B)]

    Permalink

     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)

    Definition Classes
    SkipList
  5. abstract def clear()(implicit tx: S.Tx): Unit

    Permalink
    Definition Classes
    SkipList
  6. abstract def contains(key: A)(implicit tx: S.Tx): Boolean

    Permalink

    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

    Definition Classes
    SkipList
  7. abstract def debugPrint()(implicit tx: S.Tx): String

    Permalink
    Definition Classes
    SkipList
  8. abstract def dispose()(implicit tx: S.Tx): Unit

    Permalink
    Definition Classes
    Disposable
  9. abstract def floor(key: A)(implicit tx: S.Tx): Option[(A, B)]

    Permalink

    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)

    Definition Classes
    SkipList
  10. abstract def get(key: A)(implicit tx: S.Tx): Option[B]

    Permalink

    Queries the value for a given key.

    Queries the value for a given key.

    key

    the key to look for

    returns

    the value if it was found at the key, otherwise None

    Definition Classes
    Map
  11. abstract def height(implicit tx: S.Tx): Int

    Permalink

    The number of levels in the skip list.

    The number of levels in the skip list.

    Definition Classes
    SkipList
  12. abstract def id: S.ID

    Permalink
    Definition Classes
    Identifiable
  13. abstract def isEmpty(implicit tx: S.Tx): Boolean

    Permalink
    Definition Classes
    SkipList
  14. abstract def isomorphicQuery(ord: Ordered[S.Tx, A])(implicit tx: S.Tx): ((A, B), Int)

    Permalink

    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

    Definition Classes
    SkipList
  15. abstract def iterator(implicit tx: S.Tx): Iterator[(A, B)]

    Permalink
    Definition Classes
    SkipList
  16. abstract def keySerializer: Serializer[S.Tx, S.Acc, A]

    Permalink
    Definition Classes
    SkipList
  17. abstract def keysIterator(implicit tx: S.Tx): Iterator[A]

    Permalink
    Definition Classes
    Map
  18. abstract def maxGap: Int

    Permalink

    The maximum gap within elements of each skip level.

    The maximum gap within elements of each skip level.

    Definition Classes
    SkipList
  19. abstract def minGap: Int

    Permalink

    The minimum gap within elements of each skip level.

    The minimum gap within elements of each skip level.

    Definition Classes
    SkipList
  20. abstract def nonEmpty(implicit tx: S.Tx): Boolean

    Permalink
    Definition Classes
    SkipList
  21. implicit abstract def ordering: Ordering[S.Tx, A]

    Permalink

    The ordering used for the keys of this list.

    The ordering used for the keys of this list.

    Definition Classes
    SkipList
  22. abstract def remove(key: A)(implicit tx: S.Tx): Option[B]

    Permalink

    Removes an entry from the map.

    Removes an entry from the map.

    key

    the key to remove

    returns

    the removed value which had been stored at the key, or None if the key was not in the map

    Definition Classes
    Map
  23. abstract def size(implicit tx: S.Tx): Int

    Permalink

    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.

    Definition Classes
    SkipList
  24. abstract def toIndexedSeq(implicit tx: S.Tx): IndexedSeq[(A, B)]

    Permalink
    Definition Classes
    SkipList
  25. abstract def toList(implicit tx: S.Tx): List[(A, B)]

    Permalink
    Definition Classes
    SkipList
  26. abstract def toSeq(implicit tx: S.Tx): Seq[(A, B)]

    Permalink
    Definition Classes
    SkipList
  27. abstract def toSet(implicit tx: S.Tx): scala.Predef.Set[(A, B)]

    Permalink
    Definition Classes
    SkipList
  28. abstract def top(implicit tx: S.Tx): Option[Node[S, A, (A, B)]]

    Permalink
  29. abstract def valuesIterator(implicit tx: S.Tx): Iterator[B]

    Permalink
    Definition Classes
    Map
  30. abstract def write(out: DataOutput): Unit

    Permalink
    Definition Classes
    SkipList → Writable

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

    Permalink
    Definition Classes
    Any
  5. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  6. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  7. def equals(that: Any): Boolean

    Permalink
    Definition Classes
    Identifiable → AnyRef → Any
  8. def finalize(): Unit

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

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

    Permalink
    Definition Classes
    Identifiable → AnyRef → Any
  11. final def isInstanceOf[T0]: Boolean

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

    Permalink
    Definition Classes
    AnyRef
  13. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  14. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  15. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  16. def toString(): String

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

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

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

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

Inherited from SkipList.Map[S, A, B]

Inherited from SkipList[S, A, (A, B)]

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