Skip to content

Commit

Permalink
Avoid ' in help message glitching book's md
Browse files Browse the repository at this point in the history
  • Loading branch information
radare committed Jul 11, 2024
1 parent ec4872e commit b8198f1
Show file tree
Hide file tree
Showing 4 changed files with 4 additions and 4 deletions.
2 changes: 1 addition & 1 deletion libr/main/radiff2.c
Original file line number Diff line number Diff line change
Expand Up @@ -457,7 +457,7 @@ static int show_help(int v) {
" -p use physical addressing (io.va=false) (only for radiff2 -AC)\n"
" -q quiet mode (disable colors, reduce output)\n"
" -r output in radare commands\n"
" -s compute edit distance (no substitution, Eugene W. Myers' O(ND) diff algorithm)\n"
" -s compute edit distance (no substitution, Eugene W. Myers O(ND) diff algorithm)\n"
" -ss compute Levenshtein edit distance (substitution is allowed, O(N^2))\n"
" -S [name] sort code diff (name, namelen, addr, size, type, dist) (only for -C or -g)\n"
" -t [0-100] set threshold for code diff (default is 70%%)\n"
Expand Down
2 changes: 1 addition & 1 deletion libr/util/udiff.c
Original file line number Diff line number Diff line change
Expand Up @@ -312,7 +312,7 @@ R_API int r_diff_buffers(RDiff *d, const ut8 *a, ut32 la, const ut8 *b, ut32 lb)
: r_diff_buffers_static (d, a, la, b, lb);
}

// Eugene W. Myers' O(ND) diff algorithm
// Eugene W. Myers O(ND) diff algorithm
// Returns edit distance with costs: insertion=1, deletion=1, no substitution
R_API bool r_diff_buffers_distance_myers(RDiff *diff, const ut8 *a, ut32 la, const ut8 *b, ut32 lb, ut32 *distance, double *similarity) {
r_return_val_if_fail (a && b, false);
Expand Down
2 changes: 1 addition & 1 deletion man/radiff2.1
Original file line number Diff line number Diff line change
Expand Up @@ -73,7 +73,7 @@ Quiet mode (disable colors, reduce output).
Output in radare commands.
.TP
.B -s
Compute edit distance (no substitution, Eugene W. Myers' O(ND) diff algorithm).
Compute edit distance (no substitution, Eugene W. Myers O(ND) diff algorithm).
.TP
.B -ss
Compute Levenshtein edit distance (substitution is allowed, O(N^2)).
Expand Down
2 changes: 1 addition & 1 deletion test/unit/test_diff.c
Original file line number Diff line number Diff line change
Expand Up @@ -40,7 +40,7 @@ bool test_r_diff_buffers_distance(void) {
mu_assert_eq (distance, tests[i].dis_distance, msg);
}

// Eugene W. Myers' O(ND) diff algorithm, deletion/insertion edit distance
// Eugene W. Myers O(ND) diff algorithm, deletion/insertion edit distance
diff->type = 'm';
for (i = 0; tests[i].a; i++) {
size_t la = strlen ((const char *)tests[i].a), lb = strlen ((const char *)tests[i].b);
Expand Down

0 comments on commit b8198f1

Please sign in to comment.