summaryrefslogtreecommitdiff
path: root/builtin/mailsplit.c
diff options
context:
space:
mode:
authorLibravatar Michael Haggerty <mhagger@alum.mit.edu>2014-11-25 09:02:31 +0100
committerLibravatar Junio C Hamano <gitster@pobox.com>2014-11-25 10:09:49 -0800
commit6d6d06c9012e96d74e9ea7aeeb6ce6dcd1a11b0f (patch)
tree65c6b627c8431a64db21e08073bb90b902918851 /builtin/mailsplit.c
parentprune_remote(): initialize both delete_refs lists in a single loop (diff)
downloadtgif-6d6d06c9012e96d74e9ea7aeeb6ce6dcd1a11b0f.tar.xz
prune_remote(): sort delete_refs_list references en masse
Inserting items into a list in sorted order is O(N^2) whereas appending them unsorted and then sorting the list all at once is O(N lg N). string_list_insert() also removes duplicates, and this change loses that functionality. But the strings in this list, which ultimately come from a for_each_ref() iteration, cannot contain duplicates. Signed-off-by: Michael Haggerty <mhagger@alum.mit.edu> Reviewed-by: Jonathan Nieder <jrnieder@gmail.com> Signed-off-by: Junio C Hamano <gitster@pobox.com>
Diffstat (limited to 'builtin/mailsplit.c')
0 files changed, 0 insertions, 0 deletions