From eed11ad6d64ee2d538fb317dd3021fd187adf835 Mon Sep 17 00:00:00 2001 From: "Ryan C. Gordon" Date: Tue, 22 Oct 2024 13:34:40 -0400 Subject: [PATCH] docs: Fixed example code for SDL_qsort_r() and SDL_bsearch_r(). --- include/SDL3/SDL_stdinc.h | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/include/SDL3/SDL_stdinc.h b/include/SDL3/SDL_stdinc.h index a2c91caf86..d67035a7dd 100644 --- a/include/SDL3/SDL_stdinc.h +++ b/include/SDL3/SDL_stdinc.h @@ -1355,9 +1355,9 @@ typedef int (SDLCALL *SDL_CompareCallback_r)(void *userdata, const void *a, cons * const data *A = (const data *)a; * const data *B = (const data *)b; * - * if (A->n < B->n) { + * if (A->key < B->key) { * return (method == sort_increasing) ? -1 : 1; - * } else if (B->n < A->n) { + * } else if (B->key < A->key) { * return (method == sort_increasing) ? 1 : -1; * } else { * 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 *B = (const data *)b; * - * if (A->n < B->n) { + * if (A->key < B->key) { * return (method == sort_increasing) ? -1 : 1; - * } else if (B->n < A->n) { + * } else if (B->key < A->key) { * return (method == sort_increasing) ? 1 : -1; * } else { * return 0;