| com.hp.hpl.jena.graph.compose |
|
graph.compose
This package defines simple composite graphs - union, intersection,
difference, and update-tracking.
|
| Java Source File Name | Type | Comment |
| CompositionBase.java | Class |
Base class for graphs that are composed of multiple sub-graphs. |
| Delta.java | Class | Graph operation for wrapping a base graph and leaving it unchanged while recording
all the attempted updates for later access. |
| Difference.java | Class | Class representing the dynamic set difference L - R of two graphs. |
| DisjointUnion.java | Class | DisjointUnion - a version of Union that assumes the graphs are disjoint, and
hence that find need not do duplicate-removal. |
| Dyadic.java | Class | |
| Intersection.java | Class | an implementation of a dynamic intersection of two models. |
| MultiUnion.java | Class |
A graph implementation that presents the union of zero or more subgraphs,
one of which is distinguished as the updateable graph. |
| Polyadic.java | Class |
A base class for composition graphs that are composed from zero or more
sub-graphs (thus providing a basis for polyadic composition operators). |
| PolyadicPrefixMappingImpl.java | Class | |
| Union.java | Class | A class representing the dynamic union of two graphs. |