summaryrefslogtreecommitdiff
path: root/t/t3306-notes-prune.sh
diff options
context:
space:
mode:
authorLibravatar Antoine Pelisse <apelisse@gmail.com>2013-03-23 18:23:28 +0100
committerLibravatar Junio C Hamano <gitster@pobox.com>2013-03-25 14:52:33 -0700
commit99d3206010ba1fcc9311cbe8376c0b5e78f4a136 (patch)
treedf1827a997f3f16a8f8e3ab1ea47eb25db79c176 /t/t3306-notes-prune.sh
parentAllow combined diff to ignore white-spaces (diff)
downloadtgif-99d3206010ba1fcc9311cbe8376c0b5e78f4a136.tar.xz
combine-diff: coalesce lost lines optimally
This replaces the greedy implementation to coalesce lost lines by using dynamic programming to find the Longest Common Subsequence. The O(n²) time complexity is obviously bigger than previous implementation but it can produce shorter diff results (and most likely easier to read). List of lost lines is now doubly-linked because we reverse-read it when reading the direction matrix. Signed-off-by: Antoine Pelisse <apelisse@gmail.com> Signed-off-by: Junio C Hamano <gitster@pobox.com>
Diffstat (limited to 't/t3306-notes-prune.sh')
0 files changed, 0 insertions, 0 deletions