devbox
很楠不爱3
这个屌丝很懒，什么也没留下！
关注作者
热门标签
热门文章
当前位置:   article > 正文

c++实现简易图书管理系统（链表+STL基础运用）_c++和链表实现的图书管理系统

作者：很楠不爱3 | 2024-02-27 00:48:46

赞

踩

c++和链表实现的图书管理系统

目录

一、图书馆功能总览

        图书功能

        用户管理

 二、结构解析

三、功能实现

光标移动

登录与注册

界面绘制

界面的切换

信息载入与储存

用户信息（链表储存）

信息储存

信息载入

书籍信息（链表储存）

书籍信息储存

书籍信息载入 

借阅信息（vector储存）

借阅信息储存

 借阅信息载入

图书管理

全部图书（图书列表）

查找图书

以书名搜索

 以ISBN搜索

以出版社搜索

以作者搜索

删除图书

以书名删除

以ISBN删除

增加图书

书籍借还（借还记录用vector记录）

借书

还书

个人信息

修改密码

借阅记录

退出登录

用户管理（需要管理员权限）

用户列表

增加用户

删除用户

重置指定用户密码

排行榜

热门图书

借书次数

热门图书

四、源代码资源

一、图书馆功能总览

        图书功能

  1. 读取txt内的图书信息，并整理成可翻页，可跳转的列表，并且输入当前页对应书籍的编号可以查看该书籍的详细信息。
  2. 可根据书名和isbn删除图书，可增加新图书
  3. 可以根据书名和isbn搜索图书，可通过作者或出版社模糊搜索图书
  4. 可以借阅图书，归还图书
  5. 有排行榜系统，包含热门图书排行榜（以用户借阅数量排行），借书次数排行榜，最新图书排行榜

        用户管理

  1. 有账户与密码，需注册。
  2. 用户有身份标识，有管理员、普通用户和游客，管理员有全部权限，普通用户不能增删图书和用户，游客除了不能增删图书和用户,还不能借阅图书
  3. 管理员可以通过用户名增删用户，可以查看所有用户（用户列表）。
  4. 管理员可以重置指定用户密码。
  5. 用户可以修改密码
  6. 用户可以查看自己个人的借阅记录
  7. 可以退出登录

 二、结构解析

        这个项目用多文件写成，分为

  1. head.h是放整个项目头文件包含，宏定义声明，类的声明与定义，各类函数的声明
  2. main.cpp,是项目运行的主线
  3. Register&SignUp.cpp是放登录与注册相关函数的定义
  4. FileIO.cpp是放有关程序与储存交互的函数定义
  5. BookManage.cpp是放实现图书管理功能的函数定义
  6. Page.cpp是放有关页面的函数定义

  7. BorrowandReturn.cpp是放有关借阅与还书方面功能的函数定义

  8. Rankings.cpp是放有关排行榜方面的函数定义
  9. UserManage.cpp是放有关用户管理方面的函数定义

三、功能实现

光标移动

  1. void SetCCPos(int x, int y)
  2. {
  3. 	HANDLE hOut;
  4. 	hOut = GetStdHandle(STD_OUTPUT_HANDLE);//获取标注输出句柄
  5. 	COORD pos;
  6. 	pos.X = x;pos.Y = y;
  7. 	SetConsoleCursorPosition(hOut, pos);//偏移光标位置
  8. }

 光标从（0，0）开始偏移，只要输入对应的坐标即可，且每次光标都是从（0，0）开始，两次偏移之间不会相互影响。

登录与注册

思路：while循环输入账户与密码，当检测到用户名是reg时跳转到注册页面，否则就是正常检测输入的账户与密码能否与已有用户链表中的用户对的上，对的上则登录成功，否则登录失败

head.h中，创建用户链表

  1. class User
  2. {
  3. public:
  4.     void addBorrowBook(string& bo)              //增加已借阅的图书
  5.     {
  6.         borrowbookname.push_back(bo);
  7.     }
  8.     User():name(""),key(""),borrownum(0),sumbooknum(0){}    //初始化
  9.  
  10.     string name;                                //用户名
  11.     string key;                                 //密码
  12.     short iden;                                 //身份（0是管理员，1是普通用户，-1是游客）
  13.     short borrownum;                            //现在借书量
  14.     short sumbooknum;                           //总借书量
  15.     vector <string> borrowbookname;             //现借书的书名
  16.     User *next;
  17. };
  18.  
  19. struct UserList
  20. {
  21.     User* head;                                //头节点
  22.     User* tail;                                //尾节点
  23.     int length;                                //节点数
  24. };

之后在main中 

  1. string name = "",                       //装用户输入的账户与密码 
  2.        key = "";
  3.  
  4. User *user = nullptr;                   //指向登录成功后的用户
  5.  
  6. UserList *u_list = new UserList;        //创建一个管理用户链表对象
  7. u_list->head = u_list->tail = user;
  8.  
  9. u_LordData(u_list);                     //载入已储存的用户链表
  10.  
  11. User* current_user;                     //当前登录账号的信息
  12.  
  13. while(1)
  14.     {
  15.         step1:
  16.         system("cls");
  17.         Page1(tips);                    //绘制登录页面
  18.         SetCCPos(9,4);
  19.         cin>>name;
  20.  
  21.         if(name == "reg")               //进入注册界面
  22.         {
  23.             name = "unreg";
  24.             User* tem = new User;       //注册用的节点
  25.             Page2(tips);                //绘制注册界面
  26.             SetCCPos(9,4);
  27.             cin>>tem->name;
  28.             SetCCPos(7,5);
  29.             cin>>tem->key;
  30.             SetCCPos(7,6);
  31.             cin>>tem->iden;
  32.  
  33.             if(Register(tem,u_list))    //检查该用户名是否被占用
  34.             {
  35.                 tips = "注册成功，请登录";
  36.                 u_SaveData(u_list);
  37.                 goto step1;
  38.             }
  39.             else
  40.             {
  41.                 delete tem;
  42.                 tips = "用户名已被占用";
  43.                 goto step1;
  44.             }
  45.  
  46.         }
  47.         else
  48.         {
  49.             SetCCPos(7,5);
  50.             cin>>key;
  51.         }
  52.         if(key == "0")                  //游客
  53.         {
  54.             current_user = new User;
  55.  
  56.             current_user->name = name;
  57.             current_user->key = key;
  58.             current_user->iden = -1;
  59.             goto in;
  60.  
  61.         }
  62.         if(SignUp(name,key,u_list))     //检查用户名与密码是否对应
  63.         {
  64.             current_user = LoacteUser(name,u_list);
  65.             break;
  66.         }
  67.         else
  68.         {
  69.             tips = "登录失败";
  70.             continue;
  71.         }
  72.  
  73.     }
  74.  
  75.     in:

界面绘制

界面我分为4种

a，选择界面

b，功能页面

c，列表界面

d，其他

先易后难，先解释

  • 其他界面的绘制
  1. void PageTitle(void)
  2. {
  3.     cout<<"╭-------------------■□■□■□--╮"<<endl;
  4.     cout<<"│       图书管理系统        │"<<endl;
  5.     cout<<"╰--■□■□■□-------------------╯"<<endl;
  6. }
  7.  
  8. void Page1(string &tips)      //登录界面
  9. {
  10.     PageTitle();
  11.     cout<<"----------登录--------------"<<endl;
  12.     cout<<"■用户名："<<endl;
  13.     cout<<"□密码："<<"\t\t\t密码为0是游客"<<endl;
  14.     cout<<tips<<endl;
  15.     cout<<"(没有账号？)"<<endl;
  16.     cout<<"(在用户名输入reg进行注册.)"<<endl;
  17.  
  18. }
  19.  
  20. void Page2(string &tips)     //注册界面
  21. {
  22.     system("cls");
  23.     PageTitle();
  24.     cout<<"----------注册--------------"<<endl;
  25.     cout<<"■用户名："<<endl;
  26.     cout<<"□密码："<<endl;
  27.     cout<<"■身份："<<endl;
  28.     cout<<"(管理员-0  普通用户-1)"<<endl;
  29.     cout<<tips;
  30. }

  • 选择界面、列表界面与功能界面的绘制

