1 /**********************************************************************
2 * Copyright (c) 2005, 2006, 2011 IBM Corporation and others.
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 * $Id: SortAsyncMessageComparator.java,v 1.2 2006/09/20 20:56:27 ewchan Exp $
10 * IBM - Initial API and implementation
11 * Bernd Hufmann - Updated for TMF
12 **********************************************************************/
13 package org
.eclipse
.linuxtools
.tmf
.ui
.views
.uml2sd
.util
;
15 import java
.io
.Serializable
;
16 import java
.util
.Comparator
;
18 import org
.eclipse
.linuxtools
.tmf
.ui
.views
.uml2sd
.core
.AsyncMessage
;
19 import org
.eclipse
.linuxtools
.tmf
.ui
.views
.uml2sd
.core
.GraphNode
;
22 * Asynchronous message comparator Compare two AsyncMessages only taking into account the event occurrence when their
25 * Used to order the AsyncMessage list insuring that next node has one of his ends greater than the current node
30 public class SortAsyncMessageComparator
implements Comparator
<GraphNode
>, Serializable
{
35 private static final long serialVersionUID
= 1L;
38 * Compares two synchronous syncMessages Returns 0 (equal) if one of the message is not synchronous
40 * @return 1 if arg0 is greater, 0 if equal, -1 otherwise
43 public int compare(GraphNode arg0
, GraphNode arg1
) {
44 if (arg0
instanceof AsyncMessage
&& arg1
instanceof AsyncMessage
) {
45 AsyncMessage m1
= (AsyncMessage
) arg0
;
46 AsyncMessage m2
= (AsyncMessage
) arg1
;
48 // AsyncMessage has two ends which may have different event occurrences
49 // Search for the smaller event occurrence for each messages
50 if (m1
.getStartOccurrence() > m1
.getEndOccurrence())
51 m1Min
= m1
.getEndOccurrence();
53 m1Min
= m1
.getStartOccurrence();
54 if (m2
.getStartOccurrence() > m2
.getEndOccurrence())
55 m2Min
= m2
.getEndOccurrence();
57 m2Min
= m2
.getStartOccurrence();
60 // Search for the greater event occurrence for each messages
61 if (m1
.getStartOccurrence() > m1
.getEndOccurrence())
62 m1Max
= m1
.getStartOccurrence();
64 m1Max
= m1
.getEndOccurrence();
65 if (m2
.getStartOccurrence() > m2
.getEndOccurrence())
66 m2Max
= m2
.getStartOccurrence();
68 m2Max
= m2
.getEndOccurrence();
72 else if ((m1Min
== m2Min
))
75 else if (m1Max
> m2Max
)