trait IndexGraph extends Graph
Linear Supertypes
Known Subclasses
Ordering
- Alphabetic
- By Inheritance
Inherited
- IndexGraph
- Graph
- GraphUtils
- IriResource
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Type Members
-
abstract
class
_Edge[S, E] extends _Resource[Edge[S, E]] with Edge[S, E]
- Definition Classes
- Graph
-
abstract
class
_Node extends _Resource[Node] with Node
- Definition Classes
- Graph
-
trait
_Resource[+T] extends Resource[T]
- Definition Classes
- Graph
-
abstract
class
_Value[T] extends _Resource[T] with Value[T]
- Definition Classes
- Graph
-
abstract
type
GEdge[S, E] <: _Edge[S, E]
- Definition Classes
- Graph
-
abstract
type
GNode <: _Node
- Definition Classes
- Graph
-
abstract
type
GResource[T] <: _Resource[T]
- Definition Classes
- Graph
-
abstract
type
GValue[T] <: _Value[T]
- Definition Classes
- Graph
Abstract Value Members
-
abstract
def
deleteResource[T <: _Resource[_]](resource: T): Task[Unit]
TODO: rename to _deleteProperties/_deleteEdges?
TODO: rename to _deleteProperties/_deleteEdges?
- Attributes
- protected
- Definition Classes
- Graph
- abstract def edgeStore: EdgeStore[IndexGraph.this.type]
- abstract def graph: Graph
-
abstract
def
indexes: Indexes
- Attributes
- protected[lspace]
-
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
- abstract def newEdge[S, E](id: Long, from: _Resource[S], key: Property, to: _Resource[E]): GEdge[S, E]
- abstract def newNode(id: Long): GNode
- abstract def newValue[T](id: Long, value: T, label: datatype.DataType[T]): GValue[T]
- abstract def nodeStore: NodeStore[IndexGraph.this.type]
-
abstract
def
transaction: Transaction
creates new transaction
creates new transaction
- Definition Classes
- Graph
- abstract def valueStore: ValueStore[IndexGraph.this.type]
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
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
-
final
def
+(label: Ontology): Task[Node]
- Definition Classes
- Graph
-
val
++: (Graph) ⇒ Task[Graph]
- Definition Classes
- Graph
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
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
-
def
add: (Graph) ⇒ Task[Graph]
- Definition Classes
- Graph
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
implicit
lazy val
assistent: Assistent
- Definition Classes
- Graph
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
def
close(): Task[Unit]
- Definition Classes
- Graph
-
def
createEdge[S, E](id: Long, from: _Resource[S], key: Property, to: _Resource[E]): Task[GEdge[S, E]]
- Attributes
- protected[lspace]
- Definition Classes
- IndexGraph → Graph
-
def
createValue[T](_id: Long, _value: T, dt: datatype.DataType[T]): Task[GValue[T]]
- Attributes
- protected[lspace]
- Definition Classes
- IndexGraph → Graph
-
def
deleteEdge(edge: _Edge[_, _]): Task[Unit]
deletes the Edge from the graph
deletes the Edge from the graph
- Attributes
- protected[lspace]
- Definition Classes
- IndexGraph → Graph
-
def
deleteNode(node: _Node): Task[Unit]
deletes the Node from the graph
deletes the Node from the graph
- Attributes
- protected[lspace]
- Definition Classes
- IndexGraph → Graph
-
def
deleteValue(value: _Value[_]): Task[Unit]
deletes the Value from the graph
deletes the Value from the graph
- Attributes
- protected[lspace]
- Definition Classes
- IndexGraph → Graph
-
def
edges: Edges
- Definition Classes
- Graph
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(o: Any): Boolean
- Definition Classes
- IriResource → AnyRef → Any
- def executeTraversal[F[_]](traversal: librarian.traversal.Traversal[_ <: ClassType[Any], _ <: ClassType[Any], _ <: HList], guide: Guide[F]): F[Any]
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def getOrCreateNode(id: Long): Task[GNode]
-
implicit
lazy val
guide: Guide[Observable]
- Definition Classes
- Graph
-
lazy val
hashCode: Int
- Definition Classes
- Graph → AnyRef → Any
-
lazy val
idProvider: IdProvider
- Definition Classes
- IndexGraph → Graph
-
lazy val
init: Task[Unit]
- Definition Classes
- IndexGraph → Graph
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
mergeNodes(nodes: Set[Node]): Task[Node]
- Definition Classes
- GraphUtils
-
def
mergeValues[V](values: Set[Value[V]]): Task[Value[V]]
- Definition Classes
- GraphUtils
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
nodes: Nodes
- Definition Classes
- Graph
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
ns: NameSpaceGraph
- Definition Classes
- IndexGraph → Graph
-
def
persist: Task[Unit]
- Definition Classes
- Graph
-
def
purge: Task[Unit]
- Definition Classes
- IndexGraph → Graph
-
def
resources: Resources
- Definition Classes
- Graph
- implicit def stepListToTraversal(steps: List[Step]): librarian.traversal.Traversal[ClassType[Any], ClassType[Any], HList]
-
def
storeEdge(edge: _Edge[_, _]): Task[Unit]
- Attributes
- protected
- Definition Classes
- Graph
-
def
storeNode(node: _Node): Task[Unit]
- Attributes
- protected
- Definition Classes
- Graph
-
def
storeValue(value: _Value[_]): Task[Unit]
- Attributes
- protected
- Definition Classes
- Graph
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
lazy val
thisgraph: IndexGraph.this.type
- Definition Classes
- Graph
-
def
toString(): String
- Definition Classes
- Graph → AnyRef → Any
-
def
values: Values
- Definition Classes
- Graph
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )