trait Set[T <: Exec[T], A] extends SkipList.Set[T, A] with HASkipList[T, A, A]
- Alphabetic
- By Inheritance
- Set
- HASkipList
- Set
- SkipList
- Mutable
- Disposable
- Writable
- Identified
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Abstract Value Members
- abstract def +=(entry: A)(implicit tx: T): Set.this.type
- Definition Classes
- SkipList
- abstract def -=(key: A)(implicit tx: T): Set.this.type
- Definition Classes
- SkipList
- abstract def add(key: A)(implicit tx: T): Boolean
Inserts a new key into the set.
Inserts a new key into the set.
- key
the key to insert
- returns
trueif the key was new to the set,falseif a node with the given key already existed
- Definition Classes
- Set
- abstract def ceil(key: A)(implicit 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.
- 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)
- Definition Classes
- SkipList
- abstract def clear()(implicit tx: T): Unit
- Definition Classes
- SkipList
- abstract def contains(key: A)(implicit tx: T): 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
- Definition Classes
- SkipList
- abstract def debugPrint()(implicit tx: T): String
- Definition Classes
- SkipList
- abstract def dispose()(implicit tx: T): Unit
- Definition Classes
- Disposable
- abstract def firstKey(implicit tx: T): A
- Definition Classes
- SkipList
- abstract def floor(key: A)(implicit 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.
- 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)
- Definition Classes
- SkipList
- abstract def head(implicit tx: T): A
Returns the first element.
Returns the first element. Throws an exception if the list is empty.
- Definition Classes
- SkipList
- abstract def headOption(implicit tx: T): Option[A]
Returns the first element, or
Noneif the list is empty.Returns the first element, or
Noneif the list is empty.- Definition Classes
- SkipList
- abstract def height(implicit tx: T): Int
The number of levels in the skip list.
The number of levels in the skip list.
- Definition Classes
- SkipList
- abstract def id: Ident[T]
- Definition Classes
- Identified
- abstract def indexInNodeL(key: A, n: Node[T, A, A])(implicit tx: T): Int
- Definition Classes
- HASkipList
- abstract def indexInNodeR(key: A, n: Node[T, A, A])(implicit 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.
- 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)ifkeywas found atindex
- Definition Classes
- HASkipList
- abstract def isEmpty(implicit tx: T): Boolean
- Definition Classes
- SkipList
- abstract def isomorphicQuery(compare: (A) => Int)(implicit tx: T): (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.
- 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
- Definition Classes
- SkipList
- abstract def iterator(implicit tx: T): Iterator[A]
- Definition Classes
- SkipList
- abstract def keyFormat: TFormat[T, A]
- Definition Classes
- SkipList
- abstract def last(implicit tx: T): A
Returns the last element.
Returns the last element. Throws an exception if the list is empty.
- Definition Classes
- SkipList
- abstract def lastKey(implicit tx: T): A
- Definition Classes
- SkipList
- abstract def lastOption(implicit tx: T): Option[A]
Returns the last element, or
Noneif the list is empty.Returns the last element, or
Noneif the list is empty.- 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: T): Boolean
- Definition Classes
- SkipList
- implicit abstract def ordering: TOrdering[T, 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: T): Boolean
Removes a key from the set.
Removes a key from the set.
- key
the key to remove
- returns
trueif the key was found and removed,falseif it was not found
- Definition Classes
- Set
- abstract def size(implicit tx: T): 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: T): IndexedSeq[A]
- Definition Classes
- SkipList
- abstract def toList(implicit tx: T): List[A]
- Definition Classes
- SkipList
- abstract def toSeq(implicit tx: T): Seq[A]
- Definition Classes
- SkipList
- abstract def toSet(implicit tx: T): scala.Predef.Set[A]
- Definition Classes
- SkipList
- abstract def top(implicit tx: T): Option[Node[T, A, A]]
- Definition Classes
- HASkipList
- 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[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(that: Any): Boolean
- Definition Classes
- Identified → AnyRef → Any
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def hashCode(): Int
- Definition Classes
- Identified → 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() @HotSpotIntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- AnyRef → Any
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
Deprecated Value Members
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated
- Deprecated