48 "LIST(<type>).base and LIST(<type>).impl.base will not alias each other");
70#define LIST_DTOR_FREE ((void *)1)
80#define LIST_SIZE(list) gv_list_size_((list)->impl)
90#define LIST_IS_EMPTY(list) (LIST_SIZE(list) == 0)
101#define LIST_TRY_APPEND(list, item) \
102 gv_list_try_append_(&(list)->impl, \
103 ((list)->scratch = (item), &(list)->scratch), \
104 sizeof((list)->base[0]))
120#define LIST_APPEND(list, item) \
122 (list)->scratch = (item); \
123 const size_t slot_ = \
124 gv_list_append_slot_(&(list)->impl, sizeof((list)->base[0])); \
125 (list)->base[slot_] = (list)->scratch; \
138#define LIST_PREPEND(list, item) \
140 (list)->scratch = (item); \
141 const size_t slot_ = \
142 gv_list_prepend_slot_(&(list)->impl, sizeof((list)->base[0])); \
143 (list)->base[slot_] = (list)->scratch; \
155#define LIST_GET(list, index) \
156 ((list)->base[gv_list_get_((list)->impl, (index))])
168#define LIST_AT(list, index) \
169 (&(list)->base[gv_list_get_((list)->impl, (index))])
180#define LIST_FRONT(list) LIST_AT((list), 0)
191#define LIST_BACK(list) LIST_AT((list), LIST_SIZE(list) - 1)
202#define LIST_SET(list, index, item) \
204 (list)->scratch = (item); \
205 const size_t slot_ = gv_list_get_((list)->impl, (index)); \
206 LIST_DTOR_((list), slot_); \
207 (list)->base[slot_] = (list)->scratch; \
218#define LIST_REMOVE(list, item) \
221 (list)->scratch = (item); \
223 const size_t found_ = gv_list_find_((list)->impl, &(list)->scratch, \
224 sizeof((list)->base[0])); \
225 if (found_ == SIZE_MAX) { \
229 LIST_DTOR_((list), found_); \
230 gv_list_remove_(&(list)->impl, found_, sizeof((list)->base[0])); \
240#define LIST_CLEAR(list) \
242 for (size_t i_ = 0; i_ < LIST_SIZE(list); ++i_) { \
243 const size_t slot_ = gv_list_get_((list)->impl, i_); \
244 LIST_DTOR_((list), slot_); \
246 gv_list_clear_(&(list)->impl, sizeof((list)->base[0])); \
257#define LIST_RESERVE(list, capacity) \
258 gv_list_reserve_(&(list)->impl, capacity, sizeof((list)->base[0]))
273#define LIST_CONTAINS(list, needle) \
274 gv_list_contains_((list)->impl, \
275 ((void)((list)->base == &(needle)), &(needle)), \
276 sizeof((list)->base[0]))
286#define LIST_COPY(dst, src) \
288 memset((dst), 0, sizeof(*(dst))); \
289 (void)((dst)->base == (src)->base); \
290 (dst)->impl = gv_list_copy_((src)->impl, sizeof((src)->base[0])); \
291 (dst)->dtor = (src)->dtor; \
315#define LIST_IS_CONTIGUOUS(list) gv_list_is_contiguous_((list)->impl);
327#define LIST_SYNC(list) gv_list_sync_(&(list)->impl, sizeof((list)->base[0]))
338#define LIST_SORT(list, cmp) \
339 gv_list_sort_(&(list)->impl, (cmp), sizeof((list)->base[0]))
348#define LIST_REVERSE(list) \
349 gv_list_reverse_(&(list)->impl, sizeof((list)->base[0]))
358#define LIST_SHRINK_TO_FIT(list) \
359 gv_list_shrink_to_fit_(&(list)->impl, sizeof((list)->base[0]))
370#define LIST_FREE(list) \
373 gv_list_free_(&(list)->impl); \
384#define LIST_PUSH_BACK(list, item) LIST_APPEND((list), (item))
394#define LIST_POP_FRONT(list) \
395 (gv_list_pop_front_(&(list)->impl, &(list)->scratch, \
396 sizeof((list)->base[0])), \
407#define LIST_POP_BACK(list) \
408 (gv_list_pop_back_(&(list)->impl, &(list)->scratch, \
409 sizeof((list)->base[0])), \
422#define LIST_DROP_BACK(list) \
424 const size_t slot_ = gv_list_get_((list)->impl, LIST_SIZE(list) - 1); \
425 LIST_DTOR_((list), slot_); \
426 gv_list_pop_back_(&(list)->impl, &(list)->scratch, \
427 sizeof((list)->base[0])); \
443#define LIST_DETACH(list, datap, sizep) \
444 gv_list_detach_(&(list)->impl, ((void)((list)->base == *(datap)), (datap)), \
445 (sizep), sizeof((list)->base[0]))
internal implementation details of list.h