sealed trait SkipList[S <: Base[S], A, E] extends Mutable[data.SkipList.S.Id, data.SkipList.S.Tx]
- Alphabetic
- By Inheritance
- SkipList
- Mutable
- Disposable
- Writable
- Identifiable
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Abstract Value Members
- abstract def +=(entry: E)(implicit tx: S.Tx): SkipList.this.type
- abstract def -=(key: A)(implicit tx: S.Tx): SkipList.this.type
-
abstract
def
ceil(key: A)(implicit tx: S.Tx): Option[E]
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
Noneif there is no key greater than or equal to the search key (e.g. the list is empty)
- abstract def clear()(implicit tx: S.Tx): Unit
-
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
trueif the key is in the list,falseotherwise
- abstract def debugPrint()(implicit tx: S.Tx): String
-
abstract
def
dispose()(implicit tx: S.Tx): Unit
- Definition Classes
- Disposable
- abstract def firstKey(implicit tx: S.Tx): A
-
abstract
def
floor(key: A)(implicit tx: S.Tx): Option[E]
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
Noneif there is no key smaller than or equal to the search key (e.g. the list is empty)
-
abstract
def
head(implicit tx: S.Tx): E
Returns the first element.
Returns the first element. Throws an exception if the list is empty.
-
abstract
def
headOption(implicit tx: S.Tx): Option[E]
Returns the first element, or
Noneif the list is empty. -
abstract
def
height(implicit tx: S.Tx): Int
The number of levels in the skip list.
-
abstract
def
id: S.Id
- Definition Classes
- Identifiable
- abstract def isEmpty(implicit tx: S.Tx): Boolean
-
abstract
def
isomorphicQuery(ord: Ordered[S.Tx, A])(implicit tx: S.Tx): (E, 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
- abstract def iterator(implicit tx: S.Tx): Iterator[E]
- abstract def keySerializer: Serializer[S.Tx, S.Acc, A]
-
abstract
def
last(implicit tx: S.Tx): E
Returns the last element.
Returns the last element. Throws an exception if the list is empty.
- abstract def lastKey(implicit tx: S.Tx): A
-
abstract
def
lastOption(implicit tx: S.Tx): Option[E]
Returns the last element, or
Noneif the list is empty. -
abstract
def
maxGap: Int
The maximum gap within elements of each skip level.
-
abstract
def
minGap: Int
The minimum gap within elements of each skip level.
- abstract def nonEmpty(implicit tx: S.Tx): Boolean
-
implicit abstract
def
ordering: Ordering[S.Tx, A]
The ordering used for the keys of this list.
-
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.
- abstract def toIndexedSeq(implicit tx: S.Tx): IndexedSeq[E]
- abstract def toList(implicit tx: S.Tx): List[E]
- abstract def toSeq(implicit tx: S.Tx): Seq[E]
- abstract def toSet(implicit tx: S.Tx): Set[E]
-
abstract
def
write(out: DataOutput): Unit
- Definition Classes
- Writable
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(that: Any): Boolean
- Definition Classes
- Identifiable → AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- Identifiable → AnyRef → Any
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )