Classes

Class	Line #	Total Statements	Complexity	TOTAL Coverage	Actions
ArrayUtils	25	17	8	0.866666786.7%	Show methods

Class ArrayUtils

Class ArrayUtils	Line # 25	Total Statements 17	Complexity 8	TOTAL Coverage 0.866666786.7%
reverseIntArray(int[]) : void   reverseIntArray(int[]) : void	3232	6.06	3.03	1.0 1.0100%
concatArrays(T[]) : T[]   concatArrays(T[]) : T[]	5050	8.08	4.04	0.71428573 0.7142857371.4%
concatTwoArrays(T[],T[]) : T[]   concatTwoArrays(T[],T[]) : T[]	6565	3.03	1.01	1.0 1.0100%

 

Contributing tests

Contributing tests

Select all

	Test contribution	Test	Result	Actions
	0.36666667	jalview.util.ArrayUtilsTest.testReverseIntArrayjalview.util.ArrayUtilsTest.testReverseIntArray	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
23		import java.util.Arrays;
24
		86.7% Uncovered Elements: 4 (30) Complexity: 8 Complexity Density: 0.47
25		public class ArrayUtils
26		{
27		/**
28		* Reverse the given array 'in situ'
29		*
30		* @param arr
31		*/
		100% Uncovered Elements: 0 (10) Complexity: 3 Complexity Density: 0.5
32	4	public static void reverseIntArray(int[] arr)...
33		{
34	4	if (arr != null)
35		{
36		/*
37		* swap [k] with [end-k] up to the half way point in the array
38		* if length is odd, the middle entry is left untouched by the excitement
39		*/
40	3	int last = arr.length - 1;
41	7	for (int k = 0; k < arr.length / 2; k++)
42		{
43	4	int temp = arr[k];
44	4	arr[k] = arr[last - k];
45	4	arr[last - k] = temp;
46		}
47		}
48		}
49
		71.4% Uncovered Elements: 4 (14) Complexity: 4 Complexity Density: 0.5
50	4	public static <T> T[] concatArrays(T[]... arrays)...
51		{
52	4	if (arrays == null)
53	0	return null;
54	4	if (arrays.length == 1)
55	0	return arrays[0];
56
57	4	T[] result = arrays[0];
58	9	for (int i = 1; i < arrays.length; i++)
59		{
60	5	result = concatTwoArrays(result, arrays[i]);
61		}
62	4	return result;
63		}
64
		100% Uncovered Elements: 0 (3) Complexity: 1 Complexity Density: 0.33
65	5	private static <T> T[] concatTwoArrays(T[] array1, T[] array2)...
66		{
67	5	T[] result = Arrays.copyOf(array1, array1.length + array2.length);
68	5	System.arraycopy(array2, 0, result, array1.length, array2.length);
69	5	return result;
70		}
71
72		}