Tomasz Miąsko 6236882127 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.		2022-01-26 12:38:22 +01:00
..
attr_wrapper.rs	Change more x64 size checks to not apply to x32.	2021-09-05 16:42:36 +01:00
attr.rs	Do not add ; to expected tokens list when it's wrong	2021-12-04 11:05:30 -07:00
diagnostics.rs	delay the bug once again, generalize turbofish suggestion	2022-01-25 11:11:13 -08:00
expr.rs	delay the bug once again, generalize turbofish suggestion	2022-01-25 11:11:13 -08:00
generics.rs	remove feature gate and cleanup code	2021-12-10 19:20:31 +00:00
item.rs	Introduce a limit to Levenshtein distance computation	2022-01-26 12:38:22 +01:00
mod.rs	Do not add ; to expected tokens list when it's wrong	2021-12-04 11:05:30 -07:00
nonterminal.rs	Use if-let guards in the codebase	2021-08-25 20:24:35 +02:00
pat.rs	review comments: clean up	2021-11-29 18:39:08 +00:00
path.rs	Rollup merge of #91150 - dtolnay:qpath, r=davidtwco	2022-01-18 22:00:43 +01:00
stmt.rs	Do not add ; to expected tokens list when it's wrong	2021-12-04 11:05:30 -07:00
ty.rs	Parse Ty? as Option<Ty> and provide structured suggestion	2022-01-14 00:07:23 +00:00