Revision 1dad5c14f993dcd2d38ce7eb7ecedb624732d692 authored by SZEDER Gábor on 13 June 2012, 08:11:29 UTC, committed by Junio C Hamano on 13 June 2012, 17:24:46 UTC
Signed-off-by: SZEDER Gábor <szeder@ira.uka.de> Signed-off-by: Junio C Hamano <gitster@pobox.com>
1 parent 9bea2b5
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
![swh spinner](/static/img/swh-spinner.gif)
Computing file changes ...