Soft Engineering: Pair Programming

Twinning partner school number	201831061428
Twinning partner's name	Zhongyi Xuan
Partner blog address	Blog
Github Address	git

PSP table

PSP2.1	Personal Software Process Stages	Estimated time consuming (minutes)	The actual time-consuming (minutes)
Planning	plan	30	60
Estimate	Estimate how much time this task requires	40	30
Development	Develop	200	200
Analysis	Needs analysis (including learning new technologies)	50	40
Design Spec	Generate design documents	20	20
Design Review	Design review (and colleagues reviewed the design documents)	25	25
Coding Standard	Code specifications (development of appropriate norms for the current development)	15	15
Design	Specific design	100	80
Coding	Specific coding	600	630
Code Review	Code Review	25	20
Test	Test (self-test, modify the code, submit modifications)	30	50
Reporting	report	30	20
Test Report	testing report	25	30
Size Measurement	Computing workload	30	20
Postmortem & Process Improvement Plan	Hindsight, and propose process improvements meter	40	50
	total	1220	1290

We encountered many difficulties, but also spent a lot of time trying to overcome. Although not perfect, but we really tried.

Discussions

Design and implementation process

Code design process is as follows:

Code

#include<iostream>
#include<string>
#include<cstring>
#include<stdlib.h> 
#include<ctype.h>
#include<fstream>
#define N 20
using namespace std;
/*定义结构体*/
typedef struct wenjian{
    char data[N];
    int shu;
    struct wenjian *zuo;
    struct wenjian *you;
}wenjian,*bwenjian;
class Word{//定义一个词汇的类 
public:
    Word();
    int get_word(int start, int end, char* p, char* word);
    void create_wenjian(char* m, bwenjian& b);
    void Order(bwenjian b, FILE* q);
    int sum;
    int j;
    int i;
    char liang[N];
    char liang1[N];
    char word[N];
    char fwen[20];
    
};
/*初始化*/
Word::Word()
{
    sum = 0;
    j = 0;
    i = 0;
}
/*定义获取单词数的函数*/
int Word::get_word(int start, int end, char* p, char* word)
{
    memset(word, 0, sizeof(char));
    for (  i = start; i<end; i++)//使用循环读取文件 
    {
        if (isalpha(p[i]))
        {
            word[j] = p[i];
            j++;
        }
        else if (j == 0)
        {
            continue;
        }
        else
        {
            word[j] = '\0';
            j = 0;
            sum++;
            break;
        }
    }
    return i;
}
/*查找函数*/
void Word::create_wenjian(char* m, bwenjian& b)
{
    strcpy(liang, m);
    liang[0] = tolower(m[0]);
    if (b == NULL)
    {
        b = (bwenjian)malloc(sizeof(wenjian));//创建堆栈
        strcpy(b->data, m);
        b->shu = 1;
        b->zuo = NULL;
        b->you = NULL;
    }
    else
    {
        strcpy(liang1, b->data);
        liang1[0] = tolower(b->data[0]);
        if (strcmp(liang, liang1) == -1)
        {
            create_wenjian(m, b->zuo);
        }
        else if (strcmp(liang, liang1) == 1)
        {
            create_wenjian(m, b->you);
        }
        else
        {
            b->shu++;
        }
    }
}
/*写入文件*/
void Word::Order(bwenjian b, FILE* q)
{
    if (b != NULL)
    {
        Order(b->zuo, q);
        fprintf(q, "world：%-10s 次数:%-9d\n", b->data, b->shu);
        printf("world：%-10s 次数:%-9d\n", b->data, b->shu);
        Order(b->you, q);
    }
}
int main()
{
    Word w;//定义Word的类
    while (true)
    {
        memset(w.fwen, 0, sizeof(w.fwen));
        cout << "请输入你想打开的函数" << endl;
        cin >> w.fwen;
        FILE *q;  
        q=fopen(w.fwen,"rb");
        if (q==NULL)
        {
            cout << "打开文件失败！" << endl;
            return false;
        }
        cout << "已打开！" << w.fwen << endl;
        //开始进行文件统计 
        fseek(q, 0, SEEK_END);
        int len = ftell(q);
        rewind(q);
        char *p = new char[len + 1];
        p[len] = 0;
        fread(p, 1, len, q);
        fclose(q);
        cout << p << endl;
        bwenjian b = NULL;
        while (w.i<len)
        {
            w.i = w.get_word(w.i, len, p, w.word);
            if (strlen(w.word) == 0)
            {
                break;
            }
            w.create_wenjian(w.word, b);
        }
        memset(w.fwen, 0, sizeof(w.fwen));
       cout<<"\n"<<"请输入写你想存储的文件: "<<endl;
        cin >> w.fwen;
        q=fopen(w.fwen,"w");
        if (q == NULL)
        {
            cout << "不能写入文件" << endl;
            return false;
        }
        fprintf(q, "词频统计结果: \n");
        cout<<"词频统计结果:\n"<<endl;
        fprintf(q, "\n");
        w.Order(b,q);
        fprintf(q, "\n");
        fprintf(q, "world总数: %d\n", w.sum);
        printf("world总数：%d\n", w.sum);
        fclose(q);
        cout<<"\n" << "已写入文件:" << w.fwen << endl;
    }
    return 0;
}

Code Description

(Running test and results)

to sum up

Work hard ah! ! We spent a lot of time, and students work together in order to be barely complete, and students work together, sweat together, together, pay harvest, really good experience, but the difficulty of the job is too big! ! Submitted also encountered a lot of trouble. Fortunately, and companion in a bedroom, with everyone knocking Code, study together how to pay, if not a bedroom, communication is inconvenient, we could die. Luckily, or pay before the job ended up, after the hope that I can be and students to work together.