| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Merge #6785 | bors[bot] | 2020-12-09 | 1 | -4/+5 |
| |\ | | | | | | | | | | | | | | | | | | | | | | | 6785: Fix "no value set for FileTextQuery(FileId(..))" r=jonas-schievink a=jonas-schievink Fixes https://github.com/rust-analyzer/rust-analyzer/issues/6622 Let's hope I got it right this time, but I feel like I slowly begin to understand the main loop logic. bors r+ Co-authored-by: Jonas Schievink <[email protected]> | ||||
| | * | Fix "no value set for FileTextQuery(FileId(..))" | Jonas Schievink | 2020-12-09 | 1 | -4/+5 |
| | | | |||||
| * | | . | Aleksey Kladov | 2020-12-09 | 1 | -1/+5 |
| |/ | |||||
| * | Minor, push allocations down | Aleksey Kladov | 2020-07-14 | 1 | -2/+2 |
| | | |||||
| * | Optimize VFS processing | Aleksey Kladov | 2020-07-10 | 1 | -1/+1 |
| | | |||||
| * | Also reload when adding new examples, tests, etc | Aleksey Kladov | 2020-07-10 | 1 | -1/+1 |
| | | |||||
| * | New VFS | Aleksey Kladov | 2020-06-23 | 1 | -1/+0 |
| | | |||||
| * | Speedup VFS::partition | Aleksey Kladov | 2020-06-19 | 1 | -0/+3 |
| | | | | | | | | | | | The task of `partition` function is to bin the flat list of paths into disjoint filesets. Ideally, it should be incremental -- each new file should be added to a specific fileset. However, preliminary measurnments show that it is actually fast enough if we just optimize this to use a binary search instead of a linear scan. | ||||
| * | New VFS API | Aleksey Kladov | 2020-06-16 | 1 | -0/+138 |
 |
index : rust-analyzer | |
| [FORK] modified to work on wasm targets |
| aboutsummaryrefslogtreecommitdiff |