summaryrefslogtreecommitdiff
path: root/Documentation/RelNotes
diff options
context:
space:
mode:
authorLibravatar Jeff King <peff@peff.net>2016-10-11 17:20:16 -0400
committerLibravatar Junio C Hamano <gitster@pobox.com>2016-10-11 14:27:56 -0700
commit5411b10cef90377afc584fc2562f26ac051fc357 (patch)
treef16a7ae8c389d2c8f6766a92c2e648cad4153bfb /Documentation/RelNotes
parentNinth batch for 2.11 (diff)
downloadtgif-5411b10cef90377afc584fc2562f26ac051fc357.tar.xz
upload-pack: use priority queue in reachable() check
Like a lot of old commit-traversal code, this keeps a commit_list in commit-date order, and and inserts parents into the list. This means each insertion is potentially linear, and the whole thing is quadratic (though the exact runtime depends on the relationship between the commit dates and the parent topology). These days we have a priority queue, which can do the same thing with a much better worst-case time. Signed-off-by: Jeff King <peff@peff.net> Signed-off-by: Junio C Hamano <gitster@pobox.com>
Diffstat (limited to 'Documentation/RelNotes')
0 files changed, 0 insertions, 0 deletions