X-Git-Url: http://source.jalview.org/gitweb/?a=blobdiff_plain;f=src%2Fjalview%2Fws%2Frest%2Fparams%2FSeqGroupIndexVector.java;h=823b907ac77e422593770421cda6288686223057;hb=d9c7868a610eff29a8eddb160b6dc78a94a72470;hp=766720b1d808083a41595575280d433bcb92754b;hpb=ad20cd92225f2ee8c251d39b00b90555d382a616;p=jalview.git diff --git a/src/jalview/ws/rest/params/SeqGroupIndexVector.java b/src/jalview/ws/rest/params/SeqGroupIndexVector.java index 766720b..823b907 100644 --- a/src/jalview/ws/rest/params/SeqGroupIndexVector.java +++ b/src/jalview/ws/rest/params/SeqGroupIndexVector.java @@ -1,25 +1,29 @@ /* - * 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.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 . + * 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.rest.params; import jalview.datamodel.AlignmentI; import jalview.datamodel.SequenceGroup; import jalview.datamodel.SequenceI; +import jalview.util.MessageManager; import jalview.ws.params.OptionI; import jalview.ws.params.simple.IntegerParameter; import jalview.ws.params.simple.Option; @@ -49,8 +53,7 @@ public class SeqGroupIndexVector extends InputType implements { public SeqGroupIndexVector() { - super(new Class[] - { AlignmentI.class }); + super(new Class[] { AlignmentI.class }); } /** @@ -88,7 +91,7 @@ public class SeqGroupIndexVector extends InputType implements // assume that alignment is properly ordered so groups form consecutive // blocks ArrayList gl = new ArrayList(); - int p = 0; + int p = 0, lowest = al.getHeight(), highest = 0; List sgs; synchronized (sgs = al.getGroups()) { @@ -96,8 +99,12 @@ public class SeqGroupIndexVector extends InputType implements { if (sg.getSize() < minsize) { - throw new NoValidInputDataException("Group contains less than " - + minsize + " sequences."); + throw new NoValidInputDataException( + MessageManager + .formatMessage( + "exception.notvaliddata_group_contains_less_than_min_seqs", + new String[] { Integer.valueOf(minsize) + .toString() })); } // TODO: refactor to sequenceGroup for efficiency - // getAlignmentRowInterval(AlignmentI al) @@ -105,10 +112,17 @@ public class SeqGroupIndexVector extends InputType implements for (SequenceI sq : sg.getSequencesInOrder(al)) { p = al.findIndex(sq); + if (lowest > p) + { + lowest = p; + } + if (highest < p) + { + highest = p; + } if (se == null) { - se = new int[] - { p, p }; + se = new int[] { p, p }; } else { @@ -128,46 +142,18 @@ public class SeqGroupIndexVector extends InputType implements // remaining group ? - these might be at the start or the end if (gl.size() > 0) { - int[] tail = gl.get(0); - if (tail[0] > 0) + if (lowest - 1 > minsize) { - if (1 + tail[0] > minsize) - { - gl.add(0, new int[] - { 0, tail[0] - 1 }); - } - else - { - // lets be intelligent here - if the remaining sequences aren't enough - // to make a final group, then don't make one. - // throw new - // NoValidInputDataException("Group from remaining ungrouped sequences in input contains less than "+minsize+" sequences."); - } + gl.add(0, new int[] { 0, lowest - 2 }); } - else + if ((al.getHeight() - 1 - highest) > minsize) { - tail = gl.get(gl.size() - 1); - if (1 + tail[1] < al.getHeight()) - { - if (al.getHeight() - (1 + tail[1]) > minsize) - { - gl.add(new int[] - { tail[1] + 1, al.getHeight() - 1 }); - } - else - { - // lets be intelligent here - if the remaining sequences aren't - // enough to make a final group, then don't make one. - // throw new - // NoValidInputDataException("Group from remaining ungrouped sequences in input contains less than "+minsize+" sequences."); - } - } + gl.add(new int[] { highest + 1, al.getHeight() - 1 }); } } else { - gl.add(new int[] - { 0, al.getHeight() - 1 }); + gl.add(new int[] { 0, al.getHeight() - 1 }); } if (min >= 0 && gl.size() < min) { @@ -293,8 +279,8 @@ public class SeqGroupIndexVector extends InputType implements List lst = getBaseOptions(); lst.add(new Option("sep", "Separator character between elements of vector", true, ",", - sep, Arrays.asList(new String[] - { " ", ",", ";", "\t", "|" }), null)); + sep, Arrays.asList(new String[] { " ", ",", ";", "\t", "|" }), + null)); lst.add(new IntegerParameter("minsize", "Minimum size of partition allowed by service", true, 1, minsize, 1, 0));