try
{
LOCK.readLock().lock();
- int fpos = seq.getStart();
- int lpos = seq.getEnd();
int start = 0;
if (hiddenColumns == null || hiddenColumns.size() == 0)
{
- int ifpos = seq.findIndex(fpos) - 1;
- int ilpos = seq.findIndex(lpos) - 1;
+ int ifpos = seq.findIndex(seq.getStart()) - 1;
+ int ilpos = seq.findIndex(seq.getEnd()) - 1;
return new int[] { ifpos, ifpos, ilpos };
}
// Simply walk along the sequence whilst watching for hidden column
// boundaries
Iterator<int[]> regions = iterator();
- int spos = fpos;
+ int spos = seq.getStart();
int hideStart = seq.getLength();
int hideEnd = -1;
int visPrev = 0;
int firstP = -1;
int lastP = -1;
boolean foundStart = false;
- for (int p = 0, pLen = seq.getLength(); spos <= seq.getEnd()
- && p < pLen; p++)
+ for (int p = 0; spos <= seq.getEnd() && p < seq.getLength(); p++)
{
if (!Comparison.isGap(seq.getCharAt(p)))
{
{
if (!foundStart)
{
- fpos = spos;
start = p;
foundStart = true;
}
- lpos = spos;
}
// look for next sequence position
spos++;