DataGraph

abstract def @idIndex: Index

abstract def @typeIndex: Index

abstract def buildAsyncTraversersStream[ST <: ClassType[_], ET <: ClassType[_], Segments <: HList, Out](traversal: Traversal[ST, ET, Segments]): Task[Stream[Out]]

abstract def buildTraversersStream[ST <: ClassType[_], ET <: ClassType[_], Segments <: HList, Out](traversal: Traversal[ST, ET, Segments]): Stream[Out]

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

TODO: rename to _deleteProperties/_deleteEdges?

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

abstract def idProvider: IdProvider

abstract def index: IndexGraph

abstract def iri: String

An empty uri means that there is no URI assigned.

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

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

abstract def newNode(id: Long): GNode

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

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

abstract def ns: NameSpaceGraph

abstract def transaction: Transaction

creates new transaction

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

final def !=(arg0: Any): Boolean

final def ##(): Int

final def +(label: Ontology): Node

val ++: (Graph) ⇒ Graph

final def ==(arg0: Any): Boolean

def __[Start, End](implicit cltblStart: ClassTypeable[Start], cltblEnd: ClassTypeable[End]): Traversal[CT, CT, HNil]

def _indexEdge[S, E](edge: GEdge[S, E]): Unit

def _indexNode(node: GNode): Unit

def add: (Graph) ⇒ Graph

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def close(): CancelableFuture[Unit]

def createEdge[S, E](id: Long, _from: GResource[S], key: Property, _to: GResource[E]): GEdge[S, E]

creates, stores and indexes an edge

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

deletes the Edge from the graph

def deleteNode(node: GNode): Unit

deletes the Node from the graph

def deleteValue(value: GValue[_]): Unit

deletes the Value from the graph

def edges: Edges

final def eq(arg0: AnyRef): Boolean

def equals(o: Any): Boolean

def finalize(): Unit

def g(graph: Graph*): Traversal[DataType[Graph], DataType[Graph], HNil]

def g: Traversal[DataType[Graph], DataType[Graph], HNil]

final def getClass(): Class[_]

def getOrCreateNode(id: Long): GNode

lazy val hashCode: Int

lazy val init: CancelableFuture[Unit]

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: CancelableFuture[Unit]

def resources: Resources

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

def toString(): String

lazy val traversal: Traversal[DataType[Graph], DataType[Graph], HNil]

def values: Values

final def wait(): Unit

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

final def wait(arg0: Long): Unit