public class Union extends Dyadic implements Graph
MultiUnion
TOSTRING_TRIPLE_BASE, TOSTRING_TRIPLE_LIMIT
emptyGraph
Modifier and Type | Method and Description |
---|---|
boolean |
graphBaseContains(Triple t)
Answer true if the graph contains any triple matching
t . |
com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> |
graphBaseFind(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.
|
close, dependsOn, getL, getR, union
butNot, ifIn, ifIn, recording, reject, rejecting, rejecting
add, contains, contains, delete, find, find, forTestingOnly_graphBaseFind, getBulkUpdateHandler, getCapabilities, getEventManager, getPrefixMapping, getReifier, getStatisticsHandler, getTransactionHandler, isClosed, isEmpty, isIsomorphicWith, notifyAdd, notifyDelete, queryHandler, size, toString, toString
equals, getClass, hashCode, notify, notifyAll, wait, wait, wait
close, contains, contains, delete, dependsOn, find, find, getBulkUpdateHandler, getCapabilities, getEventManager, getPrefixMapping, getReifier, getStatisticsHandler, getTransactionHandler, isClosed, isEmpty, isIsomorphicWith, queryHandler, size
public void performAdd(Triple t)
performAdd
in interface com.hp.hpl.jena.graph.impl.GraphWithPerform
performAdd
in class com.hp.hpl.jena.graph.impl.GraphBase
public void performDelete(Triple t)
performDelete
in interface com.hp.hpl.jena.graph.impl.GraphWithPerform
performDelete
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 com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> graphBaseFind(TripleMatch t)
graphBaseFind
in class com.hp.hpl.jena.graph.impl.GraphBase
Copyright ? 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 Hewlett-Packard Development Company, LP