TNodes

Instance Constructors

new TNodes(graph: G)

Value Members

final def !=(arg0: Any): Boolean

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

Definition Classes
AnyRef → Any
final def +(node: structure.Node): Task[structure.Node]

adds a node by reference (iri(s))
adds a node by reference (iri(s))

Definition Classes
Nodes
final def +(label: structure.Ontology): Task[structure.Node]

Definition Classes
Nodes
final def ++(node: structure.Node): Task[structure.Node]

adds a node by every detail
adds a node by every detail

Definition Classes
Nodes
final def -(node: structure.Node): Task[Unit]

deletes a node
deletes a node

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

Definition Classes
AnyRef → Any
val added: Map[Long, G.GNode]
def apply(): Observable[structure.Node]

Definition Classes
TNodes → Nodes → RApi
final def asInstanceOf[T0]: T0

Definition Classes
Any
def cached: AnyRef { ... /* 3 definitions in type refinement */ }

Definition Classes
Nodes → RApi
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def count(): Task[Long]

Definition Classes
TNodes → Nodes
def create(ontology: structure.Ontology*): Task[structure.Node]

Definition Classes
Nodes
final def delete(node: structure.Node): Task[Unit]

Definition Classes
Nodes
val deleted: Map[Long, GNode]
final def eq(arg0: AnyRef): Boolean

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

Definition Classes
AnyRef → 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
val graph: G

Definition Classes
TNodes → Nodes
def hasId(id: List[Long]): Observable[structure.Node]

Definition Classes
TNodes → Nodes
def hasId(id: Long): Task[Option[structure.Node]]

Definition Classes
TNodes → Nodes → RApi
def hasIri(iris: List[String]): Observable[structure.Node]

iris
a set of uri's to get T for

Definition Classes
TNodes → Nodes → RApi
def hasIri(iri: String, iris: String*): Observable[structure.Node]

Definition Classes
RApi
def hashCode(): Int

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

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

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def post(node: structure.Node): Task[structure.Node]

adds a node to the graph including all edges and (meta) edges on edges as long as edges have edges
adds a node to the graph including all edges and (meta) edges on edges as long as edges have edges

Definition Classes
Nodes
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
def upsert(node: structure.Node): Task[structure.Node]

Definition Classes
Nodes
def upsert(iri: String, iris: Set[String], ontologies: structure.Ontology*): Task[structure.Node]

iri
an iri which should all resolve to the same resource as param uris
iris
a set of iri's which should all resolve to the same resource
returns
all vertices which identify by the uri's, expected to return (in time) only a single vertex due to eventual consistency

Definition Classes
Nodes
def upsert(iri: String, ontologies: structure.Ontology*): Task[structure.Node]

Definition Classes
Nodes
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 Doc: package transaction

abstract class TNodes[G <: Transaction] extends Nodes

Instance Constructors

new TNodes(graph: G)

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def +(node: structure.Node): Task[structure.Node]

final def +(label: structure.Ontology): Task[structure.Node]

final def ++(node: structure.Node): Task[structure.Node]

final def -(node: structure.Node): Task[Unit]

final def ==(arg0: Any): Boolean

val added: Map[Long, G.GNode]

def apply(): Observable[structure.Node]

final def asInstanceOf[T0]: T0

def cached: AnyRef { ... /* 3 definitions in type refinement */ }

def clone(): AnyRef

def count(): Task[Long]

def create(ontology: structure.Ontology*): Task[structure.Node]

final def delete(node: structure.Node): Task[Unit]

val deleted: Map[Long, GNode]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

val graph: G

def hasId(id: List[Long]): Observable[structure.Node]

def hasId(id: Long): Task[Option[structure.Node]]

def hasIri(iris: List[String]): Observable[structure.Node]

def hasIri(iri: String, iris: String*): Observable[structure.Node]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def post(node: structure.Node): Task[structure.Node]

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

def toString(): String

def upsert(node: structure.Node): Task[structure.Node]

def upsert(iri: String, iris: Set[String], ontologies: structure.Ontology*): Task[structure.Node]

def upsert(iri: String, ontologies: structure.Ontology*): Task[structure.Node]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

Inherited from Nodes

Inherited from RApi[structure.Node]

Inherited from AnyRef

Inherited from Any

Ungrouped