-
Notifications
You must be signed in to change notification settings - Fork 0
/
node.cpp
420 lines (339 loc) · 8.75 KB
/
node.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
// FILE: node.cpp
//
//
// COEN 79
// --- Behnam Dezfouli, COEN, SCU ---
//
//
// IMPLEMENTS: The functions of the node class and the
// linked list toolkit (see node1.h for documentation).
//
// INVARIANT for the node class:
// The data of a node is stored in data_field
// and the link to the next node is stored in link_field.
#include "node.h"
#include <iostream>
#include <cassert> // Provides assert
#include <cstdlib> // Provides NULL and size_t
using namespace std;
namespace coen79_lab6
{
size_t list_length(const node* head_ptr)
// Library facilities used: cstdlib
{
const node *cursor;
size_t answer;
answer = 0;
for (cursor = head_ptr; cursor != NULL; cursor = cursor->link( ))
++answer;
return answer;
}
void list_head_insert(node*& head_ptr, const node::value_type& entry)
{
head_ptr = new node(entry, head_ptr);
}
void list_insert(node* previous_ptr, const node::value_type& entry)
{
node *insert_ptr;
insert_ptr = new node(entry, previous_ptr->link( ));
previous_ptr->set_link(insert_ptr);
}
node* list_search(node* head_ptr, const node::value_type& target)
// Library facilities used: cstdlib
{
node *cursor;
for (cursor = head_ptr; cursor != NULL; cursor = cursor->link( ))
if (target == cursor->data( ))
return cursor;
return NULL;
}
const node* list_search(const node* head_ptr, const node::value_type& target)
// Library facilities used: cstdlib
{
const node *cursor;
for (cursor = head_ptr; cursor != NULL; cursor = cursor->link( ))
if (target == cursor->data( ))
return cursor;
return NULL;
}
node* list_locate(node* head_ptr, size_t position)
// Library facilities used: cassert, cstdlib
{
node *cursor;
size_t i;
assert (0 < position);
cursor = head_ptr;
for (i = 1; (i < position) && (cursor != NULL); i++)
cursor = cursor->link( );
return cursor;
}
const node* list_locate(const node* head_ptr, size_t position)
// Library facilities used: cassert, cstdlib
{
const node *cursor;
size_t i;
assert (0 < position);
cursor = head_ptr;
for (i = 1; (i < position) && (cursor != NULL); i++)
cursor = cursor->link( );
return cursor;
}
void list_head_remove(node*& head_ptr)
{
node *remove_ptr;
remove_ptr = head_ptr;
head_ptr = head_ptr->link( );
delete remove_ptr;
}
void list_remove(node* previous_ptr)
{
node *remove_ptr;
remove_ptr = previous_ptr->link( );
previous_ptr->set_link( remove_ptr->link( ) );
delete remove_ptr;
}
void list_clear(node*& head_ptr)
// Library facilities used: cstdlib
{
while (head_ptr != NULL)
list_head_remove(head_ptr);
}
void list_copy(const node* source_ptr, node*& head_ptr, node*& tail_ptr)
// Library facilities used: cstdlib
{
head_ptr = NULL;
tail_ptr = NULL;
// Handle the case of the empty list.
if (source_ptr == NULL)
return;
// Make the head node for the newly created list, and put data in it.
list_head_insert(head_ptr, source_ptr->data( ));
tail_ptr = head_ptr;
// Copy the rest of the nodes one at a time, adding at the tail of new list.
source_ptr = source_ptr->link( );
while (source_ptr != NULL)
{
list_insert(tail_ptr, source_ptr->data( ));
tail_ptr = tail_ptr->link( );
source_ptr = source_ptr->link( );
}
}
//MY IMPLEMENTATIONS
void list_piece(node* start_ptr, node* end_ptr, node*& head_ptr, node*& tail_ptr)
{
// Library facilities used: cassert, cstdlib
//Precondition
bool inSameList = false;
node *curr = start_ptr;
while (curr != NULL)
{
if (curr == end_ptr)
{
inSameList = true;
break;
}
curr = curr->link();
}
assert(inSameList);
head_ptr = start_ptr;
if (end_ptr)
{
tail_ptr = end_ptr;
end_ptr = end_ptr->link();
tail_ptr->set_link(nullptr);
}else
{
tail_ptr = NULL;
}
}
size_t list_occurrences(node* head_ptr, const node::value_type& target)
{
// Library facilities used: cstdlib
int count = 0;
node *curr = head_ptr;
while (curr != NULL)
{
if (curr->data() == target)
{
count++;
}
curr = curr->link();
}
return count;
}
void list_insert_at(node*& head_ptr, const node::value_type& entry, size_t position)
{
// Library facilities used: cassert, cstdlib
//Precondition
assert(head_ptr != NULL);
assert(position > 0 && position <= list_length(head_ptr) + 1);
node *curr;
//Case for inserting at head
if (position == 1)
{
node *new_node = new node(entry, head_ptr);
head_ptr = new_node;
}else
{
curr = head_ptr;
int curr_position = 1;
while (curr_position < position - 1 && curr->link() != NULL)
{
curr = curr->link();
curr_position++;
}
}
//Making the new node and inserting it at the correct posiiton
node *new_node = new node(entry, curr->link());
curr->set_link(new_node);
}
node::value_type list_remove_at(node*& head_ptr, size_t position)
{
// Library facilities used: cassert, cstdlib
//Precondition
assert(head_ptr != NULL);
assert(position > 0 && position <= list_length(head_ptr) + 1);
node::value_type erased;
node *curr;
node *temp;
//Case for removing the head_ptr
if (position == 1)
{
assert(head_ptr != NULL);
temp = head_ptr;
erased = temp->data();
head_ptr = head_ptr->link();
delete temp;
}else
{
curr = head_ptr;
int curr_position = 1;
while (curr_position < position - 1 && curr->link() != NULL)
{
curr = curr->link();
curr_position++;
}
assert(curr->link() != NULL && "Out of range");
temp = curr-> link();
erased = temp->data();
curr->set_link(temp->link());
delete temp;
}
return erased;
}
node* list_copy_segment(node* head_ptr, size_t start, size_t finish)
{
// Library facilities used: cassert, cstdlib
//Precondition
assert(head_ptr != NULL);
assert(start >= 1);
assert(finish >= start);
//Making new list
node *new_head = NULL;
node *new_tail = NULL;
int curr_position = 1;
//Finding the start position
node *curr = head_ptr;
while (curr_position < start && curr != NULL)
{
curr = curr->link();
curr_position++;
}
//Copying the nodes from start to finish
while (curr_position <= finish && curr != NULL)
{
node *new_node = new node(curr->data());
if (new_tail == NULL)
{
new_head = new_node;
new_tail = new_node;
}else
{
new_tail->set_link(new_node);
new_tail = new_node;
}
curr = curr->link();
curr_position++;
}
return new_head;
}
void list_print (const node* head_ptr)
{
// Library facilities used: cassert, cstdlib, iostream
//Precondition
assert(head_ptr != NULL);
const node *curr = head_ptr;
while (curr != NULL)
{
std::cout << curr->data();
curr = curr->link();
if (curr != NULL && curr->data() != head_ptr->data())
{
std::cout << " ";
}
}
//Spacer
std::cout << endl;
}
void list_remove_dups(node* head_ptr)
{
// Library facilities used: cassert, cstdlib, iostream
//Precondition
assert(head_ptr != NULL);
node *curr = head_ptr;
while (curr != NULL)
{
node *temp = curr;
while (temp->link() != NULL)
{
if (temp->link()->data() == current->data())
{
node *dupe = temp->link();
temp->set_link(dupe->link());
delete dupe;
}else
{
temp = temp->link();
}
}
//Updating to next node
curr = curr->link();
}
//Printing out
curr = head_ptr;
while (curr != NULL)
{
std::cout << curr->data() << " ";
curr = curr->link();
}
//Spacer
std::cout << endl;
}
node* list_detect_loop (node* head_ptr)
{
// Library facilities used: cassert, cstdlib,
//Similar to HW problem
//Precondition
assert(head_ptr != NULL);
//Necessary pointers
node *slow = head_ptr;
node *fast = head_ptr;
while (fast != NULL && fast->link() != NULL)
{
slow = slow->link();
fast = fast->link();
if (slow == fast)
{
node *loopStart = head_ptr;
while (loopStart != slow)
{
loopStart = loopStart->link();
slow = slow->link();
}
return loopStart;
}
}
//If there isn't a loop, just returns NULL
return NULL;
}
}