Module org.apache.jena.core

Package org.apache.jena.graph.compose

package org.apache.jena.graph.compose

This package defines simple composite graphs - union, intersection, difference, and update-tracking.

Related Packages

Package	Description
org.apache.jena.graph	This package defines the Graph and Node family of classes, which form the underlying datatypes of the Jena system.
org.apache.jena.graph.impl	This package provides basic implementations of Graph interfaces such as EventManager and Capabilities.
org.apache.jena.graph.langtag

Classes

Class	Description
CompositionBase	Base class for graphs that are composed of multiple sub-graphs.
Delta	Graph operation for wrapping a base graph and leaving it unchanged while recording all the attempted updates for later access.
Difference	Class representing the dynamic set difference L - R of two graphs.
DisjointUnion	DisjointUnion - a version of Union that assumes the graphs are disjoint, and hence that find need not do duplicate-removal.
Dyadic	Base class for the two-operand composition operations; has two graphs L and R
Intersection	The dynamic intersection of two graphs L and R.
MultiUnion	A graph implementation that presents the union of zero or more subgraphs, one of which is distinguished as the updateable graph.
Polyadic	A base class for composition graphs that are composed from zero or more sub-graphs (thus providing a basis for polyadic composition operators).
PolyadicPrefixMappingImpl
Union	A class representing the dynamic union of two graphs.