123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103 |
- /* The MIT License
-
- Copyright (c) 2008, by Attractive Chaos <attractor@live.co.uk>
-
- Permission is hereby granted, free of charge, to any person obtaining
- a copy of this software and associated documentation files (the
- "Software"), to deal in the Software without restriction, including
- without limitation the rights to use, copy, modify, merge, publish,
- distribute, sublicense, and/or sell copies of the Software, and to
- permit persons to whom the Software is furnished to do so, subject to
- the following conditions:
-
- The above copyright notice and this permission notice shall be
- included in all copies or substantial portions of the Software.
-
- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
- EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
- MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
- NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
- BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
- ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
- CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- SOFTWARE.
- */
-
- /*
- An example:
-
- #include "kvec.h"
- int main() {
- kvec_t(int) array;
- kv_init(array);
- kv_push(int, array, 10); // append
- kv_a(int, array, 20) = 5; // dynamic
- kv_A(array, 20) = 4; // static
- kv_destroy(array);
- return 0;
- }
- */
-
- /*
- 2008-09-22 (0.1.0):
-
- * The initial version.
-
- */
-
- #ifndef AC_KVEC_H
- #define AC_KVEC_H
-
- #include <stdlib.h>
-
- #define kv_roundup32(x) (--(x), (x)|=(x)>>1, (x)|=(x)>>2, (x)|=(x)>>4, (x)|=(x)>>8, (x)|=(x)>>16, ++(x))
-
- #define kvec_t(type) struct { size_t n, m; type *a; }
- #define kv_init(v) ((v).n = (v).m = 0, (v).a = 0)
- #define kv_destroy(v) free((v).a)
- #define kv_A(v, i) ((v).a[(i)])
- #define kv_pop(v) ((v).a[--(v).n])
- #define kv_size(v) ((v).n)
- #define kv_max(v) ((v).m)
-
- #define kv_resize(type, v, s) ((v).m = (s), (v).a = (type*)realloc((v).a, sizeof(type) * (v).m))
- #define kv_grow_factor 1.5
- #define kv_grow(type, v) ((v).m = ((v).m > 1 ? (v).m * kv_grow_factor : 2), \
- (v).a = (type*)realloc((v).a, sizeof(type) * (v).m))
-
- #define kv_copy(type, v1, v0) do { \
- if ((v1).m < (v0).n) kv_resize(type, v1, (v0).n); \
- (v1).n = (v0).n; \
- memcpy((v1).a, (v0).a, sizeof(type) * (v0).n); \
- } while (0) \
-
- #define kv_push(type, v, x) do { \
- if ((v).n == (v).m) { \
- kv_grow(type, v); \
- } \
- (v).a[(v).n++] = (x); \
- } while (0)
-
- #define kv_prepend(type, v, x) do { \
- if ((v).n == (v).m) { \
- kv_grow(type, v); \
- } \
- memmove((v).a + 1, (v).a, sizeof(type) * (v).n); \
- (v).a[0] = (x); \
- (v).n ++; \
- } while (0)
-
- #define kv_concat(type, v1, v0) do { \
- if ((v1).m < (v0).n + (v1).n) kv_resize(type, v1, (v0).n + (v1).n); \
- memcpy((v1).a + (v1).n, (v0).a, sizeof(type) * ((v0).n + (v1).n)); \
- (v1).n = (v0).n + (v1).n; \
- } while (0)
-
- #define kv_del(type, v, i) do { \
- if ((i) < (v).n) { \
- memmove((v).a + (i), (v).a + ((i) + 1), sizeof(type) * ((v).n - (i) - 1)); \
- (v).n --; \
- } \
- } while (0)
-
- #endif
|