2009/1/24 Stephen Kennedy <[email protected]>: > As you say very large blocks are unlikely to be useful so I like the idea of a > simple hard limit on the length of block considered for inline highlighting.
Great - I've committed a modified version of my earlier patch. It's not ideal, but it should stop the 'hanging' without introducing obvious regressions. > Wouldn't block splitting be tricky because the blocks will not in general be > the > same length, and would require some heuristic to try to keep them matched? My thought was that the splitting could be very rough - just split every 5000 characters or so, and compare what you have. If sequence A is 8000 characters and B is 12000 characters, you get one comparison of 0:5000, one comparison of 5001:8000 to 5001:10000, and you just highlight the rest of B as changed. On the other hand, it's not immediately obvious that the complexity is worthwhile; other options like re-running a comparison *with* line breaks before doing the inline highlighting might be produce better results. Kai _______________________________________________ meld-list mailing list [email protected] http://mail.gnome.org/mailman/listinfo/meld-list
