gitea/SDL3_fork
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

docs: Fixed example code for SDL_qsort_r() and SDL_bsearch_r().

Browse Source
This commit is contained in:
Ryan C. Gordon
2024-10-22 13:34:40 -04:00
parent 0bec18245d
commit eed11ad6d6
1 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
include/SDL3/SDL_stdinc.h
View File

@@ -1355,9 +1355,9 @@ typedef int (SDLCALL *SDL_CompareCallback_r)(void *userdata, const void *a, cons
* const data *A = (const data *)a; * const data *A = (const data *)a;
* const data *B = (const data *)b; * const data *B = (const data *)b;
* *
* if (A->n < B->n) { * if (A->key < B->key) {
* return (method == sort_increasing) ? -1 : 1; * return (method == sort_increasing) ? -1 : 1;
* } else if (B->n < A->n) { * } else if (B->key < A->key) {
* return (method == sort_increasing) ? 1 : -1; * return (method == sort_increasing) ? 1 : -1;
* } else { * } else {
* return 0; * return 0;
@@ -1407,9 +1407,9 @@ extern SDL_DECLSPEC void SDLCALL SDL_qsort_r(void *base, size_t nmemb, size_t si
* const data *A = (const data *)a; * const data *A = (const data *)a;
* const data *B = (const data *)b; * const data *B = (const data *)b;
* *
* if (A->n < B->n) { * if (A->key < B->key) {
* return (method == sort_increasing) ? -1 : 1; * return (method == sort_increasing) ? -1 : 1;
* } else if (B->n < A->n) { * } else if (B->key < A->key) {
* return (method == sort_increasing) ? 1 : -1; * return (method == sort_increasing) ? 1 : -1;
* } else { * } else {
* return 0; * return 0;