score.h

学生成绩管理系统质量高而且本站没有的源码

#include  <iostream>
#include  <cstdlib>
#include   <stdlib.h>   
#include   <stdio.h> 
#include <string>

using namespace std;

struct Data
{  CString number;
   CString name;
   CString average;
   CString middle;
   CString final;
   CString result;
};
class Score;
class ScoreNode
{
public:
	Data data;
	ScoreNode *next;
	ScoreNode *prior;
friend class Score ;//Score是score的友元类

public:
	// ConsScoreNode(CString name,CString average,CString middle,CString final,CString Nresult,ScoreNode newnode);
};

class Score
{public:
   
   Score();       //链表构造函数
   ~Score();      //链表析构函数
   void  Erase(); //链表清空 
   int GetLength();  //获取链表长度
   bool IsEmpty()const;   //判断是否为空
   bool Find(int k,Data& x)const;//查找
  // int Search(CString x)const;//返回链表序号
   int Score::Searchname(CString x)const;
   int Score::Searchnumber(CString x)const;
   //Score &Delete(int k,Data& x);//按序号删除节点
   Score &Insert(int k,const Data& x);//指定位置插入节点
   Score& Score::Delete(int k);
   //void output(ostream& out)const;//输出链表
   //void output();
   //friend ostream& operator<<(ostream& out,const Data& x);//运算符重载
	void Score::Product(ScoreNode *newnode,int i);
	ScoreNode* Score::Gethead();
	ScoreNode* Score::GetEnd();
	ScoreNode* Score::Getscorenode(int k);
//void Score::Swap(ScoreNode &a,ScoreNode &b);
void Score::ordernumber(int k);
int Score::tongji(int m);
bool Score::save(int i,int m,int n);
private:
    ScoreNode* head;
	ScoreNode* end;

	//ScoreNode *prior;  //前项指针
   //ScoreNode *next;   //后项指针
   int length;   //链表长度
};