2018-2019-20175334实验三《敏捷开发与XP实践》实验报告

亦凉 2021-11-23 04:02 155阅读 0赞

# 2018-2019-20175334实验三《敏捷开发与XP实践》实验报告 #

## 一、实验内容及步骤 ##

### 实验三 敏捷开发与XP实践-1 ###

*  实验三 敏捷开发与XP实践 http://www.cnblogs.com/rocedu/p/4795776.html, Eclipse的内容替换成IDEA
 *  参考 http://www.cnblogs.com/rocedu/p/6371315.html\#SECCODESTANDARD 安装alibaba 插件，解决代码中的规范问题。
 *  在IDEA中使用工具（Code->Reformate Code）把下面代码重新格式化，再研究一下Code菜单，找出一项让自己感觉最好用的功能。提交截图，加上自己学号水印。
 *      public class CodeStandard { public static void main(String [] args){ StringBuffer buffer = new StringBuffer(); buffer.append('S'); buffer.append("tringBuffer"); System.out.println(buffer.charAt(1)); System.out.println(buffer.capacity()); System.out.println(buffer.indexOf("tring")); System.out.println("buffer = " + buffer.toString()); if(buffer.capacity()<20) buffer.append("1234567"); for(int i=0; i<buffer.length();i++) System.out.println(buffer.charAt(i)); } }
 *  安装alibaba插件  
    ![1591528-20190429162509629-843178827.png][]
 *  重启IDEA后，在代码中右击点击··编码规约扫描··  
    ![1591528-20190429162623401-1383446506.png][]
 *  规范后代码

/** * CodeStandard * * @author 16487 * @date 2019/4/28 */ public class CodeStandard { public static void main(String[] args) { StringBuffer buffer = new StringBuffer(); buffer.append('S'); buffer.append("tringBuffer"); System.out.println(buffer.charAt(1)); System.out.println(buffer.capacity()); System.out.println(buffer.indexOf("tring")); System.out.println("buffer = " + buffer.toString()); int n = 20; if (buffer.capacity() < n){ buffer.append("1234567"); } for (int i = 0; i < buffer.length(); i++){ System.out.println(buffer.charAt(i)); } } }

*  Code菜单中我认为好用的功能：
    
     *  `Surround With` （使用if-else、for、while等语句包装代码段)） `Ctrl+Alt+T`  
        ![1591528-20190429163420582-268558386.png][]
     *  `Comment with Line Comment` （ 行注释 ） `Ctrl + /`  
        ![1591528-20190429163504818-514157901.png][]

### 实验三 敏捷开发与XP实践-2 ###

*  在码云上把自己的学习搭档加入自己的项目中，确认搭档的项目加入自己后，下载搭档实验二的Complex代码，加入不少于三个JUnit单元测试用例，测试成功后git add .; git commit -m "自己学号 添加内容"；git push;
 *  提交搭档项目git log的截图，包含上面git commit的信息，并加上自己的学号水印信息。
 *  在码云上把自己的学习搭档加入自己的项目中并下载学习搭档的代码  
    ![1591528-20190429163800569-1191187556.png][]  
    ![1591528-20190429163809948-985057480.png][]
 *  加入不少于三个`JUnit`单元测试用例并测试  
    ![1591528-20190429163917016-1431142331.png][]
 *  上传至码云  
    ![1591528-20190429164013488-1513127901.png][]  
    ![1591528-20190429164019492-986192976.png][]
 *  代码：

