summaryrefslogtreecommitdiff
path: root/mergesort.h
diff options
context:
space:
mode:
authorLibravatar Junio C Hamano <gitster@pobox.com>2013-06-06 21:58:12 -0700
committerLibravatar Junio C Hamano <gitster@pobox.com>2013-06-11 15:15:21 -0700
commitda24b1044f7dc85cda52d6423f5a794a7074fbf8 (patch)
tree44abcb499d4bf5ecb64fe1067586aac5569bdcfb /mergesort.h
parentprio-queue: priority queue of pointers to structs (diff)
downloadtgif-da24b1044f7dc85cda52d6423f5a794a7074fbf8.tar.xz
sort-in-topological-order: use prio-queue
Use the prio-queue data structure to implement a priority queue of commits sorted by committer date, when handling --date-order. The structure can also be used as a simple LIFO stack, which is a good match for --topo-order processing. Signed-off-by: Junio C Hamano <gitster@pobox.com>
Diffstat (limited to 'mergesort.h')
0 files changed, 0 insertions, 0 deletions