Package org.apache.jena.sparql.util

Class UnionDatasetGraph

java.lang.Object

org.apache.jena.atlas.lib.Pair<T,T>

org.apache.jena.atlas.lib.PairOfSameType<DatasetGraph>

org.apache.jena.sparql.util.DyadicDatasetGraph

org.apache.jena.sparql.util.UnionDatasetGraph

All Implemented Interfaces:

org.apache.jena.atlas.lib.Closeable, DatasetGraph, Transactional

public class UnionDatasetGraph
extends DyadicDatasetGraph

Nested Class Summary

Nested classes/interfaces inherited from interface org.apache.jena.sparql.core.Transactional

Transactional.Promote

Constructor Summary

Constructors

Constructor	Description
UnionDatasetGraph(DatasetGraph left, DatasetGraph right, Context c)

Method Summary

Modifier and Type	Method	Description
boolean	contains(Node g, Node s, Node p, Node o)	Test whether the dataset (including default graph) contains a quad - may include wildcards, Node.ANY or null
boolean	containsGraph(Node graphNode)	Does the DatasetGraph contain a specific named graph? Whether a dataset contains a graph if there are no triples is not defined - see the specific implementation.
java.util.Iterator<Quad>	find(Node g, Node s, Node p, Node o)	Find matching quads in the dataset (including default graph) - may include wildcards, Node.ANY or null
java.util.Iterator<Quad>	findNG(Node g, Node s, Node p, Node o)	Find matching quads in the dataset in named graphs only - may include wildcards, Node.ANY or null
Graph	getDefaultGraph()	Get the default graph as a Jena Graph
Graph	getGraph(Node graphNode)	Get the graph named by graphNode : returns null when there is no such graph.
Graph	getUnionGraph()	Return a Graph that is the union of all named graphs in this dataset.
boolean	isEmpty()	Test whether the dataset is empty
java.util.Iterator<Node>	listGraphNodes()	Iterate over all names of named graphs

Methods inherited from class org.apache.jena.sparql.util.DyadicDatasetGraph

abort, add, add, addGraph, begin, begin, begin, clear, close, commit, contains, delete, delete, deleteAny, end, find, find, getContext, getLock, isInTransaction, prefixes, promote, removeGraph, setContext, setDefaultGraph, size, supportsTransactionAbort, supportsTransactions, transactionMode, transactionType

Methods inherited from class org.apache.jena.atlas.lib.PairOfSameType

apply, both, either, forEach

Methods inherited from class org.apache.jena.atlas.lib.Pair

car, cdr, create, equals, getLeft, getRight, hashCode, toString

Methods inherited from class java.lang.Object

getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface org.apache.jena.sparql.core.DatasetGraph

addAll

Methods inherited from interface org.apache.jena.sparql.core.Transactional

calc, calculate, calculateRead, calculateWrite, exec, execute, executeRead, executeWrite, promote

Constructor Detail

UnionDatasetGraph

public UnionDatasetGraph(DatasetGraph left,
                         DatasetGraph right,
                         Context c)

Method Detail

getDefaultGraph

public Graph getDefaultGraph()

Description copied from interface: DatasetGraph

Get the default graph as a Jena Graph

getGraph

public Graph getGraph(Node graphNode)

Description copied from interface: DatasetGraph

Get the graph named by graphNode : returns null when there is no such graph. NB Whether a dataset contains a graph if there are no triples is not defined - see the specific implementation. Some datasets are "open" - they have all graphs even if no triples.

getUnionGraph

public Graph getUnionGraph()

Description copied from interface: DatasetGraph

Return a Graph that is the union of all named graphs in this dataset. This union graph is read-only (its prefix mapping in the current JVM may be changed but that may not persist).

Specified by:

getUnionGraph in interface DatasetGraph

Overrides:

getUnionGraph in class DyadicDatasetGraph

containsGraph

public boolean containsGraph(Node graphNode)

Description copied from interface: DatasetGraph

Does the DatasetGraph contain a specific named graph? Whether a dataset contains a graph if there are no triples is not defined - see the specific implementation. Some datasets are "open" - they have all graphs even if no triples and this returns true always.

Returns:

boolean

listGraphNodes

public java.util.Iterator<Node> listGraphNodes()

Description copied from interface: DatasetGraph

Iterate over all names of named graphs

find

public java.util.Iterator<Quad> find(Node g,
                                     Node s,
                                     Node p,
                                     Node o)

Description copied from interface: DatasetGraph

Find matching quads in the dataset (including default graph) - may include wildcards, Node.ANY or null

Specified by:

find in interface DatasetGraph

Overrides:

find in class DyadicDatasetGraph

See Also:

Graph.find(Node,Node,Node)

findNG

public java.util.Iterator<Quad> findNG(Node g,
                                       Node s,
                                       Node p,
                                       Node o)

Description copied from interface: DatasetGraph

Find matching quads in the dataset in named graphs only - may include wildcards, Node.ANY or null

Specified by:

findNG in interface DatasetGraph

Overrides:

findNG in class DyadicDatasetGraph

See Also:

Graph.find(Node,Node,Node)

contains

public boolean contains(Node g,
                        Node s,
                        Node p,
                        Node o)

Description copied from interface: DatasetGraph

Test whether the dataset (including default graph) contains a quad - may include wildcards, Node.ANY or null

isEmpty

public boolean isEmpty()

Description copied from interface: DatasetGraph

Test whether the dataset is empty

Specified by:

isEmpty in interface DatasetGraph

Overrides:

isEmpty in class DyadicDatasetGraph