aboutsummaryrefslogtreecommitdiff
path: root/crates
Commit message (Collapse)AuthorAgeFilesLines
...
| * add serverity to vscode diagnosticsgfreezy2018-12-235-12/+32
| |
| * resolved #324: remove unnecessary braces in use statement.gfreezy2018-12-231-2/+53
| |
* | Merge #327bors[bot]2018-12-2421-148/+1188
|\ \ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 327: Beginnings of type inference r=flodiebold a=flodiebold I was a bit bored, so I thought I'd try to start implementing the type system and see how far I come :wink: This is obviously still extremely WIP, only very basic stuff working, but I thought I'd post this now to get some feedback as to whether this approach makes sense at all. There's no user-visible effect yet, but the type inference has tests similar to the ones for the parser. My next step will probably be to implement struct types, after which this could probably be used to complete fields. I realize this may all get thrown away when/if the compiler query system gets usable, but I feel like there are lots of IDE features that could be implemented with somewhat working type inference in the meantime :smile: Co-authored-by: Florian Diebold <[email protected]>
| * | 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-2316-87/+214
| | |
| * | Make let statements kind of workFlorian Diebold2018-12-235-8/+53
| | |
| * | Remove unwrapsFlorian Diebold2018-12-231-6/+19
| | |
| * | Get rid of the terrible nesting in PathExpr inferenceFlorian Diebold2018-12-231-26/+14
| | |
| * | CleanupFlorian Diebold2018-12-234-108/+110
| | |
| * | Add testing infrastructure for type inferenceFlorian Diebold2018-12-239-124/+222
| | | | | | | | | | | | - move dir_tests to test_utils for that.
| * | Parse integer / float typesFlorian Diebold2018-12-234-4/+58
| | |
| * | Add beginnings of type infrastructureFlorian Diebold2018-12-2311-15/+689
| |/
* | Merge #278bors[bot]2018-12-242-2/+74
|\ \ | | | | | | | | | | | | | | | | | | | | | 278: Add make_pub_crate code action to ra_editor r=matklad a=h-michael implement #170 Co-authored-by: Hirokazu Hata <[email protected]>
| * | Add make_pub_crate code action to ra_editorHirokazu Hata2018-12-242-2/+74
| |/
* | Merge #302bors[bot]2018-12-242-8/+11
|\ \ | |/ |/| | | | | | | | | | | | | | | | | | | | | | | 302: WIP: Support tracing lsp requests. r=DJMcNab a=DJMcNab EDIT: We need to work out a better way to handle settings before this can be merged. Help wanted TODO: Debug why decorations are sent even when highlightingOn is disabled This makes the log volume so high its impossible to work with anyway. (Continuation of #84 [#99 only disabled using it, not making sure we don't send it]). These logs can be used in https://microsoft.github.io/language-server-protocol/inspector/ Co-authored-by: DJMcNab <[email protected]>
| * Improve commentDJMcNab2018-12-231-2/+2
| |
| * Undo the previous mistaken change and make publish_decorations optionalDJMcNab2018-12-212-8/+11
| | | | | | | | | | | | | | | | See https://github.com/Microsoft/language-server-protocol/issues/567 for motivations to not require `InitializationOptions` TODO: Check if there are any other protocol extensions which should be disabled if not implemented on the client
| * Disable highlighting if disabledDJMcNab2018-12-201-2/+2
| | | | | | | | | | | | | | | | This isn't working properly because we don't dynamically disable or enable it TODO: work out why highlighting can be enabled mid session. TODO: Improve settings handling
* | Merge #310bors[bot]2018-12-221-5/+54
|\ \ | | | | | | | | | | | | | | | | | | | | | 310: When constructing a crate graph, detect and forbid cycles. r=matklad a=gfreezy fixed #300 Co-authored-by: gfreezy <[email protected]>
| * | mark as visited on entry instead of leftgfreezy2018-12-221-2/+2
| | |
| * | not visit the same crateId only oncegfreezy2018-12-221-14/+16
| | |
| * | add #[cfg(test)]gfreezy2018-12-211-1/+2
| | |
| * | rename to dfs_findgfreezy2018-12-211-3/+3
| | |
| * | When constructing a crate graph, detect and forbid cycles.gfreezy2018-12-211-6/+52
| | | | | | | | | | | | fixed #300
* | | less chatty loggingAleksey Kladov2018-12-221-0/+7
| | |
* | | less verbose debugAleksey Kladov2018-12-222-8/+45
| | |
* | | less verbose debug for library dataAleksey Kladov2018-12-222-1/+14
| | |
* | | log timesAleksey Kladov2018-12-222-2/+3
| | |
* | | completion uses hir scopesAleksey Kladov2018-12-225-27/+39
| | |
* | | Merge #319bors[bot]2018-12-2116-86/+136
|\ \ \ | | | | | | | | | | | | | | | | | | | | | | | | | | | | 319: Completion icons r=matklad a=matklad Co-authored-by: Aleksey Kladov <[email protected]>
| * | | fix snippet iconAleksey Kladov2018-12-211-1/+1
| | | |
| * | | binding iconAleksey Kladov2018-12-213-2/+6
| | | |
| * | | debug pringAleksey Kladov2018-12-211-1/+0
| | | |
| * | | moar iconsAleksey Kladov2018-12-217-7/+34
| | | |
| * | | more iconsAleksey Kladov2018-12-212-2/+15
| | | |
| * | | move completion items to convAleksey Kladov2018-12-215-30/+33
| | | |
| * | | specify completion item kindAleksey Kladov2018-12-214-12/+17
| | | |
| * | | cleanupAleksey Kladov2018-12-214-29/+34
| | | |
| * | | introduce ComletionItemKindAleksey Kladov2018-12-216-34/+28
| | | |
| * | | rename completion kindAleksey Kladov2018-12-211-6/+6
| | | |
* | | | Merge #316bors[bot]2018-12-213-3/+39
|\ \ \ \ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 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 loopDJMcNab2018-12-211-13/+12
| | | | |
| * | | | Fix handling of nested self in pathsDJMcNab2018-12-213-3/+40
| | | | |
* | | | | Remove TODO on self_hosting_parsingDJMcNab2018-12-211-8/+4
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | This improving this code is not a good use of people-time, and this might be the most performant approach nonwithstanding an api for this use case being added to walkdir
* | | | | Remove uneeded todo in lexerDJMcNab2018-12-211-1/+1
| |/ / / |/| | |
* | | | Merge #315bors[bot]2018-12-219-771/+878
|\ \ \ \ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 315: Split completion into manageable components r=matklad a=matklad The main idea here is to do completion in two phases: * first, we figure out surrounding context * then, we run a series of completers on the given context. Co-authored-by: Aleksey Kladov <[email protected]>
generated by cgit v1.2.3 (git 2.25.1) at 2024-11-30 16:33:56 +0000