Trait

lspace.structure.Graph

Nodes

Related Doc: package Graph

Permalink

trait Nodes extends RApi[Node]

Linear Supertypes
RApi[Node], AnyRef, Any
Known Subclasses
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

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 +(node: Node): Node

    Permalink

    adds a node by reference (iri(s))

  4. final def +(label: Ontology): Node

    Permalink
  5. final def ++(node: Node): Node

    Permalink

    adds a node by every detail

  6. final def -(node: Node): Unit

    Permalink

    deletes a node

  7. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  8. def apply(): Stream[Node]

    Permalink
    Definition Classes
    NodesRApi
  9. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  10. def clone(): AnyRef

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

    Permalink
  12. def create(ontology: Ontology*): Node

    Permalink
  13. final def delete(node: Node): Unit

    Permalink
  14. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  15. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  16. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  17. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  18. def hasId(id: List[Long]): Stream[Node]

    Permalink
  19. def hasId(id: Long): Option[Node]

    Permalink
    Definition Classes
    NodesRApi
  20. def hasIri(iris: List[String]): List[Node]

    Permalink

    iris

    a set of uri's to get T for

    Definition Classes
    NodesRApi
  21. def hasIri(iri: String, iris: String*): List[Node]

    Permalink
    Definition Classes
    RApi
  22. def hashCode(): Int

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

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

    Permalink
    Definition Classes
    AnyRef
  25. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  26. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  27. def post(node: Node): Node

    Permalink

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

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

    Permalink
    Definition Classes
    AnyRef
  29. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  30. def upsert(node: Node): Node

    Permalink
  31. def upsert(iri: String, iris: Set[String]): Node

    Permalink

    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

  32. def upsert(iri: String, ontologies: Ontology*): Node

    Permalink
  33. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  34. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  35. final def wait(arg0: Long): Unit

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

Inherited from RApi[Node]

Inherited from AnyRef

Inherited from Any

Ungrouped