Classes

Class	Line #	Total Statements	Complexity	TOTAL Coverage	Actions
Zsort	25	20	9	0.00%	Show methods

Class Zsort

Class Zsort	Line # 25	Total Statements 20	Complexity 9	TOTAL Coverage 0.00%
sort(Vector<Bond>) : void   sort(Vector<Bond>) : void	3333	1.01	1.01	0.0 0.00%
sort(Vector<Bond>,int,int) : void   sort(Vector<Bond>,int,int) : void	3838	5.05	2.02	0.0 0.00%
partition(Vector<Bond>,int,int) : int   partition(Vector<Bond>,int,int) : int	5050	14.014	6.06	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 mc_view;
22
23		import java.util.Vector;
24
		0% Uncovered Elements: 31 (31) Complexity: 9 Complexity Density: 0.45
25		public class Zsort
26		{
27		/**
28		* Sorts the Bond list in ascending order of the z-value of the bond start
29		* atom
30		*
31		* @param bonds
32		*/
		0% Uncovered Elements: 1 (1) Complexity: 1 Complexity Density: 1
33	0	public void sort(Vector<Bond> bonds)...
34		{
35	0	sort(bonds, 0, bonds.size() - 1);
36		}
37
		0% Uncovered Elements: 7 (7) Complexity: 2 Complexity Density: 0.4
38	0	public void sort(Vector<Bond> bonds, int p, int r)...
39		{
40	0	int q;
41
42	0	if (p < r)
43		{
44	0	q = partition(bonds, p, r);
45	0	sort(bonds, p, q);
46	0	sort(bonds, q + 1, r);
47		}
48		}
49
		0% Uncovered Elements: 20 (20) Complexity: 6 Complexity Density: 0.43
50	0	private int partition(Vector<Bond> bonds, int p, int r)...
51		{
52	0	float x = bonds.elementAt(p).start[2];
53	0	int i = p - 1;
54	0	int j = r + 1;
55	0	Bond tmp;
56	0	while (true)
57		{
58	0	do
59		{
60	0	j--;
61	0	} while ((j >= 0) && (bonds.elementAt(j).start[2] > x));
62
63	0	do
64		{
65	0	i++;
66	0	} while ((i < bonds.size()) && (bonds.elementAt(i).start[2] < x));
67
68	0	if (i < j)
69		{
70	0	tmp = bonds.elementAt(i);
71	0	bonds.setElementAt(bonds.elementAt(j), i);
72	0	bonds.setElementAt(tmp, j);
73		}
74		else
75		{
76	0	return j;
77		}
78		}
79		}
80		}