abstract class Nodes extends RApi[Node]

Linear Supertypes
RApi[Node], AnyRef, Any
Known Subclasses
TNodes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Nodes
  2. RApi
  3. AnyRef
  4. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Nodes(graph: Graph)

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def +(node: Node): Task[Node]

    adds a node by reference (iri(s))

  4. final def +(label: Ontology): Task[Node]
  5. final def ++(node: Node): Task[Node]

    adds a node by every detail

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

    deletes a node

  7. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  8. def apply(): Observable[Node]
    Definition Classes
    Nodes → RApi
  9. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  10. def cached: AnyRef { ... /* 2 definitions in type refinement */ }
    Definition Classes
    Nodes → RApi
  11. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  12. def count(): Task[Long]
  13. def create(ontology: Ontology*): Task[Node]
  14. final def delete(node: Node): Task[Unit]
  15. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  16. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  17. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  18. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  19. val graph: Graph
  20. def hasId(id: List[Long]): Observable[Node]
  21. def hasId(id: Long): Task[Option[Node]]
    Definition Classes
    Nodes → RApi
  22. def hasIri(iris: List[String]): Observable[Node]

    iris

    a set of uri's to get T for

    Definition Classes
    Nodes → RApi
  23. def hasIri(iri: String, iris: String*): Observable[Node]
    Definition Classes
    RApi
  24. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  25. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  26. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  27. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  28. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  29. def post(node: Node): Task[Node]

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

  30. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  31. def toString(): String
    Definition Classes
    AnyRef → Any
  32. def upsert(node: Node): Task[Node]
  33. def upsert(iri: String, iris: Set[String]): Task[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

  34. def upsert(iri: String, ontologies: Ontology*): Task[Node]
  35. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  36. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  37. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )

Inherited from RApi[Node]

Inherited from AnyRef

Inherited from Any

Ungrouped