summaryrefslogtreecommitdiff
path: root/.gitignore
diff options
context:
space:
mode:
authorRené Scharfe <rene.scharfe@lsrfire.ath.cx>2012-04-01 00:10:11 +0200
committerJunio C Hamano <gitster@pobox.com>2012-04-11 08:50:53 -0700
commit0db71e0fa94c1857f98890928098e8f4c8ac6f26 (patch)
tree0095038b4c0b0c9d643380f479cb17db1dcd14a6 /.gitignore
parent828ea97de486c1693d6e4f2c7347acb50235a85d (diff)
downloadgit-0db71e0fa94c1857f98890928098e8f4c8ac6f26.tar.gz
add mergesort() for linked lists
This adds a generic bottom-up mergesort implementation for singly linked lists. It was inspired by Simon Tatham's webpage on the topic[1], but not so much by his implementation -- for no good reason, really, just a case of NIH. [1] http://www.chiark.greenend.org.uk/~sgtatham/algorithms/listsort.html Signed-off-by: Rene Scharfe <rene.scharfe@lsrfire.ath.cx> Signed-off-by: Junio C Hamano <gitster@pobox.com>
Diffstat (limited to '.gitignore')
-rw-r--r--.gitignore1
1 files changed, 1 insertions, 0 deletions
diff --git a/.gitignore b/.gitignore
index 3b7680ea1e..1787c8185d 100644
--- a/.gitignore
+++ b/.gitignore
@@ -180,6 +180,7 @@
/test-index-version
/test-line-buffer
/test-match-trees
+/test-mergesort
/test-mktemp
/test-obj-pool
/test-parse-options