| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | remove Cancelable from fn_scopes | Aleksey Kladov | 2019-01-15 | 1 | -1/+1 |
| | | |||||
| * | remove Cancelable from source binders | Aleksey Kladov | 2019-01-15 | 1 | -6/+2 |
| | | |||||
| * | Fix type inference for raw (byte) strings | Marcus Klaas de Vries | 2019-01-14 | 1 | -3/+9 |
| | | |||||
| * | Fixup tests | Marcus Klaas de Vries | 2019-01-14 | 1 | -3/+2 |
| | | |||||
| * | don't try to treat arrays and tuples as literals | Marcus Klaas de Vries | 2019-01-14 | 1 | -2/+0 |
| | | |||||
| * | Use type variables to determine exact type for ambiguous numeric literals | Marcus Klaas de Vries | 2019-01-14 | 1 | -0/+1 |
| | | |||||
| * | Implement type inference for literals (WIP) | Marcus Klaas de Vries | 2019-01-14 | 1 | -0/+20 |
| | | |||||
| * | Fix tuple test case | Hirokazu Hata | 2019-01-13 | 1 | -1/+8 |
| | | |||||
| * | Add infer tuple test | Hirokazu Hata | 2019-01-13 | 1 | -0/+12 |
| | | |||||
| * | Implement basic inherent method resolution | Florian Diebold | 2019-01-12 | 1 | -0/+26 |
| | | |||||
| * | Fix assertion error in unification (hopefully) | Florian Diebold | 2019-01-11 | 1 | -0/+12 |
| | | | | | | | | 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 variants | Marcus Klaas de Vries | 2019-01-10 | 1 | -0/+16 |
| | | |||||
| * | Fix typos in ARCHITECTURE.md and a number of crates | Marcus Klaas de Vries | 2019-01-09 | 1 | -1/+1 |
| | | | | | specifically: gen_lsp_server, ra_arena, ra_cli, ra_db, ra_hir | ||||
| * | Implement type inference for more binary operators | Marcus Klaas de Vries | 2019-01-07 | 1 | -5/+8 |
| | | | | | | 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 | -1/+32 |
| | | |||||
| * | if let -> match | Florian Diebold | 2019-01-07 | 1 | -8/+6 |
| | | |||||
| * | Introduce ArenaMap | Florian Diebold | 2019-01-06 | 1 | -4/+4 |
| | | |||||
| * | Sort ranges in type inference tests | Florian Diebold | 2019-01-06 | 1 | -12/+13 |
| | | | | | | 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 | 1 | -3/+21 |
| | | | | | | Now we can reuse the type inference inside a function when typing whitespace etc. :) | ||||
| * | Merge #440 | bors[bot] | 2019-01-06 | 1 | -0/+24 |
| |\ | | | | | | | | | | | | | | | | | | | 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 | -0/+7 |
| | | | | | | | | | | | 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/+17 |
| | | | |||||
| * | | Add test for invalidation of inferred types when typing inside function | Florian Diebold | 2019-01-05 | 1 | -0/+44 |
| |/ | | | | This currently fails, but should work once we have hir::Expr. | ||||
| * | Add test for self type inference | Florian Diebold | 2019-01-04 | 1 | -0/+19 |
| | | |||||
| * | Implement type variables | Florian Diebold | 2018-12-29 | 1 | -0/+21 |
| | | | | | | | | | | 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 | 1 | -0/+22 |
| | | | | | | - parse them - infer types of & and * expressions | ||||
| * | Infer result of struct literals, and recurse into their child expressions | Florian Diebold | 2018-12-25 | 1 | -1/+1 |
| | | |||||
| * | Add basic HIR and types for structs/enums | Florian Diebold | 2018-12-25 | 1 | -0/+23 |
| | | |||||
| * | Change inference tests to have one per file | Florian Diebold | 2018-12-24 | 1 | -13/+76 |
| | | |||||
| * | Rename a variable for consistency | Florian Diebold | 2018-12-24 | 1 | -1/+1 |
| | | |||||
| * | Resolve paths to defs (functions currently) during type inference | Florian Diebold | 2018-12-23 | 1 | -1/+6 |
| | | |||||
| * | Cleanup | Florian Diebold | 2018-12-23 | 1 | -17/+22 |
| | | |||||
| * | Add testing infrastructure for type inference | Florian Diebold | 2018-12-23 | 1 | -23/+39 |
| | | | | | - move dir_tests to test_utils for that. | ||||
| * | Add beginnings of type infrastructure | Florian Diebold | 2018-12-23 | 1 | -0/+45 |
 |
index : rust-analyzer | |
| [FORK] modified to work on wasm targets |
| aboutsummaryrefslogtreecommitdiff |