mirror of
https://github.com/rust-lang/rust.git
synced 2025-11-01 13:34:38 +00:00
6caa533dc7
Introduce a limit to Levenshtein distance computation 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.
For high-level intro to how type checking works in rustc, see the type checking chapter of the rustc dev guide.