-
Notifications
You must be signed in to change notification settings - Fork 0
/
llist.c
119 lines (100 loc) · 1.95 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
/*
* llist.c
* Copyright (C) 2017 Marc Volker Dickmann
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include <stdlib.h>
#include "llist.h"
LList *
llist_last (LList *list)
{
LList *last = list;
while (last->next)
{
last = last->next;
}
return last;
}
LList *
llist_append (LList *list,
void *data)
{
LList *new = malloc (sizeof (LList));
new->data = data;
new->next = NULL;
if (list)
{
llist_last (list)->next = new;
return list;
}
return new;
}
LList *
llist_prepend (LList *list,
void *data)
{
LList *new = malloc (sizeof (LList));
new->data = data;
new->next = list;
return new;
}
void
llist_free (LList *list)
{
LList *next;
while (list)
{
next = list->next;
free (list);
list = next;
}
}
void
llist_free_full (LList *list,
void free_func (void *data))
{
LList *next;
while (list)
{
next = list->next;
free_func (list->data);
free (list);
list = next;
}
}
void *
llist_find_custom (LList *list,
int func (const void *data, const void *udata),
const void *udata)
{
while (list)
{
if (func (list->data, udata) == 1)
return list->data;
list = list->next;
}
return NULL;
}
size_t
llist_length (LList *list)
{
size_t len = 0;
while (list)
{
len++;
list = list->next;
}
return len;
}