blob: 66921636ddd2870e9f6632be7eda3613ef272018 (
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
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
104
105
106
107
108
109
110
111
|
package com.c2kernel.lifecycle;
import java.util.Vector;
import com.c2kernel.graph.model.Vertex;
import com.c2kernel.graph.traversal.GraphTraversal;
import com.c2kernel.lifecycle.instance.AndSplit;
import com.c2kernel.lifecycle.instance.WfVertex;
/**
* @version $Revision: 1.19 $ $Date: 2005/09/29 10:18:31 $
* @author $Author: abranson $
*/
public class AndSplitDef extends WfVertexDef
{
/**
* @see java.lang.Object#Object()
*/
public AndSplitDef()
{
mErrors = new Vector(0, 1);
getProperties().put("RoutingScriptName", "");
getProperties().put("RoutingScriptVersion", "");
}
/**
* @see com.c2kernel.lifecycle.WfVertexDef#verify()
*/
public boolean verify()
{
mErrors.removeAllElements();
boolean err = true;
int nbInEdges = getInEdges().length;
if (nbInEdges == 0 && this.getID() != getParent().getChildrenGraphModel().getStartVertexId())
{
mErrors.add("Unreachable");
err = false;
}
else if (nbInEdges > 1)
{
mErrors.add("Bad nb of previous");
err = false;
}
else
{
if (getOutEdges().length <= 1)
{
mErrors.add("not enough next");
err = false;
}
else if (!(this instanceof LoopDef))
{
Vertex[] outV = getOutGraphables();
Vertex[] anteVertices =
GraphTraversal.getTraversal(getParent().getChildrenGraphModel(), this, GraphTraversal.kUp, false);
boolean loop = false;
boolean errInLoop = true;
for (int i = 0; i < outV.length; i++)
{
for (int j = 0; j < anteVertices.length; j++)
if (!loop && outV[i].getID() == anteVertices[j].getID())
{
if (outV[i] instanceof LoopDef)
{
loop = true;
j = anteVertices.length;
i = outV.length;
}
else
{
errInLoop = false;
}
}
}
if (errInLoop && loop)
{
mErrors.add("Problem in Loop");
err = false;
}
}
}
return err;
}
public boolean loop()
{
boolean loop2 = false;
if (!loopTested)
{
loopTested = true;
if (getOutGraphables().length != 0)
{
Vertex[] outVertices = getOutGraphables();
for (int i = 0; i < outVertices.length; i++)
{
WfVertexDef tmp = (WfVertexDef) getOutGraphables()[i];
loop2 = loop2 || tmp.loop();
}
}
}
loopTested = false;
return loop2;
}
public WfVertex instantiate() {
AndSplit newSplit = new AndSplit();
configureInstance(newSplit);
return newSplit;
}
}
|
