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.sequencediagram.graphic;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
class FrontierStackImpl implements FrontierStack {
class Stack {
final private FrontierComplex current;
final private FrontierComplex envelop;
Stack(FrontierComplex current) {
this(current, null);
}
private Stack(FrontierComplex current, FrontierComplex envelop) {
this.current = current;
this.envelop = envelop;
}
Stack addEnvelop(FrontierComplex env) {
if (this.envelop == null) {
return new Stack(this.current, env);
}
return new Stack(this.current, this.envelop.mergeMax(env));
}
}
final private List all;
public FrontierStackImpl(double freeY, int rangeEnd) {
final Stack s = new Stack(FrontierComplex.create(freeY, rangeEnd));
all = Collections.singletonList(s);
}
private FrontierStackImpl(List all) {
this.all = Collections.unmodifiableList(all);
}
private FrontierComplex getLast() {
return all.get(all.size() - 1).current;
}
public double getFreeY(ParticipantRange range) {
return getLast().getFreeY(range);
}
public FrontierStackImpl add(double delta, ParticipantRange range) {
final List result = new ArrayList<>(all);
final Stack s = new Stack(getLast().add(delta, range));
result.set(result.size() - 1, s);
return new FrontierStackImpl(result);
}
public FrontierStack openBar() {
final List result = new ArrayList<>(all);
final Stack s = new Stack(getLast().copy());
result.add(s);
return new FrontierStackImpl(result);
}
public FrontierStack restore() {
final List result = new ArrayList<>(all);
final Stack openedBar = result.get(result.size() - 2);
final Stack lastStack = result.get(result.size() - 1);
result.set(result.size() - 2, openedBar.addEnvelop(lastStack.current));
result.remove(result.size() - 1);
final Stack s = new Stack(openedBar.current.copy());
result.add(s);
return new FrontierStackImpl(result);
}
public FrontierStack closeBar() {
final List result = new ArrayList<>(all);
final Stack openedBar = result.get(result.size() - 2);
final Stack lastStack = result.get(result.size() - 1);
final Stack merge = openedBar.addEnvelop(lastStack.current);
result.set(result.size() - 2, new Stack(merge.envelop));
result.remove(result.size() - 1);
return new FrontierStackImpl(result);
}
public FrontierStackImpl copy() {
// return new FrontierStackImpl(all);
throw new UnsupportedOperationException();
}
@Override
public String toString() {
return "nb=" + all.size() + " " + getLast().toString();
}
}