aboutsummaryrefslogtreecommitdiff
path: root/include/list.h
diff options
context:
space:
mode:
authorDrew DeVault <sir@cmpwn.com>2018-08-14 09:07:59 -0400
committerGitHub <noreply@github.com>2018-08-14 09:07:59 -0400
commitb4887ba154ab0d659c560a21194c8ca43b953632 (patch)
treed1d693231ab91f1ef2fe98a437cc260daf755142 /include/list.h
parentd0fb2d9a53662c8629f1a0f0a57e83e6f36285c4 (diff)
parent4b8e3a885be74c588291c51f798de80bd81a92db (diff)
downloadsway-b4887ba154ab0d659c560a21194c8ca43b953632.tar.xz
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.h1
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