Skip to main content

Browse the archive

https://github.com/git/git
05 April 2024, 19:32:26 UTC
Revision 84d06cdc06389ae7c462434cb7b1db0980f63860 authored by Junio C Hamano on 26 March 2021, 21:59:47 UTC, committed by Junio C Hamano on 26 March 2021, 21:59:47 UTC 
Sync with v2.31.1
2 parent s 26c4f98 + 48bf2fa
Raw File
Tip revision: 84d06cdc06389ae7c462434cb7b1db0980f63860 authored by Junio C Hamano on 26 March 2021, 21:59:47 UTC
Sync with v2.31.1
Tip revision: 84d06cd
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
back to top