nappgui-sys 0.2.0

Rust raw bindings to NAppGUI
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
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163

/*
 * NAppGUI Cross-platform C SDK
 * 2015-2025 Francisco Garcia Collado
 * MIT Licence
 * https://nappgui.com/en/legal/license.html
 *
 * File: arrst.h
 * https://nappgui.com/en/core/arrst.html
 *
 */

/* Arrays */

#define arrst_create(type) \

    arrst_##type##_create((uint16_t)sizeof(type))

#define arrst_copy(array, func_copy, type) \

    arrst_##type##_copy(array, func_copy)

#define arrst_read(stream, func_read, type) \

    arrst_##type##_read(stream, (uint16_t)sizeof(type), func_read)

#define arrst_destroy(array, func_remove, type) \

    arrst_##type##_destroy(array, func_remove)

#define arrst_destopt(array, func_remove, type) \

    arrst_##type##_destopt(array, func_remove)

#define arrst_clear(array, func_remove, type) \

    arrst_##type##_clear(array, func_remove)

#define arrst_write(stream, array, func_write, type) \

    arrst_##type##_write(stream, array, func_write)

#define arrst_size(array, type) \

    arrst_##type##_size(array)

#define arrst_get(array, pos, type) \

    arrst_##type##_get(array, pos)

#define arrst_get_const(array, pos, type) \

    arrst_##type##_get_const(array, pos)

#define arrst_first(array, type) \

    arrst_##type##_get(array, 0)

#define arrst_first_const(array, type) \

    arrst_##type##_get_const(array, 0)

#define arrst_last(array, type) \

    arrst_##type##_last(array)

#define arrst_last_const(array, type) \

    arrst_##type##_last_const(array)

#define arrst_all(array, type) \

    arrst_##type##_all(array)

#define arrst_all_const(array, type) \

    arrst_##type##_all_const(array)

#define arrst_new(array, type) \

    arrst_##type##_insert(array, UINT32_MAX, 1)

#define arrst_new0(array, type) \

    arrst_##type##_insert0(array, UINT32_MAX, 1)

#define arrst_new_n(array, n, type) \

    arrst_##type##_insert(array, UINT32_MAX, n)

#define arrst_new_n0(array, n, type) \

    arrst_##type##_insert0(array, UINT32_MAX, n)

#define arrst_prepend_n(array, n, type) \

    arrst_##type##_insert(array, 0, n)

#define arrst_insert_n(array, pos, n, type) \

    arrst_##type##_insert(array, pos, n)

#define arrst_insert_n0(array, pos, n, type) \

    arrst_##type##_insert0(array, pos, n)

#define arrst_append(array, value, type) \

    (*arrst_##type##_insert(array, UINT32_MAX, 1)) = (value)

#define arrst_prepend(array, value, type) \

    (*arrst_##type##_insert(array, 0, 1)) = (value)

#define arrst_insert(array, pos, value, type) \

    (*arrst_##type##_insert(array, pos, 1)) = (value)

#define arrst_join(dest, src, func_copy, type) \

    arrst_##type##_join(dest, src, func_copy)

#define arrst_delete(array, pos, func_remove, type) \

    arrst_##type##_delete(array, pos, func_remove)

#define arrst_pop(array, func_remove, type) \

    arrst_##type##_pop(array, func_remove)

#define arrst_sort(array, func_compare, type) \

    arrst_##type##_sort(array, func_compare)

#define arrst_sort_ex(array, func_compare, data, type, dtype) \

    ((void)((data) == cast(data, dtype)), \
     FUNC_CHECK_COMPARE_EX(func_compare, type, dtype), \
     arrst_##type##_sort_ex(array, (FPtr_compare_ex)func_compare, cast(data, void)))

#define arrst_search(array, func_compare, key, pos, type, ktype) \

    ((void)((key) == cast_const(key, ktype)), \
     FUNC_CHECK_COMPARE_KEY(func_compare, type, ktype), \
     arrst_##type##_search(array, (FPtr_compare)func_compare, cast_const(key, void), pos))

#define arrst_search_const(array, func_compare, key, pos, type, ktype) \

    ((void)((key) == cast_const(key, ktype)), \
     FUNC_CHECK_COMPARE_KEY(func_compare, type, ktype), \
     arrst_##type##_search_const(array, (FPtr_compare)func_compare, cast_const(key, void), pos))

#define arrst_bsearch(array, func_compare, key, pos, type, ktype) \

    ((void)((key) == cast_const(key, ktype)), \
     FUNC_CHECK_COMPARE_KEY(func_compare, type, ktype), \
     arrst_##type##_bsearch(array, (FPtr_compare)func_compare, cast_const(key, void), pos))

#define arrst_bsearch_const(array, func_compare, key, pos, type, ktype) \

    ((void)((key) == cast_const(key, ktype)), \
     FUNC_CHECK_COMPARE_KEY(func_compare, type, ktype), \
     arrst_##type##_bsearch_const(array, (FPtr_compare)func_compare, cast_const(key, void), pos))

#define arrst_foreach(elem, array, type) \

    { \
        type *elem = arrst_all(array, type); \
        uint32_t elem##_i, elem##_total = arrst_size(array, type); \
        for (elem##_i = 0; elem##_i < elem##_total; ++elem##_i, ++elem) \
        {

#define arrst_foreach_const(elem, array, type) \

    { \
        const type *elem = arrst_all_const(array, type); \
        uint32_t elem##_i, elem##_total = arrst_size(array, type); \
        for (elem##_i = 0; elem##_i < elem##_total; ++elem##_i, ++elem) \
        {

#define arrst_forback(elem, array, type) \

    { \
        type *elem = arrst_all(array, type); \
        uint32_t __i, elem##_i, elem##_total = arrst_size(array, type); \
        elem += elem##_total - 1; \
        elem##_i = elem##_total - 1; \
        for (__i = 0; __i < elem##_total; ++__i, --elem##_i, --elem) \
        {

#define arrst_forback_const(elem, array, type) \

    { \
        const type *elem = arrst_all_const(array, type); \
        uint32_t __i, elem##_i, elem##_total = arrst_size(array, type); \
        elem += elem##_total - 1; \
        elem##_i = elem##_total - 1; \
        for (__i = 0; __i < elem##_total; ++__i, --elem##_i, --elem) \
        {

#define arrst_end() \

    } \
    }