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-mit Show documentation
Show all versions of plantuml-mit 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 MIT License.
*
* See http://opensource.org/licenses/MIT
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
* and/or sell copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included
* in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
* WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR
* IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*
* 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 MIT license.
*
* The generated images can then be used without any reference to the MIT 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.svek;
import java.util.ArrayList;
import java.util.Collection;
import java.util.Collections;
import java.util.HashMap;
import java.util.LinkedHashMap;
import java.util.List;
import java.util.Map;
import net.sourceforge.plantuml.abel.Entity;
import net.sourceforge.plantuml.abel.Link;
import net.sourceforge.plantuml.klimt.font.StringBounder;
public class Bibliotekon {
private final List 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;
private final ColorSequence colorSequence;
public Bibliotekon(Collection links) {
this.links = links;
this.colorSequence = new ColorSequence();
}
public ColorSequence getColorSequence() {
return colorSequence;
}
public SvekNode createNode(Entity ent, IEntityImage image, 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();
}
}