ss: Move plugins to Trace Compass namespace

[deliverable/tracecompass.git] / org.eclipse.linuxtools.tmf.ui / src / org / eclipse / linuxtools / tmf / ui / views / uml2sd / util / SortAsyncForBackward.java

diff --git a/org.eclipse.linuxtools.tmf.ui/src/org/eclipse/linuxtools/tmf/ui/views/uml2sd/util/SortAsyncForBackward.java b/org.eclipse.linuxtools.tmf.ui/src/org/eclipse/linuxtools/tmf/ui/views/uml2sd/util/SortAsyncForBackward.java
index e70abc6a9c8e683f00a3fe06d302abfc5aafba22..bbbd5df758776580e566035eaf6543b7cae530bc 100755 (executable)
--- a/org.eclipse.linuxtools.tmf.ui/src/org/eclipse/linuxtools/tmf/ui/views/uml2sd/util/SortAsyncForBackward.java
+++ b/org.eclipse.linuxtools.tmf.ui/src/org/eclipse/linuxtools/tmf/ui/views/uml2sd/util/SortAsyncForBackward.java
@@ -1,15 +1,15 @@
 /**********************************************************************
- * Copyright (c) 2005, 2006, 2011 IBM Corporation and others.
+ * Copyright (c) 2005, 2013 IBM Corporation, Ericsson
  * 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
- * $Id: SortAsyncForBackward.java,v 1.2 2006/09/20 20:56:27 ewchan Exp $
- * 
- * Contributors: 
- * IBM - Initial API and implementation
- * Bernd Hufmann - Updated for TMF
+ *
+ * Contributors:
+ *     IBM - Initial API and implementation
+ *     Bernd Hufmann - Updated for TMF
  **********************************************************************/
+
 package org.eclipse.linuxtools.tmf.ui.views.uml2sd.util;
 
 import java.io.Serializable;
@@ -19,28 +19,31 @@ import org.eclipse.linuxtools.tmf.ui.views.uml2sd.core.AsyncMessage;
 import org.eclipse.linuxtools.tmf.ui.views.uml2sd.core.GraphNode;
 
 /**
- * Asynchronous message comparator 
- * 
+ * 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;
 
-    /**
-     * Compares two asynchronous messages Returns 0 (equal) if one of the message is not asynchronous
-     * 
-     * @return 1 if arg0 is greater, 0 if equal, -1 otherwise
-     */
+    // ------------------------------------------------------------------------
+    // Methods
+    // ------------------------------------------------------------------------
+
     @Override
     public int compare(GraphNode arg0, GraphNode arg1) {
         if (arg0 instanceof AsyncMessage && arg1 instanceof AsyncMessage) {
@@ -49,39 +52,45 @@ public class SortAsyncForBackward implements Comparator<GraphNode>, Serializable
             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())
+            if (m1.getStartOccurrence() > m1.getEndOccurrence()) {
                 m1Max = m1.getStartOccurrence();
-            else
+            } else {
                 m1Max = m1.getEndOccurrence();
-            if (m2.getStartOccurrence() > m2.getEndOccurrence())
+            }
+            if (m2.getStartOccurrence() > m2.getEndOccurrence()) {
                 m2Max = m2.getStartOccurrence();
-            else
+            } else {
                 m2Max = m2.getEndOccurrence();
+            }
 
             int m1Min, m2Min;
             // Search for the smaller event occurrence for each messages
-            if (m1.getStartOccurrence() > m1.getEndOccurrence())
+            if (m1.getStartOccurrence() > m1.getEndOccurrence()) {
                 m1Min = m1.getEndOccurrence();
-            else
+            } else {
                 m1Min = m1.getStartOccurrence();
-            if (m2.getStartOccurrence() > m2.getEndOccurrence())
+            }
+            if (m2.getStartOccurrence() > m2.getEndOccurrence()) {
                 m2Min = m2.getEndOccurrence();
-            else
+            } else {
                 m2Min = m2.getStartOccurrence();
+            }
 
-            if (m1Max > m2Max)
+            if (m1Max > m2Max) {
                 return 1;
-            else if (m1Max == m2Max)
-                if (m1Min == m2Min)
+            } else if (m1Max == m2Max) {
+                if (m1Min == m2Min) {
                     return 0;
-                else if (m1Min > m2Min)
+                } else if (m1Min > m2Min) {
                     return -1;
-                else
+                } else {
                     return 1;
-            else
+                }
+            } else {
                 return -1;
-        } else
-            return 0;
+            }
+        }
+        return 0;
     }
 
 }