History

Type Members

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

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
trait Nodes extends RApi[Node]

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

Definition Classes
Graph
trait Resources extends RApi[Resource[_]]

Definition Classes
Graph
trait Values extends RApi[Value[_]]

Definition Classes
Graph
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 Value Members

abstract def buildAsyncTraversersStream[ST <: ClassType[_], ET <: ClassType[_], Steps <: HList, Out](traversal: Traversal[ST, ET, Steps])(ct: ClassType[_]): Task[Stream[Out]]

Definition Classes
Graph
abstract def buildTraversersStream[ST <: ClassType[_], ET <: ClassType[_], Steps <: HList, Out](traversal: Traversal[ST, ET, Steps])(ct: ClassType[_]): Stream[Out]

Definition Classes
Graph
abstract def deleteResource[T <: _Resource[_]](resource: T): Unit

TODO: rename to _deleteProperties/_deleteEdges?
TODO: rename to _deleteProperties/_deleteEdges?

Attributes
protected
Definition Classes
Graph
abstract def edgeStore: EdgeStore[History.this.type]

Attributes
protected
Definition Classes
Graph
abstract def idProvider: IdProvider

Definition Classes
Graph
abstract def init(): Unit

Definition Classes
Graph
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(id: Long, from: Long, key: Property, to: Long): GEdge[Any, Any]

Attributes
protected
Definition Classes
Graph
abstract def newEdge[S, E](id: Long, from: GResource[S], key: Property, to: GResource[E]): GEdge[S, E]

Attributes
protected
Definition Classes
Graph
abstract def newNode(id: Long): GNode

Attributes
protected
Definition Classes
Graph
abstract def newValue[T](id: Long, value: T, label: DataType[T]): GValue[T]

Attributes
protected
Definition Classes
Graph
abstract def nodeStore: NodeStore[History.this.type]

Attributes
protected
Definition Classes
Graph
abstract def ns: NameSpaceGraph

Definition Classes
Graph
abstract def transaction: Transaction

creates new transaction
creates new transaction

Definition Classes
Graph
abstract def valueStore: ValueStore[History.this.type]

Attributes
protected
Definition Classes
Graph

Concrete Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def +(label: Ontology): Node

Definition Classes
Graph
def ++(graph: Graph): Unit

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

Definition Classes
AnyRef → Any
def add(graph: Graph): Unit

Definition Classes
Graph
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

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

Definition Classes
Graph
def createEdge[S, E](id: Long, from: GResource[S], key: Property, to: GResource[E]): GEdge[S, E]

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

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

Attributes
protected
Definition Classes
History → Graph
def deleteEdge(edge: GEdge[_, _]): Unit

deletes the Edge from the graph
deletes the Edge from the graph

Attributes
protected
Definition Classes
History → Graph
def deleteNode(node: GNode): Unit

deletes the Node from the graph
deletes the Node from the graph

Attributes
protected
Definition Classes
History → Graph
def deleteValue(value: GValue[_]): Unit

deletes the Value from the graph
deletes the Value from the graph

Attributes
protected
Definition Classes
History → Graph
def edges: Edges

Edges A.K.A.
Edges A.K.A. Links A.K.A. Properties

Definition Classes
Graph
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(o: Any): Boolean

Definition Classes
IriResource → AnyRef → Any
def finalize(): Unit

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

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

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

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

Attributes
protected
Definition Classes
History → Graph
lazy val hashCode: Int

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

Definition Classes
Any
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def nodes: Nodes

Nodes A.K.A.
Nodes A.K.A. Vertices

Definition Classes
Graph
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def resources: Resources

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

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

Attributes
protected
Definition Classes
Graph
def storeValue(value: GValue[_]): Unit

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

Definition Classes
AnyRef
lazy val thisgraph: History.this.type

Definition Classes
Graph
def toString(): String

Definition Classes
Graph → AnyRef → Any
lazy val traversal: Traversal[DataType[Graph], DataType[Graph], HNil]

Definition Classes
Graph
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
@throws( ... )

Related Docs: object History | package structure

trait History extends Graph

Type Members

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

abstract type GEdge[S, E] <: _Edge[S, E]

abstract type GNode <: _Node

abstract type GResource[T] <: _Resource[T]

abstract type GValue[T] <: _Value[T]

trait Nodes extends RApi[Node]

sealed trait RApi[T <: Resource[_]] extends AnyRef

trait Resources extends RApi[Resource[_]]

trait Values extends RApi[Value[_]]

abstract class _Edge[S, E] extends _Resource[Edge[S, E]] with Edge[S, E]

abstract class _Node extends _Resource[Node] with Node

trait _Resource[+T] extends Resource[T]

abstract class _Value[T] extends _Resource[T] with Value[T]

Abstract Value Members

abstract def buildAsyncTraversersStream[ST <: ClassType[_], ET <: ClassType[_], Steps <: HList, Out](traversal: Traversal[ST, ET, Steps])(ct: ClassType[_]): Task[Stream[Out]]

abstract def buildTraversersStream[ST <: ClassType[_], ET <: ClassType[_], Steps <: HList, Out](traversal: Traversal[ST, ET, Steps])(ct: ClassType[_]): Stream[Out]

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

abstract def edgeStore: EdgeStore[History.this.type]

abstract def idProvider: IdProvider

abstract def init(): Unit

abstract def iri: String

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

abstract def newEdge[S, E](id: Long, from: GResource[S], key: Property, to: GResource[E]): GEdge[S, E]

abstract def newNode(id: Long): GNode

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

abstract def nodeStore: NodeStore[History.this.type]

abstract def ns: NameSpaceGraph

abstract def transaction: Transaction

abstract def valueStore: ValueStore[History.this.type]

Concrete Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def +(label: Ontology): Node

def ++(graph: Graph): Unit

final def ==(arg0: Any): Boolean

def add(graph: Graph): Unit

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def close(): Unit

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

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

def createValue[T](id: Long, value: T, dt: DataType[T]): GValue[T]

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

def deleteNode(node: GNode): Unit

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

def edges: Edges

final def eq(arg0: AnyRef): Boolean

def equals(o: Any): Boolean

def finalize(): Unit

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

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

final def getClass(): Class[_]

def getOrCreateNode(id: Long): GNode

lazy val hashCode: Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

def nodes: Nodes

final def notify(): Unit

final def notifyAll(): Unit

def resources: Resources

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

def storeNode(node: GNode): Unit

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

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

lazy val thisgraph: History.this.type

def toString(): String

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

def values: Values

final def wait(): Unit

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

final def wait(arg0: Long): Unit

Inherited from Graph

Inherited from IriResource

Inherited from AnyRef

Inherited from Any

Ungrouped