DetachedGraph

Type Members

type GEdge[S, E] = _Edge[S, E] with MemEdge[S, E]

Definition Classes
MemGraph → Graph
type GNode = _Node with MemNode

Definition Classes
MemGraph → Graph
type GResource[T] = _Resource[T] with MemResource[T]

Definition Classes
MemGraph → Graph
type GValue[T] = _Value[T] with MemValue[T]

Definition Classes
MemGraph → Graph
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[DetachedGraph.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
@throws( ... )
def close(): Task[Unit]

Definition Classes
Graph
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
DataGraph → Graph
def createValue[T](_id: Long, _value: T, dt: datatype.DataType[T]): Task[GValue[T]]

Attributes
protected[lspace]
Definition Classes
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
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
DataGraph → Graph
def deleteResource[T <: _Resource[_]](resource: T): Task[Unit]

delete in-/out-going edges from the resource
delete in-/out-going edges from the resource

Attributes
protected
Definition Classes
MemGraph → Graph
def deleteValue(value: _Value[_]): Task[Unit]

deletes the Value from the graph
deletes the Value from the graph

Attributes
protected[lspace]
Definition Classes
DataGraph → Graph
val edgeStore: MemEdgeStore[DetachedGraph.this.type]

Attributes
protected[lspace]
Definition Classes
MemGraph → Graph
def edges: Edges

Definition Classes
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]

Attributes
protected[lspace]
Definition Classes
Graph
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 getOrCreateNode(id: Long): Task[GNode]

Attributes
protected[lspace]
Definition Classes
DataGraph → Graph
implicit lazy val guide: Guide[Observable]

Definition Classes
Graph
lazy val hashCode: Int

Definition Classes
Graph → AnyRef → Any
lazy val idProvider: IdProvider

Definition Classes
DetachedGraph → Graph
val index: MemIndexGraph

Definition Classes
DetachedGraph → DataGraph
def indexEdge[S, E](edge: _Edge[S, E]): Task[Unit]

Attributes
protected[lspace]
Definition Classes
DetachedGraph → DataGraph
def indexNode(node: _Node): Task[Unit]

Attributes
protected[lspace]
Definition Classes
DataGraph
lazy val init: Task[Unit]

Definition Classes
DataGraph → Graph
lazy 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
DetachedGraph → IriResource
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
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
MemGraph → Graph
val newEdgeLock: AnyRef

Attributes
protected[this]
Definition Classes
MemGraph
def newNode(id: Long): GNode

Attributes
protected[lspace]
Definition Classes
MemGraph → Graph
def newValue[T](id: Long, value: T, label: datatype.DataType[T]): GValue[T]

Attributes
protected[lspace]
Definition Classes
MemGraph → Graph
val newValueLock: AnyRef

Attributes
protected[this]
Definition Classes
MemGraph
val nodeStore: MemNodeStore[DetachedGraph.this.type]

Attributes
protected[lspace]
Definition Classes
MemGraph → Graph
def nodes: Nodes

Definition Classes
Graph
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
val ns: MemNSGraph

Definition Classes
DetachedGraph → Graph
def persist: Task[Unit]

Definition Classes
Graph
def purge: Task[Unit]

Definition Classes
DataGraph → Graph
def resources: Resources

Definition Classes
Graph
lazy val self: DetachedGraph.type
def storeEdge(edge: _Edge[_, _]): Task[Unit]

Attributes
protected[lspace]
Definition Classes
DetachedGraph → Graph
def storeNode(node: _Node): Task[Unit]

Attributes
protected[lspace]
Definition Classes
DetachedGraph → DataGraph → MemGraph → Graph
def storeValue(value: _Value[_]): Task[Unit]

Attributes
protected[lspace]
Definition Classes
DetachedGraph → Graph
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
lazy val thisgraph: DetachedGraph.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
creates new transaction

Definition Classes
MemGraph → Graph
val valueStore: MemValueStore[DetachedGraph.this.type]

