Commit message (Collapse) | Author | Age | Files | Lines | |
---|---|---|---|---|---|
* | remove Cancelable from navigation target | Aleksey Kladov | 2019-01-15 | 1 | -3/+3 |
| | |||||
* | remove Cancelable from adt API | Aleksey Kladov | 2019-01-15 | 1 | -4/+4 |
| | |||||
* | check_canceled does not return Result | Aleksey Kladov | 2019-01-15 | 1 | -1/+1 |
| | |||||
* | Address issues found in review | Marcus Klaas de Vries | 2019-01-14 | 1 | -1/+1 |
| | |||||
* | Fixup tests | Marcus Klaas de Vries | 2019-01-14 | 1 | -21/+25 |
| | |||||
* | don't try to treat arrays and tuples as literals | Marcus Klaas de Vries | 2019-01-14 | 1 | -29/+20 |
| | |||||
* | Use type variables to determine exact type for ambiguous numeric literals | Marcus Klaas de Vries | 2019-01-14 | 1 | -6/+39 |
| | |||||
* | Try implementing integer type inference (WIP) | Marcus Klaas de Vries | 2019-01-14 | 1 | -26/+27 |
| | |||||
* | Implement type inference for literals (WIP) | Marcus Klaas de Vries | 2019-01-14 | 1 | -1/+32 |
| | |||||
* | goto defenition works for type-inferred methods | Aleksey Kladov | 2019-01-13 | 1 | -3/+22 |
| | |||||
* | Implement tuple inference | Hirokazu Hata | 2019-01-13 | 1 | -0/+8 |
| | |||||
* | args -> params | Florian Diebold | 2019-01-12 | 1 | -6/+6 |
| | |||||
* | Implement basic inherent method resolution | Florian Diebold | 2019-01-12 | 1 | -7/+32 |
| | |||||
* | Fix assertion error in unification (hopefully) | Florian Diebold | 2019-01-11 | 1 | -7/+33 |
| | | | | | | | Currently, all types that we handle during inference need to be resolved as far as possible at the time. It's maybe too brittle of an invariant; I need to think how we can do this better. This should fix #484 though, I hope (if it's the same case as I managed to reproduce). | ||||
* | actually produce missing def kinds | Aleksey Kladov | 2019-01-11 | 1 | -2/+6 |
| | |||||
* | Implement type inference for enum variants | Marcus Klaas de Vries | 2019-01-10 | 1 | -6/+14 |
| | |||||
* | nicer trailing comma handling in types | Aleksey Kladov | 2019-01-09 | 1 | -9/+13 |
| | |||||
* | Fix typos in ARCHITECTURE.md and a number of crates | Marcus Klaas de Vries | 2019-01-09 | 1 | -2/+2 |
| | | | | specifically: gen_lsp_server, ra_arena, ra_cli, ra_db, ra_hir | ||||
* | ra_db is independent from editor | Aleksey Kladov | 2019-01-08 | 1 | -0/+1 |
| | |||||
* | Process explicit type hints for str, bool and char | Marcus Klaas de Vries | 2019-01-07 | 1 | -1/+7 |
| | |||||
* | Tidy up binary operator type inference; add test file | Marcus Klaas de Vries | 2019-01-07 | 1 | -44/+41 |
| | |||||
* | Implement type inference for more binary operators | Marcus Klaas de Vries | 2019-01-07 | 1 | -11/+74 |
| | | | | | 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 | 1 | -22/+50 |
| | |||||
* | Introduce ArenaMap | Florian Diebold | 2019-01-06 | 1 | -12/+12 |
| | |||||
* | Use HIR Expr for type inference | Florian Diebold | 2019-01-06 | 1 | -316/+228 |
| | | | | | Now we can reuse the type inference inside a function when typing whitespace etc. :) | ||||
* | Merge #440 | bors[bot] | 2019-01-06 | 1 | -2/+33 |
|\ | | | | | | | | | | | | | | | | | | | 440: Implement type inference for boolean operators r=flodiebold a=marcusklaas Tried implementing the easiest part of https://github.com/rust-analyzer/rust-analyzer/issues/390. Hope this is somewhat close to what the intent of the issue was. Found it surprisingly easy to find my way around the repository - it's well organized! Very grateful for any pointers. Co-authored-by: Marcus Klaas de Vries <[email protected]> | ||||
| * | Touch up type inference for boolean operators | Marcus Klaas de Vries | 2019-01-06 | 1 | -7/+29 |
| | | | | | | | | | | Also try to infer its subexpressions and set type expectations whenever possible. | ||||
| * | Implement type inference for boolean operators | Marcus Klaas de Vries | 2019-01-05 | 1 | -2/+11 |
| | | |||||
* | | Make FnScopes use hir::Expr | Florian Diebold | 2019-01-05 | 1 | -13/+6 |
|/ | | | | | | This was a bit complicated. I've added a wrapper type for now that does the LocalSyntaxPtr <-> ExprId translation; we might want to get rid of that or give it a nicer interface. | ||||
* | Rename ImplBlock::target -> target_type, and add target_trait already | Florian Diebold | 2019-01-04 | 1 | -2/+2 |
| | |||||
* | Refactor a bit | Florian Diebold | 2019-01-04 | 1 | -58/+62 |
| | |||||
* | Resolve the Self type | Florian Diebold | 2019-01-04 | 1 | -21/+65 |
| | |||||
* | Resolve the self parameter during type inference | Florian Diebold | 2019-01-04 | 1 | -2/+12 |
| | |||||
* | Type the self parameter | Florian Diebold | 2019-01-04 | 1 | -7/+31 |
| | |||||
* | Add more docs in ty.rs | Florian Diebold | 2018-12-29 | 1 | -19/+58 |
| | | | | | Also get rid of the indirection through query_definitions for the type-related queries. | ||||
* | Missing return type means unit, not unknown | Florian Diebold | 2018-12-29 | 1 | -1/+5 |
| | |||||
* | Implement type variables | Florian Diebold | 2018-12-29 | 1 | -111/+336 |
| | | | | | | | | | This will really become necessary when we implement generics, but even now, it allows us to reason 'backwards' to infer types of expressions that we didn't understand for some reason. We use ena, the union-find implementation extracted from rustc, to keep track of type variables. | ||||
* | nameify structs&enums | Aleksey Kladov | 2018-12-28 | 1 | -17/+7 |
| | |||||
* | introduce known names | Aleksey Kladov | 2018-12-27 | 1 | -5/+4 |
| | |||||
* | introduce hir::Name | Aleksey Kladov | 2018-12-27 | 1 | -5/+5 |
| | |||||
* | Resolve field types lazily | Florian Diebold | 2018-12-25 | 1 | -8/+28 |
| | | | | I.e. not already when getting the HIR for the struct. | ||||
* | Add a hir::TypeRef as an intermediate between ast::TypeRef and ty::Ty | Florian Diebold | 2018-12-25 | 1 | -77/+62 |
| | |||||
* | Implement reference / pointer types | Florian Diebold | 2018-12-25 | 1 | -15/+69 |
| | | | | | - parse them - infer types of & and * expressions | ||||
* | Handle structs/enums with missing names a bit better | Florian Diebold | 2018-12-25 | 1 | -6/+14 |
| | |||||
* | Cleanup | Florian Diebold | 2018-12-25 | 1 | -125/+37 |
| | |||||
* | Implement basic completion for fields | Florian Diebold | 2018-12-25 | 1 | -2/+3 |
| | |||||
* | Type field accesses | Florian Diebold | 2018-12-25 | 1 | -1/+31 |
| | |||||
* | Collect field data for structs/enum variants | Florian Diebold | 2018-12-25 | 1 | -1/+10 |
| | |||||
* | Infer result of struct literals, and recurse into their child expressions | Florian Diebold | 2018-12-25 | 1 | -36/+83 |
| |