-
Notifications
You must be signed in to change notification settings - Fork 0
/
dlinkedlist.cpp
366 lines (326 loc) · 6.17 KB
/
dlinkedlist.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
#include "dlinkedlist.h"
template <class T>
void DLinkedList <T> :: CopyList(const DLinkedList& ll)
{
//Check for Empty list
if (ll.IsEmpty() == true)
{
this->size = 0;
return;
}
//Initialize variables and temp is assigned to front of list
Node<T>* temp = ll.front;
this->size = 0;
this->front = temp;
this->back = temp;
//Insert nodes of ll into this->list with loop
while (temp != NULL)
{
this->InsertBack(temp->data);
temp = temp->next;
}
}
template <class T>
void DLinkedList <T>::DeleteList()
{
//Check for empty List
if (front == NULL && back == NULL)
{
return;
}
//Traves through List and remove nodes
Node<T>* temp = front;
while (temp != NULL)
{
temp = front->next;
delete front;
front = temp;
}
//Set size to 0 and pointers to NULL
size = 0;
front = back = NULL;
}
template <class T>
DLinkedList<T>::DLinkedList()
{
size = 0;
front = NULL;
back = NULL;
}
template <class T>
DLinkedList <T>:: DLinkedList(const DLinkedList& ll)
{
//Use helper function
CopyList(ll);
}
template <class T>
DLinkedList <T>::~DLinkedList()
{
//Use helper function
DeleteList();
}
template <class T>
void DLinkedList <T>::InsertFront(T item)
{
Node<T>* temp = new Node<T>(item);
//Empty List insert
if (IsEmpty() == true)
{
front = temp;
back = front;
}
//Insert at front of list
else
{
front->prev = temp;
temp->next = front;
front = temp;
}
size = size + 1;
}
template <class T>
void DLinkedList <T>::InsertBack(T item)
{
Node<T> *temp = new Node<T>(item);
//Empty List insert
if (IsEmpty() == true)
{
front = temp;
back = front;
}
//Insert at back of list
else
{
back->next = temp;
temp->prev = back;
back = temp;
}
size = size + 1;
}
template <class T>
void DLinkedList <T>::InsertAt(T item, int p)
{
//Check for proper index within boundary
if (p > size || p < 0)
{
//ERROR handle for out of Range
throw std::out_of_range("Out of Range");
}
Node<T> *node = new Node<T>(item);
Node<T> *current = front;
int count = 0;
//If index is at 0 (front of list) insert at front
if (p == 0)
{
InsertFront(node->data);
return;
}
//index if at 1 more end of list insert back
else if (p == size)
{
InsertBack(node->data);
return;
}
//Inerset at middle
while (current)
{
//Traverse to index and insert
if (count == p)
{
node->next = current;
current->prev->next = node;
node->prev = current->prev;
current->prev = node;
size = size + 1;
return;
}
count++;
current = current->next;
}
}
template <class T>
T DLinkedList <T>::RemoveAt(int p)
{
////Throw exception if list is empty
if (IsEmpty() == true)
{
throw std::out_of_range("Empty List");
}
//Throw exception for p is out of range
else if (p >= size || p < 0)
{
throw std::out_of_range("Out of Range");
}
Node<T> *deleteNode = front;
T ReturnData = deleteNode->data;
int count = 0;
//Remove at first Node
if (p == 0 && size > 1)
{
ReturnData = deleteNode->data;
front = deleteNode->next;
front->prev = NULL;
delete deleteNode;
size = size - 1;
return ReturnData;
}
//Remove at Last Node
else if (p == size-1 && size > 1)
{
deleteNode = back;
ReturnData = deleteNode->data;
back = deleteNode->prev;
back->next = NULL;
delete deleteNode;
size = size - 1;
return ReturnData;
}
//Remove Only Node
else if (size == 1 && p == 0)
{
ReturnData = deleteNode->data;
front = NULL;
back = NULL;
delete deleteNode;
size = size - 1;
return ReturnData;
}
//Remove Middle Node
else
{
while (deleteNode != NULL)
{
if (count == p)
{
ReturnData = deleteNode->data;
deleteNode->prev->next = deleteNode->next;
deleteNode->next->prev = deleteNode->prev;
delete deleteNode;
size = size - 1;
return ReturnData;
}
count++;
deleteNode = deleteNode->next;
}
}
return ReturnData;
}
template <class T>
void DLinkedList <T>::RemoveDuplicates()
{
////Throw exception if list is empty
if (IsEmpty() == true)
{
throw std::out_of_range("Empty List ");
}
Node<T> *current = front;
Node<T> *search = current->next;
int indexOut = 0;
int indexIn = 1;
//Search for same data
while (current != NULL)
{
while (search != NULL)
{
if (search->data == current->data)
{
//Remove at Index
search = search->prev;
RemoveAt(indexIn);
indexIn--;
}
indexIn++;
search = search->next;
}
//Stoping point
if (search == NULL && current->next == NULL)
{
break;
}
current = current->next;
search = current->next;
indexOut++;
indexIn = indexOut + 1;
}
}
template <class T>
int DLinkedList <T>:: Size() const
{
return size;
}
template <class T>
bool DLinkedList <T>:: IsEmpty() const
{
if (Size() == 0 )
{
return true;
}
else
{
return false;
}
}
template <class T>
bool DLinkedList <T>:: Contains (T item) const
{
if (IsEmpty() == true)
{
throw std::out_of_range("Empty List ");
}
Node<T> *node = new Node<T>(item);
Node<T> *current = front;
while (current != NULL)
{
if (current->data == node->data)
{
return true;
}
current = current->next;
}
return false;
}
template <class T>
T DLinkedList <T>::ElementAt(int p) const
{
//Throw exception for errors
if (IsEmpty() == true)
{
throw std::out_of_range("Empty List ");
}
if (p >= size || p < 0)
{
throw std::exception("Out of Bounce");
}
Node<T>* temp = front;
int count = 0;
while (temp != NULL)
{
if (count == p)
{
return temp->data;
}
count++;
temp = temp->next;
}
return front->data;
}
template <class T>
DLinkedList<T>& DLinkedList <T>::operator = (const DLinkedList& ll)
{
//If ll is a empty list
if (ll.IsEmpty() == true)
{
this->DeleteList();
return *this;
}
//Delete List and copy ll into this list
if (this != &ll)
{
if (this->front != NULL)
{
this->DeleteList();
}
CopyList(ll);
}
return *this;
}