diff options
| author | Furkan Sahin <furkan-dev@proton.me> | 2016-06-02 17:05:41 -0400 |
|---|---|---|
| committer | Furkan Sahin <furkan-dev@proton.me> | 2016-06-02 17:05:41 -0400 |
| commit | 7b6f6f7bfce56519ccf87b9cef53ffc0bf8a0991 (patch) | |
| tree | 6ccc4143129cdfe354aa01f80c80deff1cca4ca4 /include/list.h | |
| parent | c8e00da2d9dc80e22b0005b00d24859317d8fc41 (diff) | |
| parent | 3e474f0016e008a6dca3cafcb46b29e03e47d93e (diff) | |
Merge pull request #692 from zandrmartin/inplace-merge-sort
implement stable sort for lists
Diffstat (limited to 'include/list.h')
| -rw-r--r-- | include/list.h | 3 |
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 |