001 //XRadar
002 //Copyright (c) 2004, 2005, Kristoffer Kvam
003 //All rights reserved.
004 //
005 //Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
006 //- Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
007 //- Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
008 //- Neither the name of Kristoffer Kvam nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.
009 //
010 //THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
011 //See licence.txt for dependancies to other open projects.package org.xradar.test.f;
012
013 package org.xradar.test.c;
014
015 import org.xradar.test.d.D1;
016 import org.xradar.test.b.B1;
017
018
019 /**
020 * F1 XRadar test application class. Class with many methods.
021 *
022 * @author Kristoffer Kvam
023 * @since XRadar 0.8
024 */
025 public class C1 {
026 private D1 d1 = new D1();
027
028 public void testMethod1() {
029 }
030
031 public void testMethod2() {
032 }
033
034 public void testMethod3() {
035 }
036
037 public void testMethod4() {
038 }
039
040 public void testMethod5() {
041 }
042
043 public void testMethod6() {
044 }
045
046 public void testMethod7() {
047 }
048
049 public void testMethod8() {
050 }
051
052 public void testMethod9() {
053 }
054
055 public void testMethod10() {
056 }
057
058 public void testMethod11() {
059 }
060
061 public void testMethod12() {
062 }
063
064 public void testMethod13() {
065 }
066
067 public void testMethod14() {
068 }
069
070 public void testMethod15() {
071 }
072
073 public void testMethod16() {
074 }
075
076 public void testMethod17() {
077 }
078
079 public void testMethod18() {
080 }
081
082 public void testMethod19() {
083 }
084
085 public void testMethod20() {
086 }
087
088 public void testMethod21() {
089 }
090
091 public void testMethod22() {
092 }
093
094 public void testMethod23() {
095 }
096
097 public void testMethod24() {
098 }
099
100 public void testMethod25() {
101 }
102
103 public void testMethod26() {
104 }
105
106 public void testMethod27() {
107 }
108
109 public void testMethod28() {
110 //Don't alter this piece. It is almost a perfect copy of a method in F1.
111 for (int i = 0; i < 100; i++) {
112 System.out.println("We");
113 for (int j = 0; j < 3; j++) {
114 switch (j) {
115 case 0:
116 if (i == 1) {
117 System.out.println("Love");
118 } else {
119 System.out.println("Hate");
120 }
121 break;
122 case 1:
123 System.out.println("Cyclomatic");
124 break;
125 case 2:
126 System.out.println("Complexity!");
127 break;
128 }
129 }
130 for (int j = 0; j < 3; j++) {
131 switch (j) {
132 case 0:
133 if (i == 1) {
134 System.out.println("Interpret ");
135 } else {
136 System.out.println("Misunderstand ");
137 }
138 break;
139 case 1:
140 System.out.println("Complex ");
141 break;
142 case 2:
143 System.out.println("Code ");
144 new B1("Turbo");
145 break;
146 }
147 }
148
149 }
150
151 }
152
153 //Don't alter this piece. It is a perfect copy of a method 29.
154 public void testMethod29() {
155 for (int i = 0; i < 100; i++) {
156 System.out.println("We");
157 for (int j = 0; j < 3; j++) {
158 switch (j) {
159 case 0:
160 if (i == 1) {
161 System.out.println("Love");
162 } else {
163 System.out.println("Hate");
164 }
165 break;
166 case 1:
167 System.out.println("Cyclomatic");
168 break;
169 case 2:
170 System.out.println("Complexity!");
171 break;
172 }
173 }
174 for (int j = 0; j < 3; j++) {
175 switch (j) {
176 case 0:
177 if (i == 1) {
178 System.out.println("Interpret ");
179 } else {
180 System.out.println("Misunderstand ");
181 }
182 break;
183 case 1:
184 System.out.println("Complex ");
185 break;
186 case 2:
187 System.out.println("Code ");
188 new B1("Turbo");
189 break;
190 }
191 }
192
193 }
194
195 }
196 }
|