Modifier and Type | Class and Description |
---|---|
static class |
MultiUnion.MultiUnionStatisticsHandler |
TOSTRING_TRIPLE_BASE, TOSTRING_TRIPLE_LIMIT
emptyGraph
Constructor and Description |
---|
MultiUnion()
Construct a union of exactly no sub graphs.
|
MultiUnion(Graph[] graphs)
Construct a union of all of the given graphs
|
MultiUnion(Iterator<Graph> graphs)
Construct a union of all of the given graphs.
|
Modifier and Type | Method and Description |
---|---|
void |
addGraph(Graph graph)
Add the given graph to this union.
|
Reifier |
getReifier()
Unions share the reifiers of their base graphs.
|
boolean |
graphBaseContains(Triple t)
Answer true if at least one of the graphs in this union contain the given triple.
|
com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> |
graphBaseFind(TripleMatch t)
Answer an iterator over the triples in the union of the graphs in this composition.
|
void |
performAdd(Triple t)
Add the given triple to the union model; the actual component model to
be updated will be the designated (or default) updateable graph.
|
void |
performDelete(Triple t)
Delete the given triple from the union model; the actual component model to
be updated will be the designated (or default) updateable graph.
|
QueryHandler |
queryHandler()
Answer a QueryHandler bound to this graph.
|
close, dependsOn, getBaseGraph, getBulkUpdateHandler, getCapabilities, getPrefixMapping, getRequiredBaseGraph, getSubGraphs, getTransactionHandler, removeGraph, setBaseGraph
butNot, ifIn, ifIn, recording, reject, rejecting, rejecting
public MultiUnion()
Construct a union of exactly no sub graphs.
public MultiUnion(Graph[] graphs)
Construct a union of all of the given graphs
graphs
- An array of the sub-graphs of this unionpublic Reifier getReifier()
getReifier
in interface Graph
getReifier
in class com.hp.hpl.jena.graph.impl.GraphBase
public void performAdd(Triple t)
Add the given triple to the union model; the actual component model to be updated will be the designated (or default) updateable graph.
performAdd
in interface com.hp.hpl.jena.graph.impl.GraphWithPerform
performAdd
in class com.hp.hpl.jena.graph.impl.GraphBase
t
- A triple to add to the union graphJenaException
- if the union does not contain any sub-graphs yetpublic void performDelete(Triple t)
Delete the given triple from the union model; the actual component model to be updated will be the designated (or default) updateable graph.
performDelete
in interface com.hp.hpl.jena.graph.impl.GraphWithPerform
performDelete
in class com.hp.hpl.jena.graph.impl.GraphBase
t
- A triple to from the union graphJenaException
- if the union does not contain any sub-graphs yetpublic boolean graphBaseContains(Triple t)
Answer true if at least one of the graphs in this union contain the given triple.
graphBaseContains
in class com.hp.hpl.jena.graph.impl.GraphBase
t
- A triplepublic QueryHandler queryHandler()
com.hp.hpl.jena.graph.impl.GraphBase
queryHandler
in interface Graph
queryHandler
in class com.hp.hpl.jena.graph.impl.GraphBase
public com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> graphBaseFind(TripleMatch t)
Answer an iterator over the triples in the union of the graphs in this composition. Note that the requirement to remove duplicates from the union means that this will be an expensive operation for large (and especially for persistent) graphs.
graphBaseFind
in class com.hp.hpl.jena.graph.impl.GraphBase
t
- The matcher to match againstCopyright ? 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 Hewlett-Packard Development Company, LP