mirrors/sway
1
0
Fork 0
mirror of https://github.com/swaywm/sway.git synced 2026-04-29 06:46:22 -04:00
Code Issues Projects Releases Packages Wiki Activity Actions

Added argument names to the function pointers.

Browse source
This commit is contained in:
Scott Anderson 2017-05-10 13:38:49 +12:00
parent 1fd8d33f2f
commit 9538e36728
2 changed files with 8 additions and 8 deletions
Download patch file Download diff file Expand all files Collapse all files

6
common/list.c
View file

@ -162,7 +162,7 @@ void list_isort(list_t *list, int compare(const void *, const void *)) {
} }
} }
ssize_t list_bsearch(const list_t *list, int compare(const void *, const void *), ssize_t list_bsearch(const list_t *list, int compare(const void *key, const void *item),
const void *key, void *ret) { const void *key, void *ret) {
if (!sway_assert(list && compare && key, "Invalid argument")) { if (!sway_assert(list && compare && key, "Invalid argument")) {
@ -180,7 +180,7 @@ ssize_t list_bsearch(const list_t *list, int compare(const void *, const void *)
} }
} }
ssize_t list_lsearch(const list_t *list, int compare(const void *, const void *), ssize_t list_lsearch(const list_t *list, int compare(const void *key, const void *item),
const void *key, void *ret) { const void *key, void *ret) {
if (!sway_assert(list && compare && key, "Invalid argument")) { if (!sway_assert(list && compare && key, "Invalid argument")) {
@ -202,7 +202,7 @@ ssize_t list_lsearch(const list_t *list, int compare(const void *, const void *)
return -1; return -1;
} }
void list_foreach(list_t *list, void callback(void *)) { void list_foreach(list_t *list, void callback(void *item)) {
if (!sway_assert(list && callback, "Invalid argument")) { if (!sway_assert(list && callback, "Invalid argument")) {
return; return;
} }

10
include/list.h
View file

@ -61,14 +61,14 @@ void *list_get(list_t *list, size_t index);
/* /*
* Sorts the list using the stdlib qsort() function. * Sorts the list using the stdlib qsort() function.
*/ */
void list_qsort(list_t *list, int compare(const void *, const void *)); void list_qsort(list_t *list, int compare(const void *left, const void *right));
/* /*
* Sorts the list using insertion sort. * Sorts the list using insertion sort.
* This should be used if you need a stable sort, and your list is * This should be used if you need a stable sort, and your list is
* short and/or nearly sorted. * short and/or nearly sorted.
*/ */
void list_isort(list_t *list, int compare(const void *, const void *)); void list_isort(list_t *list, int compare(const void *left, const void *right));
/* /*
* Returns the index of key in the list, using the stdlib bsearch() function, * Returns the index of key in the list, using the stdlib bsearch() function,
@ -76,7 +76,7 @@ void list_isort(list_t *list, int compare(const void *, const void *));
* copied into it. * copied into it.
* The list must be sorted. * The list must be sorted.
*/ */
ssize_t list_bsearch(const list_t *list, int compare(const void *, const void *), ssize_t list_bsearch(const list_t *list, int compare(const void *key, const void *item),
const void *key, void *ret); const void *key, void *ret);
/* /*
@ -84,13 +84,13 @@ ssize_t list_bsearch(const list_t *list, int compare(const void *, const void *)
* or -1 if it was not found. If ret is not null, the found element will be * or -1 if it was not found. If ret is not null, the found element will be
* copied into it. * copied into it.
*/ */
ssize_t list_lsearch(const list_t *list, int compare(const void *, const void *), ssize_t list_lsearch(const list_t *list, int compare(const void *key, const void *item),
const void *key, void *ret); const void *key, void *ret);
/* /*
* Calls a function on every item in the list. * Calls a function on every item in the list.
*/ */
void list_foreach(list_t *list, void callback(void *)); void list_foreach(list_t *list, void callback(void *item));
/* /*
* Returns a pointer to just past the end of the list. * Returns a pointer to just past the end of the list.