Revision b4615e40a8125477e18490d868f7b65954372b43 authored by Junio C Hamano on 12 January 2020, 21:28:13 UTC, committed by Junio C Hamano on 12 January 2020, 21:28:13 UTC
l10n-2.25.0-rnd1

* tag 'l10n-2.25.0-rnd1' of git://github.com/git-l10n/git-po:
  l10n: zh_CN: for git v2.25.0 l10n round 1
  l10n: Update Catalan translation
  l10n: de.po: Update German translation v2.25.0 round 1
  l10n: de.po: Reword generation numbers
  l10n: bg.po: Updated Bulgarian translation (4800t)
  l10n: es: 2.25.0 round #1
  l10n: sv.po: Update Swedish translation (4800t0f0u)
  l10n: fr.po v2.25.0 rnd 1
  l10n: vi(4800t): Updated Vietnamese translation v2.25.0
  l10n: zh_TW.po: update translation for v2.25.0 round 1
  l10n: it.po: update the Italian translation for Git 2.25.0
  l10n: git.pot: v2.25.0 round 1 (119 new, 13 removed)
  l10n: Update Catalan translation
  l10n: zh_TW: add translation for v2.24.0
2 parent s 4d92452 + ddc12c4
Raw File
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