思路：先创建一个page类，一个里装着这个页面的所需要打印的信息和该页面的识别编号，当读到该编号时绘制该页面

  1. //head.h中
  2. class Page
  3. {
  4. public:
  5.     Page(const std::string* b,int nu,int numbe,string tipsc)
  6.     {
  7.         n = nu;
  8.         number = numbe;
  9.         for(int i = 0;i < n;i++)
  10.         {
  11.             button[i] = b[i];
  12.         }
  13.         tips = tipsc;
  14.  
  15.     };
  16.  
  17.     Page(const std::string* b,int nu,int numbe):tips("\0")
  18.     {
  19.         n = nu;
  20.         number = numbe;
  21.         for(int i = 0;i < n;i++)
  22.         {
  23.             button[i] = b[i];
  24.         }
  25.  
  26.     };
  27.  
  28.     Page(const std::string* b,int nu,int numbe,string na,string ident):tips("\0")
  29.     {
  30.         n = nu;
  31.         number = numbe;
  32.         button[0] = b[0]+na;
  33.         button[1] = b[1]+ident;
  34.         for(int i = 2;i < n;i++)
  35.         {
  36.             button[i] = b[i];
  37.         }
  38.     }
  39.  
  40.     int number;                              //编号
  41.     void CoutDir(void);                      //输出指引
  42.     void GetTips(void);                      //获取提示
  43.     void CoutTips(void);                     //输出提示
  44.     void PtintPage(void);                    //打印选择页面
  45.     void PrintFunctionPage(UserList*&,Page*&,User*&,BookList*&,BorrowManage& bor);           //打印功能页面
  46.     void CoutFunctionDir(void);              //打印功能页面指引
  47.     void PrintFPage(void);                   //打印功能页面
  48.     void ReflashSelect(int&);                //刷新选择的页面
  49.  
  50. private:
  51.     string button[10];      //用来装标题指引
  52.     string tips;            //用来装提示
  53.     int n;                  //指引个数
  54. };
  1. //Page.cpp中
  2. void Page::CoutDir(void)        //输出指引
  3. {
  4.     for(int i = 0;i < n-1;i++)
  5.     {
  6.         cout<<Page::button[i]<<endl;
  7.     }
  8.  
  9.     SetCCPos(0,12);
  10.     cout<<button[n-1];
  11.     SetCCPos(5,12);
  12. }
  13.  
  14. void Page::GetTips(void)           //获取提示
  15. {
  16.     cin>>Page::tips;
  17. }
  18.  
  19. void Page::CoutTips(void)          //输出提示
  20. {
  21.     cout<<tips;
  22. }
  23.  
  24.  
  25. void Page::PtintPage(void)           //打印该页面
  26. {
  27.     system("cls");
  28.     PageTitle();
  29.     CoutDir();
  30.     CoutTips();
  31. }
  32.  
  33. void Page::CoutFunctionDir(void)
  34. {
  35.     for(int i = 0;i < n;i++)
  36.     {
  37.         cout<<Page::button[i]<<endl;
  38.     }
  39. }
  40.  
  41. void Page::PrintFPage(void)
  42. {
  43.     system("cls");
  44.     PageTitle();
  45.     CoutFunctionDir();
  46.     CoutTips();
  47. }
  48.  
  49. void Page::ReflashSelect(int& select)
  50. {
  51.     select = number *10 +select;
  52. }

 用这种逻辑制作页面，需要先将全部页面信息按顺序录入，这就需要一个对象来装着这些页面

  1. //head.h中
  2. class PageManage
  3. {
  4. public:
  5.     Page* arrow;                  //指向当前的Page
  6.     vector <Page*> allpage;       //全部页面
  7.     void ChangePage(Page*&);      //切换Page
  8.  
  9.     void addPage(Page* page)      //增加页面
  10.     {
  11.         allpage.push_back(page);
  12.     }
  13.  
  14. };

之后在main中按一定顺序录入页面信息

  1. //载入页面
  2.     PageManage pm;          //页面管理对象
  3.  
  4.     //****************************零级页面
  5.  
  6.     //Page Star;
  7.     string p0[8] = {"1-图书浏览","2-借还图书","3-个人信息","4-用户管理","5-作者信息","6-各排行榜","7-退出系统","编号:"};
  8.  
  9.     Page* page0 = new Page(p0,8,0);
  10.  
  11.     pm.addPage(page0);
  12.  
  13.     //****************************一级页面
  14.  
  15.     //Page BrowseBook;
  16.     string p1[6] = {"1-全部图书","2-查找图书","3-删除图书","4-增加图书","0-上一页","编号:"};
  17.  
  18.     Page* page1 = new Page(p1,6,1);
  19.  
  20.     pm.addPage(page1);
  21.  
  22.     //Page Borrow;
  23.  
  24.     string p2[6] = {"1-借书","2-还书","0-上一页","编号:"};
  25.  
  26.     Page* page2 = new Page(p2,4,2);
  27.  
  28.     pm.addPage(page2);
  29.  
  30.     //Page PersonalInformation;
  31.  
  32.     string p3[7] = {"用户名:","身份:","1-修改密码","2-借阅记录","3-退出登录","0-上一页","编号:"};
  33.  
  34.     string t;
  35.     if(0 == current_user->iden)
  36.     {
  37.         t = "管理员";
  38.     }
  39.     else if(1 == current_user->iden)
  40.     {
  41.         t = "普通用户";
  42.     }
  43.     else if(-1 == current_user->iden)
  44.     {
  45.         t = "游客";
  46.     }
  47.  
  48.     Page* page3 = new Page(p3,7,3,current_user->name,t);
  49.  
  50.     pm.addPage(page3);
  51.  
  52.  
  53.     //Page ManageUser
  54.  
  55.     if(0 == current_user->iden)         //是管理员
  56.     {
  57.         string p4[6] = {"1-用户列表","2-增加用户","3-删除用户","4-重置指定用户密码","0-上一页","编号:"};
  58.         Page* page4 = new Page(p4,6,4);
  59.         pm.addPage(page4);
  60.     }
  61.     else                                //非管理员
  62.     {
  63.         string p4[3] = {"您没有使用该功能的权限！","0-上一页","编号:"};
  64.         Page* page4 = new Page(p4,3,4);
  65.         pm.addPage(page4);
  66.     }
  67.  
  68.     //Page AuthorInformation
  69.  
  70.     string p5[4] = {"作者:梁某","QQ:2803234009","0-上一页","编号:"};
  71.     Page* page5 = new Page(p5,4,5);
  72.     pm.addPage(page5);
  73.  
  74.     string p6[4] = {"1-热门图书","2-借书狂人","3-最新图书","编号:"};
  75.     Page* page6 = new Page(p6,4,6);
  76.     pm.addPage(page6);
  77.  
  78.     //Page EXIXT
  79.     string p7[3] = {"已保存数据","退出成功","\0"};
  80.     Page* page7 = new Page(p7,3,7);
  81.     pm.addPage(page7);
  82.  
  83.  
  84.     //*************************二级页面
  85.  
  86.  
  87.     //Page allbook          //list func
  88.     string p8[4] = {"全部图书","0-上一页","输入书籍id可查看详细信息","---------'+'下一页,‘-’上一页,‘*’跳转---------"};
  89.     Page* page8 = new Page(p8,4,11);
  90.     pm.addPage(page8);
  91.  
  92.     //Page searchbook
  93.     string p9[7] = {"搜索图书","1-按书名搜索","2-按isbn搜索","3-按出版社搜索","4-按作者搜索","0-上一页","编号:"};
  94.     Page* page9 = new Page(p9,7,12);
  95.     pm.addPage(page9);
  96.  
  97.     //Page delbook
  98.     if(0 == current_user->iden)
  99.     {
  100.         string p10[5] = {"删除图书","1-按书名删除","2-按isbn删除","0-上一页","编号:"};
  101.         Page* page10 = new Page(p10,5,13);
  102.         pm.addPage(page10);
  103.     }
  104.     else
  105.     {
  106.         string p10[3] = {"您没有使用该功能的权限！","0-上一页","编号:"};
  107.         Page* page10 = new Page(p10,3,13);
  108.         pm.addPage(page10);
  109.     }
  110.  
  111.  
  112.     //Page addbook          //func
  113.     if(0 == current_user->iden)
  114.     {
  115.         string p11[9] = {"增加图书","书名:","ISBN:","作者:","出版社:","出版时间:","价格:","描述:","0-上一页"};
  116.         Page* page11 = new Page(p11,9,14);
  117.         pm.addPage(page11);
  118.     }
  119.     else
  120.     {
  121.         string p11[3] = {"您没有使用该功能的权限！","0-上一页","编号:"};
  122.         Page* page11 = new Page(p11,3,14);
  123.         pm.addPage(page11);
  124.     }
  125.  
  126.     if(-1 == current_user->iden)
  127.     {
  128.         string p12[3] = {"您没有使用该功能的权限！","0-上一页","编号:"};
  129.         Page* page12 = new Page(p12,3,21);
  130.         pm.addPage(page12);
  131.  
  132.         string p13[3] = {"您没有使用该功能的权限！","0-上一页","编号:"};
  133.         Page* page13 = new Page(p13,3,22);
  134.         pm.addPage(page13);
  135.     }
  136.     else
  137.     {
  138.         //Page borrowbook       //func
  139.         string p12[5] = {"借书","1-书名","2-ISBN","0-上一页","搜索:"};
  140.         Page* page12 = new Page(p12,5,21,"用书名搜索 1-xxx，isbn 2-12...");
  141.         pm.addPage(page12);
  142.  
  143.         //Page returnbook       //func
  144.         string p13[5] = {"还书","1-书名","2-ISBN","0-上一页","搜索:"};
  145.         Page* page13 = new Page(p13,5,22,"书名搜索 1-xxx，isbn搜索 2-xxx");
  146.         pm.addPage(page13);
  147.     }
  148.  
  149.  
  150.     //Page rewritekey       //func
  151.     string p14[4] = {"修改密码","新密码:","确认密码:","0-上一页"};
  152.     Page* page14 = new Page(p14,4,31);
  153.     pm.addPage(page14);
  154.  
  155.     //Page borrowrecord     //list func
  156.     string p15[2] = {"借阅记录","0-上一页"};
  157.     Page* page15 = new Page(p15,2,32);
  158.     pm.addPage(page15);
  159.  
  160.     //Page logoff       33
  161.  
  162.     //Page Userlist         //list func
  163.     string p16[2] = {"用户列表","0-上一页"};
  164.     Page* page16 = new Page(p16,2,41);
  165.     pm.addPage(page16);
  166.  
  167.     //Page addUser          //func
  168.     string p17[4] = {"添加用户","用户名:","身份:","0-上一页"};
  169.     Page* page17 = new Page(p17,4,42,"身份0-管理员 1-普通用户，密码默认为000000");
  170.     pm.addPage(page17);
  171.  
  172.     //Page delUser          //func
  173.     string p18[3] = {"删除用户","用户名:","0-上一页"};
  174.     Page* page18 = new Page(p18,3,43);
  175.     pm.addPage(page18);
  176.  
  177.     //Page resetket         //func
  178.     string p19[3] = {"重置密码","用户名:","0-上一页"};
  179.     Page* page19 = new Page(p19,3,44,"密码重置为000000");
  180.     pm.addPage(page19);
  181.  
  182.     //Pafe hotbook          //rank
  183.     string p20[2] = {"热门图书","0-上一页"};
  184.     Page* page20 = new Page(p20,2,61);
  185.     pm.addPage(page20);
  186.  
  187.     //Page borrowMaxbook    //rank
  188.     string p21[2] = {"借书狂人","0-上一页"};
  189.     Page* page21 = new Page(p21,2,62);
  190.     pm.addPage(page21);
  191.  
  192.     //Page newbook          //rank
  193.     string p22[2] = {"最新图书","0-上一页"};
  194.     Page* page22 = new Page(p22,2,63);
  195.     pm.addPage(page22);
  196.  
  197.  
  198.  
  199.     //**************************************三级页面
  200.  
  201.     //Page searchbytitle    //func
  202.     string p23[3] = {"按书名搜索","书名:","0-上一页"};
  203.     Page* page23 = new Page(p23,3,121);
  204.     pm.addPage(page23);
  205.  
  206.     //Page searchbyisbn    //func
  207.     string p24[3] = {"按isbn搜索","ISBN:","0-上一页"};
  208.     Page* page24 = new Page(p24,3,122);
  209.     pm.addPage(page24);
  210.  
  211.     //Page searchbypublisher    //func
  212.     string p25[3] = {"按出版社搜索","出版社:","0-上一页"};
  213.     Page* page25 = new Page(p25,3,123);
  214.     pm.addPage(page25);
  215.  
  216.     //Page searchbyauthor    //func
  217.     string p26[3] = {"按作者搜索","作者:","0-上一页"};
  218.     Page* page26 = new Page(p26,3,124);
  219.     pm.addPage(page26);
  220.  
  221.     //Page delbytitle    //func
  222.     string p27[3] = {"按书名删除","书名:","0-上一页"};
  223.     Page* page27 = new Page(p27,3,131);
  224.     pm.addPage(page27);
  225.  
  226.     //Page delbyisdn    //func
  227.     string p28[3] = {"按isdn删除","ISBN:","0-上一页"};
  228.     Page* page28 = new Page(p28,3,132);
  229.     pm.addPage(page28);

