Trait/Object

lspace.lgraph

LHistory

Related Docs: object LHistory | package lgraph

Permalink

trait LHistory extends LDataGraph with History

Linear Supertypes
History, LDataGraph, DataGraph, LGraph, structure.Graph, GraphUtils, IriResource, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. LHistory
  2. History
  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 idProvider: IdProvider

    Permalink
    Attributes
    protected[lspace]
    Definition Classes
    Graph

  2. abstract def index: LIndexGraph

    Permalink
    Definition Classes
    LDataGraph → DataGraph

  3. abstract def iri: String

    Permalink
    Definition Classes
    IriResource

  4. abstract def ns: LNSGraph

    Permalink
    Definition Classes
    LGraph → Graph

  5. abstract def storeManager: StoreManager[LHistory.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 add: (structure.Graph) ⇒ Task[structure.Graph]

    Permalink
    Definition Classes
    Graph

  9. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  10. implicit lazy val assistent: Assistent

    Permalink
    Definition Classes
    Graph

  11. def clone(): AnyRef

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

  12. def close(): Task[Unit]

    Permalink
    Definition Classes
    LGraph → Graph

  13. 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
    History → Graph

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

    Permalink
    Attributes
    protected[lspace]
    Definition Classes
    History → Graph

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

    Permalink
    Attributes
    protected[lspace]
    Definition Classes
    History → Graph

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

    Permalink
    Attributes
    protected[lspace]
    Definition Classes
    History → Graph

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

    Permalink
    Attributes
    protected[lspace]
    Definition Classes
    LGraph → Graph

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

    Permalink
    Attributes
    protected[lspace]
    Definition Classes
    History → Graph

  19. lazy val edgeStore: LEdgeStore[LHistory.this.type]

    Permalink
    Attributes
    protected[lspace]
    Definition Classes
    LGraph → Graph

  20. def edges: Edges

    Permalink
    Definition Classes
    Graph

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

    Permalink
    Definition Classes
    AnyRef

  22. def equals(o: Any): Boolean

    Permalink
    Definition Classes
    IriResource → AnyRef → Any

  23. 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

  24. def finalize(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink
    Attributes
    protected[lspace]
    Definition Classes
    History → Graph

  27. implicit lazy val guide: Guide[Observable]

    Permalink
    Definition Classes
    Graph

  28. lazy val hashCode: Int

    Permalink
    Definition Classes
    Graph → AnyRef → Any

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

    Permalink
    Attributes
    protected
    Definition Classes
    DataGraph

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

    Permalink
    Attributes
    protected[lspace]
    Definition Classes
    DataGraph

  31. lazy val init: Task[Unit]

    Permalink
    Definition Classes
    DataGraph → Graph

  32. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

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

    Permalink
    Definition Classes
    GraphUtils

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

    Permalink
    Definition Classes
    GraphUtils

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

    Permalink
    Definition Classes
    AnyRef

  36. 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

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

    Permalink
    Attributes
    protected[lspace]
    Definition Classes
    LGraph → Graph

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

    Permalink
    Attributes
    protected[lspace]
    Definition Classes
    LGraph → Graph

  39. lazy val nodeStore: LNodeStore[LHistory.this.type]

    Permalink
    Attributes
    protected[lspace]
    Definition Classes
    LGraph → Graph

  40. def nodes: Nodes

    Permalink
    Definition Classes
    Graph

  41. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  42. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  43. def persist: Task[Unit]

    Permalink
    Definition Classes
    LDataGraph → Graph

  44. def purge: Task[Unit]

    Permalink
    Definition Classes
    DataGraph → Graph

  45. def resources: Resources

    Permalink
    Definition Classes
    Graph

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

    Permalink
    Attributes
    protected
    Definition Classes
    Graph

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

    Permalink
    Attributes
    protected[lspace]
    Definition Classes
    DataGraph → Graph

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

    Permalink
    Attributes
    protected
    Definition Classes
    Graph

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

    Permalink
    Definition Classes
    AnyRef

  50. lazy val thisgraph: LHistory.this.type

    Permalink
    Definition Classes
    Graph

  51. def toString(): String

    Permalink
    Definition Classes
    Graph → AnyRef → Any

  52. def transaction: Transaction

    Permalink
    Definition Classes
    LGraph → Graph

  53. lazy val valueStore: LValueStore[LHistory.this.type]

    Permalink
    Attributes
    protected[lspace]
    Definition Classes
    LGraph → Graph

  54. def values: Values

    Permalink
    Definition Classes
    Graph

  55. final def wait(): Unit

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

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

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

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

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

  58. object writeedge

    Permalink
    Definition Classes
    LGraph

  59. object writenode

    Permalink
    Definition Classes
    LGraph

  60. object writevalue

    Permalink
    Definition Classes
    LGraph

Inherited from History

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