Classes

Class	Line #	Total Statements	Complexity	TOTAL Coverage	Actions
RangeElementsIterator	34	19	10	0.00%	Show methods

Class RangeElementsIterator

Class RangeElementsIterator	Line # 34	Total Statements 19	Complexity 10	TOTAL Coverage 0.00%
RangeElementsIterator(Iterator<int[]>)   RangeElementsIterator(Iterator<int[]>)	4646	5.05	2.02	0.0 0.00%
hasNext() : boolean   hasNext() : boolean	5757	1.01	1.01	0.0 0.00%
next() : Integer   next() : Integer	6363	6.06	2.02	0.0 0.00%
checkNextRange() : void   checkNextRange() : void	8585	6.06	4.04	0.0 0.00%
remove() : void   remove() : void	103103	1.01	1.01	0.0 0.00%

 

Contributing tests

Source view

1		/*
2		* Jalview - A Sequence Alignment Editor and Viewer ($$Version-Rel$$)
3		* Copyright (C) $$Year-Rel$$ The Jalview Authors
4		*
5		* This file is part of Jalview.
6		*
7		* Jalview is free software: you can redistribute it and/or
8		* modify it under the terms of the GNU General Public License
9		* as published by the Free Software Foundation, either version 3
10		* of the License, or (at your option) any later version.
11		*
12		* Jalview is distributed in the hope that it will be useful, but
13		* WITHOUT ANY WARRANTY; without even the implied warranty
14		* of MERCHANTABILITY or FITNESS FOR A PARTICULAR
15		* PURPOSE. See the GNU General Public License for more details.
16		*
17		* You should have received a copy of the GNU General Public License
18		* along with Jalview. If not, see <http://www.gnu.org/licenses/>.
19		* The Jalview Authors are detailed in the 'AUTHORS' file.
20		*/
21		package jalview.datamodel;
22
23		import java.util.Iterator;
24		import java.util.NoSuchElementException;
25
26		/**
27		* Iterator over each element in a set of ranges i.e. if ranges is {[3,6],
28		* [12,15]} it will iterate over {3,4,5,6,12,13,14,15}. Uses a local copy of the
29		* set of ranges.
30		*
31		* @author kmourao
32		*
33		*/
		0% Uncovered Elements: 32 (32) Complexity: 10 Complexity Density: 0.53
34		public class RangeElementsIterator implements Iterator<Integer>
35		{
36		private int last;
37
38		private int current;
39
40		private int next;
41
42		private Iterator<int[]> rangeIterator;
43
44		private int[] nextRange = null;
45
		0% Uncovered Elements: 7 (7) Complexity: 2 Complexity Density: 0.4
46	0	RangeElementsIterator(Iterator<int[]> it)...
47		{
48	0	rangeIterator = it;
49	0	if (rangeIterator.hasNext())
50		{
51	0	nextRange = rangeIterator.next();
52	0	next = nextRange[0];
53	0	last = nextRange[1];
54		}
55		}
56
		0% Uncovered Elements: 1 (1) Complexity: 1 Complexity Density: 1
57	0	@Override...
58		public boolean hasNext()
59		{
60	0	return rangeIterator.hasNext() || next <= last;
61		}
62
		0% Uncovered Elements: 8 (8) Complexity: 2 Complexity Density: 0.33
63	0	@Override...
64		public Integer next()
65		{
66	0	if (!hasNext())
67		{
68	0	throw new NoSuchElementException();
69		}
70
71	0	current = next;
72
73		// recalculate next
74	0	next++;
75
76		// if there are more ranges need to check if next is in a range
77	0	checkNextRange();
78	0	return current;
79		}
80
81		/**
82		* Check how next position relates to next range, and update next position if
83		* necessary
84		*/
		0% Uncovered Elements: 10 (10) Complexity: 4 Complexity Density: 0.67
85	0	private void checkNextRange()...
86		{
87	0	if (nextRange != null && next > nextRange[1])
88		{
89	0	if (rangeIterator.hasNext())
90		{
91	0	nextRange = rangeIterator.next();
92	0	next = nextRange[0];
93	0	last = nextRange[1];
94		}
95		else
96		{
97	0	nextRange = null;
98		}
99
100		}
101		}
102
		0% Uncovered Elements: 1 (1) Complexity: 1 Complexity Density: 1
103	0	@Override...
104		public void remove()
105		{
106	0	throw new UnsupportedOperationException();
107		}
108		}