Revision 7f4e64169352e03476b0ea64e7e2973669e491a2 authored by Junio C Hamano on 21 November 2018, 14:24:52 UTC, committed by Junio C Hamano on 21 November 2018, 14:24:52 UTC
Signed-off-by: Junio C Hamano <gitster@pobox.com>
1 parent 7cb1ea1
mergesort.h
#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 *));
#endif
Computing file changes ...
