X-Git-Url: https://gerrit.simantics.org/r/gitweb?p=simantics%2Fplatform.git;a=blobdiff_plain;f=bundles%2Forg.simantics.diagram%2Fsrc%2Forg%2Fsimantics%2Fdiagram%2Fcontent%2FDiagramContentChanges.java;fp=bundles%2Forg.simantics.diagram%2Fsrc%2Forg%2Fsimantics%2Fdiagram%2Fcontent%2FDiagramContentChanges.java;h=575cd07ad13b1c71242795cfc8c35b317ee7643c;hp=5c648813044ea9ed39b2a2cac45e94c3876c18b2;hb=0ae2b770234dfc3cbb18bd38f324125cf0faca07;hpb=24e2b34260f219f0d1644ca7a138894980e25b14 diff --git a/bundles/org.simantics.diagram/src/org/simantics/diagram/content/DiagramContentChanges.java b/bundles/org.simantics.diagram/src/org/simantics/diagram/content/DiagramContentChanges.java index 5c6488130..575cd07ad 100644 --- a/bundles/org.simantics.diagram/src/org/simantics/diagram/content/DiagramContentChanges.java +++ b/bundles/org.simantics.diagram/src/org/simantics/diagram/content/DiagramContentChanges.java @@ -1,141 +1,141 @@ -/******************************************************************************* - * Copyright (c) 2007, 2010 Association for Decentralized Information Management - * in Industry THTH ry. - * All rights reserved. This program and the accompanying materials - * are made available under the terms of the Eclipse Public License v1.0 - * which accompanies this distribution, and is available at - * http://www.eclipse.org/legal/epl-v10.html - * - * Contributors: - * VTT Technical Research Centre of Finland - initial API and implementation - *******************************************************************************/ -package org.simantics.diagram.content; - -import gnu.trove.map.hash.THashMap; - -import java.util.Collections; -import java.util.HashSet; -import java.util.Map; -import java.util.Set; - -import org.simantics.db.Resource; - -/** - * @author Tuukka Lehtonen - */ -public class DiagramContentChanges { - - public final Map elements; - public final Map nodes; - public final Map connections; - public final Map connectionSegments; - public final Map branchPoints; - - public final Map routeGraphConnections; - public final Map routeLinks; - public final Map routeLines; - public final Map routePoints; - - public boolean elementOrderChanged = false; - - public static final DiagramContentChanges EMPTY; - - static { - EMPTY = new DiagramContentChanges(true); - } - - private DiagramContentChanges(boolean empty) { - this.elements = Collections.emptyMap(); - this.nodes = Collections.emptyMap(); - this.connections = Collections.emptyMap(); - this.connectionSegments = Collections.emptyMap(); - this.branchPoints = Collections.emptyMap(); - this.routeGraphConnections = Collections.emptyMap(); - this.routeLinks = Collections.emptyMap(); - this.routeLines = Collections.emptyMap(); - this.routePoints = Collections.emptyMap(); - } - - public DiagramContentChanges() { - this.elements = new THashMap(); - this.nodes = new THashMap(); - this.connections = new THashMap(); - this.connectionSegments = new THashMap(); - this.branchPoints = new THashMap(); - this.routeGraphConnections = new THashMap(); - this.routeLinks = new THashMap(); - this.routeLines = new THashMap(); - this.routePoints = new THashMap(); - } - - public void markElementOrderChanged() { - elementOrderChanged = true; - } - - public boolean isEmpty() { - return elements.isEmpty() - && nodes.isEmpty() - && connections.isEmpty() - && connectionSegments.isEmpty() - && branchPoints.isEmpty() - && routeGraphConnections.isEmpty() - && routeLinks.isEmpty() - && routeLines.isEmpty() - && routePoints.isEmpty() - && !elementOrderChanged; - } - - public Set pick(Map map, Change change) { - Set result = new HashSet(); - for (Map.Entry entry : map.entrySet()) { - if (entry.getValue() == change) - result.add(entry.getKey()); - } - return result; - } - - @Override - public String toString() { - StringBuilder sb = new StringBuilder(); - sb.append(getClass().getSimpleName()); - sb.append("[elements="); - sb.append(toString(count(elements))); - sb.append(", nodes="); - sb.append(toString(count(nodes))); - sb.append(", connection="); - sb.append(toString(count(connections))); - sb.append(", connection segments="); - sb.append(toString(count(connectionSegments))); - sb.append(", branch points="); - sb.append(toString(count(branchPoints))); - sb.append(", routegraph connections="); - sb.append(toString(count(routeGraphConnections))); - sb.append(", route links="); - sb.append(toString(count(routeLinks))); - sb.append(", route lines="); - sb.append(toString(count(routeLines))); - sb.append(", route points="); - sb.append(toString(count(routePoints))); - sb.append(", element order changed="); - sb.append(elementOrderChanged); - sb.append("]"); - return sb.toString(); - } - - private static String toString(int[] changes) { - return - "[" + Change.ADDED.toString() + "=" + changes[Change.ADDED.ordinal()] + - ", " + Change.REMOVED.toString() + "=" + changes[Change.REMOVED.ordinal()] + - //", " + Change.POSSIBLY_MODIFIED.toString() + "=" + changes[Change.POSSIBLY_MODIFIED.ordinal()] + - "]"; - } - - private static int[] count(Map map) { - int[] result = new int[Change.values().length]; - for (Change change : map.values()) { - result[change.ordinal()]++; - } - return result; - } - +/******************************************************************************* + * Copyright (c) 2007, 2010 Association for Decentralized Information Management + * in Industry THTH ry. + * All rights reserved. This program and the accompanying materials + * are made available under the terms of the Eclipse Public License v1.0 + * which accompanies this distribution, and is available at + * http://www.eclipse.org/legal/epl-v10.html + * + * Contributors: + * VTT Technical Research Centre of Finland - initial API and implementation + *******************************************************************************/ +package org.simantics.diagram.content; + +import gnu.trove.map.hash.THashMap; + +import java.util.Collections; +import java.util.HashSet; +import java.util.Map; +import java.util.Set; + +import org.simantics.db.Resource; + +/** + * @author Tuukka Lehtonen + */ +public class DiagramContentChanges { + + public final Map elements; + public final Map nodes; + public final Map connections; + public final Map connectionSegments; + public final Map branchPoints; + + public final Map routeGraphConnections; + public final Map routeLinks; + public final Map routeLines; + public final Map routePoints; + + public boolean elementOrderChanged = false; + + public static final DiagramContentChanges EMPTY; + + static { + EMPTY = new DiagramContentChanges(true); + } + + private DiagramContentChanges(boolean empty) { + this.elements = Collections.emptyMap(); + this.nodes = Collections.emptyMap(); + this.connections = Collections.emptyMap(); + this.connectionSegments = Collections.emptyMap(); + this.branchPoints = Collections.emptyMap(); + this.routeGraphConnections = Collections.emptyMap(); + this.routeLinks = Collections.emptyMap(); + this.routeLines = Collections.emptyMap(); + this.routePoints = Collections.emptyMap(); + } + + public DiagramContentChanges() { + this.elements = new THashMap(); + this.nodes = new THashMap(); + this.connections = new THashMap(); + this.connectionSegments = new THashMap(); + this.branchPoints = new THashMap(); + this.routeGraphConnections = new THashMap(); + this.routeLinks = new THashMap(); + this.routeLines = new THashMap(); + this.routePoints = new THashMap(); + } + + public void markElementOrderChanged() { + elementOrderChanged = true; + } + + public boolean isEmpty() { + return elements.isEmpty() + && nodes.isEmpty() + && connections.isEmpty() + && connectionSegments.isEmpty() + && branchPoints.isEmpty() + && routeGraphConnections.isEmpty() + && routeLinks.isEmpty() + && routeLines.isEmpty() + && routePoints.isEmpty() + && !elementOrderChanged; + } + + public Set pick(Map map, Change change) { + Set result = new HashSet(); + for (Map.Entry entry : map.entrySet()) { + if (entry.getValue() == change) + result.add(entry.getKey()); + } + return result; + } + + @Override + public String toString() { + StringBuilder sb = new StringBuilder(); + sb.append(getClass().getSimpleName()); + sb.append("[elements="); + sb.append(toString(count(elements))); + sb.append(", nodes="); + sb.append(toString(count(nodes))); + sb.append(", connection="); + sb.append(toString(count(connections))); + sb.append(", connection segments="); + sb.append(toString(count(connectionSegments))); + sb.append(", branch points="); + sb.append(toString(count(branchPoints))); + sb.append(", routegraph connections="); + sb.append(toString(count(routeGraphConnections))); + sb.append(", route links="); + sb.append(toString(count(routeLinks))); + sb.append(", route lines="); + sb.append(toString(count(routeLines))); + sb.append(", route points="); + sb.append(toString(count(routePoints))); + sb.append(", element order changed="); + sb.append(elementOrderChanged); + sb.append("]"); + return sb.toString(); + } + + private static String toString(int[] changes) { + return + "[" + Change.ADDED.toString() + "=" + changes[Change.ADDED.ordinal()] + + ", " + Change.REMOVED.toString() + "=" + changes[Change.REMOVED.ordinal()] + + //", " + Change.POSSIBLY_MODIFIED.toString() + "=" + changes[Change.POSSIBLY_MODIFIED.ordinal()] + + "]"; + } + + private static int[] count(Map map) { + int[] result = new int[Change.values().length]; + for (Change change : map.values()) { + result[change.ordinal()]++; + } + return result; + } + } \ No newline at end of file