diff options
| author | Antoine Pelisse <apelisse@gmail.com> | 2013-03-23 18:23:28 +0100 |
|---|---|---|
| committer | Junio C Hamano <gitster@pobox.com> | 2013-03-25 14:52:33 -0700 |
| commit | 99d3206010ba1fcc9311cbe8376c0b5e78f4a136 (patch) | |
| tree | df1827a997f3f16a8f8e3ab1ea47eb25db79c176 /git-lost-found.sh | |
| parent | fa04ae0be8cca1291a60bc8a393f9c52d2582089 (diff) | |
| download | git-99d3206010ba1fcc9311cbe8376c0b5e78f4a136.tar.gz | |
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 'git-lost-found.sh')
0 files changed, 0 insertions, 0 deletions