aboutsummaryrefslogtreecommitdiff
Commit message (Collapse)AuthorAgeFilesLines
...
| * | Add keywords completions on source file positionMikhail Rakhmanov2020-06-133-21/+124
| | |
| * | Merge branch 'master' into keyword_completionMikhail Rakhmanov2020-06-13175-3882/+7387
| |\| | | | | | | | | | | | | # Conflicts: # docs/user/generated_features.adoc
| * | Fix tests and remove unused methodsMikhail Rakhmanov2020-06-134-14/+7
| | |
| * | Add more patterns, tests and fix keywordsMikhail Rakhmanov2020-06-123-473/+297
| | |
| * | Rewrite snapshot checksMikhail Rakhmanov2020-06-124-245/+100
| | |
| * | Remove comment and incorrect assertMikhail Rakhmanov2020-06-121-7/+1
| | |
| * | Return snapshots to testsMikhail Rakhmanov2020-06-121-18/+34
| | |
| * | More assert refactoringMikhail Rakhmanov2020-06-121-7/+8
| | |
| * | Add more pattern testsMikhail Rakhmanov2020-06-122-11/+50
| | |
| * | New testing approach for keywordsMikhail Rakhmanov2020-06-122-6/+56
| | |
| * | Add few smoke tests for patterns and refactoringMikhail Rakhmanov2020-06-114-10/+111
| | |
| * | Add more patterns and keywordsMikhail Rakhmanov2020-06-113-55/+59
| | |
| * | Add todoMikhail Rakhmanov2020-06-111-1/+2
| | |
| * | Add more keywordsMikhail Rakhmanov2020-06-114-234/+183
| | |
| * | Add top level keywords completionMikhail Rakhmanov2020-06-021-1/+186
| | |
* | | Merge #4862bors[bot]2020-06-132-3/+2
|\ \ \ | |_|/ |/| | | | | | | | | | | | | | | | | 4862: Revert "Hide squiggly for unused and unnecessary" r=matklad a=GabbeV This reverts https://github.com/rust-analyzer/rust-analyzer/pull/4721 Co-authored-by: Gabriel Valfridsson <[email protected]>
| * | Revert "Hide squiggly for unused and unnecessary"Gabriel Valfridsson2020-06-122-3/+2
|/ / | | | | | | This reverts commit 599c105e6fabb2b81c2d0a11b86c0c96f6ab1b88.
* | Merge #4857bors[bot]2020-06-121-1/+14
|\ \ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 4857: Fix invalid shorthand initialization diagnostic for tuple structs r=jonas-schievink a=OptimalStrategy Initializing tuple structs explicitly, like in the example below, produces a "Shorthand struct initialization" diagnostic that leads to a compilation error when applied: ```rust struct S(usize); fn main() { let s = S { 0: 0 }; // OK, but triggers the diagnostic // let s = S { 0 }; // Compilation error } ``` This PR adds a check that the field name is not a literal. Co-authored-by: OptimalStrategy <[email protected]> Co-authored-by: OptimalStrategy <[email protected]>
| * | simplify determining whether the field is a tuple fieldOptimalStrategy2020-06-121-5/+1
| | |
| * | Fix invalid shorthand initialization diagnostic for tuple structsOptimalStrategy2020-06-121-1/+18
| | |
* | | Merge #4855bors[bot]2020-06-123-143/+143
|\ \ \ | | | | | | | | | | | | | | | | | | | | | | | | | | | | 4855: Use more idiomatic style for lifetimes in generated code r=matklad a=Veetaha Co-authored-by: Veetaha <[email protected]>
| * | | Apply codegen with idiomatic lifetimesVeetaha2020-06-112-141/+141
| | | |
| * | | Use more idiomatic style for lifetimes in generated codeVeetaha2020-06-111-2/+2
| |/ /
* | | Merge #4856bors[bot]2020-06-122-6/+6
|\ \ \ | | | | | | | | | | | | | | | | | | | | | | | | | | | | 4856: Simplify r=matklad a=Veetaha Co-authored-by: Veetaha <[email protected]>
| * | | SimplifyVeetaha2020-06-122-6/+6
| |/ /
* | | Merge #4858bors[bot]2020-06-122-21/+77
|\ \ \ | |/ / |/| | | | | | | | | | | | | | | | | | | | | | | 4858: find_path: return shorter paths for external items r=flodiebold a=jonas-schievink If a containing module is already in scope, there's no need to use the full path to the item. Fixes https://github.com/rust-analyzer/rust-analyzer/issues/4846 Co-authored-by: Jonas Schievink <[email protected]>
| * | find_path: return shorter paths for external itemsJonas Schievink2020-06-122-21/+77
|/ / | | | | | | | | If a containing module is already in scope, there's no need to use the full path to the item.
* | Merge #4833bors[bot]2020-06-1114-291/+843
|\ \ | | | | | | | | | | | | | | | | | | | | | 4833: Separating parsing of `for` in predicates and types r=matklad a=matthewjasper We now correctly accept `for<'a> (&'a F): Fn(&'a str)` in a where clause and correctly reject `for<'a> &'a u32` as a type. Co-authored-by: Matthew Jasper <[email protected]>
| * | Add example of old trait object syntaxMatthew Jasper2020-06-113-1/+39
| | |
| * | Move complex inline test to own fileMatthew Jasper2020-06-117-372/+670
| | |
| * | Separating parsing of `for` in predicates and typesMatthew Jasper2020-06-1012-291/+507
| | |
* | | Merge #4849bors[bot]2020-06-117-73/+65
|\ \ \ | | | | | | | | | | | | | | | | | | | | | | | | | | | | 4849: Make known paths use `core` instead of `std` r=matklad a=jonas-schievink I'm not sure if this causes problems today, but it seems like it easily could, if rust-analyzer processes the libstd sources for the right `--target` and that target is a `#![no_std]`-only target. Co-authored-by: Jonas Schievink <[email protected]>
| * | | Update wrap return testsJonas Schievink2020-06-111-29/+17
| | | | | | | | | | | | | | | | Update "no diagnostic" tests, use `()` instead of `String`
| * | | Make known paths use `core` instead of `std`Jonas Schievink2020-06-117-48/+52
| | | |
* | | | Merge #4850bors[bot]2020-06-111-6/+32
|\ \ \ \ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 4850: Indent chain `.` even if there's more stuff afterwards r=matklad a=matklad bors r+ 🤖 Co-authored-by: Aleksey Kladov <[email protected]>
| * | | | Indent chain `.` even if there's more stuff afterwardsAleksey Kladov2020-06-111-6/+32
| |/ / /
* | | | Merge #4847bors[bot]2020-06-111-10/+10
|\ \ \ \ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 4847: Update crates r=kjeremy a=kjeremy Co-authored-by: kjeremy <[email protected]>
| * | | | Update crateskjeremy2020-06-111-10/+10
|/ / / /
* | | | Merge #4845bors[bot]2020-06-111-2/+3
|\ \ \ \ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 4845: Updated yanked crate r=kjeremy a=kjeremy Co-authored-by: kjeremy <[email protected]>
| * | | | Updated yanked cratekjeremy2020-06-111-2/+3
|/ / / /
* | | | Merge #4844bors[bot]2020-06-114-29/+3
|\ \ \ \ | |/ / / |/| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 4844: Remove dead code r=matklad a=matklad bors r+ 🤖 Co-authored-by: Aleksey Kladov <[email protected]>
| * | | Remove dead codeAleksey Kladov2020-06-114-29/+3
|/ / /
* | | Merge #4843bors[bot]2020-06-1117-77/+116
|\ \ \ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 4843: Don't guess macro expansion crate r=matklad a=matklad bors r+ 🤖 Co-authored-by: Aleksey Kladov <[email protected]>
| * | | Don't guess macro expansion crateAleksey Kladov2020-06-119-62/+89
| | | |
| * | | Make relevant_crates return a SetAleksey Kladov2020-06-1111-24/+36
| | | |
* | | | Merge #4819bors[bot]2020-06-117-44/+537
|\ \ \ \ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 4819: Add an FST index to `ImportMap` and use it to speed up auto import r=matklad a=jonas-schievink For the importing crate, we still use the symbol index, but I've modified it to only look at files that comprise that crate (instead of the whole workspace). Oh, and since now the symbol query limit is respected correctly, it's possible that some results from the local crate now disappear if there are many matches. Fixes https://github.com/rust-analyzer/rust-analyzer/issues/4763 Co-authored-by: Jonas Schievink <[email protected]>
| * | | | Add symbol index FIXMEJonas Schievink2020-06-111-0/+3
| | | | |
| * | | | ImportMap: use IndexMap internallyJonas Schievink2020-06-103-9/+14
| | | | | | | | | | | | | | | | | | | | | | | | | It iterates in insertion order, which makes the ordering more predictable.
| * | | | Respect casing when searching for importsJonas Schievink2020-06-103-6/+81
| | | | |
| * | | | Move limit check downJonas Schievink2020-06-101-1/+1
| | | | |
generated by cgit v1.2.3 (git 2.25.1) at 2024-11-26 04:42:52 +0000