diff options
Diffstat (limited to 'src/net/sourceforge/plantuml/graph/Zoda2.java')
| -rw-r--r-- | src/net/sourceforge/plantuml/graph/Zoda2.java | 125 |
1 files changed, 125 insertions, 0 deletions
diff --git a/src/net/sourceforge/plantuml/graph/Zoda2.java b/src/net/sourceforge/plantuml/graph/Zoda2.java new file mode 100644 index 0000000..4314268 --- /dev/null +++ b/src/net/sourceforge/plantuml/graph/Zoda2.java @@ -0,0 +1,125 @@ +/* ========================================================================
+ * PlantUML : a free UML diagram generator
+ * ========================================================================
+ *
+ * (C) Copyright 2009-2014, Arnaud Roques
+ *
+ * Project Info: http://plantuml.sourceforge.net
+ *
+ * This file is part of PlantUML.
+ *
+ * Licensed under The MIT License (Massachusetts Institute of Technology 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.
+ *
+ *
+ * Original Author: Arnaud Roques
+ */
+package net.sourceforge.plantuml.graph;
+
+import java.util.ArrayList;
+import java.util.Collections;
+import java.util.HashSet;
+import java.util.LinkedHashMap;
+import java.util.List;
+import java.util.Map;
+import java.util.Set;
+
+public class Zoda2 {
+
+ private final Map<ANode, Heap> heaps = new LinkedHashMap<ANode, Heap>();
+
+ public ANode getNode(String code) {
+ for (ANode n : heaps.keySet()) {
+ if (n.getCode().equals(code)) {
+ return n;
+ }
+ }
+ return null;
+ }
+
+ public ANode createAloneNode(String code) {
+ if (getNode(code) != null) {
+ throw new IllegalArgumentException();
+ }
+ final Heap h = new Heap();
+ final ANode n = h.addNode(code);
+ heaps.put(n, h);
+ return n;
+ }
+
+ public List<? extends ANode> getNodes() {
+ return Collections.unmodifiableList(new ArrayList<ANode>(heaps.keySet()));
+ }
+
+ public Set<Heap> getHeaps() {
+ return new HashSet<Heap>(heaps.values());
+ }
+
+ public void addLink(String link, int diffHeight, Object userData) {
+ final LinkString l;
+ try {
+ l = new LinkString(link);
+ } catch (IllegalArgumentException e) {
+ e.printStackTrace();
+ return;
+ }
+ final ANode n1 = getNode(l.getNode1());
+ final ANode n2 = getNode(l.getNode2());
+ final Heap h1 = n1 == null ? null : heaps.get(n1);
+ final Heap h2 = n2 == null ? null : heaps.get(n2);
+ assert h1 == null || h1.isEmpty() == false;
+ assert h2 == null || h2.isEmpty() == false;
+ if (h1 == null && h2 == null) {
+ final Heap h = new Heap();
+ h.addLink(link, diffHeight, userData);
+ recordHeap(h);
+ } else if (h1 == h2) {
+ assert h1 != null && h2 != null;
+ h1.addLink(link, diffHeight, userData);
+ } else if (h1 == null) {
+ h2.addLink(link, diffHeight, userData);
+ recordHeap(h2);
+ } else if (h2 == null) {
+ h1.addLink(link, diffHeight, userData);
+ recordHeap(h1);
+ } else {
+ assert h1 != null && h2 != null;
+ assert h1.getNodes().contains(n1);
+ h1.importing(n1, n2, h2, diffHeight, userData);
+ recordHeap(h1);
+ assert heapMerged(h1, h2);
+ }
+ }
+
+ private boolean heapMerged(final Heap destination, final Heap source) {
+ for (ANode n : source.getNodes()) {
+ assert heaps.get(n) == destination;
+ }
+ return true;
+ }
+
+ private void recordHeap(final Heap h) {
+ for (ANode n : h.getNodes()) {
+ heaps.put((ANodeImpl) n, h);
+ }
+ }
+
+}
|