Set

Type Members

type Branch[S <: Sys[S], A] = HASkipList.Branch[S, A, A]
type Leaf[S <: Sys[S], A] = HASkipList.Leaf[S, A, A]
type Node[S <: Sys[S], A] = HASkipList.Node[S, A, A]

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( ... )
def empty[S <: Sys[S], A](minGap: Int = 2, keyObserver: KeyObserver[Set.empty.S.Tx, A] = SkipList.NoKeyObserver)(implicit tx: Set.empty.S.Tx, ord: Ordering[Set.empty.S.Tx, A], keySerializer: Serializer[Set.empty.S.Tx, Set.empty.S.Acc, A]): Set[S, A]

Creates a new empty skip list.
Creates a new empty skip list. Type parameter S specifies the STM system to use. Type parameter A specifies the type of the keys stored in the list.
minGap
the minimum gap-size used for the skip list. This value must be between 1 and 126 inclusive.
keyObserver
an object which observes key promotions and demotions. Use NoKeyObserver (default) if key motions do not need to be monitored. The monitoring allows the use of the skip list for synchronized decimation of related data structures, such as the deterministic skip quadtree.
tx
the transaction in which to initialize the structure
ord
the ordering of the keys. This is an instance of txn.Ordering to allow for specialized versions and transactional restrictions.
keySerializer
the serializer for the elements, in case a persistent STM is used.
def empty[S <: Sys[S], A](implicit tx: Set.empty.S.Tx, ord: Ordering[Set.empty.S.Tx, A], keySerializer: Serializer[Set.empty.S.Tx, Set.empty.S.Acc, A]): Set[S, A]

Creates a new empty skip list with default minimum gap parameter of 2 and no key observer.
Creates a new empty skip list with default minimum gap parameter of 2 and no key observer. Type parameter S specifies the STM system to use. Type parameter A specifies the type of the keys stored in the list.
tx
the transaction in which to initialize the structure
ord
the ordering of the keys. This is an instance of txn.Ordering to allow for specialized versions and transactional restrictions.
keySerializer
the serializer for the elements, in case a persistent STM is used.
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
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
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
def read[S <: Sys[S], A](in: DataInput, access: Set.read.S.Acc, keyObserver: KeyObserver[Set.read.S.Tx, A] = SkipList.NoKeyObserver)(implicit tx: Set.read.S.Tx, ordering: Ordering[Set.read.S.Tx, A], keySerializer: Serializer[Set.read.S.Tx, Set.read.S.Acc, A]): Set[S, A]
def serializer[S <: Sys[S], A](keyObserver: KeyObserver[Set.serializer.S.Tx, A] = SkipList.NoKeyObserver)(implicit ordering: Ordering[Set.serializer.S.Tx, A], keySerializer: Serializer[Set.serializer.S.Tx, Set.serializer.S.Acc, A]): Serializer[Set.serializer.S.Tx, Set.serializer.S.Acc, Set[S, A]]
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: trait Set | package HASkipList

object Set

Type Members

type Branch[S <: Sys[S], A] = HASkipList.Branch[S, A, A]

type Leaf[S <: Sys[S], A] = HASkipList.Leaf[S, A, A]

type Node[S <: Sys[S], A] = HASkipList.Node[S, A, A]

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def empty[S <: Sys[S], A](minGap: Int = 2, keyObserver: KeyObserver[Set.empty.S.Tx, A] = SkipList.NoKeyObserver)(implicit tx: Set.empty.S.Tx, ord: Ordering[Set.empty.S.Tx, A], keySerializer: Serializer[Set.empty.S.Tx, Set.empty.S.Acc, A]): Set[S, A]

def empty[S <: Sys[S], A](implicit tx: Set.empty.S.Tx, ord: Ordering[Set.empty.S.Tx, A], keySerializer: Serializer[Set.empty.S.Tx, Set.empty.S.Acc, A]): Set[S, A]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: 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

def read[S <: Sys[S], A](in: DataInput, access: Set.read.S.Acc, keyObserver: KeyObserver[Set.read.S.Tx, A] = SkipList.NoKeyObserver)(implicit tx: Set.read.S.Tx, ordering: Ordering[Set.read.S.Tx, A], keySerializer: Serializer[Set.read.S.Tx, Set.read.S.Acc, A]): Set[S, A]

def serializer[S <: Sys[S], A](keyObserver: KeyObserver[Set.serializer.S.Tx, A] = SkipList.NoKeyObserver)(implicit ordering: Ordering[Set.serializer.S.Tx, A], keySerializer: Serializer[Set.serializer.S.Tx, Set.serializer.S.Acc, A]): Serializer[Set.serializer.S.Tx, Set.serializer.S.Acc, Set[S, A]]

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 AnyRef

Inherited from Any

Ungrouped