| 1 |
/* The MIT License |
| 2 |
|
| 3 |
Copyright (c) 2008, by Attractive Chaos <[email protected]> |
| 4 |
|
| 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: |
| 12 |
|
| 13 |
The above copyright notice and this permission notice shall be |
| 14 |
included in all copies or substantial portions of the Software. |
| 15 |
|
| 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 |
| 23 |
SOFTWARE. |
| 24 |
*/ |
| 25 |
|
| 26 |
/* |
| 27 |
An example: |
| 28 |
|
| 29 |
#include "kvec.h" |
| 30 |
int main() { |
| 31 |
kvec_t(int) array; |
| 32 |
kv_init(array); |
| 33 |
kv_push(int, array, 10); // append |
| 34 |
kv_a(int, array, 20) = 5; // dynamic |
| 35 |
kv_A(array, 20) = 4; // static |
| 36 |
kv_destroy(array); |
| 37 |
return 0; |
| 38 |
} |
| 39 |
*/ |
| 40 |
|
| 41 |
/* |
| 42 |
2008-09-22 (0.1.0): |
| 43 |
|
| 44 |
* The initial version. |
| 45 |
|
| 46 |
*/ |
| 47 |
|
| 48 |
#ifndef AC_KVEC_H |
| 49 |
#define AC_KVEC_H |
| 50 |
|
| 51 |
#include <stdlib.h> |
| 52 |
|
| 53 |
#ifdef USE_MALLOC_WRAPPERS |
| 54 |
# include "malloc_wrap.h" |
| 55 |
#endif |
| 56 |
|
| 57 |
#define kv_roundup32(x) (--(x), (x)|=(x)>>1, (x)|=(x)>>2, (x)|=(x)>>4, (x)|=(x)>>8, (x)|=(x)>>16, ++(x)) |
| 58 |
|
| 59 |
#define kvec_t(type) struct { size_t n, m; type *a; } |
| 60 |
#define kv_init(v) ((v).n = (v).m = 0, (v).a = 0) |
| 61 |
#define kv_destroy(v) free((v).a) |
| 62 |
#define kv_A(v, i) ((v).a[(i)]) |
| 63 |
#define kv_pop(v) ((v).a[--(v).n]) |
| 64 |
#define kv_size(v) ((v).n) |
| 65 |
#define kv_max(v) ((v).m) |
| 66 |
|
| 67 |
#define kv_resize(type, v, s) ((v).m = (s), (v).a = (type*)realloc((v).a, sizeof(type) * (v).m)) |
| 68 |
|
| 69 |
#define kv_copy(type, v1, v0) do { \ |
| 70 |
if ((v1).m < (v0).n) kv_resize(type, v1, (v0).n); \ |
| 71 |
(v1).n = (v0).n; \ |
| 72 |
memcpy((v1).a, (v0).a, sizeof(type) * (v0).n); \ |
| 73 |
} while (0) \ |
| 74 |
|
| 75 |
#define kv_push(type, v, x) do { \ |
| 76 |
if ((v).n == (v).m) { \ |
| 77 |
(v).m = (v).m? (v).m<<1 : 2; \ |
| 78 |
(v).a = (type*)realloc((v).a, sizeof(type) * (v).m); \ |
| 79 |
} \ |
| 80 |
(v).a[(v).n++] = (x); \ |
| 81 |
} while (0) |
| 82 |
|
| 83 |
#define kv_pushp(type, v) ((((v).n == (v).m)? \ |
| 84 |
((v).m = ((v).m? (v).m<<1 : 2), \ |
| 85 |
(v).a = (type*)realloc((v).a, sizeof(type) * (v).m), 0) \ |
| 86 |
: 0), &(v).a[(v).n++]) |
| 87 |
|
| 88 |
#define kv_a(type, v, i) (((v).m <= (size_t)(i)? \ |
| 89 |
((v).m = (v).n = (i) + 1, kv_roundup32((v).m), \ |
| 90 |
(v).a = (type*)realloc((v).a, sizeof(type) * (v).m), 0) \ |
| 91 |
: (v).n <= (size_t)(i)? (v).n = (i) + 1 \ |
| 92 |
: 0), (v).a[(i)]) |
| 93 |
|
| 94 |
#endif |