|
||||||||||
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.DisjointUnion
public class DisjointUnion
DisjointUnion - a version of Union that assumes the graphs are disjoint, and
hence that find
need not do duplicate-removal. Adding things
to the graph adds them to the left component, and does not add
triples that are already in the right component.
Field Summary |
---|
Fields inherited from interface com.hp.hpl.jena.graph.Graph |
---|
emptyGraph |
Constructor Summary | |
---|---|
DisjointUnion(Graph L,
Graph R)
|
Method Summary | |
---|---|
boolean |
graphBaseContains(Triple t)
Answer true if the graph contains any triple matching t . |
ExtendedIterator |
graphBaseFind(TripleMatch m)
Answer an iterator over all the triples held in this graph's non-reified triple store that match m . |
void |
performAdd(Triple t)
Add a triple to the triple store. |
void |
performDelete(Triple t)
Remove a triple from the triple store. |
Methods inherited from class com.hp.hpl.jena.graph.compose.Dyadic |
---|
close, dependsOn, getL, getR, union |
Methods inherited from class com.hp.hpl.jena.graph.compose.CompositionBase |
---|
butNot, countIterator, graphBaseSize, 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, getBulkUpdateHandler, getCapabilities, getEventManager, getPrefixMapping, getReifier, getTransactionHandler, isEmpty, isIsomorphicWith, notifyAdd, notifyDelete, queryHandler, size, toString, toString |
Methods inherited from class java.lang.Object |
---|
equals, getClass, hashCode, notify, notifyAll, wait, wait, wait |
Constructor Detail |
---|
public DisjointUnion(Graph L, Graph R)
Method Detail |
---|
public ExtendedIterator graphBaseFind(TripleMatch m)
com.hp.hpl.jena.graph.impl.GraphBase
m
. Subclasses must override; it is the core
implementation for find(TripleMatch)
.
graphBaseFind
in class com.hp.hpl.jena.graph.impl.GraphBase
public boolean graphBaseContains(Triple t)
com.hp.hpl.jena.graph.impl.GraphBase
t
.
The default implementation uses find
and checks to see
if the iterator is non-empty.
graphBaseContains
in class com.hp.hpl.jena.graph.impl.GraphBase
public void performDelete(Triple t)
com.hp.hpl.jena.graph.impl.GraphBase
performDelete
in interface com.hp.hpl.jena.graph.impl.GraphWithPerform
performDelete
in class com.hp.hpl.jena.graph.impl.GraphBase
public void performAdd(Triple t)
com.hp.hpl.jena.graph.impl.GraphBase
performAdd
in interface com.hp.hpl.jena.graph.impl.GraphWithPerform
performAdd
in class com.hp.hpl.jena.graph.impl.GraphBase
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |