| 1 | /********************************************************************** |
| 2 | * Copyright (c) 2005, 2012 IBM Corporation, Ericsson |
| 3 | * All rights reserved. This program and the accompanying materials |
| 4 | * are made available under the terms of the Eclipse Public License v1.0 |
| 5 | * which accompanies this distribution, and is available at |
| 6 | * http://www.eclipse.org/legal/epl-v10.html |
| 7 | * |
| 8 | * Contributors: |
| 9 | * IBM - Initial API and implementation |
| 10 | * Bernd Hufmann - Updated for TMF |
| 11 | **********************************************************************/ |
| 12 | |
| 13 | package org.eclipse.linuxtools.tmf.ui.views.uml2sd.util; |
| 14 | |
| 15 | import java.io.Serializable; |
| 16 | import java.util.Comparator; |
| 17 | |
| 18 | import org.eclipse.linuxtools.tmf.ui.views.uml2sd.core.AsyncMessage; |
| 19 | import org.eclipse.linuxtools.tmf.ui.views.uml2sd.core.GraphNode; |
| 20 | |
| 21 | /** |
| 22 | * Asynchronous message comparator Compare two AsyncMessages only taking into account the event occurrence when their |
| 23 | * appear.<br> |
| 24 | * |
| 25 | * Used to order the AsyncMessage list insuring that next node has one of his ends greater than the current node |
| 26 | * |
| 27 | * @version 1.0 |
| 28 | * @author sveyrier |
| 29 | * |
| 30 | */ |
| 31 | public class SortAsyncMessageComparator implements Comparator<GraphNode>, Serializable { |
| 32 | |
| 33 | // ------------------------------------------------------------------------ |
| 34 | // Constants |
| 35 | // ------------------------------------------------------------------------ |
| 36 | /** |
| 37 | * Serial version UID |
| 38 | */ |
| 39 | private static final long serialVersionUID = 1L; |
| 40 | |
| 41 | // ------------------------------------------------------------------------ |
| 42 | // Methods |
| 43 | // ------------------------------------------------------------------------ |
| 44 | /* |
| 45 | * (non-Javadoc) |
| 46 | * @see java.util.Comparator#compare(java.lang.Object, java.lang.Object) |
| 47 | */ |
| 48 | @Override |
| 49 | public int compare(GraphNode arg0, GraphNode arg1) { |
| 50 | if (arg0 instanceof AsyncMessage && arg1 instanceof AsyncMessage) { |
| 51 | AsyncMessage m1 = (AsyncMessage) arg0; |
| 52 | AsyncMessage m2 = (AsyncMessage) arg1; |
| 53 | int m1Min, m2Min; |
| 54 | // AsyncMessage has two ends which may have different event occurrences |
| 55 | // Search for the smaller event occurrence for each messages |
| 56 | if (m1.getStartOccurrence() > m1.getEndOccurrence()) { |
| 57 | m1Min = m1.getEndOccurrence(); |
| 58 | } else { |
| 59 | m1Min = m1.getStartOccurrence(); |
| 60 | } |
| 61 | if (m2.getStartOccurrence() > m2.getEndOccurrence()) { |
| 62 | m2Min = m2.getEndOccurrence(); |
| 63 | } else { |
| 64 | m2Min = m2.getStartOccurrence(); |
| 65 | } |
| 66 | |
| 67 | int m1Max, m2Max; |
| 68 | // Search for the greater event occurrence for each messages |
| 69 | if (m1.getStartOccurrence() > m1.getEndOccurrence()) { |
| 70 | m1Max = m1.getStartOccurrence(); |
| 71 | } else { |
| 72 | m1Max = m1.getEndOccurrence(); |
| 73 | } |
| 74 | if (m2.getStartOccurrence() > m2.getEndOccurrence()) { |
| 75 | m2Max = m2.getStartOccurrence(); |
| 76 | } else { |
| 77 | m2Max = m2.getEndOccurrence(); |
| 78 | } |
| 79 | |
| 80 | if (m1Min > m2Min) { |
| 81 | return 1; |
| 82 | } else if ((m1Min == m2Min)) { |
| 83 | if (m1Max == m2Max) { |
| 84 | return 0; |
| 85 | } else if (m1Max > m2Max) { |
| 86 | return -1; |
| 87 | } else { |
| 88 | return 1; |
| 89 | } |
| 90 | } else { |
| 91 | return -1; |
| 92 | } |
| 93 | } |
| 94 | return 0; |
| 95 | } |
| 96 | |
| 97 | } |