Attributes
protected[lspace]
Definition Classes
MemGraph → Graph
def values: Values

Definition Classes
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
@throws( ... )

Related Doc: package detached

object DetachedGraph extends MemDataGraph

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]

abstract class _Edge[S, E] extends _Resource[Edge[S, E]] with Edge[S, E]

abstract class _Node extends _Resource[Node] with Node

trait _Resource[+T] extends Resource[T]

abstract class _Value[T] extends _Resource[T] with Value[T]

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def +(label: structure.Ontology): Task[structure.Node]

val ++: (structure.Graph) ⇒ Task[structure.Graph]

final def ==(arg0: Any): Boolean

def @id: String

val @idStore: MemValueStore[DetachedGraph.this.type]

def add: (structure.Graph) ⇒ Task[structure.Graph]

final def asInstanceOf[T0]: T0

implicit lazy val assistent: Assistent

def clone(): AnyRef

def close(): Task[Unit]

def createEdge[S, E](id: Long, from: _Resource[S], key: structure.Property, to: _Resource[E]): Task[GEdge[S, E]]

def createValue[T](_id: Long, _value: T, dt: datatype.DataType[T]): Task[GValue[T]]

def deleteEdge(edge: _Edge[_, _]): Task[Unit]

def deleteNode(node: _Node): Task[Unit]

def deleteResource[T <: _Resource[_]](resource: T): Task[Unit]

def deleteValue(value: _Value[_]): Task[Unit]

val edgeStore: MemEdgeStore[DetachedGraph.this.type]

def edges: Edges

final def eq(arg0: AnyRef): Boolean

def equals(o: Any): Boolean

def executeTraversal[F[_]](traversal: librarian.traversal.Traversal[_ <: structure.ClassType[Any], _ <: structure.ClassType[Any], _ <: HList], guide: Guide[F]): F[Any]

def finalize(): Unit

final def getClass(): Class[_]

def getOrCreateNode(id: Long): Task[GNode]

implicit lazy val guide: Guide[Observable]

lazy val hashCode: Int

lazy val idProvider: IdProvider

val index: MemIndexGraph

def indexEdge[S, E](edge: _Edge[S, E]): Task[Unit]

def indexNode(node: _Node): Task[Unit]

lazy val init: Task[Unit]

lazy val iri: String

final def isInstanceOf[T0]: Boolean

def mergeNodes(nodes: Set[structure.Node]): Task[structure.Node]

def mergeValues[V](values: Set[structure.Value[V]]): Task[structure.Value[V]]

final def ne(arg0: AnyRef): Boolean

def newEdge[S, E](id: Long, from: _Resource[S], key: structure.Property, to: _Resource[E]): GEdge[S, E]

val newEdgeLock: AnyRef

def newNode(id: Long): GNode

def newValue[T](id: Long, value: T, label: datatype.DataType[T]): GValue[T]

val newValueLock: AnyRef

val nodeStore: MemNodeStore[DetachedGraph.this.type]

def nodes: Nodes

final def notify(): Unit

final def notifyAll(): Unit

val ns: MemNSGraph

def persist: Task[Unit]

def purge: Task[Unit]

def resources: Resources

lazy val self: DetachedGraph.type

def storeEdge(edge: _Edge[_, _]): Task[Unit]

def storeNode(node: _Node): Task[Unit]

def storeValue(value: _Value[_]): Task[Unit]

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

lazy val thisgraph: DetachedGraph.this.type

def toFile(path: String = "defaultname.json", process: (Observable[structure.Resource[_]], (String) ⇒ Unit) ⇒ Task[String]): Task[Unit]

def toString(): String

def transaction: Transaction

val valueStore: MemValueStore[DetachedGraph.this.type]

def values: Values

final def wait(): Unit

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

final def wait(arg0: Long): Unit

Inherited from MemDataGraph

Inherited from DataGraph