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
|
/* ========================================================================
* PlantUML : a free UML diagram generator
* ========================================================================
*
* (C) Copyright 2009-2017, Arnaud Roques
*
* Project Info: http://plantuml.com
*
* If you like this project or if you find it useful, you can support us at:
*
* http://plantuml.com/patreon (only 1$ per month!)
* http://plantuml.com/paypal
*
* This file is part of PlantUML.
*
* PlantUML is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* PlantUML distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
* or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
* License for more details.
*
* You should have received a copy of the GNU General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
* USA.
*
*
* Original Author: Arnaud Roques
*
*
*/
package net.sourceforge.plantuml.real;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Set;
class RealLine {
private final List<PositiveForce> forces = new ArrayList<PositiveForce>();
private double min;
private double max;
private Set<AbstractReal> all = new HashSet<AbstractReal>();
void register(double v) {
// System.err.println("RealLine::register " + v);
// min = Math.min(min, v);
// max = Math.max(max, v);
}
void register2(AbstractReal abstractReal) {
all.add(abstractReal);
}
public double getAbsoluteMin() {
return min;
}
public double getAbsoluteMax() {
return max;
}
public void addForce(PositiveForce force) {
this.forces.add(force);
}
static private int CPT;
public void compile() {
int cpt = 0;
final Map<PositiveForce, Integer> counter = new HashMap<PositiveForce, Integer>();
do {
boolean done = true;
for (PositiveForce f : forces) {
// System.err.println("force=" + f);
final boolean change = f.apply();
if (change) {
incCounter(counter, f);
// System.err.println("changed! " + f);
done = false;
}
}
if (done) {
// System.err.println("cpt=" + cpt + " size=" + forces.size());
CPT += cpt;
// System.err.println("CPT=" + CPT);
min = 0;
max = 0;
for (AbstractReal real : all) {
final double v = real.getCurrentValue();
// System.err.println("RealLine::compile v=" + v);
if (v > max) {
max = v;
}
if (v < min) {
min = v;
}
}
// System.err.println("RealLine::compile min=" + min + " max=" + max);
return;
}
cpt++;
if (cpt > 99999) {
printCounter(counter);
throw new IllegalStateException("Inifinite Loop?");
}
} while (true);
}
private void printCounter(Map<PositiveForce, Integer> counter) {
for (PositiveForce f : forces) {
System.err.println("force=" + f);
}
for (Map.Entry<PositiveForce, Integer> ent : counter.entrySet()) {
System.err.println("count=" + ent.getValue() + " for " + ent.getKey());
}
}
private static void incCounter(Map<PositiveForce, Integer> counter, PositiveForce f) {
final Integer v = counter.get(f);
counter.put(f, v == null ? 1 : v + 1);
}
Real asMaxAbsolute() {
return new MaxAbsolute();
}
Real asMinAbsolute() {
return new MinAbsolute();
}
class MaxAbsolute extends AbstractAbsolute {
public double getCurrentValue() {
return max;
}
}
class MinAbsolute extends AbstractAbsolute {
public double getCurrentValue() {
return min;
}
}
abstract class AbstractAbsolute implements Real {
public void printCreationStackTrace() {
}
public String getName() {
return getClass().getName();
}
public Real addFixed(double delta) {
throw new UnsupportedOperationException();
}
public Real addAtLeast(double delta) {
throw new UnsupportedOperationException();
}
public void ensureBiggerThan(Real other) {
throw new UnsupportedOperationException();
}
public Real getMaxAbsolute() {
return asMaxAbsolute();
}
public Real getMinAbsolute() {
return asMinAbsolute();
}
}
}
|
