Classes

Class	Line #	Total Statements	Complexity	TOTAL Coverage	Actions
ChangeCaseCommand	28	36	23	0.00%	Show methods

Class ChangeCaseCommand

Class ChangeCaseCommand	Line # 28	Total Statements 36	Complexity 23	TOTAL Coverage 0.00%
ChangeCaseCommand(String,SequenceI[],List<int[]>,int)   ChangeCaseCommand(String,SequenceI[],List<int[]>,int)	4444	5.05	1.01	0.0 0.00%
getDescription() : String   getDescription() : String	5454	1.01	1.01	0.0 0.00%
getSize() : int   getSize() : int	5959	1.01	1.01	0.0 0.00%
doCommand(AlignmentI[]) : void   doCommand(AlignmentI[]) : void	6464	1.01	1.01	0.0 0.00%
undoCommand(AlignmentI[]) : void   undoCommand(AlignmentI[]) : void	6969	1.01	1.01	0.0 0.00%
changeCase(boolean) : void   changeCase(boolean) : void	7474	27.027	18.018	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.commands;
22
23		import jalview.datamodel.AlignmentI;
24		import jalview.datamodel.SequenceI;
25
26		import java.util.List;
27
		0% Uncovered Elements: 60 (60) Complexity: 23 Complexity Density: 0.64
28		public class ChangeCaseCommand implements CommandI
29		{
30		String description;
31
32		public static int TO_LOWER = 0;
33
34		public static int TO_UPPER = 1;
35
36		public static int TOGGLE_CASE = 2;
37
38		int caseChange = -1;
39
40		SequenceI[] seqs;
41
42		List<int[]> regions;
43
		0% Uncovered Elements: 5 (5) Complexity: 1 Complexity Density: 0.2
44	0	public ChangeCaseCommand(String description, SequenceI[] seqs,...
45		List<int[]> regions, int caseChange)
46		{
47	0	this.description = description;
48	0	this.seqs = seqs;
49	0	this.regions = regions;
50	0	this.caseChange = caseChange;
51	0	doCommand(null);
52		}
53
		0% Uncovered Elements: 1 (1) Complexity: 1 Complexity Density: 1
54	0	public String getDescription()...
55		{
56	0	return description;
57		}
58
		0% Uncovered Elements: 1 (1) Complexity: 1 Complexity Density: 1
59	0	public int getSize()...
60		{
61	0	return 1;
62		}
63
		0% Uncovered Elements: 1 (1) Complexity: 1 Complexity Density: 1
64	0	public void doCommand(AlignmentI[] views)...
65		{
66	0	changeCase(true);
67		}
68
		0% Uncovered Elements: 1 (1) Complexity: 1 Complexity Density: 1
69	0	public void undoCommand(AlignmentI[] views)...
70		{
71	0	changeCase(false);
72		}
73
		0% Uncovered Elements: 45 (45) Complexity: 18 Complexity Density: 0.67
74	0	void changeCase(boolean doCommand)...
75		{
76	0	String sequence;
77	0	int start, end;
78	0	char nextChar;
79	0	for (int[] r : regions)
80		{
81	0	start = r[0];
82	0	for (int s = 0; s < seqs.length; s++)
83		{
84	0	sequence = seqs[s].getSequenceAsString();
85	0	StringBuffer newSeq = new StringBuffer();
86
87	0	if (r[1] > sequence.length())
88		{
89	0	end = sequence.length();
90		}
91		else
92		{
93	0	end = r[1];
94		}
95
96	0	if (start > 0)
97		{
98	0	newSeq.append(sequence.substring(0, start));
99		}
100
101	0	if ((caseChange == TO_UPPER && doCommand)
102		|| (caseChange == TO_LOWER && !doCommand))
103		{
104	0	newSeq.append(sequence.substring(start, end).toUpperCase());
105		}
106
107	0	else if ((caseChange == TO_LOWER && doCommand)
108		|| (caseChange == TO_UPPER && !doCommand))
109		{
110	0	newSeq.append(sequence.substring(start, end).toLowerCase());
111		}
112
113		else
114		// TOGGLE CASE
115		{
116	0	for (int c = start; c < end; c++)
117		{
118	0	nextChar = sequence.charAt(c);
119	0	if ('a' <= nextChar && nextChar <= 'z')
120		{
121		// TO UPPERCASE !!!
122	0	nextChar -= ('a' - 'A');
123		}
124	0	else if ('A' <= nextChar && nextChar <= 'Z')
125		{
126		// TO LOWERCASE !!!
127	0	nextChar += ('a' - 'A');
128		}
129	0	newSeq.append(nextChar);
130		}
131		}
132
133	0	if (end < sequence.length())
134		{
135	0	newSeq.append(sequence.substring(end));
136		}
137
138	0	seqs[s].setSequence(newSeq.toString());
139		}
140		}
141		}
142
143		}