MemGraph

abstract def idProvider: IdProvider

abstract def init: CancelableFuture[Unit]

abstract def iri: String

An empty uri means that there is no URI assigned.

abstract def ns: NameSpaceGraph

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 +(label: Ontology): Node

val ++: (structure.Graph) ⇒ structure.Graph

final def ==(arg0: Any): Boolean

val @idStore: ValueStore[MemGraph.this.type]

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

def add: (structure.Graph) ⇒ structure.Graph

final def asInstanceOf[T0]: T0

implicit lazy val assistent: Assistent

def clone(): AnyRef

def close(): CancelableFuture[Unit]

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

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

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 deleteResource[T <: _Resource[_]](resource: T): Unit

delete in-/out-going edges from the resource

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

deletes the Value from the graph

val edgeStore: MemEdgeStore[MemGraph.this.type]

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

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 newEdge(id: Long, from: Long, key: Property, to: Long): GEdge[Any, Any]

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

val newEdgeLock: AnyRef

def newNode(id: Long): GNode

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

val newValueLock: AnyRef

val nodeStore: MemNodeStore[MemGraph.this.type]

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

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

def toString(): String

def transaction: Transaction

creates new transaction

val valueStore: MemValueStore[MemGraph.this.type]

def values: Values

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def g(): librarian.traversal.Traversal[DataType[structure.Graph], DataType[structure.Graph], HNil]

lazy val traversal: librarian.traversal.Traversal[DataType[structure.Graph], DataType[structure.Graph], HNil]