|
|||||||||||
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.Dyadic
com.hp.hpl.jena.graph.compose.Union
A class representing the dynamic union of two graphs. Addition only affects the left operand, deletion affects both.
MultiUnion
Field Summary |
Fields inherited from interface com.hp.hpl.jena.graph.Graph |
emptyGraph |
Constructor Summary | |
Union(Graph L,
Graph R)
|
Method Summary | |
boolean |
contains(Triple t)
Answer true iff the graph contains a triple that t matches; t may be fluid. |
ExtendedIterator |
find(TripleMatch t)
To find in the union, find in the components, concatenate the results, and omit duplicates. |
void |
performAdd(Triple t)
To add a triple to the union, add it to the left operand; this is asymmetric. |
void |
performDelete(Triple t)
To remove a triple, remove it from both operands. |
Methods inherited from class com.hp.hpl.jena.graph.compose.Dyadic |
close, dependsOn, union |
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, getBulkUpdateHandler, getCapabilities, getEventManager, getPrefixMapping, getReifier, getTransactionHandler, isEmpty, isIsomorphicWith, notifyAdd, notifyDelete, queryHandler, toString, toString |
Methods inherited from class java.lang.Object |
equals, getClass, hashCode, notify, notifyAll, wait, wait, wait |
Methods inherited from interface com.hp.hpl.jena.graph.Graph |
close, contains, delete, dependsOn, find, getBulkUpdateHandler, getCapabilities, getEventManager, getPrefixMapping, getReifier, getTransactionHandler, isEmpty, isIsomorphicWith, queryHandler, size |
Methods inherited from interface com.hp.hpl.jena.graph.GraphAdd |
add |
Constructor Detail |
public Union(Graph L, Graph R)
Method Detail |
public void performAdd(Triple t)
public void performDelete(Triple t)
public boolean contains(Triple t)
Graph
contains
in interface Graph
contains
in class CompositionBase
t
- A triple to test
Graph.contains(Triple)
public ExtendedIterator find(TripleMatch t)
find
in interface Graph
Graph.find(TripleMatch)
|
|||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |