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

Packages that use Dyadic
com.hp.hpl.jena.graph.compose This package defines simple composite graphs - union, intersection, difference, and update-tracking. 
 

Uses of Dyadic in com.hp.hpl.jena.graph.compose
 

Subclasses of Dyadic in com.hp.hpl.jena.graph.compose
 class Delta
          Graph operation for wrapping a base graph and leaving it unchanged while recording all the attempted updates for later access.
 class Difference
          Class representing the dynamic set difference L - R of two graphs.
 class DisjointUnion
          DisjointUnion - a version of Union that assumes the graphs are disjoint, and hence that find need not do duplicate-removal.
 class Intersection
          an implementation of a dynamic intersection of two models.
 class Union
          A class representing the dynamic union of two graphs.
 



Copyright ? 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 Hewlett-Packard Development Company, LP