Trait/Object

lspace.lgraph

LGraph

Related Docs: object LGraph | package lgraph

Permalink

trait LGraph extends Graph

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

Type Members

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

    Permalink
    Definition Classes
    Graph
  2. type GEdge[S, E] = _Edge[S, E] with LEdge[S, E]

    Permalink
    Definition Classes
    LGraph → Graph
  3. type GNode = _Node with LNode

    Permalink
    Definition Classes
    LGraph → Graph
  4. abstract type GResource[T] <: _Resource[T]

    Permalink
    Definition Classes
    Graph
  5. type GValue[T] = _Value[T] with LValue[T]

    Permalink
    Definition Classes
    LGraph → Graph
  6. trait Nodes extends RApi[Node]

    Permalink
    Definition Classes
    Graph
  7. sealed trait RApi[T <: Resource[_]] extends AnyRef

    Permalink
    Definition Classes
    Graph
  8. trait Resources extends RApi[Resource[_]]

    Permalink
    Definition Classes
    Graph
  9. trait Values extends RApi[Value[_]]

    Permalink
    Definition Classes
    Graph
  10. abstract class _Edge[S, E] extends _Resource[Edge[S, E]] with Edge[S, E]

    Permalink
    Definition Classes
    Graph
  11. abstract class _Node extends _Resource[Node] with Node

    Permalink
    Definition Classes
    Graph
  12. trait _Resource[+T] extends Resource[T]

    Permalink
    Definition Classes
    Graph
  13. abstract class _Value[T] extends _Resource[T] with Value[T]

    Permalink
    Definition Classes
    Graph

Abstract Value Members

  1. abstract def idProvider: IdProvider

    Permalink
    Definition Classes
    Graph
  2. abstract def init: CancelableFuture[Unit]

    Permalink
    Definition Classes
    Graph
  3. abstract def iri: String

    Permalink
    Definition Classes
    IriResource
  4. abstract def ns: LNSGraph

    Permalink
    Definition Classes
    LGraph → Graph
  5. abstract def storeManager: StoreManager[LGraph.this.type]

    Permalink
    Attributes
    protected[lspace.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. final def +(label: Ontology): Node

    Permalink
    Definition Classes
    Graph
  4. val ++: (Graph) ⇒ Graph

    Permalink
    Definition Classes
    Graph
  5. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  6. def __[Start, End](implicit cltblStart: ClassTypeable[Start], cltblEnd: ClassTypeable[End]): Traversal[CT, CT, HNil]

    Permalink
    Definition Classes
    Graph
  7. def add: (Graph) ⇒ Graph

    Permalink
    Definition Classes
    Graph
  8. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  9. def buildAsyncTraversersStream[Start <: ClassType[_], End <: ClassType[_], Steps <: HList, Out](traversal: Traversal[Start, End, Steps]): Task[Stream[Out]]

    Permalink
    Definition Classes
    LGraph → Graph
  10. def buildTraversersStream[Start <: ClassType[_], End <: ClassType[_], Steps <: HList, Out](traversal: Traversal[Start, End, Steps]): Stream[Out]

    Permalink
    Definition Classes
    LGraph → Graph
  11. def clone(): AnyRef

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

    Permalink
    Definition Classes
    LGraph → Graph
  13. val computer: DefaultStreamComputer

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

    Permalink
    Attributes
    protected
    Definition Classes
    LGraph → Graph
  15. def createEdge(id: Long, from: Long, key: Property, to: Long): GEdge[Any, Any]

    Permalink
    Attributes
    protected
    Definition Classes
    Graph
  16. def createValue[T](id: Long, value: T, dt: DataType[T]): GValue[T]

    Permalink
    Attributes
    protected
    Definition Classes
    LGraph → Graph
  17. def deleteEdge(edge: GEdge[_, _]): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    Graph
  18. def deleteNode(node: GNode): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    Graph
  19. def deleteResource[T <: _Resource[_]](resource: T): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    LGraph → Graph
  20. def deleteValue(value: GValue[_]): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    Graph
  21. lazy val edgeStore: LEdgeStore[LGraph.this.type]

    Permalink
    Attributes
    protected[lspace.lgraph]
    Definition Classes
    LGraph → Graph
  22. def edges: Edges

    Permalink
    Definition Classes
    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 finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  26. def g(graph: Graph*): Traversal[DataType[Graph], DataType[Graph], HNil]

    Permalink
    Definition Classes
    Graph
  27. def g: Traversal[DataType[Graph], DataType[Graph], HNil]

    Permalink
    Definition Classes
    Graph
  28. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  29. def getOrCreateNode(id: Long): GNode

    Permalink
    Attributes
    protected[lspace]
    Definition Classes
    LGraph → Graph
  30. lazy val hashCode: Int

    Permalink
    Definition Classes
    Graph → AnyRef → Any
  31. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  32. def mergeNodes(nodes: Set[Node]): Task[Node]

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

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

    Permalink
    Definition Classes
    AnyRef
  35. def newEdge(id: Long, from: Long, key: Property, to: Long): GEdge[Any, Any]

    Permalink
    Attributes
    protected[lspace.lgraph]
    Definition Classes
    LGraph → Graph
  36. def newEdge[S, E](id: Long, from: GResource[S], key: Property, to: GResource[E]): GEdge[S, E]

    Permalink
    Attributes
    protected[lspace.lgraph]
    Definition Classes
    LGraph → Graph
  37. def newNode(id: Long): GNode

    Permalink
    Attributes
    protected[lspace.lgraph]
    Definition Classes
    LGraph → Graph
  38. def newValue[T](id: Long, value: T, label: DataType[T]): GValue[T]

    Permalink
    Attributes
    protected[lspace.lgraph]
    Definition Classes
    LGraph → Graph
  39. lazy val nodeStore: LNodeStore[LGraph.this.type]

    Permalink
    Attributes
    protected[lspace.lgraph]
    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: CancelableFuture[Unit]

    Permalink
    Definition Classes
    LGraph → Graph
  44. def resources: Resources

    Permalink
    Definition Classes
    Graph
  45. def storeEdge(edge: GEdge[_, _]): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    Graph
  46. def storeNode(node: GNode): Unit

    Permalink
    Attributes
    protected[lspace.lgraph]
    Definition Classes
    LGraph → Graph
  47. def storeValue(value: GValue[_]): Unit

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

    Permalink
    Definition Classes
    AnyRef
  49. lazy val thisgraph: LGraph.this.type

    Permalink
    Definition Classes
    Graph
  50. def toString(): String

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

    Permalink
    Definition Classes
    LGraph → Graph
  52. lazy val traversal: Traversal[DataType[Graph], DataType[Graph], HNil]

    Permalink
    Definition Classes
    Graph
  53. lazy val valueStore: LValueStore[LGraph.this.type]

    Permalink
    Attributes
    protected[lspace.lgraph]
    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
  59. object writenode

    Permalink
  60. object writevalue

    Permalink

Inherited from Graph

Inherited from GraphUtils

Inherited from IriResource

Inherited from AnyRef

Inherited from Any

Ungrouped