class MemTransaction extends Transaction
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- MemTransaction
- Transaction
- MemDataGraph
- DataGraph
- MemGraph
- Graph
- GraphUtils
- IriResource
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Type Members
- type GEdge[S, E] = _Edge[S, E] with MemEdge[S, E]
- type GNode = _Node with MemNode
- type GResource[T] = _Resource[T] with MemResource[T]
- type GValue[T] = _Value[T] with MemValue[T]
-
class
_TEdge[S, E] extends _Edge[S, E] with MemEdge[S, E] with _TResource[structure.Edge[S, E]] with TEdge[S, E]
- Definition Classes
- Transaction
-
class
_TNode extends _Node with _TResource[structure.Node] with MemNode with TNode
- Definition Classes
- Transaction
-
trait
_TResource[T] extends _Resource[T] with MemResource[T] with TResource[T]
- Definition Classes
- Transaction
-
class
_TValue[T] extends _Value[T] with MemValue[T] with _TResource[T] with TValue[T]
- Definition Classes
- Transaction
-
abstract
class
_Edge[S, E] extends _Resource[Edge[S, E]] with Edge[S, E]
- Definition Classes
- Graph
-
abstract
class
_Node extends _Resource[Node] with Node
- Definition Classes
- Graph
-
trait
_Resource[+T] extends Resource[T]
- Definition Classes
- Graph
-
abstract
class
_Value[T] extends _Resource[T] with Value[T]
- Definition Classes
- Graph
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
def
*>[ST <: structure.ClassType[_], End, ET[+Z] <: structure.ClassType[Z], Segments <: HList, Steps <: HList, RSteps <: HList, Containers <: HList, F[_]](traversal: librarian.traversal.Traversal[ST, ET[End], Segments])(implicit flat: Aux[SegmentMapper.type, Segments, Steps], reverse: Aux[Steps, RSteps], f: Aux[RSteps, ContainerSteps.type, Containers], guide: Guide[F], mapper: Mapper[F, Containers, End]): FT
- Definition Classes
- Graph
-
final
def
+(label: structure.Ontology): Task[structure.Node]
- Definition Classes
- Graph
-
val
++: (structure.Graph) ⇒ Task[structure.Graph]
- Definition Classes
- Graph
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
@id: String
The @id is a IRI/URI identifier
The @id is a IRI/URI identifier
- returns
a String which is empty if no @id is assigned, TODO: should this be an Option[String]?
- Definition Classes
- IriResource
-
val
@idStore: MemValueStore[MemTransaction.this.type]
- Attributes
- protected[lspace.provider.mem]
- Definition Classes
- MemGraph
-
def
add: (structure.Graph) ⇒ Task[structure.Graph]
- Definition Classes
- Graph
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
implicit
lazy val
assistent: Assistent
- Definition Classes
- Graph
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
def
close(): Task[Unit]
- Definition Classes
- Graph
-
def
commit(): Task[Unit]
- Definition Classes
- MemTransaction → Transaction
-
def
createEdge[S, E](id: Long, from: _Resource[S], key: structure.Property, to: _Resource[E]): Task[GEdge[S, E]]
creates, stores and indexes an edge
creates, stores and indexes an edge
- Attributes
- protected[lspace]
- Definition Classes
- Transaction → DataGraph → Graph
-
def
createValue[T](_id: Long, _value: T, dt: datatype.DataType[T]): Task[GValue[T]]
- Attributes
- protected[lspace]
- Definition Classes
- Transaction → DataGraph → Graph
-
def
deleteEdge(edge: _Edge[_, _]): Task[Unit]
deletes the Edge from the graph
deletes the Edge from the graph
- Attributes
- protected[lspace]
- Definition Classes
- Transaction → DataGraph → Graph
-
def
deleteNode(node: _Node): Task[Unit]
deletes the Node from the graph
deletes the Node from the graph
- Attributes
- protected[lspace]
- Definition Classes
- Transaction → DataGraph → Graph
-
def
deleteResource[T <: _Resource[_]](resource: T): Task[Unit]
delete in-/out-going edges from the resource
-
def
deleteValue(value: _Value[_]): Task[Unit]
deletes the Value from the transaction and marks the id as deleted
deletes the Value from the transaction and marks the id as deleted
- Attributes
- protected[lspace]
- Definition Classes
- Transaction → DataGraph → Graph
- val edgeStore: MemEdgeStore[MemTransaction.this.type]
-
def
edges: TEdges[MemTransaction.this.type]
- Definition Classes
- Transaction → Graph
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(o: Any): Boolean
- Definition Classes
- IriResource → AnyRef → Any
- def executeTraversal[F[_]](traversal: librarian.traversal.Traversal[_ <: structure.ClassType[Any], _ <: structure.ClassType[Any], _ <: HList], guide: Guide[F]): F[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
- Annotations
- @native()
-
def
getOrCreateNode(id: Long): Task[GNode]
- Attributes
- protected[lspace]
- Definition Classes
- Transaction → DataGraph → Graph
-
implicit
lazy val
guide: Guide[Observable]
- Definition Classes
- Graph
-
lazy val
hashCode: Int
- Definition Classes
- Graph → AnyRef → Any
-
lazy val
idProvider: IdProvider
- Attributes
- protected[lspace]
- Definition Classes
- Transaction → Graph
-
val
index: MemIndexGraph
- Definition Classes
- MemTransaction → DataGraph
-
def
indexEdge[S, E](edge: _Edge[S, E]): Task[Unit]
- Attributes
- protected
- Definition Classes
- DataGraph
- def indexNode(node: _Node): Task[Unit]
- lazy val init: Task[Unit]
-
val
iri: String
An empty uri means that there is no URI assigned.
An empty uri means that there is no URI assigned.
- Definition Classes
- MemTransaction → IriResource
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
isOpen: Boolean
- Definition Classes
- Transaction
-
def
mergeNodes(nodes: Set[structure.Node]): Task[structure.Node]
- Definition Classes
- GraphUtils
-
def
mergeValues[V](values: Set[structure.Value[V]]): Task[structure.Value[V]]
- Definition Classes
- GraphUtils
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
newEdge[S, E](id: Long, from: _Resource[S], key: structure.Property, to: _Resource[E]): GEdge[S, E]
- Attributes
- protected[lspace]
- Definition Classes
- Transaction → MemGraph → Graph
-
val
newEdgeLock: AnyRef
- Attributes
- protected[this]
- Definition Classes
- MemGraph
-
def
newNode(id: Long): GNode
- Attributes
- protected[lspace]
- Definition Classes
- Transaction → MemGraph → Graph
-
def
newValue[T](id: Long, value: T, label: datatype.DataType[T]): GValue[T]
- Attributes
- protected[lspace]
- Definition Classes
- Transaction → MemGraph → Graph
-
val
newValueLock: AnyRef
- Attributes
- protected[this]
- Definition Classes
- MemGraph
- val nodeStore: MemNodeStore[MemTransaction.this.type]
-
def
nodes: TNodes[MemTransaction.this.type]
- Definition Classes
- Transaction → Graph
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
lazy val
ns: NameSpaceGraph
- Definition Classes
- Transaction → Graph
-
var
open: Boolean
- Attributes
- protected
- Definition Classes
- Transaction
-
val
parent: MemGraph
- Definition Classes
- MemTransaction → Transaction
-
def
persist: Task[Unit]
- Definition Classes
- Graph
- def purge: Task[Unit]
-
def
resources: TResources[MemTransaction.this.type]
- Definition Classes
- Transaction → Graph
-
def
rollback(): Task[Unit]
clears the transaction's MemGraph
clears the transaction's MemGraph
- Definition Classes
- MemTransaction → Transaction
-
def
storeEdge(edge: _Edge[_, _]): Task[Unit]
- Attributes
- protected
- Definition Classes
- Graph
- def storeNode(node: _Node): Task[Unit]
-
def
storeValue(value: _Value[_]): Task[Unit]
- Attributes
- protected
- Definition Classes
- Graph
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
lazy val
thisgraph: MemTransaction.this.type
- Definition Classes
- Graph
-
def
toFile(path: String = "defaultname.json", process: (Observable[structure.Resource[_]], (String) ⇒ Unit) ⇒ Task[String]): Task[Unit]
- Definition Classes
- MemGraph
-
def
toString(): String
- Definition Classes
- Graph → AnyRef → Any
-
def
transaction: Transaction
creates new transaction
- val valueStore: MemValueStore[MemTransaction.this.type]
-
def
values: TValues[MemTransaction.this.type]
- Definition Classes
- Transaction → Graph
-
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
- @native() @throws( ... )
-
def
wrapTR[T <: MemGraph._Resource[_]](resource: T): Coeval[GResource[_]]
- Definition Classes
- Transaction
-
object
_TEdge
- Definition Classes
- Transaction
-
object
_TNode
- Definition Classes
- Transaction
-
object
_TValue
- Definition Classes
- Transaction