| com.hp.hpl.jena.graph.compose.CompositionBase
 com.hp.hpl.jena.graph.compose.Dyadic
All known Subclasses: com.hp.hpl.jena.graph.compose.Intersection, com.hp.hpl.jena.graph.compose.Union, com.hp.hpl.jena.graph.compose.Difference, com.hp.hpl.jena.graph.compose.Delta, com.hp.hpl.jena.graph.compose.DisjointUnion,
| Dyadic | | abstract public class Dyadic extends CompositionBase (Code) | | Base class for the two-operand composition operations; has two graphs L and R
author:
kers
author:
Ian Dickinson - refactored most of the content to CompositionBase
author:
. |
| Constructor Summary | |
| public | Dyadic(Graph L, Graph R)
When the graph is constructed, copy the prefix mappings of both components
into this prefix mapping. |
| Method Summary | |
| public void | close()
| | public boolean | dependsOn(Graph other)
Generic dependsOn, true iff it depends on either of the subgraphs. | | public Object | getL()
Answer the left (first) operand of this Dyadic. | | public Object | getR()
Answer the right (second) operand of this Dyadic. | | public Union | union(Graph X)
|
| Dyadic | | public Dyadic(Graph L, Graph R)(Code) | | When the graph is constructed, copy the prefix mappings of both components
into this prefix mapping. The prefix mapping doesn't change afterwards with the
components, which might be regarded as a bug.
|
| close | | public void close()(Code) | | |
| dependsOn | | public boolean dependsOn(Graph other)(Code) | | Generic dependsOn, true iff it depends on either of the subgraphs.
|
| getL | | public Object getL()(Code) | | Answer the left (first) operand of this Dyadic.
|
| getR | | public Object getR()(Code) | | Answer the right (second) operand of this Dyadic.
|
|
|