Lucre-data/de.sciss.lucre.data/HASkipList/Set

Set

trait Set[T <: Exec[T], A] extends Set[T, A] with HASkipList[T, A, A]
Companion
object
trait HASkipList[T, A, A]
trait Set[T, A]
trait SkipList[T, A, A]
trait Mutable[T]
trait Disposable[T]
trait Writable
trait Identified[T]
class Object
trait Matchable
class Any

Value members

Inherited methods

def +=(entry: A)(tx: T): Set[T, A]
Inherited from
SkipList
def -=(key: A)(tx: T): Set[T, A]
Inherited from
SkipList
def add(key: A)(tx: T): Boolean

Inserts a new key into the set.

Inserts a new key into the set.

Value Params
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

Inherited from
Set
def ceil(key: A)(tx: T): 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.

Value Params
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)

Inherited from
SkipList
def clear(tx: T): Unit
Inherited from
SkipList
def contains(key: A)(tx: T): Boolean

Searches for the Branch of a given key.

Searches for the Branch of a given key.

Value Params
key

the key to search for

Returns

true if the key is in the list, false otherwise

Inherited from
SkipList
def debugPrint(tx: T): String
Inherited from
SkipList
def dispose(tx: T): Unit
Inherited from
Disposable
override def equals(that: Any): Boolean
Definition Classes
Identified -> Any
Inherited from
Identified
def firstKey(tx: T): A
Inherited from
SkipList
def floor(key: A)(tx: T): 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.

Value Params
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)

Inherited from
SkipList
override def hashCode: Int
Definition Classes
Identified -> Any
Inherited from
Identified
def head(tx: T): A

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

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

Inherited from
SkipList
def headOption(tx: T): Option[A]

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

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

Inherited from
SkipList
def height(tx: T): Int

The number of levels in the skip list.

The number of levels in the skip list.

Inherited from
SkipList
def id: Ident[T]
Inherited from
Identified
def indexInNodeL(key: A, n: Node[T, A, A])(tx: T): Int
Inherited from
HASkipList
def indexInNodeR(key: A, n: Node[T, A, A])(tx: T): Int

Finds the right-most key which is greater than or equal to the query key.

Finds the right-most key which is greater than or equal to the query key.

Value Params
key

the key to search for

n

the branch or leaf from which to go down

Returns

the index to go down (a node whose key is greater than key), or -(index+1) if key was found at index

Inherited from
HASkipList
def isEmpty(tx: T): Boolean
Inherited from
SkipList
def isomorphicQuery(compare: A => Int)(tx: T): (A, Int)

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.

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.

Value Params
compare

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

Inherited from
SkipList
def iterator(tx: T): Iterator[A]
Inherited from
SkipList
def keyFormat: TFormat[T, A]
Inherited from
SkipList
def last(tx: T): A

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

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

Inherited from
SkipList
def lastKey(tx: T): A
Inherited from
SkipList
def lastOption(tx: T): Option[A]

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

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

Inherited from
SkipList
def maxGap: Int

The maximum gap within elements of each skip level.

The maximum gap within elements of each skip level.

Inherited from
SkipList
def minGap: Int

The minimum gap within elements of each skip level.

The minimum gap within elements of each skip level.

Inherited from
SkipList
def nonEmpty(tx: T): Boolean
Inherited from
SkipList
def remove(key: A)(tx: T): Boolean

Removes a key from the set.

Removes a key from the set.

Value Params
key

the key to remove

Returns

true if the key was found and removed, false if it was not found

Inherited from
Set
def size(tx: T): Int

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.

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.

Inherited from
SkipList
def toIndexedSeq(tx: T): IndexedSeq[A]
Inherited from
SkipList
def toList(tx: T): List[A]
Inherited from
SkipList
def toSeq(tx: T): Seq[A]
Inherited from
SkipList
def toSet(tx: T): Set[A]
Inherited from
SkipList
def top(tx: T): Option[Node[T, A, A]]
Inherited from
HASkipList
def write(out: DataOutput): Unit
Inherited from
Writable

Implicits

Inherited implicits

implicit def ordering: TOrdering[T, A]

The ordering used for the keys of this list.

The ordering used for the keys of this list.

Inherited from
SkipList