-
Notifications
You must be signed in to change notification settings - Fork 41
/
Copy pathmain.cpp
146 lines (112 loc) · 3.44 KB
/
main.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
//*****************************************************************************************************
//
// This program demonstrates the use of the LList class by instantiating a singly linked shortList of
// short integers and performing its methods.
//
// Other files required:
// 1. LList.h - header file for the LList class
//
//*****************************************************************************************************
#include "LList.h"
#include <iostream>
using namespace std;
//*****************************************************************************************************
void displayLList(bool success, LList<short> &shortList);
void checkState(LList<short> &shortList);
//*****************************************************************************************************
int main() {
LList<short> shortList;
bool success;
short num;
checkState(shortList);
for (int i = 0; i < 5; ++i) {
num = 10 * (i + 1);
success = shortList.insert(num);
if (success)
cout << "inserted " << num << endl;
displayLList(success, shortList);
}
cout << endl;
for (int i = 0; i < 2; ++i) {
num = 10 * (i + 1);
success = shortList.retrieve(num);
if (success)
cout << "retrieved " << num << endl;
displayLList(success, shortList);
}
cout << endl;
for (int i = 0; i < 5; ++i) {
num = (10 * (5 - i));
success = shortList.remove(num);
if (success)
cout << "removed " << num << endl;
displayLList(success, shortList);
}
return 0;
}
//*****************************************************************************************************
void displayLList(bool success, LList<short> &shortList) {
short front,
rear;
int numVal;
if (success) {
shortList.display();
shortList.viewFront(front);
shortList.viewRear(rear);
numVal = shortList.getNumValues();
if (numVal > 0)
cout << "numValues: " << numVal
<< "\tfront: " << front
<< "\trear: " << rear << endl;
else
cout << "numValues: " << numVal << endl;
}
checkState(shortList);
}
//*****************************************************************************************************
void checkState(LList<short> &shortList) {
if (shortList.isFull())
cout << "\nlist is full\n\n";
else if (shortList.isEmpty())
cout << "\nlist is empty\n\n";
}
//*****************************************************************************************************
/*
list is empty
inserted 10
10
numValues: 1 front: 10 rear: 10
inserted 20
10 -> 20
numValues: 2 front: 10 rear: 20
inserted 30
10 -> 20 -> 30
numValues: 3 front: 10 rear: 30
inserted 40
10 -> 20 -> 30 -> 40
numValues: 4 front: 10 rear: 40
inserted 50
10 -> 20 -> 30 -> 40 -> 50
numValues: 5 front: 10 rear: 50
retrieved 10
10 -> 20 -> 30 -> 40 -> 50
numValues: 5 front: 10 rear: 50
retrieved 20
10 -> 20 -> 30 -> 40 -> 50
numValues: 5 front: 10 rear: 50
removed 50
10 -> 20 -> 30 -> 40
numValues: 4 front: 10 rear: 40
removed 40
10 -> 20 -> 30
numValues: 3 front: 10 rear: 30
removed 30
10 -> 20
numValues: 2 front: 10 rear: 20
removed 20
10
numValues: 1 front: 10 rear: 10
removed 10
numValues: 0
list is empty
*/