You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
I would like an algorithm tolerant of garbage at the beginning of lines (typical assembler listing with line/address numbering)
The following two pieces of code show the problem when compared:
1 mov
2 add
3 mul
4 div
1 mov
2 sub
3 add
4 mul
5 div
The text was updated successfully, but these errors were encountered:
It would be nice to have choice of algorithm used.
For examples diff uses 4 of them: Myers, Minimal, Patience, Histogram
https://luppeng.wordpress.com/2020/10/10/when-to-use-each-of-the-git-diff-algorithms/
I would like an algorithm tolerant of garbage at the beginning of lines (typical assembler listing with line/address numbering)
The following two pieces of code show the problem when compared:
The text was updated successfully, but these errors were encountered: