summaryrefslogtreecommitdiff
path: root/Documentation/RelNotes/1.7.10.5.txt
diff options
context:
space:
mode:
authorLibravatar Junio C Hamano <gitster@pobox.com>2012-10-04 15:37:15 -0700
committerLibravatar Junio C Hamano <gitster@pobox.com>2012-10-04 15:49:39 -0700
commitd866924a080215dd276c510abf255a8929b55643 (patch)
treefe0ee5b7e358b77ab0ccfd32b9e29f21170f147c /Documentation/RelNotes/1.7.10.5.txt
parentreduce_heads(): reimplement on top of remove_redundant() (diff)
downloadtgif-d866924a080215dd276c510abf255a8929b55643.tar.xz
paint_down_to_common(): parse commit before relying on its timestamp
When refactoring the merge-base computation to reduce the pairwise O(n*(n-1)) traversals to parallel O(n) traversals, the code forgot that timestamp based heuristics needs each commit to have been parsed. This caused an empty "git pull" to spend cycles, traversing the history all the way down to 0 (because an unparsed commit object has 0 timestamp, and any other commit object with positive timestamp will be processed for its parents, all getting parsed), only to come up with a merge message to be used. Signed-off-by: Junio C Hamano <gitster@pobox.com>
Diffstat (limited to 'Documentation/RelNotes/1.7.10.5.txt')
0 files changed, 0 insertions, 0 deletions