trait History extends Graph

The History-trait ensures data is never deleted but annotated with '@created', '@modified', '@deleted' and '@trancended' tags.

Linear Supertypes
Known Subclasses
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. History
  2. Graph
  3. GraphUtils
  4. IriResource
  5. AnyRef
  6. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. abstract class _Edge[S, E] extends _Resource[Edge[S, E]] with Edge[S, E]
    Definition Classes
    Graph
  2. abstract class _Node extends _Resource[Node] with Node
    Definition Classes
    Graph
  3. trait _Resource[+T] extends Resource[T]
    Definition Classes
    Graph
  4. abstract class _Value[T] extends _Resource[T] with Value[T]
    Definition Classes
    Graph
  5. abstract type GEdge[S, E] <: _Edge[S, E]
    Definition Classes
    Graph
  6. abstract type GNode <: _Node
    Definition Classes
    Graph
  7. abstract type GResource[T] <: _Resource[T]
    Definition Classes
    Graph
  8. abstract type GValue[T] <: _Value[T]
    Definition Classes
    Graph

Abstract Value Members

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

    TODO: rename to _deleteProperties/_deleteEdges?

    TODO: rename to _deleteProperties/_deleteEdges?

    Attributes
    protected
    Definition Classes
    Graph
  2. abstract def edgeStore: EdgeStore[History.this.type]
    Attributes
    protected[lspace]
    Definition Classes
    Graph
  3. abstract def idProvider: IdProvider
    Attributes
    protected[lspace]
    Definition Classes
    Graph
  4. abstract def init: Task[Unit]
    Definition Classes
    Graph
  5. abstract def iri: String

    An empty uri means that there is no URI assigned.

    An empty uri means that there is no URI assigned.

    Definition Classes
    IriResource
  6. abstract def newEdge[S, E](id: Long, from: _Resource[S], key: Property, to: _Resource[E]): GEdge[S, E]
    Attributes
    protected[lspace]
    Definition Classes
    Graph
  7. abstract def newNode(id: Long): GNode
    Attributes
    protected[lspace]
    Definition Classes
    Graph
  8. abstract def newValue[T](id: Long, value: T, label: datatype.DataType[T]): GValue[T]
    Attributes
    protected[lspace]
    Definition Classes
    Graph
  9. abstract def nodeStore: NodeStore[History.this.type]
    Attributes
    protected[lspace]
    Definition Classes
    Graph
  10. abstract def ns: NameSpaceGraph
    Definition Classes
    Graph
  11. abstract def transaction: Transaction

    creates new transaction

    creates new transaction

    Definition Classes
    Graph
  12. abstract def valueStore: ValueStore[History.this.type]
    Attributes
    protected[lspace]
    Definition Classes
    Graph

Concrete Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def *>[ST <: ClassType[_], End, ET[+Z] <: 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
    Definition Classes
    Graph
  4. final def +(label: Ontology): Task[Node]
    Definition Classes
    Graph
  5. val ++: (Graph) ⇒ Task[Graph]
    Definition Classes
    Graph
  6. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  7. def @id: String

    The @id is a IRI/URI identifier

    The @id is a IRI/URI identifier

    returns

    a String which is empty if no @id is assigned, TODO: should this be an Option[String]?

    Definition Classes
    IriResource
  8. def add: (Graph) ⇒ Task[Graph]
    Definition Classes
    Graph
  9. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  10. implicit lazy val assistent: Assistent
    Definition Classes
    Graph
  11. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  12. def close(): Task[Unit]
    Definition Classes
    Graph
  13. def createEdge[S, E](id: Long, from: _Resource[S], key: Property, to: _Resource[E]): Task[GEdge[S, E]]
    Attributes
    protected[lspace]
    Definition Classes
    HistoryGraph
  14. def createValue[T](id: Long, value: T, dt: datatype.DataType[T]): Task[GValue[T]]
    Attributes
    protected[lspace]
    Definition Classes
    HistoryGraph
  15. def deleteEdge(edge: _Edge[_, _]): Task[Unit]

    deletes the Edge from the graph

    deletes the Edge from the graph

    Attributes
    protected[lspace]
    Definition Classes
    HistoryGraph
  16. def deleteNode(node: _Node): Task[Unit]

    deletes the Node from the graph

    deletes the Node from the graph

    Attributes
    protected[lspace]
    Definition Classes
    HistoryGraph
  17. def deleteValue(value: _Value[_]): Task[Unit]

    deletes the Value from the graph

    deletes the Value from the graph

    Attributes
    protected[lspace]
    Definition Classes
    HistoryGraph
  18. def edges: Edges
    Definition Classes
    Graph
  19. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  20. def equals(o: Any): Boolean
    Definition Classes
    IriResource → AnyRef → Any
  21. def executeTraversal[F[_]](traversal: librarian.traversal.Traversal[_ <: ClassType[Any], _ <: ClassType[Any], _ <: HList], guide: Guide[F]): F[Any]
    Attributes
    protected[lspace]
    Definition Classes
    Graph
  22. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  23. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  24. def getOrCreateNode(id: Long): Task[GNode]
    Attributes
    protected[lspace]
    Definition Classes
    HistoryGraph
  25. implicit lazy val guide: Guide[Observable]
    Definition Classes
    Graph
  26. lazy val hashCode: Int
    Definition Classes
    Graph → AnyRef → Any
  27. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  28. def mergeNodes(nodes: Set[Node]): Task[Node]
    Definition Classes
    GraphUtils
  29. def mergeValues[V](values: Set[Value[V]]): Task[Value[V]]
    Definition Classes
    GraphUtils
  30. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  31. def nodes: Nodes
    Definition Classes
    Graph
  32. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  33. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  34. def persist: Task[Unit]
    Definition Classes
    Graph
  35. def purge: Task[Unit]
    Definition Classes
    Graph
  36. def resources: Resources
    Definition Classes
    Graph
  37. def storeEdge(edge: _Edge[_, _]): Task[Unit]
    Attributes
    protected
    Definition Classes
    Graph
  38. def storeNode(node: _Node): Task[Unit]
    Attributes
    protected
    Definition Classes
    Graph
  39. def storeValue(value: _Value[_]): Task[Unit]
    Attributes
    protected
    Definition Classes
    Graph
  40. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  41. lazy val thisgraph: History.this.type
    Definition Classes
    Graph
  42. def toString(): String
    Definition Classes
    Graph → AnyRef → Any
  43. def values: Values
    Definition Classes
    Graph
  44. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  45. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  46. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )

Inherited from Graph

Inherited from GraphUtils

Inherited from IriResource

Inherited from AnyRef

Inherited from Any

Ungrouped