Class

net.sansa_stack.inference.data

AbstractRDFGraph

Related Doc: package data

Permalink

abstract class AbstractRDFGraph[Rdf <: RDF, D, G <: AbstractRDFGraph[Rdf, D, G]] extends AnyRef

A data structure that comprises a collection of triples. Note, due to the implementation of the Spark datastructures, this doesn't necessarily mean to be free of duplicates which is why a distinct operation is provided.

Self Type
G
Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. AbstractRDFGraph
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new AbstractRDFGraph(triples: D)

    Permalink

Abstract Value Members

  1. abstract def difference(graph: G): G

    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.

    graph

    the other RDF graph

    returns

    the difference of both RDF graphs

  2. abstract def distinct(): G

    Permalink

    Returns a new RDF graph that does not contain duplicate triples.

  3. abstract def find(triple: Rdf.Triple): G

    Permalink

    Returns a new RDF graph that contains only triples matching the given input.

    Returns a new RDF graph that contains only triples matching the given input.

    returns

    a new RDF graph

  4. abstract def find(s: Option[Rdf.Node] = None, p: Option[Rdf.Node] = None, o: Option[Rdf.Node] = None): G

    Permalink

    Returns a new RDF graph that contains only triples matching the given input.

    Returns a new RDF graph that contains only triples matching the given input.

    s

    the subject

    p

    the predicate

    o

    the object

    returns

    a new RDF graph

  5. abstract def intersection(graph: G): G

    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.

    graph

    the other RDF graph

    returns

    the intersection of both RDF graphs

  6. abstract def size(): Long

    Permalink

    Return the number of triples in the RDF graph.

    Return the number of triples in the RDF graph.

    returns

    the number of triples in the RDF graph

  7. abstract def union(graph: G): G

    Permalink

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

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

    graph

    the other RDF graph

    returns

    the union of both RDF graphs

  8. abstract def unionAll(graphs: Seq[G]): G

    Permalink

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

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

    graphs

    the other RDF graphs

    returns

    the union of all RDF graphs

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

    Permalink
    Definition Classes
    AnyRef → Any

  8. def finalize(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef → Any

  10. def hashCode(): Int

    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. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef

  16. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  17. val triples: D

    Permalink

  18. final def wait(): Unit

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

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

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

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

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

Inherited from AnyRef

Inherited from Any

Ungrouped