Classes

Class	Line #	Total Statements	Complexity	TOTAL Coverage	Actions
MathUtils	23	3	2	1.0100%	Show methods

Class MathUtils

Class MathUtils	Line # 23	Total Statements 3	Complexity 2	TOTAL Coverage 1.0100%
gcd(int,int) : int   gcd(int,int) : int	3333	3.03	2.02	1.0 1.0100%

 

Contributing tests

Contributing tests

Select all

	Test contribution	Test	Result	Actions
	1.0	jalview.io.CrossRef2xmlTests.openCrossrefsForEnsemblTwicejalview.io.CrossRef2xmlTests.openCrossrefsForEnsemblTwice	1PASS
	1.0	jalview.analysis.AlignmentUtilsTests.testTransferGeneLocijalview.analysis.AlignmentUtilsTests.testTransferGeneLoci	1PASS
	1.0	jalview.util.MathUtilsTest.testGcdjalview.util.MathUtilsTest.testGcd	1PASS
	1.0	jalview.util.MapListTest.testTraversejalview.util.MapListTest.testTraverse	1PASS

 

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
		100% Uncovered Elements: 0 (6) Complexity: 2 Complexity Density: 0.67
23		public class MathUtils
24		{
25
26		/**
27		* Returns the greatest common divisor of two integers
28		*
29		* @param a
30		* @param b
31		* @return
32		*/
		100% Uncovered Elements: 0 (5) Complexity: 2 Complexity Density: 0.67
33	71	public static int gcd(int a, int b)...
34		{
35	71	if (b == 0)
36		{
37	32	return Math.abs(a);
38		}
39	39	return gcd(b, a % b);
40		}
41
42		}