aboutsummaryrefslogtreecommitdiff
path: root/crates
Commit message (Collapse)AuthorAgeFilesLines
...
| * | kill krate_implAleksey Kladov2019-05-233-26/+12
| | |
| * | fix signatureAleksey Kladov2019-05-231-4/+4
| | |
* | | Merge #1290bors[bot]2019-05-2313-26/+102
|\| | | |/ |/| | | | | | | | | | | | | | | | | | | | | | | | | 1290: Add Union to code_model r=matklad a=matklad @flodiebold I am conflicted about two possible implementation approaches: * we can add a separate `struct Union` to code model * we can add `fn is_union(&self)` to existing `Struct` This PR goes with the former approach, because it seems like Unions are sufficiently different in semantics to warrant a separate types. Which is in contrast to Syntax Tree, where both structs and unions share the same node kind, because their syntax is the same. What would be the right thing to do here? Co-authored-by: Aleksey Kladov <[email protected]>
| * add union to code_modelAleksey Kladov2019-05-2313-26/+102
| |
* | Merge #1312bors[bot]2019-05-235-201/+259
|\ \ | |/ |/| | | | | | | | | | | | | | | | | | | | | | | | | | | 1312: Introduce TokenBuffer r=matklad a=edwin0cheng As discussed in Zulip, this PR Introduce `TokenBuffer` , a safe version of `syn` crate `TokenBuffer` which support cursor based traversal of `tt::TokenTree`. This is the basis of incoming refactoring of `TokenSource` iterator based API. This PR do the following things: * Add TokenBuffer in `ra_tt` crate. * Try to use this new API to refactor the `SubtreeSource` to prove it usage. Co-authored-by: Edwin Cheng <[email protected]>
| * Use slice instead of VecEdwin Cheng2019-05-231-4/+4
| |
| * FormattingEdwin Cheng2019-05-231-1/+1
| |
| * Refactor SubtreeSourceEdwin Cheng2019-05-223-201/+88
| |
| * Introduce TokenBufferEdwin Cheng2019-05-222-0/+171
| |
* | Improve highlighting of name refsLaurențiu Nicola2019-05-232-9/+168
| |
* | Merge #1311bors[bot]2019-05-234-97/+143
|\ \ | | | | | | | | | | | | | | | | | | | | | 1311: Move NameRef classification logic out of reference_definition r=matklad a=lnicola Co-authored-by: Laurențiu Nicola <[email protected]>
| * | Move NameRef classification logic out of reference_definitionLaurențiu Nicola2019-05-234-97/+143
| | |
* | | updated gen_lsp_server examplesDylan Moonfire2019-05-234-9/+170
|/ / | | | | | | | | - updated the documentation with an example that has no errors with current compiler - added two example code to test compilation and show in use
* | add profile calls to parsing/expansion routinesAleksey Kladov2019-05-223-1/+7
| |
* | Merge #1281bors[bot]2019-05-223-117/+263
|\ \ | |/ |/| | | | | | | | | | | 1281: Move arm cond to match guard r=matklad a=unrealhoang I did split the rename to another commit, yet Github UI still show entirely new file change. Please review using commits. Co-authored-by: Unreal Hoang <[email protected]>
| * add assist to move arm condition to match guardUnreal Hoang2019-05-213-117/+263
| |
| * renameUnreal Hoang2019-05-162-2/+2
| |
* | better profiligAleksey Kladov2019-05-212-8/+28
| |
* | Fix crash with int vars in canonicalizationFlorian Diebold2019-05-211-1/+6
| |
* | Use fuel branch for ChalkFlorian Diebold2019-05-212-4/+4
| | | | | | | | This makes sure we don't take too long in trait solving.
* | re-enable chalkAleksey Kladov2019-05-211-17/+16
| |
* | publish gen_lsp_server 0.2Aleksey Kladov2019-05-212-17/+18
| |
* | Merge #1299bors[bot]2019-05-211-1/+18
|\ \ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 1299: Use ThemeColor and add support for light themes r=matklad a=lnicola Part of #1294. - switch to `ThemeColor` - add light and high contrast theme definitions - highlight control flow keywords and `unsafe` Co-authored-by: Laurențiu Nicola <[email protected]>
| * | Address feedbackLaurențiu Nicola2019-05-211-4/+11
| | |
| * | Use ThemeColor and add support for light themesLaurențiu Nicola2019-05-211-1/+11
| | |
* | | profile type inferenceAleksey Kladov2019-05-214-3/+6
| | |
* | | profile implements queryAleksey Kladov2019-05-211-0/+2
| | |
* | | fix odrer-of-iteration bug in testsAleksey Kladov2019-05-212-7/+15
| | |
* | | sort hash maps for testsAleksey Kladov2019-05-215-212/+196
| | |
* | | Merge #1296bors[bot]2019-05-212-2/+2
|\ \ \ | | | | | | | | | | | | | | | | | | | | | | | | | | | | 1296: :arrow_up: insta r=matklad a=matklad Co-authored-by: Aleksey Kladov <[email protected]>
| * | | :arrow_up: instaAleksey Kladov2019-05-212-2/+2
| |/ /
* / / add _query to query functionsAleksey Kladov2019-05-212-6/+6
|/ /
* | add is_union to structs ASTAleksey Kladov2019-05-201-1/+17
| |
* | remove minor code duplicationAleksey Kladov2019-05-202-20/+16
| |
* | Merge #1289bors[bot]2019-05-201-38/+39
|\ \ | | | | | | | | | | | | | | | | | | | | | 1289: simplify r=matklad a=matklad Co-authored-by: Aleksey Kladov <[email protected]>
| * | simplifyAleksey Kladov2019-05-201-38/+39
| | |
* | | Merge #1287bors[bot]2019-05-202-1/+19
|\ \ \ | |/ / |/| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 1287: Add support of matching literal in mbe r=matklad a=edwin0cheng This PR adds support of matching literal in mbe , which used in our `T` macro : ```rust macro_rules! foo { ('(') => { fn foo() {} } } ``` Co-authored-by: Edwin Cheng <[email protected]>
| * | Fix match literalEdwin Cheng2019-05-202-1/+19
| | |
* | | output the progress for realAleksey Kladov2019-05-201-1/+4
|/ /
* | Merge #1286bors[bot]2019-05-205-17/+86
|\ \ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 1286: Add infer for generic default type r=flodiebold a=edwin0cheng This PR add infer support for generic default type: ``` struct Gen<T=u32> { val: T } ``` * add the (unresolved) defaults from the definition to GenericParams * add a query generic_defaults that resolves those defaults to types and returns a Substs * add the missing type in `substs_from_path_segment` * add tests based on the idea in this [comment](https://github.com/rust-analyzer/rust-analyzer/issues/1099#issuecomment-484206279) Co-authored-by: Edwin Cheng <[email protected]>
| * | Use normal iteration instead of walk_mutEdwin Cheng2019-05-201-8/+5
| | |
| * | Add infer for generic default typeEdwin Cheng2019-05-194-15/+80
| | |
| * | Add default type to GenericParamEdwin Cheng2019-05-191-3/+10
| |/
* | Assert that DB is unwind-safe, instead of provingAleksey Kladov2019-05-181-3/+4
| | | | | | | | | | | | | | | | | | | | | | | | | | Unfortunately, that `: RefUnwindSafe` bound gives rustc a hard time, so let's remove it for know. See * https://github.com/rust-analyzer/rust-analyzer/issues/1283 * https://github.com/rust-lang/rust/pull/60444 * https://github.com/rust-lang/rust/issues/58291 closes #1283
* | :arrow_up: text_unitAleksey Kladov2019-05-152-40/+27
| |
* | apply T! macro where it is possibleSergey Parilin2019-05-1538-623/+619
| |
* | fixed macro for bracketsSergey Parilin2019-05-152-3/+3
|/
* show current function in analysis-stats progress barAleksey Kladov2019-05-142-3/+8
|
* allow expanding expressionsAleksey Kladov2019-05-142-7/+8
|
* expand to syntax nodeAleksey Kladov2019-05-146-26/+33
|
generated by cgit v1.2.3 (git 2.25.1) at 2024-11-24 19:18:36 +0000