2015-04-07 18:26:58 +00:00
|
|
|
/* ========================================================================
|
|
|
|
* PlantUML : a free UML diagram generator
|
|
|
|
* ========================================================================
|
|
|
|
*
|
2016-01-09 12:15:40 +00:00
|
|
|
* (C) Copyright 2009-2017, Arnaud Roques
|
2015-04-07 18:26:58 +00:00
|
|
|
*
|
2016-03-06 16:47:34 +00:00
|
|
|
* Project Info: http://plantuml.com
|
2015-04-07 18:26:58 +00:00
|
|
|
*
|
|
|
|
* 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.
|
|
|
|
*
|
|
|
|
* [Java is a trademark or registered trademark of Sun Microsystems, Inc.
|
|
|
|
* in the United States and other countries.]
|
|
|
|
*
|
|
|
|
* Original Author: Arnaud Roques
|
|
|
|
*
|
|
|
|
* Revision $Revision: 4636 $
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
package net.sourceforge.plantuml.real;
|
|
|
|
|
|
|
|
import java.util.ArrayList;
|
2015-05-31 18:56:03 +00:00
|
|
|
import java.util.HashMap;
|
2015-07-11 09:32:49 +00:00
|
|
|
import java.util.HashSet;
|
2015-04-07 18:26:58 +00:00
|
|
|
import java.util.List;
|
2015-05-31 18:56:03 +00:00
|
|
|
import java.util.Map;
|
2015-07-11 09:32:49 +00:00
|
|
|
import java.util.Set;
|
2015-04-07 18:26:58 +00:00
|
|
|
|
|
|
|
class RealLine {
|
|
|
|
|
|
|
|
private final List<PositiveForce> forces = new ArrayList<PositiveForce>();
|
|
|
|
|
2015-05-31 18:56:03 +00:00
|
|
|
private double min;
|
|
|
|
private double max;
|
2015-07-11 09:32:49 +00:00
|
|
|
private Set<AbstractReal> all = new HashSet<AbstractReal>();
|
2015-05-31 18:56:03 +00:00
|
|
|
|
|
|
|
void register(double v) {
|
2015-07-11 09:32:49 +00:00
|
|
|
// System.err.println("RealLine::register " + v);
|
|
|
|
// min = Math.min(min, v);
|
|
|
|
// max = Math.max(max, v);
|
|
|
|
}
|
|
|
|
|
|
|
|
void register2(AbstractReal abstractReal) {
|
|
|
|
all.add(abstractReal);
|
2015-05-31 18:56:03 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
public double getAbsoluteMin() {
|
|
|
|
return min;
|
|
|
|
}
|
|
|
|
|
|
|
|
public double getAbsoluteMax() {
|
|
|
|
return max;
|
|
|
|
}
|
|
|
|
|
2015-04-07 18:26:58 +00:00
|
|
|
public void addForce(PositiveForce force) {
|
|
|
|
this.forces.add(force);
|
|
|
|
}
|
|
|
|
|
|
|
|
static private int CPT;
|
|
|
|
|
|
|
|
public void compile() {
|
|
|
|
int cpt = 0;
|
2015-05-31 18:56:03 +00:00
|
|
|
final Map<PositiveForce, Integer> counter = new HashMap<PositiveForce, Integer>();
|
2015-04-07 18:26:58 +00:00
|
|
|
do {
|
|
|
|
boolean done = true;
|
|
|
|
for (PositiveForce f : forces) {
|
|
|
|
// System.err.println("force=" + f);
|
|
|
|
final boolean change = f.apply();
|
|
|
|
if (change) {
|
2015-05-31 18:56:03 +00:00
|
|
|
incCounter(counter, f);
|
2015-04-07 18:26:58 +00:00
|
|
|
// System.err.println("changed! " + f);
|
|
|
|
done = false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (done) {
|
|
|
|
// System.err.println("cpt=" + cpt + " size=" + forces.size());
|
|
|
|
CPT += cpt;
|
|
|
|
// System.err.println("CPT=" + CPT);
|
2015-07-11 09:32:49 +00:00
|
|
|
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);
|
2015-04-07 18:26:58 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
cpt++;
|
|
|
|
if (cpt > 99999) {
|
2015-05-31 18:56:03 +00:00
|
|
|
printCounter(counter);
|
2015-04-07 18:26:58 +00:00
|
|
|
throw new IllegalStateException("Inifinite Loop?");
|
|
|
|
}
|
|
|
|
} while (true);
|
|
|
|
|
|
|
|
}
|
|
|
|
|
2015-05-31 18:56:03 +00:00
|
|
|
private void printCounter(Map<PositiveForce, Integer> counter) {
|
|
|
|
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();
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
2015-04-07 18:26:58 +00:00
|
|
|
}
|