| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Extract tests module to file in vfs crate | Daiki Ihara | 2020-11-30 | 1 | -50/+1 |
| | | |||||
| * | Move rust-related logic from vfs to base_db level | Kirill Bulatov | 2020-09-09 | 1 | -60/+5 |
| | | |||||
| * | Properly handle special cases (binaries, mod.rs) | Kirill Bulatov | 2020-09-09 | 1 | -26/+58 |
| | | |||||
| * | Small refactoring | Kirill Bulatov | 2020-09-09 | 1 | -11/+11 |
| | | |||||
| * | Happy path implemented | Kirill Bulatov | 2020-09-09 | 1 | -6/+11 |
| | | |||||
| * | Properly use FileSet API | Kirill Bulatov | 2020-09-09 | 1 | -21/+25 |
| | | |||||
| * | Better API | Kirill Bulatov | 2020-09-09 | 1 | -14/+14 |
| | | |||||
| * | First steps for mod<|> completion | Kirill Bulatov | 2020-09-09 | 1 | -2/+25 |
| | | |||||
| * | Add one more test | Aleksey Kladov | 2020-07-26 | 1 | -21/+50 |
| | | |||||
| * | Minor, push allocations down | Aleksey Kladov | 2020-07-14 | 1 | -1/+1 |
| | | |||||
| * | Replace ad hocery with science | Aleksey Kladov | 2020-07-07 | 1 | -56/+49 |
| | | |||||
| * | Fix symbol search in salsa | Aleksey Kladov | 2020-07-07 | 1 | -19/+90 |
| | | | | | | | | | | | | | | | | | | | | | | | Previous solution for binning paths into disjoint directories was simple and fast -- just a single binary search. Unfortunatelly, it wasn't coorrect: if the ditr are /d /d/a /d/c then partitioning the file /d/b/lib.rs won't pick /d as a correct directory. The correct solution here is a trie, but it requires exposing path components. So, we use a poor man's substitution -- a *vector* of sorted paths, such that each bucket is prefix-free closes #5246 | ||||
| * | FileSetConfig works with empty set of roots | Aleksey Kladov | 2020-07-01 | 1 | -1/+1 |
| | | | | | Closes #5139 | ||||
| * | Make VFS join methods fallible | Jonas Schievink | 2020-06-26 | 1 | -1/+1 |
| | | |||||
| * | New VFS | Aleksey Kladov | 2020-06-23 | 1 | -10/+5 |
| | | |||||
| * | Speedup VFS::partition | Aleksey Kladov | 2020-06-19 | 1 | -9/+23 |
| | | | | | | | | | | | 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/+99 |
 |
index : rust-analyzer | |
| [FORK] modified to work on wasm targets |
| aboutsummaryrefslogtreecommitdiff |