|
||||||||||
| 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
public class MultiUnion
A graph implementation that presents the union of zero or more subgraphs, one of which is distinguished as the updateable graph.
| Nested Class Summary | |
|---|---|
static class |
MultiUnion.MultiUnionStatisticsHandler
|
| Field Summary |
|---|
| Fields inherited from class com.hp.hpl.jena.graph.impl.GraphBase |
|---|
TOSTRING_TRIPLE_BASE, TOSTRING_TRIPLE_LIMIT |
| 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(Iterator<Graph> graphs)
Construct a union of all of the given graphs. |
|
| Method Summary | |
|---|---|
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()
returns this Graph's query handler |
| Methods inherited from class com.hp.hpl.jena.graph.compose.Polyadic |
|---|
close, dependsOn, getBaseGraph, getBulkUpdateHandler, getCapabilities, getPrefixMapping, getRequiredBaseGraph, getSubGraphs, getTransactionHandler, removeGraph, setBaseGraph |
| Methods inherited from class com.hp.hpl.jena.graph.compose.CompositionBase |
|---|
butNot, ifIn, ifIn, recording, reject, rejecting, rejecting |
| Methods inherited from class com.hp.hpl.jena.graph.impl.GraphBase |
|---|
add, contains, contains, delete, find, find, forTestingOnly_graphBaseFind, getEventManager, getStatisticsHandler, isClosed, isEmpty, isIsomorphicWith, notifyAdd, notifyDelete, size, 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(Iterator<Graph> 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()
getReifier in interface GraphgetReifier in class com.hp.hpl.jena.graph.impl.GraphBasepublic 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.GraphWithPerformperformAdd in class com.hp.hpl.jena.graph.impl.GraphBaset - A triple to add to the union graph
JenaException - 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.GraphWithPerformperformDelete in class com.hp.hpl.jena.graph.impl.GraphBaset - A triple to from the union graph
JenaException - 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.GraphBaset - A triple
public QueryHandler queryHandler()
Graph
queryHandler in interface GraphqueryHandler in class com.hp.hpl.jena.graph.impl.GraphBasepublic 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.GraphBaset - The matcher to match against
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 Polyadicgraph - A sub-graph to add to this union
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||