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_LIMIT
emptyGraph
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, union
butNot, ifIn, ifIn, recording, reject, rejecting, rejecting
add, clear, contains, contains, delete, find, find, forTestingOnly_graphBaseFind, getCapabilities, getEventManager, getPrefixMapping, getStatisticsHandler, getTransactionHandler, isClosed, isEmpty, isIsomorphicWith, notifyAdd, notifyDelete, remove, size, toString, toString
public boolean graphBaseContains(Triple t)
GraphBase
t
.
The default implementation uses find
and checks to see
if the iterator is non-empty.public void performDelete(Triple t)
GraphBase
performDelete
in interface GraphWithPerform
performDelete
in class GraphBase
public void performAdd(Triple t)
GraphBase
performAdd
in interface GraphWithPerform
performAdd
in class GraphBase
Licenced under the Apache License, Version 2.0