aboutsummaryrefslogtreecommitdiffstats
path: root/ui-repolist.h
diff options
context:
space:
mode:
authorRagnar Ouchterlony <ragnar@lysator.liu.se>2009-10-25 18:13:22 +0100
committerLars Hjemli <hjemli@gmail.com>2009-11-07 15:37:11 +0100
commit735e15e38a484bf0daa98776fa7cde270a271cda (patch)
tree588545cead471e8997adc1ae5abca164a4873481 /ui-repolist.h
parentFixed side-by-side diff bugs related to binary diff and more. (diff)
downloadcgit-735e15e38a484bf0daa98776fa7cde270a271cda.tar.xz
cgit-735e15e38a484bf0daa98776fa7cde270a271cda.zip
In side-by-side diff, add support for marking individual characters.
Refuses to do so if the left hand side of the diff has different amount of differing lines to the right hand side to avoid confusion. Note that I use the naive dynamic programming approach for calculating the longest common subsequence. We could probably be more efficient by using a better algorithm. The LCS calculating function is O(n*m) and uses up n*m amount of memory too (so if we we compare two strings of length 100, I use an array of 10000 for calculating the LCS). Might want to not calculate LCS if the length of the line is too large. Signed-off-by: Ragnar Ouchterlony <ragnar@lysator.liu.se>
Diffstat (limited to 'ui-repolist.h')
0 files changed, 0 insertions, 0 deletions