snowykami/meilisearch
1
0
Fork 0
mirror of https://github.com/meilisearch/meilisearch.git synced 2025-10-31 07:56:28 +00:00
Code Issues 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
1 changed files with 13 additions and 25 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -640,36 +640,24 @@ 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();
// Make sure we don't try to work with entries already managed by the spilled
let mut ordered_entries: Vec<_> =
map.iter_mut().filter(|(_, bbbul)| !bbbul.is_empty()).collect();
ordered_entries.sort_unstable_by_key(|(key, _)| *key);
loop {
let mut ordered_buffer: Vec<_> = iter.by_ref().take(order_count).collect();
ordered_buffer.sort_unstable_by_key(|(key, _)| *key);
for (key, bbbul) in ordered_entries {
let mut output = DelAddRoaringBitmap::empty();
output.union_and_clear_bbbul(bbbul);
if ordered_buffer.is_empty() {
break;
for rhs in maps.iter_mut() {
if let Some(new) = rhs.get_mut(key) {
output.union_and_clear_bbbul(new);
}
}
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 output = DelAddRoaringBitmap::empty();
output.union_and_clear_bbbul(bbbul);
for rhs in maps.iter_mut() {
if let Some(new) = rhs.get_mut(key) {
output.union_and_clear_bbbul(new);
}
}
// We send the merged entry outside.
(f)(key, output)?;
}
// We send the merged entry outside.
(f)(key, output)?;
}
}