On 21 February 2013 18:47, Piotr Piastucki <[email protected]> wrote: > On 02/20/2013 09:14 PM, Kai Willadsen wrote: >> This request has been around for a while now: >> >> https://bugzilla.gnome.org/show_bug.cgi?id=362233 >> >> Unfortunately, I have no real idea how difficult this would be to >> implement in Meld. There are basically two options: try and adjust >> FileDiff so that it can handle having two underlying comparisons >> (hard), or adjust the diff algorithm to have fixed sync points in its >> comparison (unknown difficulty, but probably not that easy). >> >> cheers, >> Kai >> > > Interesting idea. > Having fixed sync points in the diff algorithm does not seem to be that > hard to implement. > It would probably require a new matcher on top of the existing one that > would split the input > according to sync points, feed the underlying matcher with partial data > and combine the results. > Unless I missed something...
I think that sounds good, and is probably the easiest approach. I was actually thinking of modifying the algorithm to require the inclusion of the snake passing through the sync point. While that kind of approach should be workable in a naive LCS implementation, I can't see how we'd shoehorn that in to our current code. cheers, Kai _______________________________________________ meld-list mailing list [email protected] https://mail.gnome.org/mailman/listinfo/meld-list
