X-Git-Url: http://source.jalview.org/gitweb/?a=blobdiff_plain;f=src%2Fjalview%2Fdatamodel%2FRangeIterator.java;h=aa8528277413a374d13cd3f29d93cec346fa426e;hb=a7169b1c72607f3c9357195b4999869650a2a891;hp=2c5d949c931dd4136f1cbd9f59e2a67552abda8d;hpb=ea2e22f20579b0ca244583058a291d0fcffbf6d5;p=jalview.git
diff --git a/src/jalview/datamodel/RangeIterator.java b/src/jalview/datamodel/RangeIterator.java
index 2c5d949..aa85282 100644
--- a/src/jalview/datamodel/RangeIterator.java
+++ b/src/jalview/datamodel/RangeIterator.java
@@ -1,3 +1,23 @@
+/*
+ * 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.
+ *
+ * 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 .
+ * The Jalview Authors are detailed in the 'AUTHORS' file.
+ */
package jalview.datamodel;
import java.util.ArrayList;
@@ -5,88 +25,86 @@ import java.util.Iterator;
import java.util.List;
/**
- * An iterator which iterates over regions in a range. Works with a copy of the
- * collection of regions.
+ * An iterator which iterates over a list of ranges. Works with a copy of the
+ * collection of ranges.
*/
public class RangeIterator implements Iterator
{
- // current index in regionsList
+ // current index in rangeList
private int currentPosition = 0;
- // current column in regionsList
- private int[] currentRegion;
+ // current range in rangeList
+ private int[] currentRange;
- // local copy or reference to regionsList
- private List localRegions;
+ // local copy or reference to rangeList
+ private List localRanges;
/**
* Unbounded constructor
*
- * @param regionsList
- * list of regions to iterate over
+ * @param rangeList
+ * list of ranges to iterate over
*/
- RangeIterator(List regionsList)
+ RangeIterator(List rangeList)
{
- if (!regionsList.isEmpty())
+ if (!rangeList.isEmpty())
{
- int last = regionsList.get(regionsList.size() - 1)[1];
- init(0, last, regionsList);
+ int last = rangeList.get(rangeList.size() - 1)[1];
+ init(0, last, rangeList);
}
else
{
- init(0, 0, regionsList);
+ init(0, 0, rangeList);
}
}
/**
- * Construct an iterator over regionsList bounded at [lowerBound,upperBound]
+ * Construct an iterator over rangeList bounded at [lowerBound,upperBound]
*
* @param lowerBound
* lower bound to iterate from
* @param upperBound
* upper bound to iterate to
- * @param regionsList
- * list of regions to iterate over
+ * @param rangeList
+ * list of ranges to iterate over
*/
- RangeIterator(int lowerBound, int upperBound,
- List regionsList)
+ RangeIterator(int lowerBound, int upperBound, List rangeList)
{
- init(lowerBound, upperBound, regionsList);
+ init(lowerBound, upperBound, rangeList);
}
/**
- * Construct an iterator over regionsList bounded at [lowerBound,upperBound]
+ * Construct an iterator over rangeList bounded at [lowerBound,upperBound]
*
* @param lowerBound
* lower bound to iterate from
* @param upperBound
* upper bound to iterate to
*/
- private void init(int lowerBound, int upperBound,
- List regionsList)
+ private void init(int lowerBound, int upperBound, List rangeList)
{
int start = lowerBound;
int end = upperBound;
- if (regionsList != null)
+ if (rangeList != null)
{
- localRegions = new ArrayList<>();
+ localRanges = new ArrayList<>();
- // iterate until a region overlaps with [start,end]
+ // iterate until a range overlaps with [start,end]
int i = 0;
- while ((i < regionsList.size()) && (regionsList.get(i)[1] < start))
+ while ((i < rangeList.size()) && (rangeList.get(i)[1] < start))
{
i++;
}
- // iterate from start to end, adding each region. Positions are
- // absolute, and all regions which *overlap* [start,end] are added.
- while (i < regionsList.size() && (regionsList.get(i)[0] <= end))
+ // iterate from start to end, adding each range. Positions are
+ // absolute, and all ranges which *overlap* [start,end] are added.
+ while (i < rangeList.size() && (rangeList.get(i)[0] <= end))
{
- int[] rh = regionsList.get(i);
+ int[] rh = rangeList.get(i);
int[] cp = new int[2];
System.arraycopy(rh, 0, cp, 0, rh.length);
- localRegions.add(cp);
+ localRanges.add(cp);
i++;
}
}
@@ -95,20 +113,20 @@ public class RangeIterator implements Iterator
@Override
public boolean hasNext()
{
- return (localRegions != null) && (currentPosition < localRegions.size());
+ return (localRanges != null) && (currentPosition < localRanges.size());
}
@Override
public int[] next()
{
- currentRegion = localRegions.get(currentPosition);
+ currentRange = localRanges.get(currentPosition);
currentPosition++;
- return currentRegion;
+ return currentRange;
}
@Override
public void remove()
{
- localRegions.remove(--currentPosition);
+ localRanges.remove(--currentPosition);
}
}