1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
|
/**
* This file is part of the CRISTAL-iSE kernel.
* Copyright (c) 2001-2014 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 com.c2kernel.lifecycle.instance;
import com.c2kernel.graph.model.GraphPoint;
import com.c2kernel.graph.model.GraphableEdge;
/**
* @version $Revision: 1.58 $ $Date: 2005/05/10 15:14:54 $
* @author $Author: abranson $
*/
/** this class represents the link between 2 successive activities */
public class Next extends GraphableEdge
{
/**
* @see java.lang.Object#Object()
*/
public Next()
{
super();
}
/**
* Method Next.
* @param pre
* @param nex
*/
/** create and initialize a link between an Activities */
public Next(WfVertex pre, WfVertex nex)
{
super(pre, nex);
getProperties().put("Alias","");
getProperties().put("Type","Straight");
}
/**
* Method verify.
* @return boolean
*/
public boolean verify()
{
return true;
}
public WfVertex getTerminusVertex()
{
return (WfVertex)((CompositeActivity)getParent()).getWf().search(getParent().getPath()+"/"+this.getTerminusVertexId());
}
@Override
public boolean containsPoint(GraphPoint p)
{
GraphPoint originPoint = getOriginPoint();
GraphPoint terminusPoint = getTerminusPoint();
GraphPoint midPoint = new GraphPoint();
if (("Broken +".equals(getProperties().get("Type"))))
{
midPoint.x = (originPoint.x + terminusPoint.x) / 2;
midPoint.y = (originPoint.y + terminusPoint.y) / 2;
}
else if (("Broken -".equals(getProperties().get("Type"))))
{
boolean arrowOnY = !(originPoint.y - terminusPoint.y < 60 && originPoint.y - terminusPoint.y > -60);
midPoint.x = arrowOnY ? terminusPoint.x : (originPoint.x + terminusPoint.x) / 2;
midPoint.y = arrowOnY ? (originPoint.y + terminusPoint.y) / 2 : originPoint.y;
}
else if (("Broken |".equals(getProperties().get("Type"))))
{
boolean arrowOnY = !(originPoint.y - terminusPoint.y < 60 && originPoint.y - terminusPoint.y > -60);
midPoint.x = arrowOnY ? originPoint.x : (originPoint.x + terminusPoint.x) / 2;
midPoint.y = arrowOnY ? (originPoint.y + terminusPoint.y) / 2 : terminusPoint.y;
}
else
{
midPoint.x = originPoint.x + (terminusPoint.x - originPoint.x) / 2;
midPoint.y = originPoint.y + (terminusPoint.y - originPoint.y) / 2;
}
int minX = midPoint.x - 10;
int minY = midPoint.y - 10;
int maxX = midPoint.x + 10;
int maxY = midPoint.y + 10;
return (p.x >= minX) && (p.x <= maxX) && (p.y >= minY) && (p.y <= maxY);
}
}
|
