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
|
// Example of intrusive/shared list-nodes by using the node API.
#include <stdio.h>
#define i_type Inner
#define i_val int
#define i_extern // implement Inner_sort()
#include <stc/clist.h>
#define i_type Outer
#define i_val Inner_node
#define i_opt c_no_cmp // no elem. comparison
#include <stc/clist.h>
void printLists(Inner inner, Outer outer) {
printf(" inner:");
c_foreach (i, Inner, inner)
printf(" %d", *i.ref);
printf("\n outer:");
c_foreach (i, Outer, outer)
printf(" %d", i.ref->value);
puts("");
}
int main()
{
c_auto (Outer, outer)
{
Inner inner = Inner_init(); // do not destroy, outer will destroy the shared nodes.
c_forlist (i, int, {6, 9, 3, 1, 7, 4, 5, 2, 8}) {
Inner_node* node = Outer_push_back(&outer, (Inner_node){0});
node->value = *i.ref;
}
c_foreach (i, Outer, outer)
Inner_push_back_node(&inner, i.ref);
printLists(inner, outer);
puts("Sort inner");
Inner_sort(&inner);
printLists(inner, outer);
puts("Remove odd numbers from inner list");
c_foreach (i, Inner, inner)
if (*i.ref & 1)
Inner_unlink_after_node(&inner, i.prev);
printLists(inner, outer);
}
}
|
