forked from bilal255/linkedList
-
Notifications
You must be signed in to change notification settings - Fork 1
/
linkList.cpp
236 lines (208 loc) · 5.12 KB
/
linkList.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
#include<iostream>
#include<fstream>
#include"nodeClass.cpp"
using namespace std;
class cList {
//The HEAD reference of LIST object
cNode *headNode;
public:
//Keep record of the number of elements of LIST class
int count = 0;
//LIST constructors
cList() { headNode = NULL; count = 0; }
cList(cNode *&nodeRef) { headNode = nodeRef; headNode->nextNode = NULL; count = 1; }
//COPY CONSTRUCTOR of LIST class
cList(cList &listRef) {
this->headNode = listRef.headNode;
if (listRef.headNode) {
cNode *sptr, *dptr;
dptr = headNode = new cNode(*listRef.headNode);
sptr = headNode->nextNode;
while (sptr) {
dptr->nextNode = new cNode(*sptr);
dptr = dptr->nextNode;
sptr = sptr->nextNode;
}
}
}
//Overloading ASSIGNMENT OPERATOR
cList& operator = (const cList &listRef) {
if (this == &listRef) return *this;
if (true) { cList temp; temp.headNode = this->headNode; }
if (true) { cList temp; temp = listRef ; this->headNode = temp.headNode; temp.headNode = NULL; }
return *this;
}
//Constructors for FILE HANDLING 'INPUT DATA FROM FILE'
cList(ifstream &inFile) :headNode(NULL), count(0) {
inFile.read((char*)&count, sizeof(count));
if (count > 0) {
cNode *ptr;
ptr = headNode = new cNode(inFile);
for (int i = 1; i < count; ++i) {
ptr->nextNode = new cNode(inFile);
ptr = ptr->nextNode;
}
ptr->nextNode = NULL;
}
}
//Constructors for FILE HANDLING 'OUTPUT DATA TO FILE'
cList(ofstream &outFile) {
outFile.write((char*)&count, sizeof(count));
if (count > 0) {
cNode *ptr = headNode;
ptr = new cNode(outFile);
for (int i = 1; i < count; i++) {
ptr->nextNode = new cNode(outFile);
ptr = ptr->nextNode;
}
}
}
//Function for writing LIST data to file
void writeListToFile(ofstream &oFile) {
if (!(oFile.is_open())) {
cout << "File is not opened for writing !" << endl;
}
else {
oFile.write((char*)&count, sizeof(count));
if (count > 0) {
cNode *rptr = headNode;
for (int i = 0; i < count; ++i) {
rptr->writeNodetoFile(oFile);
rptr = rptr->nextNode;
}
}
}
}
//Function for reading LIST data from file
void readListFromFile(ifstream &inFile) {
if (true) { cList temp; temp.headNode = this->headNode; }
if (!(inFile.is_open())) {
cout << "File is not opened for writing !" << endl;
}
else {
inFile.read((char*)&count, sizeof(count));
cout << "The count read is " << count << endl;
if (count > 0) {
cNode *rptr = headNode = new cNode(inFile);
for (int i = 1; i < count; ++i) {
rptr->nextNode = new cNode(inFile);
rptr = rptr->nextNode;
}
rptr->nextNode = NULL;
}
}
}
//Class pre-conditions
bool isEmpty() { if (headNode) return false; else return true; }
bool isNotEmpty() { if (headNode) return true; else return false; }
//Insert a node at the beginning of the LIST
cList& insert(cNode *&nodeRef) {
nodeRef->nextNode = headNode;
headNode = nodeRef;
nodeRef = NULL;
++count;
return *this;
}
//Insert a node at a specific position of the LIST
cList& insertAt(cNode *&nodeRef, int index) {
if (index <= 0)
return insert(nodeRef);
if (index >= count)
index = count;
cNode *rptr = headNode;
for (int i = 0; i < count; i++)
rptr = rptr->nextNode;
nodeRef->nextNode = rptr->nextNode;
rptr->nextNode = nodeRef;
nodeRef = NULL;
++count;
return *this;
}
//Remove node form the beginning of the LIST
cNode* remove() {
if (isNotEmpty()) {
cNode *temp = headNode;
headNode = temp->nextNode;
temp->nextNode = NULL;
--count;
return temp;
}
else {
cerr << "The list is already empty and can't remove a node from list " << endl;
exit(1);
}
}
//Remove node from some specific location from LIST
cNode* removeAt(int index) {
if (index <= 0)
return remove();
if (index >= count)
index = count;
cNode *temp, *rptr;
rptr = headNode;
for (int i = 0; i < index - 1; ++i)
rptr = rptr->nextNode;
temp = rptr->nextNode;
rptr->nextNode = temp->nextNode;
--count;
temp->nextNode = NULL;
return temp;
}
//Helper function to DISPLAY node DATA of LIST
void printList() {
if (!headNode)
cout << "\nEMPTY DATA STRUCTURE\n";
else {
cout << "The elements from TOP to BOTTOM are \n";
cNode *nodeRef = headNode;
//print all elements until last node NULL reference is reached
while (nodeRef) {
nodeRef->printNode();
cout << "\n";
nodeRef = nodeRef->nextNode;
}
}
}
//Class Destructor
~cList() {
deleteNode(headNode);
{
void deleteNode(cNode *nodeRef);
}
}
//Local function for Destructor
void deleteNode(cNode *nodeRef) {
if (nodeRef) {
deleteNode(nodeRef->nextNode);
delete nodeRef;
}
}
};
#include <iostream>
#include<string.h>
#include<ctype.h>
#define MAX 20
using namespace std;
int main()
{
double number;
number=5.1;
cout <<number<<endl;
int size =sizeof(number);
cout<<size<<endl<<endl<<endl;
char name[MAX];
int x;
cout <<"enter name:"<<endl;
cin>>name;
for(int x;x<strlen(name);x++)
{
name[x]=tolower(name[x]);
}
cout<<endl<<name<<endl;
int v;
for(int v=20;v> 1;v--)
{
cout<<v<<endl;
}
return 0;
}