Trait

lspace.lgraph

LIndexGraph

Related Doc: package lgraph

Permalink

trait LIndexGraph extends LGraph with IndexGraph

Linear Supertypes
IndexGraph, LGraph, Graph, GraphUtils, IriResource, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. LIndexGraph
  2. IndexGraph
  3. LGraph
  4. Graph
  5. GraphUtils
  6. IriResource
  7. AnyRef
  8. 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 graph: LGraph

    Permalink
    Definition Classes
    LIndexGraph → IndexGraph

  2. abstract def indexManager: IndexManager[LIndexGraph.this.type]

    Permalink

  3. abstract def iri: String

    Permalink
    Definition Classes
    IriResource

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

    Permalink
    Attributes
    protected[lspace.lgraph]
    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. 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 @typeIndex: Index

    Permalink
    Attributes
    protected
    Definition Classes
    LIndexGraph → IndexGraph

  7. def __[Start, End](implicit cltblStart: ClassTypeable[Start], cltblEnd: ClassTypeable[End]): Traversal[CT, CT, HNil]

    Permalink
    Definition Classes
    Graph

  8. def add: (Graph) ⇒ Graph

    Permalink
    Definition Classes
    Graph

  9. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  10. def buildAsyncTraversersStream[Start <: ClassType[_], End <: ClassType[_], Steps <: HList, Out](traversal: Traversal[Start, End, Steps]): Task[Stream[Out]]

    Permalink
    Definition Classes
    LGraph → Graph

  11. def buildTraversersStream[Start <: ClassType[_], End <: ClassType[_], Steps <: HList, Out](traversal: Traversal[Start, End, Steps]): Stream[Out]

    Permalink
    Definition Classes
    LGraph → Graph

  12. def clone(): AnyRef

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

  13. def close(): CancelableFuture[Unit]

    Permalink
    Definition Classes
    LGraph → Graph

  14. val computer: DefaultStreamComputer

    Permalink
    Definition Classes
    LGraph

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

    Permalink
    Attributes
    protected
    Definition Classes
    IndexGraph → Graph

  16. def createEdge(id: Long, from: Long, key: Property, to: Long): GEdge[Any, Any]

    Permalink
    Attributes
    protected
    Definition Classes
    Graph

  17. def createIndex(traversal: UntypedTraversal): Index

    Permalink
    Attributes
    protected
    Definition Classes
    LIndexGraph → IndexGraph

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

    Permalink
    Attributes
    protected
    Definition Classes
    IndexGraph → Graph

  19. def deleteEdge(edge: GEdge[_, _]): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    IndexGraph → Graph

  20. def deleteIndex(index: Index): Unit

    Permalink
    Definition Classes
    LIndexGraph → IndexGraph

  21. def deleteNode(node: GNode): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    IndexGraph → Graph

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

    Permalink
    Attributes
    protected
    Definition Classes
    LGraph → Graph

  23. def deleteValue(value: GValue[_]): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    IndexGraph → Graph

  24. lazy val edgeStore: LEdgeStore[LIndexGraph.this.type]

    Permalink
    Attributes
    protected[lspace.lgraph]
    Definition Classes
    LGraph → Graph

  25. def edges: Edges

    Permalink
    Definition Classes
    Graph

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

    Permalink
    Definition Classes
    AnyRef

  27. def equals(o: Any): Boolean

    Permalink
    Definition Classes
    IriResource → AnyRef → Any

  28. def finalize(): Unit

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

  29. def findIndex(traversal: UntypedTraversal): List[Node]

    Permalink
    Definition Classes
    IndexGraph

  30. def g(graph: Graph*): Traversal[DataType[Graph], DataType[Graph], HNil]

    Permalink
    Definition Classes
    Graph

  31. def g: Traversal[DataType[Graph], DataType[Graph], HNil]

    Permalink
    Definition Classes
    Graph

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

    Permalink
    Definition Classes
    AnyRef → Any

  33. def getIndex(traversal: UntypedTraversal): Option[Index]

    Permalink
    Definition Classes
    LIndexGraph → IndexGraph

  34. def getOrCreateIndex(traversal: UntypedTraversal): Index

    Permalink
    Definition Classes
    IndexGraph

  35. def getOrCreateNode(id: Long): GNode

    Permalink
    Attributes
    protected[lspace]
    Definition Classes
    LGraph → Graph

  36. lazy val hashCode: Int

    Permalink
    Definition Classes
    Graph → AnyRef → Any

  37. lazy val idProvider: IdProvider

    Permalink
    Definition Classes
    IndexGraph → Graph

  38. lazy val indexCache: MemGraph

    Permalink

  39. val indexes: HashMap[Long, Index]

    Permalink
    Attributes
    protected

  40. lazy val init: CancelableFuture[Unit]

    Permalink
    Definition Classes
    IndexGraph → Graph

  41. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

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

    Permalink
    Definition Classes
    GraphUtils

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

    Permalink
    Definition Classes
    GraphUtils

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

    Permalink
    Definition Classes
    AnyRef

  45. def newEdge(id: Long, from: Long, key: Property, to: Long): GEdge[Any, Any]

    Permalink
    Attributes
    protected[lspace.lgraph]
    Definition Classes
    LGraph → Graph

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

  47. def newNode(id: Long): GNode

    Permalink
    Attributes
    protected[lspace.lgraph]
    Definition Classes
    LGraph → Graph

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

    Permalink
    Attributes
    protected[lspace.lgraph]
    Definition Classes
    LGraph → Graph

  49. lazy val nodeStore: LNodeStore[LIndexGraph.this.type]

    Permalink
    Attributes
    protected[lspace.lgraph]
    Definition Classes
    LGraph → Graph

  50. def nodes: Nodes

    Permalink
    Definition Classes
    Graph

  51. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  52. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  53. def ns: LNSGraph

    Permalink
    Definition Classes
    LIndexGraph → IndexGraph → LGraph → Graph

  54. def persist: CancelableFuture[Unit]

    Permalink
    Definition Classes
    LIndexGraph → LGraph → Graph

  55. def resources: Resources

    Permalink
    Definition Classes
    Graph

  56. implicit def stepListToTraversal(steps: List[Step]): Traversal[ClassType[Any], ClassType[Any], HList]

    Permalink
    Definition Classes
    IndexGraph

  57. def storeEdge(edge: GEdge[_, _]): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    Graph

  58. def storeNode(node: GNode): Unit

    Permalink
    Attributes
    protected[lspace.lgraph]
    Definition Classes
    LGraph → Graph

  59. def storeValue(value: GValue[_]): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    Graph

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

    Permalink
    Definition Classes
    AnyRef

  61. lazy val thisgraph: LIndexGraph.this.type

    Permalink
    Definition Classes
    Graph

  62. def toString(): String

    Permalink
    Definition Classes
    Graph → AnyRef → Any

  63. def transaction: Transaction

    Permalink
    Definition Classes
    LGraph → Graph

  64. lazy val traversal: Traversal[DataType[Graph], DataType[Graph], HNil]

    Permalink
    Definition Classes
    Graph

  65. lazy val valueStore: LValueStore[LIndexGraph.this.type]

    Permalink
    Attributes
    protected[lspace.lgraph]
    Definition Classes
    LGraph → Graph

  66. def values: Values

    Permalink
    Definition Classes
    Graph

  67. final def wait(): Unit

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

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

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

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

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

  70. object writeedge

    Permalink
    Definition Classes
    LGraph

  71. object writenode

    Permalink
    Definition Classes
    LGraph

  72. object writevalue

    Permalink
    Definition Classes
    LGraph

Inherited from IndexGraph

Inherited from LGraph

Inherited from Graph

Inherited from GraphUtils

Inherited from IriResource

Inherited from AnyRef

Inherited from Any

Ungrouped