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
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
|
package org.testng.internal;
import org.testng.collections.ListMultiMap;
import org.testng.collections.Lists;
import org.testng.collections.Maps;
import org.testng.collections.Sets;
import java.util.Collection;
import java.util.Collections;
import java.util.Comparator;
import java.util.List;
import java.util.Map;
import java.util.Set;
/**
* Representation of the graph of methods.
*/
public class DynamicGraph<T> {
private static final boolean DEBUG = false;
private List<T> m_nodesReady = Lists.newArrayList();
private List<T> m_nodesRunning = Lists.newArrayList();
private List<T> m_nodesFinished = Lists.newArrayList();
private Comparator<? super T> m_nodeComparator = null;
private ListMultiMap<T, T> m_dependedUpon = Maps.newListMultiMap();
private ListMultiMap<T, T> m_dependingOn = Maps.newListMultiMap();
public static enum Status {
READY, RUNNING, FINISHED
}
/**
* Define a comparator for the nodes of this graph, which will be used
* to order the free nodes when they are asked.
*/
public void setComparator(Comparator<? super T> c) {
m_nodeComparator = c;
}
/**
* Add a node to the graph.
*/
public void addNode(T node) {
m_nodesReady.add(node);
}
/**
* Add an edge between two nodes.
*/
public void addEdge(T from, T to) {
m_dependingOn.put(to, from);
m_dependedUpon.put(from, to);
}
/**
* @return a set of all the nodes that don't depend on any other nodes.
*/
public List<T> getFreeNodes() {
List<T> result = Lists.newArrayList();
for (T m : m_nodesReady) {
// A node is free if...
List<T> du = m_dependedUpon.get(m);
// - no other nodes depend on it
if (!m_dependedUpon.containsKey(m)) {
result.add(m);
} else if (getUnfinishedNodes(du).size() == 0) {
result.add(m);
}
}
// Sort the free nodes if requested (e.g. priorities)
if (result != null && ! result.isEmpty()) {
if (m_nodeComparator != null) {
Collections.sort(result, m_nodeComparator);
ppp("Nodes after sorting:" + result.get(0));
}
}
return result;
}
/**
* @return a list of all the nodes that have a status other than FINISHED.
*/
private Collection<? extends T> getUnfinishedNodes(List<T> nodes) {
Set<T> result = Sets.newHashSet();
for (T node : nodes) {
if (m_nodesReady.contains(node) || m_nodesRunning.contains(node)) {
result.add(node);
}
}
return result;
}
/**
* Set the status for a set of nodes.
*/
public void setStatus(Collection<T> nodes, Status status) {
for (T n : nodes) {
setStatus(n, status);
}
}
/**
* Set the status for a node.
*/
public void setStatus(T node, Status status) {
removeNode(node);
switch(status) {
case READY: m_nodesReady.add(node); break;
case RUNNING: m_nodesRunning.add(node); break;
case FINISHED: m_nodesFinished.add(node); break;
default: throw new IllegalArgumentException();
}
}
private void removeNode(T node) {
if (!m_nodesReady.remove(node)) {
if (!m_nodesRunning.remove(node)) {
m_nodesFinished.remove(node);
}
}
}
/**
* @return the number of nodes in this graph.
*/
public int getNodeCount() {
int result = m_nodesReady.size() + m_nodesRunning.size() + m_nodesFinished.size();
return result;
}
public int getNodeCountWithStatus(Status status) {
switch(status) {
case READY: return m_nodesReady.size();
case RUNNING: return m_nodesRunning.size();
case FINISHED: return m_nodesFinished.size();
default: throw new IllegalArgumentException();
}
}
private static void ppp(String string) {
if (DEBUG) {
System.out.println(" [GroupThreadPoolExecutor] " + Thread.currentThread().getId() + " "
+ string);
}
}
@Override
public String toString() {
StringBuilder result = new StringBuilder("[DynamicGraph ");
result.append("\n Ready:" + m_nodesReady);
result.append("\n Running:" + m_nodesRunning);
result.append("\n Finished:" + m_nodesFinished);
result.append("\n Edges:\n");
for (Map.Entry<T, List<T>> es : m_dependingOn.entrySet()) {
result.append(" " + es.getKey() + "\n");
for (T t : es.getValue()) {
result.append(" " + t + "\n");
}
}
result.append("]");
return result.toString();
}
private String getName(T t) {
String s = t.toString();
int n1 = s.lastIndexOf('.') + 1;
int n2 = s.indexOf('(');
return s.substring(n1, n2);
}
/**
* @return a .dot file (GraphViz) version of this graph.
*/
public String toDot() {
String FREE = "[style=filled color=yellow]";
String RUNNING = "[style=filled color=green]";
String FINISHED = "[style=filled color=grey]";
StringBuilder result = new StringBuilder("digraph g {\n");
List<T> freeNodes = getFreeNodes();
String color;
for (T n : m_nodesReady) {
color = freeNodes.contains(n) ? FREE : "";
result.append(" " + getName(n) + color + "\n");
}
for (T n : m_nodesRunning) {
color = freeNodes.contains(n) ? FREE : RUNNING;
result.append(" " + getName(n) + color + "\n");
}
for (T n : m_nodesFinished) {
result.append(" " + getName(n) + FINISHED+ "\n");
}
result.append("\n");
for (T k : m_dependingOn.keySet()) {
List<T> nodes = m_dependingOn.get(k);
for (T n : nodes) {
String dotted = m_nodesFinished.contains(k) ? "style=dotted" : "";
result.append(" " + getName(k) + " -> " + getName(n) + " [dir=back " + dotted + "]\n");
}
}
result.append("}\n");
return result.toString();
}
public ListMultiMap<T, T> getEdges() {
return m_dependingOn;
}
}
|