如果是选择页面，绘制时只需要调用PtintPage()即可，如果是功能页面，调用PrintFunctionPage()即可

  1. Page* arrow = pm.allpage[0];            //打印第0级页面
  2.     while(1)
  3.     {
  4.         if(arrow == pm.allpage[0]||arrow == pm.allpage[1]||arrow == pm.allpage[2]||arrow == pm.allpage[3]||arrow == pm.allpage[4]||
  5.             arrow == pm.allpage[5]||arrow == pm.allpage[7]||arrow == pm.allpage[9]||arrow == pm.allpage[10])
  6.             arrow->PtintPage();     //选择页面
  7.  
  8.         else if(arrow == nullptr)       //退出登录
  9.         {
  10.             u_SaveData(u_list);
  11.             book_SaveData(book_list);
  12.             borrow_SaveData(borrow);
  13.             goto step1;
  14.         }
  15.         else                            //功能页面和列表页面
  16.             arrow->PrintFunctionPage(u_list,arrow,current_user,book_list,borrow);
  17.  
  18.         if(arrow == pm.allpage[7])          //保存退出系统
  19.             break;
  20.         pm.ChangePage(arrow);               //切换页面
  21.     }

如果是功能页面或列表页面，就调用 PrintFunctionPage()，当然功能页面不仅只有指引，还要实现指定功能，只需调用对应函数实现即可

  1. void Page::PrintFunctionPage(UserList*& ulc,Page*& arrowc,User*& cu,BookList*& blc,BorrowManage& bor)
  2. {
  3.     arrowc->PrintFPage();        //打印功能页面和列表页面的页面指引
  4.  
  5.     switch(arrowc->number)
  6.     {
  7.     case 11:
  8.         PrintBookList(blc,arrowc);
  9.         break;
  10.     case 12:    //列表页面，在上面已输出
  11.         break;
  12.     case 13:    //列表页面，在上面已输出
  13.         break;
  14.     case 14:
  15.         if(cu->iden!=0)
  16.             break;
  17.         AddBook(blc);
  18.         break;
  19.     case 21:
  20.         BorrowBooks(blc,cu,bor);
  21.         break;
  22.     case 22:
  23.         ShowBorrowRecord(bor,cu);
  24.         ReturnBook(bor,cu);
  25.         break;
  26.     case 31:
  27.         ChangePassport(cu);
  28.         break;
  29.     case 32:
  30.         ShowBorrowRecord(bor,cu);
  31.         break;
  32.     case 41:
  33.         if(cu->iden!=0)
  34.             break;
  35.         printUserList(ulc);
  36.         break;
  37.     case 42:
  38.         if(cu->iden!=0)
  39.             break;
  40.         addUser(ulc);
  41.         break;
  42.  
  43.     case 43:
  44.         if(cu->iden!=0)
  45.             break;
  46.         SetCCPos(0,10);
  47.         printUserList(ulc);
  48.         delUser(ulc,bor);
  49.         break;
  50.     case 44:
  51.         resetKey(ulc);
  52.         break;
  53.     case 61:
  54.         HotBookRank(bor);
  55.         break;
  56.     case 62:
  57.         CrazyBorrwoMan(ulc);
  58.         break;
  59.     case 63:
  60.         LatestBook(blc);
  61.         break;
  62.     case 121:
  63.         SearchByName(blc);
  64.         break;
  65.     case 122:
  66.         SearchByISBN(blc);
  67.         break;
  68.     case 123:
  69.         SearchByPublising(blc);
  70.         break;
  71.     case 124:
  72.         SearchByAuthor(blc);
  73.         break;
  74.     case 131:
  75.         DelBookByName(blc);
  76.         break;
  77.     case 132:
  78.         DelBookByISBN(blc);
  79.         break;
  80.     }
  81.  
  82. }

界面的切换

思路：先要获取当前页面的编号，再获取用户输入的号码，将两者合并就是目标页面的编号，如第一级页面“个人信息”页面的编号是3，如果用户想要去“借阅记录”页面，用户输入了2，那么32就是”借阅记录“的编号。

