01: /*
02: (c) Copyright 2004, 2005, 2006, 2007, 2008 Hewlett-Packard Development Company, LP, all rights reserved.
03: [See end of file]
04: $Id: DisjointUnion.java,v 1.8 2008/01/02 12:10:19 andy_seaborne Exp $
05: */
06: package com.hp.hpl.jena.graph.compose;
07:
08: import com.hp.hpl.jena.graph.Graph;
09: import com.hp.hpl.jena.graph.Triple;
10: import com.hp.hpl.jena.graph.TripleMatch;
11: import com.hp.hpl.jena.util.iterator.ExtendedIterator;
12:
13: /**
14: DisjointUnion - a version of Union that assumes the graphs are disjoint, and
15: hence that <code>find</code> need not do duplicate-removal. Adding things
16: to the graph adds them to the left component, and does <i>not</i> add
17: triples that are already in the right component.
18:
19: @author kers
20: */
21: public class DisjointUnion extends Dyadic {
22: public DisjointUnion(Graph L, Graph R) {
23: super (L, R);
24: }
25:
26: public ExtendedIterator graphBaseFind(TripleMatch m) {
27: return L.find(m).andThen(R.find(m));
28: }
29:
30: public boolean graphBaseContains(Triple t) {
31: return L.contains(t) || R.contains(t);
32: }
33:
34: public void performDelete(Triple t) {
35: L.delete(t);
36: R.delete(t);
37: }
38:
39: public void performAdd(Triple t) {
40: if (!R.contains(t))
41: L.add(t);
42: }
43: }
44:
45: /*
46: (c) Copyright 2004, 2005, 2006, 2007, 2008 Hewlett-Packard Development Company, LP
47: All rights reserved.
48:
49: Redistribution and use in source and binary forms, with or without
50: modification, are permitted provided that the following conditions
51: are met:
52:
53: 1. Redistributions of source code must retain the above copyright
54: notice, this list of conditions and the following disclaimer.
55:
56: 2. Redistributions in binary form must reproduce the above copyright
57: notice, this list of conditions and the following disclaimer in the
58: documentation and/or other materials provided with the distribution.
59:
60: 3. The name of the author may not be used to endorse or promote products
61: derived from this software without specific prior written permission.
62:
63: THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
64: IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
65: OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
66: IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
67: INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
68: NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
69: DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
70: THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
71: (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
72: THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
73: */
|