aboutsummaryrefslogtreecommitdiff
path: root/crates
Commit message (Collapse)AuthorAgeFilesLines
* 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
| |
* | Fix typosJeremy Kolb2019-01-131-2/+2
|/
* Merge #505bors[bot]2019-01-1216-47/+398
|\ | | | | | | | | | | | | | | | | | | 505: Inherent methods r=matklad a=flodiebold This adds resolution, type checking and completion for inherent methods. The main open question here is the caching, I think. I'm not sure whether we should be caching method resolutions in a more fine grained way (currently we just build a hash map of types -> impl blocks, and iterate through all potential impl blocks when looking for a method). Co-authored-by: Florian Diebold <[email protected]>
| * args -> paramsFlorian Diebold2019-01-128-37/+37
| |
| * Small improvements from review commentsFlorian Diebold2019-01-123-20/+20
| |
| * Complete inherent methodsFlorian Diebold2019-01-123-4/+63
| |
| * Implement basic inherent method resolutionFlorian Diebold2019-01-1211-17/+309
| |
* | Merge #500bors[bot]2019-01-126-99/+154
|\ \ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 500: Code lens support for running tests r=matklad a=kjeremy Supports running individual and mod tests. I feel like this kind of abuses the `Runnables` infrastructure but it works. Maybe later on down the line we should introduce a struct that is really just a tuple of binary, arguments, and environment and pass that back to the client instead. `run_single.ts` is just a paired down version of `runnables.ts` and there is duplication because I think run_single will probably change independent of runnables. Co-authored-by: Jeremy A. Kolb <[email protected]> Co-authored-by: Jeremy Kolb <[email protected]>
| * | Move `CargoTargetSpec` and friends to cargo_target_spec moduleJeremy Kolb2019-01-123-90/+102
| | |
| * | Code lens support for running testsJeremy A. Kolb2019-01-114-85/+128
| | |
* | | Merge #507bors[bot]2019-01-123-0/+53
|\ \ \ | | | | | | | | | | | | | | | | | | | | | | | | | | | | 507: Fix handling of attributes in positional field lists r=matklad a=DJMcNab First reported by @max-frai. This allows us to properly handle crates using e.g. `#[Derive(fail)]` with `#[fail(cause)]`, among other cases. Co-authored-by: DJMcNab <[email protected]>
| * | | Fix handling of attributes in positional field listsDJMcNab2019-01-123-0/+53
| | |/ | |/|
* / | Use --force when installing the VSIX.DJMcNab2019-01-121-2/+2
|/ /
* | Switch hover to use MarkupContentJeremy Kolb2019-01-121-2/+5
| | | | | | | | MarkedString is deprecated
* | Fix assertion error in unification (hopefully)Florian Diebold2019-01-113-7/+50
| | | | | | | | | | | | | | 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).
* | warn louder on mising sysrootAleksey Kladov2019-01-112-1/+9
|/
* actually produce missing def kindsAleksey Kladov2019-01-117-8/+122
|
* uncopypaste def sourcesAleksey Kladov2019-01-113-40/+26
|
* add missing def kindsAleksey Kladov2019-01-111-0/+20
|
* rename TreePtr -> TreeArcAleksey Kladov2019-01-1124-194/+194
| | | | This is much clearer about the semantics
* Merge #496bors[bot]2019-01-1112-248/+294
|\ | | | | | | | | | | | | | | 496: Include two element ranges into the nav. r=matklad a=matklad Co-authored-by: Aleksey Kladov <[email protected]>
| * kill NavTarget ptrAleksey Kladov2019-01-111-6/+2
| |
| * fix testsAleksey Kladov2019-01-118-98/+108
| |
| * use location link in goto defAleksey Kladov2019-01-112-12/+25
| |
| * return ref ranges from gotodefAleksey Kladov2019-01-114-10/+24
| |
| * envapsulate navigation target betterAleksey Kladov2019-01-118-96/+102
| |
| * simplifyAleksey Kladov2019-01-111-5/+2
| |
| * reshuffle nonesAleksey Kladov2019-01-111-21/+10
| |
| * refactor nav targetAleksey Kladov2019-01-111-20/+29
| |
| * Make from_syntax privateAleksey Kladov2019-01-112-14/+11
| |
| * move nav to a separate fileAleksey Kladov2019-01-112-73/+88
| |
| * group feature modulesAleksey Kladov2019-01-111-3/+3
| |
* | prioritize event handing over indexingAleksey Kladov2019-01-111-4/+15
|/ | | | | | If we index gazillion libraries simultaneously, we fill the threadpool and so the main loop fails to turn, although there isn't really any significant blocking inside the loop itself.
* fine grained on typed testsAleksey Kladov2019-01-111-43/+48
|
* fix on-type offsetAleksey Kladov2019-01-111-26/+21
|
* make on dot typed actually workAleksey Kladov2019-01-113-125/+121
|
* force serde in ra_syntaxAleksey Kladov2019-01-113-6/+22
|
* minorAleksey Kladov2019-01-102-6/+2
|
* wire sysroot into crate graphAleksey Kladov2019-01-104-37/+95
|
* special case stdAleksey Kladov2019-01-101-2/+6
|
* use arena for sysrootAleksey Kladov2019-01-102-50/+90
|
* split moduleAleksey Kladov2019-01-103-241/+261
|
* add sysroot boilerplateAleksey Kladov2019-01-106-32/+157
|
* Merge #490bors[bot]2019-01-102-3/+0
|\ | | | | | | | | | | | | | | 490: dont depend on tools from lsp-server r=matklad a=matklad Co-authored-by: Aleksey Kladov <[email protected]>
| * dont depend on tools from lsp-serverAleksey Kladov2019-01-102-3/+0
| |
* | Use name resolution for goto definitionFlorian Diebold2019-01-107-16/+179
| |
* | Merge #470bors[bot]2019-01-1012-46/+205
|\ \ | |/ |/| | | | | | | | | | | | | | | 470: Type inference for enum variants r=flodiebold a=marcusklaas Opened a new PR instead of https://github.com/rust-analyzer/rust-analyzer/pull/461. Totally botched that one. I think I resolved all the issues mentioned there. Co-authored-by: Marcus Klaas de Vries <[email protected]>
| * Save variant names in EnumData to reduce needless queriesMarcus Klaas de Vries2019-01-104-39/+25
| | | | | | | | | | | | We already have their names when anyway, and when in all (current) situations where we're interested in an Enum's variants, we want their names.
| * Implement type inference for enum variantsMarcus Klaas de Vries2019-01-1012-45/+218
| |