All Downloads are FREE. Search and download functionalities are using the official Maven repository.
  • Log In
  • Register

    • org.cristalise.kernel.graph.model.Vertex Maven / Gradle / Ivy

    Go to download

    Cristal-ise is a description-driven software platform originally developed to track the construction of the CMS ECAL detector of the LHC at CERN. This is its core library, known as the kernel, which manages business objects called Items. Items are entirely configured from data, called descriptions, held in other Items. Every change of a state in an Item is a consequence of an execution of an activity in that Item's lifecycle, meaning that Cristal-ise applications are completely traceable, even in their design. It also supports extensive versioning of Item description data, giving the system a high level of flexibility.

    There is a newer version: 6.0.0
    Show newest version
    /**
 * This file is part of the CRISTAL-iSE kernel.
 * Copyright (c) 2001-2015 The CRISTAL Consortium. All rights reserved.
 *
 * This library is free software; you can redistribute it and/or modify it
 * under the terms of the GNU Lesser General Public License as published
 * by the Free Software Foundation; either version 3 of the License, or (at
 * your option) any later version.
 *
 * This library is distributed in the hope that it will be useful, but WITHOUT
 * ANY WARRANTY; with out even the implied warranty of MERCHANTABILITY or
 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public
 * License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public License
 * along with this library; if not, write to the Free Software Foundation,
 * Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA.
 *
 * http://www.fsf.org/licensing/licenses/lgpl.html
 */
package org.cristalise.kernel.graph.model;

import java.awt.Polygon;
import java.util.Vector;

import lombok.Getter;
import lombok.Setter;
import lombok.experimental.Accessors;

@Accessors(prefix = "m") @Getter @Setter
public class Vertex {
    private int                   mID              = -1;
    private String                mName            = "";
    private GraphPoint            mCentrePoint     = new GraphPoint(0, 0);
    private int                   mHeight          = 0;
    private int                   mWidth           = 0;
    private Vector       mInEdgeIdVector  = new Vector();
    private Vector       mOutEdgeIdVector = new Vector();
    private final Vector  mTags            = new Vector();

    /**
     * The Java Polygon class is used to determine if a point lies within the outline of a vertex.
     * Unfortunately both the polygon and the set of outline points need to kept in memory because 
     * a polygon never has 0 points which is required by Castor's unmarshall object mechanism
     */
    private Polygon      mOutlinePolygon  = new Polygon();
    private GraphPoint[] mOutlinePoints   = new GraphPoint[0];

    /**
     * Sets the outline points and re-calculates the height and width
     * 
     * @param outline the Outline coordinates
     */
    public void setOutlinePoints(GraphPoint[] outline) {
        int topLeftX     = outline[0].x;
        int topLeftY     = outline[0].y;
        int bottomRightX = 0;
        int bottomRightY = 0;

        mOutlinePoints = outline;

        // Construct a polygon in the outline of the vertex and calculate the top left and bottom right corners
        mOutlinePolygon = new Polygon();

        for(int i=0; i < outline.length; i++) {
            mOutlinePolygon.addPoint(outline[i].x, outline[i].y);

            if(outline[i].x < topLeftX)      topLeftX = outline[i].x;
            if(outline[i].y < topLeftY)      topLeftY = outline[i].y;
            if(outline[i].x > bottomRightX)  bottomRightX = outline[i].x;
            if(outline[i].y > bottomRightY)  bottomRightY = outline[i].y;
        }

        // Set the height and width
        mHeight = bottomRightY - topLeftY;
        mWidth  = bottomRightX - topLeftX;
    }

    public void moveAbsolute(GraphPoint p) {
        int deltaX = p.x - mCentrePoint.x;
        int deltaY = p.y - mCentrePoint.y;
        int i      = 0;

        // Update the outline points and the polygon
        for(i=0; i(10, 10);

        for(int i=0; i < ids.length; i++) mInEdgeIdVector.add(Integer.valueOf(ids[i]));
    }

    public int[] getInEdgeIds() {
        return integerVectorToIntArray(mInEdgeIdVector);
    }

    public void setOutEdgeIds(int[] ids) {
        mOutEdgeIdVector = new Vector(10, 10);

        for(int i=0; i < ids.length; i++) mOutEdgeIdVector.add(Integer.valueOf(ids[i]));
    }

    public int[] getOutEdgeIds() {
        return integerVectorToIntArray(mOutEdgeIdVector);
    }

    private static int[] integerVectorToIntArray(Vector vector) {
        int[]   array   = new int[vector.size()];
        Integer integer = null;

        for(int i=0; i    
    
    
    

    




    
    
    © 2015 - 2025 Weber Informatics LLC | Privacy Policy