软件测试 覆盖部分作业

 1 /******************************************************* 
 2      * Finds and prints n prime integers 
 3      * Jeff Offutt, Spring 2003 
 4      ******************************************************/ 
 5     public static void printPrimes (int n) 
 6     { 
 7         int curPrime; // Value currently considered for primeness 
 8         int numPrimes; // Number of primes found so far. 
 9         boolean isPrime; // Is curPrime prime? 
10         int [] primes = new int [MAXPRIMES]; // The list of prime numbers. 
11         
12         // Initialize 2 into the list of primes. 
13         primes [0] = 2; 
14         numPrimes = 1; 
15         curPrime = 2; 
16         while (numPrimes < n) 
17         { 
18             curPrime++; // next number to consider ... 
19             isPrime = true; 
20             for (int i = 0; i <= numPrimes-1; i++) 
21             { // for each previous prime. 
22                 if (curPrime%primes[i]==0) 
23                 { // Found a divisor, curPrime is not prime. 
24                     isPrime = false; 
25                     break; // out of loop through primes. 
26                 } 
27             } 
28             if (isPrime) 
29             { // save it! 
30                 primes[numPrimes] = curPrime; 
31                 numPrimes++; 
32             } 
33         } // End while 
34         
35         // Print all the primes out. 
36         for (int i = 0; i <= numPrimes-1; i++) 
37         { 
38             System.out.println ("Prime: " + primes[i]); 
39         } 
40     } // end printPrimes

 1 //Triangle.java
 2 import java.util.Arrays;
 3 
 4 public class Triangle 
 5 {
 6     public String check( String p, String q, String r )
 7     {
 8         int[] a = new int[3];
 9         a[0] = Integer.parseInt(p);
10         a[1] = Integer.parseInt(q);
11         a[2] = Integer.parseInt(r);
12         Arrays.sort(a);
13         if ( a[0] + a[1] > a[2] )
14         {
15             if ( a[0] == a[2] )
16             {
17                 return "equilateral";
18             }
19             else
20             {
21                 if ( a[0] == a[1] || a[1] == a[2] )
22                 {
23                     return"isosceles";
24                 }
25                 else
26                 {
27                     return "scalene";
28                 }
29             }
30         }
31         else
32         {
33             return "not a triangle";
34         }
35     }
36 }

 1 import static org.junit.Assert.*;
 2 import java.util.Arrays;
 3 import java.util.Collection;
 4 import org.junit.Before;
 5 import org.junit.Test;
 6 import org.junit.runner.RunWith;
 7 import org.junit.runners.Parameterized;
 8 import org.junit.runners.Parameterized.Parameters;
 9 
10 @RunWith(Parameterized.class)
11 public class TriangleTest 
12 {
13     private String p;
14     private String q;
15     private String r;
16     private String expected;
17     private Triangle tmp;
18     
19     public TriangleTest( String p, String q, String r, String expected )
20     {
21         this.p = p;
22         this.q = q;
23         this.r = r;
24         this.expected = expected;
25     }
26 
27     @Before
28     public void setUp()
29     {
30         tmp = new Triangle();
31     }
32     
33     @Parameters
34     public static Collection<String[]> getData()
35     {
36         return Arrays.asList( new String[][]
37         {
38             { "3", "3", "3", "equilateral" },
39             { "3", "4", "4", "isosceles" },
40             { "3", "4", "5", "scalene" },
41             { "3", "4", "7", "not a triangle" },
42         });
43     }
44 
45     @Test
46     public void test() 
47     {
48         assertEquals( this.expected, tmp.check( p, q, r ) );
49     }
50 }