snowykami/meilisearch
1
0
Fork 0
mirror of https://github.com/meilisearch/meilisearch.git synced 2025-01-31 15:31:53 +08:00
Code Issues Actions 2 Packages Projects Releases Wiki Activity

Lexicographically sort all the map to merge

Browse Source
This commit is contained in:
Kerollmops 2024-12-04 17:05:07 +01:00
parent cb99ac6f7e
commit 2e32d0474c
No known key found for this signature in database
GPG Key ID: F250A4C4E3AE5F5F
1 changed files with 13 additions and 25 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

20
crates/milli/src/update/new/extract/cache.rs
View File

@ -640,24 +640,13 @@ where
}
// Then manage the content on the HashMap entries that weren't taken (mem::take).
let order_count = 1000;
while let Some(mut map) = maps.pop() {
let mut iter = map.iter_mut();
loop {
let mut ordered_buffer: Vec<_> = iter.by_ref().take(order_count).collect();
ordered_buffer.sort_unstable_by_key(|(key, _)| *key);
if ordered_buffer.is_empty() {
break;
}
for (key, bbbul) in ordered_buffer {
// Make sure we don't try to work with entries already managed by the spilled
if bbbul.is_empty() {
continue;
}
let mut ordered_entries: Vec<_> =
map.iter_mut().filter(|(_, bbbul)| !bbbul.is_empty()).collect();
ordered_entries.sort_unstable_by_key(|(key, _)| *key);
for (key, bbbul) in ordered_entries {
let mut output = DelAddRoaringBitmap::empty();
output.union_and_clear_bbbul(bbbul);
@ -671,7 +660,6 @@ where
(f)(key, output)?;
}
}
}
Ok(())
}