aboutsummaryrefslogtreecommitdiff
path: root/crates/ra_syntax/test_data/parser/fragments
diff options
context:
space:
mode:
authorbors[bot] <26634292+bors[bot]@users.noreply.github.com>2020-06-19 14:10:52 +0100
committerGitHub <[email protected]>2020-06-19 14:10:52 +0100
commitf6e250bd1b077fce5cef8024fa90fbcb45b5b4f2 (patch)
treedae453e237a54c1a4e86634b71fae8890e850796 /crates/ra_syntax/test_data/parser/fragments
parent902a9c6da7939abec74bb4e4be9d1d16dfb15daa (diff)
parentb9f3c5d585ee266f0fd5db77c2a3f331a0bddf2d (diff)
Merge #4948
4948: Speedup VFS::partition r=matklad a=matklad 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. bors r+ 🤖 Co-authored-by: Aleksey Kladov <[email protected]>
Diffstat (limited to 'crates/ra_syntax/test_data/parser/fragments')
0 files changed, 0 insertions, 0 deletions