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
|
#include "list.h"
struct list *list_create(void)
{
struct list *list = malloc(sizeof(struct list));
list->len = 0;
list->cap = 64;
list->items = malloc(sizeof(void*) * list->cap);
return list;
}
void list_free(struct list *list)
{
free(list->items);
}
void list_deep_free(struct list *list)
{
for(size_t i = 0; i < list->len; ++i) {
free(list->items[i]);
}
list_free(list);
}
void list_append(struct list *list, void *item)
{
list_grow(list, list->len + 1);
list->items[list->len++] = item;
}
void list_grow(struct list *list, size_t min_size)
{
if(list->cap >= min_size) {
return;
}
while(list->cap < min_size) {
list->cap *= 2;
}
list->items = realloc(list->items, sizeof(void*) * list->cap);
}
void list_remove(struct list *list, size_t index)
{
if(index >= list->len) {
return;
}
memmove(&list->items[index], &list->items[index + 1], list->len - index);
list->len -= 1;
}
void list_insert(struct list *list, size_t index, void *item)
{
list_grow(list, list->len + 1);
if(index > list->len) {
index = list->len;
}
memmove(&list->items[index + 1], &list->items[index], list->len - index);
list->items[index] = item;
list->len += 1;
}
struct list *list_from_string(const char *string, char delim)
{
struct list *list = list_create();
const char *base = string;
while(*base) {
while(*base && *base == delim) {
++base;
}
const char *end = base;
while(*end && *end != delim) {
++end;
}
if(*base && base != end) {
char *item = strndup(base, end - base);
list_append(list, item);
base = end;
}
}
return list;
}
int list_find(struct list *list, int (*cmp)(const void *, const void *), const void *key)
{
for(size_t i = 0; i < list->len; ++i) {
if(!cmp(list->items[i], key)) {
return (int)i;
}
}
return -1;
}
/* vim:set ts=2 sts=2 sw=2 et: */
|
