22 return a ? a->
len : 0;
25#define new_mp_vector(mp, type, data) \
26 new_mp_vector(mp, sizeof(type), data)
28#define free_mp_vector(mp, type, data) \
29 free_mp_vector(mp, sizeof(type), data)
31#define mp_vector_add(mp, a, type, data) { \
32 if (++((*a))->len >= ((*a))->cap) \
33 mp_vector_resize(mp, (a), sizeof(type), (*(a))->cap * 2); \
34 *(type*)((*(a))->ptr + ((*a)->len - 1) * sizeof(type)) = (data); }\
36#define mp_vector_at(a, type, index) \
37 ((type*)((a)->ptr + (index) * sizeof(type)))
39#define mp_vector_set(a, type, index, data) \
40 *(type*)((a)->ptr + (index) * sizeof(type)) = (data)
43 if (idx >= a->
len)
return;
44 if (idx < a->len - 1) {
45 const size_t len = a->
len - idx - 1;
52 m_bit *data = ((a)->ptr + (a->
len--) * size);
56#define mp_vector_pop(a, type) \
57 ((type*)mp_vector_pop(a, sizeof(type)))
59#define mp_vector_rem(a, type, idx) \
60 mp_vector_rem(a, sizeof(type), idx)
62#define mp_vector_rem2(a, type, data) \
63 for(uint32_t i = 0; i < a->len; i++) { \
64 if(data == mp_vector_at(a, type, i)) { \
65 mp_vector_rem(a, type, i); \
70#define mp_vector_back(a, type) \
71 ((type*)((a)->ptr + (a->len-1) * sizeof(type)))
73#define MK_VECTOR_TYPE(Type, type, ...) \
74typedef struct Type##List { \
81ANN static inline Type##List *new_##type##list(const MemPool mp, const uint32_t len) { \
82 return (Type##List*)new_mp_vector(mp, Type, len); \
84ANN static inline void free_##type##list(const MemPool mp, Type##List *v) { \
85 mp_free2(mp, sizeof(Type##List) + (m_uint)(v->cap * sizeof(Type)), v); \
87ANN static inline void type##list_resize(const MemPool mp, Type##List **ap, \
88 const uint32_t cap) { \
89 return mp_vector_resize(mp, (MP_Vector**)ap, sizeof(Type), cap); \
91ANN static inline Type type##list_at(const Type##List *v, const uint32_t index) { \
92 return v->ptr[index]; \
94ANN static inline Type* type##list_ptr_at(Type##List *v, const uint32_t index) { \
95 return v->ptr + index; \
97ANN static inline void type##list_set(Type##List *v, const uint32_t index, \
99 v->ptr[index] = data; \
101ANN static inline void type##list_add(const MemPool mp, Type##List **v, \
103 mp_vector_add(mp, (MP_Vector**)v, Type, data); \
105static inline uint32_t type##list_len(const Type##List *a) { \
106 return a ? a->len : 0; \
108ANN static inline Type type##list_back(const Type##List *a) { \
109 return a->ptr[a->len-1]; \
111ANN static inline void type##list_rem(Type##List *const a, const uint32_t idx) { \
112 if (idx >= a->len) return; \
113 const size_t len = a->len - idx - 1; \
114 memmove(a->ptr + idx, a->ptr + idx + OFFSET + 1, len * sizeof(Type));\
#define mp_vector_rem(a, type, idx)
static uint32_t mp_vector_len(MP_Vector *a)
static ANN void mp_vector_resize(const MemPool mp, MP_Vector **ap, const uint32_t size, const uint32_t cap)
#define new_mp_vector(mp, type, data)
#define mp_vector_pop(a, type)
#define free_mp_vector(mp, type, data)
void * mp_realloc(MemPool mp, void *ptr, const m_uint curr, const m_uint next)
#define mp_free2(p, sz, a)
struct MemPool_ * MemPool