mirror of https://github.com/octoleo/plantuml.git
117 lines
3.5 KiB
Java
117 lines
3.5 KiB
Java
/* ========================================================================
|
|
* PlantUML : a free UML diagram generator
|
|
* ========================================================================
|
|
*
|
|
* (C) Copyright 2009-2023, Arnaud Roques
|
|
*
|
|
* Project Info: http://plantuml.com
|
|
*
|
|
* If you like this project or if you find it useful, you can support us at:
|
|
*
|
|
* http://plantuml.com/patreon (only 1$ per month!)
|
|
* http://plantuml.com/paypal
|
|
*
|
|
* This file is part of PlantUML.
|
|
*
|
|
* PlantUML is free software; you can redistribute it and/or modify it
|
|
* under the terms of the GNU 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 General Public
|
|
* License for more details.
|
|
*
|
|
* You should have received a copy of the GNU General Public
|
|
* License along with this library; if not, write to the Free Software
|
|
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
|
|
* USA.
|
|
*
|
|
*
|
|
* Original Author: Arnaud Roques
|
|
*
|
|
*
|
|
*/
|
|
package net.sourceforge.plantuml.cucadiagram.dot;
|
|
|
|
import java.io.IOException;
|
|
import java.util.ArrayList;
|
|
import java.util.Collection;
|
|
import java.util.LinkedHashSet;
|
|
import java.util.List;
|
|
|
|
import net.sourceforge.plantuml.baraye.Entity;
|
|
import net.sourceforge.plantuml.cucadiagram.GroupType;
|
|
import net.sourceforge.plantuml.cucadiagram.ICucaDiagram;
|
|
import net.sourceforge.plantuml.cucadiagram.LeafType;
|
|
import net.sourceforge.plantuml.klimt.font.StringBounder;
|
|
import net.sourceforge.plantuml.svek.GroupMakerState;
|
|
import net.sourceforge.plantuml.svek.IEntityImage;
|
|
|
|
public final class CucaDiagramSimplifierState {
|
|
|
|
private final ICucaDiagram diagram;
|
|
private final StringBounder stringBounder;
|
|
|
|
public CucaDiagramSimplifierState(ICucaDiagram diagram, List<String> dotStrings, StringBounder stringBounder)
|
|
throws IOException, InterruptedException {
|
|
this.diagram = diagram;
|
|
this.stringBounder = stringBounder;
|
|
boolean changed;
|
|
do {
|
|
changed = false;
|
|
final Collection<Entity> groups = getOrdered(diagram.getRootGroup());
|
|
for (Entity g : groups)
|
|
if (g.isAutarkic()) {
|
|
final IEntityImage img = computeImage(g);
|
|
g.overrideImage(img, g.getGroupType() == GroupType.CONCURRENT_STATE ? LeafType.STATE_CONCURRENT
|
|
: LeafType.STATE);
|
|
|
|
changed = true;
|
|
}
|
|
|
|
} while (changed);
|
|
}
|
|
|
|
private Collection<Entity> getOrdered(Entity root) {
|
|
final Collection<Entity> ordered = new LinkedHashSet<>();
|
|
ordered.add(root);
|
|
int size = 1;
|
|
while (true) {
|
|
size = ordered.size();
|
|
addOneLevel(ordered);
|
|
if (size == ordered.size())
|
|
break;
|
|
|
|
}
|
|
final List<Entity> result = new ArrayList<>();
|
|
for (Entity g : ordered)
|
|
if (g.isRoot() == false)
|
|
result.add(0, g);
|
|
|
|
return result;
|
|
}
|
|
|
|
private void addOneLevel(Collection<Entity> currents) {
|
|
for (Entity g : new ArrayList<>(currents))
|
|
for (Entity child : reverse(g.groups()))
|
|
currents.add(child);
|
|
|
|
}
|
|
|
|
private List<Entity> reverse(Collection<Entity> source) {
|
|
final List<Entity> result = new ArrayList<>();
|
|
for (Entity g : source)
|
|
result.add(0, g);
|
|
|
|
return result;
|
|
}
|
|
|
|
private IEntityImage computeImage(Entity g) throws IOException, InterruptedException {
|
|
final GroupMakerState maker = new GroupMakerState(diagram, g, stringBounder);
|
|
return maker.getImage();
|
|
}
|
|
|
|
}
|