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
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
|
/**
* 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.common.InvalidDataException;
import com.c2kernel.graph.model.Vertex;
import com.c2kernel.graph.traversal.GraphTraversal;
import com.c2kernel.lookup.AgentPath;
import com.c2kernel.lookup.ItemPath;
import com.c2kernel.utils.Logger;
/**
* @version $Revision: 1.35 $ $Date: 2005/05/10 15:14:54 $
* @author $Author: abranson $
*/
public class Loop extends XOrSplit
{
/**
* @see java.lang.Object#Object()
*/
public Loop()
{
super();
}
/**
* @see com.c2kernel.lifecycle.instance.WfVertex#loop()
*/
@Override
public boolean loop()
{
return true;
}
@Override
public void followNext(Next activeNext, AgentPath agent, ItemPath itemPath) throws InvalidDataException
{
WfVertex v = activeNext.getTerminusVertex();
if (!isInPrev(v))
v.run(agent, itemPath);
else
{
v.reinit(getID());
v.run(agent, itemPath);
}
}
/**
* @throws InvalidDataException
* @see com.c2kernel.lifecycle.instance.WfVertex#reinit(int)
*/
@Override
public void reinit(int idLoop) throws InvalidDataException
{
Logger.msg(8, "Loop.reinit");
if (idLoop == getID())
return;
else
{
Vertex[] outVertices = getOutGraphables();
for (int j = 0; j < outVertices.length; j++)
{
if (!isInPrev(outVertices[j]))
((WfVertex) outVertices[j]).reinit(idLoop);
}
}
}
/**
* @see com.c2kernel.lifecycle.instance.WfVertex#verify()
*/
@Override
public boolean verify()
{
boolean err = super.verify();
Vertex[] nexts = getOutGraphables();
Vertex[] anteVertices = GraphTraversal.getTraversal(getParent().getChildrenGraphModel(), this, GraphTraversal.kUp, false);
int k = 0;
int l = 0;
Vertex[] brothers = getParent().getChildren();
for (Vertex brother : brothers)
if (brother instanceof Loop)
l++;
for (Vertex next : nexts) {
for (Vertex anteVertice : anteVertices)
if (next.getID() == anteVertice.getID())
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 err;
}
private boolean isInPrev(Vertex vertex)
{
int id = vertex.getID();
Vertex[] anteVertices = GraphTraversal.getTraversal(getParent().getChildrenGraphModel(), this, GraphTraversal.kUp, false);
for (Vertex anteVertice : anteVertices) {
if (anteVertice.getID() == id)
{
return true;
}
}
return false;
}
@Override
public boolean isLoop()
{
return true;
}
}
|
