liba 0.1.15

An algorithm library based on C/C++
Documentation 
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
112
113
114
115
116

#define MAIN(x) slist##x
#include "test.h"
#include "a/slist.h"

static a_size a_slist_len(a_slist const *ctx)
{
    a_size count = 0;
    a_slist_foreach(it, ctx) { ++count; }
    return count;
}

static void test(void)
{
    typedef struct
    {
        a_slist_node node;
        a_cast data;
    } data;
    a_slist *list1 = a_new(a_slist, A_NULL, 1);
    a_slist_ctor(list1);
    for (int i = 0; i != 10; ++i)
    {
        data *node = a_new(data, A_NULL, 1);
        node->data.i = i;
        a_slist_add_tail(list1, &node->node);
    }
    a_slist *list2 = a_new(a_slist, A_NULL, 1);
    a_slist_ctor(list2);
    for (int i = 14; i != 9; --i)
    {
        data *node = a_new(data, A_NULL, 1);
        node->data.i = i;
        a_slist_add_head(list2, &node->node);
    }
    a_slist *list3 = a_new(a_slist, A_NULL, 1);
    a_slist_ctor(list3);
    for (int i = 15; i != 20; ++i)
    {
        data *node = a_new(data, A_NULL, 1);
        node->data.i = i;
        a_slist_add(list3, list3->tail, &node->node);
    }
    a_slist_rot(list1);
    a_slist_mov(list2, list3, &list3->head);
    a_slist_dtor(list2);
    a_slist_mov(list3, list1, list1->tail);
    a_slist_dtor(list3);
    a_slist_foreach(it, list1)
    {
        data *node = a_slist_entry(it, data, node); // NOLINT(performance-no-int-to-ptr)
        printf("%i ", node->data.i);
    }
    printf("%" PRIz "u", a_slist_len(list1));
    for (int i = 0; i != 10; ++i)
    {
        data *node = a_slist_entry_next(&list1->head, data, node); // NOLINT(performance-no-int-to-ptr)
        a_slist_del_head(list1);
        a_die(node);
    }
    a_slist_forsafe(it, at, list1)
    {
        data *node = a_slist_entry(it, data, node); // NOLINT(performance-no-int-to-ptr)
        a_slist_del(list1, at);
        a_die(node);
        it = A_NULL;
    }
    if (list1->head.next == &list1->head &&
        list2->head.next == &list2->head &&
        list3->head.next == &list3->head)
    {
        printf(" ok");
    }
    putchar('\n');
    a_die(list3);
    a_die(list2);
    a_die(list1);
}

static void null(void)
{
    static a_slist_node node1 = A_SLIST_NODE;
    static a_slist_node node2 = A_SLIST_NODE;
    static a_slist list1 = A_SLIST_INIT(list1);
    static a_slist list2 = A_SLIST_INIT(list2);

    a_slist_rot(&list1);
    a_slist_rot(&list1);
    a_slist_mov(&list2, &list1, &list1.head);
    a_slist_mov(&list2, &list1, list1.tail);
    a_slist_del(&list1, &list1.head);
    a_slist_del(&list1, list1.tail);
    a_slist_del_head(&list2);
    a_slist_del_head(&list2);

    a_slist_init(&list1);
    a_slist_init(&list2);
    a_slist_add(&list1, &list1.head, &node1);
    a_slist_add(&list1, &list1.head, &node1);
    a_slist_del(&list1, &node1);
    a_slist_add(&list1, list1.tail, &node1);
    a_slist_add(&list1, &node1, &node1);
    a_slist_add_head(&list1, &node1);
    a_slist_add_tail(&list2, &node2);
    a_slist_mov(&list2, &list1, &list1.head);
    a_slist_mov(&list2, &list1, list1.tail);
}

int main(int argc, char *argv[]) // NOLINT(misc-definitions-in-headers)
{
    (void)argc;
    (void)argv;
    printf("%s\n", A_FUNC);
    test();
    null();
    return 0;
}