Use built-in qsort instead of flecs (better perf)
This commit is contained in:
@@ -38,17 +38,17 @@ i32 _bzArrayPop(void *arr);
|
||||
#define bzArrayDel(arr, idx) _bzArrayDelN(arr, idx, 1)
|
||||
#define bzArrayDelN(arr, idx, n) _bzArrayDelN(arr, idx, n)
|
||||
|
||||
#define bzArrayPush(arr, e) \
|
||||
#define bzArrayPush(arr, ...) \
|
||||
do { \
|
||||
(arr) = bzArrayEnsureCapacity(arr, bzArraySize(arr) + 1); \
|
||||
(arr)[_bzArrayPush(arr)] = (e); \
|
||||
(arr)[_bzArrayPush(arr)] = (__VA_ARGS__); \
|
||||
} while (0)
|
||||
#define bzArrayIns(arr, idx, e) \
|
||||
#define bzArrayIns(arr, idx, ...) \
|
||||
do { \
|
||||
(arr) = bzArrayEnsureCapacity(arr, bzArraySize(arr) + 1); \
|
||||
(arr)[_bzArrayIns(arr, idx)] = (e); \
|
||||
(arr)[_bzArrayIns(arr, idx)] = (__VA_ARGS__); \
|
||||
} while (0)
|
||||
#define bzArraySet(arr, idx, e) (arr)[_bzArraySet(arr, idx)] = e
|
||||
#define bzArraySet(arr, idx, ...) (arr)[_bzArraySet(arr, idx)] = (__VA_ARGS__)
|
||||
#define bzArrayPop(arr) (arr)[_bzArrayPop(arr)]
|
||||
|
||||
#define bzArrayFor(arr, it) for (i32 it = 0; it < bzArraySize(arr); it++)
|
||||
|
||||
Reference in New Issue
Block a user