3 Copyright (c) 2008, by Attractive Chaos <attractor@live.co.uk>
5 Permission is hereby granted, free of charge, to any person obtaining
6 a copy of this software and associated documentation files (the
7 "Software"), to deal in the Software without restriction, including
8 without limitation the rights to use, copy, modify, merge, publish,
9 distribute, sublicense, and/or sell copies of the Software, and to
10 permit persons to whom the Software is furnished to do so, subject to
11 the following conditions:
13 The above copyright notice and this permission notice shall be
14 included in all copies or substantial portions of the Software.
16 THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
17 EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
18 MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
19 NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
20 BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
21 ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
22 CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
33 kv_push_safe(int, array, 10, e0); // append
34 kv_a(int, array, 20) = 5; // dynamic
35 kv_A(array, 20) = 4; // static
46 * The initial version.
55 #define kv_roundup32(x) (--(x), (x)|=(x)>>1, (x)|=(x)>>2, (x)|=(x)>>4, (x)|=(x)>>8, (x)|=(x)>>16, ++(x))
57 #define kvec_t(type) struct { size_t n, m; type *a; }
58 #define kv_init(v) ((v).n = (v).m = 0, (v).a = 0)
59 #define kv_destroy(v) free((v).a)
60 #define kv_A(v, i) ((v).a[(i)])
61 #define kv_pop(v) ((v).a[--(v).n])
62 #define kv_size(v) ((v).n)
63 #define kv_max(v) ((v).m)
65 #define kv_resize_safe(type, v, s, el) do { \
66 type *_tp = (type*)realloc((v).a, sizeof(type) * (s)); \
75 #define kv_grow_factor 1.5
76 #define kv_grow_safe(type, v, el) do { \
77 size_t _ts = ((v).m > 1 ? (v).m * kv_grow_factor : 2); \
78 type *_tp = (type*)realloc((v).a, sizeof(type) * _ts); \
87 #define kv_copy_safe(type, v1, v0, el) do { \
88 if ((v1).m < (v0).n) kv_resize_safe(type, v1, (v0).n, el); \
90 memcpy((v1).a, (v0).a, sizeof(type) * (v0).n); \
93 #define kv_push_safe(type, v, x, el) do { \
94 if ((v).n == (v).m) { \
95 kv_grow_safe(type, v, el); \
97 (v).a[(v).n++] = (x); \
100 #define kv_prepend_safe(type, v, x, el) do { \
101 if ((v).n == (v).m) { \
102 kv_grow_safe(type, v, el); \
104 memmove((v).a + 1, (v).a, sizeof(type) * (v).n); \
109 #define kv_concat_safe(type, v1, v0, el) do { \
110 if ((v1).m < (v0).n + (v1).n) \
111 kv_resize_safe(type, v1, (v0).n + (v1).n, el); \
112 memcpy((v1).a + (v1).n, (v0).a, sizeof(type) * (v0).n); \
113 (v1).n = (v0).n + (v1).n; \
116 #define kv_del(type, v, i) do { \
118 memmove((v).a + (i), (v).a + ((i) + 1), sizeof(type) * ((v).n - (i) - 1)); \
124 * Old (ENOMEM-unsafe) version of kv_xxx macros. Compat-only, not for use in
125 * the new library code.
128 #define kv_resize(type, v, s) ((v).m = (s), (v).a = (type*)realloc((v).a, sizeof(type) * (v).m))
130 #define kv_grow(type, v) ((v).m = ((v).m > 1 ? (v).m * kv_grow_factor : 2), \
131 (v).a = (type*)realloc((v).a, sizeof(type) * (v).m))
133 #define kv_copy(type, v1, v0) do { \
134 if ((v1).m < (v0).n) kv_resize(type, v1, (v0).n); \
136 memcpy((v1).a, (v0).a, sizeof(type) * (v0).n); \
139 #define kv_push(type, v, x) do { \
140 if ((v).n == (v).m) { \
143 (v).a[(v).n++] = (x); \
146 #define kv_prepend(type, v, x) do { \
147 if ((v).n == (v).m) { \
150 memmove((v).a + 1, (v).a, sizeof(type) * (v).n); \
155 #define kv_concat(type, v1, v0) do { \
156 if ((v1).m < (v0).n + (v1).n) kv_resize(type, v1, (v0).n + (v1).n); \
157 memcpy((v1).a + (v1).n, (v0).a, sizeof(type) * (v0).n); \
158 (v1).n = (v0).n + (v1).n; \
161 #endif /* AC_KVEC_H */