-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathLinkedList.c
62 lines (51 loc) · 1.29 KB
/
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
#include "LinkedList.h"
#include <string.h>
#include <stdio.h>
LinkedList_Node * LinkedList_Node_p_new(void *data, size_t dataSize)
{
LinkedList_Node * node = malloc(sizeof(*node));
node->data = malloc(dataSize);
memcpy(node->data, data, dataSize);
node->prev = node->next = NULL;
return node;
}
void LinkedList_Node_p_delete(LinkedList_Node * node)
{
free(node->data);
free(node);
}
LinkedList LinkedList_new(size_t elementSize)
{
LinkedList list;
list.p_elementSize = elementSize;
list.p_nodeCount = 0;
list.head = list.tail = NULL;
return list;
}
void LinkedList_clear(LinkedList * list)
{
LinkedList_Node * node = list->head;
LinkedList_Node * next;
while (node != NULL)
{
next = node->next;
LinkedList_Node_p_delete(node);
node = next;
}
*list = LinkedList_new(list->p_elementSize);
}
void LinkedList_pushBack(LinkedList * list, void * data)
{
LinkedList_Node * node = LinkedList_Node_p_new(data, list->p_elementSize);
if (list->p_nodeCount == 0)
{
list->head = list->tail = node;
}
else
{
list->tail->next = node;
node->prev = list->tail;
list->tail = node;
}
list->p_nodeCount += 1;
}