KickJava   Java API By Example, From Geeks To Geeks.

Java > Open Source Codes > com > hp > hpl > jena > ontology > impl > UnionClassImpl


1 /*****************************************************************************
2  * Source code information
3  * -----------------------
4  * Original author Ian Dickinson, HP Labs Bristol
5  * Author email Ian.Dickinson@hp.com
6  * Package Jena 2
7  * Web http://sourceforge.net/projects/jena/
8  * Created 28-Apr-2003
9  * Filename $RCSfile: UnionClassImpl.java,v $
10  * Revision $Revision: 1.8 $
11  * Release status $State: Exp $
12  *
13  * Last modified on $Date: 2005/02/21 12:06:55 $
14  * by $Author: andy_seaborne $
15  *
16  * (c) Copyright 2002, 2003, 2004, 2005 Hewlett-Packard Development Company, LP
17  * (see footer for full conditions)
18  *****************************************************************************/

19
20 // Package
21
///////////////
22
package com.hp.hpl.jena.ontology.impl;
23
24
25 // Imports
26
///////////////
27
import com.hp.hpl.jena.enhanced.*;
28 import com.hp.hpl.jena.graph.Node;
29 import com.hp.hpl.jena.ontology.*;
30 import com.hp.hpl.jena.rdf.model.Property;
31
32
33 /**
34  * <p>
35  * Implementation of a node representing a union class description.
36  * </p>
37  *
38  * @author Ian Dickinson, HP Labs
39  * (<a HREF="mailto:Ian.Dickinson@hp.com" >email</a>)
40  * @version CVS $Id: UnionClassImpl.java,v 1.8 2005/02/21 12:06:55 andy_seaborne Exp $
41  */

42 public class UnionClassImpl
43     extends BooleanClassDescriptionImpl
44     implements UnionClass
45 {
46     // Constants
47
//////////////////////////////////
48

49     // Static variables
50
//////////////////////////////////
51

52     /**
53      * A factory for generating UnionClass facets from nodes in enhanced graphs.
54      * Note: should not be invoked directly by user code: use
55      * {@link com.hp.hpl.jena.rdf.model.RDFNode#as as()} instead.
56      */

57     public static Implementation factory = new Implementation() {
58         public EnhNode wrap( Node n, EnhGraph eg ) {
59             if (canWrap( n, eg )) {
60                 return new UnionClassImpl( n, eg );
61             }
62             else {
63                 throw new ConversionException( "Cannot convert node " + n + " to UnionClass");
64             }
65         }
66             
67         public boolean canWrap( Node node, EnhGraph eg ) {
68             // node will support being an UnionClass facet if it has rdf:type owl:Class and an owl:unionOf statement (or equivalents)
69
Profile profile = (eg instanceof OntModel) ? ((OntModel) eg).getProfile() : null;
70             Property union = (profile == null) ? null : profile.UNION_OF();
71             
72             return (profile != null) &&
73                    profile.isSupported( node, eg, OntClass.class ) &&
74                    union != null &&
75                    eg.asGraph().contains( node, union.getNode(), Node.ANY );
76         }
77     };
78
79
80     // Instance variables
81
//////////////////////////////////
82

83     // Constructors
84
//////////////////////////////////
85

86     /**
87      * <p>
88      * Construct a union class node represented by the given node in the given graph.
89      * </p>
90      *
91      * @param n The node that represents the resource
92      * @param g The enh graph that contains n
93      */

94     public UnionClassImpl( Node n, EnhGraph g ) {
95         super( n, g );
96     }
97
98
99     // External signature methods
100
//////////////////////////////////
101

102     public Property operator() {return getProfile().UNION_OF();}
103     public String JavaDoc getOperatorName() {return "UNION_OF";}
104
105
106     // Internal implementation methods
107
//////////////////////////////////
108

109     //==============================================================================
110
// Inner class definitions
111
//==============================================================================
112

113 }
114
115
116 /*
117     (c) Copyright 2002, 2003, 2004, 2005 Hewlett-Packard Development Company, LP
118     All rights reserved.
119
120     Redistribution and use in source and binary forms, with or without
121     modification, are permitted provided that the following conditions
122     are met:
123
124     1. Redistributions of source code must retain the above copyright
125        notice, this list of conditions and the following disclaimer.
126
127     2. Redistributions in binary form must reproduce the above copyright
128        notice, this list of conditions and the following disclaimer in the
129        documentation and/or other materials provided with the distribution.
130
131     3. The name of the author may not be used to endorse or promote products
132        derived from this software without specific prior written permission.
133
134     THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
135     IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
136     OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
137     IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
138     INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
139     NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
140     DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
141     THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
142     (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
143     THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
144 */

145
146
147
Popular Tags