• C++学习笔记（三十六）

    在完成对C语言的学习后，我最近开始了对C++和Java的学习，目前跟着视频学习了一些语法，也跟着敲了一些代码，有了一定的掌握程度。现在将跟着视频做的笔记进行整理。本篇博客是整理C++知识点的第三十六篇博客。

    本篇博客用C++实现了机房预约系统，本文是下部分。最后有总结，结束C++学习笔记系列。

    本系列博客所有C++代码都在Visual Studio 2022环境下编译运行。程序为64位。

    目录

    机房预约系统

    学生显示自身预约实现

    学生显示所有预约实现

    学生取消预约实现

    教师子菜单搭建以及注销实现

    教师显示所有预约实现

    教师审核预约实现

    总结

    机房预约系统

    接下来用C++实现一个机房预约系统，由于内容很长，分为三篇博客。本篇博客是第三部分。

    学生显示自身预约实现

    1. void student::look_my_reverse(void){
    2. 	ifstream ifs;
    3. 	ifs.open(REVERSE_FILE, ios::in);
    4. 	map<int, map> mm;
    5.  
    6. 	string date;
    7. 	string time;
    8. 	string id;
    9. 	string name;
    10. 	string room;
    11. 	string status;
    12.  
    13. 	while (ifs >> date && ifs >> time && ifs >> id && ifs >> name && ifs >> room && ifs >> status) {
    14. 		map m;
    15. 		string date1, date2;
    16. 		int pos;
    17. 		pos = date.find(":");
    18. 		date1 = date.substr(0, pos);
    19. 		date2 = date.substr(pos + 1, date.size() - pos - 1);
    20.  
    21. 		if (date2 == "1") {
    22. 			m.insert(make_pair(date1, "Monday"));
    23. 		}
    24. 		else if (date2 == "2") {
    25. 			m.insert(make_pair(date1, "Tuesday"));
    26. 		}
    27. 		else if (date2 == "3") {
    28. 			m.insert(make_pair(date1, "Wednesday"));
    29. 		}
    30. 		else if (date2 == "4") {
    31. 			m.insert(make_pair(date1, "Thursday"));
    32. 		}
    33. 		else if (date2 == "5") {
    34. 			m.insert(make_pair(date1, "Friday"));
    35. 		}
    36.  
    37. 		string time1, time2;
    38. 		pos = time.find(":");
    39. 		time1 = time.substr(0, pos);
    40. 		time2 = time.substr(pos + 1, time.size() - pos - 1);
    41. 		if (time2 == "1") {
    42. 			m.insert(make_pair(time1, "morning"));
    43. 		}
    44. 		else if (time2 == "2") {
    45. 			m.insert(make_pair(time1, "afternoon"));
    46. 		}
    47.  
    48. 		string id1, id2;
    49. 		pos = id.find(":");
    50. 		id1 = id.substr(0, pos);
    51. 		id2 = id.substr(pos + 1, id.size() - pos - 1);
    52. 		if (atoi(id2.c_str()) != this->id) {
    53. 			m.clear();
    54. 			continue;
    55. 		}
    56. 		m.insert(make_pair(id1, id2));
    57.  
    58. 		string name1, name2;
    59. 		pos = name.find(":");
    60. 		name1 = name.substr(0, pos);
    61. 		name2 = name.substr(pos + 1, name.size() - pos - 1);
    62. 		m.insert(make_pair(name1, name2));
    63.  
    64. 		string room1, room2;
    65. 		pos = room.find(":");
    66. 		room1 = room.substr(0, pos);
    67. 		room2 = room.substr(pos + 1, room.size() - pos - 1);
    68. 		m.insert(make_pair(room1, room2));
    69.  
    70. 		string status1, status2;
    71. 		pos = status.find(":");
    72. 		status1 = status.substr(0, pos);
    73. 		status2 = status.substr(pos + 1, status.size() - pos - 1);
    74. 		m.insert(make_pair(status1, status2));
    75.  
    76. 		mm.insert(make_pair(mm.size() + 1, m));
    77. 	}
    78. 	if (mm.size() == 0) {
    79. 		cout << "No record" << endl;
    80. 		return;
    81. 	}
    82.  
    83. 	for (map<int, map>::iterator ait = mm.begin(); ait != mm.end(); ++ait) {
    84. 		cout << "The number is " << ait->first << endl;
    85. 		for (map::iterator bit = ait->second.begin(); bit != ait->second.end(); ++bit) {
    86. 			cout << bit->first << ":" << bit->second << "   ";
    87. 		}
    88. 		cout << endl;
    89. 	}
    90. 	ifs.close();
    91. 	system("pause");
    92. 	system("cls");
    93. }

    这是student类的成员函数，创建了一个map容器mm，键为int类型，值为键和值都是string的map容器。随后遍历文件，对获取的信息进行处理，每次遍历都创建一个键和值是string的map容器m。将处理的信息加入m，每次循环结束后将当前的条数和m加入mm。如果id不是学生当前id，就结束本次循环，清空m。文件遍历完成后输出信息。

    学生显示所有预约实现

    1. void student::look_all_reverse(void){
    2. 	ifstream ifs;
    3. 	ifs.open(REVERSE_FILE, ios::in);
    4. 	map<int, map> mm;
    5.  
    6. 	string date;
    7. 	string time;
    8. 	string id;
    9. 	string name;
    10. 	string room;
    11. 	string status;
    12.  
    13. 	while (ifs >> date && ifs >> time && ifs >> id && ifs >> name && ifs >> room && ifs >> status) {
    14. 		map m;
    15. 		string date1, date2;
    16. 		int pos;
    17. 		pos = date.find(":");
    18. 		date1 = date.substr(0, pos);
    19. 		date2 = date.substr(pos + 1, date.size() - pos - 1);
    20.  
    21. 		if (date2 == "1") {
    22. 			m.insert(make_pair(date1, "Monday"));
    23. 		}
    24. 		else if (date2 == "2") {
    25. 			m.insert(make_pair(date1, "Tuesday"));
    26. 		}
    27. 		else if (date2 == "3") {
    28. 			m.insert(make_pair(date1, "Wednesday"));
    29. 		}
    30. 		else if (date2 == "4") {
    31. 			m.insert(make_pair(date1, "Thursday"));
    32. 		}
    33. 		else if (date2 == "5") {
    34. 			m.insert(make_pair(date1, "Friday"));
    35. 		}
    36.  
    37. 		string time1, time2;
    38. 		pos = time.find(":");
    39. 		time1 = time.substr(0, pos);
    40. 		time2 = time.substr(pos + 1, time.size() - pos - 1);
    41. 		if (time2 == "1") {
    42. 			m.insert(make_pair(time1, "morning"));
    43. 		}
    44. 		else if (time2 == "2") {
    45. 			m.insert(make_pair(time1, "afternoon"));
    46. 		}
    47.  
    48. 		string id1, id2;
    49. 		pos = id.find(":");
    50. 		id1 = id.substr(0, pos);
    51. 		id2 = id.substr(pos + 1, id.size() - pos - 1);
    52. 		m.insert(make_pair(id1, id2));
    53.  
    54. 		string name1, name2;
    55. 		pos = name.find(":");
    56. 		name1 = name.substr(0, pos);
    57. 		name2 = name.substr(pos + 1, name.size() - pos - 1);
    58. 		m.insert(make_pair(name1, name2));
    59.  
    60. 		string room1, room2;
    61. 		pos = room.find(":");
    62. 		room1 = room.substr(0, pos);
    63. 		room2 = room.substr(pos + 1, room.size() - pos - 1);
    64. 		m.insert(make_pair(room1, room2));
    65.  
    66. 		string status1, status2;
    67. 		pos = status.find(":");
    68. 		status1 = status.substr(0, pos);
    69. 		status2 = status.substr(pos + 1, status.size() - pos - 1);
    70. 		m.insert(make_pair(status1, status2));
    71.  
    72. 		mm.insert(make_pair(mm.size() + 1, m));
    73. 	}
    74. 	ifs.close();
    75.  
    76. 	for (map<int, map>::iterator ait = mm.begin(); ait != mm.end(); ++ait) {
    77. 		cout << "The number is " << ait->first << endl;
    78. 		for (map::iterator bit = ait->second.begin(); bit != ait->second.end(); ++bit) {
    79. 			cout << bit->first << ":" << bit->second << "   ";
    80. 		}
    81. 		cout << endl;
    82. 	}
    83. 	ifs.close();
    84. 	system("pause");
    85. 	system("cls");
    86. }

    这一部分和上一部分基本完全一样，就是不再筛选学号是否为当前学号。

    学生取消预约实现

    1. void student::cancel_reverse(){
    2. 	int i = 0;
    3. 	map<int, int>kv;
    4. 	ifstream ifs;
    5. 	ifs.open(REVERSE_FILE, ios::in);
    6. 	map<int, map> mm;
    7.  
    8. 	string date;
    9. 	string time;
    10. 	string id;
    11. 	string name;
    12. 	string room;
    13. 	string status;
    14.  
    15. 	while (ifs >> date && ifs >> time && ifs >> id && ifs >> name && ifs >> room && ifs >> status) {
    16. 		map m;
    17. 		string date1, date2;
    18. 		int pos;
    19. 		pos = date.find(":");
    20. 		date1 = date.substr(0, pos);
    21. 		date2 = date.substr(pos + 1, date.size() - pos - 1);
    22.  
    23. 		if (date2 == "1") {
    24. 			m.insert(make_pair(date1, "Monday"));
    25. 		}
    26. 		else if (date2 == "2") {
    27. 			m.insert(make_pair(date1, "Tuesday"));
    28. 		}
    29. 		else if (date2 == "3") {
    30. 			m.insert(make_pair(date1, "Wednesday"));
    31. 		}
    32. 		else if (date2 == "4") {
    33. 			m.insert(make_pair(date1, "Thursday"));
    34. 		}
    35. 		else if (date2 == "5") {
    36. 			m.insert(make_pair(date1, "Friday"));
    37. 		}
    38.  
    39. 		string time1, time2;
    40. 		pos = time.find(":");
    41. 		time1 = time.substr(0, pos);
    42. 		time2 = time.substr(pos + 1, time.size() - pos - 1);
    43. 		if (time2 == "1") {
    44. 			m.insert(make_pair(time1, "morning"));
    45. 		}
    46. 		else if (time2 == "2") {
    47. 			m.insert(make_pair(time1, "afternoon"));
    48. 		}
    49.  
    50. 		string id1, id2;
    51. 		pos = id.find(":");
    52. 		id1 = id.substr(0, pos);
    53. 		id2 = id.substr(pos + 1, id.size() - pos - 1);
    54. 		m.insert(make_pair(id1, id2));
    55.  
    56. 		string name1, name2;
    57. 		pos = name.find(":");
    58. 		name1 = name.substr(0, pos);
    59. 		name2 = name.substr(pos + 1, name.size() - pos - 1);
    60. 		m.insert(make_pair(name1, name2));
    61.  
    62. 		string room1, room2;
    63. 		pos = room.find(":");
    64. 		room1 = room.substr(0, pos);
    65. 		room2 = room.substr(pos + 1, room.size() - pos - 1);
    66. 		m.insert(make_pair(room1, room2));
    67.  
    68. 		string status1, status2;
    69. 		pos = status.find(":");
    70. 		status1 = status.substr(0, pos);
    71. 		status2 = status.substr(pos + 1, status.size() - pos - 1);
    72. 		m.insert(make_pair(status1, status2));
    73.  
    74. 		mm.insert(make_pair(mm.size() + 1, m));
    75. 		if (atoi(id2.c_str()) == this->id && (status2 == "adopted" || status2 == "auditing")) {
    76. 			i += 1;
    77. 			kv.insert(make_pair(i, mm.size()));
    78. 		}
    79. 	}
    80. 	ifs.close();
    81.  
    82. 	for (map<int, int>::iterator iiit = kv.begin(); iiit != kv.end(); ++iiit) {
    83. 		cout << "The number is " << iiit->first << endl;
    84. 		for (map<int, map>::iterator ait = mm.begin(); ait != mm.end(); ++ait) {
    85. 			if (iiit->second == ait->first) {
    86. 				for (map::iterator bit = ait->second.begin(); bit != ait->second.end(); ++bit) {
    87. 					cout << bit->first << ":" << bit->second << "   ";
    88. 				}
    89. 			}
    90. 		}
    91. 		cout << endl;
    92. 	}
    93.  
    94. 	while (true) {
    95. 		cout << "Please enter the number to cancel,0 to exit" << endl;
    96. 		int choice;
    97. 		cin >> choice;
    98. 		if (choice == 0) {
    99. 			break;
    100. 		}else if(choice > 0 && choice <= kv.size()) {
    101. 			for (map<int, int>::iterator iiit = kv.begin(); iiit != kv.end(); ++iiit) {
    102. 				if (iiit->first == choice) {
    103. 					for (map<int, map>::iterator ait = mm.begin(); ait != mm.end(); ++ait) {
    104. 						if (iiit->second == ait->first) {
    105. 							int i = 0;
    106. 							for (map::iterator bit = ait->second.begin(); bit != ait->second.end(); ++bit) {
    107. 								if (i == 4) {
    108. 									bit->second = "cancelled";
    109. 								}
    110. 								i += 1;
    111. 							}
    112. 						}
    113. 					}
    114. 				}
    115. 			}
    116.  
    117. 			for (map<int, map>::iterator ait = mm.begin(); ait != mm.end(); ++ait) {
    118. 				cout << "The number is " << ait->first << endl;
    119. 				for (map::iterator bit = ait->second.begin(); bit != ait->second.end(); ++bit) {
    120. 					cout << bit->first << ":" << bit->second << "   ";
    121. 				}
    122. 				cout << endl;
    123. 			}
    124. 			cout << "Done" << endl;
    125.  
    126. 			ofstream ofs;
    127. 			ofs.open(REVERSE_FILE, ios::trunc);
    128. 			ofs.close();
    129. 			ofs.open(REVERSE_FILE, ios::in);
    130.  
    131. 			for (map<int, map>::iterator ait = mm.begin(); ait != mm.end(); ++ait) {
    132. 				int i = 0;
    133. 				int daychoice;
    134. 				string tempid;
    135. 				string tempname;
    136. 				string roomchoice;
    137. 				string status;
    138. 				int timechoice;
    139. 				for (map::iterator bit = ait->second.begin(); bit != ait->second.end(); ++bit) {
    140. 					if (i == 0) {
    141. 						if (bit->second == "Monday") {
    142. 							daychoice = 1;
    143. 						}
    144. 						else if (bit->second == "Tuesday") {
    145. 							daychoice = 2;
    146. 						}
    147. 						else if (bit->second == "Wednesday") {
    148. 							daychoice = 3;
    149. 						}
    150. 						else if (bit->second == "Thursday") {
    151. 							daychoice = 4;
    152. 						}
    153. 						else if (bit->second == "Friday") {
    154. 							daychoice = 5;
    155. 						}
    156. 					}
    157. 					else if (i == 1) {
    158. 						tempid = bit->second;
    159. 					}
    160. 					else if (i == 2) {
    161. 						tempname = bit->second;
    162. 					}
    163. 					else if (i == 3) {
    164. 						roomchoice = bit->second;
    165. 					}
    166. 					else if (i == 4) {
    167. 						status = bit->second;
    168. 					}
    169. 					else if (i == 5) {
    170. 						if (bit->second == "morning") {
    171. 							timechoice = 1;
    172. 						}
    173. 						else if(bit->second == "afternoon") {
    174. 							timechoice = 2;
    175. 						}
    176. 					}
    177. 					i += 1;
    178. 				}
    179. 				ofs << "date:" << daychoice << "   " << " time:" << timechoice << "   " << " id:" << tempid << "   ";
    180. 				ofs << " name:" << tempname << "   " << " room:" << roomchoice << "   " << " status:" << status << endl;
    181. 			}
    182. 			break;
    183. 		}
    184. 		else {
    185. 			cout << "Please enter the right choice" << endl;
    186. 		}
    187. 	}
    188. 	system("pause");
    189. 	system("cls");
    190. }

    这是student类的成员函数。创建了一个map容器mm，键为int类型，值为键和值都是string的map容器。还有一个map容器kv，键和值都是int类型。随后遍历文件，对获取的信息进行处理，每次遍历都创建一个键和值是string的map容器m。将处理的信息加入m，每次循环结束后将当前的条数和m加入mm。如果学号是学生当前学号，并且状态是待审核或者审核通过，就将当前mm的大小作为值，满足当前条件的信息数作为键加入kv。

    随后大循环遍历kv，小循环遍历mm，只有mm当前的键是kv当前的值时，才会输出信息。就是做到信息对应。

    然后用户要选择取消的条目，条目的总数就是kv的元素个数，不能超过这个个数。输入0就代表不取消任何记录，输入错误要求重新输入。输入正确后，选项就代表kv的键，找到这个键在kv中对应的值，然后找到此值在mm中对应的键，然后将状态改为已取消。

    然后显示修改后的内容，清空文件原来的内容并重新写入。

    个人感觉这一部分当初写得不好，太麻烦，但是后来也没改。后面还有一处极为类似的代码。

    教师子菜单搭建以及注销实现

    1. void do_teacher(identity* person)
    2. {
    3. 	cout << "Welcome " << person->name << '!' << endl;
    4. 	teacher* tea = (teacher*)person;
    5. 	while (true) {
    6. 		tea->show_menu();
    7. 		int choice;
    8. 		cout << "Please enter your choice " << endl;
    9. 		cin >> choice;
    10.  
    11. 		if (choice == 1) {
    12. 			tea->look_reverse();
    13. 		}
    14. 		else if (choice == 2) {
    15. 			tea->audit_reverse();
    16. 		}
    17. 		else if (choice == 0) {
    18. 			delete tea;
    19. 			cout << "Have logged out" << endl;
    20. 			system("pause");
    21. 			system("cls");
    22. 			break;
    23. 		}
    24. 		else {
    25. 			cout << "Enter error, please enter 1,2 or 0" << endl;
    26. 			system("pause");
    27. 			system("cls");
    28. 		}
    29. 	}
    30. }

    这是reservesystem.cpp中的内容。首先给出提示欢迎用户，然后将多态的指针向下转型，以调用子类的成员函数。随后进入循环，给出菜单并要求用户选择选项，每个选项进入不同的成员函数，输入0就销毁此指针并表示注销，随后退出此函数。输入其他选项就要求用户重新输入。

    1. void teacher::show_menu()
    2. {
    3. 	cout << "****************************************" << endl;
    4. 	cout << "********** 1. look reservation *********" << endl;
    5. 	cout << "********** 2. audit reservation ********" << endl;
    6. 	cout << "********** 0. log out ******************" << endl;
    7. 	cout << "****************************************" << endl;
    8. }

    这是teacher类的成员函数，显示菜单。

    教师显示所有预约实现

    1. void teacher::look_reverse(void)
    2. {
    3. 	ifstream ifs;
    4. 	ifs.open(REVERSE_FILE, ios::in);
    5. 	map<int, map> mm;
    6.  
    7. 	string date;
    8. 	string time;
    9. 	string id;
    10. 	string name;
    11. 	string room;
    12. 	string status;
    13.  
    14. 	while (ifs >> date && ifs >> time && ifs >> id && ifs >> name && ifs >> room && ifs >> status) {
    15. 		map m;
    16. 		string date1, date2;
    17. 		int pos;
    18. 		pos = date.find(":");
    19. 		date1 = date.substr(0, pos);
    20. 		date2 = date.substr(pos + 1, date.size() - pos - 1);
    21.  
    22. 		if (date2 == "1") {
    23. 			m.insert(make_pair(date1, "Monday"));
    24. 		}
    25. 		else if (date2 == "2") {
    26. 			m.insert(make_pair(date1, "Tuesday"));
    27. 		}
    28. 		else if (date2 == "3") {
    29. 			m.insert(make_pair(date1, "Wednesday"));
    30. 		}
    31. 		else if (date2 == "4") {
    32. 			m.insert(make_pair(date1, "Thursday"));
    33. 		}
    34. 		else if (date2 == "5") {
    35. 			m.insert(make_pair(date1, "Friday"));
    36. 		}
    37.  
    38. 		string time1, time2;
    39. 		pos = time.find(":");
    40. 		time1 = time.substr(0, pos);
    41. 		time2 = time.substr(pos + 1, time.size() - pos - 1);
    42. 		if (time2 == "1") {
    43. 			m.insert(make_pair(time1, "morning"));
    44. 		}
    45. 		else if (time2 == "2") {
    46. 			m.insert(make_pair(time1, "afternoon"));
    47. 		}
    48.  
    49. 		string id1, id2;
    50. 		pos = id.find(":");
    51. 		id1 = id.substr(0, pos);
    52. 		id2 = id.substr(pos + 1, id.size() - pos - 1);
    53. 		m.insert(make_pair(id1, id2));
    54.  
    55. 		string name1, name2;
    56. 		pos = name.find(":");
    57. 		name1 = name.substr(0, pos);
    58. 		name2 = name.substr(pos + 1, name.size() - pos - 1);
    59. 		m.insert(make_pair(name1, name2));
    60.  
    61. 		string room1, room2;
    62. 		pos = room.find(":");
    63. 		room1 = room.substr(0, pos);
    64. 		room2 = room.substr(pos + 1, room.size() - pos - 1);
    65. 		m.insert(make_pair(room1, room2));
    66.  
    67. 		string status1, status2;
    68. 		pos = status.find(":");
    69. 		status1 = status.substr(0, pos);
    70. 		status2 = status.substr(pos + 1, status.size() - pos - 1);
    71. 		m.insert(make_pair(status1, status2));
    72.  
    73. 		mm.insert(make_pair(mm.size() + 1, m));
    74. 	}
    75. 	ifs.close();
    76.  
    77. 	for (map<int, map>::iterator ait = mm.begin(); ait != mm.end(); ++ait) {
    78. 		cout << "The number is " << ait->first << endl;
    79. 		for (map::iterator bit = ait->second.begin(); bit != ait->second.end(); ++bit) {
    80. 			cout << bit->first << ":" << bit->second << "   ";
    81. 		}
    82. 		cout << endl;
    83. 	}
    84. 	ifs.close();
    85. 	system("pause");
    86. 	system("cls");
    87. }

    这个功能上面实现过了，这里就不再详细解释了。

    教师审核预约实现

    1. void teacher::audit_reverse(void)
    2. {
    3. 	int i = 0;
    4. 	map<int, int>kv;
    5. 	ifstream ifs;
    6. 	ifs.open(REVERSE_FILE, ios::in);
    7. 	map<int, map> mm;
    8.  
    9. 	string date;
    10. 	string time;
    11. 	string id;
    12. 	string name;
    13. 	string room;
    14. 	string status;
    15.  
    16. 	while (ifs >> date && ifs >> time && ifs >> id && ifs >> name && ifs >> room && ifs >> status) {
    17. 		map m;
    18. 		string date1, date2;
    19. 		int pos;
    20. 		pos = date.find(":");
    21. 		date1 = date.substr(0, pos);
    22. 		date2 = date.substr(pos + 1, date.size() - pos - 1);
    23.  
    24. 		if (date2 == "1") {
    25. 			m.insert(make_pair(date1, "Monday"));
    26. 		}
    27. 		else if (date2 == "2") {
    28. 			m.insert(make_pair(date1, "Tuesday"));
    29. 		}
    30. 		else if (date2 == "3") {
    31. 			m.insert(make_pair(date1, "Wednesday"));
    32. 		}
    33. 		else if (date2 == "4") {
    34. 			m.insert(make_pair(date1, "Thursday"));
    35. 		}
    36. 		else if (date2 == "5") {
    37. 			m.insert(make_pair(date1, "Friday"));
    38. 		}
    39.  
    40. 		string time1, time2;
    41. 		pos = time.find(":");
    42. 		time1 = time.substr(0, pos);
    43. 		time2 = time.substr(pos + 1, time.size() - pos - 1);
    44. 		if (time2 == "1") {
    45. 			m.insert(make_pair(time1, "morning"));
    46. 		}
    47. 		else if (time2 == "2") {
    48. 			m.insert(make_pair(time1, "afternoon"));
    49. 		}
    50.  
    51. 		string id1, id2;
    52. 		pos = id.find(":");
    53. 		id1 = id.substr(0, pos);
    54. 		id2 = id.substr(pos + 1, id.size() - pos - 1);
    55. 		m.insert(make_pair(id1, id2));
    56.  
    57. 		string name1, name2;
    58. 		pos = name.find(":");
    59. 		name1 = name.substr(0, pos);
    60. 		name2 = name.substr(pos + 1, name.size() - pos - 1);
    61. 		m.insert(make_pair(name1, name2));
    62.  
    63. 		string room1, room2;
    64. 		pos = room.find(":");
    65. 		room1 = room.substr(0, pos);
    66. 		room2 = room.substr(pos + 1, room.size() - pos - 1);
    67. 		m.insert(make_pair(room1, room2));
    68.  
    69. 		string status1, status2;
    70. 		pos = status.find(":");
    71. 		status1 = status.substr(0, pos);
    72. 		status2 = status.substr(pos + 1, status.size() - pos - 1);
    73. 		m.insert(make_pair(status1, status2));
    74.  
    75. 		mm.insert(make_pair(mm.size() + 1, m));
    76. 		if (status2 == "auditing") {
    77. 			i += 1;
    78. 			kv.insert(make_pair(i, mm.size()));
    79. 		}
    80. 	}
    81. 	ifs.close();
    82.  
    83. 	if (kv.size() == 0) {
    84. 		cout << "No record to be audited" << endl;
    85. 		return;
    86. 	}
    87.  
    88. 	while (true) {
    89. 		for (map<int, int>::iterator iiit = kv.begin(); iiit != kv.end(); ++iiit) {
    90. 			cout << "The number is " << iiit->first << endl;
    91. 			for (map<int, map>::iterator ait = mm.begin(); ait != mm.end(); ++ait) {
    92. 				if (iiit->second == ait->first) {
    93. 					for (map::iterator bit = ait->second.begin(); bit != ait->second.end(); ++bit) {
    94. 						cout << bit->first << ":" << bit->second << "   ";
    95. 					}
    96. 				}
    97. 			}
    98. 			cout << endl;
    99. 		}
    100.  
    101. 		cout << "Please enter the number to audit,0 to exit" << endl;
    102. 		int choice;
    103. 		cin >> choice;
    104. 		if (choice == 0) {
    105. 			break;
    106. 		}
    107. 		else if (choice > 0 && choice <= kv.size()) {
    108. 			int audit;
    109. 			while (true) {
    110. 				cout << "Please enter the audit" << endl;
    111. 				cout << "1.yes 2.no" << endl;
    112. 				cin >> audit;
    113.  
    114. 				if (audit == 1 || audit == 2) {
    115. 					break;
    116. 				}
    117. 				else {
    118. 					cout << "Please enter 1 or 2" << endl;
    119. 				}
    120. 			}
    121.  
    122. 			for (map<int, int>::iterator iiit = kv.begin(); iiit != kv.end(); ++iiit) {
    123. 				if (iiit->first == choice) {
    124. 					for (map<int, map>::iterator ait = mm.begin(); ait != mm.end(); ++ait) {
    125. 						if (iiit->second == ait->first) {
    126. 							int i = 0;
    127. 							for (map::iterator bit = ait->second.begin(); bit != ait->second.end(); ++bit) {
    128. 								if (i == 4&&audit == 1) {
    129. 									bit->second = "adopted";
    130. 								}
    131. 								else if(i ==4 && audit == 2) {
    132. 									bit->second = "refused";
    133. 								}
    134. 								i += 1;
    135. 							}
    136. 						}
    137. 					}
    138. 				}
    139. 			}
    140.  
    141. 			for (map<int, map>::iterator ait = mm.begin(); ait != mm.end(); ++ait) {
    142. 				cout << "The number is " << ait->first << endl;
    143. 				for (map::iterator bit = ait->second.begin(); bit != ait->second.end(); ++bit) {
    144. 					cout << bit->first << ":" << bit->second << "   ";
    145. 				}
    146. 				cout << endl;
    147. 			}
    148. 			cout << "Done" << endl;
    149.  
    150. 			ofstream ofs;
    151. 			ofs.open(REVERSE_FILE, ios::trunc);
    152. 			ofs.close();
    153. 			ofs.open(REVERSE_FILE, ios::in);
    154.  
    155. 			for (map<int, map>::iterator ait = mm.begin(); ait != mm.end(); ++ait) {
    156. 				int i = 0;
    157. 				int daychoice;
    158. 				string tempid;
    159. 				string tempname;
    160. 				string roomchoice;
    161. 				string status;
    162. 				int timechoice;
    163. 				for (map::iterator bit = ait->second.begin(); bit != ait->second.end(); ++bit) {
    164. 					if (i == 0) {
    165. 						if (bit->second == "Monday") {
    166. 							daychoice = 1;
    167. 						}
    168. 						else if (bit->second == "Tuesday") {
    169. 							daychoice = 2;
    170. 						}
    171. 						else if (bit->second == "Wednesday") {
    172. 							daychoice = 3;
    173. 						}
    174. 						else if (bit->second == "Thursday") {
    175. 							daychoice = 4;
    176. 						}
    177. 						else if (bit->second == "Friday") {
    178. 							daychoice = 5;
    179. 						}
    180. 					}
    181. 					else if (i == 1) {
    182. 						tempid = bit->second;
    183. 					}
    184. 					else if (i == 2) {
    185. 						tempname = bit->second;
    186. 					}
    187. 					else if (i == 3) {
    188. 						roomchoice = bit->second;
    189. 					}
    190. 					else if (i == 4) {
    191. 						status = bit->second;
    192. 					}
    193. 					else if (i == 5) {
    194. 						if (bit->second == "morning") {
    195. 							timechoice = 1;
    196. 						}
    197. 						else if (bit->second == "afternoon") {
    198. 							timechoice = 2;
    199. 						}
    200. 					}
    201. 					i += 1;
    202. 				}
    203. 				ofs << "date:" << daychoice << "   " << " time:" << timechoice << "   " << " id:" << tempid << "   ";
    204. 				ofs << " name:" << tempname << "   " << " room:" << roomchoice << "   " << " status:" << status << endl;
    205. 			}
    206. 			ofs.close();
    207. 		}
    208. 		else {
    209. 			cout << "Please enter the right choice" << endl;
    210. 		}
    211. 		kv.clear();
    212. 		mm.clear();
    213. 		int i = 0;
    214. 		ifs.open(REVERSE_FILE, ios::in);
    215.  
    216. 		string date;
    217. 		string time;
    218. 		string id;
    219. 		string name;
    220. 		string room;
    221. 		string status;
    222.  
    223. 		while (ifs >> date && ifs >> time && ifs >> id && ifs >> name && ifs >> room && ifs >> status) {
    224. 			map m;
    225. 			string date1, date2;
    226. 			int pos;
    227. 			pos = date.find(":");
    228. 			date1 = date.substr(0, pos);
    229. 			date2 = date.substr(pos + 1, date.size() - pos - 1);
    230.  
    231. 			if (date2 == "1") {
    232. 				m.insert(make_pair(date1, "Monday"));
    233. 			}
    234. 			else if (date2 == "2") {
    235. 				m.insert(make_pair(date1, "Tuesday"));
    236. 			}
    237. 			else if (date2 == "3") {
    238. 				m.insert(make_pair(date1, "Wednesday"));
    239. 			}
    240. 			else if (date2 == "4") {
    241. 				m.insert(make_pair(date1, "Thursday"));
    242. 			}
    243. 			else if (date2 == "5") {
    244. 				m.insert(make_pair(date1, "Friday"));
    245. 			}
    246.  
    247. 			string time1, time2;
    248. 			pos = time.find(":");
    249. 			time1 = time.substr(0, pos);
    250. 			time2 = time.substr(pos + 1, time.size() - pos - 1);
    251. 			if (time2 == "1") {
    252. 				m.insert(make_pair(time1, "morning"));
    253. 			}
    254. 			else if (time2 == "2") {
    255. 				m.insert(make_pair(time1, "afternoon"));
    256. 			}
    257.  
    258. 			string id1, id2;
    259. 			pos = id.find(":");
    260. 			id1 = id.substr(0, pos);
    261. 			id2 = id.substr(pos + 1, id.size() - pos - 1);
    262. 			m.insert(make_pair(id1, id2));
    263.  
    264. 			string name1, name2;
    265. 			pos = name.find(":");
    266. 			name1 = name.substr(0, pos);
    267. 			name2 = name.substr(pos + 1, name.size() - pos - 1);
    268. 			m.insert(make_pair(name1, name2));
    269.  
    270. 			string room1, room2;
    271. 			pos = room.find(":");
    272. 			room1 = room.substr(0, pos);
    273. 			room2 = room.substr(pos + 1, room.size() - pos - 1);
    274. 			m.insert(make_pair(room1, room2));
    275.  
    276. 			string status1, status2;
    277. 			pos = status.find(":");
    278. 			status1 = status.substr(0, pos);
    279. 			status2 = status.substr(pos + 1, status.size() - pos - 1);
    280. 			m.insert(make_pair(status1, status2));
    281.  
    282. 			mm.insert(make_pair(mm.size() + 1, m));
    283. 			if (status2 == "auditing") {
    284. 				i += 1;
    285. 				kv.insert(make_pair(i, mm.size()));
    286. 			}
    287. 		}
    288. 		ifs.close();
    289.  
    290. 		if (kv.size() == 0) {
    291. 			cout << "No record to be audited" << endl;
    292. 			system("pause");
    293. 			system("cls");
    294. 			return;
    295. 		}
    296. 	}
    297. 	system("pause");
    298. 	system("cls");
    299. }

    这一部分代码实现和上面的学生取消预约是类似的，这里只说一下不同的地方。同样这一处设计也不行，当初赶工后的结果。

    首先，加入kv的计数原则改为状态在审核中的条目。然后这里设计了循环，每次循环的开头显示审核中的信息，并要求用户输入要决定的选项。输入0退出，然后条目的编号同样不能大于kv的元素个数。然后是输入1表示同意输入2表示拒绝，随后修改相关的条目。然后是输出修改后信息，写入文件。最后，由于在每次循环开头输出信息，因此在完成这一系列操作后，要从文件中将信息读取，覆盖原来容器的内容。

    那么现在机房预约系统也结束了，虽然像上面提到的一样，两个地方的代码太多，但是整体还可以，这个有一定的难度。

    总结

    那么C++的所有三十六篇笔记就结束了，从8月4日到现在，用了大约二十天，将前面看视频的笔记整理了一下。在文章划分上，尽量将同一块知识点放在一块。现在对C++有了一定的掌握程度，接下来就该看书进阶了。就目前知识来讲C++确实有一定难度，后面的进阶只会更难。现在我已经线上大二开学，在家上网课，估计会上不到一个月网课。总之，接下来该继续努力了。

  • 相关阅读:
    基于typeorm的nestjs项目使用@zdhsoft/tmg将数据库生成数据模型
    java编程基础总结——31.多线程编程相关知识
    Oracle常见的等待事件
    15：00面试，15：06就出来了，问的问题有点变态。。。
    新学期，新FLAG | 要以码为梦而非夜郎自大
    Python 算法高级篇：归并排序的优化与外部排序
    Shell在日常工作中的应用实践
    四、矩阵的分类
    [树形dp]Hanging Hearts Codeforces1740E
    第11章 通信网络
  • 原文地址：https://blog.csdn.net/m0_71007572/article/details/126471981