aboutsummaryrefslogtreecommitdiff
path: root/crates
Commit message (Collapse)AuthorAgeFilesLines
...
| * don't load sysroot in most heavy testsAleksey Kladov2019-08-197-17/+42
| |
* | Merge #1702bors[bot]2019-08-192-7/+33
|\ \ | |/ |/| | | | | | | | | | | 1702: replace heck with just ascii transformation r=matklad a=matklad Co-authored-by: Aleksey Kladov <[email protected]>
| * replace heck with just ascii transformationAleksey Kladov2019-08-192-7/+33
| |
* | qualify ast types with `ast::`Aleksey Kladov2019-08-191-11/+8
|/ | | | | By convention, ast nodes should always be used as `ast::FnDef`. This is to avoid confusion with similarly-named hir types.
* remove ast::*Kind from ra_ide_apiAleksey Kladov2019-08-195-21/+19
|
* remove ast::*Kind enums from assistsAleksey Kladov2019-08-195-45/+45
|
* remove ast::*Kind from hirAleksey Kladov2019-08-196-83/+86
|
* remove ast::*Kind enumsAleksey Kladov2019-08-193-390/+397
| | | | With the new owned trees, we don't need an indirection here
* use derive(Debug) for SyntaxKindAleksey Kladov2019-08-193-284/+10
|
* plug new boilerplate_gen into ra_toolsAleksey Kladov2019-08-195-24/+26
|
* rename codegen -> boilerplate_genAleksey Kladov2019-08-192-3/+3
|
* drop tera dependencyAleksey Kladov2019-08-192-4/+25
|
* use new quote-generated syntax kindsAleksey Kladov2019-08-192-577/+538
|
* use quote! to generate syntax kindsAleksey Kladov2019-08-192-1/+147
|
* use new quote-generated astAleksey Kladov2019-08-183-1290/+1410
|
* use quote! macro to generate grammarAleksey Kladov2019-08-183-40/+180
| | | | | We already use syn&quote elsewhere (transitively), so it make sense to cut down on the number of technologies and get rid of tera
* deserialize grammarAleksey Kladov2019-08-183-56/+87
|
* switch to new codegenAleksey Kladov2019-08-183-14/+20
|
* codegen boilerplateAleksey Kladov2019-08-182-0/+8
|
* add quote depAleksey Kladov2019-08-183-0/+4
|
* update lspAleksey Kladov2019-08-174-7/+3
|
* implement initial type inference for index expressionsAleksey Kladov2019-08-173-1/+33
|
* normalize ordering opsAleksey Kladov2019-08-172-26/+36
|
* Introduce separate hir::BinaryOpAleksey Kladov2019-08-174-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 IndexExprAleksey Kladov2019-08-171-0/+9
|
* simplifyAleksey Kladov2019-08-171-35/+36
|
* Remove cpuprofile dependenciesAleksey Kladov2019-08-174-13/+63
|
* :arrow_up: depsAleksey Kladov2019-08-171-1/+1
|
* Merge #1691bors[bot]2019-08-162-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 enumsEkaterina Babshukova2019-08-162-2/+44
| |
* | implement durabilityAleksey Kladov2019-08-158-27/+82
| |
* | switch from volatile to untracked readAleksey Kladov2019-08-152-22/+41
| |
* | Merge #1685bors[bot]2019-08-155-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 positionbravomikekilo2019-08-146-118/+130
| | |
| * | fix testbravomikekilo2019-08-141-2/+2
| | |
| * | fix error of RangeFrom in for-loopbravomikekilo2019-08-143-1/+130
| | |
* | | Merge #1676bors[bot]2019-08-1410-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 usagesEvgenii P2019-08-138-13/+17
| | |
| * | Fix for<'lifetime> for types specified by pathEvgenii P2019-08-113-2/+85
| | |
* | | Merge #1636bors[bot]2019-08-133-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 testbravomikekilo2019-08-133-0/+75
| | |
| * | fix block parse problembravomikekilo2019-08-031-7/+6
| | |
* | | Handle placeholder assoc types when Chalk produces themFlorian Diebold2019-08-122-3/+67
| | |
* | | Normalize assoc types in more placesFlorian Diebold2019-08-122-12/+27
| | |
* | | Improve debug logging a bitFlorian Diebold2019-08-122-4/+18
| | |
* | | Normalize associated types during inferenceFlorian Diebold2019-08-123-9/+25
| | |
* | | Lower fully qualified associated type pathsFlorian Diebold2019-08-125-23/+128
| | | | | | | | | | | | I.e. `<T as Trait>::Foo`.
* | | Add representations of associated typesFlorian Diebold2019-08-123-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 resolutionFlorian Diebold2019-08-121-6/+46
| | |
* | | Use Source in Diagnostic and implementEvgenii P2019-08-122-24/+16
| | |
generated by cgit v1.2.3 (git 2.25.1) at 2024-11-27 22:20:59 +0000