ConfluentLongMapImpl

Instance Constructors

new ConfluentLongMapImpl(store: DataStore, handler: IndexMapHandler[S], isOblivious: Boolean)

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(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 get[A](key: Long, path: Access[S])(implicit tx: S.Tx, ser: Serializer[S.Tx, Access[S], A]): Option[A]

Finds the most recent value for an entity id with respect to version path.
Finds the most recent value for an entity id with respect to version path. If a value is found, it is return along with a suffix suitable for identifier path actualisation.
A
the type of values stored with the entity
key
the identifier for the object
path
the path through which the object has been accessed (the version at which it is read)
tx
the transaction within which the access is performed
returns
None if no value was found, otherwise a Some of the tuple consisting of the suffix and the value. The suffix is the access path minus the prefix at which the value was found. However, the suffix overlaps the prefix in that it begins with the tree entering/exiting tuple at which the value was found.

Definition Classes
DurableConfluentMapImpl → DurablePersistentMap
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
final def getImmutable[A](key: Long, path: Access[S])(implicit tx: S.Tx, ser: ImmutableSerializer[A]): Option[A]

Finds the most recent value for an entity id with respect to version path.
Finds the most recent value for an entity id with respect to version path.
The serializer given is _non_transactional. This is because this trait bridges confluent and ephemeral world (it may use a durable backend, but the data structures used for storing the confluent graph are themselves ephemeral). If the value A requires a transactional serialization, the current approach is to pre-serialize the value into an appropriate format (e.g. a byte array) before calling into put. In that case the wrapping structure must be de-serialized after calling get.
A
the type of values stored with the entity
key
the identifier for the object
path
the path through which the object has been accessed (the version at which it is read)
tx
the transaction within which the access is performed
returns
None if no value was found, otherwise a Some of that value.

Definition Classes
DurableConfluentMapImpl → DurablePersistentMap
val handler: IndexMapHandler[S]

Attributes
protected
Definition Classes
ConfluentLongMapImpl → DurableConfluentMapImpl
def hashCode(): Int

Definition Classes
AnyRef → Any
final def isFresh(key: Long, path: Access[S])(implicit tx: S.Tx): Boolean

Note: requires that path is non-empty.
Note: requires that path is non-empty.

Definition Classes
DurableConfluentMapImpl → DurablePersistentMap
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
val isOblivious: Boolean

Attributes
protected
Definition Classes
ConfluentLongMapImpl → DurableConfluentMapImpl
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 put[A](key: Long, path: Access[S], value: A)(implicit tx: S.Tx, ser: Serializer[S.Tx, Access[S], A]): Unit

Definition Classes
DurableConfluentMapImpl → DurablePersistentMap
final def putImmutable[A](key: Long, path: Access[S], value: A)(implicit tx: S.Tx, ser: ImmutableSerializer[A]): Unit

Stores a new value for a given write path.
Stores a new value for a given write path.
The serializer given is _non_transactional. This is because this trait bridges confluent and ephemeral world (it may use a durable backend, but the data structures used for storing the confluent graph are themselves ephemeral). If the value A requires a transactional serialization, the current approach is to pre-serialize the value into an appropriate format (e.g. a byte array) before calling into put. In that case the wrapping structure must be de-serialized after calling get.
A
the type of values stored with the entity
key
the identifier for the object
path
the path through which the object has been accessed (the version at which it is read)
value
the value to store
tx
the transaction within which the access is performed

Definition Classes
DurableConfluentMapImpl → DurablePersistentMap
def remove(key: Long, index: Access[S])(implicit tx: S.Tx): Boolean

Definition Classes
DurableConfluentMapImpl → DurablePersistentMap
val store: DataStore

Attributes
protected
Definition Classes
ConfluentLongMapImpl → DurableConfluentMapImpl
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( ... )
def writeKey(key: Long, out: DataOutput): Unit

Attributes
protected
Definition Classes
ConfluentLongMapImpl → DurableConfluentMapImpl

Related Doc: package impl

final class ConfluentLongMapImpl[S <: Sys[S]] extends DurableConfluentMapImpl[S, Long]

Instance Constructors

new ConfluentLongMapImpl(store: DataStore, handler: IndexMapHandler[S], isOblivious: Boolean)

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(arg0: Any): Boolean

def finalize(): Unit

final def get[A](key: Long, path: Access[S])(implicit tx: S.Tx, ser: Serializer[S.Tx, Access[S], A]): Option[A]

final def getClass(): Class[_]

final def getImmutable[A](key: Long, path: Access[S])(implicit tx: S.Tx, ser: ImmutableSerializer[A]): Option[A]

val handler: IndexMapHandler[S]

def hashCode(): Int

final def isFresh(key: Long, path: Access[S])(implicit tx: S.Tx): Boolean

final def isInstanceOf[T0]: Boolean

val isOblivious: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

final def put[A](key: Long, path: Access[S], value: A)(implicit tx: S.Tx, ser: Serializer[S.Tx, Access[S], A]): Unit

final def putImmutable[A](key: Long, path: Access[S], value: A)(implicit tx: S.Tx, ser: ImmutableSerializer[A]): Unit

def remove(key: Long, index: Access[S])(implicit tx: S.Tx): Boolean

val store: DataStore

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

def writeKey(key: Long, out: DataOutput): Unit

Inherited from DurableConfluentMapImpl[S, Long]

Inherited from DurablePersistentMap[S, Long]

Inherited from AnyRef

Inherited from Any

Ungrouped