Commit message (Collapse) | Author | Age | Files | Lines | ||
---|---|---|---|---|---|---|
... | ||||||
| * | | Bump chalk and replace TypeFamily with Interner | Laurențiu Nicola | 2020-02-24 | 3 | -59/+68 | |
| | | | ||||||
* | | | Replace generic with a concrete type | Aleksey Kladov | 2020-02-25 | 2 | -13/+14 | |
| | | | ||||||
* | | | Add docs | Jeremy Kolb | 2020-02-25 | 1 | -0/+8 | |
| | | | ||||||
* | | | Teach the server about Semantic Tokens proposed LSP | kjeremy | 2020-02-25 | 9 | -40/+239 | |
|/ / | ||||||
* | | When joining lines, unwrap trivial diverging blocks | Aleksey Kladov | 2020-02-24 | 2 | -8/+53 | |
| | | ||||||
* | | Omit type hints for enum variant bind pats | Kirill Bulatov | 2020-02-24 | 1 | -92/+125 | |
|/ | ||||||
* | Add suggestion for failed path resolution | Yoshua Wuyts | 2020-02-23 | 1 | -1/+1 | |
| | | | | This adds https://github.com/rust-analyzer/rust-analyzer/issues/3245 as an inline help text for when path resolution fails. | |||||
* | Style fixes | Kirill Bulatov | 2020-02-23 | 1 | -3/+4 | |
| | ||||||
* | Add basic parameter name hints heuristics | Kirill Bulatov | 2020-02-23 | 2 | -41/+187 | |
| | ||||||
* | Fix the tests | Kirill Bulatov | 2020-02-22 | 1 | -5/+105 | |
| | ||||||
* | Show more parameter name hints | Kirill Bulatov | 2020-02-22 | 1 | -27/+34 | |
| | ||||||
* | Simplify inlay hints processing | Kirill Bulatov | 2020-02-22 | 1 | -103/+35 | |
| | ||||||
* | Simplify | Aleksey Kladov | 2020-02-22 | 4 | -171/+58 | |
| | ||||||
* | Merge #3272 | bors[bot] | 2020-02-22 | 1 | -5/+2 | |
|\ | | | | | | | | | | | | | | | 3272: ra_db: removed a couple of explicit lifetimes r=matklad a=Veetaha Co-authored-by: Veetaha <[email protected]> | |||||
| * | ra_db: removed a couple of explicit lifetimes | Veetaha | 2020-02-22 | 1 | -5/+2 | |
| | | ||||||
* | | Merge #3263 | bors[bot] | 2020-02-22 | 10 | -261/+480 | |
|\ \ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 3263: Implement unsizing coercions using Chalk r=matklad a=flodiebold These are coercions like `&[T; n] -> &[T]`, which are handled by the `Unsize` and `CoerceUnsized` traits. The impls for `Unsize` are all built in to the compiler and require special handling, so we need to provide them to Chalk. This adds the following `Unsize` impls: - `Unsize<[T]> for [T; _]` - `Unsize<dyn Trait> for T where T: Trait` - `Unsize<dyn SuperTrait> for dyn SubTrait` Hence we are still missing the 'unsizing the last field of a generic struct' case. Co-authored-by: Florian Diebold <[email protected]> Co-authored-by: Florian Diebold <[email protected]> | |||||
| * | | Shorten some code | Florian Diebold | 2020-02-22 | 1 | -4/+1 | |
| | | | ||||||
| * | | Rework find_super_trait_path to protect against cycles | Florian Diebold | 2020-02-22 | 5 | -23/+74 | |
| | | | ||||||
| * | | Fix shift_bound_vars | Florian Diebold | 2020-02-22 | 1 | -3/+3 | |
| | | | | | | | | | | | | It should only shift free vars (maybe the name isn't the best...) | |||||
| * | | Fix wrong handling of bare `dyn Trait` exposed by canonicalizer fix | Florian Diebold | 2020-02-22 | 1 | -1/+3 | |
| | | | | | | | | | | | | | | | The self type in the `dyn Trait` trait ref should always be ^0, but we didn't put that in there in the bare case. | |||||
| * | | Add &dyn Trait -> &dyn SuperTrait coercion, and fix &T -> &dyn Trait | Florian Diebold | 2020-02-22 | 4 | -44/+132 | |
| | | | ||||||
| * | | Fix handling of binders in canonicalization | Florian Diebold | 2020-02-22 | 1 | -64/+35 | |
| | | | | | | | | | | | | I'm looking forward to getting rid of this in favor of Chalk's implementation. | |||||
| * | | Implement dyn Trait unsizing as well | Florian Diebold | 2020-02-22 | 5 | -9/+136 | |
| | | | ||||||
| * | | Implement unsize coercion using proper trait solving | Florian Diebold | 2020-02-22 | 5 | -187/+170 | |
| |/ | ||||||
* | | Fix dat comment | Veetaha | 2020-02-22 | 1 | -1/+1 | |
| | | ||||||
* | | Merge #3260 | bors[bot] | 2020-02-22 | 5 | -68/+55 | |
|\ \ | | | | | | | | | | | | | | | | | | | | | | 3260: Refactor how builtins are resolved r=matklad a=flodiebold This fixes autocompletion suggesting e.g. `self::usize`. (I thought we had a bug for that, but I didn't find it.) Co-authored-by: Florian Diebold <[email protected]> | |||||
| * | | Refactor how builtins are resolved | Florian Diebold | 2020-02-21 | 5 | -68/+55 | |
| | | | | | | | | | | | | This fixes autocompletion suggesting e.g. self::usize. | |||||
* | | | ra_mbe: Remove explicit type annotation | Veetaha | 2020-02-22 | 1 | -1/+1 | |
| | | | ||||||
* | | | ra_mbe: added test for malformed token in macro invokation | Veetaha | 2020-02-22 | 1 | -3/+21 | |
| | | | | | | | | | | | | | | | There was a panic where lexer returned None on malformed tokens. But now we just ignore tokenization errors in mbe. | |||||
* | | | ra_mbe: convert_literal now works with malformed tokens | Veetaha | 2020-02-22 | 1 | -2/+3 | |
| |/ |/| | ||||||
* | | Merge #3262 | bors[bot] | 2020-02-22 | 5 | -6/+85 | |
|\ \ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 3262: Fix handling of const patterns r=matklad a=flodiebold E.g. in `match x { None => ... }`, `None` is a path pattern (resolving to the option variant), not a binding. To determine this, we need to try to resolve the name during lowering. This isn't too hard since we already need to resolve names for macro expansion anyway (though maybe a bit hacky). Fixes #1618. Co-authored-by: Florian Diebold <[email protected]> | |||||
| * | | Fix handling of const patterns | Florian Diebold | 2020-02-21 | 5 | -6/+85 | |
| |/ | | | | | | | | | | | | | | | | | E.g. in `match x { None => ... }`, `None` is a path pattern (resolving to the option variant), not a binding. To determine this, we need to try to resolve the name during lowering. This isn't too hard since we already need to resolve names for macro expansion anyway (though maybe a bit hacky). Fixes #1618. | |||||
* | | remove unneeded `collect` | adamrk | 2020-02-21 | 1 | -11/+7 | |
| | | ||||||
* | | use Vec::extend instead of Vec::push in loop | Adam Bratschi-Kaye | 2020-02-21 | 1 | -3/+1 | |
| | | | | | | | | Co-Authored-By: Laurențiu Nicola <[email protected]> | |||||
* | | rename module references | adamrk | 2020-02-21 | 1 | -0/+112 | |
|/ | ||||||
* | Normalize associated types in types coming from Chalk | Florian Diebold | 2020-02-21 | 2 | -1/+46 | |
| | | | | Fixes #3232. | |||||
* | Remove unused placeholder | Edwin Cheng | 2020-02-21 | 1 | -1/+1 | |
| | ||||||
* | Improve server version info | Edwin Cheng | 2020-02-21 | 1 | -1/+29 | |
| | ||||||
* | Better errorse | Aleksey Kladov | 2020-02-20 | 1 | -2/+2 | |
| | ||||||
* | Fix off by one in onEnter | Laurențiu Nicola | 2020-02-20 | 1 | -1/+14 | |
| | ||||||
* | Merge #3215 | bors[bot] | 2020-02-19 | 2 | -6/+34 | |
|\ | | | | | | | | | | | | | | | | | | | 3215: Exclude methods from non-parameter types introduced by generic constraints r=flodiebold a=lnicola Fixes #3184. r? @flodiebold Co-authored-by: Laurențiu Nicola <[email protected]> | |||||
| * | Exclude methods from non-parameter types introduced by generic constraints | Laurențiu Nicola | 2020-02-19 | 2 | -6/+34 | |
| | | ||||||
* | | Fill missing fields of enum variants | Aleksey Kladov | 2020-02-19 | 2 | -7/+40 | |
| | | ||||||
* | | Merge pull request #3239 from matklad/opt-backtrace | Aleksey Kladov | 2020-02-19 | 2 | -1/+2 | |
|\ \ | | | | | | | Make backtrace optional | |||||
| * | | Make backtrace optional | Aleksey Kladov | 2020-02-19 | 2 | -1/+2 | |
| | | | ||||||
* | | | Bump lsp-types | kjeremy | 2020-02-19 | 1 | -0/+1 | |
|/ / | ||||||
* | | Merge #3236 | bors[bot] | 2020-02-19 | 8 | -119/+91 | |
|\ \ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 3236: Merge NameDefinition and NameKind r=matklad a=matklad bors r+ 🤖 Co-authored-by: Aleksey Kladov <[email protected]> | |||||
| * | | Merge NameDefinition and NameKind | Aleksey Kladov | 2020-02-19 | 8 | -119/+91 | |
| | | | ||||||
* | | | Merge #3235 | bors[bot] | 2020-02-19 | 3 | -53/+55 | |
|\| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 3235: Derive visibility as well r=matklad a=matklad bors r+ 🤖 Co-authored-by: Aleksey Kladov <[email protected]> | |||||
| * | | Derive visibility as well | Aleksey Kladov | 2020-02-19 | 3 | -53/+55 | |
| | | |