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
|
#ifndef ARRAY_H_
#define ARRAY_H_
#include <stdlib.h>
#include <stdbool.h>
typedef struct {
size_t size;
size_t capacity;
char array[];
} array_info;
array_info* array_new_(size_t item_size, size_t size);
void array_resize(void* array, size_t size);
void array_print(void* array);
void array_pop(void* array);
void* array_add_(void* array, size_t item_size);
#define CONCAT_INNER(a, b) a ## b
#define CONCAT(a, b) CONCAT_INNER(a, b)
#define array_clear(array) (((array_info*)(array))[-1].size = 0)
#define array_size(array) (((array_info*)(array))[-1].size)
#define array_new(type, size) ((type*)(array_new_(sizeof(type), size)->array))
#define array_free(array) do { \
free(((array_info*)(array)) - 1); \
(array) = NULL; \
} while (0)
#define array_erase(array, index) do { \
if ((index)) {\
for (int __i = (index) - 1; __i < array_size((array)) - 1; __i++) \
(array)[__i] = (array)[__i + 1]; \
((array_info*)(array))[-1].size--; \
} \
} while(0)
#define array_insert(array, index, value) do { \
void* __temp = array_add_((array), sizeof(*(array))); \
(array) = __temp; \
for (int __i = array_size((array)) - 1; __i > (index); __i--) \
(array)[__i] = (array)[__i - 1]; \
(array)[(index)] = value; \
} while(0) \
#define array_add(array, value) do { \
void* __temp = array_add_((array), sizeof(*(array))); \
(array) = __temp; \
(array)[array_size((array)) - 1] = value; \
} while (0)
#define array_last(array) (array)[array_size(array) - 1]
#define array_for_all(type__, name__, array__) \
type__* CONCAT(it__, __LINE__) = array__; type__* CONCAT(end__, __LINE__) = array__ ? array__ + array_size(array__) : NULL; \
for (type__* name__; (CONCAT(it__, __LINE__) < CONCAT(end__, __LINE__)) ? (name__ = CONCAT(it__, __LINE__), true) : false; CONCAT(it__, __LINE__)++)
#endif // ARRAY_H_
|
