-
Notifications
You must be signed in to change notification settings - Fork 0
/
Unrolled_LinkedList.c
353 lines (315 loc) · 9.77 KB
/
Unrolled_LinkedList.c
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
//
// Created by wmespindula on 28/10/2021.
//
#include <malloc.h>
#include <string.h>
#include "LinkedList.h"
#define ITEMS_PER_BLOCK 8
Node unrolled_findElement(LinkedList list, u_int pos);
void unrolled_quickSort(double a[], int l, int u);
int unrolled_partition(double a[], int l, int u);
struct ArrayNode *unrolled_split(struct ArrayNode *head);
struct ArrayNode *unrolled_mergeSort(struct ArrayNode *head);
ArrayNode *arrayNode_create() {
ArrayNode *arrayNode = malloc(sizeof(ArrayNode));
arrayNode->usedSlots = 0;
arrayNode->next = NULL;
arrayNode->prev = NULL;
return arrayNode;
}
LinkedList unrolled_initLinkedList() {
ArrayNode *pArrayNode = arrayNode_create();
LinkedList ll = {
// variables
.size = 0,
.headArrayNode = pArrayNode,
.tailArrayNode = pArrayNode,
// methods
.add = unrolled_insertTail,
.addLast = unrolled_insertTail,
.get = unrolled_get,
.getFirst = unrolled_getFirst,
.getLast = unrolled_getLast,
.isDone = unrolled_isDone,
.next = unrolled_next,
.previous = unrolled_previous,
.delete = unrolled_deleteTail,
.verbosePrint = verbosePrint,
.simplePrint = simplePrint,
.forEach = unrolled_forEach,
.sort = unrolled_sort
};
return ll;
}
bool unrolled_insertTail(LinkedList *linkedList, double data) {
if (linkedList->tailArrayNode->usedSlots == ITEMS_PER_BLOCK) {
ArrayNode *newArrayNode = arrayNode_create();
newArrayNode->prev = linkedList->tailArrayNode;
linkedList->tailArrayNode->next = newArrayNode;
linkedList->tailArrayNode = newArrayNode;
}
ArrayNode *tail = linkedList->tailArrayNode;
tail->array[tail->usedSlots] = data;
tail->usedSlots++;
linkedList->size++;
return true;
}
bool unrolled_deleteTail(LinkedList *linkedList) {
if (linkedList->tailArrayNode->usedSlots > 0) {
linkedList->tailArrayNode->usedSlots--;
} else {
if (linkedList->tailArrayNode->prev != NULL) {
ArrayNode *tailArrayNode = linkedList->tailArrayNode;
linkedList->tailArrayNode->prev->next = NULL;
linkedList->tailArrayNode = tailArrayNode->prev;
free(tailArrayNode);
} else {
return false;
}
}
linkedList->size--;
return true;
}
Node unrolled_findHead(LinkedList linkedList) {
ArrayNode *headArrayNode = linkedList.headArrayNode;
if (headArrayNode && headArrayNode->usedSlots > 0) {
Node headNode = {
.data = headArrayNode->array[0],
.isValid = true,
.currArrayNode = headArrayNode,
.pos = 0
};
return headNode;
} else {
Node nextNode = {
.isValid = false,
.pos = -1,
.currArrayNode = NULL
};
return nextNode;
}
}
Node unrolled_findTail(LinkedList linkedList) {
ArrayNode *tailArrayNode = linkedList.tailArrayNode;
if (tailArrayNode && tailArrayNode->usedSlots > 0) {
Node tailNode = {
.data = tailArrayNode->array[tailArrayNode->usedSlots - 1],
.isValid = true,
.currArrayNode = tailArrayNode,
.pos = (int) tailArrayNode->usedSlots - 1
};
return tailNode;
} else {
Node nextNode = {
.isValid = false,
.pos = -1,
.currArrayNode = NULL
};
return nextNode;
}
}
Node unrolled_findElement(LinkedList linkedList, u_int pos) {
Node current = unrolled_findHead(linkedList);
for (int i = 0; i < pos; i++) {
current = unrolled_next(current);
}
return current;
}
Node unrolled_get(LinkedList linkedList, u_int pos) {
if (pos < linkedList.size) {
return unrolled_findElement(linkedList, pos);
} else {
return unrolled_findTail(linkedList);
}
}
Node unrolled_getFirst(LinkedList linkedList) {
return unrolled_findHead(linkedList);
}
Node unrolled_getLast(LinkedList linkedList) {
return unrolled_findTail(linkedList);
}
bool unrolled_isDone(Node node) {
return node.isValid == false;
}
Node unrolled_next(Node node) {
ArrayNode *current = node.currArrayNode;
if (node.pos == current->usedSlots - 1) {
if (current->next != NULL) {
// If the node is the last of a block, gets the first of the next block
Node nextNode = {
.data = current->next->array[0],
.isValid = true,
.pos = 0,
.currArrayNode = current->next
};
return nextNode;
} else {
Node nextNode = {
.isValid = false,
.pos = -1,
.currArrayNode = NULL
};
return nextNode;
}
} else {
int currentPos = node.pos;
Node nextNode = {
.data = current->array[currentPos + 1],
.isValid = true,
.pos = currentPos + 1,
.currArrayNode = current
};
return nextNode;
}
}
Node unrolled_previous(Node node) {
ArrayNode *current = node.currArrayNode;
if (node.pos == 0) {
if (current->prev != NULL) {
size_t lastElementInBlock = current->prev->usedSlots;
// If the node is the first of a block, gets the last of the previous block
Node nextNode = {
.data = current->prev->array[lastElementInBlock - 1],
.isValid = true,
.pos = (int) lastElementInBlock - 1,
.currArrayNode = current->prev
};
return nextNode;
} else {
// If the node is the head, returns an invalid node
Node nextNode = {
.isValid = false,
.pos = -1,
.currArrayNode = NULL
};
return nextNode;
}
} else {
int currentPos = node.pos;
Node nextNode = {
.data = current->array[currentPos - 1],
.isValid = true,
.pos = currentPos - 1,
.currArrayNode = current
};
return nextNode;
}
}
void unrolled_forEach(LinkedList linkedList, void (*func)(double data)) {
if (linkedList.headArrayNode != NULL) {
ArrayNode *currArrayNode = linkedList.headArrayNode;
while (currArrayNode != NULL) {
for (int i = 0; i < currArrayNode->usedSlots; i++) {
double data = currArrayNode->array[i];
func(data);
}
currArrayNode = currArrayNode->next;
}
}
}
void unrolled_sort(LinkedList *linkedList) {
ArrayNode *curr = linkedList->headArrayNode;
unrolled_mergeSort(curr);
}
/* ------ QUICK AND MERGE SORT ALGORITHMS ------ */
void unrolled_quickSort(double a[], int l, int u) {
int j;
if (l < u) {
j = unrolled_partition(a, l, u);
unrolled_quickSort(a, l, j - 1);
unrolled_quickSort(a, j + 1, u);
}
}
int unrolled_partition(double a[], int l, int u) {
int i, j;
double v, temp;
v = a[l];
i = l;
j = u + 1;
do {
do
i++;
while (a[i] < v && i <= u);
do
j--;
while (v < a[j]);
if (i < j) {
temp = a[i];
a[i] = a[j];
a[j] = temp;
}
} while (i < j);
a[l] = a[j];
a[j] = v;
return (j);
}
void merge(ArrayNode *head, int size, int lo, int mid, int hi) {
double aux[size];
// copy to aux[]
ArrayNode *curr = head;
int k = 0;
while (curr) {
memcpy(&aux[k], curr->array, sizeof(double) * curr->usedSlots);
k += curr->usedSlots;
curr = curr->next;
}
// merge back to a[]
int i = lo, j = mid;
ArrayNode *currArrayNode = head;
while (currArrayNode != NULL) {
for (k = 0; k < currArrayNode->usedSlots; k++) {
if (i >= mid) { // NOLINT(bugprone-branch-clone)
currArrayNode->array[k] = aux[j++];
} else if (j > hi) { // NOLINT(bugprone-branch-clone)
currArrayNode->array[k] = aux[i++];
} else if (aux[j] < aux[i]) {
currArrayNode->array[k] = aux[j++];
} else {
currArrayNode->array[k] = aux[i++];
}
}
currArrayNode = currArrayNode->next;
}
}
struct ArrayNode *unrolled_merge(ArrayNode *head, ArrayNode *second) {
ArrayNode *curr = head;
int size = curr->usedSlots;
while (curr->next != NULL) {
size += curr->usedSlots;
curr = curr->next;
}
int mid = size;
curr->next = second;
curr = curr->next;
while (curr != NULL) {
size += curr->usedSlots;
curr = curr->next;
}
merge(head, size, 0, mid, size - 1);
return head;
}
// Function to do unrolled_merge sort
struct ArrayNode *unrolled_mergeSort(struct ArrayNode *head) {
if (!head || !head->next) {
if (head && !head->next) {
unrolled_quickSort(head->array, 0, head->usedSlots - 1);
}
return head;
}
struct ArrayNode *second = unrolled_split(head);
// Recur for left and right halves
head = unrolled_mergeSort(head);
second = unrolled_mergeSort(second);
// Merge the two sorted halves
return unrolled_merge(head, second);
}
struct ArrayNode *unrolled_split(struct ArrayNode *head) {
struct ArrayNode *fast = head, *slow = head;
while (fast->next && fast->next->next) {
fast = fast->next->next;
slow = slow->next;
}
struct ArrayNode *temp = slow->next;
slow->next = NULL;
return temp;
}