Set

Abstract Value Members

abstract def +=(entry: A)(implicit tx: S.Tx): Set.this.type

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

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

Inserts a new key into the set.
Inserts a new key into the set.
key
the key to insert
returns
true if the key was new to the set, false if a node with the given key already existed
abstract def ceil(key: A)(implicit tx: S.Tx): Option[A]

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

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

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

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

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
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
abstract def id: S.ID

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

Definition Classes
SkipList
abstract def isomorphicQuery(ord: Ordered[S.Tx, A])(implicit tx: S.Tx): (A, 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
abstract def iterator(implicit tx: S.Tx): Iterator[A]

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

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

Definition Classes
SkipList
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
abstract def remove(key: A)(implicit tx: S.Tx): Boolean

Removes a key from the set.
Removes a key from the set.
key
the key to remove
returns
true if the key was found and removed, false if it was not found
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
abstract def toIndexedSeq(implicit tx: S.Tx): IndexedSeq[A]

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

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

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

Definition Classes
SkipList
abstract def write(out: DataOutput): Unit

Definition Classes
SkipList → 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
@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
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
final def notifyAll(): Unit

Definition Classes
AnyRef
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
@throws( ... )

Related Docs: object Set | package SkipList

trait Set[S <: Sys[S], A] extends SkipList[S, A, A]

Abstract Value Members

abstract def +=(entry: A)(implicit tx: S.Tx): Set.this.type

abstract def -=(key: A)(implicit tx: S.Tx): Set.this.type

abstract def add(key: A)(implicit tx: S.Tx): Boolean

abstract def ceil(key: A)(implicit tx: S.Tx): Option[A]

abstract def clear()(implicit tx: S.Tx): Unit

abstract def contains(key: A)(implicit tx: S.Tx): Boolean

abstract def debugPrint()(implicit tx: S.Tx): String

abstract def dispose()(implicit tx: S.Tx): Unit

abstract def floor(key: A)(implicit tx: S.Tx): Option[A]

abstract def height(implicit tx: S.Tx): Int

abstract def id: S.ID

abstract def isEmpty(implicit tx: S.Tx): Boolean

abstract def isomorphicQuery(ord: Ordered[S.Tx, A])(implicit tx: S.Tx): (A, Int)

abstract def iterator(implicit tx: S.Tx): Iterator[A]

abstract def keySerializer: Serializer[S.Tx, S.Acc, A]

abstract def maxGap: Int

abstract def minGap: Int

abstract def nonEmpty(implicit tx: S.Tx): Boolean

implicit abstract def ordering: Ordering[S.Tx, A]

abstract def remove(key: A)(implicit tx: S.Tx): Boolean

abstract def size(implicit tx: S.Tx): Int

abstract def toIndexedSeq(implicit tx: S.Tx): IndexedSeq[A]

abstract def toList(implicit tx: S.Tx): List[A]

abstract def toSeq(implicit tx: S.Tx): Seq[A]

abstract def toSet(implicit tx: S.Tx): scala.Predef.Set[A]

abstract def write(out: DataOutput): Unit

Concrete Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

def toString(): String

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

Inherited from SkipList[S, A, A]

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