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
|
/* ========================================================================
* PlantUML : a free UML diagram generator
* ========================================================================
*
* (C) Copyright 2009-2017, Arnaud Roques
*
* Project Info: http://plantuml.com
*
* This file is part of PlantUML.
*
* Licensed under The MIT License (Massachusetts Institute of Technology License)
*
* See http://opensource.org/licenses/MIT
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
* and/or sell copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included
* in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
* WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR
* IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*
*
* Original Author: Arnaud Roques
*/
package net.sourceforge.plantuml.svek;
import java.util.ArrayList;
import java.util.Collection;
import java.util.Collections;
import java.util.LinkedHashMap;
import java.util.List;
import java.util.Map;
import net.sourceforge.plantuml.cucadiagram.IEntity;
import net.sourceforge.plantuml.cucadiagram.IGroup;
import net.sourceforge.plantuml.cucadiagram.ILeaf;
import net.sourceforge.plantuml.cucadiagram.Link;
public class Bibliotekon {
private final List<Cluster> allCluster = new ArrayList<Cluster>();
private final Map<ILeaf, Shape> shapeMap = new LinkedHashMap<ILeaf, Shape>();;
private final List<Line> lines0 = new ArrayList<Line>();
private final List<Line> lines1 = new ArrayList<Line>();
private final List<Line> allLines = new ArrayList<Line>();
public void putShape(ILeaf ent, Shape shape) {
shapeMap.put(ent, shape);
}
public Cluster getCluster(IGroup ent) {
for (Cluster cl : allCluster) {
if (cl.getGroup() == ent) {
return cl;
}
}
return null;
}
public void addLine(Line line) {
allLines.add(line);
if (first(line)) {
if (line.hasNoteLabelText()) {
// lines0.add(0, line);
for (int i = 0; i < lines0.size(); i++) {
final Line other = lines0.get(i);
if (other.hasNoteLabelText() == false && line.sameConnections(other)) {
lines0.add(i, line);
return;
}
}
lines0.add(line);
} else {
lines0.add(line);
}
} else {
lines1.add(line);
}
}
private static boolean first(Line line) {
final int length = line.getLength();
if (length == 1) {
return true;
}
return false;
}
public void addCluster(Cluster current) {
allCluster.add(current);
}
public Shape getShape(IEntity ent) {
return shapeMap.get(ent);
}
public String getShapeUid(ILeaf ent) {
final Shape result = getShape(ent);
if (result != null) {
String uid = result.getUid();
if (result.isShielded()) {
uid = uid + ":h";
}
return uid;
}
assert result == null;
if (ent.isGroup()) {
for (IEntity i : shapeMap.keySet()) {
if (ent.getCode().equals(i.getCode())) {
return getShape(i).getUid();
}
}
return Cluster.getSpecialPointId(ent);
}
throw new IllegalStateException();
}
public String getWarningOrError(int warningOrError) {
final StringBuilder sb = new StringBuilder();
for (Map.Entry<ILeaf, Shape> ent : shapeMap.entrySet()) {
final Shape sh = ent.getValue();
final double maxX = sh.getMinX() + sh.getWidth();
if (maxX > warningOrError) {
final IEntity entity = ent.getKey();
sb.append(entity.getCode() + " is overpassing the width limit.");
sb.append("\n");
}
}
return sb.length() == 0 ? "" : sb.toString();
}
public List<Line> allLines() {
return Collections.unmodifiableList(allLines);
}
public List<Line> lines0() {
return Collections.unmodifiableList(lines0);
}
public List<Line> lines1() {
return Collections.unmodifiableList(lines1);
}
public List<Cluster> allCluster() {
return Collections.unmodifiableList(allCluster);
}
public Collection<Shape> allShapes() {
return Collections.unmodifiableCollection(shapeMap.values());
}
public List<Line> getAllLineConnectedTo(IEntity leaf) {
final List<Line> result = new ArrayList<Line>();
for (Line line : allLines) {
if (line.isLinkFromOrTo(leaf)) {
result.add(line);
}
}
return Collections.unmodifiableList(result);
}
public Line getLine(Link link) {
for (Line line : allLines) {
if (line.isLink(link)) {
return line;
}
}
throw new IllegalArgumentException();
}
public IEntity getOnlyOther(IEntity entity) {
for (Line line : allLines) {
final IEntity other = line.getOther(entity);
if (other != null) {
return other;
}
}
return null;
}
public ILeaf getLeaf(Shape shape) {
for (Map.Entry<ILeaf, Shape> ent : shapeMap.entrySet()) {
if (ent.getValue() == shape) {
return ent.getKey();
}
}
throw new IllegalArgumentException();
}
}
|
