Split a string on "\n" while preserving them. The output can be used as input for UnifiedDiff and ContextDiff structures.

Like WriteContextDiff but returns the diff a string.

Return list of 5-tuples describing how to turn a into b. Each tuple is of the form (tag, i1, i2, j1, j2). The first tuple has i1 == j1 == 0, and rem

Like WriteUnifiedDiff but returns the diff a string.

Return a measure of the sequences' similarity (float in [0,1]). Where T is the total number of elements in both sequences, and M is the number of mat

Isolate change clusters by eliminating ranges with no changes. Return a generator of groups with up to n lines of context. Each group is in the same

Return list of triples describing matching subsequences. Each triple is of the form (i, j, n), and means that a[i:i+n] == b[j:j+n]. The triples are

Return an upper bound on ratio() relatively quickly. This isn't defined beyond that it is an upper bound on .Ratio(), and is faster to compute.

Return an upper bound on ratio() very quickly. This isn't defined beyond that it is an upper bound on .Ratio(), and is faster to compute than either

Set two sequences to be compared.

Convert range to the "ed" format.

Convert range to the "ed" format

Set the first sequence to be compared. The second sequence to be compared is not changed. SequenceMatcher computes and caches detailed information ab

Set the second sequence to be compared. The first sequence to be compared is not changed.

Compare two sequences of lines; generate the delta as a context diff. Context diffs are a compact way of showing line changes and a few lines of cont

Compare two sequences of lines; generate the delta as a unified diff. Unified diffs are a compact way of showing line changes and a few lines of cont

Find longest matching block in a[alo:ahi] and b[blo:bhi]. If IsJunk is not defined: Return (i,j,k) such that a[i:i+k] is equal to b[j:j+k], where al