Revision c5a8f1efc03746fd6b6c71fef8e3a5c38ce4e2e8 authored by Junio C Hamano on 29 September 2020, 21:01:19 UTC, committed by Junio C Hamano on 29 September 2020, 21:01:20 UTC
More FAQ entries. * bc/faq-misc: docs: explain how to deal with files that are always modified docs: explain why reverts are not always applied on merge docs: explain why squash merges are broken with long-running branches
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 ...
