- All Implemented Interfaces:
Graph
,GraphWithPerform
A graph implementation that presents the union of zero or more subgraphs, one of which is distinguished as the updateable graph.
-
Field Summary
Fields inherited from class org.apache.jena.graph.impl.GraphBase
TOSTRING_TRIPLE_BASE, TOSTRING_TRIPLE_LIMIT
Fields inherited from interface org.apache.jena.graph.Graph
emptyGraph
-
Constructor Summary
ConstructorDescriptionConstruct a union of exactly no sub graphs.MultiUnion
(Iterator<Graph> graphs) Construct a union of all of the given graphs.MultiUnion
(Graph[] graphs) Construct a union of all of the given graphs -
Method Summary
Modifier and TypeMethodDescriptionvoid
Add the given graph to this union.boolean
Answer true if at least one of the graphs in this union contain the given triple.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
Delete the given triple from the union model; the actual component model to be updated will be the designated (or default) updateable graph.Methods inherited from class org.apache.jena.graph.compose.Polyadic
close, dependsOn, getBaseGraph, getCapabilities, getRequiredBaseGraph, getSubGraphs, getTransactionHandler, removeGraph, setBaseGraph
Methods inherited from class org.apache.jena.graph.compose.CompositionBase
butNot, ifIn, ifIn, recording, reject, rejecting, rejecting
Methods inherited from class org.apache.jena.graph.impl.GraphBase
add, clear, contains, contains, delete, find, find, forTestingOnly_graphBaseFind, getEventManager, getPrefixMapping, isClosed, isEmpty, isIsomorphicWith, notifyAdd, notifyDelete, remove, size, toString, toString
-
Constructor Details
-
MultiUnion
public MultiUnion()Construct a union of exactly no sub graphs.
-
MultiUnion
Construct a union of all of the given graphs
- Parameters:
graphs
- An array of the sub-graphs of this union
-
MultiUnion
Construct a union of all of the given graphs.
- Parameters:
graphs
- An iterator of the sub-graphs of this union. If graphs is a closable iterator, it will be automatically closed.
-
-
Method Details
-
performAdd
Add the given triple to the union model; the actual component model to be updated will be the designated (or default) updateable graph.
- Specified by:
performAdd
in interfaceGraphWithPerform
- Overrides:
performAdd
in classGraphBase
- Parameters:
t
- A triple to add to the union graph- Throws:
JenaException
- if the union does not contain any sub-graphs yet
-
performDelete
Delete the given triple from the union model; the actual component model to be updated will be the designated (or default) updateable graph.
- Specified by:
performDelete
in interfaceGraphWithPerform
- Overrides:
performDelete
in classGraphBase
- Parameters:
t
- A triple to from the union graph- Throws:
JenaException
- if the union does not contain any sub-graphs yet
-
graphBaseContains
Answer true if at least one of the graphs in this union contain the given triple.
- Parameters:
t
- A triple- Returns:
- True if any of the graphs in the union contain t
-
graphBaseFind
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.
- Parameters:
t
- The matcher to match against- Returns:
- An iterator of all triples matching t in the union of the graphs.
-
addGraph
Add the given graph to this union. If it is already a member of the union, don't add it a second time.
-