seoxi/libkeke
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

qsort sorts according to system endianness

Browse Source
This commit is contained in:
Seoxi Ryouko
2026-08-21 02:25:58 -05:00
parent 5f92d24de0
commit 3ecc85aecd
2 changed files with 23 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files
test_array.c
+11 -1
View File
@@ -19,6 +19,10 @@ void sub4(void *i, size_t, KekeArray *) {
*(int *)i -= 4;
}
void add250(void *i, size_t, KekeArray *) {
*(int *)i += 250;
}
bool heart(void *i, size_t, KekeArray *) {
return *(int *)i < 3;
}
@@ -146,7 +150,7 @@ int main(void) {
printf("Expected value:\n7\n%d\n\n", j);
keke_array_foreach(array, set);
keke_array_qsort_header(array, sizeof(int));
keke_array_qsort(array);
KekeArray *array5 = keke_array_merge(array, array2);
printf("Expected value:\n0, 1, 1, 2, 2, 2, 2, 3, 3, 3, 4, 5, 6, 7, 8, 9,\n");
keke_array_foreach(array5, output);
@@ -157,6 +161,12 @@ int main(void) {
keke_array_foreach(array5, output);
puts("\n");
keke_array_foreach(array5, add250);
keke_array_qsort_header(array5, sizeof(int));
printf("Expected value:\n250, 251, 251, 252, 252, 252, 252, 253, 253, 253, 254, 255, 256, 257, 258, 259,\n");
keke_array_foreach(array5, output);
puts("\n");
keke_array_free(array);
keke_array_free(array2);
keke_array_free(array4);