Commit message (Collapse) | Author | Age | Files | Lines | |
---|---|---|---|---|---|
* | use new quote-generated ast | Aleksey Kladov | 2019-08-18 | 3 | -1290/+1410 |
| | |||||
* | use quote! macro to generate grammar | Aleksey Kladov | 2019-08-18 | 3 | -40/+180 |
| | | | | | We already use syn"e elsewhere (transitively), so it make sense to cut down on the number of technologies and get rid of tera | ||||
* | deserialize grammar | Aleksey Kladov | 2019-08-18 | 3 | -56/+87 |
| | |||||
* | switch to new codegen | Aleksey Kladov | 2019-08-18 | 3 | -14/+20 |
| | |||||
* | codegen boilerplate | Aleksey Kladov | 2019-08-18 | 2 | -0/+8 |
| | |||||
* | add quote dep | Aleksey Kladov | 2019-08-18 | 3 | -0/+4 |
| | |||||
* | update lsp | Aleksey Kladov | 2019-08-17 | 4 | -7/+3 |
| | |||||
* | implement initial type inference for index expressions | Aleksey Kladov | 2019-08-17 | 3 | -1/+33 |
| | |||||
* | normalize ordering ops | Aleksey Kladov | 2019-08-17 | 2 | -26/+36 |
| | |||||
* | Introduce separate hir::BinaryOp | Aleksey Kladov | 2019-08-17 | 4 | -75/+96 |
| | | | | | Unlike ast::BinOp, it has significantly more structure to it, so it's easier to, say, handle all assignment-like operations in the same way. | ||||
* | implement accessors for IndexExpr | Aleksey Kladov | 2019-08-17 | 1 | -0/+9 |
| | |||||
* | simplify | Aleksey Kladov | 2019-08-17 | 1 | -35/+36 |
| | |||||
* | Remove cpuprofile dependencies | Aleksey Kladov | 2019-08-17 | 4 | -13/+63 |
| | |||||
* | :arrow_up: deps | Aleksey Kladov | 2019-08-17 | 1 | -1/+1 |
| | |||||
* | Merge #1691 | bors[bot] | 2019-08-16 | 2 | -2/+44 |
|\ | | | | | | | | | | | | | | | 1691: Show inherent and trait impls of structs and enums r=viorina a=viorina Co-authored-by: Ekaterina Babshukova <[email protected]> | ||||
| * | show inherent and trait impls of structs and enums | Ekaterina Babshukova | 2019-08-16 | 2 | -2/+44 |
| | | |||||
* | | implement durability | Aleksey Kladov | 2019-08-15 | 8 | -27/+82 |
| | | |||||
* | | switch from volatile to untracked read | Aleksey Kladov | 2019-08-15 | 2 | -22/+41 |
| | | |||||
* | | Merge #1685 | bors[bot] | 2019-08-15 | 5 | -1/+142 |
|\ \ | | | | | | | | | | | | | | | | | | | | | | 1685: fix error of RangeFrom in for-loop r=DJMcNab a=bravomikekilo fix [issue-1542](https://github.com/rust-analyzer/rust-analyzer/issues/1542) @matklad Co-authored-by: bravomikekilo <[email protected]> | ||||
| * | | fix test position | bravomikekilo | 2019-08-14 | 6 | -118/+130 |
| | | | |||||
| * | | fix test | bravomikekilo | 2019-08-14 | 1 | -2/+2 |
| | | | |||||
| * | | fix error of RangeFrom in for-loop | bravomikekilo | 2019-08-14 | 3 | -1/+130 |
| | | | |||||
* | | | Merge #1676 | bors[bot] | 2019-08-14 | 10 | -13/+100 |
|\ \ \ | |/ / |/| | | | | | | | | | | | | | | | | | 1676: Fix for<'lifetime> for types specified by path r=matklad a=eupn Fixes #1467. Co-authored-by: Evgenii P <[email protected]> | ||||
| * | | Fix is_path_start to accept T![<], fix is_path_start usages | Evgenii P | 2019-08-13 | 8 | -13/+17 |
| | | | |||||
| * | | Fix for<'lifetime> for types specified by path | Evgenii P | 2019-08-11 | 3 | -2/+85 |
| | | | |||||
* | | | Merge #1636 | bors[bot] | 2019-08-13 | 3 | -7/+81 |
|\ \ \ | |_|/ |/| | | | | | | | | | | | | | | | | | 1636: fix block parse problem r=matklad a=bravomikekilo try to fix [issue-1598](https://github.com/rust-analyzer/rust-analyzer/issues/1598). Co-authored-by: bravomikekilo <[email protected]> | ||||
| * | | add inline test | bravomikekilo | 2019-08-13 | 3 | -0/+75 |
| | | | |||||
| * | | fix block parse problem | bravomikekilo | 2019-08-03 | 1 | -7/+6 |
| | | | |||||
* | | | Handle placeholder assoc types when Chalk produces them | Florian Diebold | 2019-08-12 | 2 | -3/+67 |
| | | | |||||
* | | | Normalize assoc types in more places | Florian Diebold | 2019-08-12 | 2 | -12/+27 |
| | | | |||||
* | | | Improve debug logging a bit | Florian Diebold | 2019-08-12 | 2 | -4/+18 |
| | | | |||||
* | | | Normalize associated types during inference | Florian Diebold | 2019-08-12 | 3 | -9/+25 |
| | | | |||||
* | | | Lower fully qualified associated type paths | Florian Diebold | 2019-08-12 | 5 | -23/+128 |
| | | | | | | | | | | | | I.e. `<T as Trait>::Foo`. | ||||
* | | | Add representations of associated types | Florian Diebold | 2019-08-12 | 3 | -0/+113 |
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | This adds three different representations, copied from the Chalk model: - `Ty::Projection` is an associated type projection written somewhere in the code, like `<Foo as Trait>::Bar`. - `Ty::UnselectedProjection` is similar, but we don't know the trait yet (`Foo::Bar`). - The above representations are normalized to their actual types during type inference. When that isn't possible, for example for `T::Item` inside an `fn foo<T: Iterator>`, the type is normalized to an application type with `TypeCtor::AssociatedType`. | ||||
* | | | Add another test for assoc type resolution | Florian Diebold | 2019-08-12 | 1 | -6/+46 |
| | | | |||||
* | | | Use Source in Diagnostic and implement | Evgenii P | 2019-08-12 | 2 | -24/+16 |
| | | | |||||
* | | | Drop support for old extendSelection API | Aleksey Kladov | 2019-08-12 | 3 | -44/+1 |
| | | | | | | | | | | | | | | | | | | Emacs now handles this via native LSP request https://github.com/emacs-lsp/lsp-mode/commit/dc86bbb227147aa8141e690ad5648fdbd2ebdb9f | ||||
* | | | Always set the runnable name | Kirill Bulatov | 2019-08-09 | 1 | -11/+11 |
| | | | |||||
* | | | Extract common logic | Kirill Bulatov | 2019-08-09 | 1 | -55/+42 |
| | | | |||||
* | | | Show backtraces in lens runnables | Kirill Bulatov | 2019-08-09 | 1 | -1/+5 |
| |/ |/| | |||||
* | | Move numeric names inside of `NameRef` | Aleksey Kladov | 2019-08-09 | 10 | -37/+52 |
| | | |||||
* | | Make name_ref to accept numeric names optionally | Evgenii P | 2019-08-09 | 5 | -9/+9 |
| | | |||||
* | | Parse tuple struct field initialization | Evgenii P | 2019-08-09 | 4 | -8/+31 |
| | | |||||
* | | Change macro to function | Evgenii P | 2019-08-09 | 1 | -15/+13 |
| | | |||||
* | | rustfmt | Evgenii P | 2019-08-09 | 1 | -10/+10 |
| | | |||||
* | | Reduce code duplication in lexer by introducing small macro | Evgenii P | 2019-08-09 | 1 | -20/+17 |
| | | |||||
* | | Merge #1661 | bors[bot] | 2019-08-08 | 9 | -1/+571 |
|\ \ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 1661: Parse function parameters attributes r=matklad a=eupn Fixes #1397. The [RFC-2565](https://github.com/rust-lang/rfcs/blob/master/text/2565-formal-function-parameter-attributes.md) specifies `#[attributes]` to function parameters: ```rust fn foo(#[attr] a, #[unused] b, #[must_use] ...) { // ... } ``` This PR adds those attributes into grammar and to the parser, extending corresponding inline tests. Co-authored-by: Evgenii P <[email protected]> | ||||
| * | | Fix parser tests according to review | Evgenii P | 2019-08-08 | 19 | -498/+580 |
| | | | |||||
| * | | Deduplicate while loop break condition | Evgenii P | 2019-08-08 | 1 | -2/+2 |
| | | | |||||
| * | | Fix parser to correctly consume outer attrs before ellipsis param | Evgenii P | 2019-08-07 | 1 | -0/+4 |
| | | |