mirror of
https://github.com/rust-lang/rust.git
synced 2024-11-29 10:13:54 +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. |
||
|---|---|---|
| .. | ||
| alias-1.js | ||
| alias-2.js | ||
| alias-3.js | ||
| alias-4.js | ||
| alias.js | ||
| asrawfd.js | ||
| basic.js | ||
| deduplication.js | ||
| enum-option.js | ||
| filter-crate.js | ||
| fn-forget.js | ||
| from_u.js | ||
| keyword.js | ||
| macro-check.js | ||
| macro-print.js | ||
| never.js | ||
| option-type-signatures.js | ||
| parser-errors.js | ||
| parser-filter.js | ||
| parser-generics.js | ||
| parser-ident.js | ||
| parser-literal.js | ||
| parser-paths.js | ||
| parser-quote.js | ||
| parser-returned.js | ||
| parser-separators.js | ||
| parser-weird-queries.js | ||
| path-ordering.js | ||
| primitive.js | ||
| println-typo.js | ||
| quoted.js | ||
| reference-shrink.js | ||
| regex.js | ||
| return-specific-literal.js | ||
| return-specific.js | ||
| should-fail.js | ||
| string-from_ut.js | ||
| struct-vec.js | ||
| typed-query.js | ||
| vec-new.js | ||