A balance may therefore be struck between comparison performance and the complexity of change-blocks for which optimal line-pairings are guaranteed to be found. These can often be the same as the optimal line pairings, but are not guaranteed to be so. For change-blocks above the threshold, Merge will use a more efficient algorithm that will endeavour to produce appropriate line pairings. Optimal line-pairings will be found for change-blocks of lower complexity than the threshold. This slider adjusts the threshold of change-block complexity above which Merge will no longer seek to determine optimal line-pairings between the left and right sides of the block. those consisting of thousands of lines on both the left and right), the effort required to compute optimal line-pairings can be considerable, and the performance of text comparisons can therefore be impaired. The computational effort required to find the best pairings between lines in a large block of changed text can be considered to be roughly proportional to the product of the number of lines on the left and right sides of the block. Move the slider further to the left if comparison performance is unacceptably slow for files containing very large change-blocks. Move this slider further to the right if your files tend to have very large blocks of changed text and Merge is not acceptably pairing lines within those large blocks. How much computational effort should be expended to pair lines in changes containing large numbers of similar (but non-identical) lines? Please see the entire Line Pairing topic for further information about line-pairing. The default settings should be suitable for most users and most files. The controls in this window enable advanced line-pairing options to be adjusted.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |