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
|
#ifndef VEC_TYPE
#error "Need vector type"
#endif
#ifndef VEC_NAME
#error "Need vector name"
#endif
#include <stddef.h>
#include <stdlib.h>
#include <string.h>
#include <assert.h>
#define UNDERSCORE2(a, b) a##_##b
#define UNDERSCORE(a, b) UNDERSCORE2(a, b)
#define VEC(n) UNDERSCORE(VEC_NAME, n)
#define VEC_STRUCT VEC_NAME
struct VEC_STRUCT {
size_t n;
size_t s;
VEC_TYPE *buf;
};
#ifndef VEC_H
#define VEC_H
#define foreach_vec(iter, v) \
for (size_t iter = 0; iter < (v).n; ++iter)
#define vec_uninit(v) \
(v.buf == NULL)
#endif
static inline struct VEC_STRUCT VEC(create)()
{
const size_t s = 8;
return (struct VEC_STRUCT) {
.n = 0,
.s = s,
.buf = malloc(s * sizeof(VEC_TYPE)),
};
}
static inline size_t VEC(len)(struct VEC_STRUCT *v)
{
return v->n;
}
static inline VEC_TYPE *VEC(at)(struct VEC_STRUCT *v, size_t i)
{
assert(i < v->n && "out of vector bounds");
return &v->buf[i];
}
static inline VEC_TYPE *VEC(back)(struct VEC_STRUCT *v)
{
assert(v->n);
return &v->buf[v->n - 1];
}
static inline VEC_TYPE *VEC(pop)(struct VEC_STRUCT *v)
{
assert(v->n && "attempting to pop empty vector");
v->n--;
return &v->buf[v->n];
}
static inline void VEC(append)(struct VEC_STRUCT *v, VEC_TYPE n)
{
v->n++;
if (v->n >= v->s) {
v->s *= 2;
v->buf = realloc(v->buf, v->s * sizeof(VEC_TYPE));
}
v->buf[v->n - 1] = n;
}
static inline void VEC(reset)(struct VEC_STRUCT *v)
{
v->n = 0;
}
static inline void VEC(destroy)(struct VEC_STRUCT *v) {
free(v->buf);
}
typedef int (*vec_comp_t)(void *a, void *b);
static inline void VEC(sort)(struct VEC_STRUCT *v, vec_comp_t comp)
{
qsort(v->buf, v->n, sizeof(VEC_TYPE), (__compar_fn_t)comp);
}
static inline void VEC(reserve)(struct VEC_STRUCT *v, size_t n)
{
if (v->n >= n)
return;
v->n = n;
while (v->s < v->n)
v->s *= 2;
v->buf = realloc(v->buf, v->s * sizeof(VEC_TYPE));
}
static inline void VEC(shrink)(struct VEC_STRUCT *v, size_t n)
{
/* assert(v->n >= n); */
v->n = n;
}
#undef VEC_TYPE
#undef VEC_NAME
|
