|
What this is
Other links
The source code// $Id: ClassDiagramGraphModel.java,v 1.60 2004/09/28 11:12:21 bobtarling Exp $ // Copyright (c) 1996-2002 The Regents of the University of California. All // Rights Reserved. Permission to use, copy, modify, and distribute this // software and its documentation without fee, and without a written // agreement is hereby granted, provided that the above copyright notice // and this paragraph appear in all copies. This software program and // documentation are copyrighted by The Regents of the University of // California. The software program and documentation are supplied "AS // IS", without any accompanying services from The Regents. The Regents // does not warrant that the operation of the program will be // uninterrupted or error-free. The end-user understands that the program // was developed for research purposes and is advised not to rely // exclusively on the program for any reason. IN NO EVENT SHALL THE // UNIVERSITY OF CALIFORNIA BE LIABLE TO ANY PARTY FOR DIRECT, INDIRECT, // SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES, INCLUDING LOST PROFITS, // ARISING OUT OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN IF // THE UNIVERSITY OF CALIFORNIA HAS BEEN ADVISED OF THE POSSIBILITY OF // SUCH DAMAGE. THE UNIVERSITY OF CALIFORNIA SPECIFICALLY DISCLAIMS ANY // WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF // MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE SOFTWARE // PROVIDED HEREUNDER IS ON AN "AS IS" BASIS, AND THE UNIVERSITY OF // CALIFORNIA HAS NO OBLIGATIONS TO PROVIDE MAINTENANCE, SUPPORT, // UPDATES, ENHANCEMENTS, OR MODIFICATIONS. // File: ClassDiagramGraphModel.java // Classes: ClassDiagramGraphModel // Original Author: jrobbins@ics.uci.edu // $Id: ClassDiagramGraphModel.java,v 1.60 2004/09/28 11:12:21 bobtarling Exp $ package org.argouml.uml.diagram.static_structure; import java.beans.PropertyChangeEvent; import java.beans.VetoableChangeListener; import java.util.Collection; import java.util.Iterator; import java.util.List; import java.util.Vector; import org.apache.log4j.Logger; import org.argouml.model.ModelFacade; import org.argouml.model.uml.UmlHelper; import org.argouml.model.uml.foundation.core.CoreHelper; import org.argouml.uml.diagram.UMLMutableGraphSupport; import org.argouml.uml.diagram.static_structure.ui.CommentEdge; /** This class defines a bridge between the UML meta-model * representation of the design and the GraphModel interface used by * GEF. This class handles only UML Class digrams. */ public class ClassDiagramGraphModel extends UMLMutableGraphSupport implements VetoableChangeListener { private static final Logger LOG = Logger.getLogger(ClassDiagramGraphModel.class); //////////////////////////////////////////////////////////////// // instance variables /** The "home" UML model of this diagram, not all ModelElements in this * graph are in the home model, but if they are added and don't * already have a model, they are placed in the "home model". * Also, elements from other models will have their FigNodes add a * line to say what their model is. */ private Object model; //////////////////////////////////////////////////////////////// // accessors /** * @see org.argouml.uml.diagram.UMLMutableGraphSupport#getNamespace() */ public Object getNamespace() { return model; } /** * @param namespace the namespace to be set for this diagram */ public void setNamespace(Object namespace) { if (!ModelFacade.isANamespace(namespace)) { throw new IllegalArgumentException(); } model = namespace; } //////////////////////////////////////////////////////////////// // GraphModel implementation /** * @see org.tigris.gef.graph.GraphModel#getPorts(java.lang.Object) * * Return all ports on node or edge. */ public List getPorts(Object nodeOrEdge) { Vector res = new Vector(); //wasteful! if (ModelFacade.isAClass(nodeOrEdge)) res.addElement(nodeOrEdge); if (ModelFacade.isAInterface(nodeOrEdge)) res.addElement(nodeOrEdge); if (ModelFacade.isAInstance(nodeOrEdge)) res.addElement(nodeOrEdge); if (ModelFacade.isAModel(nodeOrEdge)) res.addElement(nodeOrEdge); return res; } /** * @see org.tigris.gef.graph.BaseGraphModel#getOwner(java.lang.Object) * * Return the node or edge that owns the given port. */ public Object getOwner(Object port) { return port; } /** * @see org.tigris.gef.graph.GraphModel#getInEdges(java.lang.Object) * * Return all edges going to given port (read Model Element). * * Instances can't currently be added to a class diagram. */ public List getInEdges(Object port) { Vector edges = new Vector(); // top of the hierarchy is ME: if (ModelFacade.isAModelElement(port)) { Iterator it = ModelFacade.getSupplierDependencies(port).iterator(); while (it.hasNext()) { edges.add(it.next()); } } // then Generalizable Element if (ModelFacade.isAGeneralizableElement(port)) { Iterator it = ModelFacade.getSpecializations(port).iterator(); while (it.hasNext()) { edges.add(it.next()); } } // then Classifier if (ModelFacade.isAClassifier(port)) { Iterator it = ModelFacade.getAssociationEnds(port).iterator(); while (it.hasNext()) { Object nextAssocEnd = it.next(); // navigable.... only want incoming if (ModelFacade.isNavigable(nextAssocEnd)) { edges.add(nextAssocEnd); } } } return edges; // Vector res = new Vector(); //wasteful! // if (port instanceof MClass) { // MClass cls = (MClass) port; // Collection ends = cls.getAssociationEnds(); // if (ends == null) return res; // empty Vector // //java.util.Enumeration endEnum = ends.elements(); // Iterator iter = ends.iterator(); // while (iter.hasNext()) { // MAssociationEnd ae = (MAssociationEnd) iter.next(); // res.add(ae.getAssociation()); // } // } // if (port instanceof MInterface) { // MInterface Intf = (MInterface) port; // Collection ends = Intf.getAssociationEnds(); // if (ends == null) return res; // empty Vector // Iterator endEnum = ends.iterator(); // while (endEnum.hasNext()) { // MAssociationEnd ae = (MAssociationEnd) endEnum.next(); // res.addElement(ae.getAssociation()); // } // } // if (port instanceof MPackage) { // MPackage cls = (MPackage) port; // Vector ends = cls.getAssociationEnd(); // if (ends == null) return res; // empty Vector // java.util.Enumeration endEnum = ends.elements(); // while (endEnum.hasMoreElements()) { // MAssociationEnd ae = (MAssociationEnd) endEnum.nextElement(); // res.addElement(ae.getAssociation()); // } // } // if (port instanceof MInstance) { // MInstance inst = (MInstance) port; // Collection ends = inst.getLinkEnds(); // res.addAll(ends); // } // return res; } /** * @see org.tigris.gef.graph.GraphModel#getOutEdges(java.lang.Object) * * Return all edges going from given port (model element). */ public List getOutEdges(Object port) { Vector edges = new Vector(); // top of the hierarchy is ME: if (ModelFacade.isAModelElement(port)) { Iterator it = ModelFacade.getClientDependencies(port).iterator(); while (it.hasNext()) { edges.add(it.next()); } } // then Generalizable Element if (ModelFacade.isAGeneralizableElement(port)) { Iterator it = ModelFacade.getGeneralizations(port).iterator(); while (it.hasNext()) { edges.add(it.next()); } } // then Classifier if (ModelFacade.isAClassifier(port)) { Iterator it = ModelFacade.getAssociationEnds(port).iterator(); while (it.hasNext()) { Object nextAssocEnd = ModelFacade.getOppositeEnd(it.next()); // navigable.... only want outgoing if (ModelFacade.isNavigable(nextAssocEnd)) { edges.add(nextAssocEnd); } } } return edges; } /** * @see org.tigris.gef.graph.BaseGraphModel#getSourcePort(java.lang.Object) * * Return one end of an edge. */ public Object getSourcePort(Object edge) { return UmlHelper.getHelper().getSource(edge); } /** * @see org.tigris.gef.graph.BaseGraphModel#getDestPort(java.lang.Object) * * Return the other end of an edge. */ public Object getDestPort(Object edge) { return UmlHelper.getHelper().getDestination(edge); } //////////////////////////////////////////////////////////////// // MutableGraphModel implementation /** * @see org.tigris.gef.graph.MutableGraphModel#canAddNode(java.lang.Object) * * Return true if the given object is a valid node in this graph. */ public boolean canAddNode(Object node) { if (super.canAddNode(node) && !containsNode(node)) { return true; } if (containsNode(node)) { return false; } // TODO: This logic may well be worth moving into the model component. // Provide a similar grid to the connectionsGrid return ModelFacade.isAClass(node) || ModelFacade.isAInterface(node) || ModelFacade.isAModel(node) || ModelFacade.isAPackage(node) || ModelFacade.isAInstance(node); } /** * @see org.tigris.gef.graph.MutableGraphModel#canAddEdge(java.lang.Object) * * Return true if the given object is a valid edge in this graph. */ public boolean canAddEdge(Object edge) { if (edge == null) { return false; } if (containsEdge(edge)) { return false; } Object end0 = null, end1 = null; if (ModelFacade.isAAssociation(edge)) { Collection conns = ModelFacade.getConnections(edge); if (conns.size() < 2) { return false; } Iterator iter = conns.iterator(); Object associationEnd0 = iter.next(); Object associationEnd1 = iter.next(); if (associationEnd0 == null || associationEnd1 == null) { return false; } end0 = ModelFacade.getType(associationEnd0); end1 = ModelFacade.getType(associationEnd1); } else if (ModelFacade.isAGeneralization(edge)) { end0 = ModelFacade.getChild(edge); end1 = ModelFacade.getParent(edge); } else if (ModelFacade.isADependency(edge)) { Collection clients = ModelFacade.getClients(edge); Collection suppliers = ModelFacade.getSuppliers(edge); if (clients == null || suppliers == null) { return false; } end0 = clients.iterator().next(); end1 = suppliers.iterator().next(); } else if (ModelFacade.isALink(edge)) { Collection roles = ModelFacade.getConnections(edge); if (roles.size() < 2) { return false; } Iterator iter = roles.iterator(); Object linkEnd0 = iter.next(); Object linkEnd1 = iter.next(); if (linkEnd0 == null || linkEnd1 == null) { return false; } end0 = ModelFacade.getInstance(linkEnd0); end1 = ModelFacade.getInstance(linkEnd1); } else if (edge instanceof CommentEdge) { end0 = ((CommentEdge) edge).getSource(); end1 = ((CommentEdge) edge).getDestination(); } if (end0 == null || end1 == null) { return false; } if (!containsNode(end0)) { return false; } if (!containsNode(end1)) { return false; } return true; } /** * @see org.tigris.gef.graph.MutableGraphModel#addNode(java.lang.Object) * * Add the given node to the graph, if valid. */ public void addNode(Object node) { LOG.debug("adding class node!!"); if (!canAddNode(node)) return; getNodes().add(node); if (ModelFacade.isAModelElement(node) && ModelFacade.getNamespace(node) == null) { ModelFacade.addOwnedElement(model, node); } fireNodeAdded(node); LOG.debug("adding " + node + " OK"); } /** * Add the given edge to the graph, if of the correct type. * Throws IllegalArgumentException if edge is null or either of its * ends are null. * * @see org.tigris.gef.graph.MutableGraphModel#addEdge(java.lang.Object) */ public void addEdge(Object edge) { if (edge == null) { throw new IllegalArgumentException("Cannot add a null edge"); } if (getDestPort(edge) == null || getSourcePort(edge) == null) { throw new IllegalArgumentException( "The source and dest port should be provided on an edge"); } if (LOG.isInfoEnabled()) { LOG.info("Adding an edge of type " + edge.getClass().getName() + " to class diagram."); } if (!canAddEdge(edge)) { LOG.info("Attempt to add edge rejected"); return; } getEdges().add(edge); // TODO: assumes public if (ModelFacade.isAModelElement(edge) && ModelFacade.getNamespace(edge) == null) { ModelFacade.addOwnedElement(model, edge); } fireEdgeAdded(edge); } /** * Adds the edges from the given node. For example, this method lets you add * an allready existing massociation between two figclassifiers. * @see org.tigris.gef.graph.MutableGraphModel#addNodeRelatedEdges(Object) */ public void addNodeRelatedEdges(Object node) { if (ModelFacade.isAClassifier(node) ) { Collection ends = ModelFacade.getAssociationEnds(node); Iterator iter = ends.iterator(); while (iter.hasNext()) { Object associationEnd = iter.next(); if (canAddEdge(ModelFacade.getAssociation(associationEnd))) { addEdge(ModelFacade.getAssociation(associationEnd)); } } } if (ModelFacade.isAGeneralizableElement(node) ) { Collection generalizations = ModelFacade.getGeneralizations(node); Iterator iter = generalizations.iterator(); while (iter.hasNext()) { Object generalization = iter.next(); if (canAddEdge(generalization)) { addEdge(generalization); // return; } } Collection specializations = ModelFacade.getSpecializations(node); iter = specializations.iterator(); while (iter.hasNext()) { Object specialization = iter.next(); if (canAddEdge(specialization)) { addEdge(specialization); // return; } } } if (ModelFacade.isAModelElement(node) ) { Vector specs = new Vector(ModelFacade.getClientDependencies(node)); specs.addAll(ModelFacade.getSupplierDependencies(node)); Iterator iter = specs.iterator(); while (iter.hasNext()) { Object dependency = iter.next(); if (canAddEdge(dependency)) { addEdge(dependency); // return; } } } } //////////////////////////////////////////////////////////////// // VetoableChangeListener implementation /** * @see java.beans.VetoableChangeListener#vetoableChange(java.beans.PropertyChangeEvent) */ public void vetoableChange(PropertyChangeEvent pce) { //throws PropertyVetoException if ("ownedElement".equals(pce.getPropertyName())) { Vector oldOwned = (Vector) pce.getOldValue(); Object elementImport = /*(MElementImport)*/ pce.getNewValue(); Object modelElement = ModelFacade.getModelElement(elementImport); //MModelElement modelElement = elementImport.getModelElement(); if (oldOwned.contains(elementImport)) { LOG.debug("model removed " + modelElement); if (ModelFacade.isAClassifier(modelElement)) { removeNode(modelElement); } if (ModelFacade.isAPackage(modelElement)) { removeNode(modelElement); } if (ModelFacade.isAAssociation(modelElement)) { removeEdge(modelElement); } if (ModelFacade.isADependency(modelElement)) { removeEdge(modelElement); } if (ModelFacade.isAGeneralization(modelElement)) { removeEdge(modelElement); } } else { LOG.debug("model added " + modelElement); } } } static final long serialVersionUID = -2638688086415040146L; /** * When rerouting an edge, this is the first method to * be called by SelectionRerouteEdge, in order to determine * whether the graphmodel will allow the change. * * |
... this post is sponsored by my books ... | |
![]() #1 New Release! |
![]() FP Best Seller |
Copyright 1998-2024 Alvin Alexander, alvinalexander.com
All Rights Reserved.
A percentage of advertising revenue from
pages under the /java/jwarehouse
URI on this website is
paid back to open source projects.