RDFGraph

abstract def IRIs: Set[IRI]

set of IRIs of this RDFGraph

abstract def addTriples(triples: Set[RDFTriple]): RDFGraph

addTriples adds a set of triples

abstract def addTriplesBNodes(bnodes: Set[BNodeId], triples: Set[RDFTriple], map: Map[BNodeId, BNodeId]): RDFGraph

addTriplesBNodes adds triples to this graph

abstract def foldRDFGraphSeed[A](e: A, fn: (A, TContext[RDFNode]) ⇒ A, seed: BNodeId): A

abstract def foldRDFGraphSeedOrd[A](e: A, fn: (A, TContext[RDFNode]) ⇒ A, seed: BNodeId)(implicit ord: Ordering[RDFNode]): A

abstract def insertTriple(triple: RDFTriple): RDFGraph

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

abstract def insertTripleMap(triple: RDFTriple, map: Map[BNodeId, BNodeId]): RDFGraph

insertTripleMap inserts a triple in this graph

abstract def isEmpty: Boolean

abstract def merge(other: RDFGraph): RDFGraph

Merges this graph with a new one

abstract def show(implicit seed: BNodeId): String

abstract def triples(implicit seed: BNodeId): Set[RDFTriple]

triples returns the set of triples of a graph

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def foldRDFGraph[A](e: A, f: (A, TContext[RDFNode]) ⇒ A)(implicit seed: BNodeId): A

def foldRDFGraphOrd[A](e: A, f: (A, TContext[RDFNode]) ⇒ A)(implicit ord: Ordering[RDFNode], seed: BNodeId): A

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit