KickJava   Java API By Example, From Geeks To Geeks.

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


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: IntersectionClassImpl.java,v $
10  * Revision $Revision: 1.8 $
11  * Release status $State: Exp $
12  *
13  * Last modified on $Date: 2005/02/21 12:06:23 $
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 an intersection 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: IntersectionClassImpl.java,v 1.8 2005/02/21 12:06:23 andy_seaborne Exp $
41  */

42 public class IntersectionClassImpl
43     extends BooleanClassDescriptionImpl
44     implements IntersectionClass
45 {
46     // Constants
47
//////////////////////////////////
48

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

52     /**
53      * A factory for generating IntersectionClass 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 IntersectionClassImpl( n, eg );
61             }
62             else {
63                 throw new ConversionException( "Cannot convert node " + n + " to IntersectionClass");
64             }
65         }
66             
67         public boolean canWrap( Node node, EnhGraph eg ) {
68             // node will support being an IntersectionClass facet if it has rdf:type owl:Class and an owl:intersectionOf statement (or equivalents)
69
Profile profile = (eg instanceof OntModel) ? ((OntModel) eg).getProfile() : null;
70             return (profile != null) &&
71                    profile.isSupported( node, eg, OntClass.class ) &&
72                    AbstractProfile.containsSome( eg, node, profile.INTERSECTION_OF() );
73         }
74     };
75
76
77     // Instance variables
78
//////////////////////////////////
79

80     // Constructors
81
//////////////////////////////////
82

83     /**
84      * <p>
85      * Construct an intersection class node represented by the given node in the given graph.
86      * </p>
87      *
88      * @param n The node that represents the resource
89      * @param g The enh graph that contains n
90      */

91     public IntersectionClassImpl( Node n, EnhGraph g ) {
92         super( n, g );
93     }
94
95
96     // External signature methods
97
//////////////////////////////////
98

99     public Property operator() {return getProfile().INTERSECTION_OF();}
100     public String JavaDoc getOperatorName() {return "INTERSECTION_OF";}
101     
102
103     // Internal implementation methods
104
//////////////////////////////////
105

106     //==============================================================================
107
// Inner class definitions
108
//==============================================================================
109

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

142
Popular Tags