软件测试homework 3

Posted 2020-09-04

tags:

篇首语：本文由小常识网(cha138.com)小编为大家整理，主要介绍了软件测试homework 3相关的知识，希望对你有一定的参考价值。

1. 基于Junit 及Eclemma （jacoco ）实现一个主路径覆盖的测试

package cn.scs.st;

public class PrintPrime {
    public static String printPrimes (int n) 
    { 
        int MAXPRIMES = 10;
        int curPrime; // Value currently considered for primeness 
        int numPrimes; // Number of primes found so far. 
        boolean isPrime; // Is curPrime prime? 
        int [] primes = new int [MAXPRIMES]; // The list of prime numbers. 
        // Initialize 2 into the list of primes. 
        primes [0] = 2; 
        numPrimes = 1; 
        curPrime = 2; 
        while (numPrimes < n) 
        { 
            curPrime++; // next number to consider ... 
            isPrime = true; 
            for (int i = 0; i <= numPrimes-1; i++) 
            { // for each previous prime. 
                if (curPrime%primes[i]==0) 
                { // Found a divisor, curPrime is not prime. 
                    isPrime = false; 
                    break; // out of loop through primes. 
                } 
            } 
            if (isPrime) 
            { // save it! 
                primes[numPrimes] = curPrime; 
                numPrimes++; 
            } 
        } // End while 

        // Print all the primes out. 
        String s = null;
        for (int i = 0; i <= numPrimes-1; i++) 
        { 
            System.out.println ("Prime: " + primes[i]); 
            s += primes[i];
        } 
        return s;
    } // end printPrimes
    
    
}

printprime

全覆盖测试

package cn.scs.test;

import static org.junit.Assert.*;

import org.junit.Before;
import org.junit.Test;

import cn.scs.st.PrintPrime;

public class test {
    public PrintPrime prime;
    
    @Before
    public void setUp(){
        prime = new PrintPrime();
    }
    
    @Test
    public void testCase(){
        
        assertEquals("null235711", prime.printPrimes(5));
    }


}