Class

net.sansa_stack.inference.flink.data

RDFGraph

Related Doc: package data

Permalink

case class RDFGraph(triples: DataSet[Triple]) extends Product with Serializable

A data structure that comprises a set of triples.

Linear Supertypes
Serializable, Serializable, Product, Equals, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. RDFGraph
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. AnyRef
  7. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new RDFGraph(triples: DataSet[Triple])

    Permalink

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 ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  4. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  5. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  6. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  7. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  8. def find(triple: Triple): DataSet[Triple]

    Permalink

    Returns a DataSet of triples that match with the given input.

    Returns a DataSet of triples that match with the given input.

    returns

    DataSet of triples

  9. def find(s: Option[Node] = None, p: Option[Node] = None, o: Option[Node] = None): DataSet[Triple]

    Permalink

    Returns a DataSet of triples that match with the given input.

    Returns a DataSet of triples that match with the given input.

    s

    the subject

    p

    the predicate

    o

    the object

    returns

    DataSet of triples

  10. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any

  11. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  12. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  13. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  14. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  15. lazy val size: Long

    Permalink

    Returns the number of triples.

    Returns the number of triples.

    returns

    the number of triples

  16. def subtract(other: RDFGraph): RDFGraph

    Permalink

    Returns an RDFGraph with the triples from this that are not in other.

    Returns an RDFGraph with the triples from this that are not in other.

    other

    the other RDF graph

    returns

    the difference of both graphs

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

    Permalink
    Definition Classes
    AnyRef

  18. val triples: DataSet[Triple]

    Permalink

  19. def union(other: RDFGraph): RDFGraph

    Permalink

    Returns the union of the current RDF graph with the given RDF graph

    Returns the union of the current RDF graph with the given RDF graph

    other

    the other RDF graph

    returns

    the union of both graphs

  20. final def wait(): Unit

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

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

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

  22. final def wait(arg0: Long): Unit

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

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Ungrouped