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;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;
import java.util.Set;
import net.sourceforge.plantuml.klimt.font.StringBounder;
import net.sourceforge.plantuml.sequencediagram.graphic.GroupingGraphicalElementElse;
import net.sourceforge.plantuml.sequencediagram.graphic.LivingParticipantBox;
import net.sourceforge.plantuml.sequencediagram.graphic.MessageExoArrow;
import net.sourceforge.plantuml.sequencediagram.graphic.ParticipantBox;
public class InGroupableList implements InGroupable {
private static final int MARGIN5 = 5;
public static final int MARGIN10 = 10;
private final Grouping grouping;
private final Set inGroupables = new HashSet<>();
private double minWidth;
public List getInnerList() {
final List result = new ArrayList<>();
for (InGroupable i : inGroupables)
if (i instanceof InGroupableList)
result.add((InGroupableList) i);
return result;
}
private final ParticipantBox veryfirst;
public InGroupableList(ParticipantBox veryfirst, Grouping grouping, double startingY) {
this.grouping = grouping;
this.veryfirst = veryfirst;
}
public void addInGroupable(InGroupable in) {
// Thread.dumpStack();
this.inGroupables.add(in);
cacheMin = null;
cacheMax = null;
}
public boolean isEmpty() {
return inGroupables.isEmpty();
}
@Override
public String toString() {
return "GS " + grouping + " " + inGroupables.toString();
}
public String toString(StringBounder stringBounder) {
final StringBuilder sb = new StringBuilder("GS " + grouping + " ");
for (InGroupable in : inGroupables) {
sb.append(in.toString(stringBounder));
sb.append(' ');
}
return sb.toString();
}
private InGroupable getMinSlow(StringBounder stringBounder) {
InGroupable result = null;
for (InGroupable in : inGroupables) {
if (in instanceof GroupingGraphicalElementElse)
continue;
if (result == null || in.getMinX(stringBounder) < result.getMinX(stringBounder))
result = in;
}
return result;
}
private InGroupable getMaxSlow(StringBounder stringBounder) {
InGroupable result = null;
for (InGroupable in : inGroupables)
if (result == null || in.getMaxX(stringBounder) > result.getMaxX(stringBounder))
result = in;
return result;
}
private InGroupable cacheMin = null;
private InGroupable cacheMax = null;
private InGroupable getMin(StringBounder stringBounder) {
if (cacheMin == null)
cacheMin = getMinSlow(stringBounder);
// Since // MODIF42 // the assert does not work...
// System.err.println("cacheMin1="+cacheMin+"
// cacheMin2="+getMinSlow(stringBounder));
// assert cacheMin == getMinSlow(stringBounder);
return cacheMin;
}
private InGroupable getMax(StringBounder stringBounder) {
if (cacheMax == null)
cacheMax = getMaxSlow(stringBounder);
assert cacheMax == getMaxSlow(stringBounder);
return cacheMax;
}
public void setMinWidth(double minWidth) {
this.minWidth = minWidth;
}
public ParticipantBox getFirstParticipantBox() {
ParticipantBox first = null;
for (InGroupable in : inGroupables)
if (in instanceof LivingParticipantBox) {
final ParticipantBox participantBox = ((LivingParticipantBox) in).getParticipantBox();
if (first == null || participantBox.getStartingX() < first.getStartingX())
first = participantBox;
}
return first;
}
public ParticipantBox getLastParticipantBox() {
ParticipantBox last = null;
for (InGroupable in : inGroupables)
if (in instanceof LivingParticipantBox) {
final ParticipantBox participantBox = ((LivingParticipantBox) in).getParticipantBox();
if (last == null || participantBox.getStartingX() > last.getStartingX())
last = participantBox;
}
return last;
}
public double getMinX(StringBounder stringBounder) {
final InGroupable min = getMin(stringBounder);
if (min == null)
return MARGIN10 + MARGIN5 + (veryfirst == null ? 0 : veryfirst.getStartingX());
double m = min.getMinX(stringBounder);
if (min instanceof MessageExoArrow && (((MessageExoArrow) min).getType() == MessageExoType.FROM_LEFT
|| ((MessageExoArrow) min).getType() == MessageExoType.TO_LEFT))
m += 3;
else if (min instanceof InGroupableList)
m -= MARGIN10;
else
m -= MARGIN5;
return m;
}
public double getMaxX(StringBounder stringBounder) {
final double min = getMinX(stringBounder);
final double max = getMaxXInternal(stringBounder);
assert max - min >= 0;
if (max - min < minWidth)
return min + minWidth + hack2;
return max + hack2;
}
private final double getMaxXInternal(StringBounder stringBounder) {
final InGroupable max = getMax(stringBounder);
if (max == null)
return MARGIN10 + MARGIN5 + minWidth;
double m = max.getMaxX(stringBounder);
if (max instanceof MessageExoArrow && (((MessageExoArrow) max).getType() == MessageExoType.FROM_RIGHT
|| ((MessageExoArrow) max).getType() == MessageExoType.TO_RIGHT))
m -= 3;
else if (max instanceof InGroupableList)
m += MARGIN10;
else
m += MARGIN5;
return m;
}
private double hack2;
public void changeHack2(double hack2) {
this.hack2 += hack2;
}
public double getHack2() {
return hack2;
}
}
