aboutsummaryrefslogtreecommitdiff
Commit message (Collapse)AuthorAgeFilesLines
...
* | | Merge #546bors[bot]2019-01-1520-195/+495
|\ \ \ | |/ / |/| | | | | | | | | | | | | | | | | 546: replace `assert_dbg_eq` with Insta r=matklad a=matklad Co-authored-by: Aleksey Kladov <[email protected]>
| * | switch to insta for testingAleksey Kladov2019-01-1520-195/+495
| | |
* | | Merge #485bors[bot]2019-01-1419-130/+625
|\ \ \ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 485: Add type inference for a bunch of primitives r=flodiebold a=marcusklaas This PR adds inference for `&str`, `&[u8]`, `char`, `bool`, floats and integers. For floats and integers it uses type variables to infer the exact type, i.e. `u32`, from context when it's not annotated explicitly. I'm not quite happy with the implementation yet, but I think it mostly works now. Co-authored-by: Marcus Klaas de Vries <[email protected]>
| * | | Address issues found in reviewMarcus Klaas de Vries2019-01-143-56/+54
| | | |
| * | | Fix type inference for raw (byte) stringsMarcus Klaas de Vries2019-01-147-66/+120
| | | |
| * | | Give literal expression default values for nowMarcus Klaas de Vries2019-01-141-23/+9
| | | |
| * | | Fixup testsMarcus Klaas de Vries2019-01-1412-211/+283
| | | |
| * | | Start moving literal interpretation to the AST (WIP)Marcus Klaas de Vries2019-01-144-10/+131
| | | |
| * | | don't try to treat arrays and tuples as literalsMarcus Klaas de Vries2019-01-145-57/+27
| | | |
| * | | Use type variables to determine exact type for ambiguous numeric literalsMarcus Klaas de Vries2019-01-146-14/+64
| | | |
| * | | Try implementing integer type inference (WIP)Marcus Klaas de Vries2019-01-148-46/+129
| | | |
| * | | Implement type inference for literals (WIP)Marcus Klaas de Vries2019-01-148-5/+166
| |/ /
* | | Merge #538bors[bot]2019-01-144-8/+10
|\ \ \ | |/ / |/| | | | | | | | | | | | | | | | | 538: update cargo_metadata r=matklad a=matklad Co-authored-by: Aleksey Kladov <[email protected]>
| * | update cargo_metadataAleksey Kladov2019-01-144-8/+10
|/ /
* | Merge #537bors[bot]2019-01-1413-47/+47
|\ \ | | | | | | | | | | | | | | | | | | | | | 537: switch to lsp-types r=matklad a=matklad Co-authored-by: Aleksey Kladov <[email protected]>
| * | switch to lsp-typesAleksey Kladov2019-01-1413-47/+47
|/ /
* | Merge #534bors[bot]2019-01-141-42/+23
|\ \ | |/ |/| | | | | | | | | | | 534: Add visibility to hover r=matklad a=kjeremy Co-authored-by: Jeremy Kolb <[email protected]>
| * Remove duplicationJeremy Kolb2019-01-141-74/+23
| |
| * Add visibility to hoverJeremy Kolb2019-01-141-9/+41
|/
* Merge #533bors[bot]2019-01-131-5/+10
|\ | | | | | | | | | | | | | | 533: target_selection_range is not nullable in the implementation r=matklad a=matklad Co-authored-by: Aleksey Kladov <[email protected]>
| * target_selection_range is not nullable in the implementationAleksey Kladov2019-01-131-5/+10
|/
* Merge #532bors[bot]2019-01-132-2/+21
|\ | | | | | | | | | | | | | | 532: fix go to parent module r=matklad a=matklad Co-authored-by: Aleksey Kladov <[email protected]>
| * fix go to parent moduleAleksey Kladov2019-01-132-2/+21
| |
* | Merge #530bors[bot]2019-01-133-10/+10
|\ \ | | | | | | | | | | | | | | | | | | | | | 530: Fix some random typos r=matklad a=killercup Co-authored-by: Pascal Hertleif <[email protected]>
| * | Fix some random typosPascal Hertleif2019-01-133-10/+10
|/ /
* | Merge #529bors[bot]2019-01-132-69/+69
|\ \ | |/ |/| | | | | | | | | | | 529: :arrow_up: npm r=matklad a=matklad Co-authored-by: Aleksey Kladov <[email protected]>
| * :arrow_up: npmAleksey Kladov2019-01-132-69/+69
|/
* Merge #527bors[bot]2019-01-132-5/+71
|\ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 527: goto defenition works for type-inferred methods r=flodiebold a=matklad This uses type inference results for `goto method` functionality. This is achieved by adding another map to `InferenceResult`. I wonder how we should handle this long-term... The pattern seems to be "we are doing some analysis, and we produce some stuff as a by-product, and IDE would like to use the stuff". Ideally, adding an additional bit of info shouldn't require threading it through all data structures. I kinda like how Kotlin deals with this problem. They have this [`BindingContext`](https://github.com/JetBrains/kotlin/blob/72e351a0e3610051fe4222dca4e1eeedf7ae45da/compiler/frontend/src/org/jetbrains/kotlin/resolve/BindingContext.java#L122) thing, which is basically an [`AnyMap`](https://github.com/JetBrains/kotlin/blob/72e351a0e3610051fe4222dca4e1eeedf7ae45da/compiler/frontend/src/org/jetbrains/kotlin/resolve/BindingContext.java#L122) of HashMaps. Deep in the compiler guts, they [record the info](https://github.com/JetBrains/kotlin/blob/ba6da7c40a6cc502508faf6e04fa105b96bc7777/compiler/frontend/src/org/jetbrains/kotlin/resolve/calls/tasks/TracingStrategyForInvoke.java#L70-L75) into the map, using a type key, a value key and a value. Then the IDE [reads this map](https://github.com/JetBrains/kotlin/blob/ba6da7c40a6cc502508faf6e04fa105b96bc7777/idea/src/org/jetbrains/kotlin/idea/inspections/RedundantNotNullExtensionReceiverOfInlineInspection.kt#L64) (via a [helper](https://github.com/JetBrains/kotlin/blob/ba6da7c40a6cc502508faf6e04fa105b96bc7777/compiler/frontend/src/org/jetbrains/kotlin/resolve/calls/util/callUtil.kt#L178-L180)). The stuff in between does not know that this type-key exists, unless it inspects it. Co-authored-by: Aleksey Kladov <[email protected]>
| * goto defenition works for type-inferred methodsAleksey Kladov2019-01-132-5/+71
| |
* | Merge #526bors[bot]2019-01-133-11/+51
|\| | | | | | | | | | | | | | | 526: fix indent caclulation r=matklad a=matklad Co-authored-by: Aleksey Kladov <[email protected]>
| * fix indent caclulationAleksey Kladov2019-01-133-11/+51
|/
* note about performanceAleksey Kladov2019-01-131-7/+18
|
* Merge #520bors[bot]2019-01-136-3/+74
|\ | | | | | | | | | | | | | | | | | | | | | | 520: Imprement tuple inference r=flodiebold a=h-michael related #394 I'm sorry I'm late. I try implementing array inference next. Co-authored-by: Hirokazu Hata <[email protected]>
| * Fix tuple test caseHirokazu Hata2019-01-132-6/+35
| |
| * Implement tuple inferenceHirokazu Hata2019-01-132-1/+20
| |
| * Update TUPLE_EXPR grammarHirokazu Hata2019-01-132-2/+8
| |
| * Add infer tuple testHirokazu Hata2019-01-132-0/+17
| |
* | Merge #522bors[bot]2019-01-131-1/+5
|\ \ | | | | | | | | | | | | | | | | | | | | | 522: Tweak message shown for query fallback r=DJMcNab a=killercup Small tweak for #518 Co-authored-by: Pascal Hertleif <[email protected]>
| * | Tweak message shown for query fallbackPascal Hertleif2019-01-131-1/+5
|/ / | | | | | | Small tweak for #518
* | Merge #521bors[bot]2019-01-132-98/+199
|\ \ | |/ |/| | | | | | | | | | | 521: refresh docs r=matklad a=matklad Co-authored-by: Aleksey Kladov <[email protected]>
| * refresh docsAleksey Kladov2019-01-131-55/+166
| |
| * tweak readmeAleksey Kladov2019-01-131-43/+33
| |
| |
| \
*-. \ Merge #517 #518bors[bot]2019-01-135-51/+114
|\ \ \ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 517: gracefully handle cycles in crate graph r=matklad a=matklad 518: Add an explanatory message when we use the Query fallback r=matklad a=DJMcNab Fixes https://github.com/rust-analyzer/rust-analyzer/issues/269. There is no good way to explain it for go_to_def, so I've just fallen back on to_vec. Co-authored-by: Aleksey Kladov <[email protected]> Co-authored-by: DJMcNab <[email protected]>
| | * | Add an explanatory message when we use the Query fallbackDJMcNab2019-01-132-10/+36
| | | |
| * | | gracefully handle cycles in crate graphAleksey Kladov2019-01-133-41/+78
| | | | | | | | | | | | | | | | | | | | rust-lang/rust has absolutely weird setup with rustc-workspace-shim, which leads to real cycles.
* | | | Merge #519bors[bot]2019-01-135-11/+46
|\ \ \ \ | |_|/ / |/| | / | | |/ | |/| | | | | | | | | | 519: support ref-patterns r=matklad a=matklad Co-authored-by: Aleksey Kladov <[email protected]>
| * | support ref-patternsAleksey Kladov2019-01-135-11/+46
| |/
* | Merge #513bors[bot]2019-01-133-35/+53
|\ \ | | | | | | | | | | | | | | | | | | | | | 513: Add bench runnable and code lens r=matklad a=kjeremy Co-authored-by: Jeremy Kolb <[email protected]>
| * | Add bench runnable and code lensJeremy Kolb2019-01-123-35/+53
| | |
* | | Merge #514bors[bot]2019-01-134-9/+16
|\ \ \ | |_|/ |/| | | | | | | | | | | | | | | | | 514: npm fix run r=matklad a=kjeremy Co-authored-by: Jeremy Kolb <[email protected]>
generated by cgit v1.2.3 (git 2.25.1) at 2024-09-17 15:22:50 +0100