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
|
//
// ========================================================================
// Copyright (c) 1995-2013 Mort Bay Consulting Pty. Ltd.
// ------------------------------------------------------------------------
// All rights reserved. This program and the accompanying materials
// are made available under the terms of the Eclipse Public License v1.0
// and Apache License v2.0 which accompanies this distribution.
//
// The Eclipse Public License is available at
// http://www.eclipse.org/legal/epl-v10.html
//
// The Apache License v2.0 is available at
// http://www.opensource.org/licenses/apache2.0.php
//
// You may elect to redistribute this code under either of these licenses.
// ========================================================================
//
package org.eclipse.jetty.deploy.graph;
import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.text.CollationKey;
import java.text.Collator;
import java.util.Comparator;
import java.util.Set;
import java.util.TreeSet;
import org.eclipse.jetty.util.IO;
/**
* Output the Graph in GraphViz Dot format.
*/
public class GraphOutputDot
{
private GraphOutputDot()
{
}
private static final String TOPNODE = "undeployed";
/**
* Comparator that makes the 'undeployed' node the first node in the sort list.
*
* This makes the 'undeployed' node show up at the top of the generated graph.
*/
private static class TopNodeSort implements Comparator<Node>
{
private Collator collator = Collator.getInstance();
public int compare(Node o1, Node o2)
{
if (o1.getName().equals(TOPNODE))
{
return -1;
}
if (o2.getName().equals(TOPNODE))
{
return 1;
}
CollationKey key1 = toKey(o1);
CollationKey key2 = toKey(o2);
return key1.compareTo(key2);
}
private CollationKey toKey(Node node)
{
return collator.getCollationKey(node.getName());
}
}
public static void write(Graph graph, File outputFile) throws IOException
{
FileWriter writer = null;
PrintWriter out = null;
try
{
writer = new FileWriter(outputFile);
out = new PrintWriter(writer);
out.println("// Autogenerated by " + GraphOutputDot.class.getName());
out.println("digraph Graf {");
writeGraphDefaults(out);
writeNodeDefaults(out);
writeEdgeDefaults(out);
Set<Node> nodes = new TreeSet<Node>(new TopNodeSort());
nodes.addAll(graph.getNodes());
for (Node node : nodes)
{
writeNode(out,node);
}
for (Edge edge : graph.getEdges())
{
writeEdge(out,edge);
}
out.println("}");
}
finally
{
IO.close(out);
IO.close(writer);
}
}
private static void writeEdge(PrintWriter out, Edge edge)
{
out.println();
out.println(" // Edge");
out.printf(" \"%s\" -> \"%s\" [%n",toId(edge.getFrom()),toId(edge.getTo()));
out.println(" arrowtail=none,");
out.println(" arrowhead=normal");
out.println(" ];");
}
private static void writeNode(PrintWriter out, Node node)
{
out.println();
out.println(" // Node");
out.printf(" \"%s\" [%n",toId(node));
out.printf(" label=\"%s\",%n",node.getName());
if (node.getName().endsWith("ed"))
{
out.println(" color=\"#ddddff\",");
out.println(" style=filled,");
}
out.println(" shape=box");
out.println(" ];");
}
private static CharSequence toId(Node node)
{
StringBuilder buf = new StringBuilder();
for (char c : node.getName().toCharArray())
{
if (Character.isLetter(c))
{
buf.append(c);
continue;
}
if (Character.isDigit(c))
{
buf.append(c);
continue;
}
if ((c == ' ') || (c == '-') || (c == '_'))
{
buf.append(c);
continue;
}
}
return buf;
}
private static void writeEdgeDefaults(PrintWriter out)
{
out.println();
out.println(" // Edge Defaults ");
out.println(" edge [");
out.println(" arrowsize=\"0.8\",");
out.println(" fontsize=\"11\"");
out.println(" ];");
}
private static void writeGraphDefaults(PrintWriter out)
{
out.println();
out.println(" // Graph Defaults ");
out.println(" graph [");
out.println(" bgcolor=\"#ffffff\",");
out.println(" fontname=\"Helvetica\",");
out.println(" fontsize=\"11\",");
out.println(" label=\"Graph\",");
out.println(" labeljust=\"l\",");
out.println(" rankdir=\"TD\"");
out.println(" ];");
}
private static void writeNodeDefaults(PrintWriter out)
{
out.println();
out.println(" // Node Defaults ");
out.println(" node [");
out.println(" fontname=\"Helvetica\",");
out.println(" fontsize=\"11\",");
out.println(" shap=\"box\"");
out.println(" ];");
}
}
|
