Classes

Class	Line #	Total Statements	Complexity	TOTAL Coverage	Actions
ArrayUtils	27	21	11	0.00%	Show methods

Class ArrayUtils

Class ArrayUtils	Line # 27	Total Statements 21	Complexity 11	TOTAL Coverage 0.00%
reverseIntArray(int[]) : void   reverseIntArray(int[]) : void	3434	6.06	3.03	0.0 0.00%
concatArrays(T[]) : T[]   concatArrays(T[]) : T[]	5252	8.08	4.04	0.0 0.00%
concatTwoArrays(T[],T[]) : T[]   concatTwoArrays(T[],T[]) : T[]	6767	3.03	1.01	0.0 0.00%
indexOf(Object[],Object) : int   indexOf(Object[],Object) : int	8585	4.04	3.03	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.util;
22
23		import java.util.Arrays;
24
25		import java.util.Objects;
26
		0% Uncovered Elements: 39 (39) Complexity: 11 Complexity Density: 0.52
27		public class ArrayUtils
28		{
29		/**
30		* Reverse the given array 'in situ'
31		*
32		* @param arr
33		*/
		0% Uncovered Elements: 10 (10) Complexity: 3 Complexity Density: 0.5
34	0	public static void reverseIntArray(int[] arr)...
35		{
36	0	if (arr != null)
37		{
38		/*
39		* swap [k] with [end-k] up to the half way point in the array
40		* if length is odd, the middle entry is left untouched by the excitement
41		*/
42	0	int last = arr.length - 1;
43	0	for (int k = 0; k < arr.length / 2; k++)
44		{
45	0	int temp = arr[k];
46	0	arr[k] = arr[last - k];
47	0	arr[last - k] = temp;
48		}
49		}
50		}
51
		0% Uncovered Elements: 14 (14) Complexity: 4 Complexity Density: 0.5
52	0	public static <T> T[] concatArrays(T[]... arrays)...
53		{
54	0	if (arrays == null)
55	0	return null;
56	0	if (arrays.length == 1)
57	0	return arrays[0];
58
59	0	T[] result = arrays[0];
60	0	for (int i = 1; i < arrays.length; i++)
61		{
62	0	result = concatTwoArrays(result, arrays[i]);
63		}
64	0	return result;
65		}
66
		0% Uncovered Elements: 3 (3) Complexity: 1 Complexity Density: 0.33
67	0	private static <T> T[] concatTwoArrays(T[] array1, T[] array2)...
68		{
69	0	T[] result = Arrays.copyOf(array1, array1.length + array2.length);
70	0	System.arraycopy(array2, 0, result, array1.length, array2.length);
71	0	return result;
72		}
73
74
75		/**
76		* Return the index of the first occurrence of the item in the array or -1 if
77		* the array doesn't contain the item.
78		*
79		* @param arr
80		* array to be searched
81		* @param item
82		* item to search for
83		* @return index of the first occurrence of the item or -1 if not found
84		*/
		0% Uncovered Elements: 8 (8) Complexity: 3 Complexity Density: 0.75
85	0	public static int indexOf(Object[] arr, Object item)...
86		{
87	0	for (int i = 0; i < arr.length; i++)
88		{
89	0	if (Objects.equals(arr[i], item))
90	0	return i;
91		}
92	0	return -1;
93		}
94		}