Classes

Class	Line #	Total Statements	Complexity	TOTAL Coverage	Actions
IntRangeComparator	29	3	3	1.0100%	Show methods

Class IntRangeComparator

Class IntRangeComparator	Line # 29	Total Statements 3	Complexity 3	TOTAL Coverage 1.0100%
IntRangeComparator(boolean)   IntRangeComparator(boolean)	3939	1.01	1.01	1.0 1.0100%
compare(int[],int[]) : int   compare(int[],int[]) : int	4444	2.02	2.02	1.0 1.0100%

 

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.util;
22
23		import java.util.Comparator;
24
25		/**
26		* A comparator to order [from, to] ranges into ascending or descending order of
27		* their start position
28		*/
		100% Uncovered Elements: 0 (7) Complexity: 3 Complexity Density: 1
29		public class IntRangeComparator implements Comparator<int[]>
30		{
31		public static final Comparator<int[]> ASCENDING = new IntRangeComparator(
32		true);
33
34		public static final Comparator<int[]> DESCENDING = new IntRangeComparator(
35		false);
36
37		boolean forwards;
38
		100% Uncovered Elements: 0 (1) Complexity: 1 Complexity Density: 1
39	2	IntRangeComparator(boolean forward)...
40		{
41	2	forwards = forward;
42		}
43
		100% Uncovered Elements: 0 (4) Complexity: 2 Complexity Density: 1
44	13	@Override...
45		public int compare(int[] o1, int[] o2)
46		{
47	13	int compared = Integer.compare(o1[0], o2[0]);
48	13	return forwards ? compared : -compared;
49		}
50
51		}