Packages

trait Map[S <: Base[S], A, B] extends SkipList[S, A, (A, B)]

Linear Supertypes
SkipList[S, A, (A, B)], Mutable[S.Id, S.Tx], Disposable[S.Tx], Writable, Identifiable[S.Id], AnyRef, Any
Known Subclasses
Map
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Map
  2. SkipList
  3. Mutable
  4. Disposable
  5. Writable
  6. Identifiable
  7. AnyRef
  8. 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
    Definition Classes
    SkipList
  2. abstract def -=(key: A)(implicit tx: S.Tx): Map.this.type
    Definition Classes
    SkipList
  3. abstract def ceil(key: A)(implicit tx: S.Tx): Option[(A, B)]

     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
  4. abstract def clear()(implicit tx: S.Tx): Unit
    Definition Classes
    SkipList
  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

    Definition Classes
    SkipList
  6. abstract def debugPrint()(implicit tx: S.Tx): String
    Definition Classes
    SkipList
  7. abstract def dispose()(implicit tx: S.Tx): Unit
    Definition Classes
    Disposable
  8. abstract def firstKey(implicit tx: S.Tx): A
    Definition Classes
    SkipList
  9. abstract def floor(key: A)(implicit tx: S.Tx): Option[(A, B)]

    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]

    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

  11. abstract def getOrElse[B1 >: B](key: A, default: ⇒ B1)(implicit tx: S.Tx): B1
  12. abstract def getOrElseUpdate(key: A, op: ⇒ B)(implicit tx: S.Tx): B
  13. abstract def head(implicit tx: S.Tx): (A, B)

    Returns the first element.

    Returns the first element. Throws an exception if the list is empty.

    Definition Classes
    SkipList
  14. abstract def headOption(implicit tx: S.Tx): Option[(A, B)]

    Returns the first element, or None if the list is empty.

    Returns the first element, or None if the list is empty.

    Definition Classes
    SkipList
  15. abstract def height(implicit tx: S.Tx): Int

    The number of levels in the skip list.

    The number of levels in the skip list.

    Definition Classes
    SkipList
  16. abstract def id: S.Id
    Definition Classes
    Identifiable
  17. abstract def isEmpty(implicit tx: S.Tx): Boolean
    Definition Classes
    SkipList
  18. abstract def isomorphicQuery(ord: Ordered[S.Tx, A])(implicit tx: S.Tx): ((A, B), 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

    Definition Classes
    SkipList
  19. abstract def iterator(implicit tx: S.Tx): Iterator[(A, B)]
    Definition Classes
    SkipList
  20. abstract def keySerializer: Serializer[S.Tx, S.Acc, A]
    Definition Classes
    SkipList
  21. abstract def keysIterator(implicit tx: S.Tx): Iterator[A]
  22. abstract def last(implicit tx: S.Tx): (A, B)

    Returns the last element.

    Returns the last element. Throws an exception if the list is empty.

    Definition Classes
    SkipList
  23. abstract def lastKey(implicit tx: S.Tx): A
    Definition Classes
    SkipList
  24. abstract def lastOption(implicit tx: S.Tx): Option[(A, B)]

    Returns the last element, or None if the list is empty.

    Returns the last element, or None if the list is empty.

    Definition Classes
    SkipList
  25. abstract def maxGap: Int

    The maximum gap within elements of each skip level.

    The maximum gap within elements of each skip level.

    Definition Classes
    SkipList
  26. abstract def minGap: Int

    The minimum gap within elements of each skip level.

    The minimum gap within elements of each skip level.

    Definition Classes
    SkipList
  27. abstract def nonEmpty(implicit tx: S.Tx): Boolean
    Definition Classes
    SkipList
  28. implicit abstract def ordering: Ordering[S.Tx, A]

    The ordering used for the keys of this list.

    The ordering used for the keys of this list.

    Definition Classes
    SkipList
  29. abstract def put(key: A, value: B)(implicit tx: S.Tx): Option[B]

    Inserts a new entry into the map.

    Inserts a new entry into the map.

    key

    the entry's key to insert

    value

    the entry's value to insert

    returns

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

  30. abstract def remove(key: A)(implicit tx: S.Tx): Option[B]

    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

  31. 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.

    Definition Classes
    SkipList
  32. abstract def toIndexedSeq(implicit tx: S.Tx): IndexedSeq[(A, B)]
    Definition Classes
    SkipList
  33. abstract def toList(implicit tx: S.Tx): List[(A, B)]
    Definition Classes
    SkipList
  34. abstract def toSeq(implicit tx: S.Tx): Seq[(A, B)]
    Definition Classes
    SkipList
  35. abstract def toSet(implicit tx: S.Tx): scala.Predef.Set[(A, B)]
    Definition Classes
    SkipList
  36. abstract def valuesIterator(implicit tx: S.Tx): Iterator[B]
  37. 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( ... )
  6. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  7. def equals(that: Any): Boolean
    Definition Classes
    Identifiable → AnyRef → Any
  8. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  9. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  10. def hashCode(): Int
    Definition Classes
    Identifiable → AnyRef → Any
  11. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  12. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  13. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  14. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  15. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  16. def toString(): String
    Definition Classes
    AnyRef → Any
  17. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  18. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  19. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )

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