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
|
/*
This file is part of GNUnet.
Copyright (C) 2017 GNUnet e.V.
GNUnet is free software: you can redistribute it and/or modify it
under the terms of the GNU Affero General Public License as published
by the Free Software Foundation, either version 3 of the License,
or (at your option) any later version.
GNUnet 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
Affero General Public License for more details.
You should have received a copy of the GNU Affero General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
SPDX-License-Identifier: AGPL3.0-or-later
*/
/**
* @author Christian Grothoff
* @file util/test_container_dll.c
* @brief Test of DLL operations
*/
#include "platform.h"
#include "gnunet_util_lib.h"
/**
* Element in the DLL.
*/
struct Element {
/**
* Required pointer to previous element.
*/
struct Element *prev;
/**
* Required pointer to next element.
*/
struct Element *next;
/**
* Used to sort.
*/
unsigned int value;
};
/**
* Compare two elements.
*
* @param cls closure, NULL
* @param e1 an element of to sort
* @param e2 another element to sort
* @return #GNUNET_YES if @e1 < @e2, otherwise #GNUNET_NO
*/
static int
cmp_elem(void *cls,
struct Element *e1,
struct Element *e2)
{
if (e1->value == e2->value)
return 0;
return (e1->value < e2->value) ? 1 : -1;
}
int
main(int argc, char **argv)
{
unsigned int values[] = {
4, 5, 8, 6, 9, 3, 7, 2, 1, 0
};
struct Element *head = NULL;
struct Element *tail = NULL;
struct Element *e;
unsigned int want;
GNUNET_log_setup("test-container-dll",
"WARNING",
NULL);
for (unsigned int off = 0;
0 != values[off];
off++)
{
e = GNUNET_new(struct Element);
e->value = values[off];
GNUNET_CONTAINER_DLL_insert_sorted(struct Element,
cmp_elem,
NULL,
head,
tail,
e);
}
want = 1;
while (NULL != (e = head))
{
GNUNET_assert(e->value == want);
GNUNET_CONTAINER_DLL_remove(head,
tail,
e);
GNUNET_free(e);
want++;
}
return 0;
}
/* end of test_container_heap.c */
|
