Expand description
Find the differences of two sequences.
A diff function that finds the longest common subsequence (LCS). The output can easily be transformed to a shortest edit script (SES).
The implementation is base on the difference algorithm by Eugene W. Myers.
Structs§
- Shortest
Trace - The shortest trace found in the edit space.
Enums§
- Diff
- A subsequence that is present in either of two sequences or in both.
Functions§
- diff
- Find the common subsequences and differences between two slices.
- diff_
str - Find the common subsequences and differences between two strings.
- max_
sequence_ length - Max length of the sequences that is supported.