searchengines-web/MeiliSearch
searchengines-web/MeiliSearch
1
0
Fork 0
mirror of https://github.com/meilisearch/MeiliSearch synced 2025-07-15 13:58:36 +02:00
Code Issues Releases Wiki Activity

Compute the biggest values of the words_level_positions_docids

Browse source
This commit is contained in:
Kerollmops 2021-03-17 16:09:18 +01:00 • committed by many
parent f713828406
commit 8bd4f5d93e
No known key found for this signature in database
GPG key ID: 2CEF23B75189EACA
2 changed files with 20 additions and 8 deletions
Download patch file Download diff file Expand all files Collapse all files

10
milli/src/update/words_level_positions.rs
View file

@ -104,16 +104,16 @@ fn compute_positions_levels(
for result in words_db.iter(rtxn)? {
let (word, ()) = result?;
let first_level_size = words_positions_db.remap_data_type::<DecodeIgnore>()
.prefix_iter(rtxn, &(word, 0, u32::min_value(), u32::min_value()))?
.fold(Ok(0usize), |count, result| result.and(count).map(|c| c + 1))?;
let level_0_range = {
let left = (word, 0, u32::min_value(), u32::min_value());
let right = (word, 0, u32::max_value(), u32::max_value());
left..=right
};
let first_level_size = words_positions_db.remap_data_type::<DecodeIgnore>()
.range(rtxn, &level_0_range)?
.fold(Ok(0usize), |count, result| result.and(count).map(|c| c + 1))?;
// Groups sizes are always a power of the original level_group_size and therefore a group
// always maps groups of the previous level and never splits previous levels groups in half.
let group_size_iter = (1u8..)
@ -132,7 +132,7 @@ fn compute_positions_levels(
let mut group_docids = RoaringBitmap::new();
for (i, result) in words_positions_db.range(rtxn, &level_0_range)?.enumerate() {
let ((_field_id, _level, value, _right), docids) = result?;
let ((_word, _level, value, _right), docids) = result?;
if i == 0 {
left = value;