forked from uva-cs/pdr
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathListTest.cpp
505 lines (418 loc) · 15.2 KB
/
ListTest.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
// Modified: 8/30/2006: mc2zk
// CS216 Lab 1 - Test Harness
// by Michael Crane
//
// Integrate this test harness with your List implementation to
// thoroughly test your design. I have only used functions that were
// explicitly defined in the specification, with one exception:
//
// I have assumed a global print function whose prototype is
// void printList(List l, bool forward);
//
// If the 'forward' parameter is true,
// the list is printed in forward order
// if the 'forward' parameter is false,
// the list is printed in reverse order
#include <iostream>
#include <string>
#include <cctype>
using namespace std;
#include "List.h"
#include "ListItr.h"
int menu (string option[], int n_opt);
//set up menu options
string option[] = {
"Quit",
"New List",
"Show List elements",
"Set ListItr with first()",
"Set ListItr with find()",
"Set ListItr with last()",
"Move ListItr forward",
"Move ListItr backward",
"Retrieve element at ListItr",
"Insert element before",
"Insert element after",
"Insert element at tail",
"Remove element",
"Cardinality (size)",
"Copy list w/copy constructor",
"Copy list with operator=",
"Make list empty",
};
int const n_choice = 17;
/*
* This main driver program interactively exercises a
* list package.
* It assumes a linked list implementation, and its real
* purpose is to exercise the underlying list manipulation
* procedures.
* It uses a menu to accept commands from the terminal,
* then performs the indicated command.
*/
int main () {
int command;
string response;
List *list = NULL;
ListItr *itr = NULL;
// Initialize this run
cout << "--------------------------------------------------" << endl;
cout << "\tThis test harness operates with one List" << endl;
cout << "\tobject and one ListItr object." << endl;
cout << endl;
cout << "\tUse the menu options to manipulate these" << endl;
cout << "\tobjects." << endl;
while (true) {
command = menu(option, n_choice);
switch (command) {
// Quit
case 1:
cout << "\tDo you really want to quit? (y/n) > ";
cin >> response;
// Exit normally
if (response[0] == 'y' || response[0] == 'Y') {
if (list != NULL) {
delete list;
}
if (itr != NULL) {
delete itr;
}
return 0;
}
break;
// New list
case 2:
if (list != NULL) {
delete list;
}
list = new List();
cout << "\tYou have created an empty list" << endl;
cout << "\tDo you want to initialize it with elements? (y/n) > ";
cin >> response;
if (response[0] != 'y' && response[0] != 'Y') {
break;
}
// accept elements
cout << "\t\tEnter elements one by one as integers." << endl;
cout << "\t\tAny non-numeric character, e.g. #, will terminate input" << endl;
cout << "\tEnter first element: ";
cin >> response;
while (isdigit(response[0])) {
int element = atoi(response.c_str());
list->insertAtTail(element);
cout << "\tEnter next element: ";
cin >> response;
}
cout << endl;
cout << "The elements in forward order: " << endl;
printList(*list, true);
break;
// Show elements
case 3:
if (list == NULL) {
cout << endl;
cout << "\tCreate a List first." << endl;
break;
}
cout << "\tPrint the list forwards or backwards? (f/b) > ";
cin >> response;
if (response[0] == 'b' || response[0] == 'B') {
cout << endl;
cout << "The elements in reverse order:" << endl;
printList(*list, false);
} else {
cout << endl;
cout << "The elements in forward order:" << endl;
printList(*list, true);
}
break;
// first()
case 4:
if (list == NULL) {
cout << endl;
cout << "\tCreate a List first." << endl;
break;
}
cout << "\tSetting the ListItr to the first element..." << endl;
if (itr != NULL) {
delete itr;
}
itr = new ListItr(list->first());
break;
// find()
case 5:
if (list == NULL) {
cout << endl;
cout << "\tCreate a List first." << endl;
break;
}
cout << "\tEnter element to find: ";
cin >> response;
if (isdigit(response[0])) {
int element = atoi(response.c_str());
cout << "\tSetting the ListItr to find(" << element << ")..." << endl;
if (itr != NULL) {
delete itr;
}
itr = new ListItr(list->find(element));
} else {
cout << "\tPlease enter an integer." << endl;
}
break;
// last()
case 6:
if (list == NULL) {
cout << endl;
cout << "\tCreate a List first." << endl;
break;
}
cout << "\tSetting the ListItr to the last element..." << endl;
if (itr != NULL) {
delete itr;
}
itr = new ListItr(list->last());
break;
// moveForwards()
case 7:
if (itr == NULL) {
cout << endl;
cout << "\tCreate a ListItr first." << endl;
break;
}
cout << "\tMoving the ListItr forwards..." << endl;
itr->moveForward();
break;
// moveBackwards()
case 8:
if (itr == NULL) {
cout << endl;
cout << "\tCreate a ListItr first." << endl;
break;
}
cout << "\tMoving the ListItr backwards..." << endl;
itr->moveBackward();
break;
// retrieve()
case 9:
if (itr == NULL) {
cout << endl;
cout << "\tCreate a ListItr first." << endl;
break;
}
if (itr->isPastBeginning()) {
cout << "\tThe ListItr is past the beginning." << endl;
} else if (itr->isPastEnd()) {
cout << "\tThe ListItr is past the end." << endl;
} else {
cout << "\tElement retrieved: " << itr->retrieve() << endl;
}
break;
// insertBefore()
case 10:
if (list == NULL || itr == NULL) {
cout << endl;
cout << "\tCreate a List and ListItr first." << endl;
break;
}
cout << "\tEnter element to insert: ";
cin >> response;
if (isdigit(response[0])) {
int element = atoi(response.c_str());
list->insertBefore(element, *itr);
cout << "\tInserting " << element << " before the current ListItr" << endl;
} else {
cout << "\tPlease enter an integer." << endl;
break;
}
cout << endl;
cout << "The elements in forward order: " << endl;
printList(*list, true);
break;
// insertAfter()
case 11:
if (list == NULL || itr == NULL) {
cout << endl;
cout << "\tCreate a List and ListItr first." << endl;
break;
}
cout << "\tEnter element to insert: ";
cin >> response;
if (isdigit(response[0])) {
int element = atoi(response.c_str());
list->insertAfter(element, *itr);
cout << "\tInserting " << element << " after the current ListItr" <<endl;
} else {
cout << "\tPlease enter an integer." << endl;
break;
}
cout << endl;
cout << "The elements in forward order: " << endl;
printList(*list, true);
break;
// insertAtTail()
case 12:
if (list == NULL) {
cout << endl;
cout << "\tCreate a List first." << endl;
break;
}
cout << "\tEnter element to insert: ";
cin >> response;
if (isdigit(response[0])) {
int element = atoi(response.c_str());
list->insertAtTail(element);
cout << "\tInserting " << element << " at the tail of the list" << endl;
} else {
cout << "\tPlease enter an integer." << endl;
break;
}
cout << endl;
cout << "The elements in forward order: " << endl;
printList(*list, true);
break;
// remove()
case 13:
if (list == NULL) {
cout << endl;
cout << "\tCreate a List first." << endl;
break;
}
cout << "\tEnter element to remove: ";
cin >> response;
if (isdigit(response[0])) {
int element = atoi(response.c_str());
list->remove(element);
cout << "\tRemoving " << element << " from list" <<endl;
} else {
cout << "\tPlease enter an integer." << endl;
break;
}
cout << endl;
cout << "The elements in forward order: " << endl;
printList(*list, true);
break;
// size()
case 14:
if (list == NULL) {
cout << endl;
cout << "\tCreate a List first." << endl;
break;
}
cout << "\tSize of list: " << list->size() << endl;
break;
// Copy constructor
case 15: {
if (list == NULL) {
cout << endl;
cout << "\tCreate a List first." << endl;
break;
}
List* old_list = list;
list = new List(*old_list);
old_list->makeEmpty();
cout << "The new list is (forward): ";
printList(*list, true);
cout << "The new list is (backward): ";
printList(*list, false);
cout << "The old list was made empty (forward): ";
printList(*old_list, true);
cout << "The old list was made empty (backward): ";
printList(*old_list, false);
cout << "The old list should be destroyed now." << endl;
delete old_list;
if (itr != NULL) {
delete itr;
itr = NULL;
}
break;
}
// operator=
case 16: {
if (list == NULL) {
cout << endl;
cout << "\tCreate a List first." << endl;
break;
}
List* old_list = list;
list = new List();
*list = *old_list;
old_list->makeEmpty();
cout << "The new list is (forward): ";
printList(*list, true);
cout << "The new list is (backward): ";
printList(*list, false);
cout << "The old list was made empty (forward): ";
printList(*old_list, true);
cout << "The old list was made empty (backward): ";
printList(*old_list, false);
cout << "The old list should be destroyed now." << endl;
delete old_list;
if (itr != NULL) {
delete itr;
itr = NULL;
}
break;
}
// makeEmpty()
case 17:
if (list == NULL) {
cout << endl;
cout << "\tCreate a List first." << endl;
break;
}
cout << "The list is (forward): ";
printList(*list, true);
cout << "The list is (backward): ";
printList(*list, false);
list->makeEmpty();
if (itr != NULL) {
delete itr;
itr = NULL;
}
cout << "The list was made empty (forward): ";
printList(*list, true);
cout << "The list was made empty (backward): ";
printList(*list, false);
}
}
}
/*
* This simple routine takes an array of 'n_opt' options
* (pointers to strings, describing the 'option')
* displays these options on the screen,
* and requests a choice on the part of the user
* It returns the integer number (position in the list)
* of the chosen option.
*
* NOTE, all input and output uses 'stdin' and 'stdout'
*/
int menu (string option[], int n_opt) {
int choice, i;
string input;
cout << " - - - - - - MENU - - - - - -" << endl;
cout << endl;
for (i = 0; i < n_opt; i++) {
cout << "\t" << i + 1 << " - " << option[i] << endl;
}
cout << endl;
cout << " - - - - - - - - - - - - - - -" << endl;
while (input.empty()) {
cout << " Enter number of choice > ";
cin >> input;
if (isdigit(input[0])) {
choice = atoi(input.c_str());
if (choice <= n_opt && choice > 0) {
return choice;
} else {
/* choice out of range */
cout << "\tYour response MUST be between 1 and " << n_opt << endl;
input.clear();
}
} else {
/* Non-numeric input, ignore */
cout << "\tYour response MUST be a number!" << endl;
input.clear();
}
}
return 1;
}