Class/Object

lspace.lgraph

LTransaction

Related Docs: object LTransaction | package lgraph

Permalink

class LTransaction extends Transaction

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

Instance Constructors

  1. new LTransaction(parent: LGraph)

    Permalink

Type Members

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

    Permalink
    Definition Classes
    MemGraph → Graph
  2. type GNode = _Node with MemNode

    Permalink
    Definition Classes
    MemGraph → Graph
  3. type GResource[T] = _Resource[T] with MemResource[T]

    Permalink
    Definition Classes
    MemGraph → Graph
  4. type GValue[T] = _Value[T] with MemValue[T]

    Permalink
    Definition Classes
    MemGraph → 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. class _TEdge[S, E] extends provider.transaction.Transaction._Edge[S, E] with MemEdge[S, E] with _TResource[structure.Edge[S, E]] with TEdge[S, E]

    Permalink
    Definition Classes
    Transaction
  9. class _TNode extends provider.transaction.Transaction._Node with _TResource[structure.Node] with MemNode with TNode

    Permalink
    Definition Classes
    Transaction
  10. trait _TResource[T] extends provider.transaction.Transaction._Resource[T] with MemResource[T] with TResource[T]

    Permalink
    Definition Classes
    Transaction
  11. class _TValue[T] extends provider.transaction.Transaction._Value[T] with MemValue[T] with _TResource[T] with TValue[T]

    Permalink
    Definition Classes
    Transaction
  12. abstract class _Value[T] extends _Resource[T] with structure.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. 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. val @idStore: MemValueStore[LTransaction.this.type]

    Permalink
    Attributes
    protected[lspace.provider.mem]
    Definition Classes
    MemGraph
  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. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  13. def close(): Task[Unit]

    Permalink
    Definition Classes
    Graph
  14. def commit(): Task[Unit]

    Permalink
    Definition Classes
    LTransaction → Transaction
  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
    Transaction → DataGraph → Graph
  16. def createValue[T](_id: Long, _value: T, dt: datatype.DataType[T]): Task[GValue[T]]

    Permalink
    Attributes
    protected[lspace]
    Definition Classes
    Transaction → DataGraph → Graph
  17. def deleteEdge(edge: _Edge[_, _]): Task[Unit]

    Permalink
    Attributes
    protected[lspace]
    Definition Classes
    LTransaction → Transaction → DataGraph → Graph
  18. def deleteNode(node: _Node): Task[Unit]

    Permalink
    Attributes
    protected[lspace]
    Definition Classes
    LTransaction → Transaction → DataGraph → Graph
  19. def deleteResource[T <: _Resource[_]](resource: T): Task[Unit]

    Permalink
    Attributes
    protected
    Definition Classes
    MemGraph → Graph
  20. def deleteValue(value: _Value[_]): Task[Unit]

    Permalink
    Attributes
    protected[lspace]
    Definition Classes
    LTransaction → Transaction → DataGraph → Graph
  21. val edgeStore: MemEdgeStore[LTransaction.this.type]

    Permalink
    Attributes
    protected[lspace]
    Definition Classes
    MemGraph → Graph
  22. def edges: TEdges[LTransaction.this.type]

    Permalink
    Definition Classes
    Transaction → Graph
  23. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  24. def equals(o: Any): Boolean

    Permalink
    Definition Classes
    IriResource → AnyRef → Any
  25. 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
  26. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  27. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  28. def getOrCreateNode(id: Long): Task[GNode]

    Permalink
    Attributes
    protected[lspace]
    Definition Classes
    Transaction → DataGraph → Graph
  29. implicit lazy val guide: Guide[Observable]

    Permalink
    Definition Classes
    Graph
  30. lazy val hashCode: Int

    Permalink
    Definition Classes
    Graph → AnyRef → Any
  31. lazy val idProvider: IdProvider

    Permalink
    Attributes
    protected[lspace]
    Definition Classes
    Transaction → Graph
  32. val index: MemIndexGraph

    Permalink
    Definition Classes
    LTransaction → DataGraph
  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
    DataGraph → Graph
  36. val iri: String

    Permalink
    Definition Classes
    LTransaction → IriResource
  37. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  38. def isOpen: Boolean

    Permalink
    Definition Classes
    Transaction
  39. def mergeNodes(nodes: Set[structure.Node]): Task[structure.Node]

    Permalink
    Definition Classes
    GraphUtils
  40. def mergeValues[V](values: Set[structure.Value[V]]): Task[structure.Value[V]]

    Permalink
    Definition Classes
    GraphUtils
  41. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  42. def newEdge[S, E](id: Long, from: _Resource[S], key: structure.Property, to: _Resource[E]): GEdge[S, E]

    Permalink
    Attributes
    protected[lspace]
    Definition Classes
    Transaction → MemGraph → Graph
  43. val newEdgeLock: AnyRef

    Permalink
    Attributes
    protected[this]
    Definition Classes
    MemGraph
  44. def newNode(id: Long): GNode

    Permalink
    Attributes
    protected[lspace]
    Definition Classes
    Transaction → MemGraph → Graph
  45. def newValue[T](id: Long, value: T, label: datatype.DataType[T]): GValue[T]

    Permalink
    Attributes
    protected[lspace]
    Definition Classes
    Transaction → MemGraph → Graph
  46. val newValueLock: AnyRef

    Permalink
    Attributes
    protected[this]
    Definition Classes
    MemGraph
  47. val nodeStore: MemNodeStore[LTransaction.this.type]

    Permalink
    Attributes
    protected[lspace]
    Definition Classes
    MemGraph → Graph
  48. def nodes: TNodes[LTransaction.this.type]

    Permalink
    Definition Classes
    Transaction → Graph
  49. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  50. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  51. lazy val ns: NameSpaceGraph

    Permalink
    Definition Classes
    Transaction → Graph
  52. var open: Boolean

    Permalink
    Attributes
    protected
    Definition Classes
    Transaction
  53. val parent: LGraph

    Permalink
    Definition Classes
    LTransaction → Transaction
  54. def persist: Task[Unit]

    Permalink
    Definition Classes
    Graph
  55. def purge: Task[Unit]

    Permalink
    Definition Classes
    DataGraph → Graph
  56. def resources: TResources[LTransaction.this.type]

    Permalink
    Definition Classes
    Transaction → Graph
  57. def rollback(): Task[Unit]

    Permalink

    clears the transaction's MemGraph

    clears the transaction's MemGraph

    Definition Classes
    LTransaction → Transaction
  58. def storeEdge(edge: _Edge[_, _]): Task[Unit]

    Permalink
    Attributes
    protected
    Definition Classes
    Graph
  59. def storeNode(node: _Node): Task[Unit]

    Permalink
    Attributes
    protected[lspace]
    Definition Classes
    DataGraph → Graph
  60. def storeValue(value: _Value[_]): Task[Unit]

    Permalink
    Attributes
    protected
    Definition Classes
    Graph
  61. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  62. lazy val thisgraph: LTransaction.this.type

    Permalink
    Definition Classes
    Graph
  63. def toFile(path: String, process: (Observable[structure.Resource[_]], (String) ⇒ Unit) ⇒ Task[String]): Task[Unit]

    Permalink
    Definition Classes
    MemGraph
  64. def toString(): String

    Permalink
    Definition Classes
    Graph → AnyRef → Any
  65. def transaction: Transaction

    Permalink
    Definition Classes
    MemGraph → Graph
  66. val valueStore: MemValueStore[LTransaction.this.type]

    Permalink
    Attributes
    protected[lspace]
    Definition Classes
    MemGraph → Graph
  67. def values: TValues[LTransaction.this.type]

    Permalink
    Definition Classes
    Transaction → Graph
  68. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  69. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  70. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  71. def wrapTR[T <: LGraph._Resource[_]](resource: T): Coeval[GResource[_]]

    Permalink
    Definition Classes
    Transaction

Inherited from Transaction

Inherited from MemDataGraph

Inherited from DataGraph

Inherited from MemGraph

Inherited from structure.Graph

Inherited from GraphUtils

Inherited from IriResource

Inherited from AnyRef

Inherited from Any

Ungrouped