searchengines-web/MeiliSearch
searchengines-web/MeiliSearch
1
0
Fork 0
mirror of https://github.com/meilisearch/MeiliSearch synced 2024-11-26 14:54:27 +01:00
Code Issues Releases Wiki Activity

feat: Improve the readability of the ranking function

Browse Source
This commit is contained in:
Kerollmops 2018-08-22 21:12:13 +02:00 committed by Clément Renault
parent 2e0193a39e
commit 0b02e31ce9
1 changed files with 15 additions and 14 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

29
raptor/src/rank/mod.rs
View File

@ -78,12 +78,6 @@ impl Pool {
} }
} }
fn invert_sorts<F>(a: &Document, b: &Document, sorts: &[F]) -> bool
where F: Fn(&Document, &Document) -> Ordering,
{
sorts.iter().rev().all(|sort| sort(a, b) == Ordering::Equal)
}
impl IntoIterator for Pool { impl IntoIterator for Pool {
type Item = Document; type Item = Document;
type IntoIter = vec::IntoIter<Self::Item>; type IntoIter = vec::IntoIter<Self::Item>;
@ -98,14 +92,21 @@ impl IntoIterator for Pool {
exact, exact,
]; ];
for (i, sort) in sorts.iter().enumerate() { {
let mut computed = 0; let mut groups = vec![self.documents.as_mut_slice()];
for group in GroupByMut::new(&mut self.documents, |a, b| invert_sorts(a, b, &sorts[..i])) {
// TODO prefer using `sort_unstable_by_key` to allow reusing the key computation for sort in sorts {
// `number of words` needs to be reversed, we can use the `cmp::Reverse` struct to do that let mut temp = mem::replace(&mut groups, Vec::new());
group.sort_unstable_by(sort); let mut computed = 0;
computed += group.len();
if computed >= self.limit { break } for group in temp {
group.sort_unstable_by(sort);
for group in GroupByMut::new(group, |a, b| sort(a, b) == Ordering::Equal) {
computed += group.len();
groups.push(group);
if computed >= self.limit { break }
}
}
} }
} }