/*
- * Jalview - A Sequence Alignment Editor and Viewer (Version 2.8.2)
- * Copyright (C) 2014 The Jalview Authors
+ * Jalview - A Sequence Alignment Editor and Viewer ($$Version-Rel$$)
+ * Copyright (C) $$Year-Rel$$ 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 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;
* @author JimP
*
*/
-public class SeqGroupIndexVector extends InputType implements
- AlignmentProcessor
+public class SeqGroupIndexVector extends InputType
+ implements AlignmentProcessor
{
public SeqGroupIndexVector()
{
- super(new Class[]
- { AlignmentI.class });
+ super(new Class[] { AlignmentI.class });
}
/**
// assume that alignment is properly ordered so groups form consecutive
// blocks
ArrayList<int[]> gl = new ArrayList<int[]>();
- int p = 0,lowest=al.getHeight(), highest=0;
+ int p = 0, lowest = al.getHeight(), highest = 0;
List<SequenceGroup> sgs;
synchronized (sgs = al.getGroups())
{
{
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)
for (SequenceI sq : sg.getSequencesInOrder(al))
{
p = al.findIndex(sq);
- if (lowest>p)
+ if (lowest > p)
{
- lowest=p;
+ lowest = p;
}
- if (highest<p)
+ if (highest < p)
{
- highest=p;
+ highest = p;
}
if (se == null)
{
- se = new int[]
- { p, p };
+ se = new int[] { p, p };
}
else
{
// remaining group ? - these might be at the start or the end
if (gl.size() > 0)
{
- if (lowest-1>minsize)
+ if (lowest - 1 > minsize)
{
- gl.add(0, new int[]
- { 0, lowest-2});
+ gl.add(0, new int[] { 0, lowest - 2 });
}
- if ((al.getHeight()-1-highest)>minsize)
+ if ((al.getHeight() - 1 - highest) > minsize)
{
- gl.add(new int[] { highest+1, al.getHeight()-1});
+ 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)
{
return true;
} catch (Exception x)
{
- warnings.append("Invalid molecule type '" + val
- + "'. Must be one of (");
+ warnings.append(
+ "Invalid molecule type '" + val + "'. Must be one of (");
for (molType v : molType.values())
{
warnings.append(" " + v);