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.bpm;
import net.sourceforge.plantuml.bpm.ConnectorPuzzle.Where;
public class CleanerInterleavingLines implements GridCleaner {
public boolean clean(Grid grid) {
// System.err.println("running CleanerInterleavingLines");
boolean result = false;
Line previous = null;
for (Line line : grid.lines().toList()) {
if (previous != null) {
if (mergeable(grid, previous, line)) {
// System.err.println("MERGEABLE! " + previous + " " + line);
mergeLines(grid, previous, line);
return true;
}
}
previous = line;
}
return result;
}
private void mergeLines(Grid grid, Line line1, Line line2) {
for (Col col : grid.cols().toList()) {
final Cell cell1 = grid.getCell(line1, col);
final Cell cell2 = grid.getCell(line2, col);
cell1.setData(merge(cell1.getData(), cell2.getData()));
cell2.setData(null);
}
grid.removeLine(line2);
}
private boolean mergeable(Grid grid, Line line1, Line line2) {
// int c = 0;
for (Col col : grid.cols().toList()) {
// System.err.println("c=" + c);
// c++;
final Placeable cell1 = grid.getCell(line1, col).getData();
final Placeable cell2 = grid.getCell(line2, col).getData();
// System.err.println("cells=" + cell1 + " " + cell2 + " " + mergeable(cell1,
// cell2));
if (mergeable(cell1, cell2) == false) {
return false;
}
}
return true;
}
private Placeable merge(Placeable data1, Placeable data2) {
if (data1 == null) {
return data2;
}
if (data2 == null) {
return data1;
}
assert data1 != null && data2 != null;
if (data1 instanceof BpmElement) {
return data1;
}
if (data2 instanceof BpmElement) {
final ConnectorPuzzleEmpty puz1 = (ConnectorPuzzleEmpty) data1;
if (puz1.checkDirections("SW")) {
((BpmElement) data2).remove(Where.NORTH);
((BpmElement) data2).append(Where.WEST);
}
return data2;
}
assert data1 instanceof ConnectorPuzzleEmpty && data2 instanceof ConnectorPuzzleEmpty;
final ConnectorPuzzleEmpty puz1 = (ConnectorPuzzleEmpty) data1;
final ConnectorPuzzleEmpty puz2 = (ConnectorPuzzleEmpty) data2;
return puz2;
}
private boolean mergeable(Placeable data1, Placeable data2) {
if (data1 == null || data2 == null) {
return true;
}
assert data1 != null && data2 != null;
if (data1 instanceof ConnectorPuzzleEmpty && data2 instanceof ConnectorPuzzleEmpty) {
return mergeableCC((ConnectorPuzzleEmpty) data1, (ConnectorPuzzleEmpty) data2);
}
if (data1 instanceof ConnectorPuzzleEmpty && data2 instanceof BpmElement) {
final boolean result = mergeablePuzzleSingle((ConnectorPuzzleEmpty) data1, (BpmElement) data2);
// System.err.println("OTHER2=" + data2 + " " + data1 + " " + result);
return result;
}
if (data2 instanceof ConnectorPuzzleEmpty && data1 instanceof BpmElement) {
final boolean result = mergeablePuzzleSingle((BpmElement) data1, (ConnectorPuzzleEmpty) data2);
// System.err.println("OTHER1=" + data1 + " " + data2 + " " + result);
return result;
}
return false;
}
private boolean mergeablePuzzleSingle(ConnectorPuzzleEmpty data1, BpmElement data2) {
if (data1.checkDirections("NS")) {
return true;
}
if (data1.checkDirections("SW")) {
return true;
}
return false;
}
private boolean mergeablePuzzleSingle(BpmElement data1, ConnectorPuzzleEmpty data2) {
if (data2.checkDirections("NS")) {
return true;
}
return false;
}
private boolean mergeableCC(ConnectorPuzzleEmpty puz1, ConnectorPuzzleEmpty puz2) {
if (puz1.checkDirections("NS") && puz2.checkDirections("NS")) {
return true;
}
if (puz1.checkDirections("NS") && puz2.checkDirections("NE")) {
return true;
}
if (puz1.checkDirections("NS") && puz2.checkDirections("NW")) {
return true;
}
return false;
}
}
