tmf: Update copyright headers in tmf.ui

[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 12e31d5b6850948b29ea975eaeec49c7bd2fdfc4..7f162da3b4f21869d26f202390d83a2db01aa4bf 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,16 +1,15 @@
 /**********************************************************************
- * Copyright (c) 2005, 2006 IBM Corporation and others.
- * Copyright (c) 2011, 2012 Ericsson.
- * 
+ * Copyright (c) 2005, 2012 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
- * 
- * 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;
@@ -20,19 +19,19 @@ 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
     // ------------------------------------------------------------------------
@@ -94,9 +93,8 @@ public class SortAsyncForBackward implements Comparator<GraphNode>, Serializable
             } else {
                 return -1;
             }
-        } else {
-            return 0;
         }
+        return 0;
     }
 
 }