-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsimulator.h
390 lines (351 loc) · 15.2 KB
/
simulator.h
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
#ifndef SIMULATOR_H
#define SIMULATOR_H
#include "HEADER.h"
#include "WAREHOUSE.h"
//GLOBAL VARIABLE.
AVL_TREE tree;
// HELPER FUNCTION TO CHECK IF ID IS UNIQUE.
bool UNIQUE_ID(int id){
if(tree.SEARCH (tree.root, id) != NULL){
cerr<<ANSI_COLOR_BOLD_RED<<"\n ERROR:: ITEM WITH ID [ "<<id<<"] ALREADY EXISTS.\n"<<ANSI_COLOR_RESET;
return 0;
}
return 1;
}
// HELPER FUNCTION TO CHECK IF NAME IS UNIQUE.
bool UNIQUE_NAM(string N){
WARE_HOUSE* item=tree.SEARCH_NAME(tree.root, N);
if(item!=NULL){
cerr<<ANSI_COLOR_BOLD_RED<<"\n ERROR:: ITEM WITH NAME [ "<<N<<"] ALREADY EXISTS.\n"<<ANSI_COLOR_RESET;
return 0;
}
return 1;
}
// LOCAL MAIN OF STOCK OPERATIONS.
void STOCK_OPERATIONS(){
ADMIN_PLAYS();
// CREATE AVL TREE AND LOAD DATA FROM CSV FILE.
tree.LOAD_DATA_FROM_CSV("DATA.csv");
// MAIN MENU FOR STOCK OPERATIONS.
while(true){
int choice;
cout<<endl<<endl<<ANSI_COLOR_BOLD_GREEN<<"\t -"<<setfill('-')<<setw(32)<<"-"<<setfill(' ')<<endl;
cout<<"\t | "<<setw(30)<<left<<" [ WHAT DO YOU WANT TO DO ? ] "<<"|\n";
cout<<"\t -"<<setfill('-')<<setw(32)<<"-"<<setfill(' ')<<endl;
cout<<"\t | "<<setw(30)<<left<<" 1. ADD NEW ITEM. "<<"|\n";
cout<<"\t | "<<setw(30)<<left<<" 2. DELETE ITEM. "<<"|\n";
cout<<"\t | "<<setw(30)<<left<<" 3. UPDATE ITEM. "<<"|\n";
cout<<"\t | "<<setw(30)<<left<<" 4. SEARCH ITEM. "<<"|\n";
cout<<"\t | "<<setw(30)<<left<<" 5. DISPLAY ALL ITEMS. "<<"|\n";
cout<<"\t | "<<setw(30)<<left<<" 6. EXIT {RETURN BACK} "<<"|\n";
cout<<"\t -"<<setfill('-')<<setw(32)<<"-"<<setfill(' ')<<ANSI_COLOR_RESET<<endl;
cin>>choice;
c=0;
switch(choice){
case 1:
{
WARE_HOUSE item;
cout<<"\n ENTER ITEM ID :: ";
cin>>item.id;
while(!UNIQUE_ID(item.id)){
cout<<"\n ENTER AGAIN :: ";
cin>>item.id;
}
cout<<"\n ENTER ITEM NAME :: ";
cin.ignore();
getline(cin, item.name);
while(!UNIQUE_NAM(item.name)){
cout<<"\n ENTER AGAIN :: ";
getline(cin, item.name);
}
cout<<"\n ENTER ITEM DESCRIPTION :: ";
getline(cin, item.descript);
cout<<"\n ENTER ITEM PRICE :: ";
cin>>item.price;
cout<<"\n ENTER ITEM QUANTITY :: ";
cin>>item.quantity;
while(item.quantity<0){
cout<<"\n QUANTITY CANNOT BE NEGATIVE.\n";
cout<<"\n ENTER ITEM QUANTITY :: ";
cin>>item.quantity;
}
tree.root=tree.Insert(tree.root, item);
//WRITE DATA IN FILE AS WELL.
fstream write("DATA.csv" , ios::out | ios::app);
if(!write){
cerr<<ANSI_COLOR_BOLD_RED<<"\n ERROR:: CANNOT OPEN FILE.\n"<<ANSI_COLOR_RESET;
break;
}
item.T_price = item.price * item.quantity;
write<<item.id<<","<<item.name<<","<<item.descript<<","<<item.price<<","<<item.quantity<<","<<item.T_price<<"\n";
write.close();
cout<<ANSI_COLOR_BOLD_GREEN<<"\n\t\t ------------------------------ \n";
cout<<"\t\t | !!!! ITEM ADDED !!!! | \n";
cout<<"\t\t ------------------------------ \n"<<ANSI_COLOR_RESET;
break;
}
case 2:
{
int id;
cout<<"\n ENTER ITEM ID TO DELETE :: ";
cin>>id;
if(tree.SEARCH(tree.root, id)==NULL){
cerr<<ANSI_COLOR_BOLD_RED<<"\n ERROR:: NO ITEM FOUND WITH ID [ "<<id<<"].\n"<<ANSI_COLOR_RESET;
break;
}
tree.DEL_ITEM(id);
cout<<ANSI_COLOR_BOLD_GREEN<<"\n\t\t -------------------------------- \n";
cout<<"\t\t | !!!! ITEM DELETED !!!! | \n";
cout<<"\t\t -------------------------------- \n"<<ANSI_COLOR_RESET;
break;
}
case 3:
{
int id , quantity;
double price;
cout<<"\n ENTER ITEM ID TO UPDATE :: ";
cin>>id;
cout<<"\n ENTER THE NEW PRICE :: ";
cin>>price;
cout<<"\n ENTER THE NEW QUANTITY :: ";
cin>>quantity;
tree.UPDATE_ITEM(id, price, quantity);
break;
}
case 4:
{
const char* color = ANSI_COLOR_RESET;
int id;
cout<<"\n ENTER ITEM ID TO SEARCH :: ";
cin>>id;
WARE_HOUSE* item=tree.SEARCH(tree.root, id);
if(item==NULL){
cerr<<ANSI_COLOR_BOLD_RED<<"\n ERROR:: NO ITEM FOUND WITH ID [ "<<id<<"].\n"<<ANSI_COLOR_RESET;
break;
}
if(item->quantity == 0){
color = ANSI_COLOR_BOLD_RED;
}
else if(item->quantity < 5){
color = ANSI_COLOR_BOLD_YELLOW;
}
else{
color = ANSI_COLOR_BOLD_GREEN;
}
cout<<color<<"\n\t ------------------------------ \n";
cout<<"\t | ID :: "<<item->id<<"\n";
cout<<"\t | NAME :: "<<item->name<<"\n";
cout<<"\t | DESCRIPTION :: "<<item->descript<<"\n";
cout<<"\t | PRICE :: "<<item->price<<"\n";
cout<<"\t | QUANTITY :: "<<item->quantity<<"\n";
cout<<"\t ------------------------------ "<<ANSI_COLOR_RESET<<endl<<endl;
break;
}
case 5:
{
tree.P_PRE_ORDER(tree.root);
cout<<ANSI_COLOR_BOLD_GREEN<<"\n\t| |";
cout<<"\n\t|______________________________________________________________________________|"<<ANSI_COLOR_RESET;
break;
}
case 6:
{
cout<<ANSI_COLOR_BOLD_GREEN<<"\n\t -------------------------------------- \n";
cout<<"\t | THANK YOU FOR USING OUR SYSTEM. |\n";
cout<<"\t -------------------------------------- \n"<<ANSI_COLOR_RESET;
return;
}
default:
{
cout<<ANSI_COLOR_BOLD_RED<<"\n\t--------------------------------------\n";
cout<<"\t| !!!! ENTER A VALID INPUT !!!! |\n";
cout<<"\t----------------------------------------\n"<<ANSI_COLOR_RESET;
break;
}
}//switcj ki
}// loop ki
return;
}
// PRICE BASED QUERIES.
void PRICE_BASED_QUERIES(){
tree.LOAD_DATA_FROM_CSV("DATA.csv");
while(true){
int choice;
cout<<endl<<ANSI_COLOR_BOLD_GREEN<<"\t -"<<setfill('-')<<setw(35)<<"-"<<setfill(' ')<<endl;
cout<<"\t | "<<setw(33)<<left<<" [ WHAT DO YOU WANT TO DO ? ] "<<"|\n";
cout<<"\t -"<<setfill('-')<<setw(35)<<"-"<<setfill(' ')<<endl;
cout<<"\t | "<<setw(33)<<left<<" 1. SEARCH ITEM IN PRICE RANGE. "<<"|\n";
cout<<"\t | "<<setw(33)<<left<<" 2. SEARCH CHEAPEST ITEM. "<<"|\n";
cout<<"\t | "<<setw(33)<<left<<" 3. SEARCH MOST EXPENSIVE ITEM. "<<"|\n";
cout<<"\t | "<<setw(33)<<left<<" 0. EXIT {RETURN BACK} "<<"|\n";
cout<<"\t -"<<setfill('-')<<setw(35)<<"-"<<setfill(' ')<<ANSI_COLOR_RESET<<endl;
BUTTONS();
cin>>choice;
c=0;
switch(choice){
case 1:
{
double min_price, max_price;
cout<<"\n ENTER MINIMUM PRICE :: ";
cin>>min_price;
while(min_price<=0){
cout<<"\n MINIMUM PRICE CANNOT BE ZERO.\n";
cout<<"\n ENTER MINIMUM PRICE :: ";
cin>>min_price;
}
cout<<"\n ENTER MAXIMUM PRICE :: ";
cin>>max_price;
while(max_price<=min_price){
cout<<"\n MAXIMUM PRICE CANNOT BE LESS THAN OR EQUAL TO MINIMUM PRICE.\n";
cout<<"\n ENTER MAXIMUM PRICE :: ";
cin>>max_price;
}
tree.SEARCH_IN_RANGE(tree.root, min_price, max_price);
break;
}
case 2:
{
const char* color = ANSI_COLOR_BOLD_RED;
Node* temp = NULL;
tree.SEARCH_MIN_PRICE(tree.root , temp);
if(temp==NULL){
cerr<<ANSI_COLOR_BOLD_RED<<"\n ERROR:: NO ITEMS FOUND.\n"<<ANSI_COLOR_RESET;
break;
}
else{
cout<<color<<"\n\t ------------------------------ \n";
cout<<"\t | ID :: "<<temp->data.id<<"\n";
cout<<"\t | NAME :: "<<temp->data.name<<"\n";
cout<<"\t | DESCRIPTION :: "<<temp->data.descript<<"\n";
cout<<"\t | PRICE :: "<<temp->data.price<<"\n";
cout<<"\t | QUANTITY :: "<<temp->data.quantity<<"\n";
cout<<"\t ------------------------------ "<<ANSI_COLOR_RESET<<endl;
}
break;
}
case 3:
{
Node* temp = NULL;
tree.SEARCH_MAX_PRICE(tree.root, temp);
if(temp==NULL){
cerr<<"\n ERROR:: NO ITEMS FOUND.\n";
break;
}
else{
const char* color = ANSI_COLOR_BOLD_GREEN;
cout<<color<<"\n\t ------------------------------ \n";
cout<<"\t | ID :: "<<temp->data.id<<"\n";
cout<<"\t | NAME :: "<<temp->data.name<<"\n";
cout<<"\t | DESCRIPTION :: "<<temp->data.descript<<"\n";
cout<<"\t | PRICE :: "<<temp->data.price<<"\n";
cout<<"\t | QUANTITY :: "<<temp->data.quantity<<"\n";
cout<<"\t ------------------------------ "<<ANSI_COLOR_RESET<<endl;
}
break;
}
case 0:
{
cout<<ANSI_COLOR_BOLD_GREEN<<"\n\t -------------------------------------- \n";
cout<<"\t | THANK YOU FOR USING OUR SYSTEM. |\n";
cout<<"\t -------------------------------------- \n"<<ANSI_COLOR_RESET;
return;
}
default:
{
cout<<ANSI_COLOR_BOLD_RED<<"\n\t--------------------------------------\n";
cout<<"\t| !!!! ENTER A VALID INPUT !!!! |\n";
cout<<"\t----------------------------------------\n"<<ANSI_COLOR_RESET;
break;
}
}// switch
}// loop
}
// SOME OTHER OPERATIONS.
void OTHER_OPERATIONS(){
tree.LOAD_DATA_FROM_CSV("DATA.csv");
while(true){
int choice;
cout<<ANSI_COLOR_BOLD_GREEN<<"\t -"<<setfill('-')<<setw(34)<<"-"<<setfill(' ')<<endl;
cout<<"\t | "<<setw(32)<<left<<" [ WHAT DO YOU WANT TO DO ? ] "<<"|\n";
cout<<"\t -"<<setfill('-')<<setw(34)<<"-"<<setfill(' ')<<endl;
cout<<"\t | "<<setw(32)<<left<<" 1. SEARCH ITEM IN WAREHOUSE. "<<"|\n";
cout<<"\t | "<<setw(32)<<left<<" 2. LIST LOWER QUANTITY ITEMS. "<<"|\n";
cout<<"\t | "<<setw(32)<<left<<" 3. REFILL ITEMS. "<<"|\n";
cout<<"\t | "<<setw(32)<<left<<" 0. EXIT {RETURN BACK} "<<"|\n";
cout<<"\t -"<<setfill('-')<<setw(34)<<"-"<<setfill(' ')<<ANSI_COLOR_RESET<<endl;
BUTTONS();
cin>>choice;
c=0;
switch(choice){
case 1:
{
int id;
cout<<"\n ENTER ID :: ";
cin>>id;
WARE_HOUSE *h;
h = tree.SEARCH(tree.root, id);
if(h==NULL){
cerr<<"\n ERROR:: NO SUCH ITEM FOUND.\n";
break;
}
else{
const char* color = ANSI_COLOR_RESET;
if(h->quantity == 0){
color = ANSI_COLOR_BOLD_RED;
}
else if(h->quantity < 5){
color = ANSI_COLOR_BOLD_YELLOW;
}
else{
color = ANSI_COLOR_BOLD_GREEN;
}
cout<<color<<"\n\t ------------------------------ \n";
cout<<"\t | ID :: "<<h->id<<"\n";
cout<<"\t | NAME :: "<<h->name<<"\n";
cout<<"\t | DESCRIPTION :: "<<h->descript<<"\n";
cout<<"\t | PRICE :: "<<h->price<<"\n";
cout<<"\t | QUANTITY :: "<<h->quantity<<"\n";
cout<<"\t ------------------------------ "<<ANSI_COLOR_RESET<<endl<<endl;
}
break;
}
case 2:
{
tree.LIST_LOWER_QUANTITY_ITEMS(tree.root);
break;
}
case 3:
{
tree.REFILL_ITEMS(tree.root);
// UPDATE DATA IN FILE AS WELL.
fstream write("DATA.csv" , ios::out | ios::trunc);
if(!write){
cerr<<"\n ERROR:: COULD NOT OPEN FILE.\n";
break;
}
else{
write<<tree.root->data.id<<","<<tree.root->data.name<<","<<tree.root->data.descript<<","<<tree.root->data.price<<","<<tree.root->data.quantity<<"\n";
tree.W_IN_ORDER(tree.root, write);
write.close();
}
break;
}
case 0:
{
cout<<ANSI_COLOR_BOLD_GREEN<<"\n\t -------------------------------------- \n";
cout<<"\t | THANK YOU FOR USING OUR SYSTEM. |\n";
cout<<"\t -------------------------------------- \n"<<ANSI_COLOR_RESET<<endl;
return;
}
default:
{
cout<<ANSI_COLOR_BOLD_RED<<"\n\t--------------------------------------\n";
cout<<"\t| !!!! ENTER A VALID INPUT !!!! |\n";
cout<<"\t----------------------------------------\n"<<ANSI_COLOR_RESET<<endl;
break;
}
}//switch
}//loop
return;
}
#endif