Trait

lspace.lgraph

LNSGraph

Related Doc: package lgraph

Permalink

trait LNSGraph extends LDataGraph with NameSpaceGraph

Linear Supertypes
NameSpaceGraph, LDataGraph, DataGraph, LGraph, structure.Graph, GraphUtils, IriResource, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. LNSGraph
  2. NameSpaceGraph
  3. LDataGraph
  4. DataGraph
  5. LGraph
  6. Graph
  7. GraphUtils
  8. IriResource
  9. AnyRef
  10. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. type GEdge[S, E] = _Edge[S, E] with LEdge[S, E]

    Permalink
    Definition Classes
    LGraph → Graph

  2. type GNode = _Node with LNode

    Permalink
    Definition Classes
    LGraph → Graph

  3. type GResource[T] = _Resource[T] with LResource[T]

    Permalink
    Definition Classes
    LGraph → Graph

  4. type GValue[T] = _Value[T] with LValue[T]

    Permalink
    Definition Classes
    LGraph → Graph

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

    Permalink
    Definition Classes
    Graph

  6. abstract class _Node extends _Resource[structure.Node] with structure.Node

    Permalink
    Definition Classes
    Graph

  7. trait _Resource[+T] extends structure.Resource[T]

    Permalink
    Definition Classes
    Graph

  8. abstract class _Value[T] extends _Resource[T] with structure.Value[T]

    Permalink
    Definition Classes
    Graph

Abstract Value Members

  1. abstract def graph: LGraph

    Permalink
    Definition Classes
    LNSGraph → NameSpaceGraph

  2. abstract def index: LIndexGraph

    Permalink
    Definition Classes
    LNSGraph → NameSpaceGraph → LDataGraph → DataGraph

  3. abstract def iri: String

    Permalink
    Definition Classes
    IriResource

  4. abstract def storeManager: StoreManager[LNSGraph.this.type]

    Permalink
    Attributes
    protected[lspace]
    Definition Classes
    LGraph

