summaryrefslogtreecommitdiff
path: root/prio-queue.h
diff options
context:
space:
mode:
authorJunio C Hamano <gitster@pobox.com>2013-06-06 21:58:12 -0700
committerJunio C Hamano <gitster@pobox.com>2013-06-11 15:15:21 -0700
commitda24b1044f7dc85cda52d6423f5a794a7074fbf8 (patch)
tree44abcb499d4bf5ecb64fe1067586aac5569bdcfb /prio-queue.h
parentb4b594a3154078430b04fad4f6ffbed9c7274be5 (diff)
downloadgit-da24b1044f7dc85cda52d6423f5a794a7074fbf8.tar.gz
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 'prio-queue.h')
-rw-r--r--prio-queue.h3
1 files changed, 3 insertions, 0 deletions
diff --git a/prio-queue.h b/prio-queue.h
index c766abec3d..9c3cd1f875 100644
--- a/prio-queue.h
+++ b/prio-queue.h
@@ -42,4 +42,7 @@ extern void *prio_queue_get(struct prio_queue *);
extern void clear_prio_queue(struct prio_queue *);
+/* Reverse the LIFO elements */
+extern void prio_queue_reverse(struct prio_queue *);
+
#endif /* PRIO_QUEUE_H */