Repository navigation
Expand file tree
/
Copy pathLibrari_Management_System.cpp
More file actions
423 lines (356 loc) · 11.1 KB
/
Copy pathLibrari_Management_System.cpp
File metadata and controls
423 lines (356 loc) · 11.1 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
#include <iostream>
#include <string>
using namespace std;
struct Book {
int code;
string title;
string author;
int year;
bool available;
string requestQueue[20];
int front = 0;
int rear = -1;
bool isQueueEmpty() { return front > rear; }
bool isQueueFull() { return rear >= 19; }
void addToQueue(string name) {
if(!isQueueFull()) requestQueue[++rear] = name;
}
string getFromQueue() {
return !isQueueEmpty() ? requestQueue[front++] : "";
}
int queueSize() {
return rear - front + 1;
}
};
enum ActionType {
ADD_BOOK,
DELETE_BOOK,
BORROW_BOOK,
RETURN_BOOK,
SORT_BOOKS
};
struct Action {
ActionType type;
Book book;
string description;
};
Book books[200];
int bookCount = 0;
Action undoStack[10];
Action redoStack[10];
int undoTop = -1;
int redoTop = -1;
string history[10];
int historyCount = 0;
void saveToHistory(string desc) {
if(historyCount < 10) {
history[historyCount++] = desc;
} else {
for(int i = 0; i < 9; i++)
history[i] = history[i + 1];
history[9] = desc;
}
}
void saveForUndo(ActionType type, Book b, string desc) {
if(undoTop < 9) undoTop++;
else {
for(int i = 0; i < 9; i++) undoStack[i] = undoStack[i + 1];
undoTop = 9;
}
undoStack[undoTop].type = type;
undoStack[undoTop].book = b;
undoStack[undoTop].description = desc;
redoTop = -1;
saveToHistory(desc);
}
int findBookByCode(int code) {
for(int i = 0; i < bookCount; i++)
if(books[i].code == code) return i;
return -1;
}
void printBookInfo(Book b) {
cout << "\n================================\n";
cout << "Book Code: " << b.code << "\n";
cout << "Title: " << b.title << "\n";
cout << "Author: " << b.author << "\n";
cout << "Year: " << b.year << "\n";
cout << "Status: " << (b.available ? "Available" : "Borrowed") << "\n";
if(b.queueSize() > 0)
cout << "Waiting list: " << b.queueSize() << " person(s)\n";
cout << "================================\n";
}
void addBook() {
if(bookCount >= 200) {
cout << "Library is full!\n";
return;
}
Book newBook;
cout << "\nAdd New Book:\n";
cout << "Book Code: ";
cin >> newBook.code;
if(findBookByCode(newBook.code) != -1) {
cout << "Duplicate book code!\n";
return;
}
cin.ignore();
cout << "Title: ";
getline(cin, newBook.title);
cout << "Author: ";
getline(cin, newBook.author);
cout << "Year: ";
cin >> newBook.year;
newBook.available = true;
newBook.front = 0;
newBook.rear = -1;
books[bookCount++] = newBook;
saveForUndo(ADD_BOOK, newBook, "Added book: " + newBook.title);
cout << "Book added successfully.\n";
}
void removeBook() {
int code;
cout << "\nRemove Book:\n";
cout << "Book Code: ";
cin >> code;
int index = findBookByCode(code);
if(index == -1) {
cout << "Book not found!\n";
return;
}
Book deleted = books[index];
saveForUndo(DELETE_BOOK, deleted, "Removed book: " + deleted.title);
for(int i = index; i < bookCount - 1; i++)
books[i] = books[i + 1];
bookCount--;
cout << "Book removed.\n";
}
void searchBook() {
int code;
cout << "\nSearch Book:\n";
cout << "Book Code: ";
cin >> code;
int index = findBookByCode(code);
if(index == -1) {
cout << "Book not found!\n";
return;
}
printBookInfo(books[index]);
saveToHistory("Searched book: " + books[index].title);
}
void borrowBook() {
int code;
cout << "\nBorrow Book:\n";
cout << "Book Code: ";
cin >> code;
int index = findBookByCode(code);
if(index == -1) {
cout << "Book not found!\n";
return;
}
cin.ignore();
string name;
cout << "Borrower Name: ";
getline(cin, name);
if(books[index].available) {
books[index].available = false;
saveForUndo(BORROW_BOOK, books[index],
"Borrowed by " + name + ": " + books[index].title);
cout << "Book borrowed by " << name << ".\n";
} else {
if(books[index].isQueueFull()) {
cout << "Waiting list is full!\n";
return;
}
books[index].addToQueue(name);
saveToHistory("Borrow request by " + name + ": " + books[index].title);
cout << "Added to waiting list. Position: "
<< books[index].queueSize() << "\n";
}
}
void returnBook() {
int code;
cout << "\nReturn Book:\n";
cout << "Book Code: ";
cin >> code;
int index = findBookByCode(code);
if(index == -1) {
cout << "Book not found!\n";
return;
}
if(!books[index].isQueueEmpty()) {
string person = books[index].getFromQueue();
saveToHistory("Book given to " + person + ": " + books[index].title);
cout << "Book given to " << person << ".\n";
} else {
books[index].available = true;
saveForUndo(RETURN_BOOK, books[index],
"Returned book: " + books[index].title);
cout << "Book returned to library.\n";
}
}
void sortByCode() {
if(bookCount < 2) {
cout << "Not enough books to sort.\n";
return;
}
for(int i = 0; i < bookCount - 1; i++) {
for(int j = 0; j < bookCount - i - 1; j++) {
if(books[j].code > books[j + 1].code) {
Book temp = books[j];
books[j] = books[j + 1];
books[j + 1] = temp;
}
}
}
saveForUndo(SORT_BOOKS, Book(), "Sorted by code");
cout << "Books sorted by code.\n";
}
void sortByYear() {
if(bookCount < 2) {
cout << "Not enough books to sort.\n";
return;
}
for(int i = 0; i < bookCount - 1; i++) {
for(int j = 0; j < bookCount - i - 1; j++) {
if(books[j].year > books[j + 1].year) {
Book temp = books[j];
books[j] = books[j + 1];
books[j + 1] = temp;
}
}
}
saveForUndo(SORT_BOOKS, Book(), "Sorted by year");
cout << "Books sorted by year.\n";
}
void displayAllBooks() {
if(bookCount == 0) {
cout << "Library is empty!\n";
return;
}
cout << "\nAll Books (" << bookCount << " books):\n";
for(int i = 0; i < bookCount; i++) {
cout << "\n" << i + 1 << ". ";
printBookInfo(books[i]);
}
saveToHistory("Displayed all books");
}
void undo() {
if(undoTop < 0) {
cout << "Nothing to undo!\n";
return;
}
Action lastAction = undoStack[undoTop--];
if(redoTop < 9) redoTop++;
else {
for(int i = 0; i < 9; i++) redoStack[i] = redoStack[i + 1];
redoTop = 9;
}
redoStack[redoTop] = lastAction;
switch(lastAction.type) {
case ADD_BOOK:
bookCount--;
cout << "Undo: Book addition canceled.\n";
break;
case DELETE_BOOK:
books[bookCount++] = lastAction.book;
cout << "Undo: Book deletion canceled.\n";
break;
case BORROW_BOOK: {
int idx = findBookByCode(lastAction.book.code);
if(idx != -1) books[idx].available = true;
cout << "Undo: Book borrowing canceled.\n";
break;
}
case RETURN_BOOK: {
int idx = findBookByCode(lastAction.book.code);
if(idx != -1) books[idx].available = false;
cout << "Undo: Book return canceled.\n";
break;
}
case SORT_BOOKS:
cout << "Undo: Sorting canceled.\n";
break;
}
saveToHistory("Performed Undo");
}
void redo() {
if(redoTop < 0) {
cout << "Nothing to redo!\n";
return;
}
Action nextAction = redoStack[redoTop--];
saveForUndo(nextAction.type, nextAction.book, "Redo: " + nextAction.description);
cout << "Redo performed.\n";
}
void showHistory() {
if(historyCount == 0) {
cout << "No history available.\n";
return;
}
cout << "\nRecent Actions History:\n";
cout << "================================\n";
for(int i = historyCount - 1; i >= 0; i--) {
cout << "- " << history[i] << "\n";
}
cout << "================================\n";
}
void showStatistics() {
int available = 0, borrowed = 0, waiting = 0;
for(int i = 0; i < bookCount; i++) {
if(books[i].available) available++;
else borrowed++;
waiting += books[i].queueSize();
}
cout << "\nLibrary Statistics:\n";
cout << "================================\n";
cout << "Total Books: " << bookCount << "\n";
cout << "Available Books: " << available << "\n";
cout << "Borrowed Books: " << borrowed << "\n";
cout << "Total Waiting Requests: " << waiting << "\n";
cout << "Remaining Capacity: " << 200 - bookCount << "\n";
cout << "================================\n";
saveToHistory("Viewed library statistics");
}
int main() {
int choice;
cout << "==========================================\n";
cout << " Library Management System\n";
cout << "==========================================\n";
do {
cout << "\n================================\n";
cout << " MAIN MENU\n";
cout << "================================\n";
cout << "1. Add New Book\n";
cout << "2. Remove Book\n";
cout << "3. Search Book\n";
cout << "4. Borrow Book\n";
cout << "5. Return Book\n";
cout << "6. Sort Books by Code\n";
cout << "7. Sort Books by Year\n";
cout << "8. Display All Books\n";
cout << "9. Undo\n";
cout << "10. Redo\n";
cout << "11. Show History\n";
cout << "12. Show Statistics\n";
cout << "0. Exit\n";
cout << "================================\n";
cout << "Your choice: ";
cin >> choice;
switch(choice) {
case 1: addBook(); break;
case 2: removeBook(); break;
case 3: searchBook(); break;
case 4: borrowBook(); break;
case 5: returnBook(); break;
case 6: sortByCode(); break;
case 7: sortByYear(); break;
case 8: displayAllBooks(); break;
case 9: undo(); break;
case 10: redo(); break;
case 11: showHistory(); break;
case 12: showStatistics(); break;
case 0: cout << "\nThank you for using the system!\n"; break;
default: cout << "Invalid choice!\n";
}
} while(choice != 0);
return 0;
}