| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | nicer trailing comma handling in types | Aleksey Kladov | 2019-01-09 | 2 | -2/+2 |
| | | |||||
| * | Process explicit type hints for str, bool and char | Marcus Klaas de Vries | 2019-01-07 | 2 | -4/+4 |
| | | |||||
| * | Tidy up binary operator type inference; add test file | Marcus Klaas de Vries | 2019-01-07 | 1 | -0/+46 |
| | | |||||
| * | Implement type inference for more binary operators | Marcus Klaas de Vries | 2019-01-07 | 1 | -31/+0 |
| | | | | | | Mostly just for primitive numeric types such as u32 and f64. Not yet a general solution using trait resolution. | ||||
| * | Implement autoderef for field accesses | Florian Diebold | 2019-01-07 | 1 | -0/+43 |
| | | |||||
| * | Sort ranges in type inference tests | Florian Diebold | 2019-01-06 | 8 | -80/+80 |
| | | | | | | Also rename the files to remove the numbers (they don't serve a purpose now that there are only the data files). | ||||
| * | Use HIR Expr for type inference | Florian Diebold | 2019-01-06 | 5 | -14/+14 |
| | | | | | | Now we can reuse the type inference inside a function when typing whitespace etc. :) | ||||
| * | Touch up type inference for boolean operators | Marcus Klaas de Vries | 2019-01-06 | 1 | -10/+31 |
| | | | | | | 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 | -0/+10 |
| | | |||||
| * | Resolve the Self type | Florian Diebold | 2019-01-04 | 1 | -2/+2 |
| | | |||||
| * | Resolve the self parameter during type inference | Florian Diebold | 2019-01-04 | 1 | -2/+2 |
| | | |||||
| * | Type the self parameter | Florian Diebold | 2019-01-04 | 1 | -0/+2 |
| | | |||||
| * | Add test for self type inference | Florian Diebold | 2019-01-04 | 1 | -0/+4 |
| | | |||||
| * | Missing return type means unit, not unknown | Florian Diebold | 2018-12-29 | 1 | -2/+2 |
| | | |||||
| * | Implement type variables | Florian Diebold | 2018-12-29 | 4 | -7/+27 |
| | | | | | | | | | | 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. | ||||
| * | Implement reference / pointer types | Florian Diebold | 2018-12-25 | 2 | -2/+25 |
| | | | | | | - parse them - infer types of & and * expressions | ||||
| * | Type field accesses | Florian Diebold | 2018-12-25 | 1 | -2/+4 |
| | | |||||
| * | Infer result of struct literals, and recurse into their child expressions | Florian Diebold | 2018-12-25 | 1 | -4/+8 |
| | | |||||
| * | Do name resolution by namespace (types/values) | Florian Diebold | 2018-12-25 | 1 | -2/+2 |
| | | |||||
| * | Add basic HIR and types for structs/enums | Florian Diebold | 2018-12-25 | 1 | -0/+10 |
| | | |||||
| * | Change inference tests to have one per file | Florian Diebold | 2018-12-24 | 5 | -42/+16 |
| | | |||||
| * | Type the return values of call expressions | Florian Diebold | 2018-12-23 | 1 | -2/+2 |
| | | |||||
| * | Resolve paths to defs (functions currently) during type inference | Florian Diebold | 2018-12-23 | 2 | -0/+19 |
| | | |||||
| * | Make let statements kind of work | Florian Diebold | 2018-12-23 | 2 | -0/+12 |
| | | |||||
| * | Add testing infrastructure for type inference | Florian Diebold | 2018-12-23 | 2 | -0/+24 |
| - move dir_tests to test_utils for that. | |||||
 |
index : rust-analyzer | |
| [FORK] modified to work on wasm targets |
| aboutsummaryrefslogtreecommitdiff |