themixedupstuff/libmx
1
0
Fork 0
mirror of https://github.com/utkumaden/libmx.git synced 2025-01-22 21:46:33 +01:00
Code Issues Packages Projects Releases Wiki Activity

Merge branch 'master' of github.com:utkumaden/libmx

Browse Source
This commit is contained in:
H. Utku Maden 2024-03-23 23:50:16 +03:00
commit 41476ed89b
1 changed files with 7 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

13
include/mx/list.h
View File

@ -66,20 +66,21 @@ struct mx_list_self_t {
* @param list The list.
* @param index The index to insert the item into.
* @param item The item to insert.
* @param nelem The number of elements to insert.
* @remarks This overload is for things that can be copied, like structs. Item must be an addressable lvalue.
*/
#define mx_list_insert_copy(list, index, item) do { \
#define mx_list_insert_array(list, index, item, nelem) do { \
int idx = (index); \
if (list == NULL) { \
MX_ASSERT(idx == 0, "mx_list_insert() can only insert at 0 for an empty list."); \
mx_list_resize(list, 1); \
memcpy(&list[0], &item, sizeof(*item)); \
mx_list_resize(list, (nelem)); \
memcpy(&list[0], &item, (nelem)*sizeof(*item)); \
} else { \
int count = mx_list_count(list) \
MX_ASSERT(idx > 0 && idx <= count, "mx_list_insert() expected a range between 0 and mx_list_count()."); \
mx_list_resize(list, count + 1); \
memmove(&list[idx]+1, &list[idx], (count - idx) * sizeof(*list)); \
memcpy(&list[idx], &item, sizeof(*item)); \
mx_list_resize(list, count + (nelem)); \
memmove(&list[idx]+(nelem), &list[idx], (count - idx) * sizeof(*list)); \
memcpy(&list[idx], &item, (nelem)*sizeof(*item)); \
} \
} while(0)