aboutsummaryrefslogtreecommitdiff
Commit message (Collapse)AuthorAgeFilesLines
...
| * | | | Prepare SourceDatabase API for lazy file loadingAleksey Kladov2019-10-1414-88/+121
| | | | |
* | | | | Merge #2006bors[bot]2019-10-147-50/+49
|\ \ \ \ \ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 2006: Improvements around `Arc<[T]>` r=matklad a=sinkuu First commit tries to avoid cloning `Arc<[T]>` to a temporary `Vec` for mutating it, if there are no other strong references. Second commit utilizes [`FromIterator for Arc<[T]>`](https://doc.rust-lang.org/std/sync/struct.Arc.html#impl-FromIterator%3CT%3E) instead of `.collect::<Vec<_>>().into()` to avoid allocation in `From<Vec<T>> for Arc<[T]>`. Co-authored-by: Shotaro Yamada <[email protected]>
| * | | | | make_mut_sliceShotaro Yamada2019-10-144-42/+23
| | | | | |
| * | | | | import make_mut_arc_sliceShotaro Yamada2019-10-141-1/+2
| | | | | |
| * | | | | `.collect()` directly into `Arc<[T]>`Shotaro Yamada2019-10-144-25/+18
| | | | | |
| * | | | | Avoid cloning `Arc<[T]>` into a vec if possibleShotaro Yamada2019-10-145-31/+55
| | |_|/ / | |/| | |
* | | | | Merge #2007bors[bot]2019-10-143-21/+26
|\ \ \ \ \ | | |/ / / | |/| | | | | | | | | | | | | | | | | | | | | | | | | | | | 2007: remove one more dependency on source roots r=matklad a=matklad Co-authored-by: Aleksey Kladov <[email protected]>
| * | | | remove one more dependency on source rootsAleksey Kladov2019-10-143-21/+26
| |/ / /
* | | | Merge #2002bors[bot]2019-10-146-13/+4
|\ \ \ \ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 2002: Remove unused dependencies r=matklad a=sinkuu Co-authored-by: Shotaro Yamada <[email protected]>
| * | | | Update Cargo.lockShotaro Yamada2019-10-141-0/+1
| | | | |
| * | | | Enable `serde` feature in ra_syntax/Cargo.tomlShotaro Yamada2019-10-141-0/+5
| | | | |
| * | | | Remove unused dependenciesShotaro Yamada2019-10-124-13/+0
| | | | |
| * | | | Remove smol_str dependency from ra_syntaxShotaro Yamada2019-10-112-5/+3
| | |/ / | |/| |
* | | | Merge #1999bors[bot]2019-10-141-1/+1
|\ \ \ \ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 1999: Simplify find().is_some() to any() r=matklad a=kjeremy Co-authored-by: kjeremy <[email protected]>
| * | | | use any()kjeremy2019-10-111-1/+1
| |/ / /
* | | | Merge #2000bors[bot]2019-10-141-1/+1
|\ \ \ \ | |_|/ / |/| | | | | | | | | | | | | | | | | | | | | | | 2000: Use correct db type r=matklad a=kjeremy I think this is more correct. No test fallouts. Co-authored-by: kjeremy <[email protected]>
| * | | Use correct db typekjeremy2019-10-111-1/+1
| |/ /
* | | Merge #2005bors[bot]2019-10-124-13/+103
|\ \ \ | | | | | | | | | | | | | | | | | | | | | | | | | | | | 2005: add syntax-tree based indents r=matklad a=matklad Co-authored-by: Aleksey Kladov <[email protected]>
| * | | add syntax-tree based indentsAleksey Kladov2019-10-124-13/+103
|/ / /
* | | Merge #2004bors[bot]2019-10-124-1135/+1192
|\ \ \ | |/ / |/| | | | | | | | | | | | | | | | | | | | | | | 2004: Split up infer.rs further r=flodiebold a=flodiebold - coercion logic goes to `coerce.rs` - expression inference goes to `expr.rs` - pattern inference goes to `pat.rs` Co-authored-by: Florian Diebold <[email protected]>
| * | Split up infer.rs furtherFlorian Diebold2019-10-124-1135/+1192
|/ / | | | | | | | | | | - coercion logic goes to `coerce.rs` - expression inference goes to `expr.rs` - pattern inference goes to `pat.rs`
* | Merge #1989bors[bot]2019-10-112-30/+39
|\ \ | | | | | | | | | | | | | | | | | | | | | 1989: Chalk update to simplified IR r=flodiebold a=kjeremy Co-authored-by: kjeremy <[email protected]>
| * | Chalk update to simplified IRkjeremy2019-10-102-30/+39
| | |
* | | Merge #1996bors[bot]2019-10-111-3/+3
|\ \ \ | | | | | | | | | | | | | | | | | | | | | | | | | | | | 1996: reduce visibility r=matklad a=matklad Co-authored-by: Aleksey Kladov <[email protected]>
| * | | reduce visibilityAleksey Kladov2019-10-111-3/+3
|/ / /
* | | Merge #1995bors[bot]2019-10-112-1/+4
|\ \ \ | | | | | | | | | | | | | | | | | | | | | | | | | | | | 1995: save disk space r=matklad a=matklad Co-authored-by: Aleksey Kladov <[email protected]>
| * | | save disk spaceAleksey Kladov2019-10-112-1/+4
|/ / /
* | | Merge #1994bors[bot]2019-10-115-48/+71
|\ \ \ | | | | | | | | | | | | | | | | | | | | | | | | | | | | 1994: remove last traces of source roots from hir r=matklad a=matklad Co-authored-by: Aleksey Kladov <[email protected]>
| * | | remove last traces of source roots from hirAleksey Kladov2019-10-115-48/+71
| | | |
* | | | Merge #1991bors[bot]2019-10-113-14/+4
|\ \ \ \ | |/ / / |/| | | | | | | | | | | | | | | | | | | | | | | 1991: Use `original_file` instead of `as_original_file` r=matklad a=sinkuu I saw ra_lsp_server panics originating from `as_original_file`, though I have not been able to reproduce. Co-authored-by: Shotaro Yamada <[email protected]>
| * | | Remove `as_original_file`Shotaro Yamada2019-10-101-10/+0
| | | |
| * | | Use `original_file` instead of `as_original_file`Shotaro Yamada2019-10-102-4/+4
|/ / /
* | | Merge #1988bors[bot]2019-10-101-29/+28
|\ \ \ | |/ / |/| | | | | | | | | | | | | | | | | 1988: Update all crates that do not introduce new dependencies r=matklad a=kjeremy Co-authored-by: kjeremy <[email protected]>
| * | Update all crates that do not pull in new dependencieskjeremy2019-10-101-29/+28
|/ /
* | Merge #1981bors[bot]2019-10-104-36/+33
|\ \ | | | | | | | | | | | | | | | | | | | | | 1981: tweak fn labels in completion r=matklad a=matklad Co-authored-by: Aleksey Kladov <[email protected]>
| * | tweak fn labels in completionAleksey Kladov2019-10-104-36/+33
| | |
* | | Merge #1986bors[bot]2019-10-103-55/+42
|\ \ \ | |/ / |/| | | | | | | | | | | | | | | | | 1986: don't special case module attrs r=matklad a=matklad bors r+ Co-authored-by: Aleksey Kladov <[email protected]>
| * | don't special case macro_useAleksey Kladov2019-10-103-23/+13
| | |
| * | don't special case path attrAleksey Kladov2019-10-103-34/+31
| | |
* | | Merge #1985bors[bot]2019-10-102-10/+13
|\| | | | | | | | | | | | | | | | | | | | | | | 1985: simplify a bit r=matklad a=matklad Co-authored-by: Aleksey Kladov <[email protected]>
| * | simplify a bitAleksey Kladov2019-10-102-10/+13
| | |
* | | Merge #1984bors[bot]2019-10-102-29/+21
|\ \ \ | | | | | | | | | | | | | | | | | | | | | | | | | | | | 1984: Bump rollup and vsce r=matklad a=kjeremy I got sick of the vsce warning on install and noticed that rollup was also out of date. Co-authored-by: kjeremy <[email protected]>
| * | | Bump rollup and vscekjeremy2019-10-102-29/+21
| |/ /
* | | Merge #1983bors[bot]2019-10-101-1/+1
|\ \ \ | |/ / |/| | | | | | | | | | | | | | | | | 1983: engine.vscode and @types/vscode should match r=matklad a=kjeremy Per https://code.visualstudio.com/api/working-with-extensions/testing-extension Co-authored-by: kjeremy <[email protected]>
| * | engine.vscode and @types/vscode should matchkjeremy2019-10-101-1/+1
|/ /
* | Merge #1979bors[bot]2019-10-104-282/+233
|\ \ | | | | | | | | | | | | | | | | | | | | | 1979: Refactor and fix some more edge cases around name resolution r=matklad a=matklad Co-authored-by: Aleksey Kladov <[email protected]>
| * | simplify some testsAleksey Kladov2019-10-101-90/+24
| | |
| * | Refactor and fix some more edge cases around name resolutionAleksey Kladov2019-10-104-192/+209
|/ /
* | Merge #1978bors[bot]2019-10-105-475/+562
|\ \ | | | | | | | | | | | | | | | | | | | | | 1978: if completion does auto-insertion, indicate this in the label r=matklad a=matklad bors try Co-authored-by: Aleksey Kladov <[email protected]>
| * | if completion does auto-insertion, indicate this in the labelAleksey Kladov2019-10-105-475/+562
|/ /
generated by cgit v1.2.3 (git 2.25.1) at 2024-12-30 18:04:22 +0000