aboutsummaryrefslogtreecommitdiff
path: root/crates/ra_hir/src/ty/tests/data
Commit message (Collapse)AuthorAgeFilesLines
* Tidy up binary operator type inference; add test fileMarcus Klaas de Vries2019-01-071-0/+46
|
* Implement type inference for more binary operatorsMarcus Klaas de Vries2019-01-071-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 accessesFlorian Diebold2019-01-071-0/+43
|
* Sort ranges in type inference testsFlorian Diebold2019-01-068-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 inferenceFlorian Diebold2019-01-065-14/+14
| | | | | Now we can reuse the type inference inside a function when typing whitespace etc. :)
* Touch up type inference for boolean operatorsMarcus Klaas de Vries2019-01-061-10/+31
| | | | | Also try to infer its subexpressions and set type expectations whenever possible.
* Implement type inference for boolean operatorsMarcus Klaas de Vries2019-01-051-0/+10
|
* Resolve the Self typeFlorian Diebold2019-01-041-2/+2
|
* Resolve the self parameter during type inferenceFlorian Diebold2019-01-041-2/+2
|
* Type the self parameterFlorian Diebold2019-01-041-0/+2
|
* Add test for self type inferenceFlorian Diebold2019-01-041-0/+4
|
* Missing return type means unit, not unknownFlorian Diebold2018-12-291-2/+2
|
* Implement type variablesFlorian Diebold2018-12-294-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 typesFlorian Diebold2018-12-252-2/+25
| | | | | - parse them - infer types of & and * expressions
* Type field accessesFlorian Diebold2018-12-251-2/+4
|
* Infer result of struct literals, and recurse into their child expressionsFlorian Diebold2018-12-251-4/+8
|
* Do name resolution by namespace (types/values)Florian Diebold2018-12-251-2/+2
|
* Add basic HIR and types for structs/enumsFlorian Diebold2018-12-251-0/+10
|
* Change inference tests to have one per fileFlorian Diebold2018-12-245-42/+16
|
* Type the return values of call expressionsFlorian Diebold2018-12-231-2/+2
|
* Resolve paths to defs (functions currently) during type inferenceFlorian Diebold2018-12-232-0/+19
|
* Make let statements kind of workFlorian Diebold2018-12-232-0/+12
|
* Add testing infrastructure for type inferenceFlorian Diebold2018-12-232-0/+24
- move dir_tests to test_utils for that.