Diff takes two texts and finds the differences. This implementation works on a character by character basis. The result of any diff may contain 'chaff', irrelevant small commonalities which complicate the output. A post-diff cleanup algorithm factors out these trivial commonalities.
Text Version 1: |
Text Version 2: |
seconds
If the mapping phase of the diff computation takes longer than this, then the computation
is truncated and the best solution to date is returned. While guaranteed to be correct,
it may not be optimal. A timeout of '0' allows for unlimited computation.