#ifndef PMDK_VEC_H
#define PMDK_VEC_H 1
#define VEC_GROW_SIZE (64)
#define VEC(name, type)\
struct name {\
type *buffer;\
size_t size;\
size_t capacity;\
}
#define VEC_INITIALIZER {NULL, 0, 0}
#define VEC_INIT(vec) do {\
(vec)->buffer = NULL;\
(vec)->size = 0;\
(vec)->capacity = 0;\
} while (0)
#define VEC_RESERVE(vec, ncapacity) do {\
if ((ncapacity) > (vec)->size) {\
void *tbuf = Realloc((vec)->buffer,\
sizeof(*(vec)->buffer) * (ncapacity));\
ASSERTne(tbuf, NULL);\
\
(vec)->buffer = tbuf;\
(vec)->capacity = ncapacity;\
}\
} while (0)
#define VEC_POP_BACK(vec) do {\
(vec)->size -= 1;\
} while (0)
#define VEC_FRONT(vec)\
(vec)->buffer[0]
#define VEC_BACK(vec)\
(vec)->buffer[(vec)->size - 1]
#define VEC_ERASE_BY_POS(vec, pos) do {\
(vec)->buffer[(pos)] = VEC_BACK(vec);\
VEC_POP_BACK(vec);\
} while (0)
#define VEC_ERASE_BY_PTR(vec, element) do {\
ptrdiff_t elpos = (uintptr_t)(element) - (uintptr_t)((vec)->buffer);\
elpos /= sizeof(*element);\
VEC_ERASE_BY_POS(vec, elpos);\
} while (0)
#define VEC_PUSH_BACK(vec, element) do {\
if ((vec)->capacity == (vec)->size)\
VEC_RESERVE((vec), ((vec)->capacity + VEC_GROW_SIZE));\
(vec)->buffer[(vec)->size++] = (element);\
} while (0)
#define VEC_EMPLACE_BACK(vec, ...) do {\
if ((vec)->capacity == (vec)->size)\
VEC_RESERVE((vec), (vec)->capacity + VEC_GROW_SIZE);\
(vec)->buffer[(vec)->size++] = (typeof(*(vec)->buffer)) {__VA_ARGS__};\
} while (0)
#define VEC_FOREACH(el, vec)\
for (size_t _vec_i = 0;\
_vec_i < (vec)->size && ((el = (vec)->buffer[_vec_i]), 1);\
++_vec_i)
#define VEC_FOREACH_BY_POS(elpos, vec)\
for (elpos = 0; elpos < (vec)->size; ++elpos)
#define VEC_FOREACH_BY_PTR(el, vec)\
for (size_t _vec_i = 0;\
_vec_i < (vec)->size && ((el = &(vec)->buffer[_vec_i]), 1);\
++_vec_i)
#define VEC_SIZE(vec)\
((vec)->size)
#define VEC_CAPACITY(vec)\
((vec)->capacity)
#define VEC_ARR(vec)\
((vec)->buffer)
#define VEC_GET(vec, id)\
(&(vec)->buffer[id])
#define VEC_CLEAR(vec) do {\
(vec)->size = 0;\
} while (0)
#define VEC_DELETE(vec) do {\
Free((vec)->buffer);\
} while (0)
#endif