commonsrc.ingenias.editor.events.LocationChange Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of core Show documentation
Show all versions of core Show documentation
The INGENIAS Meta-Editor core. It is a set of facilities to generate an editor from a detailed xml description
/**
* Copyright (C) 2010 Jorge J. Gomez-Sanz
*
* This file is part of the INGENME tool. INGENME is an open source meta-editor
* which produces customized editors for user-defined modeling languages
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation version 3 of the License
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
* You should have received a copy of the GNU General Public License
* along with this program. If not, see points) {
Iterator it = points.iterator();
// First a generic central point is computed
double x = 0;
double y = 0;
while (it.hasNext()) {
Rectangle point = it.next();
x = (x + point.getCenterX());
y = (y + point.getCenterY());
}
if (points.size()==0)
return new Point(0,0);
double x2 = x / points.size();
double y2= y / points.size();
// this center point is not enough good. When A connects with B and they have dispare sizes,
// the center point tends to be very close to B. To compesate, it is better to recompute the
// center using a point in the perimeter of B and A.
// Next, the position is recomputed taking into account
// the size of the elements.
it = points.iterator();
double ncenterX=0;
double ncenterY=0;
double m=0;
double n=0;
double x3=0;
double y3=0;
while (it.hasNext()) {
Rectangle point = it.next();
double x1=point.getCenterX();
double y1=point.getCenterY();
double maxdistance=distance(x1,y1,point.getMinX(),point.getMinY())+10;
if (Math.abs(x2-x1)>20){
m=(y2-y1)/(x2-x1);
n=y2-((y2-y1)/(x2-x1))*x2;
double y3min=m*point.getMinX()+n;
double y3max=m*point.getMaxX()+n;
double distancey3min=distance(x1,y1,point.getMinX(),y3min);
double distancey3max=distance(x1,y1,point.getMaxX(),y3max);
if (Math.min(distancey3min,distancey3max )x1)
x3=point.getMaxX();
else
x3=point.getMinX();
y3=y2;
} else {
double x3min=(point.getMinY()-n)/m;
double x3max=(point.getMaxY()-n)/m;
double distancex3min=distance(x1,y1,x3min,point.getMinY());
double distancex3max=distance(x1,y1,x3max,point.getMaxY());
if (distancex3miny1)
y3=point.getMaxY();
else
y3=point.getMinY();
x3=x2;
}
ncenterX=ncenterX+x3;
ncenterY=ncenterY+y3;
}
return new Point((int)(ncenterX/points.size()),(int)(ncenterY/points.size()));
}
private static double distance(double x1, double y1, double minX, double y3min
) {
// TODO Auto-generated method stub
return Math.sqrt((x1-minX)*(x1-minX)+(y1-y3min)*(y1-y3min));
}
public static void centerNAryEdge(JGraph mjg, ingenias.editor.Model m,
Hashtable changes, NAryEdge nary) {
if (NAryEdge.class.isAssignableFrom(nary.getClass())){
Iterator nedges = m.getEdges(m, new Object[] { nary }).iterator();
Vector points = new Vector();
// First a gross estimation of the middle point is obtained
while (nedges.hasNext()) {
DefaultEdge edgeline = (DefaultEdge) nedges.next();
DefaultGraphCell extreme = getCellExtreme(edgeline, m);
if (GraphConstants.getBounds(m.getAttributes(extreme)) != null) {
Rectangle rect = GraphConstants.getBounds(
m.getAttributes(extreme)).getBounds().getBounds();
points.add(rect);
}
}
Point p = getCenter(points);
nedges = m.getEdges(m, new Object[] { nary }).iterator();
points.clear();
// Gross estimation is recomputed using the perimeter intersection
// between
// bounds on vertexes and the gross estimation middle point
/* while (nedges.hasNext()) {
DefaultEdge edgeline = (DefaultEdge) nedges.next();
EdgeView ev = (EdgeView) mjg.getGraphLayoutCache().getMapping(
edgeline, false);
DefaultGraphCell extreme = getCellExtreme(edgeline, m);
VertexView extremeView = (VertexView) mjg.getGraphLayoutCache()
.getMapping(extreme, false);
if (GraphConstants.getBounds(m.getAttributes(extreme)) != null && extremeView!=null) {
Rectangle rect = GraphConstants.getBounds(
m.getAttributes(extreme)).getBounds().getBounds();
if (rect!=null){
Point2D p2d = extremeView.getPerimeterPoint(ev, new Point(
(int) rect.getCenterX(), (int) rect.getCenterY()), p);
points.add(new java.awt.Point((int) p2d.getX(), (int) p2d
.getY()));
System.err.println("agregando2 "+points+":"+rect+":"+p);
}
}
}
p = getCenter(points);*/
Map edgem =null;
if (changes.containsKey(nary))
edgem=(Map) changes.get(nary);
else
edgem = m.getAttributes(nary);
Rectangle boundsEdge = GraphConstants.getBounds(edgem).getBounds();
p.x = p.x - boundsEdge.width / 2;
p.y = p.y - boundsEdge.height / 2;
boundsEdge.setLocation(p);
GraphConstants.setBounds(edgem, boundsEdge);
changes.put(nary, edgem);
}
}
}