searchengines-web/MeiliSearch
searchengines-web/MeiliSearch
1
0
Fork 0
mirror of https://github.com/meilisearch/MeiliSearch synced 2024-12-23 13:10:06 +01:00
Code Issues Releases Wiki Activity

Use MultiOps for resolve_query_graph

Browse Source
This commit is contained in:
Louis Dureuil 2023-05-02 18:54:09 +02:00
parent 75819bc940
commit fdc1763838
No known key found for this signature in database
1 changed files with 4 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
milli/src/search/new/resolve_query_graph.rs
View File

@ -3,7 +3,7 @@
use std::collections::VecDeque;
use fxhash::FxHashMap;
use roaring::RoaringBitmap;
use roaring::{MultiOps, RoaringBitmap};
use super::interner::Interned;
use super::query_graph::QueryNodeData;
@ -126,6 +126,7 @@ pub fn compute_query_term_subset_docids_within_position(
Ok(docids)
}
/// Returns the subset of the input universe that satisfies the contraints of the input query graph.
pub fn compute_query_graph_docids(
ctx: &mut SearchContext,
q: &QueryGraph,
@ -148,10 +149,8 @@ pub fn compute_query_graph_docids(
continue;
}
// Take union of all predecessors
let mut predecessors_docids = RoaringBitmap::new();
for p in predecessors.iter() {
predecessors_docids |= path_nodes_docids.get(p);
}
let predecessors_docids =
MultiOps::union(predecessors.iter().map(|p| path_nodes_docids.get(p)));
let node_docids = match &node.data {
QueryNodeData::Term(LocatedQueryTermSubset {