blob: c4c66df117b2430cb981d92948090862dc923647 (
plain)
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
|
/*
* Copyright (C) 2022-2023 Alessandro Iezzi <aiezzi AT alessandroiezzi PERIOD it>
*
* This file is part of libutils.
*
* libutils is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* libutils 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 Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with libutils. If not, see <https://www.gnu.org/licenses/>.
*/
#include <stdlib.h>
#include <string.h> /* memcpy */
#include "list.h"
list_t clist_create()
{
list_t list;
list.first = NULL;
list.last = NULL;
list.size = 0;
return list;
}
void clist_add(list_t *list,
void *data,
int size_of)
{
struct list_item_t *item = malloc(sizeof(struct list_item_t));
void *dest = malloc(size_of); /* allocates memory like data parameter */
memcpy(dest, data, size_of); /* copies data inside dest */
item->data = dest;
item->next = NULL;
if (list->first == NULL)
list->first = item;
if (list->last != NULL)
list->last->next = item;
list->last = item;
list->size ++;
}
void clist_add_all(list_t *dest,
list_t *other)
{
dest->last->next = other->first;
dest->size += other->size;
}
void clist_remove(list_t *list,
list_item_t *item)
{
list_item_t *curr = list->first->next;
list_item_t *prev = list->first;
if (list->first == item) {
free(list->first);
list->first = curr;
} else {
while (curr != NULL) {
if (curr == item) {
prev->next = curr->next;
free(curr);
return;
}
prev = curr;
curr = curr->next;
}
}
}
iterator_t clist_iterator(list_t *list)
{
struct iterator_t *iterator = malloc(sizeof(struct iterator_t));
iterator->current = list->first;
return *iterator;
}
int clist_iterator_has_next(iterator_t *iterator)
{
return iterator->current != NULL;
}
list_item_t *clist_iterator_next(iterator_t *iterator)
{
struct list_item_t *current = iterator->current;
iterator->current = iterator->current->next;
return current;
}
char *
clist_version(void)
{
return VERSION;
}
|
