-
Notifications
You must be signed in to change notification settings - Fork 0
/
llist.c
225 lines (178 loc) · 3.66 KB
/
llist.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
#include "llist.h"
struct strllist* strllist_create(void)
{
struct strllist* newlist = (struct strllist *) malloc(sizeof(struct strllist));
newlist->head = NULL;
newlist->tail = NULL;
return newlist;
}
void strllist_add(struct strllist* list, char* text)
{
struct strllist_node* newtail = strllist_nalloc();
newtail->text = text;
if (list->head == NULL)
{
list->head = newtail;
list->tail = newtail;
}
else
{
list->tail->next = newtail;
list->tail = newtail;
}
}
int strllist_count(struct strllist* list)
{
if (list->head == NULL)
{
return 0;
}
struct strllist_node* currnode = list->head;
int count = 0;
while (currnode != NULL)
{
count++;
currnode = currnode->next;
}
return count;
}
void strllist_print(struct strllist* list)
{
if (list->head == NULL)
{
return;
}
struct strllist_node* currnode = list->head;
while (currnode != NULL)
{
currnode = currnode->next;
}
}
void strllist_del(struct strllist* list)
{
if (list->head == NULL)
{
return;
}
struct strllist_node* currnode = list->head;
struct strllist_node* prevnode;
while (currnode != NULL)
{
prevnode = currnode;
currnode = currnode->next;
free(prevnode->text);
free(prevnode);
}
}
char** strllist_to_array(struct strllist* list, int size)
{
char** collist = malloc(sizeof(char*) * size);
struct strllist_node* currnode = list->head;
for (int i = 0; i < size; i++)
{
collist[i] = currnode->text;
currnode = currnode->next;
}
return collist;
}
struct strllist_node* strllist_nalloc(void)
{
struct strllist_node* newnode = (struct strllist_node *) malloc(sizeof(struct strllist_node));
newnode->next = NULL;
return newnode;
}
struct strarrllist* strarrllist_create(void)
{
struct strarrllist* newlist = (struct strarrllist *) malloc(sizeof(struct strarrllist));
newlist->head = NULL;
newlist->tail = NULL;
return newlist;
}
void strarrllist_add(struct strarrllist* list, char** arr)
{
struct strarrllist_node* newtail = strarrllist_nalloc();
newtail->arr = arr;
if (list->head == NULL)
{
list->head = newtail;
list->tail = newtail;
}
else
{
list->tail->next = newtail;
list->tail = newtail;
}
}
int strarrllist_count(struct strarrllist* list)
{
if (list->head == NULL)
{
return 0;
}
struct strarrllist_node* currnode = list->head;
int count = 0;
while (currnode != NULL)
{
count++;
currnode = currnode->next;
}
return count;
}
void strarrllist_del(struct strarrllist* list)
{
if (list->head == NULL)
{
return;
}
struct strarrllist_node* currnode = list->head;
struct strarrllist_node* prevnode;
while (currnode != NULL)
{
prevnode = currnode;
currnode = currnode->next;
free(prevnode->arr);
free(prevnode);
}
}
/*
void strarrllist_print(struct strarrllist* list)
{
if (list->head == NULL)
{
return;
}
struct strarrllist_node* currnode = list->head;
while (currnode != NULL)
{
currnode = currnode->next;
}
}
*/
struct strarrllist_node* strarrllist_nalloc(void)
{
struct strarrllist_node* newnode = (struct strarrllist_node *) malloc(sizeof(struct strarrllist_node));
newnode->next = NULL;
return newnode;
}
char*** strarrllist_to_array (struct strarrllist* list, int size)
{
char*** twodarr = (char***)malloc(sizeof(char***) * size);
struct strarrllist_node* currnode = list->head;
for (int i = 0; i < size; i++)
{
twodarr[i] = currnode->arr;
currnode = currnode->next;
}
return twodarr;
}
// This function gets the head and replaces head in the list with the next node
char** strarrllist_pop (struct strarrllist* list)
{
struct strarrllist_node* currhead = list->head;
if (currhead->next == NULL)
{
list->tail = NULL;
}
list->head = currhead->next;
return currhead->arr;
}