这就引出了一个新的问题，要将”借阅记录“页面与编号32联系在一起，这就是PageManage中ChangePage()的作用

  1. //Page.h中
  2. void PageManage::ChangePage(Page *&arrow)
  3. {
  4.     int select = 0;         //当前页的选择
  5.  
  6.     cin>>select;
  7.  
  8.     if(arrow == allpage[3]&&select == 3)//退出登录
  9.     {
  10.         arrow = nullptr;
  11.         return;
  12.     }
  13.  
  14.     if(0 == select)         //返回上一页
  15.     {
  16.         arrow->ReflashSelect(select);
  17.         select/=100;
  18.     }
  19.     else
  20.     {
  21.         arrow->ReflashSelect(select);
  22.     }
  23.  
  24.     switch(select)
  25.     {
  26.     case 0:
  27.         arrow = allpage[0];
  28.         break;
  29.     case 1:
  30.         arrow = allpage[1];
  31.         break;
  32.     case 2:
  33.         arrow = allpage[2];
  34.         break;
  35.     case 3:
  36.         arrow = allpage[3];
  37.         break;
  38.     case 4:
  39.         arrow = allpage[4];
  40.         break;
  41.     case 5:
  42.         arrow = allpage[5];
  43.         break;
  44.     case 6:
  45.         arrow = allpage[6];
  46.         break;
  47.     case 7:
  48.         arrow = allpage[7];
  49.         break;
  50.     case 11:
  51.         arrow = allpage[8];
  52.         break;
  53.     case 12:
  54.         arrow = allpage[9];
  55.         break;
  56.     case 13:
  57.         arrow = allpage[10];
  58.         break;
  59.     case 14:
  60.         arrow = allpage[11];
  61.         break;
  62.     case 21:
  63.         arrow = allpage[12];
  64.         break;
  65.     case 22:
  66.         arrow = allpage[13];
  67.         break;
  68.     case 31:
  69.         arrow = allpage[14];
  70.         break;
  71.     case 32:
  72.         arrow = allpage[15];
  73.         break;
  74.     case 41:
  75.         arrow = allpage[16];
  76.         break;
  77.     case 42:
  78.         arrow = allpage[17];
  79.         break;
  80.     case 43:
  81.         arrow = allpage[18];
  82.         break;
  83.     case 44:
  84.         arrow = allpage[19];
  85.         break;
  86.     case 61:
  87.         arrow = allpage[20];
  88.         break;
  89.     case 62:
  90.         arrow = allpage[21];
  91.         break;
  92.     case 63:
  93.         arrow = allpage[22];
  94.         break;
  95.     case 121:
  96.         arrow = allpage[23];
  97.         break;
  98.     case 122:
  99.         arrow = allpage[24];
  100.         break;
  101.     case 123:
  102.         arrow = allpage[25];
  103.         break;
  104.     case 124:
  105.         arrow = allpage[26];
  106.         break;
  107.     case 131:
  108.         arrow = allpage[27];
  109.         break;
  110.     case 132:
  111.         arrow = allpage[28];
  112.         break;
  113.     }
  114. }

形成新的编号后，就将arrow指向该页面，下一次while循环时就会打印该页面

信息载入与储存

信息储存

思路：用户信息在程序里是用链表储存的，遍历各个节点，将信息写入User.txt就行

  1. //FileIO.cpp
  2. void u_SaveData(UserList* p)
  3. {
  4.     ofstream fp(userfile,ios::trunc);
  5.     User* current = p->head;
  6.  
  7.     int length = p->length;
  8.  
  9.     while(length--)
  10.     {
  11.         fp<<endl<<current->name<<" ";
  12.         fp<<current->key<<" ";
  13.         fp<<current->iden<<" ";
  14.         fp<<current->borrownum<<" ";
  15.         fp<<current->sumbooknum;
  16.         int booknum = current->borrowbookname.size();
  17.  
  18.         if(booknum == 0)
  19.         {
  20.             current = current->next;
  21.             continue;
  22.         }
  23.  
  24.         for(int i = 0;i < booknum-1;i++)
  25.         {
  26.             fp<<" "<<current->borrowbookname[i];
  27.         }
  28.         fp<<" "<<current->borrowbookname[booknum-1];
  29.  
  30.         current = current->next;
  31.     }
  32.  
  33.     fp.close();
  34. }
信息载入

思路：如果User.txt里有数据，先创建一个节点，将信息读出来，并把这个节点连入链表

  1. void u_LordData (UserList* p)
  2. {
  3.     ifstream fp(userfile);
  4.  
  5.     if(!fp)
  6.     {
  7.         return;
  8.     }
  9.  
  10.     while(fp.peek() != EOF)
  11.     {
  12.         u_CreatPoint(p);
  13.  
  14.         User* current = p->tail;
  15.  
  16.         string bookname;
  17.  
  18.         fp>>current->name>>current->key;
  19.         fp>>current->iden>>current->borrownum>>current->sumbooknum;
  20.  
  21.         int num = current->borrownum;
  22.  
  23.         while(num--)
  24.         {
  25.             fp>>bookname;
  26.             current->borrowbookname.push_back(bookname);
  27.         }
  28.  
  29.     }
  30.  
  31.     fp.close();
  32.  
  33. }
  34.  
  35. void u_CreatPoint (UserList* p)
  36. {
  37.     User* current = new User;
  38.  
  39.     current->next = nullptr;
  40.  
  41.     if(p->head ==nullptr)
  42.     {
  43.         p->head = current;
  44.         p->tail = current;
  45.     }
  46.     else
  47.     {
  48.         p->tail->next = current;
  49.         p->tail = p->tail->next;
  50.     }
  51.     p->length++;
  52. }

  • 书籍信息（链表储存）

书籍信息储存
  1. void book_SaveData(BookList* p)
  2. {
  3.     ofstream fp(bookfile,ios::trunc);
  4.     Book* current = p->head;
  5.  
  6.     int length = p->length;
  7.  
  8.     fp<<"id	isbn	name	author	publishing	publisheddate	price	pages	description"<<endl;
  9.  
  10.     while(length--)
  11.     {
  12.         fp<<current->id<<"\t";
  13.         fp<<current->isbn<<"\t";
  14.         fp<<current->bookname<<"\t";
  15.         fp<<current->author<<"\t";
  16.         fp<<current->publising<<"\t";
  17.         fp<<current->publisheddate<<"\t";
  18.         fp<<current->price<<"\t";
  19.         fp<<current->page<<"\t";
  20.         fp<<current->description<<"\n";
  21.  
  22.         current = current->next;
  23.     }
  24.  
  25.     fp.close();
  26. }
书籍信息载入 
  1. void book_LordData(BookList* p)
  2. {
  3.     ifstream fp(bookfile);
  4.  
  5.     if(!fp)
  6.     {
  7.         return;
  8.     }
  9.  
  10.  
  11.     string title;
  12.     getline(fp,title,'\n');
  13.  
  14.     while(fp.peek() != EOF)
  15.     {
  16.         book_CreatPoint(p);
  17.  
  18.         Book* current = p->tail;
  19.  
  20.         fp>>current->id;
  21.  
  22.         fp.get();
  23.         getline(fp,current->isbn,'\t');
  24.         getline(fp,current->bookname,'\t');
  25.         getline(fp,current->author,'\t');
  26.         getline(fp,current->publising,'\t');
  27.         getline(fp,current->publisheddate,'\t');
  28.         fp>>current->price;
  29.         fp.get();
  30.         fp>>current->page;
  31.         fp.get();
  32.  
  33.         getline(fp,current->description,'\n');
  34.  
  35.         /*char c = fp.peek();
  36.         int num = current->id+1;
  37.         while(num>=10)
  38.             num/=10;
  40.         int count = 0;
  42.         while(!(c >'0'&&c<='9'))
  43.         {
  44.             string t;
  45.             getline(fp,t,'\n');
  47.             if(t == "")
  48.                 count++;
  49.             if(t==""&&count>=5)
  50.             {
  51.                 count = 0;
  52.                 break;
  53.             }
  55.             current->description+=t;
  56.             c = fp.peek();
  57.         }*/
  58.  
  59.     }
  60.  
  61.     fp.close();
  62. }
  63.  
  64.  
  65. void book_CreatPoint(BookList* p)
  66. {
  67.     Book* current = new Book;
  68.     current->next = nullptr;
  69.  
  70.     if(p->head == nullptr)
  71.     {
  72.         p->head = current;
  73.         p->tail = current;
  74.     }
  75.     else
  76.     {
  77.         p->tail->next = current;
  78.         p->tail = p->tail->next;
  79.     }
  80.     p->length++;
  81. }

