Trait/Object

lspace.librarian.structure

Graph

Related Docs: object Graph | package structure

Permalink

trait Graph extends IriResource

Linear Supertypes
IriResource, AnyRef, Any
Known Subclasses
DataGraph, DetachedGraph, History, IndexGraph, MemDataGraph, MemGraph, MemGraphDefault, MemGraphHistory, MemIndexGraph, MemNSGraph, MemTransaction, NameSpaceGraph, Transaction
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Graph
  2. IriResource
  3. AnyRef
  4. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

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

    Permalink

  2. abstract type GEdge[S, E] <: _Edge[S, E]

    Permalink

  3. abstract type GNode <: _Node

    Permalink

  4. abstract type GResource[T] <: _Resource[T]

    Permalink

  5. abstract type GValue[T] <: _Value[T]

    Permalink

  6. trait Nodes extends RApi[Node]

    Permalink

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

    Permalink

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

    Permalink

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

    Permalink

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

    Permalink

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

    Permalink

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

    Permalink

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

    Permalink

Abstract Value Members

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

    Permalink

  2. abstract def buildTraversersStream[ST <: ClassType[_], ET <: ClassType[_], Steps <: HList, Out](traversal: Traversal[ST, ET, Steps])(ct: ClassType[_]): Stream[Out]

    Permalink

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

    Permalink

    TODO: rename to _deleteProperties/_deleteEdges?

    TODO: rename to _deleteProperties/_deleteEdges?

    Attributes
    protected

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

    Permalink
    Attributes
    protected

  5. abstract def idProvider: IdProvider

    Permalink

  6. abstract def init(): Unit

    Permalink

  7. abstract def 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
    IriResource

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

    Permalink
    Attributes
    protected

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

    Permalink
    Attributes
    protected

  10. abstract def newNode(id: Long): GNode

    Permalink
    Attributes
    protected

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

    Permalink
    Attributes
    protected

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

    Permalink
    Attributes
    protected

  13. abstract def ns: NameSpaceGraph

    Permalink

  14. abstract def transaction: Transaction

    Permalink

    creates new transaction

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

    Permalink
    Attributes
    protected

Concrete 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

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

    Permalink

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

    Permalink
    Definition Classes
    AnyRef → Any

  6. def add(graph: Graph): Unit

    Permalink

  7. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  8. def clone(): AnyRef

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

  9. def close(): Unit

    Permalink

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

    Permalink
    Attributes
    protected

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

    Permalink
    Attributes
    protected

  12. def createValue[T](id: Long, value: T, dt: DataType[T]): GValue[T]

    Permalink
    Attributes
    protected

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

    Permalink

    deletes the Edge from the graph

    deletes the Edge from the graph

    Attributes
    protected

  14. def deleteNode(node: GNode): Unit

    Permalink

    deletes the Node from the graph

    deletes the Node from the graph

    Attributes
    protected

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

    Permalink

    deletes the Value from the graph

    deletes the Value from the graph

    Attributes
    protected

  16. def edges: Edges

    Permalink

    Edges A.K.A.

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

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

    Permalink
    Definition Classes
    AnyRef

  18. def equals(o: Any): Boolean

    Permalink
    Definition Classes
    IriResource → AnyRef → Any

  19. def finalize(): Unit

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

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

    Permalink

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

    Permalink

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

    Permalink
    Definition Classes
    AnyRef → Any

  23. def getOrCreateNode(id: Long): GNode

    Permalink
    Attributes
    protected

  24. lazy val hashCode: Int

    Permalink
    Definition Classes
    Graph → AnyRef → Any

  25. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

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

    Permalink
    Definition Classes
    AnyRef

  27. def nodes: Nodes

    Permalink

    Nodes A.K.A.

    Nodes A.K.A. Vertices

  28. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  29. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  30. def resources: Resources

    Permalink

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

    Permalink
    Attributes
    protected

  32. def storeNode(node: GNode): Unit

    Permalink
    Attributes
    protected

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

    Permalink
    Attributes
    protected

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

    Permalink
    Definition Classes
    AnyRef

  35. lazy val thisgraph: Graph.this.type

    Permalink

  36. def toString(): String

    Permalink
    Definition Classes
    Graph → AnyRef → Any

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

    Permalink

  38. def values: Values

    Permalink

  39. final def wait(): Unit

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

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

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

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

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

Inherited from IriResource

Inherited from AnyRef

Inherited from Any

Ungrouped