/******************************************************************************* * 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.synchronization.graph; import java.util.ArrayList; import java.util.HashMap; import java.util.HashSet; import java.util.List; import java.util.Map; import java.util.Set; import org.simantics.db.Resource; import org.simantics.db.WriteGraph; import org.simantics.db.common.utils.OrderedSetUtils; import org.simantics.diagram.synchronization.ModificationAdapter; import org.simantics.diagram.ui.DiagramModelHints; import org.simantics.g2d.diagram.IDiagram; import org.simantics.g2d.element.ElementUtils; import org.simantics.g2d.element.IElement; /** * This modification reorders the specified diagram in the graph backend * according to the order of the elements specified argument element list. * *
* The algorithm is linear with respect to the amount of elements on the
* diagram. It tries to minimize the number of ordered set operations.
*
* @author Tuukka Lehtonen
*/
public class ElementReorder extends ModificationAdapter {
IDiagram diagram;
List