注释掉的内容是为了区分文件中书籍的内容简介，如果书籍数据格式规范，就不需要这个

  • 借阅信息（vector储存）

借阅信息储存
  1. void borrow_SaveData(BorrowManage& bo)
  2. {
  3.     ofstream fp(borrowfile,ios::trunc);
  4.  
  5.     int num = bo.borrowrecording.size();
  6.  
  7.     for(int i = 0;i < num;i++)
  8.     {
  9.         fp<<bo.borrowrecording[i]->Name_book()<<"\t";
  10.         fp<<bo.borrowrecording[i]->Isbn_book()<<"\t";
  11.         fp<<bo.borrowrecording[i]->Date_borrow()<<"\t";
  12.         fp<<bo.borrowrecording[i]->Date_return()<<"\t";
  13.         fp<<bo.borrowrecording[i]->Username()<<endl;
  14.     }
  15.  
  16.     fp.close();
  17. }
 借阅信息载入
  1. void borrow_LordData(BorrowManage& bo)
  2. {
  3.     ifstream fp(borrowfile);
  4.  
  5.     while(fp.peek()!=EOF)
  6.     {
  7.         string bookname,isbn,borrowdate,returndate,username;
  8.  
  9.         getline(fp,bookname,'\t');
  10.         getline(fp,isbn,'\t');
  11.         getline(fp,borrowdate,'\t');
  12.         getline(fp,returndate,'\t');
  13.         getline(fp,username,'\n');
  14.         Borrow* temp = new Borrow(bookname,isbn,borrowdate,username);
  15.  
  16.         bo.addPage(temp);
  17.     }
  18.  
  19.     fp.close();
  20. }

图书管理

  • 全部图书（图书列表）

思路：宏定义onepage是20，定义begin和end，打印的信息就是从begin到end的节点信息，而begin和end的数值根据page来算得，那就可以通过控制page来控制打印的信息

  1. void PrintBookList(BookList* p,Page*& pa)
  2. {
  3.     Book* current = p->head;
  4.     int length = p->length;
  5.  
  6.     int page = 1,
  7.         begin,
  8.         end;
  9.  
  10.     while(1)
  11.     {
  12.         system("cls");
  13.         SetCCPos(0,0);
  14.         pa->PrintFPage();
  15.  
  16.         if(page<1)                //最前一页
  17.             page = 1;
  18.         else if(page>ceil(length/20))        //最后一页
  19.             page = ceil(length/20.0);
  20.  
  21.  
  22.         begin = (page-1)*onepage,
  23.         end = page*onepage;
  24.  
  25.         cout<<"id	name	                                               author	     publishing"<<endl;
  26.  
  27.  
  28.         current = p->head;
  29.         for(int i = 0;i < (page-1)*onepage;i++)
  30.         {
  31.             current = current->next;
  32.         }
  33.  
  34.         for(int i = begin;i < end;i++)
  35.         {
  36.             cout<<current->id-((page-1)*onepage)<<"\t";
  37.  
  38.             string name = current->bookname;
  39.             while(name.length()<55)
  40.                 name+=" ";
  41.             cout<<name;
  42.  
  43.             string author = current->author;
  44.             while(author.length()<15)
  45.                 author+=" ";
  46.             cout<<author;
  47.  
  48.  
  49.             string publishing = current->publising;
  50.             while(publishing.length()<10)
  51.                 publishing+=" ";
  52.  
  53.             cout<<publishing<<"\n";
  54.  
  55.             current = current->next;
  56.  
  57.             if(current == nullptr)
  58.                 break;
  59.         }
  60.         cout<<"第"<<page<<"页"<<endl;
  61.  
  62.         int num = 0;
  63.  
  64.         cin.sync();        //清空缓存区
  65.  
  66.         char t = cin.peek();
  67.  
  68.         if(t == '+')
  69.         {
  70.             page++;
  71.             continue;
  72.         }
  73.         else if(t == '-')
  74.         {
  75.             page--;
  76.             continue;
  77.         }
  78.         else if(t == '*')
  79.         {
  80.             cin.ignore();
  81.             cout<<"跳转到:";
  82.             cin>>page;
  83.             continue;
  84.         }
  85.         else if(t == '\n')
  86.         {
  87.             continue;
  88.         }
  89.  
  90.         cin>>num;        //接收用户想查看书籍的编号
  91.  
  92.         switch(num)
  93.         {
  94.         case 0:
  95.             cout<<"输入0返回上一页"<<endl;
  96.             return;
  97.         default:
  98.             num = num+(page-1)*onepage;
  99.             PrintBookDetil(num,p);
  100.             break;
  101.         }
  102.     }
  103. }
  1. void PrintBookDetil(int n,BookList* p)
  2. {
  3.     system("cls");
  4.  
  5.     Book* current = p->head;
  6.  
  7.     for(int i = 0;i < n-1;i++)
  8.     {
  9.         current = current->next;
  10.     }
  11.  
  12.     cout<<"书名:"<<current->bookname<<endl;
  13.     cout<<"ISBN:"<<current->isbn<<endl;
  14.     cout<<"作者:"<<current->author<<endl;
  15.     cout<<"页数:"<<current->page<<endl;
  16.     cout<<"价格:"<<current->price<<endl;
  17.     cout<<"出版时间:"<<current->publisheddate<<endl;
  18.     cout<<"出版社:"<<current->publising<<endl;
  19.     cout<<"简介:"<<current->description<<endl<<endl;
  20.  
  21.     system("pause");
  22. }

  • 查找图书

思路：书籍信息是用链表储存的，从用户输入中获取相关信息，再遍历链表找到对应节点，再输出该节点的相关信息

以书名搜索
  1. //BookManage.cpp
  2. void SearchByName(BookList*& p)
  3. {
  4.     SetCCPos(5,4);
  5.  
  6.     string name;
  7.  
  8.     cin>>name;
  9.  
  10.     Book* current = p->head;
  11.  
  12.     SetCCPos(0,6);
  13.     cout<<"id	name	                                               author	     publishing"<<endl;
  14.  
  15.     while(current != nullptr)
  16.     {
  17.         if(current->bookname == name)
  18.         {
  19.             cout<<current->id<<"\t";
  20.             string name = current->bookname;
  21.             while(name.length()<55)            //输出格式化
  22.                 name+=" ";
  23.             cout<<name;
  24.  
  25.             string author = current->author;
  26.             while(author.length()<15)          //输出格式化
  27.                 author+=" ";
  28.             cout<<author;
  29.  
  30.             string publishing = current->publising;
  31.             while(publishing.length()<10)      //输出格式化
  32.                 publishing+=" ";
  33.  
  34.             cout<<publishing<<"\n";
  35.         }
  36.  
  37.         current = current->next;
  38.     }
  39. }
 以ISBN搜索
  1. void SearchByISBN(BookList*& p)
  2. {
  3.     SetCCPos(5,4);
  4.  
  5.     string isbn;
  6.  
  7.     cin>>isbn;
  8.  
  9.     Book* current = p->head;
  10.  
  11.     SetCCPos(0,6);
  12.     cout<<"id	name	                                               author	     publishing"<<endl;
  13.  
  14.     while(current != nullptr)
  15.     {
  16.         if(current->isbn == isbn)
  17.         {
  18.             cout<<current->id<<"\t";
  19.             string name = current->bookname;
  20.             while(name.length()<55)              //输出格式化
  21.                 name+=" ";
  22.             cout<<name;
  23.  
  24.             string author = current->author;
  25.             while(author.length()<15)            //输出格式化
  26.                 author+=" ";
  27.             cout<<author;
  28.  
  29.  
  30.             string publishing = current->publising;
  31.             while(publishing.length()<10)        //输出格式化
  32.                 publishing+=" ";
  33.  
  34.             cout<<publishing<<"\n";
  35.         }
  36.  
  37.         current = current->next;
  38.     }
  39. }
