aboutsummaryrefslogtreecommitdiff
path: root/crates/ra_hir/src
Commit message (Collapse)AuthorAgeFilesLines
* add tests for macro generated itemsAleksey Kladov2019-01-011-1/+83
|
* add items from macros to modulesAleksey Kladov2019-01-011-12/+36
|
* wipAleksey Kladov2019-01-012-47/+49
|
* fix testsAleksey Kladov2019-01-013-2/+3
|
* use MFileAleksey Kladov2019-01-017-30/+62
|
* introduce MFileIdAleksey Kladov2019-01-011-0/+7
|
* work towards brining macros to nameresAleksey Kladov2019-01-012-3/+16
|
* save top-level macros in module itemsAleksey Kladov2019-01-012-13/+17
|
* hard-code expansion of query_groupAleksey Kladov2019-01-011-7/+37
|
* fix testsAleksey Kladov2019-01-012-2/+9
|
* renameAleksey Kladov2019-01-013-15/+15
|
* move more macros to hirAleksey Kladov2019-01-013-42/+113
|
* use macros database in analysisAleksey Kladov2019-01-012-6/+48
|
* introduce MacrosDatabaseAleksey Kladov2019-01-012-0/+58
|
* Make modules with tests runnableJan Jansen2018-12-311-0/+5
| | | | Fixes #154
* Add more docs in ty.rsFlorian Diebold2018-12-293-36/+61
| | | | | Also get rid of the indirection through query_definitions for the type-related queries.
* Missing return type means unit, not unknownFlorian Diebold2018-12-292-3/+7
|
* Implement type variablesFlorian Diebold2018-12-296-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&enumsAleksey Kladov2018-12-285-57/+43
|
* completion for enum variantsAleksey Kladov2018-12-281-0/+4
|
* simplifyAleksey Kladov2018-12-281-9/+4
|
* remove FnIdAleksey Kladov2018-12-274-36/+21
|
* use names everywhereAleksey Kladov2018-12-272-12/+35
|
* dont leak Name details in testingAleksey Kladov2018-12-272-19/+62
|
* introduce known namesAleksey Kladov2018-12-274-29/+71
|
* introduce hir::NameAleksey Kladov2018-12-2710-50/+120
|
* add function to completion ctxAleksey Kladov2018-12-271-0/+1
|
* Resolve field types lazilyFlorian Diebold2018-12-256-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::TyFlorian Diebold2018-12-257-84/+180
|
* Implement reference / pointer typesFlorian Diebold2018-12-254-17/+116
| | | | | - parse them - infer types of & and * expressions
* Handle structs/enums with missing names a bit betterFlorian Diebold2018-12-252-20/+22
|
* CleanupFlorian Diebold2018-12-251-125/+37
|
* Implement basic completion for fieldsFlorian Diebold2018-12-253-3/+17
|
* Type field accessesFlorian Diebold2018-12-253-3/+44
|
* Collect field data for structs/enum variantsFlorian Diebold2018-12-255-12/+87
|
* Infer result of struct literals, and recurse into their child expressionsFlorian Diebold2018-12-254-43/+117
|
* Do name resolution by namespace (types/values)Florian Diebold2018-12-256-71/+182
|
* Add basic HIR and types for structs/enumsFlorian Diebold2018-12-258-29/+242
|
* Change inference tests to have one per fileFlorian Diebold2018-12-246-55/+92
|
* Rename a variable for consistencyFlorian Diebold2018-12-242-10/+10
|
* Clean up Ty a bitFlorian Diebold2018-12-241-38/+22
| | | | Removing irrelevant comments copied from rustc etc.
* Prepare Ty::new for resolutionFlorian Diebold2018-12-231-14/+24
|
* Type the return values of call expressionsFlorian Diebold2018-12-232-5/+13
|
* Resolve paths to defs (functions currently) during type inferenceFlorian Diebold2018-12-2311-84/+203
|
* Make let statements kind of workFlorian Diebold2018-12-233-8/+48
|
* Remove unwrapsFlorian Diebold2018-12-231-6/+19
|
* Get rid of the terrible nesting in PathExpr inferenceFlorian Diebold2018-12-231-26/+14
|
* CleanupFlorian Diebold2018-12-232-81/+71
|
* Add testing infrastructure for type inferenceFlorian Diebold2018-12-235-23/+102
| | | | - move dir_tests to test_utils for that.
* Parse integer / float typesFlorian Diebold2018-12-232-2/+52
|