mirror of
https://github.com/swaywm/sway.git
synced 2025-11-27 06:59:53 -05:00
implement stable sort for lists
also change sort_workspaces() to use it
This commit is contained in:
parent
09670fc1a7
commit
9ccc92705e
4 changed files with 64 additions and 5 deletions
|
|
@ -20,5 +20,6 @@ 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);
|
||||
|
||||
// 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));
|
||||
#endif
|
||||
|
|
|
|||
|
|
@ -16,7 +16,7 @@ void get_absolute_position(swayc_t *container, struct wlc_point *point);
|
|||
// given wlc_point.
|
||||
void get_absolute_center_position(swayc_t *container, struct wlc_point *point);
|
||||
|
||||
int sort_workspace_cmp_qsort(const void *a, const void *b);
|
||||
// stable sort workspaces on this output
|
||||
void sort_workspaces(swayc_t *output);
|
||||
|
||||
#endif
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue