eden-emu/SDL
14
0
Fork 0
mirror of https://github.com/libsdl-org/SDL.git synced 2025-05-15 09:18:27 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 3

Sync SDL3 wiki -> header

Browse source
This commit is contained in:
SDL Wiki Bot 2024-09-30 18:18:49 +00:00
parent ab832f1be0
commit c16d7c87d6
1 changed files with 12 additions and 3 deletions
Download patch file Download diff file Expand all files Collapse all files

15
include/SDL3/SDL_stdinc.h
View file

@ -1212,7 +1212,9 @@ extern SDL_DECLSPEC int SDLCALL SDL_unsetenv_unsafe(const char *name);
* *
* \param a a pointer to the first element being compared. * \param a a pointer to the first element being compared.
* \param b a pointer to the second element being compared. * \param b a pointer to the second element being compared.
* \returns -1 if `a` should be sorted before `b`, 1 if `b` should be sorted before `a`, 0 if they are equal. If two elements are equal, their order in the sorted array is undefined. * \returns -1 if `a` should be sorted before `b`, 1 if `b` should be sorted
* before `a`, 0 if they are equal. If two elements are equal, their
* order in the sorted array is undefined.
* *
* \since This callback is available since SDL 3.0.0. * \since This callback is available since SDL 3.0.0.
* *
@ -1225,6 +1227,7 @@ typedef int (SDLCALL *SDL_CompareCallback)(const void *a, const void *b);
* Sort an array. * Sort an array.
* *
* For example: * For example:
*
* ```c * ```c
* typedef struct { * typedef struct {
* int key; * int key;
@ -1268,6 +1271,7 @@ extern SDL_DECLSPEC void SDLCALL SDL_qsort(void *base, size_t nmemb, size_t size
* Perform a binary search on a previously sorted array. * Perform a binary search on a previously sorted array.
* *
* For example: * For example:
*
* ```c * ```c
* typedef struct { * typedef struct {
* int key; * int key;
@ -1315,7 +1319,9 @@ extern SDL_DECLSPEC void * SDLCALL SDL_bsearch(const void *key, const void *base
* \param userdata the `userdata` pointer passed to the sort function. * \param userdata the `userdata` pointer passed to the sort function.
* \param a a pointer to the first element being compared. * \param a a pointer to the first element being compared.
* \param b a pointer to the second element being compared. * \param b a pointer to the second element being compared.
* \returns -1 if `a` should be sorted before `b`, 1 if `b` should be sorted before `a`, 0 if they are equal. If two elements are equal, their order in the sorted array is undefined. * \returns -1 if `a` should be sorted before `b`, 1 if `b` should be sorted
* before `a`, 0 if they are equal. If two elements are equal, their
* order in the sorted array is undefined.
* *
* \since This callback is available since SDL 3.0.0. * \since This callback is available since SDL 3.0.0.
* *
@ -1328,6 +1334,7 @@ typedef int (SDLCALL *SDL_CompareCallback_r)(void *userdata, const void *a, cons
* Sort an array, passing a userdata pointer to the compare function. * Sort an array, passing a userdata pointer to the compare function.
* *
* For example: * For example:
*
* ```c * ```c
* typedef enum { * typedef enum {
* sort_increasing, * sort_increasing,
@ -1375,9 +1382,11 @@ typedef int (SDLCALL *SDL_CompareCallback_r)(void *userdata, const void *a, cons
extern SDL_DECLSPEC void SDLCALL SDL_qsort_r(void *base, size_t nmemb, size_t size, SDL_CompareCallback_r compare, void *userdata); extern SDL_DECLSPEC void SDLCALL SDL_qsort_r(void *base, size_t nmemb, size_t size, SDL_CompareCallback_r compare, void *userdata);
/** /**
* Perform a binary search on a previously sorted array, passing a userdata pointer to the compare function. * Perform a binary search on a previously sorted array, passing a userdata
* pointer to the compare function.
* *
* For example: * For example:
*
* ```c * ```c
* typedef enum { * typedef enum {
* sort_increasing, * sort_increasing,