summaryrefslogtreecommitdiff
path: root/t/helper/test-prio-queue.c
diff options
context:
space:
mode:
authorLibravatar René Scharfe <l.s.r@web.de>2021-10-01 11:12:27 +0200
committerLibravatar Junio C Hamano <gitster@pobox.com>2021-10-01 12:43:08 -0700
commite031e9719d21c11102870b8037bdda995dede5e0 (patch)
tree6b9c011250c749edd9a062188ecb92f18aec9519 /t/helper/test-prio-queue.c
parenttest-mergesort: add sort subcommand (diff)
downloadtgif-e031e9719d21c11102870b8037bdda995dede5e0.tar.xz
test-mergesort: add test subcommand
Adapt the qsort certification program from "Engineering a Sort Function" by Bentley and McIlroy for testing our linked list sort function. It generates several lists with various distribution patterns and counts the number of operations llist_mergesort() needs to order them. It compares the result to the output of a trusted sort function (qsort(1)) and also checks if the sort is stable. Also add a test script that makes use of the new subcommand. Signed-off-by: René Scharfe <l.s.r@web.de> Signed-off-by: Junio C Hamano <gitster@pobox.com>
Diffstat (limited to 't/helper/test-prio-queue.c')
0 files changed, 0 insertions, 0 deletions