Commit message (Collapse) | Author | Age | Files | Lines | ||
---|---|---|---|---|---|---|
... | ||||||
* | Fix Ty::Array | Hirokazu Hata | 2019-01-16 | 1 | -21/+16 | |
| | ||||||
* | Add infer array test | Hirokazu Hata | 2019-01-16 | 2 | -0/+61 | |
| | ||||||
* | Implement array inference | Hirokazu Hata | 2019-01-16 | 2 | -3/+30 | |
| | ||||||
* | Implement rudimentary type inference for unary operators | Marcus Klaas de Vries | 2019-01-15 | 4 | -5/+72 | |
| | ||||||
* | hir is cancelation free | Aleksey Kladov | 2019-01-15 | 2 | -11/+5 | |
| | ||||||
* | remove Cancelable from type inference | Aleksey Kladov | 2019-01-15 | 6 | -107/+81 | |
| | ||||||
* | remove Cancelable from Ty | Aleksey Kladov | 2019-01-15 | 5 | -67/+54 | |
| | ||||||
* | remove Cancelable from ids | Aleksey Kladov | 2019-01-15 | 6 | -34/+27 | |
| | ||||||
* | remove Cancelable from nameres | Aleksey Kladov | 2019-01-15 | 7 | -62/+48 | |
| | ||||||
* | remove Cancelable from fn_scopes | Aleksey Kladov | 2019-01-15 | 5 | -9/+9 | |
| | ||||||
* | remove Cancelable from funciton body | Aleksey Kladov | 2019-01-15 | 6 | -18/+13 | |
| | ||||||
* | remove Cancelable from navigation target | Aleksey Kladov | 2019-01-15 | 5 | -12/+11 | |
| | ||||||
* | remove Cancelable from static&const API | Aleksey Kladov | 2019-01-15 | 1 | -11/+8 | |
| | ||||||
* | remove Cancelable from adt API | Aleksey Kladov | 2019-01-15 | 5 | -53/+36 | |
| | ||||||
* | remove Cancelable from Crate API | Aleksey Kladov | 2019-01-15 | 4 | -10/+10 | |
| | ||||||
* | remove Cancelable from Module API, part 2 | Aleksey Kladov | 2019-01-15 | 4 | -26/+22 | |
| | ||||||
* | remove Cancelable from Module API | Aleksey Kladov | 2019-01-15 | 3 | -15/+12 | |
| | ||||||
* | remove Cancelable from source binders | Aleksey Kladov | 2019-01-15 | 9 | -76/+56 | |
| | ||||||
* | remove Cancelable from module_tree_query | Aleksey Kladov | 2019-01-15 | 6 | -31/+28 | |
| | ||||||
* | check_canceled does not return Result | Aleksey Kladov | 2019-01-15 | 3 | -4/+4 | |
| | ||||||
* | update salsa | Aleksey Kladov | 2019-01-15 | 1 | -1/+1 | |
| | ||||||
* | Address issues found in review | Marcus Klaas de Vries | 2019-01-14 | 2 | -11/+9 | |
| | ||||||
* | Fix type inference for raw (byte) strings | Marcus Klaas de Vries | 2019-01-14 | 2 | -4/+12 | |
| | ||||||
* | Give literal expression default values for now | Marcus Klaas de Vries | 2019-01-14 | 1 | -23/+9 | |
| | ||||||
* | Fixup tests | Marcus Klaas de Vries | 2019-01-14 | 7 | -166/+135 | |
| | ||||||
* | Start moving literal interpretation to the AST (WIP) | Marcus Klaas de Vries | 2019-01-14 | 1 | -4/+3 | |
| | ||||||
* | don't try to treat arrays and tuples as literals | Marcus Klaas de Vries | 2019-01-14 | 5 | -57/+27 | |
| | ||||||
* | Use type variables to determine exact type for ambiguous numeric literals | Marcus Klaas de Vries | 2019-01-14 | 6 | -14/+64 | |
| | ||||||
* | Try implementing integer type inference (WIP) | Marcus Klaas de Vries | 2019-01-14 | 7 | -45/+128 | |
| | ||||||
* | Implement type inference for literals (WIP) | Marcus Klaas de Vries | 2019-01-14 | 5 | -4/+139 | |
| | ||||||
* | goto defenition works for type-inferred methods | Aleksey Kladov | 2019-01-13 | 1 | -3/+22 | |
| | ||||||
* | Fix tuple test case | Hirokazu Hata | 2019-01-13 | 2 | -6/+35 | |
| | ||||||
* | Implement tuple inference | Hirokazu Hata | 2019-01-13 | 2 | -1/+20 | |
| | ||||||
* | Add infer tuple test | Hirokazu Hata | 2019-01-13 | 2 | -0/+17 | |
| | ||||||
*-. | Merge #517 #518 | bors[bot] | 2019-01-13 | 1 | -3/+9 | |
|\ \ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 517: gracefully handle cycles in crate graph r=matklad a=matklad 518: Add an explanatory message when we use the Query fallback r=matklad a=DJMcNab Fixes https://github.com/rust-analyzer/rust-analyzer/issues/269. There is no good way to explain it for go_to_def, so I've just fallen back on to_vec. Co-authored-by: Aleksey Kladov <[email protected]> Co-authored-by: DJMcNab <[email protected]> | |||||
| * | | gracefully handle cycles in crate graph | Aleksey Kladov | 2019-01-13 | 1 | -3/+9 | |
| |/ | | | | | | | | | rust-lang/rust has absolutely weird setup with rustc-workspace-shim, which leads to real cycles. | |||||
* / | support ref-patterns | Aleksey Kladov | 2019-01-13 | 2 | -9/+34 | |
|/ | ||||||
* | args -> params | Florian Diebold | 2019-01-12 | 6 | -35/+35 | |
| | ||||||
* | Small improvements from review comments | Florian Diebold | 2019-01-12 | 3 | -20/+20 | |
| | ||||||
* | Implement basic inherent method resolution | Florian Diebold | 2019-01-12 | 10 | -17/+308 | |
| | ||||||
* | Fix assertion error in unification (hopefully) | Florian Diebold | 2019-01-11 | 3 | -7/+50 | |
| | | | | | | | 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 | 4 | -8/+82 | |
| | ||||||
* | 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 | |
| | |