summaryrefslogtreecommitdiff
path: root/tests/diff/patchid.c
diff options
context:
space:
mode:
authorMichael Tesch <mitesch@microsoft.com>2017-04-12 14:38:30 -0400
committerMichael Tesch <mitesch@microsoft.com>2017-05-17 12:42:29 -0400
commitcee1e7af1d979c26bb27a73f84cf53a8c860abdb (patch)
tree05ac2714bb80df7901f734720752a8e56a82a1e5 /tests/diff/patchid.c
parentf9d3b0d05f19a59e3327deabc2edc93e507c6aa3 (diff)
downloadlibgit2-cee1e7af1d979c26bb27a73f84cf53a8c860abdb.tar.gz
merge: perform exact rename detection in linear time
The current exact rename detection has order n^2 complexity. We can do better by using a map to first aggregate deletes and using that to match deletes to adds. This results in a substantial performance improvement for merges with a large quantity of adds and deletes.
Diffstat (limited to 'tests/diff/patchid.c')
0 files changed, 0 insertions, 0 deletions