implement stable sort for lists

also change sort_workspaces() to use it

1 files changed, 2 insertions, 1 deletions

diff --git a/include/list.h b/include/list.h
index b2e26f95..f478b6bb 100644
--- a/include/list.h
+++ b/include/list.h
@@ -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