snowykami/meilisearch
1
0
Fork 0
mirror of https://github.com/meilisearch/meilisearch.git synced 2025-07-31 02:40:01 +00:00
Code Issues Packages Projects Releases Wiki Activity

Remove the roaring operation functions warnings

Browse Source
This commit is contained in:
Kerollmops
2021-06-30 14:12:56 +02:00
parent 66e6ea56b8
commit 32b7bd366f
14 changed files with 43 additions and 45 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
milli/src/search/facet/facet_distribution.rs
View File

@ -122,7 +122,7 @@ impl<'a> FacetDistribution<'a> {
for result in iter {
let (value, mut docids) = result?;
docids.intersect_with(candidates);
docids &= candidates;
if !docids.is_empty() {
distribution.insert(value.to_string(), docids.len());
}

2
milli/src/search/facet/filter_condition.rs
View File

@ -289,7 +289,7 @@ impl FilterCondition {
for (i, result) in iter.enumerate() {
let ((_fid, level, l, r), docids) = result?;
debug!("{:?} to {:?} (level {}) found {} documents", l, r, level, docids.len());
output.union_with(&docids);
*output |= docids;
// We save the leftest and rightest bounds we actually found at this level.
if i == 0 {
left_found = Some(l);

4
milli/src/search/facet/mod.rs
View File

@ -213,10 +213,10 @@ impl<'t> Iterator for FacetIter<'t> {
match result {
Ok(((_fid, level, left, right), mut docids)) => {
docids.intersect_with(&documents_ids);
docids &= &*documents_ids;
if !docids.is_empty() {
if self.must_reduce {
documents_ids.difference_with(&docids);
*documents_ids -= &docids;
}
if level == 0 {