snowykami/meilisearch
1
0
Fork 0
mirror of https://github.com/meilisearch/meilisearch.git synced 2025-09-04 03:36:30 +00:00
Code Issues Packages Projects Releases Wiki Activity

Enable new algorithm every time

Browse Source
This commit is contained in:
Mubelotix
2025-07-28 16:28:06 +02:00
parent 691a9ae4b1
commit 224892e692
1 changed files with 19 additions and 22 deletions
Download Patch File Download Diff File Expand all files Collapse all files

41
crates/milli/src/search/facet/filter.rs
View File

@ -427,29 +427,26 @@ impl<'a> Filter<'a> {
let value = crate::normalize_facet(word.value());
if value.len() <= 6 {
// 6 is abitrary, but it works well in practice
let mut value2 = value.as_bytes().to_owned();
if let Some(last) = value2.last_mut() {
if *last != 255 {
*last += 1;
if let Ok(value2) = String::from_utf8(value2) {
// The idea here is that "STARTS WITH baba" is the same as "baba <= value < babb".
// We just increase the last letter to find the upper bound.
// The result could be invalid utf8, so it can fallback.
let mut docids = RoaringBitmap::new();
find_docids_of_facet_within_bounds(
rtxn,
strings_db,
field_id,
&Included(&value),
&Excluded(&value2),
universe,
&mut docids,
)?;
let mut value2 = value.as_bytes().to_owned();
if let Some(last) = value2.last_mut() {
if *last != 255 {
*last += 1;
if let Ok(value2) = String::from_utf8(value2) {
// The idea here is that "STARTS WITH baba" is the same as "baba <= value < babb".
// We just increase the last letter to find the upper bound.
// The result could be invalid utf8, so it can fallback.
let mut docids = RoaringBitmap::new();
find_docids_of_facet_within_bounds(
rtxn,
strings_db,
field_id,
&Included(&value),
&Excluded(&value2),
universe,
&mut docids,
)?;
return Ok(docids);
}
return Ok(docids);
}
}
}