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

java.lang.Object
  com.hp.hpl.jena.graph.impl.GraphBase
      com.hp.hpl.jena.graph.compose.CompositionBase
          com.hp.hpl.jena.graph.compose.Dyadic

All Implemented Interfaces:

Graph

Direct Known Subclasses:

Delta, Difference, Intersection, Union

public abstract class Dyadic

extends CompositionBase

Author:

kers, Ian Dickinson - refactored most of the content to CompositionBase.

Field Summary

Fields inherited from interface com.hp.hpl.jena.graph.Graph

ADD, DELETE, ORDERED, SIZE

Constructor Summary

Dyadic(Graph L, Graph R)
When the graph is constructed, copy the prefix mappings of both components into this prefix mapping.

Method Summary

int	capabilities() Returns the bitwise or of ADD, DELETE, SIZE and ORDERED, to show the capabilities of this implementation of Graph.
void	close() Free all resources, any further use of this Graph is an error.
boolean	dependsOn(Graph other) true if this graph's content depends on the other graph.
Union	union(Graph X)

Methods inherited from class com.hp.hpl.jena.graph.compose.CompositionBase

butNot, contains, countIterator, ifIn, ifIn, recording, reject, rejecting, size

Methods inherited from class com.hp.hpl.jena.graph.impl.GraphBase

add, contains, delete, find, find, getBulkUpdateHandler, getCapabilities, getEventManager, getPrefixMapping, getReifier, getTransactionHandler, isIsomorphicWith, notifyAdd, notifyDelete, performAdd, performDelete, queryHandler, toString, withReification

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, wait, wait, wait

Constructor Detail

Dyadic

public Dyadic(Graph L,
              Graph R)

When the graph is constructed, copy the prefix mappings of both components into this prefix mapping.

Method Detail

capabilities

public int capabilities()

Description copied from interface: Graph

Returns the bitwise or of ADD, DELETE, SIZE and ORDERED, to show the capabilities of this implementation of Graph. So a read-only graph that finds in an unordered fashion, but can tell you how many triples are in the graph returns SIZE.

See Also:

Graph.capabilities()

close

public void close()

Description copied from interface: Graph

Free all resources, any further use of this Graph is an error.

See Also:

Graph.close()

dependsOn

public boolean dependsOn(Graph other)

Description copied from interface: Graph

true if this graph's content depends on the other graph. May be pessimistic (ie return true if it's not sure). Typically true when a graph is a composition of other graphs, eg union.

union

public Union union(Graph X)