Calculator 代码
包括 加减乘除 求余、求模、比较大小、最大公约数、最小公倍数
package .edu.ciir;public class Calculator {public int result=0;public int n1;public int n2;public int getResult() {return result;}public int getN1() {return n1;}public void setN1(int n1) {this.n1 = n1;}public int getN2() {return n2;}public void setN2(int n2) {this.n2 = n2;}//两个数相加public void add(int n1, int n2){this.result=n1+n2;}//两个数相减public void sub(){this.result=this.n1-this.n2;}//两个数相乘public void mul(){this.result=this.n1*this.n2;}//两个数相除public void div(){this.result=this.n1/this.n2;}//求余public void qiuyu(){this.result=n1%n2;}//取模支持对负数进行运算，且结果的符号总是与被除数的符号保持一致public void qiumo(){this.result=(this.n1)/(this.n2);}//比较两个整数的大小public int getmax(){return this.n1>this.n2?this.n1:this.n2;}//求两个整数的最大公约数public int Biggestgongyue(int a,int b){if(a>b){int temp=a;a=b;b=temp;}if(b%a==0)return a;else return Biggestgongyue(a,b%a);}//求两个数的最小公倍数public int gongbei(int a,int b) { return (a*b)/this.Biggestgongyue(a,b); } }
Test case 代码
package .edu.ciir;import junit.framework.TestCase;//import static org.junit.Assert.*;//import junit.framework.TestCase;import .edu.ciir.Calculator;import .edu.ciir.Sample2;public class CalculatorTest extends TestCase {Calculator cal=new Calculator();public void test相加后整数溢出() {try {cal.add(2147483640, 8);fail("2147483640和8相加后，会导致整数溢出，" +"函数应该检测到这个问题并抛出异常通知!");} catch (ArithmeticException e) {}}public void testAddtrue(){//cal.setN1(3);//cal.setN2(4);cal.add(3,4);assertEquals(7,cal.getResult());}public void testAddfalse(){//cal.setN1(3);//cal.setN2(4);cal.add(3,4);assertEquals(8,cal.getResult());}public void testsubtruet(){cal.setN1(7);cal.setN2(4);cal.sub();assertEquals(3,cal.getResult());}public void testsubfalse(){cal.setN1(7);cal.setN2(4);cal.sub();assertEquals(4,cal.getResult());}public void testmultrue(){cal.setN1(7);cal.setN2(4);cal.mul();assertEquals(28,cal.getResult());}public void testmulfalse(){cal.setN1(7);cal.setN2(4);cal.mul();assertEquals(29,cal.getResult());}public void testdivtrue(){cal.setN1(28);cal.setN2(4);cal.div();assertEquals(7,cal.getResult());}public void testdivfalse(){cal.setN1(28);cal.setN2(4);cal.div();assertEquals(8,cal.getResult());}public void testqiuyutrue(){cal.setN1(28);cal.setN2(3);cal.qiuyu();assertEquals(1,cal.getResult());}public void testqiuyufalse(){cal.setN1(28);cal.setN2(3);cal.qiuyu();assertEquals(2,cal.getResult());}public void testqiumotrue(){cal.setN1(28);cal.setN2(3);cal.qiumo();assertEquals(9,cal.getResult());}public void testqiumofalse(){cal.setN1(28);cal.setN2(3);cal.qiumo();assertEquals(8,cal.getResult());}public void testgetMaxtrue(){cal.setN1(28);cal.setN2(3);cal.getmax();assertEquals(28,cal.getmax());}public void testgetmax1false(){cal.setN1(28);cal.setN2(3);cal.getmax();assertEquals(3,cal.getmax());}public void testBiggestgongyuetrue(){cal.setN1(28);cal.setN2(4);assertEquals(4,cal.Biggestgongyue(cal.getN1(),cal.getN2()));}public void testBiggestgongyuefalse(){cal.setN1(28);cal.setN2(4);assertEquals(3,cal.Biggestgongyue(cal.getN1(),cal.getN2()));}public void testgongbeitrue(){cal.setN1(28);cal.setN2(4);cal.Biggestgongyue(cal.getN1(),cal.getN2());assertEquals(28,cal.gongbei(cal.getN1(),cal.getN2()));}public void testgongbeifalse(){cal.setN1(28);cal.setN2(4);cal.Biggestgongyue(cal.getN1(),cal.getN2());assertEquals(29,cal.gongbei(cal.getN1(),cal.getN2()));}}
