Revision 9bea2b5896701cf952f75c8f6756656cd3c40af0 authored by Junio C Hamano on 12 June 2012, 16:10:52 UTC, committed by Junio C Hamano on 12 June 2012, 16:10:52 UTC
Signed-off-by: Junio C Hamano <gitster@pobox.com>
1 parent 3a2c135
test-mergesort.c
#include "cache.h"
#include "mergesort.h"
struct line {
char *text;
struct line *next;
};
static void *get_next(const void *a)
{
return ((const struct line *)a)->next;
}
static void set_next(void *a, void *b)
{
((struct line *)a)->next = b;
}
static int compare_strings(const void *a, const void *b)
{
const struct line *x = a, *y = b;
return strcmp(x->text, y->text);
}
int main(int argc, const char **argv)
{
struct line *line, *p = NULL, *lines = NULL;
struct strbuf sb = STRBUF_INIT;
for (;;) {
if (strbuf_getwholeline(&sb, stdin, '\n'))
break;
line = xmalloc(sizeof(struct line));
line->text = strbuf_detach(&sb, NULL);
if (p) {
line->next = p->next;
p->next = line;
} else {
line->next = NULL;
lines = line;
}
p = line;
}
lines = llist_mergesort(lines, get_next, set_next, compare_strings);
while (lines) {
printf("%s", lines->text);
lines = lines->next;
}
return 0;
}
![swh spinner](/static/img/swh-spinner.gif)
Computing file changes ...