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
|
/* ========================================================================
* PlantUML : a free UML diagram generator
* ========================================================================
*
* (C) Copyright 2009-2014, Arnaud Roques
*
* Project Info: http://plantuml.sourceforge.net
*
* 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.ugraphic;
import java.awt.geom.Dimension2D;
import java.util.Iterator;
import java.util.LinkedHashMap;
import java.util.Map;
import net.sourceforge.plantuml.graphic.StringBounder;
import net.sourceforge.plantuml.graphic.TextBlock;
public abstract class AbstractPlacementStrategy implements PlacementStrategy {
private final StringBounder stringBounder;
private final Map<TextBlock, Dimension2D> dimensions = new LinkedHashMap<TextBlock, Dimension2D>();
public AbstractPlacementStrategy(StringBounder stringBounder) {
this.stringBounder = stringBounder;
}
public void add(TextBlock block) {
this.dimensions.put(block, block.calculateDimension(stringBounder));
}
protected Map<TextBlock, Dimension2D> getDimensions() {
return dimensions;
}
protected double getSumWidth() {
return getSumWidth(dimensions.values().iterator());
}
protected double getSumHeight() {
return getSumHeight(dimensions.values().iterator());
}
protected double getMaxHeight() {
return getMaxHeight(dimensions.values().iterator());
}
protected double getMaxWidth() {
return getMaxWidth(dimensions.values().iterator());
}
protected double getSumWidth(Iterator<Dimension2D> it) {
double result = 0;
while (it.hasNext()) {
result += it.next().getWidth();
}
return result;
}
protected double getSumHeight(Iterator<Dimension2D> it) {
double result = 0;
while (it.hasNext()) {
result += it.next().getHeight();
}
return result;
}
protected double getMaxWidth(Iterator<Dimension2D> it) {
double result = 0;
while (it.hasNext()) {
result = Math.max(result, it.next().getWidth());
}
return result;
}
protected double getMaxHeight(Iterator<Dimension2D> it) {
double result = 0;
while (it.hasNext()) {
result = Math.max(result, it.next().getHeight());
}
return result;
}
protected final StringBounder getStringBounder() {
return stringBounder;
}
}
|
