MemIndexGraph

abstract def graph: MemGraph

abstract def iri: String

An empty uri means that there is no URI assigned.

final def !=(arg0: Any): Boolean

final def ##(): Int

final def +(label: Ontology): Node

def ++(graph: Graph): Unit

final def ==(arg0: Any): Boolean

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

lazy val @typeIndex: Index

def add(graph: Graph): Unit

final def asInstanceOf[T0]: T0

def buildAsyncTraversersStream[Start <: ClassType[_], End <: ClassType[_], Steps <: HList, Out](traversal: Traversal[Start, End, Steps])(ct: ClassType[_]): Task[Stream[Out]]

def buildTraversersStream[Start <: ClassType[_], End <: ClassType[_], Steps <: HList, Out](traversal: Traversal[Start, End, Steps])(ct: ClassType[_]): Stream[Out]

def clone(): AnyRef

def close(): Unit

val computer: DefaultStreamComputer

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

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

def createIndex(pattern: Vector[Set[_ <: ClassType[_]]]): Index

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

def deleteEdge(edge: GEdge[_, _]): Unit

deletes the Edge from the graph

def deleteIndex(pattern: Vector[Set[_ <: ClassType[_]]]): Unit

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[MemIndexGraph.this.type]

def edges: Edges

Edges A.K.A.

final def eq(arg0: AnyRef): Boolean

def equals(o: Any): Boolean

def finalize(): Unit

def find(values: Vector[Map[_ <: ClassType[_], List[P[_]]]]): List[Vector[Resource[_]]]

def find[T](predicates: List[P[T]], property: Property): List[Resource[T]]

def find[T](predicates: List[P[T]], datatype: DataType[T]): List[Resource[T]]

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

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

final def getClass(): Class[_]

def getIndex(pattern: Set[_ <: ClassType[_]]): Option[Index]

def getIndex(pattern: Vector[Set[_ <: ClassType[_]]]): Option[Index]

def getOrCreateIndex(pattern: Set[_ <: ClassType[_]]): Index

def getOrCreateIndex(pattern: Vector[Set[_ <: ClassType[_]]]): Index

def getOrCreateNode(id: Long): GNode

lazy val hashCode: Int

lazy val idProvider: IdProvider

val indexes: HashMap[Vector[Set[_ <: ClassType[_]]], Index]

def init(): Unit

final def isInstanceOf[T0]: Boolean

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]

def newNode(id: Long): GNode

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

val nodeStore: MemNodeStore[MemIndexGraph.this.type]

def nodes: Nodes

Nodes A.K.A.

final def notify(): Unit

final def notifyAll(): Unit

def ns: NameSpaceGraph

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: MemIndexGraph.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

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

val valueStore: MemValueStore[MemIndexGraph.this.type]

def values: Values

final def wait(): Unit

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

final def wait(arg0: Long): Unit