Class

es.weso.rdfgraph

Exists

Related Doc: package rdfgraph

Permalink

case class Exists(fn: (BNodeId) ⇒ RDFGraph)(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. Exists
  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 Exists(fn: (BNodeId) ⇒ RDFGraph)(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
    ExistsRDFGraph
  5. def addTriples(triples: Set[RDFTriple]): RDFGraph

    Permalink

    addTriples adds a set of triples

    addTriples adds a set of triples

    Blank nodes in the set of triples are renamed

    Definition Classes
    ExistsRDFGraph
  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
    ExistsRDFGraph
  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. final def eq(arg0: AnyRef): Boolean

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

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  11. val fn: (BNodeId) ⇒ RDFGraph

    Permalink
  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
    ExistsRDFGraph
  15. def foldRDFGraphSeedOrd[A](e: A, f: (A, TContext[RDFNode]) ⇒ A, seed: BNodeId)(implicit ord: Ordering[RDFNode]): A

    Permalink
    Definition Classes
    ExistsRDFGraph
  16. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  17. 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
    ExistsRDFGraph
  18. 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
    ExistsRDFGraph
  19. def isEmpty: Boolean

    Permalink
    Definition Classes
    ExistsRDFGraph
  20. final def isInstanceOf[T0]: Boolean

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

    Permalink

    Merges this graph with a new one

    Merges this graph with a new one

    Definition Classes
    ExistsRDFGraph
  22. final def ne(arg0: AnyRef): Boolean

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

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

    Permalink
    Definition Classes
    AnyRef
  25. def show(implicit seed: BNodeId): String

    Permalink
    Definition Classes
    ExistsRDFGraph
  26. final def synchronized[T0](arg0: ⇒ T0): T0

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

    Permalink

    triples returns the set of triples of a graph

    triples returns the set of triples of a graph

    seed

    Initial BNode identifier to start renaming

    Definition Classes
    ExistsRDFGraph
  28. final def wait(): Unit

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

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