blob: bee97c5688291b2e94157aee0febd48c37689cc1 (
plain)
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
|
package com.c2kernel.lifecycle;
import com.c2kernel.graph.model.Vertex;
import com.c2kernel.graph.traversal.GraphTraversal;
import com.c2kernel.lifecycle.instance.Loop;
import com.c2kernel.lifecycle.instance.WfVertex;
/**
* @version $Revision: 1.19 $ $Date: 2005/09/29 10:18:31 $
* @author $Author: abranson $
*/
public class LoopDef extends XOrSplitDef
{
public boolean hasLoop = false;
public int isNext = 0;
/**
* @see java.lang.Object#Object()
*/
public LoopDef()
{
super();
}
/**
* @see com.c2kernel.lifecycle.WfVertexDef#loop()
*/
public boolean loop()
{
return true;
}
/**
* @see com.c2kernel.lifecycle.WfVertexDef#verify()
*/
public boolean verify()
{
if (!super.verify()) return false;
Vertex[] nexts = getOutGraphables();
Vertex[] anteVertices =
GraphTraversal.getTraversal(this.getParent().getChildrenGraphModel(), this, GraphTraversal.kUp, false);
int k = 0;
int l = 0;
Vertex[] brothers = getParent().getChildren();
for (int i = 0; i < brothers.length; i++)
if (brothers[i] instanceof LoopDef) l++;
for (int i = 0; i < nexts.length; i++)
for (int j = 0; j < anteVertices.length; j++)
if (nexts[i].equals(anteVertices[j]))
k++;
if (k != 1 && !(l>1))
{
mErrors.add("bad number of pointing back nexts");
return false;
}
// if (nexts.length>2) {
// mErrors.add("you must only have 2 nexts");
// return false;
// }
return true;
}
public boolean isLoop() {
return true;
}
public WfVertex instantiate() {
Loop newLoop = new Loop();
configureInstance(newLoop);
return newLoop;
}
}
|
