YourWishes/Dawn
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Added Linux Support, Improved code cleanliness

Browse Source
This commit is contained in:
Dominic Masters
2021-07-13 08:36:25 -07:00
parent 8b45b976d4
commit 6b027e6e4e
18 changed files with 110 additions and 75 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
src/util/array.c
View File

@ -61,7 +61,7 @@ void arrayCopy(size_t size, void *source, int32_t length, void *dest) {
}
void arraySort(size_t size, void *array, int32_t length, arraysort_t *sort) {
qsort(array, length, size, (_CoreCrtNonSecureSearchSortCompareFunction)sort);
qsort(array, length, size, sort);
}
// Common Sorters:
@ -69,13 +69,13 @@ void arraySort(size_t size, void *array, int32_t length, arraysort_t *sort) {
void arraySortInt32(int32_t *array, int32_t length) {
arraySort(sizeof(int32_t), array, length, &_arraySorterInt32);
}
int32_t _arraySorterInt32(void* left, void* right) {
int32_t _arraySorterInt32(const void* left, const void* right) {
return *((int32_t *)left) - *((int32_t *)right);
}
void arraySortUint8(uint8_t *array, int32_t length) {
arraySort(sizeof(uint8_t), array, length, &_arraySorterUint8);
}
int32_t _arraySorterUint8(void* left, void* right) {
int32_t _arraySorterUint8(const void* left, const void* right) {
return *((uint8_t *)left) - *((uint8_t *)right);
}

4
src/util/array.h
View File

@ -79,7 +79,7 @@ void arraySort(size_t size, void *array, int32_t length, arraysort_t *sort);
*/
void arraySortInt32(int32_t *array, int32_t length);
/** Internal int32_t array sorter. */
int32_t _arraySorterInt32(void *left, void* right);
int32_t _arraySorterInt32(const void *left, const void* right);
/**
* Sort a uint8_t array.
@ -89,4 +89,4 @@ int32_t _arraySorterInt32(void *left, void* right);
*/
void arraySortUint8(uint8_t *array, int32_t length);
/** Internal uint8_t array sorter. */
int32_t _arraySorterUint8(void* left, void* right);
int32_t _arraySorterUint8(const void* left, const void* right);