Object

lspace.librarian.provider.mem

MemGraphDefault

Related Doc: package mem

Permalink

object MemGraphDefault extends MemDataGraph

Linear Supertypes
MemDataGraph, DataGraph, MemGraph, Graph, IriResource, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. MemGraphDefault
  2. MemDataGraph
  3. DataGraph
  4. MemGraph
  5. Graph
  6. IriResource
  7. AnyRef
  8. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. trait Edges extends RApi[Edge[_, _]]

    Permalink
    Definition Classes
    Graph

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

    Permalink
    Definition Classes
    MemGraph → Graph

  3. type GNode = _Node with MemNode

    Permalink
    Definition Classes
    MemGraph → Graph

  4. type GResource[T] = _Resource[T] with MemResource[T]

    Permalink
    Definition Classes
    MemGraph → Graph

  5. type GValue[T] = _Value[T] with MemValue[T]

    Permalink
    Definition Classes
    MemGraph → Graph

  6. trait Nodes extends RApi[Node]

    Permalink
    Definition Classes
    Graph

  7. sealed trait RApi[T <: Resource[_]] extends AnyRef

    Permalink
    Definition Classes
    Graph

  8. trait Resources extends RApi[Resource[_]]

    Permalink
    Definition Classes
    Graph

  9. trait Values extends RApi[Value[_]]

    Permalink
    Definition Classes
    Graph

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

    Permalink
    Definition Classes
    Graph

  11. abstract class _Node extends _Resource[Node] with Node

    Permalink
    Definition Classes
    Graph

  12. trait _Resource[+T] extends Resource[T]

    Permalink
    Definition Classes
    Graph

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

    Permalink
    Definition Classes
    Graph

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  3. final def +(label: Ontology): Node

    Permalink
    Definition Classes
    Graph

  4. def ++(graph: Graph): Unit

    Permalink
    Definition Classes
    Graph

  5. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  6. lazy val @idIndex: Index

    Permalink
    Attributes
    protected[lspace.librarian.provider.mem]
    Definition Classes
    MemDataGraph → DataGraph

  7. val @idStore: ValueStore[MemGraphDefault.this.type]

    Permalink
    Attributes
    protected[lspace.librarian.provider.mem]
    Definition Classes
    MemGraph

  8. lazy val @typeIndex: Index

    Permalink
    Attributes
    protected[lspace.librarian.provider.mem]
    Definition Classes
    MemDataGraph → DataGraph

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

    Permalink
    Attributes
    protected
    Definition Classes
    DataGraph

  10. def _indexNode(node: GNode): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    DataGraph

  11. def _indexValue(value: GValue[_]): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    DataGraph

  12. def add(graph: Graph): Unit

    Permalink
    Definition Classes
    Graph

  13. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

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

    Permalink
    Definition Classes
    MemGraph → Graph

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

    Permalink
    Definition Classes
    MemGraph → Graph

  16. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  17. def close(): Unit

    Permalink
    Definition Classes
    Graph

  18. val computer: DefaultStreamComputer

    Permalink
    Definition Classes
    MemGraph

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

    Permalink

    creates, stores and indexes an edge

    creates, stores and indexes an edge

    Attributes
    protected
    Definition Classes
    DataGraph → Graph

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

    Permalink
    Attributes
    protected[lspace.librarian.provider.mem]
    Definition Classes
    MemGraph → Graph

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

    Permalink
    Attributes
    protected
    Definition Classes
    DataGraph → Graph

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

    Permalink

    deletes the Edge from the graph

    deletes the Edge from the graph

    Attributes
    protected
    Definition Classes
    DataGraph → Graph

  23. def deleteNode(node: GNode): Unit

    Permalink

    deletes the Node from the graph

    deletes the Node from the graph

    Attributes
    protected
    Definition Classes
    DataGraph → Graph

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

    Permalink

    delete in-/out-going edges from the resource

    delete in-/out-going edges from the resource

    Attributes
    protected
    Definition Classes
    MemGraph → Graph

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

    Permalink

    deletes the Value from the graph

    deletes the Value from the graph

    Attributes
    protected
    Definition Classes
    DataGraph → Graph

  26. val edgeStore: MemEdgeStore[MemGraphDefault.this.type]

    Permalink
    Attributes
    protected[lspace.librarian.provider.mem]
    Definition Classes
    MemGraph → Graph

  27. def edges: Edges

    Permalink

    Edges A.K.A.

    Edges A.K.A. Links A.K.A. Properties

    Definition Classes
    Graph

  28. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  29. def equals(o: Any): Boolean

    Permalink
    Definition Classes
    IriResource → AnyRef → Any

  30. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

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

    Permalink
    Definition Classes
    Graph

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

    Permalink
    Definition Classes
    Graph

  33. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any

  34. def getOrCreateNode(id: Long): GNode

    Permalink
    Attributes
    protected
    Definition Classes
    DataGraph → Graph

  35. lazy val hashCode: Int

    Permalink
    Definition Classes
    Graph → AnyRef → Any

  36. lazy val idProvider: IdProvider

    Permalink
    Definition Classes
    MemGraphDefault → Graph

  37. val index: MemIndexGraph

    Permalink
    Definition Classes
    MemGraphDefault → DataGraph

  38. def init(): Unit

    Permalink
    Definition Classes
    DataGraph → Graph

  39. val iri: String

    Permalink

    An empty uri means that there is no URI assigned.

    An empty uri means that there is no URI assigned.

    Definition Classes
    MemGraphDefault → IriResource

  40. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  41. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

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

    Permalink
    Attributes
    protected[lspace.librarian.provider.mem]
    Definition Classes
    MemGraph → Graph

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

    Permalink
    Attributes
    protected[lspace.librarian.provider.mem]
    Definition Classes
    MemGraph → Graph

  44. def newNode(id: Long): GNode

    Permalink
    Attributes
    protected[lspace.librarian.provider.mem]
    Definition Classes
    MemGraph → Graph

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

    Permalink
    Attributes
    protected[lspace.librarian.provider.mem]
    Definition Classes
    MemGraph → Graph

  46. val nodeStore: MemNodeStore[MemGraphDefault.this.type]

    Permalink
    Attributes
    protected[lspace.librarian.provider.mem]
    Definition Classes
    MemGraph → Graph

  47. def nodes: Nodes

    Permalink

    Nodes A.K.A.

    Nodes A.K.A. Vertices

    Definition Classes
    Graph

  48. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  49. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  50. val ns: MemNSGraph

    Permalink
    Definition Classes
    MemGraphDefault → Graph

  51. def resources: Resources

    Permalink
    Definition Classes
    Graph

  52. def storeEdge(edge: GEdge[_, _]): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    Graph

  53. def storeNode(node: GNode): Unit

    Permalink
    Attributes
    protected[lspace.librarian.provider.mem]
    Definition Classes
    MemGraph → Graph

  54. def storeValue(value: GValue[_]): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    Graph

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

    Permalink
    Definition Classes
    AnyRef

  56. lazy val thisgraph: MemGraphDefault.this.type

    Permalink
    Definition Classes
    Graph

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

    Permalink
    Definition Classes
    MemGraph

  58. def toString(): String

    Permalink
    Definition Classes
    Graph → AnyRef → Any

  59. def transaction: Transaction

    Permalink

    creates new transaction

    creates new transaction

    Definition Classes
    MemGraph → Graph

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

    Permalink
    Definition Classes
    Graph

  61. val valueStore: MemValueStore[MemGraphDefault.this.type]

    Permalink
    Attributes
    protected[lspace.librarian.provider.mem]
    Definition Classes
    MemGraph → Graph

  62. def values: Values

    Permalink
    Definition Classes
    Graph

  63. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  65. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from MemDataGraph

Inherited from DataGraph

Inherited from MemGraph

Inherited from Graph

Inherited from IriResource

Inherited from AnyRef

Inherited from Any

Ungrouped