X-Git-Url: http://source.jalview.org/gitweb/?a=blobdiff_plain;f=src%2Fjalview%2Fws%2Fjws2%2FJabaParamStore.java;h=65f939a8419c1a3500a421e8cc10657185099285;hb=7ab5d6b0ba5fec1ea4a4239e79c476d841622485;hp=ec504ddb97cfb99e2a326eb6e1bb194c13c67d2c;hpb=3737b35aa75cf9ba9203a244de45008fb0794bc4;p=jalview.git diff --git a/src/jalview/ws/jws2/JabaParamStore.java b/src/jalview/ws/jws2/JabaParamStore.java index ec504dd..65f939a 100644 --- a/src/jalview/ws/jws2/JabaParamStore.java +++ b/src/jalview/ws/jws2/JabaParamStore.java @@ -1,19 +1,22 @@ /* - * Jalview - A Sequence Alignment Editor and Viewer (Version 2.8) - * Copyright (C) 2012 J Procter, AM Waterhouse, LM Lui, J Engelhardt, G Barton, M Clamp, S Searle + * Jalview - A Sequence Alignment Editor and Viewer (Version 2.8.2) + * Copyright (C) 2014 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 . + * You should have received a copy of the GNU General Public License + * along with Jalview. If not, see . + * The Jalview Authors are detailed in the 'AUTHORS' file. */ package jalview.ws.jws2; @@ -180,6 +183,14 @@ public class JabaParamStore implements ParamDatastoreI ArgumentI[] rgssort = rgs.toArray(new ArgumentI[rgs.size()]); String[] rgssorton = rgnames.toArray(new String[rgs.size()]); jalview.util.QuickSort.sort(rgssorton, rgssort); + ArgumentI tmp1; + int i = 0; + while (rgssort.length - i > i) + { + tmp1 = rgssort[rgssort.length - i - 1]; + rgssort[rgssort.length - i - 1] = rgssort[i]; + rgssort[i++] = tmp1; + } return Arrays.asList(rgssort); }