-
Notifications
You must be signed in to change notification settings - Fork 5
Expand file tree
/
Copy pathgeneric_list.c
More file actions
134 lines (97 loc) · 2.84 KB
/
generic_list.c
File metadata and controls
134 lines (97 loc) · 2.84 KB
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
#include <stdlib.h>
#include <assert.h>
#include "common.h"
lnode_t* list_node_new(void)
{
lnode_t *ptr;
ptr = malloc(sizeof (lnode_t));
assert (ptr != NULL);
ptr->data = NULL;
ptr->next = NULL;
return ptr;
}
lnode_t* list_link(lnode_t *head, lnode_t *node)
{
lnode_t *ptr;
if (head == NULL)
return node;
for (ptr = head; ptr->next != NULL; ptr = ptr->next) ;
ptr->next = node;
return head;
}
lnode_t* list_unlink(lnode_t *head, lnode_t *node)
{
lnode_t *ptr, *ret = head, *prev = NULL;
for (ptr = head; ptr != NULL; ptr = ptr->next) {
if (ptr == node) {
if (prev == NULL && ptr->next != NULL)
ret = ptr->next;
else if (prev == NULL && ptr->next == NULL)
ret = NULL;
else if (prev != NULL && ptr->next != NULL)
prev->next = ptr->next;
else if (prev != NULL && ptr->next == NULL)
prev->next = NULL;
//free(ptr);
break;
}
prev = ptr;
}
return ret;
}
lnode_t* list_unlink_by_number(lnode_t *head, size_t number)
{
lnode_t *ptr;
size_t num = 0;
for (ptr = head; ptr != NULL; ptr = ptr->next) {
if (num++ == number) {
return list_unlink(head, ptr);
}
}
return head;
}
lnode_t* list_node_to_front(lnode_t *head, lnode_t *node)
{
lnode_t *ptr, *phead, *ret;
ptr = node;
phead = list_unlink(head, node);
ptr->next = NULL;
ret = list_link(ptr, phead);
return ret;
}
lnode_t* list_node_to_back(lnode_t *head, lnode_t *node)
{
lnode_t *ptr, *phead, *ret;
ptr = node;
phead = list_unlink(head, node);
ptr->next = NULL;
ret = list_link(phead, ptr);
return ret;
}
lnode_t* list_get_node_by_number(lnode_t *head, size_t number)
{
lnode_t *ptr;
size_t num = 0;
for (ptr = head; ptr != NULL; ptr = ptr->next) {
if (num++ == number) {
return ptr;
}
}
return NULL;
}
lnode_t* list_destroy(lnode_t *head)
{
lnode_t *ptr, *prev = NULL;
ptr = head;
for (;;) {
if (ptr == NULL)
break;
prev = ptr;
ptr = ptr->next;
if (prev->data) {
free(prev->data);
}
free(prev);
}
return NULL;
}