8 /* "Base" vector type, designed to alias with the actual vector types. */
9 typedef struct vector__s
{
14 #define TYPEDEF_VECTOR(T, N) typedef struct { \
20 typedef const _##N* const_##N;
22 #define VECTOR(T) struct { \
28 #define VECTOR_INIT(_x) do { (_x) = NULL; } while(0)
29 #define VECTOR_INIT_STATIC() NULL
30 #define VECTOR_DEINIT(_x) do { free((_x)); (_x) = NULL; } while(0)
32 /* Helper to increase a vector's reserve. Do not call directly. */
33 ALboolean
vector_reserve(void *ptr
, size_t base_size
, size_t obj_count
, size_t obj_size
, ALboolean exact
);
34 #define VECTOR_RESERVE(_x, _c) (vector_reserve(&(_x), sizeof(*(_x)), (_c), sizeof((_x)->Data[0]), AL_TRUE))
36 /* Helper to change a vector's size. Do not call directly. */
37 ALboolean
vector_resize(void *ptr
, size_t base_size
, size_t obj_count
, size_t obj_size
);
38 #define VECTOR_RESIZE(_x, _c) (vector_resize(&(_x), sizeof(*(_x)), (_c), sizeof((_x)->Data[0])))
40 #define VECTOR_CAPACITY(_x) ((_x) ? (_x)->Capacity : 0)
41 #define VECTOR_SIZE(_x) ((_x) ? (_x)->Size : 0)
43 #define VECTOR_ITER_BEGIN(_x) ((_x)->Data + 0)
44 #define VECTOR_ITER_END(_x) ((_x)->Data + VECTOR_SIZE(_x))
46 ALboolean
vector_insert(void *ptr
, size_t base_size
, size_t obj_size
, void *ins_pos
, const void *datstart
, const void *datend
);
48 #define TYPE_CHECK(T1, T2) __builtin_types_compatible_p(T1, T2)
49 #define VECTOR_INSERT(_x, _i, _s, _e) __extension__({ \
51 static_assert(TYPE_CHECK(__typeof((_x)->Data[0]), __typeof(*(_i))), "Incompatible insertion iterator"); \
52 static_assert(TYPE_CHECK(__typeof((_x)->Data[0]), __typeof(*(_s))), "Incompatible insertion source type"); \
53 static_assert(TYPE_CHECK(__typeof(*(_s)), __typeof(*(_e))), "Incompatible iterator sources"); \
54 _r = vector_insert(&(_x), sizeof(*(_x)), sizeof((_x)->Data[0]), (_i), (_s), (_e)); \
58 #define VECTOR_INSERT(_x, _i, _s, _e) (vector_insert(&(_x), sizeof(*(_x)), sizeof((_x)->Data[0]), (_i), (_s), (_e)))
61 #define VECTOR_PUSH_BACK(_x, _obj) (vector_reserve(&(_x), sizeof(*(_x)), VECTOR_SIZE(_x)+1, sizeof((_x)->Data[0]), AL_FALSE) && \
62 (((_x)->Data[(_x)->Size++] = (_obj)),AL_TRUE))
63 #define VECTOR_POP_BACK(_x) ((void)((_x)->Size--))
65 #define VECTOR_BACK(_x) ((_x)->Data[(_x)->Size-1])
66 #define VECTOR_FRONT(_x) ((_x)->Data[0])
68 #define VECTOR_ELEM(_x, _o) ((_x)->Data[(_o)])
70 #define VECTOR_FOR_EACH(_t, _x, _f) do { \
71 _t *_iter = VECTOR_ITER_BEGIN((_x)); \
72 _t *_end = VECTOR_ITER_END((_x)); \
73 for(;_iter != _end;++_iter) \
77 #define VECTOR_FIND_IF(_i, _t, _x, _f) do { \
78 _t *_iter = VECTOR_ITER_BEGIN((_x)); \
79 _t *_end = VECTOR_ITER_END((_x)); \
80 for(;_iter != _end;++_iter) \
88 #endif /* AL_VECTOR_H */