真不戳,基于C++泛型编程的职工管理系统

最新推荐文章于 2024-08-04 22:43:03 发布

2401_85124866

最新推荐文章于 2024-08-04 22:43:03 发布

阅读量674

点赞数 15

分类专栏：作者\/ 文章标签： c++ java 开发语言

本文链接：https://blog.csdn.net/2401_85124866/article/details/139251846

版权

作者\/ 专栏收录该内容

29 篇文章 0 订阅

订阅专栏

p = new node;

p->setnext(NULL);

}

delete p;

infile.close();

}

void addnode() {//-------------------------增

node* p, * q;

p = new node;

p->setnext(NULL);

cout << “请输入您要存储的数据:” << endl;

cin >> p->opedata();

q = head;

for (; q->getnext() != NULL; q = q->getnext()) {

if (q->getnext()->opedata() == p->opedata()) {

cout << “您输入的数据,已存在,不需要重复录入” << endl;

system(“pause”);

delete p;

return;

}

q->setnext§;

savelink();

cout << “存储成功！” << endl;

system(“pause”);

}

void delnode() {//---------------------------删

bool k = false;

node* p, * q, * r;

p = new node;

p->setnext(NULL);

cout << “请输入您要删除的数据” << endl;

cin >> p->opedata();

q = head;

for (; q->getnext() != NULL; q = q->getnext()) {

if (q->getnext()->opedata() == p->opedata() && q->getnext()->getnext() != NULL) {

r = q->getnext();

q->getnext() = q->getnext()->getnext();

delete r;

k = true;

break;

}

else if (q->getnext()->opedata() == p->opedata() && q->getnext()->getnext() == NULL) {

r = q->getnext();

delete r;

q->setnext(NULL);

k = true;

break;

}

if (k == false) {

cout << “没有找到您要删除的数据,请核实后再来！” << endl;

}

else if (k == true) {

savelink();

cout << “删除成功！” << endl;

}

delete p;

system(“pause”);

return;

}

void altenode() {//-------------------------------改

int judgecin = 0;

bool k = false;

node* p, * q, * r;

p = new node;

p->setnext(NULL);

cout << “请输入您要改动的数据” << endl;

judgecin = 1;

cin >> p->opedata();

judgecin = 0;

q = head;

for (; q->getnext() != NULL; q = q->getnext()) {

if (q->getnext()->opedata() == p->opedata()) {

cout << “请输入新的数据:” << endl;

rewrite:

cin >> p->opedata();

for (r = head; r->getnext() != NULL; r = r->getnext()) {

if (r->getnext()->opedata() == p->opedata() && p->opedata() != q->getnext()->opedata()) {

system(“cls”);

judgecin++;

if (judgecin == 3) {

cout << “您多次输入信息错误,请核实后再来,将要返回主菜单” << endl;

delete p;

system(“pause”);

return;

}

cout << “请输入您自己的身份信息！或输入新的身份证号” << endl;

goto rewrite;

}

q->getnext()->opedata() = p->opedata();

k = true;

}

if (k == true) {

savelink();

cout << “修改成功！” << endl;

}

else {

cout << “修改失败!没有找到该数据！” << endl;

}

delete p;

system(“pause”);

return;

}

void selnode() {//----------------------------------查

cout << “请输入您要查找的数据” << endl;

bool k = false;

node* p, * q;

p = new node;

p->setnext(NULL);

cin >> p->opedata();

for (q = head; q->getnext() != NULL; q = q->getnext()) {

if (q->getnext()->opedata() == p->opedata()) {

k = true;

cout << “您要查找的数据如下！” << endl;

cout << q->getnext()->opedata() << endl;

//break;

}

if (k == false) {

cout << “没有找到您要查找的数据！抱歉” << endl;

}

system(“pause”);

return;

}

void printlink() {//------------------------------打印链表

node* p;

sortlink();

for (p = head; p->getnext() != NULL; p = p->getnext()) {

cout << p->getnext()->opedata() << endl;

}

system(“pause”);

}

void sortlink() {//-------------------------------排序

node* p, * q;

if (head->getnext() == NULL) {

cout << “没有数据,无需排序!” << endl;

return;

}

if (head->getnext()->getnext() == NULL) {

cout << “一组数据,无需排序!” << endl;

return;

}

for (p = head->getnext(); p->getnext() != NULL; p = p->getnext()) {

for (q = p->getnext(); q != NULL; q = q->getnext()) {

if (q->opedata() > p->opedata()) {

node temp;

temp = *q;

*q = *p;

*p = temp;

temp.getnext() = q->getnext();

q->getnext() = p->getnext();

p->getnext() = temp.getnext();

}

void savelink() {//--------------------------------------存链表

ofstream outfile;

string classname;

node* p;

p = head;

classname = head->GetClass();

classname.erase(remove(classname.begin(), classname.end(), ‘<’), classname.end());

classname.erase(remove(classname.begin(), classname.end(), ‘>’), classname.end());

outfile.open(classname);

while (p->getnext() != NULL) {

p = p->getnext();

outfile << p->opedata() << endl;

}

outfile.close();

}

~link() {//--------------------------------------------销毁链表

node* p;

p = head->getnext();

while (p != NULL) {

delete head;

head = p;

p = p->getnext();

}

}//

};

四、运行截图

========================================================================

1.主菜单

在这里插入图片描述

2.查看信息

在这里插入图片描述

3.更换数据类型

将officer类型注释掉，使用int类型

在这里插入图片描述

4.再次显示所有信息【抛转】

可以看到就算将officer类型换为int类型,程序依旧可以稳定的运行。

这里打印职工信息系统的提示性语句出现到了这里,如果大家真的理解了泛型的思想

肯定可以轻而易举的改掉这处不足,有什么想法的小伙伴评论区留言博主吧。

在这里插入图片描述

五、源码

======================================================================

#include

using namespace std;

#include<windows.h>

#include<conio.h>

char off_menu();

class officer;

int mynum(string str) {//-----------------判断字符串是否全为数字

for (unsigned int i = 0; i < str.length(); i++) {

if (!isdigit(str[i])) {

return 1;

}

return 0;

}

template

class node {

private:

T data;

node* next;

public:

node() {

}

void setnext(node* p) {

if (p != NULL) {

next = new node;

next->data = p->opedata();

next->next = p->getnext();

}

else

next = p;

}

T& opedata() {

return data;

}

node*& getnext() {

return next;

}

const char* GetClass()

{

return typeid(*this).name();

}

};

template

class link {

private:

node* head;

public:

link() {

string classname;

ifstream infile;

node* p, * q;

p = new node;

p->setnext(NULL);

head = new node;

head->setnext(NULL);

q = head;

classname = head->GetClass();

classname.erase(remove(classname.begin(), classname.end(), ‘<’), classname.end());

classname.erase(remove(classname.begin(), classname.end(), ‘>’), classname.end());

//cout << classname << endl;

infile.open(classname);

while (infile >> p->opedata()) {

q->setnext§;

q = q->getnext();

p = new node;

p->setnext(NULL);

}

delete p;

infile.close();

}

void addnode() {//-------------------------增

node* p, * q;

p = new node;

p->setnext(NULL);

cout << “请输入您要存储的数据:” << endl;

cin >> p->opedata();

q = head;

for (; q->getnext() != NULL; q = q->getnext()) {

if (q->getnext()->opedata() == p->opedata()) {

cout << “您输入的数据,已存在,不需要重复录入” << endl;

system(“pause”);

delete p;

return;

}

q->setnext§;

savelink();

cout << “存储成功！” << endl;

system(“pause”);

}

void delnode() {//---------------------------删

bool k = false;

node* p, * q, * r;

p = new node;

p->setnext(NULL);

cout << “请输入您要删除的数据” << endl;

cin >> p->opedata();

q = head;

for (; q->getnext() != NULL; q = q->getnext()) {

if (q->getnext()->opedata() == p->opedata() && q->getnext()->getnext() != NULL) {

r = q->getnext();

q->getnext() = q->getnext()->getnext();

delete r;

k = true;

break;

}

else if (q->getnext()->opedata() == p->opedata() && q->getnext()->getnext() == NULL) {

r = q->getnext();

delete r;

q->setnext(NULL);

k = true;

break;

}

if (k == false) {

cout << “没有找到您要删除的数据,请核实后再来！” << endl;

}

else if (k == true) {

savelink();

cout << “删除成功！” << endl;

}

delete p;

system(“pause”);

return;

}

void altenode() {//-------------------------------改

int judgecin = 0;

bool k = false;

node* p, * q, * r;

p = new node;

p->setnext(NULL);

cout << “请输入您要改动的数据” << endl;

judgecin = 1;

cin >> p->opedata();

judgecin = 0;

q = head;

for (; q->getnext() != NULL; q = q->getnext()) {

if (q->getnext()->opedata() == p->opedata()) {

cout << “请输入新的数据:” << endl;

rewrite:

cin >> p->opedata();

for (r = head; r->getnext() != NULL; r = r->getnext()) {

if (r->getnext()->opedata() == p->opedata() && p->opedata() != q->getnext()->opedata()) {

system(“cls”);

judgecin++;

if (judgecin == 3) {

cout << “您多次输入信息错误,请核实后再来,将要返回主菜单” << endl;

delete p;

system(“pause”);

return;

}

cout << “请输入您自己的身份信息！或输入新的身份证号” << endl;

goto rewrite;

}

q->getnext()->opedata() = p->opedata();

k = true;

}

if (k == true) {

savelink();

cout << “修改成功！” << endl;

}

else {

cout << “修改失败!没有找到该数据！” << endl;

}

delete p;

system(“pause”);

return;

}

void selnode() {//----------------------------------查

cout << “请输入您要查找的数据” << endl;

bool k = false;

node* p, * q;

p = new node;

p->setnext(NULL);

cin >> p->opedata();

for (q = head; q->getnext() != NULL; q = q->getnext()) {

if (q->getnext()->opedata() == p->opedata()) {

k = true;

cout << “您要查找的数据如下！” << endl;

cout << q->getnext()->opedata() << endl;

//break;

}

if (k == false) {

cout << “没有找到您要查找的数据！抱歉” << endl;

}

system(“pause”);

return;

}

void printlink() {//------------------------------打印链表

node* p;

sortlink();

for (p = head; p->getnext() != NULL; p = p->getnext()) {

cout << p->getnext()->opedata() << endl;

}

system(“pause”);

}

void sortlink() {//-------------------------------排序

node* p, * q;

if (head->getnext() == NULL) {

cout << “没有数据,无需排序!” << endl;

return;

}

if (head->getnext()->getnext() == NULL) {

cout << “一组数据,无需排序!” << endl;

return;

}

for (p = head->getnext(); p->getnext() != NULL; p = p->getnext()) {

for (q = p->getnext(); q != NULL; q = q->getnext()) {

if (q->opedata() > p->opedata()) {

node temp;

temp = *q;

*q = *p;

*p = temp;

temp.getnext() = q->getnext();

q->getnext() = p->getnext();

p->getnext() = temp.getnext();

}

void savelink() {//--------------------------------------存链表

ofstream outfile;

string classname;

node* p;

p = head;

classname = head->GetClass();

classname.erase(remove(classname.begin(), classname.end(), ‘<’), classname.end());

classname.erase(remove(classname.begin(), classname.end(), ‘>’), classname.end());

outfile.open(classname);

while (p->getnext() != NULL) {

p = p->getnext();

outfile << p->opedata() << endl;

}

outfile.close();

}

~link() {//--------------------------------------------销毁链表

node* p;

p = head->getnext();

while (p != NULL) {

delete head;

head = p;

p = p->getnext();

}

}//

};

class officer

{

friend ostream& operator<<(ostream& out, officer& obj);

friend istream& operator>>(istream& in, officer& obj);

friend ofstream& operator<<(ofstream& outfile, officer& obj);//--------输出到文件

friend ifstream& operator>>(ifstream& infile, officer& obj);//---------读取文件

private:

string id_card;

string name;

string sex;

int age;

string post;

int money;

public://---------------------------------私有属性管理方法

officer() {

id_card = “”;

name = “”;

sex = “”;

age = 0;

post = “”;

money = 0;

}

officer(officer& obj) {

this->id_card = obj.getid();

this->name = obj.getname();

this->sex = obj.getsex();

this->age = obj.getage();

this->money = obj.getmoney();

this->post = obj.getpost();

}

officer& operator=(officer& obj) {

this->id_card = obj.getid();

this->name = obj.getname();

this->sex = obj.getsex();

this->age = obj.getage();

this->money = obj.getmoney();

this->post = obj.getpost();

return *this;

}

bool operator==(officer& obj) {

if (this->getid() == obj.getid() && this->getname() == obj.getname() && this->getsex() == obj.getsex()\

&& this->getage() == obj.getage() && this->getpost() == obj.getpost() && this->getmoney() == obj.getmoney()) {

return true;

}

return false;

}

bool operator!=(officer& obj) {

if (this->getid() == obj.getid()) {

return false;

}

return true;

}

bool operator>(officer& obj) {

if (this->getmoney() > obj.getmoney()) {

return true;

}

return false;

}

bool operator<(officer& obj) {

if (this->getmoney() < obj.getmoney()) {

return true;

}

return false;

}

void setpost(string post) {

this->post = post;

}

void setmoney(int money) {

this->money = money;

}

void setid(string id) {

id_card = id;

}

void setname(string name) {

this->name = name;

}

void setsex(string sex) {

this->sex = sex;

}

void setage(int age) {

this->age = age;

}

string getid() {

return id_card;

}

string getname() {

return name;

}

string getsex() {

return sex;

}

int getage() {

return age;

}

string getpost() {

return post;

}

int getmoney() {

return money;

}

};

ostream& operator<<(ostream& out, officer& obj) {

out << obj.getid() << “\t”;

out << obj.getname() << “\t”;

out << obj.getsex() << “\t”;

out << obj.getage() << “\t”;

out << obj.getpost() << “\t”;

out << obj.getmoney() << “\t”;

// cout << endl;

return out;

}

istream& operator>>(istream& in, officer& obj) {

cout << “身份证(18位):”;

id_here:

in >> obj.id_card;

if (obj.getid() == “00”) {

return in;

}

else if (obj.getid().length() != 18) {

cout << “输入格式不规范请重新输入:”;

goto id_here;

}

//if (judgecin == 1) {

// return in;

//}

cout << “姓名:”;

in >> obj.name;

cout << “性别:”;

sex_here:

in >> obj.sex;

if (obj.getid() == “00”) {

return in;

}

else if (obj.getsex() != “男” && obj.getsex() != “女”) {

cout << “请输入准确的性别:”;

goto sex_here;

}

cout << “年龄:”;

string age;

age_here:

in >> age;

if (obj.getid() == “00”) {

return in;

}

else if (mynum(age) || age.length() > 3) {

cout << “输入不规范请重新输入:”;

2401_85124866

关注

15
点赞
踩
12

收藏

觉得还不错? 一键收藏
0
评论
真不戳,基于C++泛型编程的职工管理系统

void savelink() {//--------------------------------------存链表。void savelink() {//--------------------------------------存链表。~link() {//--------------------------------------------销毁链表。~link() {//--------------------------------------------销毁链表。
复制链接

扫一扫