net.sourceforge.plantuml.svek.Bibliotekon Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of plantuml-lgpl Show documentation
Show all versions of plantuml-lgpl Show documentation
PlantUML is a component that allows to quickly write diagrams from text.
// 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 GNU Lesser 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 Lesser General Public
* License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with this library. If not, see allCluster = new ArrayList<>();
private final Map nodeMap = new LinkedHashMap();
private final List lines0 = new ArrayList<>();
private final List lines1 = new ArrayList<>();
private final List allLines = new ArrayList<>();
private final Collection links;
public Bibliotekon(Collection links) {
this.links = links;
}
public SvekNode createNode(Entity ent, IEntityImage image, ColorSequence colorSequence,
StringBounder stringBounder) {
final SvekNode node = new SvekNode(ent, image, colorSequence, stringBounder);
nodeMap.put(ent, node);
// System.err.println("createNode " + ent + " " + nodeMap.size());
return node;
}
public Cluster getCluster(Entity ent) {
for (Cluster cl : allCluster)
if (cl.getGroups().contains(ent))
return cl;
return null;
}
public void addLine(SvekEdge line) {
allLines.add(line);
if (first(line)) {
if (line.hasNoteLabelText()) {
// lines0.add(0, line);
for (int i = 0; i < lines0.size(); i++) {
final SvekEdge other = lines0.get(i);
if (other.hasNoteLabelText() == false && line.sameConnections(other)) {
lines0.add(i, line);
return;
}
}
lines0.add(line);
} else {
lines0.add(line);
}
} else {
lines1.add(line);
}
}
private static boolean first(SvekEdge line) {
final int length = line.getLength();
if (length == 1)
return true;
return false;
}
public void addCluster(Cluster current) {
allCluster.add(current);
}
public SvekNode getNode(Entity ent) {
return nodeMap.get(ent);
}
public String getNodeUid(Entity ent) {
// System.err.println("Getting for " + ent);
final SvekNode result = getNode(ent);
if (result != null) {
String uid = result.getUid();
if (result.isShielded())
uid = uid + ":h";
return uid;
}
if (ent.isGroup())
return Cluster.getSpecialPointId(ent);
throw new IllegalStateException();
}
public String getWarningOrError(int warningOrError) {
final StringBuilder sb = new StringBuilder();
for (Map.Entry ent : nodeMap.entrySet()) {
final SvekNode sh = ent.getValue();
final double maxX = sh.getMinX() + sh.getWidth();
if (maxX > warningOrError) {
final Entity entity = ent.getKey();
sb.append(entity.getName() + " is overpassing the width limit.");
sb.append("\n");
}
}
return sb.length() == 0 ? "" : sb.toString();
}
public Map getMaxX() {
final Map result = new HashMap();
for (Map.Entry ent : nodeMap.entrySet()) {
final SvekNode sh = ent.getValue();
final double maxX = sh.getMinX() + sh.getWidth();
final Entity entity = ent.getKey();
result.put(entity.getName(), maxX);
}
return Collections.unmodifiableMap(result);
}
public List allLines() {
return Collections.unmodifiableList(allLines);
}
public List lines0() {
return Collections.unmodifiableList(lines0);
}
public List lines1() {
return Collections.unmodifiableList(lines1);
}
public List allCluster() {
return Collections.unmodifiableList(allCluster);
}
public Collection allNodes() {
return Collections.unmodifiableCollection(nodeMap.values());
}
public List getAllLineConnectedTo(Entity leaf) {
final List result = new ArrayList<>();
for (SvekEdge line : allLines)
if (line.isLinkFromOrTo(leaf))
result.add(line);
return Collections.unmodifiableList(result);
}
public SvekEdge getLine(Link link) {
for (SvekEdge line : allLines)
if (line.isLink(link))
return line;
throw new IllegalArgumentException();
}
public Entity getOnlyOther(Entity entity) {
for (Link link : links)
if (link.contains(entity)) {
final Entity other = link.getOther(entity);
if (other != null)
return other;
}
return null;
}
public Entity getLeaf(SvekNode node) {
for (Map.Entry ent : nodeMap.entrySet())
if (ent.getValue() == node)
return ent.getKey();
throw new IllegalArgumentException();
}
}