Object

net.sansa_stack.rdf.flink.model.dataset

TripleOps

Related Doc: package dataset

Permalink

object TripleOps

Flink based implementation of DataSet[Triple].

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. TripleOps
  2. AnyRef
  3. 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 ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. def add(triples: DataSet[Triple], triple: Triple): DataSet[Triple]

    Permalink

    Add a statement to the current RDF graph.

    Add a statement to the current RDF graph.

    triples

    DataSet of RDF graph

    triple

    the triple to be added.

    returns

    new DataSet of triples containing this statement.

  5. def addAll(triples: DataSet[Triple], triple: Seq[Triple]): DataSet[Triple]

    Permalink

    Add a list of statements to the current RDF graph.

    Add a list of statements to the current RDF graph.

    triples

    DataSet of RDF graph

    triple

    the list of triples to be added.

    returns

    new DataSet of triples containing this list of statements.

  6. final def asInstanceOf[T0]: T0

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

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  8. def contains(triples: DataSet[Triple], triple: Triple): Boolean

    Permalink

    Determine if a triple is present in this RDF graph.

    Determine if a triple is present in this RDF graph.

    triples

    DataSet of triples

    triple

    the triple to be checked

    returns

    true if the statement s is in this RDF graph, false otherwise

  9. def contains(triples: DataSet[Triple], subject: Option[Node] = None, predicate: Option[Node] = None, object: Option[Node] = None): Boolean

    Permalink

    Determine whether this RDF graph contains any triples with a given (subject, predicate, object) pattern.

    Determine whether this RDF graph contains any triples with a given (subject, predicate, object) pattern.

    triples

    DataSet of triples

    subject

    the subject (None for any)

    predicate

    the predicate (None for any)

    object

    the object (None for any)

    returns

    true if there exists within this RDF graph a triple with (S, P, O) pattern, false otherwise

  10. def containsAll(triples: DataSet[Triple], other: DataSet[Triple]): Boolean

    Permalink

    Determine if all of the statements in an RDF graph are also contained in this RDF graph.

    Determine if all of the statements in an RDF graph are also contained in this RDF graph.

    triples

    DataSet of triples

    other

    the other RDF graph containing the statements to be tested

    returns

    true if all of the statements in RDF graph are also contained in this RDF graph and false otherwise.

  11. def containsAny(triples: DataSet[Triple], other: DataSet[Triple]): Boolean

    Permalink

    Determine if any of the triples in an RDF graph are also contained in this RDF graph.

    Determine if any of the triples in an RDF graph are also contained in this RDF graph.

    triples

    DataSet of triples

    other

    the other RDF graph containing the statements to be tested

    returns

    true if any of the statements in RDF graph are also contained in this RDF graph and false otherwise.

  12. def difference(triples: DataSet[Triple], other: DataSet[Triple]): DataSet[Triple]

    Permalink

    Returns a new RDF graph that contains the difference between the current RDF graph and the given RDF graph.

    Returns a new RDF graph that contains the difference between the current RDF graph and the given RDF graph.

    triples

    DataSet of RDF graph

    other

    the other RDF graph

    returns

    the difference of both RDF graphs

  13. var env: ExecutionEnvironment

    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 filterObjects(triples: DataSet[Triple], func: (Node) ⇒ Boolean): DataSet[Triple]

    Permalink

    Filter out the objects from a given DataSet[Triple], based on a specific function @func .

    Filter out the objects from a given DataSet[Triple], based on a specific function @func .

    triples

    DataSet of triples.

    func

    a partial funtion.

    returns

    DataSet[Triple] a subset of the given DataSet.

  17. def filterPredicates(triples: DataSet[Triple], func: (Node) ⇒ Boolean): DataSet[Triple]

    Permalink

    Filter out the predicates from a given DataSet[Triple], based on a specific function @func .

    Filter out the predicates from a given DataSet[Triple], based on a specific function @func .

    triples

    DataSet of triples.

    func

    a partial funtion.

    returns

    DataSet[Triple] a subset of the given DataSet.

  18. def filterSubjects(triples: DataSet[Triple], func: (Node) ⇒ Boolean): DataSet[Triple]

    Permalink

    Filter out the subject from a given DataSet[Triple], based on a specific function @func .

    Filter out the subject from a given DataSet[Triple], based on a specific function @func .

    triples

    DataSet of triples.

    func

    a partial funtion.

    returns

    DataSet[Triple] a subset of the given DataSet.

  19. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  20. def find(triples: DataSet[Triple], triple: Triple): DataSet[Triple]

    Permalink

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

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

    triples

    DataSet of triples

    triple

    the triple to be checked

    returns

    DataSet of triples that match the given input

  21. def find(triples: DataSet[Triple], subject: Option[Node] = None, predicate: Option[Node] = None, object: Option[Node] = None): DataSet[Triple]

    Permalink

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

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

    triples

    DataSet of triples

    subject

    the subject

    predicate

    the predicate

    object

    the object

    returns

    DataSet of triples

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

    Permalink
    Definition Classes
    AnyRef → Any
  23. def getObjects(triples: DataSet[Triple]): DataSet[Node]

    Permalink

    Get objects.

    Get objects.

    triples

    DataSet of triples.

    returns

    DataSet[Node] which contains list of the objects.

  24. def getPredicates(triples: DataSet[Triple]): DataSet[Node]

    Permalink

    Get predicates.

    Get predicates.

    triples

    DataSet of triples.

    returns

    DataSet[Node] which contains list of the predicates.

  25. def getSubjects(triples: DataSet[Triple]): DataSet[Node]

    Permalink

    Get subjects.

    Get subjects.

    triples

    DataSet of triples.

    returns

    DataSet[Node] which contains list of the subjects.

  26. def getTriples(triples: DataSet[Triple]): DataSet[Triple]

    Permalink

    Get triples.

    Get triples.

    triples

    DataSet of triples.

    returns

    DataSet[Triple] which contains list of the triples.

  27. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  28. def intersect(triples: DataSet[Triple], other: DataSet[Triple]): DataSet[Triple]

    Permalink

    Returns a new RDF graph that contains the intersection of the current RDF graph with the given RDF graph.

    Returns a new RDF graph that contains the intersection of the current RDF graph with the given RDF graph.

    triples

    DataSet of RDF graph

    other

    the other RDF graph

    returns

    the intersection of both RDF graphs

  29. final def isInstanceOf[T0]: Boolean

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

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

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

    Permalink
    Definition Classes
    AnyRef
  33. def remove(triples: DataSet[Triple], triple: Triple): DataSet[Triple]

    Permalink

    Removes a statement from the current RDF graph.

    Removes a statement from the current RDF graph. The statement with the same subject, predicate and object as that supplied will be removed from the model.

    triples

    DataSet of RDF graph

    triple

    the statement to be removed.

    returns

    new DataSet of triples without this statement.

  34. def removeAll(triples: DataSet[Triple], triple: Seq[Triple]): DataSet[Triple]

    Permalink

    Removes all the statements from the current RDF graph.

    Removes all the statements from the current RDF graph. The statements with the same subject, predicate and object as those supplied will be removed from the model.

    triples

    DataSet of RDF graph

    triple

    the list of statements to be removed.

    returns

    new DataSet of triples without these statements.

  35. def saveAsNTriplesFile(triples: DataSet[Triple], path: String): Unit

    Permalink

    Write N-Triples from a given DataSet of triples

    Write N-Triples from a given DataSet of triples

    triples

    DataSet of RDF graph

    path

    path to the file containing N-Triples

  36. def size(triples: DataSet[Triple]): Long

    Permalink

    Return the number of triples.

    Return the number of triples.

    triples

    DataSet of triples

    returns

    the number of triples

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

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

    Permalink
    Definition Classes
    AnyRef → Any
  39. def union(triples: DataSet[Triple], other: DataSet[Triple]): DataSet[Triple]

    Permalink

    Return the union of this RDF graph and another one.

    Return the union of this RDF graph and another one.

    triples

    DataSet of RDF graph

    other

    the other RDF graph

    returns

    graph (union of both)

  40. def unionAll(triples: DataSet[Triple], others: Seq[DataSet[Triple]]): DataSet[Triple]

    Permalink

    Return the union all of RDF graphs.

    Return the union all of RDF graphs.

    triples

    DataSet of RDF graph

    others

    sequence of DataSets of other RDF graph

    returns

    graph (union of all)

  41. final def wait(): Unit

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

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

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

Inherited from AnyRef

Inherited from Any

Ungrouped