/** * @Author 16487 */ public class lyxComplex { double a,b; lyxComplex(double m,double n){//构造函数设置实部虚部 a=m; b=n; } public double getRealPart(){//返回实部 return a; } public double getImagePart() {//返回虚部 return b; } public lyxComplex ComplexAdd(lyxComplex y){//加法 double m=y.getRealPart(); double n=y.getImagePart(); double x=a+m; double z=b+n; return new lyxComplex(x,z); } public lyxComplex ComplexSub(lyxComplex y){ double m=y.getRealPart(); double n=y.getImagePart(); double x=a-m; double z=b-n; return new lyxComplex(x,z); } public lyxComplex ComplexMulti(lyxComplex y){ double m=y.getRealPart(); double n=y.getImagePart(); double x=a*m; double z=b*n; return new lyxComplex(x,z); } public lyxComplex ComplexDiv(lyxComplex y){ double m=y.getRealPart(); double n=y.getImagePart(); double x=a/m; double z=b/n; return new lyxComplex(x,z); } @Override public java.lang.String toString() { String s=""; if (a!=0&&b>0&&b!=1){ s+= a+"+"+ b+"i"; } else if(a!=0&&b==1){ s+=a+"+i"; } else if (a!=0&&b<0&&b!=-1){ s+= a+""+b+"i"; } else if (a!=0&&b==-1){ s+=a+"-i"; } else if (a!=0&&b==0){ s+=a; } else if (a==0&&b!=0){ s+=b+"i"; } else if (a==0&&b==0){ s+="0.0"; } return s; } }

/** * @Author 16487 */ import junit.framework.TestCase; import org.junit.Test; public class lyxComplexTest extends TestCase { lyxComplex a=new lyxComplex(0,0); lyxComplex b=new lyxComplex(1,1); lyxComplex c=new lyxComplex(-1,-1); lyxComplex d=new lyxComplex(20.16,53.10); lyxComplex e=new lyxComplex(2,3); @Test public void testgetReal(){ assertEquals(0.0,a.getRealPart()); assertEquals(-1.0,c.getRealPart()); assertEquals(20.16,d.getRealPart()); } @Test public void testgetIma(){ assertEquals(0.0,a.getImagePart()); assertEquals(-1.0,c.getImagePart()); assertEquals(53.1,d.getImagePart()); } @Test public void testComAdd(){ assertEquals("0.0",b.ComplexAdd(c).toString()); assertEquals("1.0+i",a.ComplexAdd(b).toString()); assertEquals("19.16+52.1i",c.ComplexAdd(d).toString()); assertEquals("-1.0-i",a.ComplexAdd(c).toString()); assertEquals("21.16+54.1i",b.ComplexAdd(d).toString()); assertEquals("20.16+53.1i",a.ComplexAdd(d).toString()); } @Test public void testComSub(){ assertEquals("1.0+i",b.ComplexSub(a).toString()); assertEquals("-21.16-54.1i",c.ComplexSub(d).toString()); assertEquals("2.0+2.0i",b.ComplexSub(c).toString()); assertEquals("-1.0-i",a.ComplexSub(b).toString()); } @Test public void testComMul(){ assertEquals("0.0",a.ComplexMulti(d).toString()); assertEquals("-1.0-i",b.ComplexMulti(c).toString()); assertEquals("-20.16-53.1i",c.ComplexMulti(d).toString()); assertEquals("40.32+159.3i",d.ComplexMulti(e).toString()); assertEquals("1.0+i",b.ComplexMulti(b).toString()); } @Test public void testComDiv(){ assertEquals("0.0",a.ComplexDiv(b).toString()); assertEquals("-1.0-i",c.ComplexDiv(b).toString()); assertEquals("-0.5-0.3333333333333333i",c.ComplexDiv(e).toString()); assertEquals("10.08+17.7i",d.ComplexDiv(e).toString()); assertEquals("20.16+53.1i",d.ComplexDiv(b).toString()); } }

### 实验三 敏捷开发与XP实践-3 ###

*  实验三 敏捷开发与XP实践 http://www.cnblogs.com/rocedu/p/4795776.html, Eclipse的内容替换成IDEA
 *  完成重构内容的练习，下载搭档的代码，至少进行三项重构，提交重构后代码的截图，加上自己的学号水印。提交搭档的码云项目链接。
 *  问题一：所有的类都必须添加创建者信息
 *  按照格式，添加作者和日期  
    ![1591528-20190429164902507-1699348504.png][]
 *  问题二：类、类属性、类方法必须用javadoc规范
 *  将注释格式改为`/**内容*/`  
    ![1591528-20190429165007310-1563141510.png][]
 *  问题三：方法名、参数名、成员变量、局部变量没有遵从驼峰形式
 *  将要修改的变量单击右键，`Refactor->Rename`进行重命名  
    ![1591528-20190429165049138-1289015195.png][]
 *  上传至码云  
    ![1591528-20190429165124704-727667438.png][]
 *  代码：

/** * Complex class * * @Author 16487 * @date 2019/4/29 */ public class lyxcomplex { double a,b; lyxcomplex(double m, double n){/**构造函数设置实部虚部*/ a=m; b=n; } public double getRealPart(){//返回实部 return a; } public double getImagePart() {/**返回虚部*/ return b; } public lyxcomplex complexAdd(lyxcomplex y){/**加法*/ double m=y.getRealPart(); double n=y.getImagePart(); double x=a+m; double z=b+n; return new lyxcomplex(x,z); } public lyxcomplex complexSub(lyxcomplex y){/**减法*/ double m=y.getRealPart(); double n=y.getImagePart(); double x=a-m; double z=b-n; return new lyxcomplex(x,z); } public lyxcomplex complexMulti(lyxcomplex y){/**乘法*/ double m=y.getRealPart(); double n=y.getImagePart(); double x=a*m; double z=b*n; return new lyxcomplex(x,z); } public lyxcomplex complexDiv(lyxcomplex y){/**除法*/ double m=y.getRealPart(); double n=y.getImagePart(); double x=a/m; double z=b/n; return new lyxcomplex(x,z); } @Override public java.lang.String toString() { String s=""; if (a!=0&&b>0&&b!=1){ s+= a+"+"+ b+"i"; } else if(a!=0&&b==1){ s+=a+"+i"; } else if (a!=0&&b<0&&b!=-1){ s+= a+""+b+"i"; } else if (a!=0&&b==-1){ s+=a+"-i"; } else if (a!=0&&b==0){ s+=a; } else if (a==0&&b!=0){ s+=b+"i"; } else if (a==0&&b==0){ s+="0.0"; } return s; } }

/** * Complex class * * @Author 16487 * @date 2019/4/29 */ import junit.framework.TestCase; import org.junit.Test; public class lyxcomplexTest extends TestCase { lyxcomplex a=new lyxcomplex(0,0); lyxcomplex b=new lyxcomplex(1,1); lyxcomplex c=new lyxcomplex(-1,-1); lyxcomplex d=new lyxcomplex(20.16,53.10); lyxcomplex e=new lyxcomplex(2,3); @Test public void testgetReal(){ assertEquals(0.0,a.getRealPart()); assertEquals(-1.0,c.getRealPart()); assertEquals(20.16,d.getRealPart()); } @Test public void testgetIma(){ assertEquals(0.0,a.getImagePart()); assertEquals(-1.0,c.getImagePart()); assertEquals(53.1,d.getImagePart()); } @Test public void testComAdd(){ assertEquals("0.0",b.complexAdd(c).toString()); assertEquals("1.0+i",a.complexAdd(b).toString()); assertEquals("19.16+52.1i",c.complexAdd(d).toString()); assertEquals("-1.0-i",a.complexAdd(c).toString()); assertEquals("21.16+54.1i",b.complexAdd(d).toString()); assertEquals("20.16+53.1i",a.complexAdd(d).toString()); } @Test public void testComSub(){ assertEquals("1.0+i",b.complexSub(a).toString()); assertEquals("-21.16-54.1i",c.complexSub(d).toString()); assertEquals("2.0+2.0i",b.complexSub(c).toString()); assertEquals("-1.0-i",a.complexSub(b).toString()); } @Test public void testComMul(){ assertEquals("0.0",a.complexMulti(d).toString()); assertEquals("-1.0-i",b.complexMulti(c).toString()); assertEquals("-20.16-53.1i",c.complexMulti(d).toString()); assertEquals("40.32+159.3i",d.complexMulti(e).toString()); assertEquals("1.0+i",b.complexMulti(b).toString()); } @Test public void testComDiv(){ assertEquals("0.0",a.complexDiv(b).toString()); assertEquals("-1.0-i",c.complexDiv(b).toString()); assertEquals("-0.5-0.3333333333333333i",c.complexDiv(e).toString()); assertEquals("10.08+17.7i",d.complexDiv(e).toString()); assertEquals("20.16+53.1i",d.complexDiv(b).toString()); } }

## [我的代码托管][Link 1] ##

## [学习搭档的代码托管][Link 2] ##

### 实验三 敏捷开发与XP实践-4 ###

*  参考 http://www.cnblogs.com/rocedu/p/6683948.html，以结对的方式完成Java密码学相关内容的学习，结合重构，git,代码标准。
 *  提交学习成果码云链接和代表性成果截图，要有学号水印。
 *  凯撒密码的加密算法极其简单。其加密过程如下：
 *  在这里，我们做此约定：明文记为m，密文记为c，加密变换记为E(k1,m)（其中k1为密钥），解密变换记为D(k2,m)（k2为解密密钥）（在这里k1=k2,不妨记为k）。凯撒密码的加密过程可记为如下一个变换：c≡m+k mod n （其中n为基本字符个数）；同样，解密过程可表示为：m≡c+k mod n （其中n为基本字符个数）
 *  代码：

/** * @Author 16487 */ import java.util.Scanner; public class Caesar { public String path; public String estr=""; public char c; public static void main(String[] args) { Caesar c=new Caesar(); System.out.println("1.加密"); System.out.println("2.解密"); System.out.println("你要进行的操作："); int num; Scanner scanner=new Scanner(System.in); num=scanner.nextInt(); System.out.println("情输入你要进行操作的字符串"); c.path=scanner.next(); int n; Scanner scan=new Scanner(System.in); System.out.println("情输入秘钥"); n=scan.nextInt(); if(num==1) { c.jiami(c.path, n); System.out.println("加密过后的字符串为："+c.estr); } else { c.jiemi(c.path, n); System.out.println("解密过后的内容为："+c.estr); } } public void jiami(String key,int n) { for(int i=0;i<key.length();i++) { c=key.charAt(i); if(c>='A'&&c<='Z') { if(c+n%26<='Z') { estr+=(char)(c+n%26); } else { estr+=(char)('A'+((n-('Z'-c)-1)%26)); } } else if(c>='a'&&c<='z') { if(c+n%26<='z') { estr+=(char)(c+n%26); } else { estr+=(char)('a'+((n-('z'-c)-1)%26)); } } else if(c>='0'&&c<='9') { if(c+n%10<='9') { estr+=(char)(c+n%10); } else { estr+=(char)('0'+((n-('9'-c)-1)%10)); } } else { estr+=c; } } } public void jiemi(String key,int n) { for(int i=0;i<key.length();i++) { c=key.charAt(i); if(c>='A'&&c<='Z') { if(c-n%26>='A') { estr+=(char)(c-n%26); } else { estr+=(char)('Z'-((n-(c-'A')-1)%26)); } } else if(c>='a'&&c<='z') { if(c-n%26>='a') { estr+=(char)(c-n%26); } else { estr+=(char)('z'-((n-(c-'a')-1)%26)); } } else if(c>='0'&&c<='9') { if(c-n%10>='0') { estr+=(char)(c-n%10); } else { estr+=(char)('9'-((n-(c-'0')-1)%10)); } } else { estr+=c; } } } }

*  运行结果：  
    ![1591528-20190505122001942-118495029.png][]  
    ![1591528-20190505122008605-1775704706.png][]

## 二、心得体会 ##

*  本次实验教会了我如何写出更加规范的代码，还让我了解到了`code`中的功能，并掌握了几个实用的功能
 *  密码学算法部分对其他课程很有帮助

转载于:https://www.cnblogs.com/lxr1006/p/10791293.html

[1591528-20190429162509629-843178827.png]: /images/20211122/2671a56cb4394530bbaedcf45035a20c.png
[1591528-20190429162623401-1383446506.png]: /images/20211122/69e9fd6c80824ab995f1b90cebaafd43.png
[1591528-20190429163420582-268558386.png]: /images/20211122/9f3eb072c50d485dae4f502f533fee3f.png
[1591528-20190429163504818-514157901.png]: /images/20211122/e64a5681e2204a1a9d3e2daa5cbea1c7.png
[1591528-20190429163800569-1191187556.png]: /images/20211122/2e535a867e014df1b1ec56d2b15ab338.png
[1591528-20190429163809948-985057480.png]: /images/20211122/c421200911004428b28e867831055dc7.png
[1591528-20190429163917016-1431142331.png]: /images/20211122/92b0148ecd7c4fc6a9b6491203ddb6ab.png
[1591528-20190429164013488-1513127901.png]: /images/20211122/49b73239ab3643d489b230ab6f790c3f.png
[1591528-20190429164019492-986192976.png]: /images/20211122/e44b09e97f0041658ee4fd39f59643d6.png
[1591528-20190429164902507-1699348504.png]: /images/20211122/b85c06faa4f7436aa7db76bbcdf704e1.png
[1591528-20190429165007310-1563141510.png]: /images/20211122/7cf4a6e0c43b484d9598aafea5f38e8b.png
[1591528-20190429165049138-1289015195.png]: /images/20211122/7bdd882280e24605b78014b08658cf2b.png
[1591528-20190429165124704-727667438.png]: /images/20211122/e839a1412f864154812776821e01ad83.png
[Link 1]: https://gitee.com/lxr175334/java2017/tree/master/20175334exp3/src
[Link 2]: https://gitee.com/lyx-hhhhh/20175326java/tree/master/%E5%AE%9E%E9%AA%8C%E4%B8%89
[1591528-20190505122001942-118495029.png]: /images/20211122/15a5a5b3b4134d79bc66a0b30b7b940e.png
[1591528-20190505122008605-1775704706.png]: /images/20211122/ae297911f91a4f318a47f8e3a462b7b6.png