Graph

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

TODO: rename to _deleteProperties/_deleteEdges?

abstract def edgeStore: EdgeStore[Graph.this.type]

abstract def idProvider: IdProvider

abstract def init: Task[Unit]

abstract def iri: String

An empty uri means that there is no URI assigned.

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

abstract def newNode(id: Long): GNode

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

abstract def nodeStore: NodeStore[Graph.this.type]

abstract def ns: NameSpaceGraph

abstract def transaction: Transaction

creates new transaction

abstract def valueStore: ValueStore[Graph.this.type]

final def !=(arg0: Any): Boolean

final def ##(): Int

def *>[ST <: ClassType[_], End, ET[+Z] <: ClassType[Z], Steps <: HList, Out, OutCT <: ClassType[_], F[_]](traversal: librarian.traversal.Traversal[ST, ET[End], Steps])(implicit tweaker: Aux[ET[End], Steps, Out, OutCT], guide: Guide[F], mapper: Mapper[F, ET[End], OutCT]): FT

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

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

final def ==(arg0: Any): Boolean

def @id: String

The @id is a IRI/URI identifier

def add: (Graph) ⇒ Task[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: 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]

deletes the Edge from the graph

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

deletes the Node from the graph

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

deletes the Value from the graph

def edges: Edges

final def eq(arg0: AnyRef): Boolean

def equals(o: Any): Boolean

def executeTraversal[F[_]](traversal: librarian.traversal.Traversal[_ <: ClassType[Any], _ <: 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

final def isInstanceOf[T0]: 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 nodes: Nodes

final def notify(): Unit

final def notifyAll(): Unit

def persist: Task[Unit]

def purge: Task[Unit]

def resources: Resources

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: Graph.this.type

def toString(): String

def values: Values

final def wait(): Unit

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

final def wait(arg0: Long): Unit