-
Notifications
You must be signed in to change notification settings - Fork 2
/
MM_4.cpp
692 lines (646 loc) · 21 KB
/
MM_4.cpp
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
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
#include <iostream>
#include <unordered_map>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
// Book structure
class Book {
public:
int bookTag;
string title;
string author;
string genre;
float rating;
int pageCount;
Book() {}
Book(int bookTag,string title, string author, string genre, float rating, int pageCount)
{
this->bookTag=bookTag;
this->title = title;
this->author = author;
this->genre = genre;
this->rating = rating;
this->pageCount = pageCount;
}
};
// Book Database class
class Database {
public:
unordered_map<int, Book> books;
void addBook(Book newBook);
const Book& getBook(int bookTag) const;
void displayByGenre();
void displayByAuthor();
void searchBooksByGenre(const string& genre);
void searchBooksByAuthor(const string& author);
};
void Database::addBook(Book newBook)
{
books[newBook.bookTag] = newBook;
}
const Book& Database::getBook(int bookTag) const {
auto it = books.find(bookTag);
if (it != books.end()) {
return it->second;
} else {
throw std::out_of_range("Book with tag '" + std::to_string(bookTag) + "' not found.");
}
}
void Database::searchBooksByGenre(const string& genre)
{
cout << "Books in the genre '" << genre << "':" << endl;
for (const auto& pair : books) {
if (pair.second.genre == genre) {
cout << pair.second.bookTag <<"." << pair.second.title << " by " << pair.second.author << endl;
}
}
cout << endl;
}
void Database::searchBooksByAuthor(const string& author)
{
cout << "Books by the author '" << author << "':" << endl;
for (const auto& pair : books) {
if (pair.second.author == author) {
cout << pair.second.bookTag <<"." << pair.second.title << " in the genre " << pair.second.genre << endl;
}
}
cout << endl;
}
void Database::displayByGenre()
{
int ch=1;
while(ch!=0)
{
cout<<"Chose the genre you want to explore:"<<endl;
cout<<"1.Mystery"<<endl;;
cout<<"2.Romance"<<endl;
cout<<"3.Science Fiction"<<endl;
cout<<"4.Fantasy"<<endl;
cout<<"5.Horror"<<endl;
cout<<"6.Historical"<<endl;
cout<<"7.Thriller"<<endl;
cout<<"8.Classics"<<endl;
cout<<"9.Poetry"<<endl;
cout<<"10.Self Help"<<endl;
cout<<"0.Exit menu"<<endl;
cout<<"Enter choice: ";
cin>>ch;
switch (ch)
{
case 0:
break;
case 1:
{
searchBooksByGenre("Mystery");
break;
}
case 2:
{
searchBooksByGenre("Romance");
break;
}
case 3:
{
searchBooksByGenre("Science Fiction");
break;
}
case 4:
{
searchBooksByGenre("Fantasy");
break;
}
case 5:
{
searchBooksByGenre("Horror");
break;
}
case 6:
{
searchBooksByGenre("Historical");
break;
}
case 7:
{
searchBooksByGenre("Thriller");
break;
}
case 8:
{
searchBooksByGenre("Classics");
break;
}
case 9:
{
searchBooksByGenre("Poetry");
break;
}
case 10:
{
searchBooksByGenre("Self Help");
break;
}
default:
cout<<"Please enter a valid number";
break;
}
}
}
void Database::displayByAuthor()
{
int ch=1;
while(ch!=0)
{
cout<<"Chose the author whose book you want to explore:"<<endl;
cout<<"1. Agatha Christie"<<endl;;
cout<<"2. Ana Huang"<<endl;
cout<<"3. Dan Brown"<<endl;
cout<<"4. J K Rowling"<<endl;
cout<<"5. Stephen King"<<endl;
cout<<"6. Charles Dickens"<<endl;
cout<<"7. Paula Hawkins"<<endl;
cout<<"8. Jane Austen"<<endl;
cout<<"9. Sylvia Path"<<endl;
cout<<"10. Mark Manson"<<endl;
cout<<"0.Exit menu"<<endl;
cout<<"Enter choice: ";
cin>>ch;
switch (ch)
{
case 0:
break;
case 1:
{
searchBooksByAuthor("Agatha Christie");
break;
}
case 2:
{
searchBooksByAuthor("Ana Huang");
break;
}
case 3:
{
searchBooksByAuthor("Dan Brown");
break;
}
case 4:
{
searchBooksByAuthor("J K Rowling");
break;
}
case 5:
{
searchBooksByAuthor("Stephen King");
break;
}
case 6:
{
searchBooksByAuthor("Charles Dickens");
break;
}
case 7:
{
searchBooksByAuthor("Paula Hawkins");
break;
}
case 8:
{
searchBooksByAuthor("Jane Austen");
break;
}
case 9:
{
searchBooksByAuthor("Sylvia Path");
break;
}
case 10:
{
searchBooksByAuthor("Mark Manson");
break;
}
default:
cout<<"Please enter a valid number";
break;
}
}
}
class ReadingListNode
{
public:
string ReadingListName;
//map<bookTag, vector <int> > bookTags
vector <int> bookTags;
ReadingListNode *left;
ReadingListNode *right;
ReadingListNode(){}
ReadingListNode(string rl_name)
{
ReadingListName=rl_name;
left=right=NULL;
}
};
class ReadingListTree
{
public:
ReadingListNode *root;
ReadingListTree()
{
root = NULL;
}
void insertReadingList(ReadingListNode*& root, string rl_name);
void printLevelOrder(ReadingListNode* root);
void addBookIntoRL(int bookTag, string rl_name);
void removeBookFromRL(int bookTag, string rl_name);
void getReadingList(ReadingListNode*& root, string rl_name,const Database& bookDB);
bool isEmpty(ReadingListNode* root);
};
// Function to add new ReadingListName in level order
void ReadingListTree :: insertReadingList(ReadingListNode*& root, string rl_name)
{
ReadingListNode* temp = new ReadingListNode(rl_name); // Initialize with ReadingListName
temp->ReadingListName = rl_name;
temp->left = temp->right = NULL;
if (!root)
root = temp;
else {
queue<ReadingListNode*> q;
q.push(root);
while (!q.empty()) {
ReadingListNode* temp = q.front();
q.pop();
if (!temp->left)
{
temp->left = new ReadingListNode;
temp->left->ReadingListName = rl_name;
temp->left->left = temp->left->right = NULL;
break;
}
else
q.push(temp->left);
if (!temp->right)
{
temp->right = new ReadingListNode;
temp->right->ReadingListName = rl_name;
temp->right->left = temp->right->right = NULL;
break;
}
else
q.push(temp->right);
}
}
}
bool ReadingListTree :: isEmpty(ReadingListNode* root)
{
if (root == NULL)
{
return true;
}
return false;
}
// Function to print Level Order Traversal
void ReadingListTree :: printLevelOrder(ReadingListNode* root)
{
if (root == NULL)
{
cout<< "Oh my! No reading lists created yet" <<endl;
return;
}
cout << "Oh well, Your existing reading lists are:" << endl;
queue<ReadingListNode*> q;
q.push(root);
while (!q.empty()) {
ReadingListNode* node = q.front();
cout << node->ReadingListName << endl;
q.pop();
if (node->left != NULL)
q.push(node->left);
if (node->right != NULL)
q.push(node->right);
}
}
void ReadingListTree :: addBookIntoRL(int bookTag, string rl_name)
{
if (root == NULL) return;
queue<ReadingListNode*> q;
q.push(root);
while (!q.empty()) {
ReadingListNode* node = q.front();
if (node->ReadingListName == rl_name)
{
node->bookTags.push_back(bookTag);
break;
}
q.pop();
if (node->left != NULL)
q.push(node->left);
if (node->right != NULL)
q.push(node->right);
}
}
void ReadingListTree :: removeBookFromRL(int bookTag, string rl_name)
{
if (root == NULL)
return;
queue<ReadingListNode*> q;
q.push(root);
while (!q.empty()) {
ReadingListNode* node = q.front();
if (node->ReadingListName == rl_name)
{
auto it = find(node->bookTags.begin(), node->bookTags.end(),
bookTag);
if (it != node->bookTags.end()) {
node->bookTags.erase(it);
}
break;
}
q.pop();
if (node->left != NULL)
q.push(node->left);
if (node->right != NULL)
q.push(node->right);
}
}
void ReadingListTree::getReadingList(ReadingListNode*& root, string rl_name, const Database& bookDB) {
if (root == NULL)
{
cout<<"No book added yet!"<<endl;
return;
}
queue<ReadingListNode*> q;
q.push(root);
while (!q.empty()) {
ReadingListNode* node = q.front();
if (node->ReadingListName == rl_name) {
int n = node->bookTags.size();
for (int i = 0; i < n; i++) {
int bookTag = node->bookTags[i];
Book book = bookDB.getBook(bookTag);
cout << bookTag << ". " << book.title << " by " << book.author << " in the genre " << book.genre << endl;
}
break;
}
q.pop();
if (node->left != NULL)
q.push(node->left);
if (node->right != NULL)
q.push(node->right);
}
}
int main()
{
Database bookDB;
ReadingListTree RLT;
Book book1(1,"The Mysterious Affair at Styles", "Agatha Christie", "Mystery", 4.0, 174);
Book book2(2,"The Secret Adversary", "Agatha Christie", "Mystery", 3.85, 266);
Book book3(3,"The Murder at the Vicarage", "Agatha Christie", "Mystery", 4.05, 307);
Book book4(4,"Ask a Policeman", "Agatha Christie", "Mystery", 3.24, 311 );
Book book5(5,"Murder on the Orient Express", "Agatha Christie", "Mystery", 4.20, 274);
Book book6(6,"Twisted Love", "Ana Huang","Romance", 3.73, 274);
Book book7(7,"Twisted Games", "Ana Huang","Romance", 4.13, 456);
Book book8(8,"King of Wrath", "Ana Huang","Romance",4.07, 398);
Book book9(9,"King of Pride", "Ana Huang","Romance", 3.98, 358);
Book book10(10,"King of Greed", "Ana Huang","Romance",3.84 , 352);
Book book11(11,"Angels & Demons", "Dan Brown","Science Fiction", 3.94, 736);
Book book12(12,"Digital Fortress", "Dan Brown","Science Fiction", 3.69, 274);
Book book13(13,"The Da Vinci Code", "Dan Brown","Science Fiction", 3.91, 510);
Book book14(14,"Origin", "Dan Brown","Science Fiction", 3.89, 461);
Book book15(15,"Deception Point", "Dan Brown","Science Fiction", 3.75, 556);
Book book16(16,"Harry Potter and the Philosopher's Stone", "J K Rowling", "Fantasy", 4.5, 333);
Book book17(17,"Harry Potter and the Chamber of Secrets", "J K Rowling", "Fantasy", 4.43, 341);
Book book18(18,"Harry Potter and the Prisoner of Azkaban", "J K Rowling", "Fantasy", 4.58, 435);
Book book19(19,"Harry Potter and the Goblet of Fire", "J K Rowling", "Fantasy", 4.56, 734);
Book book20(20,"Harry Potter and the Order of the Phoenix", "J K Rowling", "Fantasy", 4.5, 912);
Book book21(21,"Harry Potter and the Half-Blood Prince", "J K Rowling", "Fantasy", 4.58, 652);
Book book22(22,"Harry Potter and the Deathly Hallows", "J K Rowling", "Fantasy", 4.62, 759);
Book book23(23,"It", "Stephen King", "Horror", 4.25, 1168);
Book book24(24,"Misery", "Stephen King", "Horror", 4.21, 370);
Book book25(25,"The Shining", "Stephen King", "Horror", 4.26, 497);
Book book26(26,"Carrie", "Stephen King", "Horror", 3.98, 272);
Book book27(27,"The Green Mile", "Stephen King", "Horror", 4.47, 592);
Book book28(28,"Angels & Demons", "Dan Brown","Science Fiction", 3.94, 736);
Book book29(29,"Dombey and Son", "Charles Dickens","Historical", 3.95, 736);
Book book30(30,"Oliver Twist", "Charles Dickens","Historical", 3.88, 608);
Book book31(31,"Bleak House", "Charles Dickens","Historical", 4.01, 1017);
Book book32(32,"Little Dorrit", "Charles Dickens","Historical", 4.0, 1021);
Book book33(33,"A Tale of Two Cities", "Charles Dickens","Historical", 3.87, 489);
Book book34(34,"The Girl on the Train", "Paula Hawkins", "Thriller", 3.96, 336);
Book book35(35,"Into the Water", "Paula Hawkins", "Thriller", 3.59, 386);
Book book36(36,"A Slow Fire Burning", "Paula Hawkins", "Thriller", 3.5, 307);
Book book37(37,"The Bell Jar", "Sylvia Path", "Poetry", 4.05, 244);
Book book38(38,"Ariel", "Sylvia Path", "Poetry", 4.20, 128);
Book book39(39,"Pride and Prejudice", "Jane Austen", "Classics", 4.28, 279);
Book book40(40,"Sense and Sensibility", "Jane Austen", "Classics", 4.08, 409);
Book book41(41,"Emma", "Jane Austen", "Classics", 4.04, 474);
Book book42(42,"Persuasion", "Jane Austen", "Classics", 4.15, 249);
Book book43(43,"Northanger Abbey", "Jane Austen", "Classics", 3.85, 260);
Book book44(44,"The Subtle Art of Not Giving a F*ck", "Mark Manson", "Self Help", 3.9, 212);
Book book45(45,"Everything is F*cked", "Mark Manson", "Self Help", 3.7, 288);
Book book46(46,"The Nerd's Guide to Being Confident", "Mark Manson", "Self Help", 3.63, 63);
Book book47(47,"3 Ideas That Can Change Your Life", "Mark Manson", "Self Help", 4.1, 23);
Book book48(48,"Mark Manson on Self-Knowledge", "Mark Manson", "Self Help", 4.15, 24);
bookDB.addBook(book1);
bookDB.addBook(book2);
bookDB.addBook(book3);
bookDB.addBook(book4);
bookDB.addBook(book5);
bookDB.addBook(book6);
bookDB.addBook(book7);
bookDB.addBook(book8);
bookDB.addBook(book9);
bookDB.addBook(book10);
bookDB.addBook(book11);
bookDB.addBook(book12);
bookDB.addBook(book13);
bookDB.addBook(book14);
bookDB.addBook(book15);
bookDB.addBook(book16);
bookDB.addBook(book17);
bookDB.addBook(book18);
bookDB.addBook(book19);
bookDB.addBook(book20);
bookDB.addBook(book21);
bookDB.addBook(book22);
bookDB.addBook(book23);
bookDB.addBook(book24);
bookDB.addBook(book25);
bookDB.addBook(book26);
bookDB.addBook(book27);
bookDB.addBook(book28);
bookDB.addBook(book29);
bookDB.addBook(book30);
bookDB.addBook(book31);
bookDB.addBook(book32);
bookDB.addBook(book33);
bookDB.addBook(book34);
bookDB.addBook(book35);
bookDB.addBook(book36);
bookDB.addBook(book37);
bookDB.addBook(book38);
bookDB.addBook(book39);
bookDB.addBook(book40);
bookDB.addBook(book41);
bookDB.addBook(book42);
bookDB.addBook(book43);
bookDB.addBook(book44);
bookDB.addBook(book45);
bookDB.addBook(book46);
bookDB.addBook(book47);
bookDB.addBook(book48);
int ch=0;
while(ch!=8)
{
cout<<"\nSo what's on your mind? Just enter the option number :D :"<<endl;
cout<<endl;
cout<<"1.I want to create new reading list (U_U) "<<endl;
cout<<"2.I will add to an existing reading list (UwU)"<<endl;
cout<<"3.I want to remove a book from my reading list (X_X)"<<endl;
cout<<"4.Just show me my reading lists (>_<)"<<endl;
cout<<"5.Tell me about details of this book (:O) "<<endl;
cout<<"6.Recommend me a good book please (^_^)"<<endl;
cout<<"7.Too much information on the screen, clear it (+_+) "<<endl;
cout<<"8.Exit =( "<<endl;
cout<<endl;
cout<<"What do you wish to do? (^_~): ";
cin>>ch;
cout<<endl;
switch(ch)
{
case 1:
{
cin.ignore();
string rlname;
cout<<"What shall be the name for the new reading list? ";
getline(cin,rlname);
RLT.insertReadingList(RLT.root,rlname);
cout<<endl;
break;
}
case 2:
{
string rlname;
RLT.printLevelOrder(RLT.root);
cout << endl;
if (!RLT.isEmpty(RLT.root))
{
cout << "What reading list you wish to add a book to? ";
cin.ignore(); // Clear the newline character from the buffer
getline(cin, rlname);
int ch;
cout << "Show books by 1.Author 2.Genre :";
cin >> ch;
cout<<endl;
cin.ignore(); // Clear the newline character from the buffer
if (ch == 1)
{
bookDB.displayByAuthor();
int bookTag;
cout << "Please enter book tag of the book you want to add to your list: ";
cin>>bookTag;
RLT.addBookIntoRL(bookTag, rlname);
}
else if (ch == 2)
{
bookDB.displayByAuthor();
int bookTag;
cout << "Please enter book tag of the book you want to add to your list: ";
cin>>bookTag;
RLT.addBookIntoRL(bookTag, rlname);
}
else
cout << "Oh no! Invalid choice.";
}
break;
}
case 3:
{
cin.ignore();
RLT.printLevelOrder(RLT.root);
cout<<endl;
if (!RLT.isEmpty(RLT.root))
{
string rlname;
cout<<"Which reading list you wish to remove a book from? ";
getline(cin,rlname);
cout<<"Here's your chosen reading list:"<<endl;
RLT.getReadingList(RLT.root,rlname,bookDB);
int bookTag;
cout<<"Which book you wish to remove from your list? ";
cin>>bookTag;
cout<<endl;
RLT.removeBookFromRL(bookTag,rlname);
}
break;
}
case 4:
{
cin.ignore();
RLT.printLevelOrder(RLT.root);
cout<<endl;
if (!RLT.isEmpty(RLT.root))
{
string rlname;
cout<<"Which reading list you wish to display? ";
getline(cin,rlname);
cout<<endl;
cout<<"Here's your chosen reading list: "<<endl;
RLT.getReadingList(RLT.root,rlname,bookDB);
cout<<endl;
}
break;
}
case 5:
{
cin.ignore();
int bookTag;
cout << "Please enter book tag whose information is needed: ";
cin >> bookTag;
try {
const Book& book = bookDB.getBook(bookTag);
cout << "Book information:" << endl;
cout << "Title: " << book.title << endl;
cout << "Author: " << book.author << endl;
cout << "Genre: " << book.genre << endl;
cout << "Rating: " << book.rating << endl;
cout << "Page Count: " << book.pageCount << endl;
}
catch (const std::out_of_range& e) {
cout << e.what() << endl;
}
break;
}
case 6:
{
cin.ignore();
int ch;
cout<<"Do you want recommendations based on 1.Author 2.Genre: ";
cin>>ch;
cout<<endl;
if(ch==1)
{
bookDB.displayByAuthor();
}
else if(ch==2)
{
bookDB.displayByGenre();
}
else
cout<<"Oh no! Invalid choice.";
break;
}
case 7:
{
system("cls");
ch=1;
break;
}
case 8:
exit(0);
default:
cout<<"Wrong choice entered, please enter a valid number";
break;
}
}
return 0;
}