Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance. Project price only 1 $
You can buy this project and download/modify it how often you want.
// 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 Revised BSD License.
*
* All rights reserved.
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* * Neither the name of the University of California, Berkeley nor the
* names of its contributors may be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND ANY
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE REGENTS AND CONTRIBUTORS BE LIABLE FOR ANY
* DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
* PlantUML can occasionally display sponsored or advertising messages. Those
* messages are usually generated on welcome or error images and never on
* functional diagrams.
* See https://plantuml.com/professional if you want to remove them
*
* Images (whatever their format : PNG, SVG, EPS...) generated by running PlantUML
* are owned by the author of their corresponding sources code (that is, their
* textual description in PlantUML language). Those images are not covered by
* this BSD license.
*
* The generated images can then be used without any reference to the BSD license.
* It is not even necessary to stipulate that they have been generated with PlantUML,
* although this will be appreciated by the PlantUML team.
*
* There is an exception : if the textual description in PlantUML language is also covered
* by any license, then the generated images are logically covered
* by the very same license.
*
* This is the IGY distribution (Install GraphViz by Yourself).
* You have to install GraphViz and to setup the GRAPHVIZ_DOT environment variable
* (see https://plantuml.com/graphviz-dot )
*
* Icons provided by OpenIconic : https://useiconic.com/open
* Archimate sprites provided by Archi : http://www.archimatetool.com
* Stdlib AWS provided by https://github.com/milo-minderbinder/AWS-PlantUML
* Stdlib Icons provided https://github.com/tupadr3/plantuml-icon-font-sprites
* ASCIIMathML (c) Peter Jipsen http://www.chapman.edu/~jipsen
* ASCIIMathML (c) David Lippman http://www.pierce.ctc.edu/dlippman
* CafeUndZopfli ported by Eugene Klyuchnikov https://github.com/eustas/CafeUndZopfli
* Brotli (c) by the Brotli Authors https://github.com/google/brotli
* Themes (c) by Brett Schwarz https://github.com/bschwarz/puml-themes
* Twemoji (c) by Twitter at https://twemoji.twitter.com/
*
*/
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 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();
}
}
}
