class
MemTransaction extends Transaction
Instance Constructors
-
new
MemTransaction(parent: MemGraph)
Type Members
-
trait
Edges extends Transaction.Edges
-
type
GEdge[S, E] = _Edge[S, E] with MemEdge[S, E]
-
-
-
type
GValue[T] = _Value[T] with MemValue[T]
-
trait
Nodes extends Transaction.Nodes
-
sealed
trait
RApi[T <: Resource[_]] extends AnyRef
-
trait
Resources extends Transaction.Resources
-
trait
Values extends Transaction.Values
-
abstract
class
_Edge[S, E] extends _Resource[Edge[S, E]] with Edge[S, E]
-
-
-
case class
_TEdge[S, E](self: _Edge[S, E]) extends _Edge[S, E] with TEdge[S, E] with Product with Serializable
-
case class
_TNode(self: _Node) extends _Node with TNode with Product with Serializable
-
-
case class
_TValue[T](self: _Value[T]) extends _Value[T] with TValue[T] with Product with Serializable
-
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
def
*>[ST <: ClassType[_], ET <: ClassType[_], Segments <: HList, Steps <: HList, RSteps <: HList, Containers <: HList, F[_], Out, CT <: ClassType[Out]](traversal: librarian.traversal.Traversal[ST, ET, Segments])(implicit flat: Aux[SegmentMapper.type, Segments, Steps], reverse: Aux[Steps, RSteps], f: Aux[RSteps, ContainerSteps.type, Containers], lf: Aux[Containers, ET, Out, CT], guide: Guide[F], mapper: Mapper[F, Out]): FT
-
-
-
final
def
==(arg0: Any): Boolean
-
lazy val
@idIndex: Index
-
-
lazy val
@typeIndex: Index
-
-
def
_indexEdge[S, E](edge: GEdge[S, E]): Unit
-
def
_indexNode(node: GNode): Unit
-
-
final
def
asInstanceOf[T0]: T0
-
implicit
lazy val
assistent: Assistent
-
def
clone(): AnyRef
-
def
close(): CancelableFuture[Unit]
-
def
commit(): Unit
-
def
createEdge[S, E](id: Long, from: GResource[S], key: Property, to: GResource[E]): GEdge[S, E]
-
def
createEdge(id: Long, from: Long, key: Property, to: Long): GEdge[Any, Any]
-
def
createValue[T](_id: Long, _value: T, dt: DataType[T]): GValue[T]
-
def
deleteEdge(edge: GEdge[_, _]): Unit
-
def
deleteNode(node: GNode): Unit
-
def
deleteResource[T <: _Resource[_]](resource: T): Unit
-
def
deleteValue(value: GValue[_]): Unit
-
-
def
edges: Edges
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(o: Any): Boolean
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
getOrCreateNode(id: Long): GNode
-
implicit
lazy val
guide: Guide[Observable]
-
lazy val
hashCode: Int
-
lazy val
idProvider: IdProvider
-
-
lazy val
init: CancelableFuture[Unit]
-
val
iri: String
-
final
def
isInstanceOf[T0]: Boolean
-
def
isOpen: Boolean
-
def
mergeNodes(nodes: Set[Node]): Task[Node]
-
def
mergeValues[V](values: Set[Value[V]]): Task[Value[V]]
-
final
def
ne(arg0: AnyRef): Boolean
-
def
newEdge(id: Long, from: Long, key: Property, to: Long): GEdge[Any, Any]
-
-
val
newEdgeLock: AnyRef
-
def
newNode(id: Long): GNode
-
def
newValue[T](id: Long, value: T, label: DataType[T]): GValue[T]
-
val
newValueLock: AnyRef
-
-
def
nodes: Nodes
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
-
var
open: Boolean
-
-
def
persist: CancelableFuture[Unit]
-
-
def
rollback(): Unit
-
def
storeEdge(edge: GEdge[_, _]): Unit
-
def
storeNode(node: GNode): Unit
-
def
storeValue(value: GValue[_]): Unit
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
lazy val
thisgraph: MemTransaction.this.type
-
def
toFile(path: String = "defaultname.json", process: (Stream[Resource[_]], (String) ⇒ Unit) ⇒ String): Task[Unit]
-
def
toString(): String
-
-
-
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
def
wrapTR[T <: GResource[_]](resource: T): _Resource[_]
Deprecated Value Members
-
-
Inherited from AnyRef
Inherited from Any