com.hp.hpl.jena.graph.compose
Class DisjointUnion

java.lang.Object
  com.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

All Implemented Interfaces:

Graph, GraphAdd, com.hp.hpl.jena.graph.impl.GraphWithPerform

public class DisjointUnion
extends Dyadic

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.

Author:

kers

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, 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, getStatisticsHandler, getTransactionHandler, isClosed, 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

DisjointUnion

public DisjointUnion(Graph L,
                     Graph R)

Method Detail

graphBaseFind

public ExtendedIterator graphBaseFind(TripleMatch m)

Description copied from class: com.hp.hpl.jena.graph.impl.GraphBase

Answer an iterator over all the triples held in this graph's non-reified triple store that match m. Subclasses must override; it is the core implementation for find(TripleMatch).

Specified by:

graphBaseFind in class com.hp.hpl.jena.graph.impl.GraphBase

graphBaseContains

public boolean graphBaseContains(Triple t)

Description copied from class: com.hp.hpl.jena.graph.impl.GraphBase

Answer true if the graph contains any triple matching t. The default implementation uses find and checks to see if the iterator is non-empty.

Overrides:

graphBaseContains in class com.hp.hpl.jena.graph.impl.GraphBase

performDelete

public void performDelete(Triple t)

Description copied from class: com.hp.hpl.jena.graph.impl.GraphBase

Remove a triple from the triple store. The default implementation throws a DeleteDeniedException; subclasses must override if they want to be able to remove triples.

Specified by:

performDelete in interface com.hp.hpl.jena.graph.impl.GraphWithPerform

Overrides:

performDelete in class com.hp.hpl.jena.graph.impl.GraphBase

performAdd

public void performAdd(Triple t)

Description copied from class: com.hp.hpl.jena.graph.impl.GraphBase

Add a triple to the triple store. The default implementation throws an AddDeniedException; subclasses must override if they want to be able to add triples.

Specified by:

performAdd in interface com.hp.hpl.jena.graph.impl.GraphWithPerform

Overrides:

performAdd in class com.hp.hpl.jena.graph.impl.GraphBase