aboutsummaryrefslogtreecommitdiff
path: root/crates/ra_hir/src/ty
Commit message (Collapse)AuthorAgeFilesLines
* remove Cancelable from source bindersAleksey Kladov2019-01-151-6/+2
|
* Fix type inference for raw (byte) stringsMarcus Klaas de Vries2019-01-142-4/+12
|
* Fixup testsMarcus Klaas de Vries2019-01-144-56/+56
|
* don't try to treat arrays and tuples as literalsMarcus Klaas de Vries2019-01-143-10/+6
|
* Use type variables to determine exact type for ambiguous numeric literalsMarcus Klaas de Vries2019-01-144-7/+9
|
* Try implementing integer type inference (WIP)Marcus Klaas de Vries2019-01-145-6/+56
|
* Implement type inference for literals (WIP)Marcus Klaas de Vries2019-01-143-1/+31
|
* Fix tuple test caseHirokazu Hata2019-01-132-6/+35
|
* Add infer tuple testHirokazu Hata2019-01-132-0/+17
|
* args -> paramsFlorian Diebold2019-01-121-1/+1
|
* Small improvements from review commentsFlorian Diebold2019-01-121-15/+15
|
* Implement basic inherent method resolutionFlorian Diebold2019-01-123-0/+208
|
* Fix assertion error in unification (hopefully)Florian Diebold2019-01-112-0/+17
| | | | | | | 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).
* Implement type inference for enum variantsMarcus Klaas de Vries2019-01-102-0/+20
|
* nicer trailing comma handling in typesAleksey Kladov2019-01-092-2/+2
|
* Fix typos in ARCHITECTURE.md and a number of cratesMarcus Klaas de Vries2019-01-092-2/+2
| | | | specifically: gen_lsp_server, ra_arena, ra_cli, ra_db, ra_hir
* Process explicit type hints for str, bool and charMarcus Klaas de Vries2019-01-072-4/+4
|
* 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-072-36/+8
| | | | | 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-073-1/+96
|
* if let -> matchFlorian Diebold2019-01-071-8/+6
|
* Introduce ArenaMapFlorian Diebold2019-01-061-4/+4
|
* Sort ranges in type inference testsFlorian Diebold2019-01-069-92/+93
| | | | | 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-066-17/+35
| | | | | Now we can reuse the type inference inside a function when typing whitespace etc. :)
* Merge #440bors[bot]2019-01-062-0/+55
|\ | | | | | | | | | | | | | | | | | | 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 operatorsMarcus Klaas de Vries2019-01-062-10/+38
| | | | | | | | | | Also try to infer its subexpressions and set type expectations whenever possible.
| * Implement type inference for boolean operatorsMarcus Klaas de Vries2019-01-052-0/+27
| |
* | Add test for invalidation of inferred types when typing inside functionFlorian Diebold2019-01-051-0/+44
|/ | | | This currently fails, but should work once we have hir::Expr.
* 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-042-0/+23
|
* Missing return type means unit, not unknownFlorian Diebold2018-12-291-2/+2
|
* Implement type variablesFlorian Diebold2018-12-295-7/+48
| | | | | | | | | 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.
* introduce known namesAleksey Kladov2018-12-271-20/+22
|
* Implement reference / pointer typesFlorian Diebold2018-12-253-2/+47
| | | | | - 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-252-5/+9
|
* Do name resolution by namespace (types/values)Florian Diebold2018-12-251-2/+2
|
* Add basic HIR and types for structs/enumsFlorian Diebold2018-12-252-0/+33
|
* Change inference tests to have one per fileFlorian Diebold2018-12-246-55/+92
|
* Rename a variable for consistencyFlorian Diebold2018-12-241-1/+1
|
* Type the return values of call expressionsFlorian Diebold2018-12-231-2/+2
|
* Resolve paths to defs (functions currently) during type inferenceFlorian Diebold2018-12-233-1/+25
|
* Make let statements kind of workFlorian Diebold2018-12-232-0/+12
|
* CleanupFlorian Diebold2018-12-231-17/+22
|
* Add testing infrastructure for type inferenceFlorian Diebold2018-12-233-23/+63
| | | | - move dir_tests to test_utils for that.
* Parse integer / float typesFlorian Diebold2018-12-231-0/+32
|
* Add beginnings of type infrastructureFlorian Diebold2018-12-232-0/+143
generated by cgit v1.2.3 (git 2.25.1) at 2024-11-09 04:24:14 +0000