KickJava   Java API By Example, From Geeks To Geeks.

Java > Open Source Codes > com > hp > hpl > jena > graph > impl > WrappedReifier


1 /*
2   (c) Copyright 2003, 2004, 2005 Hewlett-Packard Development Company, LP, all rights reserved.
3   [See end of file]
4   $Id: WrappedReifier.java,v 1.7 2005/02/21 11:52:12 andy_seaborne Exp $
5 */
6
7 package com.hp.hpl.jena.graph.impl;
8
9 import com.hp.hpl.jena.graph.*;
10 import com.hp.hpl.jena.shared.ReificationStyle;
11 import com.hp.hpl.jena.util.iterator.ExtendedIterator;
12
13 /**
14     WrappedReifier: a class that wraps a reifier [needed by WrappedGraph].
15
16     @author kers
17 */
18 public class WrappedReifier implements Reifier
19     {
20     private Reifier base;
21     private Graph parent;
22     /**
23      *
24     */
25     public WrappedReifier( Reifier base, Graph parent )
26         { this.base = base; this.parent = parent; }
27
28     /**
29         @see com.hp.hpl.jena.graph.Reifier#getStyle()
30     */
31     public ReificationStyle getStyle() { return base.getStyle(); }
32     /**
33         @see com.hp.hpl.jena.graph.Reifier#getParentGraph()
34     */
35     public Graph getParentGraph() { return parent; }
36     
37     public ExtendedIterator find( TripleMatch m ) { return base.find( m ); }
38     
39     public ExtendedIterator findExposed( TripleMatch m ) { return base.findExposed( m ); }
40     
41     public ExtendedIterator findEither( TripleMatch m, boolean showHidden )
42         { return base.findEither( m, showHidden ); }
43     
44     public int size() { return base.size(); }
45
46     /**
47         @see com.hp.hpl.jena.graph.Reifier#reifyAs(com.hp.hpl.jena.graph.Node, com.hp.hpl.jena.graph.Triple)
48     */
49     public Node reifyAs( Node n, Triple t ) { return base.reifyAs( n, t ); }
50
51     /**
52         @see com.hp.hpl.jena.graph.Reifier#hasTriple(com.hp.hpl.jena.graph.Node)
53     */
54     public boolean hasTriple( Node n ) { return base.hasTriple( n ); }
55
56     /**
57         @see com.hp.hpl.jena.graph.Reifier#hasTriple(com.hp.hpl.jena.graph.Triple)
58     */
59     public boolean hasTriple( Triple t ) { return base.hasTriple( t ); }
60
61     /**
62         @see com.hp.hpl.jena.graph.Reifier#allNodes()
63     */
64     public ExtendedIterator allNodes() { return base.allNodes(); }
65
66     /**
67         @see com.hp.hpl.jena.graph.Reifier#allNodes(com.hp.hpl.jena.graph.Triple)
68     */
69     public ExtendedIterator allNodes( Triple t ) { return base.allNodes( t ); }
70     /**
71         @see com.hp.hpl.jena.graph.Reifier#remove(com.hp.hpl.jena.graph.Node, com.hp.hpl.jena.graph.Triple)
72     */
73     public void remove( Node n, Triple t ) { base.remove( n, t ); }
74
75     /**
76         @see com.hp.hpl.jena.graph.Reifier#remove(com.hp.hpl.jena.graph.Triple)
77     */
78     public void remove( Triple t ) { base.remove( t ); }
79     /**
80         @see com.hp.hpl.jena.graph.Reifier#handledAdd(com.hp.hpl.jena.graph.Triple)
81     */
82     public boolean handledAdd( Triple t ) { return base.handledAdd( t ); }
83
84     /**
85         @see com.hp.hpl.jena.graph.Reifier#handledRemove(com.hp.hpl.jena.graph.Triple)
86     */
87     public boolean handledRemove( Triple t ) { return base.handledRemove( t ); }
88
89     /**
90         @see com.hp.hpl.jena.graph.GetTriple#getTriple(com.hp.hpl.jena.graph.Node)
91     */
92     public Triple getTriple( Node n ) { return base.getTriple( n ); }
93
94     /**
95         @see com.hp.hpl.jena.graph.Reifier#close()
96     */
97     public void close() { base.close(); }
98
99     }
100
101 /*
102     (c) Copyright 2003, 2004, 2005 Hewlett-Packard Development Company, LP
103     All rights reserved.
104
105     Redistribution and use in source and binary forms, with or without
106     modification, are permitted provided that the following conditions
107     are met:
108
109     1. Redistributions of source code must retain the above copyright
110        notice, this list of conditions and the following disclaimer.
111
112     2. Redistributions in binary form must reproduce the above copyright
113        notice, this list of conditions and the following disclaimer in the
114        documentation and/or other materials provided with the distribution.
115
116     3. The name of the author may not be used to endorse or promote products
117        derived from this software without specific prior written permission.
118
119     THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
120     IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
121     OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
122     IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
123     INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
124     NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
125     DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
126     THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
127     (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
128     THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
129 */
Popular Tags