以出版社搜索
  1. //BookManage.cpp
  2. void SearchByPublising(BookList*& p)
  3. {
  4.     SetCCPos(7,4);
  5.  
  6.     string publising;
  7.  
  8.     cin>>publising;
  9.  
  10.     Book* current = p->head;
  11.  
  12.     SetCCPos(0,6);
  13.     cout<<"id	name	                                               author	     publishing"<<endl;
  14.  
  15.     while(current != nullptr)
  16.     {
  17.         if(current->publising == publising)
  18.         {
  19.             cout<<current->id<<"\t";
  20.             string name = current->bookname;
  21.             while(name.length()<55)
  22.                 name+=" ";
  23.             cout<<name;
  24.  
  25.             string author = current->author;
  26.             while(author.length()<15)
  27.                 author+=" ";
  28.             cout<<author;
  29.  
  30.             string publishing = current->publising;
  31.             while(publishing.length()<10)
  32.                 publishing+=" ";
  33.  
  34.             cout<<publishing<<"\n";
  35.         }
  36.  
  37.         current = current->next;
  38.     }
  39. }
以作者搜索
  1. void SearchByAuthor(BookList*& p)
  2. {
  3.     SetCCPos(5,4);
  4.  
  5.     string author;
  6.  
  7.     cin>>author;
  8.  
  9.     Book* current = p->head;
  10.  
  11.     SetCCPos(0,6);
  12.     cout<<"id	name	                                               author	     publishing"<<endl;
  13.  
  14.     while(current != nullptr)
  15.     {
  16.         if(current->author == author)
  17.         {
  18.             cout<<current->id<<"\t";
  19.             string name = current->bookname;
  20.             while(name.length()<55)
  21.                 name+=" ";
  22.             cout<<name;
  23.  
  24.             string author = current->author;
  25.             while(author.length()<15)
  26.                 author+=" ";
  27.             cout<<author;
  28.  
  29.             string publishing = current->publising;
  30.             while(publishing.length()<10)
  31.                 publishing+=" ";
  32.  
  33.             cout<<publishing<<"\n";
  34.         }
  35.  
  36.         current = current->next;
  37.     }
  38. }

  • 删除图书

思路：从用户输入获取目标书籍的信息，遍历链表，如果找到记录该书籍的节点，则删除该节点，如果没找到，就输出“未找到该书籍” 。

以书名删除
  1. //BookManagge.cpp
  2. void DelBookByName(BookList* p)
  3. {
  4.     SetCCPos(5,4);
  5.  
  6.     string name;
  7.  
  8.     cin>>name;
  9.  
  10.     Book* current = p->head;
  11.  
  12.     while(current!=nullptr)
  13.     {
  14.         if(current->next->bookname == name)
  15.         {
  16.             Book* temp = current->next;
  17.             current->next = temp->next;
  18.             delete temp;
  19.             p->length--;
  20.             SetCCPos(0,6);
  21.             cout<<"删除成功"<<endl;
  22.             return;
  23.         }
  24.         current = current->next;
  25.     }
  26.  
  27.     SetCCPos(0,6);
  28.     cout<<"未找到该书，请重进"<<endl;
  29.     return;
  30.  
  31.  
  32. }
以ISBN删除
  1. //BookManage.cpp
  2. void DelBookByISBN(BookList* p)
  3. {
  4.     SetCCPos(5,4);
  5.  
  6.     string ISBN;
  7.  
  8.     cin>>ISBN;
  9.  
  10.     Book* current = p->head;
  11.  
  12.     while(current!=nullptr)
  13.     {
  14.         if(current->next->isbn == ISBN)
  15.         {
  16.             Book* temp = current->next;
  17.             current->next = temp->next;
  18.             delete temp;
  19.             p->length--;
  20.             SetCCPos(0,6);
  21.             cout<<"删除成功"<<endl;
  22.             return;
  23.         }
  24.         current = current->next;
  25.     }
  26.     SetCCPos(0,6);
  27.     cout<<"未找到该书，请重进"<<endl;
  28.     return;
  29.  
  30. }

  • 增加图书

  1. void AddBook(BookList* p)
  2. {
  3.     book_CreatPoint(p);
  4.  
  5.     Book* current = p->tail;
  6.  
  7.     p->tail->id = p->length;
  8.  
  9.     SetCCPos(5,4);
  10.     cin>>current->bookname;
  11.     if(current->bookname == "0")
  12.     {
  13.         SetCCPos(0,12);
  14.         cout<<"请输入0退出"<<endl;
  15.         return;
  16.     }
  17.  
  18.     SetCCPos(5,5);
  19.     cin>>current->isbn;
  20.  
  21.     SetCCPos(5,6);
  22.     cin>>current->author;
  23.  
  24.     SetCCPos(7,7);
  25.     cin>>current->publising;
  26.  
  27.     SetCCPos(9,8);
  28.     cin>>current->publisheddate;
  29.  
  30.     SetCCPos(5,9);
  31.     cin>>current->price;
  32.  
  33.     SetCCPos(5,10);
  34.     cin>>current->description;
  35.  
  36.     SetCCPos(0,12);
  37.     cout<<"添加成功，输入0退出"<<endl;
  38.  
  39. }

书籍借还（借还记录用vector记录）

借书

思路：从用户输入获取相关信息，搜先要判断这本书用户是否已经借了还没有还，如果借了没还，输出“已借过”，否则就查找书籍链表中是否有该书籍，如果有，就记录下这条借阅信息，如果没有该书籍，就输出“查无此书”。

  1. void BorrowBooks(BookList* bl,User* u,BorrowManage& bo)
  2. {
  3.     Book* current = bl->head;
  4.     SetCCPos(5,7);
  5.  
  6.     string s;
  7.  
  8.     cin>>s;
  9.  
  10.     if(s[0] == '0')
  11.     {
  12.         SetCCPos(0,10);
  13.         cout<<"输入0返回上一页";
  14.         return;
  15.     }
  16.     else if(s[0] == '1')
  17.     {
  18.         s.erase(0,2);
  19.  
  20.         vector<string>::iterator iter=std::find(u->borrowbookname.begin(),u->borrowbookname.end(),s);
  21.  
  22.         if(iter != u->borrowbookname.end())
  23.         {
  24.             SetCCPos(0,9);
  25.             cout<<u->name<<"已借过"<<"<<"<<s<<">>"<<endl;
  26.             return;
  27.         }
  28.  
  29.         while(current!=nullptr)
  30.         {
  31.             if(s == current->bookname)
  32.             {
  33.                 u->borrownum++;
  34.                 u->sumbooknum++;
  35.                 RecordBorrowInf(current,bo,u);
  36.                 u->borrowbookname.push_back(current->bookname);
  37.  
  38.                 SetCCPos(0,9);
  39.                 cout<<u->name<<"成功借阅"<<"<<"<<current->bookname<<">>"<<endl;
  40.                 return;
  41.             }
  42.             current = current->next;
  43.         }
  44.  
  45.         SetCCPos(0,9);
  46.         cout<<"查无此书"<<endl;
  47.         return;
  48.     }
  49.     else if(s[0] == '2')
  50.     {
  51.         s.erase(0,2);
  52.  
  53.         while(current!=nullptr)
  54.         {
  55.             if(s == current->isbn)
  56.             {
  57.                 string sbookname = current->bookname;
  58.                 vector<string>::iterator iter=std::find(u->borrowbookname.begin(),u->borrowbookname.end(),sbookname);
  59.  
  60.                 if(iter != u->borrowbookname.end())
  61.                 {
  62.                     SetCCPos(0,9);
  63.                     cout<<u->name<<"已借过"<<"<<"<<current->bookname<<">>"<<endl;
  64.                     return;
  65.                 }
  66.  
  67.                 u->borrownum++;
  68.                 u->sumbooknum++;
  69.                 RecordBorrowInf(current,bo,u);
  70.                 u->borrowbookname.push_back(current->bookname);
  71.  
  72.                 SetCCPos(0,9);
  73.                 cout<<u->name<<"成功借阅"<<"<<"<<current->bookname<<">>"<<endl;
  74.                 return;
  75.             }
  76.  
  77.             current = current->next;
  78.         }
  79.         
  80.         SetCCPos(0,9);
  81.         cout<<"查无此书"<<endl;
  82.         return;
  83.     }
  84.  
  85. }
  86.  
  87. void RecordBorrowInf(Book* current,BorrowManage& bo,User* u)
  88. {
  89.     time_t timep;
  90.     string t;
  91.  
  92.     time(&timep);
  93.  
  94.     t = ctime(&timep);
  95.  
  96.     t.pop_back();
  97.  
  98.     Borrow* temp = new Borrow(current->bookname,current->isbn,t,u->name);
  99.  
  100.     bo.addPage(temp);
  101. }

代码解析：vector<string>::iterator iter=std::find(u->borrowbookname.begin(),u->borrowbookname.end(),s);         //定义了一个vector<string>类型的迭代器iter用来装find函数的返回值，而传递给find函数的三个参数是查找的开头，查找的结尾，查找的内容，如果iter指向borrowbookname.end()，那么就是没有找到，如果不是，iter指向目标位置。

