public class DisjointUnion extends Dyadic
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.TOSTRING_TRIPLE_BASE, TOSTRING_TRIPLE_LIMITemptyGraph| Constructor and Description |
|---|
DisjointUnion(Graph L,
Graph R) |
| Modifier and Type | Method and Description |
|---|---|
boolean |
graphBaseContains(Triple t)
Answer true if the graph contains any triple matching
t. |
void |
performAdd(Triple t)
Add a triple to the triple store.
|
void |
performDelete(Triple t)
Remove a triple from the triple store.
|
close, dependsOn, getL, getR, unionbutNot, ifIn, ifIn, recording, reject, rejecting, rejectingadd, clear, contains, contains, delete, find, find, forTestingOnly_graphBaseFind, getBulkUpdateHandler, getCapabilities, getEventManager, getPrefixMapping, getStatisticsHandler, getTransactionHandler, isClosed, isEmpty, isIsomorphicWith, notifyAdd, notifyDelete, remove, size, toString, toStringpublic boolean graphBaseContains(Triple t)
com.hp.hpl.jena.graph.impl.GraphBaset.
The default implementation uses find and checks to see
if the iterator is non-empty.graphBaseContains in class com.hp.hpl.jena.graph.impl.GraphBasepublic void performDelete(Triple t)
com.hp.hpl.jena.graph.impl.GraphBaseperformDelete in interface com.hp.hpl.jena.graph.impl.GraphWithPerformperformDelete in class com.hp.hpl.jena.graph.impl.GraphBasepublic void performAdd(Triple t)
com.hp.hpl.jena.graph.impl.GraphBaseperformAdd in interface com.hp.hpl.jena.graph.impl.GraphWithPerformperformAdd in class com.hp.hpl.jena.graph.impl.GraphBaseLicenced under the Apache License, Version 2.0