|
| 1 | +use core::hint::black_box; |
| 2 | +use std::collections::{BTreeSet, HashSet}; |
| 3 | +use std::hash::{DefaultHasher, Hash, Hasher}; |
| 4 | +use std::path::*; |
| 5 | + |
| 6 | +#[bench] |
| 7 | +#[cfg_attr(miri, ignore)] // Miri isn't fast... |
| 8 | +fn bench_path_cmp_fast_path_buf_sort(b: &mut test::Bencher) { |
| 9 | + let prefix = "my/home"; |
| 10 | + let mut paths: Vec<_> = |
| 11 | + (0..1000).map(|num| PathBuf::from(prefix).join(format!("file {num}.rs"))).collect(); |
| 12 | + |
| 13 | + paths.sort(); |
| 14 | + |
| 15 | + b.iter(|| { |
| 16 | + black_box(paths.as_mut_slice()).sort_unstable(); |
| 17 | + }); |
| 18 | +} |
| 19 | + |
| 20 | +#[bench] |
| 21 | +#[cfg_attr(miri, ignore)] // Miri isn't fast... |
| 22 | +fn bench_path_cmp_fast_path_long(b: &mut test::Bencher) { |
| 23 | + let prefix = "/my/home/is/my/castle/and/my/castle/has/a/rusty/workbench/"; |
| 24 | + let paths: Vec<_> = |
| 25 | + (0..1000).map(|num| PathBuf::from(prefix).join(format!("file {num}.rs"))).collect(); |
| 26 | + |
| 27 | + let mut set = BTreeSet::new(); |
| 28 | + |
| 29 | + paths.iter().for_each(|p| { |
| 30 | + set.insert(p.as_path()); |
| 31 | + }); |
| 32 | + |
| 33 | + b.iter(|| { |
| 34 | + set.remove(paths[500].as_path()); |
| 35 | + set.insert(paths[500].as_path()); |
| 36 | + }); |
| 37 | +} |
| 38 | + |
| 39 | +#[bench] |
| 40 | +#[cfg_attr(miri, ignore)] // Miri isn't fast... |
| 41 | +fn bench_path_cmp_fast_path_short(b: &mut test::Bencher) { |
| 42 | + let prefix = "my/home"; |
| 43 | + let paths: Vec<_> = |
| 44 | + (0..1000).map(|num| PathBuf::from(prefix).join(format!("file {num}.rs"))).collect(); |
| 45 | + |
| 46 | + let mut set = BTreeSet::new(); |
| 47 | + |
| 48 | + paths.iter().for_each(|p| { |
| 49 | + set.insert(p.as_path()); |
| 50 | + }); |
| 51 | + |
| 52 | + b.iter(|| { |
| 53 | + set.remove(paths[500].as_path()); |
| 54 | + set.insert(paths[500].as_path()); |
| 55 | + }); |
| 56 | +} |
| 57 | + |
| 58 | +#[bench] |
| 59 | +#[cfg_attr(miri, ignore)] // Miri isn't fast... |
| 60 | +fn bench_path_hashset(b: &mut test::Bencher) { |
| 61 | + let prefix = "/my/home/is/my/castle/and/my/castle/has/a/rusty/workbench/"; |
| 62 | + let paths: Vec<_> = |
| 63 | + (0..1000).map(|num| PathBuf::from(prefix).join(format!("file {num}.rs"))).collect(); |
| 64 | + |
| 65 | + let mut set = HashSet::new(); |
| 66 | + |
| 67 | + paths.iter().for_each(|p| { |
| 68 | + set.insert(p.as_path()); |
| 69 | + }); |
| 70 | + |
| 71 | + b.iter(|| { |
| 72 | + set.remove(paths[500].as_path()); |
| 73 | + set.insert(black_box(paths[500].as_path())) |
| 74 | + }); |
| 75 | +} |
| 76 | + |
| 77 | +#[bench] |
| 78 | +#[cfg_attr(miri, ignore)] // Miri isn't fast... |
| 79 | +fn bench_path_hashset_miss(b: &mut test::Bencher) { |
| 80 | + let prefix = "/my/home/is/my/castle/and/my/castle/has/a/rusty/workbench/"; |
| 81 | + let paths: Vec<_> = |
| 82 | + (0..1000).map(|num| PathBuf::from(prefix).join(format!("file {num}.rs"))).collect(); |
| 83 | + |
| 84 | + let mut set = HashSet::new(); |
| 85 | + |
| 86 | + paths.iter().for_each(|p| { |
| 87 | + set.insert(p.as_path()); |
| 88 | + }); |
| 89 | + |
| 90 | + let probe = PathBuf::from(prefix).join("other"); |
| 91 | + |
| 92 | + b.iter(|| set.remove(black_box(probe.as_path()))); |
| 93 | +} |
| 94 | + |
| 95 | +#[bench] |
| 96 | +fn bench_hash_path_short(b: &mut test::Bencher) { |
| 97 | + let mut hasher = DefaultHasher::new(); |
| 98 | + let path = Path::new("explorer.exe"); |
| 99 | + |
| 100 | + b.iter(|| black_box(path).hash(&mut hasher)); |
| 101 | + |
| 102 | + black_box(hasher.finish()); |
| 103 | +} |
| 104 | + |
| 105 | +#[bench] |
| 106 | +fn bench_hash_path_long(b: &mut test::Bencher) { |
| 107 | + let mut hasher = DefaultHasher::new(); |
| 108 | + let path = |
| 109 | + Path::new("/aaaaa/aaaaaa/./../aaaaaaaa/bbbbbbbbbbbbb/ccccccccccc/ddddddddd/eeeeeee.fff"); |
| 110 | + |
| 111 | + b.iter(|| black_box(path).hash(&mut hasher)); |
| 112 | + |
| 113 | + black_box(hasher.finish()); |
| 114 | +} |
0 commit comments