Ade Attwood
2429fe725c
Instead of doing two passes of all candidates using map then a filter,
this uses `filter_map` so we are only doing one pass for the candidates.
This alone is quite a significant improvement of ~7%
Output of `./scripts/bench 0.x`
Benchmark 1: 0.x
Time (mean ± σ): 2.373 s ± 0.138 s [User: 10.617 s, System: 1.697 s]
Range (min … max): 2.124 s … 2.577 s 10 runs
Benchmark 2: HEAD
Time (mean ± σ): 2.206 s ± 0.133 s [User: 10.061 s, System: 1.811 s]
Range (min … max): 1.940 s … 2.433 s 10 runs
Summary
HEAD ran
1.08 ± 0.09 times faster than 0.x
-------------------------------------
The percentage difference is -7.00%
-------------------------------------
43 lines
956 B
Rust
43 lines
956 B
Rust
use super::matcher;
|
|
use rayon::prelude::*;
|
|
|
|
pub struct Match {
|
|
pub score: i64,
|
|
pub content: String,
|
|
}
|
|
|
|
pub struct Options {
|
|
pub pattern: String,
|
|
pub minimum_score: i64,
|
|
}
|
|
|
|
impl Options {
|
|
pub fn new(pattern: String) -> Self {
|
|
Self {
|
|
pattern,
|
|
minimum_score: 25,
|
|
}
|
|
}
|
|
}
|
|
|
|
pub fn sort_strings(options: Options, strings: Vec<String>) -> Vec<Match> {
|
|
let matcher = matcher::Matcher::new(options.pattern);
|
|
|
|
let mut matches = strings
|
|
.into_par_iter()
|
|
.filter_map(|candidate| {
|
|
let score = matcher.score(candidate.as_str());
|
|
if score < options.minimum_score {
|
|
None
|
|
} else {
|
|
Some(Match {
|
|
score,
|
|
content: candidate,
|
|
})
|
|
}
|
|
})
|
|
.collect::<Vec<Match>>();
|
|
|
|
matches.par_sort_unstable_by(|a, b| a.score.cmp(&b.score));
|
|
matches
|
|
}
|