Concrete Value Members

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

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  3. def *>[ST <: structure.ClassType[_], End, ET[+Z] <: structure.ClassType[Z], Segments <: HList, Steps <: HList, RSteps <: HList, Containers <: HList, F[_]](traversal: librarian.traversal.Traversal[ST, ET[End], Segments])(implicit flat: Aux[SegmentMapper.type, Segments, Steps], reverse: Aux[Steps, RSteps], f: Aux[RSteps, ContainerSteps.type, Containers], guide: Guide[F], mapper: Mapper[F, Containers, End]): FT

    Permalink
    Definition Classes
    Graph

  4. final def +(label: structure.Ontology): Task[structure.Node]

    Permalink
    Definition Classes
    Graph

  5. val ++: (structure.Graph) ⇒ Task[structure.Graph]

    Permalink
    Definition Classes
    Graph

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

    Permalink
    Definition Classes
    AnyRef → Any

  7. def @id: String

    Permalink
    Definition Classes
    IriResource

  8. def _createEdge(resource: structure.Resource[_], key: structure.Property, ct: structure.ClassType[_]): Task[Unit]

    Permalink
    Attributes
    protected[lspace]
    Definition Classes
    NameSpaceGraph

  9. def add: (structure.Graph) ⇒ Task[structure.Graph]

    Permalink
    Definition Classes
    Graph

  10. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  11. implicit lazy val assistent: Assistent

    Permalink
    Definition Classes
    Graph

  12. val classtypes: Classtypes

    Permalink
    Definition Classes
    NameSpaceGraph

  13. def clone(): AnyRef

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

  14. def close(): Task[Unit]

    Permalink
    Definition Classes
    LGraph → Graph

  15. def createEdge[S, E](id: Long, from: _Resource[S], key: structure.Property, to: _Resource[E]): Task[GEdge[S, E]]

    Permalink
    Attributes
    protected[lspace]
    Definition Classes
    DataGraph → Graph

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

    Permalink
    Attributes
    protected[lspace]
    Definition Classes
    DataGraph → Graph

  17. val datatypes: Datatypes

    Permalink
    Definition Classes
    NameSpaceGraph

  18. def deleteEdge(edge: _Edge[_, _]): Task[Unit]

    Permalink
    Attributes
    protected[lspace]
    Definition Classes
    DataGraph → Graph

  19. def deleteNode(node: _Node): Task[Unit]

    Permalink
    Attributes
    protected[lspace]
    Definition Classes
    DataGraph → Graph

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

    Permalink
    Attributes
    protected[lspace]
    Definition Classes
    LGraph → Graph

  21. def deleteValue(value: _Value[_]): Task[Unit]

    Permalink
    Attributes
    protected[lspace]
    Definition Classes
    DataGraph → Graph

  22. lazy val edgeStore: LEdgeStore[LNSGraph.this.type]

    Permalink
    Attributes
    protected[lspace]
    Definition Classes
    LGraph → Graph

  23. def edges: Edges

    Permalink
    Definition Classes
    Graph

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

    Permalink
    Definition Classes
    AnyRef

  25. def equals(o: Any): Boolean

    Permalink
    Definition Classes
    IriResource → AnyRef → Any

  26. def executeTraversal[F[_]](traversal: librarian.traversal.Traversal[_ <: structure.ClassType[Any], _ <: structure.ClassType[Any], _ <: HList], guide: Guide[F]): F[Any]

    Permalink
    Attributes
    protected[lspace]
    Definition Classes
    Graph

  27. def finalize(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef → Any

  29. def getOrCreateNode(id: Long): Task[GNode]

    Permalink
    Attributes
    protected[lspace]
    Definition Classes
    DataGraph → Graph

  30. implicit lazy val guide: Guide[Observable]

    Permalink
    Definition Classes
    Graph

  31. lazy val hashCode: Int

    Permalink
    Definition Classes
    Graph → AnyRef → Any

  32. lazy val idProvider: IdProvider

    Permalink
    Definition Classes
    NameSpaceGraph → Graph

  33. def indexEdge[S, E](edge: _Edge[S, E]): Task[Unit]

    Permalink
    Attributes
    protected
    Definition Classes
    DataGraph

  34. def indexNode(node: _Node): Task[Unit]

    Permalink
    Attributes
    protected[lspace]
    Definition Classes
    DataGraph

  35. lazy val init: Task[Unit]

    Permalink
    Definition Classes
    NameSpaceGraph → DataGraph → Graph

  36. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  37. def mergeNodes(nodes: Set[structure.Node]): Task[structure.Node]

    Permalink
    Definition Classes
    GraphUtils

  38. def mergeValues[V](values: Set[structure.Value[V]]): Task[structure.Value[V]]

    Permalink
    Definition Classes
    GraphUtils

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

    Permalink
    Definition Classes
    AnyRef

  40. def newEdge[S, E](id: Long, from: _Resource[S], key: structure.Property, to: _Resource[E]): GEdge[S, E]

    Permalink
    Attributes
    protected[lspace]
    Definition Classes
    LGraph → Graph

  41. def newNode(id: Long): _Node with LNode

    Permalink
    Attributes
    protected[lspace]
    Definition Classes
    LGraph → Graph

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

    Permalink
    Attributes
    protected[lspace]
    Definition Classes
    LGraph → Graph

  43. lazy val nodeStore: LNodeStore[LNSGraph.this.type]

    Permalink
    Attributes
    protected[lspace]
    Definition Classes
    LGraph → Graph

  44. def nodes: Nodes

    Permalink
    Definition Classes
    Graph

  45. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  46. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  47. def ns: LNSGraph.this.type

    Permalink
    Definition Classes
    NameSpaceGraph → Graph

  48. val ontologies: Ontologies

    Permalink
    Definition Classes
    NameSpaceGraph

  49. def persist: Task[Unit]

    Permalink
    Definition Classes
    LDataGraph → Graph

  50. val properties: Properties

    Permalink
    Definition Classes
    NameSpaceGraph

  51. def purge: Task[Unit]

    Permalink
    Definition Classes
    NameSpaceGraph → DataGraph → Graph

  52. def resources: Resources

    Permalink
    Definition Classes
    Graph

  53. def storeEdge(edge: _Edge[_, _]): Task[Unit]

    Permalink
    Attributes
    protected
    Definition Classes
    Graph

  54. def storeNode(node: _Node): Task[Unit]

    Permalink
    Attributes
    protected[lspace]
    Definition Classes
    DataGraph → Graph

  55. def storeValue(value: _Value[_]): Task[Unit]

    Permalink
    Attributes
    protected
    Definition Classes
    Graph

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

    Permalink
    Definition Classes
    AnyRef

  57. lazy val thisgraph: LNSGraph.this.type

    Permalink
    Definition Classes
    Graph

  58. def toString(): String

    Permalink
    Definition Classes
    Graph → AnyRef → Any

  59. def transaction: Transaction

    Permalink
    Definition Classes
    LGraph → Graph

  60. lazy val valueStore: LValueStore[LNSGraph.this.type]

    Permalink
    Attributes
    protected[lspace]
    Definition Classes
    LGraph → Graph

  61. def values: Values

    Permalink
    Definition Classes
    Graph

  62. final def wait(): Unit

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

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

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

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

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

  65. object writeedge

    Permalink
    Definition Classes
    LGraph

  66. object writenode

    Permalink
    Definition Classes
    LGraph

  67. object writevalue

    Permalink
    Definition Classes
    LGraph

Inherited from NameSpaceGraph

Inherited from LDataGraph

Inherited from DataGraph

Inherited from LGraph

Inherited from structure.Graph

Inherited from GraphUtils

Inherited from IriResource

Inherited from AnyRef

Inherited from Any

Ungrouped