\r
#define da_append c_da_append\r
#define da_free c_da_free\r
+#define da_shift c_da_shift\r
#define DYNAMIC_ARRAY_INITIAL_CAPACITY c_DYNAMIC_ARRAY_INITIAL_CAPACITY\r
// #define c_DYNAMIC_ARRAY_INITIAL_CAPACITY\r
\r
\r
#define c_ARRAY_LEN(arr) (sizeof(arr) / sizeof(arr[0]))\r
\r
-#define c_pop_front(xs, xsz) (assert(xsz > 0 && "Array is empty"), xsz--, *xs++)\r
-#define c_shift_args c_pop_front\r
+#define c_shift(xs, xsz) (assert(xsz > 0 && "Array is empty"), xsz--, *xs++)\r
+#define c_shift_args c_shift\r
\r
//\r
// Struct pre-decls\r
(da).items[(da).count++] = elm;\\r
} while (0)\r
\r
-#define c_da_pop_front(da) (c_ASSERT(da.count > 0, "Array is empty"), da.count--, *da.items++)\r
+#define c_da_shift(da) (c_ASSERT(da.count > 0, "Array is empty"), da.count--, *da.items++)\r
#define c_da_free(da) C_FREE(da.items)\r
\r
//\r