blob: 3204237c0d3bd82e89a251de93c872864ab002e6 (
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
|
/*
* This file is part of libdom test suite.
* Licensed under the MIT License,
* http://www.opensource.org/licenses/mit-license.php
* Copyright 2007 James Shaw <jshaw@netsurf-browser.org>
*/
#include <malloc.h>
#include <stdio.h>
#include <stdbool.h>
#include "list.h"
struct list* list_new(void) {
struct list* list = malloc(sizeof(struct list));
list->size = 0;
list->head = NULL;
list->tail = NULL;
return list;
}
void list_destroy(struct list* list) {
struct list_elt* elt = list->head;
while (elt != NULL) {
struct list_elt* nextElt = elt->next;
free(elt);
elt = nextElt;
}
free(list);
}
void list_add(struct list* list, void* data) {
struct list_elt* elt = malloc(sizeof(struct list_elt));
elt->data = data;
elt->next = NULL;
struct list_elt* tail = list->tail;
/* if tail was set, make its 'next' ptr point to elt */
if (tail != NULL) {
tail->next = elt;
}
/* make elt the new tail */
list->tail = elt;
if (list->head == NULL) {
list->head = elt;
}
/* inc the size of the list */
list->size++;
}
bool list_contains(struct list* list, void* data, int (*comparator)(const void* a, const void* b)) {
struct list_elt* elt = list->head;
while (elt != NULL) {
if (comparator(elt->data, data) == 0) {
return true;
}
elt = elt->next;
}
return false;
}
bool list_contains_all(struct list* superList, struct list* subList, int (*comparator)(const void* a, const void* b)) {
struct list_elt* elt = subList->head;
while (elt != NULL) {
if (!list_contains(superList, elt->data, comparator)) {
return false;
}
elt = elt->next;
}
return true;
}
|
