diff options
| author | Furkan Sahin <furkan-dev@proton.me> | 2018-08-14 09:07:59 -0400 |
|---|---|---|
| committer | Furkan Sahin <furkan-dev@proton.me> | 2018-08-14 09:07:59 -0400 |
| commit | e7e805f1a48700eb095a66526e9ea3ca39e8ca92 (patch) | |
| tree | d1d693231ab91f1ef2fe98a437cc260daf755142 /include/list.h | |
| parent | 8e79a71610d864c5f00fa0ea3c39f7a60f351a3a (diff) | |
| parent | 5466c4b9c7c93a2a7b3569479d4e88a6aff67108 (diff) | |
Merge pull request #2445 from RyanDwyer/resize-tiling-via-cursor
Implement resizing tiled containers via cursor
Diffstat (limited to 'include/list.h')
| -rw-r--r-- | include/list.h | 1 |
1 files changed, 1 insertions, 0 deletions
diff --git a/include/list.h b/include/list.h index 5a0d7d80..7c0e4bd2 100644 --- a/include/list.h +++ b/include/list.h @@ -20,6 +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); // 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 |