还书

思路：从用户输入获取要还书的书名（或isbn），遍历借阅记录，从中找到该用户的借阅记录，再对比该用户借的书与要还书的书名（或isbn）是否一致，如果一致，就修改借阅记录，将归还时间改为当前时间。如果该用户借的书中没有该书，或没有该用户的借阅记录，都输出“未借阅”。

  1. void ReturnBook(BorrowManage& bo,User* u)
  2. {
  3.     SetCCPos(5,7);
  4.  
  5.     string s;
  6.     int num = bo.borrowrecording.size();
  7.  
  8.     time_t timep;
  9.     string r_time;
  10.  
  11.     time(&timep);
  12.  
  13.     r_time = ctime(&timep);
  14.  
  15.  
  16.     cin>>s;
  17.  
  18.     if(s[0] == '0')
  19.     {
  20.         SetCCPos(0,15);
  21.         cout<<"输入0返回上一页";
  22.         return;
  23.     }
  24.     else if(s[0] == '1')
  25.     {
  26.         s.erase(0,2);
  27.  
  28.         for(int i = 0;i < num;i++)
  29.         {
  30.             string bookname = bo.borrowrecording[i]->Name_book();
  31.             if(u->name == bo.borrowrecording[i]->Username())
  32.             {
  33.                 if(s == bookname)
  34.                 {
  35.                     bo.borrowrecording[i]->RewriteDate(r_time);
  36.                     u->borrowbookname.erase(std::remove(u->borrowbookname.begin(), u->borrowbookname.end(), bookname), u->borrowbookname.end());
  37.                     u->borrownum--;
  38.  
  39.                     SetCCPos(0,20);
  40.                     cout<<u->name<<"成功归还"<<"<<"<<bookname<<">>"<<endl;
  41.                     return;
  42.                 }
  43.             }
  44.         }
  45.         SetCCPos(0,20);
  46.         cout<<u->name<<"未借阅"<<"<<"<<s<<">>"<<endl;
  47.         return;
  48.     }
  49.     else if(s[0] == '2')
  50.     {
  51.         s.erase(0,2);
  52.  
  53.         for(int i = 0;i < num;i++)
  54.         {
  55.             if(s == bo.borrowrecording[i]->Isbn_book())
  56.             {
  57.                 string bookname = bo.borrowrecording[i]->Name_book();
  58.  
  59.                 if(u->name == bo.borrowrecording[i]->Username())
  60.                 {
  61.                     bo.borrowrecording[i]->RewriteDate(r_time);
  62.                     u->borrowbookname.erase(std::remove(u->borrowbookname.begin(), u->borrowbookname.end(), bookname), u->borrowbookname.end());
  63.                     u->borrownum--;
  64.  
  65.                     SetCCPos(0,20);
  66.                     cout<<u->name<<"成功归还"<<"<<"<<bookname<<">>"<<endl;
  67.                     return;
  68.                 }
  69.             }
  70.         }
  71.         SetCCPos(0,20);
  72.         cout<<u->name<<"未借阅"<<"<<"<<s<<">>"<<endl;
  73.         return;
  74.  
  75.     }
  76.  
  77. }

代码解析：u->borrowbookname.erase(std::remove(u->borrowbookname.begin(), u->borrowbookname.end(), bookname), u->borrowbookname.end());         //该行代码的目的是彻底删除一个元素，从内向外看，首先调用了remove函数，传递了三个参数，分别是查找的开头，查找的结尾，目标内容，它会将要删除的元素移到容器的末尾，并返回一个指向新末尾之后第一个不匹配元素的迭代器，之后调用erase函数，删除remove返回的新结尾到u->borrowbookname.end()之间的所有元素

个人信息

  • 修改密码

  1. //UserManage.cpp
  2. void ChangePassport(User* cu)//31
  3. {
  4.     string p1,p2;
  5.  
  6.     SetCCPos(8,4);
  7.  
  8.     cin>>p1;
  9.  
  10.     SetCCPos(9,5);
  11.  
  12.     cin>>p2;
  13.  
  14.     SetCCPos(0,7);
  15.  
  16.     if(p1 == p2)
  17.     {
  18.         cu->key = p1;
  19.         cout<<"修改密码成功"<<endl;
  20.  
  21.     }
  22.     else
  23.     {
  24.         cout<<"前后密码不一致,请重进"<<endl;
  25.     }
  26. }

  • 借阅记录

  1. //BorrowandReturn.cpp
  2. void ShowBorrowRecord(BorrowManage& bo,User* u)
  3. {
  4.     cout<<endl<<"书籍名字     ISBN               借阅时间                        还书状态"<<endl;
  5.     int num = bo.borrowrecording.size();
  6.  
  7.     for(int i = 0;i < num;i++)
  8.     {
  9.         string uname = bo.borrowrecording[i]->Username();
  10.         if(uname == u->name)
  11.         {
  12.             cout<<bo.borrowrecording[i]->Name_book()<<"\t";
  13.  
  14.             cout<<bo.borrowrecording[i]->Isbn_book()<<"\t";
  15.  
  16.             cout<<bo.borrowrecording[i]->Date_borrow()<<"\t";
  17.  
  18.             cout<<bo.borrowrecording[i]->Date_return()<<"\n";
  19.         }
  20.     }
  21. }

  • 退出登录

将arrow指向null，再在main中判断，如果arrow为空即返回登录界面

用户管理（需要管理员权限）

  • 用户列表

用户信息是用链表储存，遍历链表即可

  1. //UserManage.cpp
  2. void printUserList(UserList* ul)//41
  3. {
  4.     User* current = ul->head;
  5.  
  6.     cout<<"用户名"<<" "<<"密码"<<" "<<"身份"<<" "<<"现借阅书数"<<endl;
  7.  
  8.     while(current!= NULL)
  9.     {
  10.         cout<<current->name;
  11.         cout<<" "<<current->key;
  12.         cout<<" ";
  13.  
  14.         if(current->iden == 0)
  15.             cout<<"管理员"<<" ";
  16.         else if(current->iden == 1)
  17.             cout<<"普通用户"<<" ";
  18.         cout<<current->borrownum<<endl;
  19.  
  20.         current = current->next;
  21.     }
  22.  
  23. }

  • 增加用户

新增节点，接到用户链表结尾

  1. //UserManage.cpp
  2. void addUser(UserList* p)//42
  3. {
  4.     User* current = new User;
  5.     current->next = nullptr;
  6.  
  7.     SetCCPos(7,4);
  8.     cin>>current->name;
  9.  
  10.     SetCCPos(6,5);
  11.     cin>>current->iden;
  12.  
  13.     current->key = "000000";
  14.  
  15.     current->borrownum = 0;
  16.  
  17.     SetCCPos(0,8);
  18.  
  19.     if(CheckName(current->name,p))
  20.     {
  21.         p->tail->next = current;
  22.         p->length++;
  23.         p->tail = p->tail->next;
  24.         cout<<"添加成功"<<endl;
  25.     }
  26.     else
  27.     {
  28.         delete current;
  29.         cout<<"用户名已被注册，请重进"<<endl;
  30.     }
  31. }

  • 删除用户

删除该用户的节点，并且删除该用户的借阅记录

  1. //UserManage.cpp
  2. void delUser(UserList* p,BorrowManage& bo)
  3. {
  4.     string dname;
  5.  
  6.     SetCCPos(7,4);
  7.  
  8.     cin>>dname;
  9.  
  10.     User* del = LoacteUser(dname,p);
  11.  
  12.     User* temp = p->head;
  13.  
  14.     while(temp->next != del&&temp!=nullptr)
  15.     {
  16.         temp = temp->next;
  17.     }
  18.  
  19.     if(temp == nullptr)
  20.         cout<<"找不到该用户"<<endl;
  21.  
  22.     if(del->next ==nullptr)
  23.     {
  24.         p->tail = temp;
  25.         temp->next = del->next;
  26.         p->length--;
  27.  
  28.         int num = bo.borrowrecording.size();
  29.  
  30.         for(int i = 0;i < num;i++)
  31.         {
  32.             if(bo.borrowrecording[i]->Username() == dname)
  33.                 bo.borrowrecording.erase(bo.borrowrecording.begin()+i);
  34.         }
  35.         delete del;
  36.         SetCCPos(0,6);
  37.         cout<<"删除成功"<<endl;
  38.         return;
  39.     }
  40.     else if(del->next != nullptr)
  41.     {
  42.         temp->next = del->next;
  43.         p->length--;
  44.  
  45.         int num = bo.borrowrecording.size();
  46.  
  47.         for(int i = 0;i < num;i++)
  48.         {
  49.             if(bo.borrowrecording[i]->Username() == dname)
  50.                 bo.borrowrecording.erase(bo.borrowrecording.begin()+i);
  51.         }
  52.         delete del;
  53.         SetCCPos(0,6);
  54.         cout<<"删除成功"<<endl;
  55.         return;
  56.     }
  57.  
  58.     SetCCPos(0,6);
  59.     cout<<"未查找到该用户,请重进"<<endl;
  60. }

  • 重置指定用户密码

  1. //UserManage.cpp
  2. void resetKey(UserList* p)
  3. {
  4.     string rname;
  5.  
  6.     SetCCPos(7,4);
  7.  
  8.     cin>>rname;
  9.  
  10.     User* reset = LoacteUser(rname,p);
  11.  
  12.     reset->key = "000000";
  13.  
  14.     SetCCPos(0,7);
  15.  
  16.     cout<<"重置成功"<<endl;
  17. }

