001: /*****************************************************************************
002: * Source code information
003: * -----------------------
004: * Original author Ian Dickinson, HP Labs Bristol
005: * Author email Ian.Dickinson@hp.com
006: * Package Jena 2
007: * Web http://sourceforge.net/projects/jena/
008: * Created 28-Apr-2003
009: * Filename $RCSfile: IntersectionClassImpl.java,v $
010: * Revision $Revision: 1.11 $
011: * Release status $State: Exp $
012: *
013: * Last modified on $Date: 2008/01/02 12:08:03 $
014: * by $Author: andy_seaborne $
015: *
016: * (c) Copyright 2002, 2003, 2004, 2005, 2006, 2007, 2008 Hewlett-Packard Development Company, LP
017: * (see footer for full conditions)
018: *****************************************************************************/package com.hp.hpl.jena.ontology.impl;
019:
020: // Imports
021: ///////////////
022: import com.hp.hpl.jena.enhanced.*;
023: import com.hp.hpl.jena.graph.Node;
024: import com.hp.hpl.jena.ontology.*;
025: import com.hp.hpl.jena.rdf.model.Property;
026:
027: /**
028: * <p>
029: * Implementation of a node representing an intersection class description.
030: * </p>
031: *
032: * @author Ian Dickinson, HP Labs
033: * (<a href="mailto:Ian.Dickinson@hp.com" >email</a>)
034: * @version CVS $Id: IntersectionClassImpl.java,v 1.11 2008/01/02 12:08:03 andy_seaborne Exp $
035: */
036: public class IntersectionClassImpl extends BooleanClassDescriptionImpl
037: implements IntersectionClass {
038: // Constants
039: //////////////////////////////////
040:
041: // Static variables
042: //////////////////////////////////
043:
044: /**
045: * A factory for generating IntersectionClass facets from nodes in enhanced graphs.
046: * Note: should not be invoked directly by user code: use
047: * {@link com.hp.hpl.jena.rdf.model.RDFNode#as as()} instead.
048: */
049: public static Implementation factory = new Implementation() {
050: public EnhNode wrap(Node n, EnhGraph eg) {
051: if (canWrap(n, eg)) {
052: return new IntersectionClassImpl(n, eg);
053: } else {
054: throw new ConversionException("Cannot convert node "
055: + n + " to IntersectionClass");
056: }
057: }
058:
059: public boolean canWrap(Node node, EnhGraph eg) {
060: // node will support being an IntersectionClass facet if it has rdf:type owl:Class and an owl:intersectionOf statement (or equivalents)
061: Profile profile = (eg instanceof OntModel) ? ((OntModel) eg)
062: .getProfile()
063: : null;
064: return (profile != null)
065: && profile.isSupported(node, eg, OntClass.class)
066: && AbstractProfile.containsSome(eg, node, profile
067: .INTERSECTION_OF());
068: }
069: };
070:
071: // Instance variables
072: //////////////////////////////////
073:
074: // Constructors
075: //////////////////////////////////
076:
077: /**
078: * <p>
079: * Construct an intersection class node represented by the given node in the given graph.
080: * </p>
081: *
082: * @param n The node that represents the resource
083: * @param g The enh graph that contains n
084: */
085: public IntersectionClassImpl(Node n, EnhGraph g) {
086: super (n, g);
087: }
088:
089: // External signature methods
090: //////////////////////////////////
091:
092: public Property operator() {
093: return getProfile().INTERSECTION_OF();
094: }
095:
096: public String getOperatorName() {
097: return "INTERSECTION_OF";
098: }
099:
100: // Internal implementation methods
101: //////////////////////////////////
102:
103: //==============================================================================
104: // Inner class definitions
105: //==============================================================================
106:
107: }
108:
109: /*
110: (c) Copyright 2002, 2003, 2004, 2005, 2006, 2007, 2008 Hewlett-Packard Development Company, LP
111: All rights reserved.
112:
113: Redistribution and use in source and binary forms, with or without
114: modification, are permitted provided that the following conditions
115: are met:
116:
117: 1. Redistributions of source code must retain the above copyright
118: notice, this list of conditions and the following disclaimer.
119:
120: 2. Redistributions in binary form must reproduce the above copyright
121: notice, this list of conditions and the following disclaimer in the
122: documentation and/or other materials provided with the distribution.
123:
124: 3. The name of the author may not be used to endorse or promote products
125: derived from this software without specific prior written permission.
126:
127: THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
128: IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
129: OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
130: IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
131: INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
132: NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
133: DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
134: THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
135: (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
136: THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
137: */
|