|
|||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectcom.hp.hpl.jena.graph.impl.GraphBase
com.hp.hpl.jena.graph.compose.CompositionBase
com.hp.hpl.jena.graph.compose.Polyadic
com.hp.hpl.jena.graph.compose.MultiUnion
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 interface com.hp.hpl.jena.graph.Graph |
emptyGraph |
Constructor Summary | |
MultiUnion()
Construct a union of exactly no sub graphs. |
|
MultiUnion(Graph[] graphs)
Construct a union of all of the given graphs |
|
MultiUnion(java.util.Iterator graphs)
Construct a union of all of the given graphs. |
Method Summary | |
void |
addGraph(Graph graph)
Add the given graph to this union. |
boolean |
contains(Triple t)
Answer true if at least one of the graphs in this union contain the given triple. |
ExtendedIterator |
find(TripleMatch t)
Answer an iterator over the triples in the union of the graphs in this composition. |
Reifier |
getReifier()
Unions share the reifiers of their base graphs. |
void |
notifyAdd(Triple t)
adds are notified by the base graph (and we share its event handler). |
void |
notifyDelete(Triple t)
deletes are notified by the base graph (and we share its event handler). |
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. |
Methods inherited from class com.hp.hpl.jena.graph.compose.Polyadic |
close, dependsOn, getBaseGraph, getBulkUpdateHandler, getCapabilities, getEventManager, getPrefixMapping, getSubGraphs, getTransactionHandler, removeGraph, setBaseGraph |
Methods inherited from class com.hp.hpl.jena.graph.compose.CompositionBase |
butNot, countIterator, ifIn, ifIn, recording, reject, rejecting, size |
Methods inherited from class com.hp.hpl.jena.graph.impl.GraphBase |
add, contains, delete, find, isEmpty, isIsomorphicWith, queryHandler, toString, toString |
Methods inherited from class java.lang.Object |
equals, getClass, hashCode, notify, notifyAll, wait, wait, wait |
Constructor Detail |
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 MultiUnion(java.util.Iterator graphs)
Construct a union of all of the given graphs.
graphs
- An iterator of the sub-graphs of this union. If graphs is
a closable iterator, it will be automatically closed.Method Detail |
public Reifier getReifier()
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.
t
- A triple to add to the union graph
JenaException
- if the union does not contain any sub-graphs yetpublic void notifyAdd(Triple t)
public void notifyDelete(Triple t)
public 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.
t
- A triple to from the union graph
JenaException
- if the union does not contain any sub-graphs yetpublic boolean contains(Triple t)
Answer true if at least one of the graphs in this union contain the given triple.
contains
in interface Graph
contains
in class CompositionBase
t
- A triple
Graph.contains(Triple)
public ExtendedIterator find(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.
t
- The matcher to match against
Graph.find(TripleMatch)
public void addGraph(Graph graph)
Add the given graph to this union. If it is already a member of the union, don't add it a second time.
addGraph
in class Polyadic
graph
- A sub-graph to add to this union
|
|||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |