mirror of
https://github.com/rust-lang/rust.git
synced 2025-10-31 21:16:44 +00:00
dfd9e5e3fa
Based on https://github.com/rust-lang/rust/pull/108200, for the same rationale. > This replaces the existing Levenshtein algorithm with the > Damerau-Levenshtein algorithm. This means that "ab" to "ba" is one change > (a transposition) instead of two (a deletion and insertion). More > specifically, this is a restricted implementation, in that "ca" to "abc" > cannot be performed as "ca" → "ac" → "abc", as there is an insertion in the > middle of a transposition. I believe that errors like that are sufficiently > rare that it's not worth taking into account. Before this change, searching `prinltn!` listed `print!` first, followed by `println!`. With this change, `println!` matches more closely.
13 lines
252 B
JavaScript
13 lines
252 B
JavaScript
// exact-check
|
|
|
|
const QUERY = 'prinltn';
|
|
const FILTER_CRATE = 'std';
|
|
|
|
const EXPECTED = {
|
|
'others': [
|
|
{ 'path': 'std', 'name': 'println' },
|
|
{ 'path': 'std', 'name': 'print' },
|
|
{ 'path': 'std', 'name': 'eprintln' },
|
|
],
|
|
};
|