diff options
| author | Aleksey Kladov <[email protected]> | 2020-06-19 14:07:32 +0100 |
|---|---|---|
| committer | Aleksey Kladov <[email protected]> | 2020-06-19 14:07:32 +0100 |
| commit | b9f3c5d585ee266f0fd5db77c2a3f331a0bddf2d (patch) | |
| tree | dae453e237a54c1a4e86634b71fae8890e850796 /crates/ra_syntax/test_data/parser/ok/0012_visibility.rast | |
| parent | 902a9c6da7939abec74bb4e4be9d1d16dfb15daa (diff) | |
Speedup VFS::partition
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.
Diffstat (limited to 'crates/ra_syntax/test_data/parser/ok/0012_visibility.rast')
0 files changed, 0 insertions, 0 deletions