| Age | Commit message (Collapse) | Author | Lines | |
|---|---|---|---|---|
| 2021-08-30 | Handle let-else initializer edge case errors | Cameron Steffen | -0/+27 | |
| 2021-07-30 | Add warning when whitespace is not skipped after an escaped newline. | Anton Golov | -4/+20 | |
| 2021-07-08 | Rework SESSION_GLOBALS API to prevent overwriting it | Guillaume Gomez | -5/+5 | |
| 2021-01-16 | Remove unnecessary manual shrink_to_fit calls | Dániel Buga | -3/+0 | |
| 2021-01-09 | ast: Remove some indirection layers from values in key-value attributes | Vadim Petrochenkov | -5/+4 | |
| 2020-12-28 | Rollup merge of #80344 - matthiaskrgr:matches, r=Dylan-DPC | Dylan DPC | -13/+11 | |
| use matches!() macro in more places | ||||
| 2020-12-24 | use matches!() macro in more places | Matthias Krüger | -13/+11 | |
| 2020-12-22 | Rework beautify_doc_string so that it returns a Symbol instead of a String | Guillaume Gomez | -35/+37 | |
| 2020-11-24 | Move lev_distance to rustc_ast, make non-generic | Arlie Davis | -168/+0 | |
| rustc_ast currently has a few dependencies on rustc_lexer. Ideally, an AST would not have any dependency its lexer, for minimizing unnecessarily design-time dependencies. Breaking this dependency would also have practical benefits, since modifying rustc_lexer would not trigger a rebuild of rustc_ast. This commit does not remove the rustc_ast --> rustc_lexer dependency, but it does remove one of the sources of this dependency, which is the code that handles fuzzy matching between symbol names for making suggestions in diagnostics. Since that code depends only on Symbol, it is easy to move it to rustc_span. It might even be best to move it to a separate crate, since other tools such as Cargo use the same algorithm, and have simply contain a duplicate of the code. This changes the signature of find_best_match_for_name so that it is no longer generic over its input. I checked the optimized binaries, and this function was duplicated at nearly every call site, because most call sites used short-lived iterator chains, generic over Map and such. But there's no good reason for a function like this to be generic, since all it does is immediately convert the generic input (the Iterator impl) to a concrete Vec<Symbol>. This has all of the costs of generics (duplicated method bodies) with no benefit. Changing find_best_match_for_name to be non-generic removed about 10KB of code from the optimized binary. I know it's a drop in the bucket, but we have to start reducing binary size, and beginning to tame over-use of generics is part of that. | ||||
| 2020-10-18 | Auto merge of #78066 - bugadani:wat, r=jonas-schievink | bors | -1/+1 | |
| Clean up small, surprising bits of code This PR clean up a small number of unrelated, small things I found while browsing the code base. | ||||
| 2020-10-18 | No need to map the max_distance | Dániel Buga | -1/+1 | |
| 2020-10-16 | Parse inline const expressions | Santiago Pastorino | -0/+2 | |
| 2020-10-14 | Remove unused code from rustc_ast | est31 | -1/+0 | |
| 2020-10-04 | Remove extra indirection in LitKind::ByteStr | Robin Schoonover | -3/+2 | |
| 2020-09-10 | use sort_unstable to sort primitive types | Matthias Krüger | -1/+2 | |
| It's not important to retain original order if we have &[1, 1, 2, 3] for example. clippy::stable_sort_primitive | ||||
| 2020-08-30 | mv compiler to compiler/ | mark | -0/+1180 | |
