From b9f3c5d585ee266f0fd5db77c2a3f331a0bddf2d Mon Sep 17 00:00:00 2001 From: Aleksey Kladov Date: Fri, 19 Jun 2020 15:07:32 +0200 Subject: 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. --- crates/stdx/src/lib.rs | 1 - 1 file changed, 1 deletion(-) (limited to 'crates/stdx') diff --git a/crates/stdx/src/lib.rs b/crates/stdx/src/lib.rs index c0356344c..f2ff0e435 100644 --- a/crates/stdx/src/lib.rs +++ b/crates/stdx/src/lib.rs @@ -1,5 +1,4 @@ //! Missing batteries for standard libraries. - use std::{cell::Cell, fmt, time::Instant}; #[inline(always)] -- cgit v1.2.3