Mixin

Type Members

final type Acc = Unit

The path access type for objects if they carry a temporal trace.
The path access type for objects if they carry a temporal trace. This is used by confluently persistent systems, while it is typically Unit for ephemeral systems.

Definition Classes
DurableLike → Sys
final type Entry[A] = stm.Var[S.Tx, A]

An entry is similar to a variable in that it can be transactionally read and written.
An entry is similar to a variable in that it can be transactionally read and written. However, in a confluently persistent system, a data structure can only be correctly read and written, if any element in that structure was reached by starting from an Entry access point.

Definition Classes
DurableLike → Sys
abstract type I <: InMemoryLike[I]

Definition Classes
DurableLike
final type ID = DurableLike.ID[S]

The identifier type of the system.
The identifier type of the system. This is an opaque type about which the user only knows that it uniquely identifies and object (or an object along with its access path in the confluent case). It is thus valid to assume that two objects are equal if their identifiers are equal.

Definition Classes
DurableLike → Sys
abstract type Tx <: DurableLike.Txn[S]

The transaction type of the system.
The transaction type of the system.

Definition Classes
DurableLike → Sys
final type Var[A] = stm.Var[S.Tx, A]

The variable type of the system.
The variable type of the system. Variables allow transactional storage and retrieval both of immutable and mutable values. Specific systems may extend the minimum capabilities described by the Var trait.

Definition Classes
DurableLike → Sys

Abstract Value Members

abstract def inMemory: I

Definition Classes
DurableLike
abstract def store: DataStore

Attributes
protected
abstract def wrap(peer: InTxn): S.Tx

Definition Classes
DurableLike

Concrete Value Members

final def !=(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def !=(arg0: Any): Boolean

Definition Classes
Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def ==(arg0: Any): Boolean

Definition Classes
Any
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws()
def close(): Unit

Closes the underlying database (if the system is durable).
Closes the underlying database (if the system is durable). The STM cannot be used beyond this call. An in-memory system should have a no-op implementation.

Definition Classes
Mixin → Sys
def debugListUserRecords()(implicit tx: S.Tx): Seq[ID]

Definition Classes
Mixin → DurableLike
final def eq(arg0: AnyRef): Boolean

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

Definition Classes
AnyRef → Any
def exists(id: Long)(implicit tx: S.Tx): Boolean

Definition Classes
Mixin → DurableLike
def exists(id: Int)(implicit tx: S.Tx): Boolean

Definition Classes
Mixin → DurableLike
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws()
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
def newIDValue()(implicit tx: S.Tx): Int

Definition Classes
Mixin → DurableLike
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def numRecords(implicit tx: S.Tx): Int

Reports the current number of records stored in the database.
Reports the current number of records stored in the database.

Definition Classes
Mixin → DurableLike
def numUserRecords(implicit tx: S.Tx): Int

Reports the current number of user records stored in the database.
Reports the current number of user records stored in the database. That is the number of records minus those records used for database maintenance.

Definition Classes
Mixin → DurableLike
def position(implicit tx: S.Tx): Unit

Definition Classes
Mixin → Cursor
def read[A](id: Int)(valueFun: (DataInput) ⇒ A)(implicit tx: S.Tx): A

Definition Classes
Mixin → DurableLike
def remove(id: Int)(implicit tx: S.Tx): Unit

Definition Classes
Mixin → DurableLike
def remove(id: Long)(implicit tx: S.Tx): Unit

Definition Classes
Mixin → DurableLike
def root[A](init: (S.Tx) ⇒ A)(implicit serializer: Serializer[S.Tx, Unit, A]): stm.Var[S.Tx, A]

Reads the root object representing the stored data structure, or provides a newly initialized one via the init argument, if no root has been stored yet.
Reads the root object representing the stored data structure, or provides a newly initialized one via the init argument, if no root has been stored yet.

Definition Classes
Mixin → Sys
def step[A](fun: (S.Tx) ⇒ A): A

Definition Classes
Mixin → Cursor
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
def tryRead[A](id: Long)(valueFun: (DataInput) ⇒ A)(implicit tx: S.Tx): Option[A]

Definition Classes
Mixin → DurableLike
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()
def write(id: Int)(valueFun: (DataOutput) ⇒ Unit)(implicit tx: S.Tx): Unit

Definition Classes
Mixin → DurableLike
def write(id: Long)(valueFun: (DataOutput) ⇒ Unit)(implicit tx: S.Tx): Unit

Definition Classes
Mixin → DurableLike

trait Mixin[S <: D[S], I <: Sys[I]] extends DurableLike[S]

Type Members

final type Acc = Unit

final type Entry[A] = stm.Var[S.Tx, A]

abstract type I <: InMemoryLike[I]

final type ID = DurableLike.ID[S]

abstract type Tx <: DurableLike.Txn[S]

final type Var[A] = stm.Var[S.Tx, A]

Abstract Value Members

abstract def inMemory: I

abstract def store: DataStore

abstract def wrap(peer: InTxn): S.Tx

Concrete Value Members

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def close(): Unit

def debugListUserRecords()(implicit tx: S.Tx): Seq[ID]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def exists(id: Long)(implicit tx: S.Tx): Boolean

def exists(id: Int)(implicit tx: S.Tx): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

def newIDValue()(implicit tx: S.Tx): Int

final def notify(): Unit

final def notifyAll(): Unit

def numRecords(implicit tx: S.Tx): Int

def numUserRecords(implicit tx: S.Tx): Int

def position(implicit tx: S.Tx): Unit

def read[A](id: Int)(valueFun: (DataInput) ⇒ A)(implicit tx: S.Tx): A

def remove(id: Int)(implicit tx: S.Tx): Unit

def remove(id: Long)(implicit tx: S.Tx): Unit

def root[A](init: (S.Tx) ⇒ A)(implicit serializer: Serializer[S.Tx, Unit, A]): stm.Var[S.Tx, A]

def step[A](fun: (S.Tx) ⇒ A): A

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

def toString(): String

def tryRead[A](id: Long)(valueFun: (DataInput) ⇒ A)(implicit tx: S.Tx): Option[A]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def write(id: Int)(valueFun: (DataOutput) ⇒ Unit)(implicit tx: S.Tx): Unit

def write(id: Long)(valueFun: (DataOutput) ⇒ Unit)(implicit tx: S.Tx): Unit

Inherited from DurableLike[S]

Inherited from Cursor[S]

Inherited from Sys[S]

Inherited from AnyRef

Inherited from Any

Ungrouped