KickJava   Java API By Example, From Geeks To Geeks.

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


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 08-May-2003
9  * Filename $RCSfile: MinCardinalityRestrictionImpl.java,v $
10  * Revision $Revision: 1.6 $
11  * Release status $State: Exp $
12  *
13  * Last modified on $Date: 2005/02/21 12:06:37 $
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
26 // Imports
27 ///////////////
28 import com.hp.hpl.jena.enhanced.*;
29 import com.hp.hpl.jena.graph.*;
30 import com.hp.hpl.jena.ontology.*;
31
32
33 /**
34  * <p>
35  * Implementation of the min cardinality restriction abstraction.
36  * </p>
37  *
38  * @author Ian Dickinson, HP Labs
39  * (<a HREF="mailto:Ian.Dickinson@hp.com" >email</a>)
40  * @version CVS $Id: MinCardinalityRestrictionImpl.java,v 1.6 2005/02/21 12:06:37 andy_seaborne Exp $
41  */
42 public class MinCardinalityRestrictionImpl
43     extends RestrictionImpl
44     implements MinCardinalityRestriction
45 {
46     // Constants
47 //////////////////////////////////
48
49     // Static variables
50 //////////////////////////////////
51
52     /**
53      * A factory for generating MinCardinalityRestriction 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 MinCardinalityRestrictionImpl( n, eg );
61             }
62             else {
63                 throw new ConversionException( "Cannot convert node " + n + " to MinCardinalityRestriction");
64             }
65         }
66             
67         public boolean canWrap( Node node, EnhGraph eg ) {
68             // node will support being a MinCardinalityRestriction facet if it has rdf:type owl:Restriction or equivalent
69 // and the combination of owl:onProperty and owl:cardinality (or equivalents)
70 Profile profile = (eg instanceof OntModel) ? ((OntModel) eg).getProfile() : null;
71             return (profile != null) && profile.isSupported( node, eg, MinCardinalityRestriction.class );
72         }
73     };
74
75
76     // Instance variables
77 //////////////////////////////////
78
79     // Constructors
80 //////////////////////////////////
81
82     /**
83      * <p>
84      * Construct a min cardinality restriction node represented by the given node in the given graph.
85      * </p>
86      *
87      * @param n The node that represents the resource
88      * @param g The enh graph that contains n
89      */
90     public MinCardinalityRestrictionImpl( Node n, EnhGraph g ) {
91         super( n, g );
92     }
93
94     // External signature methods
95 //////////////////////////////////
96
97     // minCardinality
98
99     /**
100      * <p>Assert that this restriction restricts the property to have the given
101      * minimum cardinality. Any existing statements for <code>minCardinality</code>
102      * will be removed.</p>
103      * @param cardinality The minimum cardinality of the restricted property
104      * @exception OntProfileException If the {@link Profile#MIN_CARDINALITY()} property is not supported in the current language profile.
105      */
106     public void setMinCardinality( int cardinality ) {
107         setPropertyValue( getProfile().MIN_CARDINALITY(), "MIN_CARDINALITY", getModel().createTypedLiteral( cardinality ) );
108     }
109
110     /**
111      * <p>Answer the minimum cardinality of the restricted property.</p>
112      * @return The minimum cardinality of the restricted property
113      * @exception OntProfileException If the {@link Profile#MIN_CARDINALITY()} property is not supported in the current language profile.
114      */
115     public int getMinCardinality() {
116         return objectAsInt( getProfile().MIN_CARDINALITY(), "MIN_CARDINALITY" );
117     }
118
119     /**
120      * <p>Answer true if this property restriction has the given minimum cardinality.</p>
121      * @param cardinality The cardinality to test against
122      * @return True if the given cardinality is the min cardinality of the restricted property in this restriction
123      * @exception OntProfileException If the {@link Profile#MIN_CARDINALITY()} property is not supported in the current language profile.
124      */
125     public boolean hasMinCardinality( int cardinality ) {
126         return hasPropertyValue( getProfile().MIN_CARDINALITY(), "MIN_CARDINALITY", getModel().createTypedLiteral( cardinality ) );
127     }
128     
129     /**
130      * <p>Remove the statement that this restriction has the given minimum cardinality
131      * for the restricted property. If this statement
132      * is not true of the current model, nothing happens.</p>
133      * @param cardinality A min cardinality value to be removed from this restriction
134      */
135     public void removeMinCardinality( int cardinality ) {
136         removePropertyValue( getProfile().MIN_CARDINALITY(), "MIN_CARDINALITY", getModel().createTypedLiteral( cardinality ) );
137     }
138     
139
140
141     // Internal implementation methods
142 //////////////////////////////////
143
144     //==============================================================================
145 // Inner class definitions
146 //==============================================================================
147
148 }
149
150
151 /*
152     (c) Copyright 2002, 2003, 2004, 2005 Hewlett-Packard Development Company, LP
153     All rights reserved.
154
155     Redistribution and use in source and binary forms, with or without
156     modification, are permitted provided that the following conditions
157     are met:
158
159     1. Redistributions of source code must retain the above copyright
160        notice, this list of conditions and the following disclaimer.
161
162     2. Redistributions in binary form must reproduce the above copyright
163        notice, this list of conditions and the following disclaimer in the
164        documentation and/or other materials provided with the distribution.
165
166     3. The name of the author may not be used to endorse or promote products
167        derived from this software without specific prior written permission.
168
169     THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
170     IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
171     OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
172     IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
173     INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
174     NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
175     DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
176     THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
177     (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
178     THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
179 */
180
Popular Tags