Class

es.weso.rdfgraph

Ground

Related Doc: package rdfgraph

Permalink

case class Ground(graph: TGraph[RDFNode])(implicit seed: BNodeId) extends RDFGraph with Product with Serializable

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

Instance Constructors

  1. new Ground(graph: TGraph[RDFNode])(implicit seed: BNodeId)

    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. def IRIs: Set[IRI]

    Permalink

    set of IRIs of this RDFGraph

    set of IRIs of this RDFGraph

    Definition Classes
    GroundRDFGraph
  5. def addTriples(triples: Set[RDFTriple]): RDFGraph

    Permalink

    addTriples inserts a set of triples into a graph

    addTriples inserts a set of triples into a graph

    It takes control of possible bnodes in the triples renaming them

    triples

    set of triples

    Definition Classes
    GroundRDFGraph
  6. def addTriplesBNodes(bnodes: Set[BNodeId], triples: Set[RDFTriple], map: Map[BNodeId, BNodeId]): RDFGraph

    Permalink

    addTriplesBNodes adds triples to this graph

    addTriplesBNodes adds triples to this graph

    triples

    set of triples to insert

    map

    maps from BNodeIds in triples to BNodeIds in graph

    Definition Classes
    GroundRDFGraph
  7. final def asInstanceOf[T0]: T0

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

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  9. def decomp(node: IRI): Option[(TContext[RDFNode], RDFGraph)]

    Permalink

    Decompose a graph from a given IRI

    Decompose a graph from a given IRI

    node

    resource from which we are decomposing the graph

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

    Permalink
    Definition Classes
    AnyRef
  11. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  12. def foldRDFGraph[A](e: A, f: (A, TContext[RDFNode]) ⇒ A)(implicit seed: BNodeId): A

    Permalink
    Definition Classes
    RDFGraph
  13. def foldRDFGraphOrd[A](e: A, f: (A, TContext[RDFNode]) ⇒ A)(implicit ord: Ordering[RDFNode], seed: BNodeId): A

    Permalink
    Definition Classes
    RDFGraph
  14. def foldRDFGraphSeed[A](e: A, f: (A, TContext[RDFNode]) ⇒ A, seed: BNodeId): A

    Permalink
    Definition Classes
    GroundRDFGraph
  15. def foldRDFGraphSeedOrd[A](e: A, f: (A, TContext[RDFNode]) ⇒ A, seed: BNodeId)(implicit ord: Ordering[RDFNode]): A

    Permalink
    Definition Classes
    GroundRDFGraph
  16. def getBNodeMap(node: RDFNode, map: Map[BNodeId, BNodeId]): RDFNode

    Permalink
  17. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  18. val graph: TGraph[RDFNode]

    Permalink
  19. def insertTriple(triple: RDFTriple): RDFGraph

    Permalink

    insertTriple inserts a triple into a graph Blank nodes inside the triple may conflict with graph blank nodes

    insertTriple inserts a triple into a graph Blank nodes inside the triple may conflict with graph blank nodes

    Definition Classes
    GroundRDFGraph
  20. def insertTripleMap(triple: RDFTriple, map: Map[BNodeId, BNodeId]): RDFGraph

    Permalink

    insertTripleMap inserts a triple in this graph

    insertTripleMap inserts a triple in this graph

    triple

    to insert

    map

    maps from BNodeIds in triple to BNodeIds in Graph

    Definition Classes
    GroundRDFGraph
  21. def isEmpty: Boolean

    Permalink
    Definition Classes
    GroundRDFGraph
  22. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  23. def merge(other: RDFGraph): RDFGraph

    Permalink

    Merges this graph with a new one

    Merges this graph with a new one

    Definition Classes
    GroundRDFGraph
  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 show(implicit seed: BNodeId): String

    Permalink
    Definition Classes
    GroundRDFGraph
  28. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  29. def triples(implicit seed: BNodeId): Set[RDFTriple]

    Permalink

    get the triples of a graph

    get the triples of a graph

    seed

    represents the seed for blank node identifier generation (default value = 0) Ground graphs ignore the seed parameter

    Definition Classes
    GroundRDFGraph
  30. final def wait(): Unit

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  32. 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 RDFGraph

Inherited from AnyRef

Inherited from Any

Ungrouped