mirror of
https://github.com/rust-lang/rust.git
synced 2026-04-30 23:03:06 +03:00
6236882127
Incorporate distance limit from `find_best_match_for_name` directly into Levenshtein distance computation. Use the string size difference as a lower bound on the distance and exit early when it exceeds the specified limit. After finding a candidate within a limit, lower the limit further to restrict the search space.