X-Git-Url: http://source.jalview.org/gitweb/?a=blobdiff_plain;f=src%2FMCview%2FZsort.java;h=419cb9cb4bc2393910db39bb4e7f396d5237b396;hb=c19d2a91ca05e052e3408bf5852d88eb5d0608f1;hp=a5d7905060795e5dbc77fbfe15a1358913962e5e;hpb=797df64fa2a0a30773d0f48f5494d4155e5a8be3;p=jalview.git

diff --git a/src/MCview/Zsort.java b/src/MCview/Zsort.java
index a5d7905..419cb9c 100755
--- a/src/MCview/Zsort.java
+++ b/src/MCview/Zsort.java
@@ -1,32 +1,41 @@
 /*
- * Jalview - A Sequence Alignment Editor and Viewer (Version 2.7)
- * Copyright (C) 2011 J Procter, AM Waterhouse, J Engelhardt, LM Lui, G Barton, M Clamp, S Searle
+ * Jalview - A Sequence Alignment Editor and Viewer (Version 2.9.0b2)
+ * Copyright (C) 2015 The Jalview Authors
  * 
  * This file is part of Jalview.
  * 
  * Jalview is free software: you can redistribute it and/or
  * modify it under the terms of the GNU General Public License 
- * as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version.
- * 
+ * as published by the Free Software Foundation, either version 3
+ * of the License, or (at your option) any later version.
+ *  
  * Jalview is distributed in the hope that it will be useful, but 
  * WITHOUT ANY WARRANTY; without even the implied warranty 
  * of MERCHANTABILITY or FITNESS FOR A PARTICULAR 
  * PURPOSE.  See the GNU General Public License for more details.
  * 
- * You should have received a copy of the GNU General Public License along with Jalview.  If not, see <http://www.gnu.org/licenses/>.
+ * You should have received a copy of the GNU General Public License
+ * along with Jalview.  If not, see <http://www.gnu.org/licenses/>.
+ * The Jalview Authors are detailed in the 'AUTHORS' file.
  */
 package MCview;
 
-import java.util.*;
+import java.util.Vector;
 
 public class Zsort
 {
-  public void Zsort(Vector bonds)
+  /**
+   * Sorts the Bond list in ascending order of the z-value of the bond start
+   * atom
+   * 
+   * @param bonds
+   */
+  public void sort(Vector<Bond> bonds)
   {
     sort(bonds, 0, bonds.size() - 1);
   }
 
-  public void sort(Vector bonds, int p, int r)
+  public void sort(Vector<Bond> bonds, int p, int r)
   {
     int q;
 
@@ -38,9 +47,9 @@ public class Zsort
     }
   }
 
-  private int partition(Vector bonds, int p, int r)
+  private int partition(Vector<Bond> bonds, int p, int r)
   {
-    float x = ((Bond) bonds.elementAt(p)).start[2];
+    float x = bonds.elementAt(p).start[2];
     int i = p - 1;
     int j = r + 1;
     Bond tmp;
@@ -49,17 +58,16 @@ public class Zsort
       do
       {
         j--;
-      } while ((j >= 0) && (((Bond) bonds.elementAt(j)).start[2] > x));
+      } while ((j >= 0) && (bonds.elementAt(j).start[2] > x));
 
       do
       {
         i++;
-      } while ((i < bonds.size())
-              && (((Bond) bonds.elementAt(i)).start[2] < x));
+      } while ((i < bonds.size()) && (bonds.elementAt(i).start[2] < x));
 
       if (i < j)
       {
-        tmp = (Bond) bonds.elementAt(i);
+        tmp = bonds.elementAt(i);
         bonds.setElementAt(bonds.elementAt(j), i);
         bonds.setElementAt(tmp, j);
       }