排行榜

  • 热门图书

思路：创建一个借书排行榜类，再创建一个管理借书排行榜类，借书排行榜对象中储存着这本书的书名，isbn和被借阅的次数，每个 借书排行榜对象 的地址装在 管理结束排行榜对象 的vector里，再依据被借阅次数在vector里从大到小重新排序，再输出前十个当作前十排行榜

  1. //head.h
  2. class BorrowBookRank
  3. {
  4. public:
  5.     BorrowBookRank(string bookna,string isb):number(1)
  6.     {
  7.         bookname = bookna;
  8.         isbn = isb;
  9.     }
  10.     string getBookname(void)
  11.     {
  12.         return bookname;
  13.     }
  14.     int number;                //被借阅次数
  15.  
  16. private:
  17.     string bookname;           //书名
  18.     string isbn;
  19. };
  20.  
  21. class BorrowBookRankManage
  22. {
  23. public:
  24.     vector <BorrowBookRank*> borrowbookrank;
  25.     void addrankbook(BorrowBookRank* bo)
  26.     {
  27.         borrowbookrank.push_back(bo);
  28.     }
  29. };
  1. //Ranking.cpp
  2. bool cmp(BorrowBookRank* a,BorrowBookRank* b)
  3. {
  4.     return a->number>b->number;
  5. }
  6.  
  7. void HotBookRank(BorrowManage& bo)
  8. {
  9.     BorrowBookRankManage bbrm;          //管理排行榜
  10.  
  11.     int records = bo.borrowrecording.size();
  12.  
  13.     vector <string>exist;               //记录用户借过的书
  14.  
  15.     vector<string>::iterator iter;
  16.  
  17.     for(int i = 0;i < records;i++)
  18.     {
  19.         string recordbookname = bo.borrowrecording[i]->Name_book();
  20.  
  21.         iter = std::find(exist.begin(), exist.end(), recordbookname);       //查找是否已经在exist中，防止该书重复添加
  22.  
  23.         if (iter == exist.end())
  24.         {
  25.             exist.push_back(recordbookname);
  26.             BorrowBookRank* temp = new BorrowBookRank(recordbookname,bo.borrowrecording[i]->Isbn_book());
  27.             bbrm.addrankbook(temp);                                         //添加到排行榜里
  28.         }
  29.         else
  30.         {
  31.             int num = bbrm.borrowbookrank.size();
  32.             for(int j = 0;j < num;j++)
  33.             {
  34.                 if(recordbookname == bbrm.borrowbookrank[j]->getBookname())
  35.                 {
  36.                     bbrm.borrowbookrank[j]->number++;                       //被借阅书加一
  37.                     break;
  38.                 }
  39.             }
  40.         }
  41.  
  42.     }
  43.  
  44.  
  45.     sort(bbrm.borrowbookrank.begin(),bbrm.borrowbookrank.end(),cmp);            //排行榜依据被借阅数排序
  46.  
  47.     cout<<"图书排行                             借阅人数"<<endl;
  48.  
  49.     if(bbrm.borrowbookrank.size() == 0)
  50.         return;
  51.  
  52.     for(int i = 0;i < 10;i++)
  53.     {
  54.         string na = bbrm.borrowbookrank[i]->getBookname();
  55.         while(na.length()<40)
  56.             na+=" ";
  57.         cout<<na<<bbrm.borrowbookrank[i]->number<<endl;
  58.     }
  59.  
  60. }

  • 借书次数

  1. //Ranking.cpp
  2. struct CompareBySize
  3. {
  4.     bool operator()(const short& a, const short& b) const
  5.     {
  6.         return a > b;
  7.     }
  8. };
  9.  
  10. void CrazyBorrwoMan(UserList* ul)
  11. {
  12.     User* current = ul->head;
  13.  
  14.     multimap<short,string,CompareBySize> rankuser;          //用户借阅数排行榜
  15.  
  16.     int num = ul->length;
  17.  
  18.     while(num--)
  19.     {
  20.         rankuser.insert(make_pair(current->sumbooknum,current->name));          //将用户名与借阅数之间形成映射
  21.         current = current->next;
  22.     }
  23.  
  24.     cout<<"用户名\t\t\t\t借阅数"<<endl;
  25.  
  26.     int count = 0;
  27.  
  28.     for(auto it = rankuser.begin();it != rankuser.end()&&count<10;it++,count++)
  29.     {
  30.         cout<<it->second<<"\t\t\t\t"<<it->first<<endl;
  31.     }
  32.  
  33. }

使用multimap而不用map和其他是因为如果两个用户的借阅数相同，用map就会将前一个映射覆盖掉，而使用multimap可以储存多重映射，允许借阅数重复 

  • 热门图书

思路：先获取各书籍的出版时间，再创建出版时间对象，然后将出版时间对象与书籍名称形成映射存入mutimap中，(需事先重载>运算符)，然后依据日期大小排序，然后输出前十

  1. //Ranking.cpp
  2. struct CompareBySize_date
  3. {
  4.     bool operator()(const Date& a, const Date& b) const
  5.     {
  6.         return a > b;
  7.     }
  8. };
  9.  
  10. void LatestBook(BookList* p)
  11. {
  12.     Book* current = p->head;
  13.  
  14.     multimap<Date,string,CompareBySize_date> rankdate;          //最新书籍排行榜
  15.  
  16.     int num = p->length;
  17.  
  18.     Date** dd = new Date*[num];
  19.  
  20.     for(int k = 0; k < num;k++)
  21.     {
  22.         string d = current->publisheddate;
  23.         short year = 0,month = 0,day = 0;
  24.         int count = 0;
  25.         int dl = d.length();
  26.  
  27.         for(int i = 0;i < dl;i++)           //获取该数的出版时间
  28.         {
  29.             if(d[i]>='0'&&d[i]<='9')
  30.             {
  31.                 if(count ==0)
  32.                     year = year*10 + (d[i]-'0');
  33.                 else if(count == 1)
  34.                     month = month*10 + (d[i]-'0');
  35.                 else if(count == 2)
  36.                     day = day*10 + (d[i]-'0');
  37.             }
  38.             else
  39.                 count++;
  40.         }
  41.  
  42.         dd[k] = new Date(year,month,day);       //创建出版日期对象
  43.  
  44.  
  45.         rankdate.insert(make_pair(*dd[k],current->bookname));       //将书籍与出版日期之间形成映射
  46.         current = current->next;
  47.     }
  48.  
  49.     int count1 = 0;
  50.  
  51.     for(auto it = rankdate.begin();it != rankdate.end()&&count1<10;it++,count1++)
  52.     {
  53.         string na = it->second;
  54.         while(na.length()<50)
  55.             na+=" ";
  56.         cout<<na<<"\t\t\t\t"<<it->first<<endl;
  57.     }
  58.  
  59.     for(int i = 0;i < num;i++)
  60.         delete dd[i];
  61.     delete[] dd;
  62. }

四、源代码资源

在主页上传的资源里

声明：本文内容由网友自发贡献，不代表【wpsshop博客】立场，版权归原作者所有，本站不承担相应法律责任。如您发现有侵权的内容，请联系我们。转载请注明出处：https://www.wpsshop.cn/w/很楠不爱3/article/detail/148709
推荐阅读
相关标签

Copyright © 2003-2013 www.wpsshop.cn 版权所有，并保留所有权利。

  

闽ICP备14008679号