diff options
| author | emersion <contact@emersion.fr> | 2018-08-15 22:11:34 +0100 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2018-08-15 22:11:34 +0100 |
| commit | 647ace1d6de5abe4c469db2e4e9590e3ef2168b9 (patch) | |
| tree | e40d92b53c4fefde865b1d23d3c1bcae8ea54c37 /include | |
| parent | b4887ba154ab0d659c560a21194c8ca43b953632 (diff) | |
| parent | 701fcafc70f18c6f1982a742019e875beeb258d7 (diff) | |
Merge pull request #2459 from RyanDwyer/fix-workspace-prev-next
Use list_find in more places and refactor/fix workspace prev_next functions
Diffstat (limited to 'include')
| -rw-r--r-- | include/list.h | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/include/list.h b/include/list.h index 7c0e4bd2..03851a82 100644 --- a/include/list.h +++ b/include/list.h @@ -20,7 +20,7 @@ void list_qsort(list_t *list, int compare(const void *left, const void *right)); // Return index for first item in list that returns 0 for given compare // function or -1 if none matches. int list_seq_find(list_t *list, int compare(const void *item, const void *cmp_to), const void *cmp_to); -int list_find(list_t *list, void *item); +int list_find(list_t *list, const void *item); // stable sort since qsort is not guaranteed to be stable void list_stable_sort(list_t *list, int compare(const void *a, const void *b)); // swap two elements in a list |