| Commit message (Collapse) | Author | Age | Files | Lines | ||
|---|---|---|---|---|---|---|
| ... | ||||||
| * | hard-code expansion of query_group | Aleksey Kladov | 2019-01-01 | 1 | -7/+37 | |
| | | ||||||
| * | fix tests | Aleksey Kladov | 2019-01-01 | 2 | -2/+9 | |
| | | ||||||
| * | rename | Aleksey Kladov | 2019-01-01 | 3 | -15/+15 | |
| | | ||||||
| * | move more macros to hir | Aleksey Kladov | 2019-01-01 | 3 | -42/+113 | |
| | | ||||||
| * | use macros database in analysis | Aleksey Kladov | 2019-01-01 | 2 | -6/+48 | |
| | | ||||||
| * | introduce MacrosDatabase | Aleksey Kladov | 2019-01-01 | 2 | -0/+58 | |
| | | ||||||
| * | Make modules with tests runnable | Jan Jansen | 2018-12-31 | 1 | -0/+5 | |
| | | | | | Fixes #154 | |||||
| * | Add more docs in ty.rs | Florian Diebold | 2018-12-29 | 3 | -36/+61 | |
| | | | | | | Also get rid of the indirection through query_definitions for the type-related queries. | |||||
| * | Missing return type means unit, not unknown | Florian Diebold | 2018-12-29 | 2 | -3/+7 | |
| | | ||||||
| * | Implement type variables | Florian Diebold | 2018-12-29 | 6 | -118/+384 | |
| | | | | | | | | | | 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. | |||||
| * | nameify structs&enums | Aleksey Kladov | 2018-12-28 | 5 | -57/+43 | |
| | | ||||||
| * | completion for enum variants | Aleksey Kladov | 2018-12-28 | 1 | -0/+4 | |
| | | ||||||
| * | simplify | Aleksey Kladov | 2018-12-28 | 1 | -9/+4 | |
| | | ||||||
| * | remove FnId | Aleksey Kladov | 2018-12-27 | 4 | -36/+21 | |
| | | ||||||
| * | use names everywhere | Aleksey Kladov | 2018-12-27 | 2 | -12/+35 | |
| | | ||||||
| * | dont leak Name details in testing | Aleksey Kladov | 2018-12-27 | 2 | -19/+62 | |
| | | ||||||
| * | introduce known names | Aleksey Kladov | 2018-12-27 | 4 | -29/+71 | |
| | | ||||||
| * | introduce hir::Name | Aleksey Kladov | 2018-12-27 | 10 | -50/+120 | |
| | | ||||||
| * | add function to completion ctx | Aleksey Kladov | 2018-12-27 | 1 | -0/+1 | |
| | | ||||||
| * | Resolve field types lazily | Florian Diebold | 2018-12-25 | 6 | -59/+75 | |
| | | | | | I.e. not already when getting the HIR for the struct. | |||||
| * | Add a hir::TypeRef as an intermediate between ast::TypeRef and ty::Ty | Florian Diebold | 2018-12-25 | 7 | -84/+180 | |
| | | ||||||
| * | Implement reference / pointer types | Florian Diebold | 2018-12-25 | 4 | -17/+116 | |
| | | | | | | - parse them - infer types of & and * expressions | |||||
| * | Handle structs/enums with missing names a bit better | Florian Diebold | 2018-12-25 | 2 | -20/+22 | |
| | | ||||||
| * | Cleanup | Florian Diebold | 2018-12-25 | 1 | -125/+37 | |
| | | ||||||
| * | Implement basic completion for fields | Florian Diebold | 2018-12-25 | 3 | -3/+17 | |
| | | ||||||
| * | Type field accesses | Florian Diebold | 2018-12-25 | 3 | -3/+44 | |
| | | ||||||
| * | Collect field data for structs/enum variants | Florian Diebold | 2018-12-25 | 5 | -12/+87 | |
| | | ||||||
| * | Infer result of struct literals, and recurse into their child expressions | Florian Diebold | 2018-12-25 | 4 | -43/+117 | |
| | | ||||||
| * | Do name resolution by namespace (types/values) | Florian Diebold | 2018-12-25 | 6 | -71/+182 | |
| | | ||||||
| * | Add basic HIR and types for structs/enums | Florian Diebold | 2018-12-25 | 8 | -29/+242 | |
| | | ||||||
| * | Change inference tests to have one per file | Florian Diebold | 2018-12-24 | 6 | -55/+92 | |
| | | ||||||
| * | Rename a variable for consistency | Florian Diebold | 2018-12-24 | 2 | -10/+10 | |
| | | ||||||
| * | Clean up Ty a bit | Florian Diebold | 2018-12-24 | 1 | -38/+22 | |
| | | | | | Removing irrelevant comments copied from rustc etc. | |||||
| * | Prepare Ty::new for resolution | Florian Diebold | 2018-12-23 | 1 | -14/+24 | |
| | | ||||||
| * | Type the return values of call expressions | Florian Diebold | 2018-12-23 | 2 | -5/+13 | |
| | | ||||||
| * | Resolve paths to defs (functions currently) during type inference | Florian Diebold | 2018-12-23 | 11 | -84/+203 | |
| | | ||||||
| * | Make let statements kind of work | Florian Diebold | 2018-12-23 | 3 | -8/+48 | |
| | | ||||||
| * | Remove unwraps | Florian Diebold | 2018-12-23 | 1 | -6/+19 | |
| | | ||||||
| * | Get rid of the terrible nesting in PathExpr inference | Florian Diebold | 2018-12-23 | 1 | -26/+14 | |
| | | ||||||
| * | Cleanup | Florian Diebold | 2018-12-23 | 2 | -81/+71 | |
| | | ||||||
| * | Add testing infrastructure for type inference | Florian Diebold | 2018-12-23 | 5 | -23/+102 | |
| | | | | | - move dir_tests to test_utils for that. | |||||
| * | Parse integer / float types | Florian Diebold | 2018-12-23 | 2 | -2/+52 | |
| | | ||||||
| * | Add beginnings of type infrastructure | Florian Diebold | 2018-12-23 | 8 | -2/+643 | |
| | | ||||||
| * | completion uses hir scopes | Aleksey Kladov | 2018-12-22 | 3 | -3/+13 | |
| | | ||||||
| * | Merge #319 | bors[bot] | 2018-12-21 | 4 | -5/+4 | |
| |\ | | | | | | | | | | | | | | | 319: Completion icons r=matklad a=matklad Co-authored-by: Aleksey Kladov <[email protected]> | |||||
| | * | debug pring | Aleksey Kladov | 2018-12-21 | 1 | -1/+0 | |
| | | | ||||||
| | * | moar icons | Aleksey Kladov | 2018-12-21 | 3 | -3/+3 | |
| | | | ||||||
| | * | move completion items to conv | Aleksey Kladov | 2018-12-21 | 1 | -1/+1 | |
| | | | ||||||
| * | | Merge #316 | bors[bot] | 2018-12-21 | 2 | -2/+38 | |
| |\ \ | |/ |/| | | | | | | | | | | | 316: Fix handling of nested self in paths r=matklad a=DJMcNab See https://github.com/rust-analyzer/rust-analyzer/issues/231#issuecomment-442449505. Co-authored-by: DJMcNab <[email protected]> | |||||
| | * | Move the self handling from directly inside the loop | DJMcNab | 2018-12-21 | 1 | -13/+12 | |
| | | | ||||||
 |
index : rust-analyzer | |
| [FORK] modified to work on wasm targets |
| aboutsummaryrefslogtreecommitdiff |