net.sourceforge.plantuml.real.RealLine Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of plantuml-lgpl Show documentation
Show all versions of plantuml-lgpl Show documentation
PlantUML is a component that allows to quickly write diagrams from text.
// THIS FILE HAS BEEN GENERATED BY A PREPROCESSOR.
/* +=======================================================================
* |
* | PlantUML : a free UML diagram generator
* |
* +=======================================================================
*
* (C) Copyright 2009-2024, Arnaud Roques
*
* Project Info: https://plantuml.com
*
* If you like this project or if you find it useful, you can support us at:
*
* https://plantuml.com/patreon (only 1$ per month!)
* https://plantuml.com/liberapay (only 1€ per month!)
* https://plantuml.com/paypal
*
*
* PlantUML is free software; you can redistribute it and/or modify it
* under the terms of the GNU Lesser 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 Lesser General Public
* License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with this library. If not, see forces = new ArrayList<>();
private double min;
private double max;
private Set all = new HashSet<>();
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 counter = new HashMap();
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 counter) {
for (PositiveForce f : forces)
System.err.println("force=" + f);
for (Map.Entry ent : counter.entrySet())
System.err.println("count=" + ent.getValue() + " for " + ent.getKey());
}
private static void incCounter(Map 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();
}
}
}