Commit message (Collapse) | Author | Age | Files | Lines | ||
---|---|---|---|---|---|---|
... | ||||||
* | uncopypaste def sources | Aleksey Kladov | 2019-01-11 | 3 | -40/+26 | |
| | ||||||
* | add missing def kinds | Aleksey Kladov | 2019-01-11 | 1 | -0/+20 | |
| | ||||||
* | rename TreePtr -> TreeArc | Aleksey Kladov | 2019-01-11 | 8 | -30/+30 | |
| | | | | This is much clearer about the semantics | |||||
* | envapsulate navigation target better | Aleksey Kladov | 2019-01-11 | 3 | -2/+4 | |
| | ||||||
* | Use name resolution for goto definition | Florian Diebold | 2019-01-10 | 4 | -12/+70 | |
| | ||||||
* | Merge #470 | bors[bot] | 2019-01-10 | 10 | -38/+195 | |
|\ | | | | | | | | | | | | | | | | | | | 470: Type inference for enum variants r=flodiebold a=marcusklaas Opened a new PR instead of https://github.com/rust-analyzer/rust-analyzer/pull/461. Totally botched that one. I think I resolved all the issues mentioned there. Co-authored-by: Marcus Klaas de Vries <[email protected]> | |||||
| * | Save variant names in EnumData to reduce needless queries | Marcus Klaas de Vries | 2019-01-10 | 3 | -29/+20 | |
| | | | | | | | | | | | | We already have their names when anyway, and when in all (current) situations where we're interested in an Enum's variants, we want their names. | |||||
| * | Implement type inference for enum variants | Marcus Klaas de Vries | 2019-01-10 | 10 | -37/+203 | |
| | | ||||||
* | | introduce marking infrastructure for maintainable tests | Aleksey Kladov | 2019-01-10 | 4 | -1/+118 | |
|/ | | | | This also fixes a particular edge case in name resolution. | |||||
* | Merge #475 | bors[bot] | 2019-01-10 | 3 | -52/+72 | |
|\ | | | | | | | | | | | | | | | | | | | | | 475: Show types of fields in completion r=matklad a=matklad ![image](https://user-images.githubusercontent.com/1711539/50910524-0f146200-143f-11e9-84d6-0ba80761cd89.png) r? @flodiebold Co-authored-by: Aleksey Kladov <[email protected]> | |||||
| * | show field types in completion | Aleksey Kladov | 2019-01-09 | 3 | -52/+72 | |
| | | ||||||
* | | implement RefUnwindSafe | Aleksey Kladov | 2019-01-10 | 1 | -1/+3 | |
|/ | ||||||
* | nicer trailing comma handling in types | Aleksey Kladov | 2019-01-09 | 4 | -11/+16 | |
| | ||||||
* | Merge #473 | bors[bot] | 2019-01-09 | 15 | -48/+67 | |
|\ | | | | | | | | | | | | | | | 473: Partial typo fix r=matklad a=marcusklaas This fixes some typos. Mostly in documentation, but also some code is affected (`defenition` was used in a few method names). Co-authored-by: Marcus Klaas de Vries <[email protected]> | |||||
| * | Fix typos in ARCHITECTURE.md and a number of crates | Marcus Klaas de Vries | 2019-01-09 | 14 | -44/+63 | |
| | | | | | | | | specifically: gen_lsp_server, ra_arena, ra_cli, ra_db, ra_hir | |||||
| * | Fix typo defenition -> definition | Marcus Klaas de Vries | 2019-01-08 | 3 | -4/+4 | |
| | | ||||||
* | | more stable DefIds via bfs tree walking | Aleksey Kladov | 2019-01-08 | 2 | -7/+31 | |
| | | ||||||
* | | one more invalidation test | Aleksey Kladov | 2019-01-08 | 1 | -1/+32 | |
| | | ||||||
* | | fix test naming | Aleksey Kladov | 2019-01-08 | 1 | -22/+22 | |
| | | ||||||
* | | remove duplication in tests | Aleksey Kladov | 2019-01-08 | 1 | -55/+33 | |
|/ | ||||||
* | ra_db is independent from editor | Aleksey Kladov | 2019-01-08 | 2 | -1/+1 | |
| | ||||||
* | ra_hir does not depend on ra_editor | Aleksey Kladov | 2019-01-08 | 1 | -1/+0 | |
| | ||||||
* | move node at offset to aglo already | Aleksey Kladov | 2019-01-08 | 2 | -3/+2 | |
| | ||||||
* | move function to code_model_api | Aleksey Kladov | 2019-01-08 | 9 | -144/+153 | |
| | ||||||
* | remove FnSignatureInfo from hir | Aleksey Kladov | 2019-01-08 | 2 | -126/+3 | |
| | ||||||
* | Fix name resolution across source roots | Florian Diebold | 2019-01-08 | 3 | -19/+173 | |
| | | | | It was using the wrong name in that case. | |||||
* | Fix use tree desugaring | Florian Diebold | 2019-01-08 | 2 | -1/+30 | |
| | ||||||
* | Merge #458 | bors[bot] | 2019-01-08 | 4 | -9/+13 | |
|\ | | | | | | | | | | | | | | | 458: dont reexport module id r=matklad a=matklad Co-authored-by: Aleksey Kladov <[email protected]> | |||||
| * | dont reexport module id | Aleksey Kladov | 2019-01-08 | 4 | -9/+13 | |
| | | ||||||
* | | switch interner to use arena | Aleksey Kladov | 2019-01-08 | 1 | -4/+4 | |
|/ | ||||||
* | minimize visibility | Aleksey Kladov | 2019-01-08 | 1 | -1/+1 | |
| | ||||||
* | move query impls to adt | Aleksey Kladov | 2019-01-08 | 3 | -25/+31 | |
| | ||||||
* | move variant public api to api | Aleksey Kladov | 2019-01-08 | 2 | -34/+28 | |
| | ||||||
* | move variants to API | Aleksey Kladov | 2019-01-08 | 3 | -29/+34 | |
| | ||||||
* | minor | Aleksey Kladov | 2019-01-08 | 1 | -4/+4 | |
| | ||||||
* | move enum to code_model_api | Aleksey Kladov | 2019-01-08 | 3 | -29/+26 | |
| | ||||||
* | move stuct to code_model_api | Aleksey Kladov | 2019-01-08 | 3 | -22/+27 | |
| | ||||||
* | Merge #455 | bors[bot] | 2019-01-08 | 2 | -16/+62 | |
|\ | | | | | | | | | | | | | | | 455: Import fixpoint loop for name resolution r=matklad a=flodiebold This implements reexports, so only the glob import part of #231 remains. Co-authored-by: Florian Diebold <[email protected]> | |||||
| * | Import fixpoint loop for name resolution | Florian Diebold | 2019-01-08 | 2 | -16/+62 | |
| | | ||||||
* | | convert some if-lets to match | Aleksey Kladov | 2019-01-08 | 1 | -12/+9 | |
| | | ||||||
* | | itroduce trait for ast tokens | Aleksey Kladov | 2019-01-08 | 2 | -3/+3 | |
| | | ||||||
* | | migrate ra_analysis to new rowan | Aleksey Kladov | 2019-01-08 | 1 | -2/+2 | |
| | | ||||||
* | | migrate ra_hir to rowan 2.0 | Aleksey Kladov | 2019-01-08 | 17 | -192/+195 | |
| | | ||||||
* | | Process explicit type hints for str, bool and char | Marcus Klaas de Vries | 2019-01-07 | 4 | -5/+18 | |
| | | ||||||
* | | Tidy up binary operator type inference; add test file | Marcus Klaas de Vries | 2019-01-07 | 2 | -44/+87 | |
| | | ||||||
* | | Implement type inference for more binary operators | Marcus Klaas de Vries | 2019-01-07 | 3 | -47/+82 | |
| | | | | | | | | | | Mostly just for primitive numeric types such as u32 and f64. Not yet a general solution using trait resolution. | |||||
* | | Add remaining binary operations to AST | Marcus Klaas de Vries | 2019-01-07 | 1 | -0/+1 | |
|/ | ||||||
* | Implement autoderef for field accesses | Florian Diebold | 2019-01-07 | 5 | -24/+147 | |
| | ||||||
* | if let -> match | Florian Diebold | 2019-01-07 | 1 | -8/+6 | |
| | ||||||
* | Improve types for node_expr / node_pat | Florian Diebold | 2019-01-06 | 1 | -5/+5 | |
| |