|
What this is
Other links
The source code// $Id: ClassdiagramInheritanceEdge.java,v 1.9 2004/09/29 18:46:28 mvw Exp $ // Copyright (c) 1996-2001 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. package org.argouml.uml.diagram.static_structure.layout; import org.apache.log4j.Logger; import org.tigris.gef.presentation.Fig; import org.tigris.gef.presentation.FigEdge; /** * * @author mkl */ public abstract class ClassdiagramInheritanceEdge extends ClassdiagramEdge { private static final Logger LOG = Logger.getLogger(ClassdiagramInheritanceEdge.class); private Fig high, low; /** * Constructor. * * @param edge the fig edge */ public ClassdiagramInheritanceEdge(FigEdge edge) { super(edge); // calculate the higher and lower Figs LOG.debug("sourceFigNode: " + getSourceFigNode().classNameAndBounds()); LOG.debug("destFigNode: " + getDestFigNode().classNameAndBounds()); if (getSourceFigNode().getLocation().getY() <= getDestFigNode().getLocation().getY()) { high = getDestFigNode(); low = getSourceFigNode(); LOG.debug("high is sourcenode, " + "is low destnode"); } else { high = getDestFigNode(); low = getSourceFigNode(); LOG.debug("high is destnode, " + "low is sourcenode"); } LOG.debug("High: " + high.classNameAndBounds()); LOG.debug("Low : " + low.classNameAndBounds()); } /** * @return the vertical offset */ public abstract int getVerticalOffset(); /** * @return the center of the high node */ public int getCenterHigh() { return (int) (high.getLocation().getX() + high.getSize().getWidth() / 2); } /** * @return the center of the low node */ public int getCenterLow() { return (int) (low.getLocation().getX() + low.getSize().getWidth() / 2); } public int getDownGap() { return (int) (low.getLocation().getY() - getVerticalOffset()); } /** * @see org.argouml.uml.diagram.layout.LayoutedEdge#layout() * * Layout the edges in a way that they form a nice inheritance tree. * Try to implement these nice zigzag lines between classes and * works well when the row difference is one. * * @author Markus Klink * @since 0.9.6 */ public void layout() { LOG.debug("underlyingFig: " + getUnderlyingFig().classNameAndBounds()); // now we construct the zig zag inheritance line int centerHigh = getCenterHigh(); int centerLow = getCenterLow(); LOG.debug("centerHigh: " + centerHigh + " centerLow: " + centerLow + " downGap: " + getDownGap()); // the amount of the "sidestep" int difference = centerHigh - centerLow; getUnderlyingFig().addPoint(centerLow, (int) (low.getLocation().getY())); LOG.debug("Point: x: " + centerLow + " y: " + (int) (low.getLocation().getY())); // if the Figs are directly under each other we // do not need to add these points if (difference != 0) { getUnderlyingFig().addPoint(centerHigh - difference, getDownGap()); LOG.debug("Point: x: " + (centerHigh - difference) + " y: " + getDownGap()); getUnderlyingFig().addPoint(centerHigh, getDownGap()); LOG.debug("Point: x: " + centerHigh + " y: " + getDownGap()); } getUnderlyingFig().addPoint(centerHigh, (int) (high.getLocation().getY() + high.getSize().getHeight())); LOG.debug("Point x: " + centerHigh + " y: " + (int) (high.getLocation().getY() + high.getSize().getHeight())); getUnderlyingFig().setFilled(false); getCurrentEdge().setFig(getUnderlyingFig()); // currentEdge.setBetweenNearestPoints(false); } } |
... 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.