| /********************************************************************** |
| * Copyright (c) 2005, 2014 IBM Corporation, Ericsson |
| * All rights reserved. This program and the accompanying materials |
| * are made available under the terms of the Eclipse Public License 2.0 |
| * which accompanies this distribution, and is available at |
| * https://www.eclipse.org/legal/epl-2.0/ |
| * |
| * SPDX-License-Identifier: EPL-2.0 |
| * |
| * Contributors: |
| * IBM - Initial API and implementation |
| * Bernd Hufmann - Updated for TMF |
| **********************************************************************/ |
| |
| package org.eclipse.tracecompass.tmf.ui.views.uml2sd.util; |
| |
| import java.io.Serializable; |
| import java.util.Comparator; |
| |
| import org.eclipse.tracecompass.tmf.ui.views.uml2sd.core.AsyncMessage; |
| import org.eclipse.tracecompass.tmf.ui.views.uml2sd.core.GraphNode; |
| |
| /** |
| * Asynchronous message comparator. |
| * |
| * Compares two asyncMessages only taking into account the event occurrence when their |
| * appear.<br> |
| * |
| * Used to order the AsyncMessage list insuring that the previous node has both of his ends smaller than the current node |
| * |
| * @version 1.0 |
| * @author sveyrier |
| * |
| */ |
| public class SortAsyncForBackward implements Comparator<GraphNode>, Serializable { |
| |
| // ------------------------------------------------------------------------ |
| // Constants |
| // ------------------------------------------------------------------------ |
| /** |
| * Serial version UID |
| */ |
| private static final long serialVersionUID = 603959931263853359L; |
| |
| // ------------------------------------------------------------------------ |
| // Methods |
| // ------------------------------------------------------------------------ |
| |
| @Override |
| public int compare(GraphNode arg0, GraphNode arg1) { |
| if (arg0 instanceof AsyncMessage && arg1 instanceof AsyncMessage) { |
| AsyncMessage m1 = (AsyncMessage) arg0; |
| AsyncMessage m2 = (AsyncMessage) arg1; |
| int m1Max, m2Max; |
| // AsyncMessage has two ends which may have different event occurrences |
| // Search for the greater event occurrence for each messages |
| if (m1.getStartOccurrence() > m1.getEndOccurrence()) { |
| m1Max = m1.getStartOccurrence(); |
| } else { |
| m1Max = m1.getEndOccurrence(); |
| } |
| if (m2.getStartOccurrence() > m2.getEndOccurrence()) { |
| m2Max = m2.getStartOccurrence(); |
| } else { |
| m2Max = m2.getEndOccurrence(); |
| } |
| |
| int m1Min, m2Min; |
| // Search for the smaller event occurrence for each messages |
| if (m1.getStartOccurrence() > m1.getEndOccurrence()) { |
| m1Min = m1.getEndOccurrence(); |
| } else { |
| m1Min = m1.getStartOccurrence(); |
| } |
| if (m2.getStartOccurrence() > m2.getEndOccurrence()) { |
| m2Min = m2.getEndOccurrence(); |
| } else { |
| m2Min = m2.getStartOccurrence(); |
| } |
| |
| if (m1Max > m2Max) { |
| return 1; |
| } else if (m1Max == m2Max) { |
| if (m1Min == m2Min) { |
| return 0; |
| } else if (m1Min > m2Min) { |
| return -1; |
| } else { |
| return 1; |
| } |
| } else { |
| return -1; |
| } |
| } |
| return 0; |
| } |
| |
| } |