Commit message (Collapse) | Author | Age | Files | Lines | ||
---|---|---|---|---|---|---|
... | ||||||
* | rename struct -> record, pos -> tuple | Aleksey Kladov | 2019-08-23 | 7 | -295/+295 | |
| | ||||||
* | make ast object safe | Aleksey Kladov | 2019-08-23 | 1 | -2/+10 | |
| | ||||||
* | Improve/fix type bound lowering | Florian Diebold | 2019-08-22 | 1 | -26/+29 | |
| | ||||||
* | Add `impl Trait` and `dyn Trait` types | Florian Diebold | 2019-08-22 | 2 | -1/+27 | |
| | | | | | | | - refactor bounds handling in the AST a bit - add HIR for bounds - add `Ty::Dyn` and `Ty::Opaque` variants and lower `dyn Trait` / `impl Trait` syntax to them | |||||
* | Don't add `?` bounds as real bounds | Aleksey Kladov | 2019-08-22 | 1 | -0/+12 | |
| | | | | closes #1709 | |||||
* | :arrow_up: rustc_lexer | Aleksey Kladov | 2019-08-20 | 2 | -116/+74 | |
| | ||||||
* | remove ast::*Kind enums | Aleksey Kladov | 2019-08-19 | 2 | -353/+347 | |
| | | | | With the new owned trees, we don't need an indirection here | |||||
* | use new quote-generated ast | Aleksey Kladov | 2019-08-18 | 2 | -1289/+1408 | |
| | ||||||
* | use quote! macro to generate grammar | Aleksey Kladov | 2019-08-18 | 1 | -27/+27 | |
| | | | | | 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 | 1 | -53/+53 | |
| | ||||||
* | Introduce separate hir::BinaryOp | Aleksey Kladov | 2019-08-17 | 1 | -6/+0 | |
| | | | | | 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 | |
| | ||||||
* | Lower fully qualified associated type paths | Florian Diebold | 2019-08-12 | 1 | -0/+10 | |
| | | | | I.e. `<T as Trait>::Foo`. | |||||
* | Move numeric names inside of `NameRef` | Aleksey Kladov | 2019-08-09 | 2 | -18/+20 | |
| | ||||||
* | 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 | |
| | ||||||
* | Add function parameters attributes | Evgenii P | 2019-08-07 | 2 | -0/+4 | |
| | ||||||
* | Unconditionally trim the end of comments | kjeremy | 2019-07-31 | 2 | -13/+5 | |
| | ||||||
* | Removes `*/` in block doc comments | kjeremy | 2019-07-31 | 2 | -2/+62 | |
| | ||||||
* | Add explicit newline preserving tests | kjeremy | 2019-07-31 | 1 | -0/+17 | |
| | ||||||
* | Merge #1604 | bors[bot] | 2019-07-29 | 1 | -3/+19 | |
|\ | | | | | | | | | | | | | | | 1604: Fix failing type interference for floating point literal r=matklad a=theotherphil Fixes https://github.com/rust-analyzer/rust-analyzer/issues/1592 Co-authored-by: Phil Ellison <[email protected]> | |||||
| * | cargo format | Phil Ellison | 2019-07-28 | 1 | -3/+1 | |
| | | ||||||
| * | Add special case for f32 and f43 suffices on Literal.kind | Phil Ellison | 2019-07-28 | 2 | -17/+21 | |
| | | ||||||
| * | Add issue link and trailing newline | Phil Ellison | 2019-07-28 | 1 | -1/+2 | |
| | | ||||||
| * | More direct failing test | Phil Ellison | 2019-07-28 | 1 | -0/+13 | |
| | | ||||||
* | | move syntax tests to unit tests | Aleksey Kladov | 2019-07-24 | 2 | -0/+103 | |
| | | ||||||
* | | switch to upstream unescape | Aleksey Kladov | 2019-07-24 | 2 | -525/+87 | |
|/ | ||||||
* | kill old lexer | Aleksey Kladov | 2019-07-22 | 6 | -571/+17 | |
| | ||||||
* | add rustc_lexer | Aleksey Kladov | 2019-07-22 | 1 | -4/+104 | |
| | ||||||
* | simiplify | Aleksey Kladov | 2019-07-21 | 2 | -11/+10 | |
| | ||||||
* | streamline API | Aleksey Kladov | 2019-07-21 | 3 | -17/+7 | |
| | ||||||
* | minor, move type | Aleksey Kladov | 2019-07-21 | 3 | -12/+13 | |
| | ||||||
* | switch to upstream rowan's API | Aleksey Kladov | 2019-07-20 | 7 | -679/+146 | |
| | ||||||
* | Merge #1566 | bors[bot] | 2019-07-20 | 1 | -13/+3 | |
|\ | | | | | | | | | | | | | | | 1566: align SyntaxText API with upstream r=matklad a=matklad Co-authored-by: Aleksey Kladov <[email protected]> | |||||
| * | align SyntaxText API with upstream | Aleksey Kladov | 2019-07-20 | 1 | -13/+3 | |
| | | ||||||
* | | Merge #1562 | bors[bot] | 2019-07-20 | 2 | -1/+34 | |
|\ \ | |/ |/| | | | | | | | | | | | | | 1562: Continue support for .await r=matklad a=unrealhoang - add await expr to ast and HIR Expr - infer type for `.await` Co-authored-by: Unreal Hoang <[email protected]> | |||||
| * | add await expr to ast | Unreal Hoang | 2019-07-20 | 2 | -1/+34 | |
| | | ||||||
* | | Merge #1560 | bors[bot] | 2019-07-20 | 10 | -68/+63 | |
|\ \ | |/ |/| | | | | | | | | | | | 1560: move debug_dump to fmt::Debug r=matklad a=matklad Co-authored-by: Aleksey Kladov <[email protected]> | |||||
| * | rename range -> text_range | Aleksey Kladov | 2019-07-20 | 10 | -29/+32 | |
| | | ||||||
| * | move debug_dump to fmt::Debug | Aleksey Kladov | 2019-07-20 | 5 | -40/+32 | |
| | | ||||||
* | | add await to syntax, parser for await_expr | Unreal Hoang | 2019-07-20 | 1 | -0/+2 | |
|/ | ||||||
* | remove lifetime from syntax node text | Aleksey Kladov | 2019-07-19 | 3 | -14/+15 | |
| | ||||||
* | sane indexing in text | Aleksey Kladov | 2019-07-19 | 1 | -7/+10 | |
| | ||||||
* | flip syntax text to use internal iteration | Aleksey Kladov | 2019-07-19 | 2 | -34/+65 | |
| | ||||||
* | drop memory size of subtree | Aleksey Kladov | 2019-07-19 | 1 | -4/+0 | |
| | | | | | it wasn't too accurate and the new measurement method of dropping the database completely is better anyway | |||||
* | convenience api | Aleksey Kladov | 2019-07-19 | 4 | -41/+55 | |
| | ||||||
* | cleanup casts | Aleksey Kladov | 2019-07-19 | 4 | -841/+964 | |
| | ||||||
* | several highlighting cleanups | Aleksey Kladov | 2019-07-19 | 1 | -0/+11 | |
| | | | | | | * make stuff more type-safe by using `BindPat` instead of just `Pat` * don't add `mut` into binding hash * reset shadow counter when we enter a function |