aboutsummaryrefslogtreecommitdiff
Commit message (Collapse)AuthorAgeFilesLines
...
* | | | 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]>
| * | | | cleanupAleksey Kladov2018-12-215-15/+7
| | | | |
| * | | | docsAleksey Kladov2018-12-217-167/+181
| | | | |
| * | | | rename testsAleksey Kladov2018-12-211-8/+8
| | | | |
| * | | | scope-based copmletions on original fileAleksey Kladov2018-12-215-322/+223
| | | | |
| * | | | move path completion to a separate componentAleksey Kladov2018-12-213-44/+127
| | | | |
| * | | | more completion componentsAleksey Kladov2018-12-214-95/+104
| | | | |
| * | | | Start splitting completion into componentsAleksey Kladov2018-12-214-339/+424
| | | | |
| * | | | wipAleksey Kladov2018-12-211-5/+28
| | | | |
* | | | | remove explicit serde_deriveAleksey Kladov2018-12-216-8/+4
| |/ / / |/| | |
* | | | join lines collapses use_treesAleksey Kladov2018-12-211-0/+58
| | | |
* | | | Merge #313bors[bot]2018-12-215-9/+139
|\ \ \ \ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 313: Fix where clauses using fully qualified path syntax r=matklad a=DJMcNab Fixes #311. Co-authored-by: DJMcNab <[email protected]>
| * | | | Fix where clauses using fully qualified path syntaxDJMcNab2018-12-215-9/+139
|/ / / /
* / / / hide empty changesAleksey Kladov2018-12-212-7/+20
|/ / /
* | | add tests for pdAleksey Kladov2018-12-211-2/+13
| | |
* | | show debug repr of literalsAleksey Kladov2018-12-214-4/+4
| | |
* | | Merge #312bors[bot]2018-12-219-501/+678
|\ \ \ | |/ / |/| | | | | | | | | | | | | | | | | 312: Completion refactoring r=matklad a=matklad Just a usual refactoring, turning a rather ad-hoc completion infra into something extensible Co-authored-by: Aleksey Kladov <[email protected]>
| * | organize completion tests betterAleksey Kladov2018-12-215-393/+488
| | |
| * | use completions in APIAleksey Kladov2018-12-212-8/+7
| | |
| * | use Completions to collect completionsAleksey Kladov2018-12-213-26/+38
| | |
| * | docsAleksey Kladov2018-12-211-0/+5
| | |
| * | introduce CompletionsAleksey Kladov2018-12-211-0/+23
| | |
| * | make compleion item details privateAleksey Kladov2018-12-215-36/+65
| | |
| * | use builder interface for completion itemAleksey Kladov2018-12-214-59/+40
| | |
| * | flip paramsAleksey Kladov2018-12-211-3/+3
| | |
| * | introduce completion_item moduleAleksey Kladov2018-12-213-21/+54
|/ /
* | Merge #306bors[bot]2018-12-213-1/+2399
|\ \ | | | | | | | | | | | | | | | | | | | | | | | | | | | 306: Finish weird exprs r=DJMcNab a=DJMcNab Fix #290. Note that I'm not certain my use of `p.nth(1) == Ident` is entirely consistent with `libsyntax` - in the original, [`is_union_item`](https://github.com/rust-lang/rust/blob/9622f9dc4745eb59fd229477f453ae83e8044db9/src/libsyntax/parse/parser.rs#L4593-L4596) uses `t.is_ident() && !t.is_reserved_ident()`, whereas we effectively only do `is_ident`. However, I cannot find the definition of `is_reserved_ident` (even searching the rust repository only gives uses, no definitions), so this will have to do unless someone else can find it :|. Co-authored-by: DJMcNab <[email protected]>
| * | Add comment about the source of the weird_exprs testDJMcNab2018-12-212-2235/+2248
| | |
| * | Add weird_exprs testDJMcNab2018-12-202-0/+2385
| | |
| * | Fix parsing of contextual_keyword unionDJMcNab2018-12-201-1/+1
| | |
* | | Merge #309bors[bot]2018-12-218-35/+55
|\ \ \ | | | | | | | | | | | | | | | | | | | | | | | | | | | | 309: Fix edits r=matklad a=matklad Co-authored-by: Aleksey Kladov <[email protected]>
| * | | use root-relative pathsAleksey Kladov2018-12-212-7/+3
| | | |
| * | | edits use source-root APIAleksey Kladov2018-12-214-16/+28
| | | |
| * | | hide atom edits a bitAleksey Kladov2018-12-215-12/+24
|/ / /
* | | better debug implsAleksey Kladov2018-12-212-2/+17
| | |
* | | fix SourceFileEdit nameAleksey Kladov2018-12-213-6/+6
| | |
* | | Merge #308bors[bot]2018-12-212-2/+2
|\ \ \ | | | | | | | | | | | | | | | | | | | | | | | | | | | | 308: tweak canceled message r=matklad a=matklad Co-authored-by: Aleksey Kladov <[email protected]>
| * | | tweak canceled messageAleksey Kladov2018-12-212-2/+2
|/ / /
| | |
| \ \
*-. \ \ Merge #305 #307bors[bot]2018-12-205-44/+80
|\ \ \ \ | |_|/ / |/| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 305: Fold curly blocks r=matklad a=matklad 307: :arrow_up: 1.31.1 r=matklad a=matklad Co-authored-by: Aleksey Kladov <[email protected]>
| | * | :arrow_up: 1.31.1Aleksey Kladov2018-12-202-2/+2
| |/ / |/| |
| * | fold curly blocksAleksey Kladov2018-12-203-18/+30
| | |
| * | generalize folding testsAleksey Kladov2018-12-202-28/+52
|/ / | | | | | | By using xml-like tags, we will be able to test nested foldings.
* | Merge #304bors[bot]2018-12-203-0/+65
|\ \ | | | | | | | | | | | | | | | | | | | | | | | | | | | 304: Support a blank expression before a semicolon r=DJMcNab a=DJMcNab Part of fixing #290. Note that I have not run `gen-tests` as I don't want to conflict with #299. Co-authored-by: DJMcNab <[email protected]>
| * | Run gen-testsDJMcNab2018-12-202-0/+59
| | |
| * | Use a better way of skipping SEMIsDJMcNab2018-12-201-6/+6
| | |
| * | Support a blank expression before a semicolonDJMcNab2018-12-201-0/+6
|/ /
* | Merge #299bors[bot]2018-12-20257-600/+290
|\ \ | | | | | | | | | | | | | | | | | | | | | 299: Ensure that the parser errors or not for the parser tests r=matklad a=DJMcNab Co-authored-by: DJMcNab <[email protected]>
| * | Fix broken test is deleted commentDJMcNab2018-12-201-1/+1
| | |
| * | Fix the tests and fix the precommit hookDJMcNab2018-12-20255-561/+210
| | |
| * | Fix missing DOTDOTEQsDJMcNab2018-12-201-3/+3
| | |