diff options
author | René Scharfe <l.s.r@web.de> | 2022-07-16 20:02:38 +0300 |
---|---|---|
committer | Junio C Hamano <gitster@pobox.com> | 2022-07-18 01:20:39 +0300 |
commit | 0f1eb7d6e976c64c0016d4355200660ce2fdf1ec (patch) | |
tree | 6af1dad6c23abda33f8f7329b495d64c807dfefe /mergesort.h | |
parent | 9b9f5f6217a5178e348dc2e18bc6af7158b97c36 (diff) |
mergesort: remove llist_mergesort()
Now that all of its callers are gone, remove llist_mergesort().
Signed-off-by: René Scharfe <l.s.r@web.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
Diffstat (limited to 'mergesort.h')
-rw-r--r-- | mergesort.h | 13 |
1 files changed, 0 insertions, 13 deletions
diff --git a/mergesort.h b/mergesort.h index 7b44355283..7c36f08bd5 100644 --- a/mergesort.h +++ b/mergesort.h @@ -1,19 +1,6 @@ #ifndef MERGESORT_H #define MERGESORT_H -/* - * Sort linked list in place. - * - get_next_fn() returns the next element given an element of a linked list. - * - set_next_fn() takes two elements A and B, and makes B the "next" element - * of A on the list. - * - compare_fn() takes two elements A and B, and returns negative, 0, positive - * as the same sign as "subtracting" B from A. - */ -void *llist_mergesort(void *list, - void *(*get_next_fn)(const void *), - void (*set_next_fn)(void *, void *), - int (*compare_fn)(const void *, const void *)); - /* Combine two sorted lists. Take from `list` on equality. */ #define DEFINE_LIST_MERGE_INTERNAL(name, type) \ static type *name##__merge(type *list, type *other, \ |