snowykami/meilisearch
1
0
Fork 0
mirror of https://github.com/meilisearch/meilisearch.git synced 2025-01-31 15:31:53 +08:00
Code Issues Actions 2 Packages Projects Releases Wiki Activity

Add note that a part of the code needs fixing

Browse Source
This commit is contained in:
Loïc Lecrenier 2023-04-04 15:02:01 +02:00
parent 4129d657e2
commit faceb661e3
1 changed files with 3 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
milli/src/search/new/query_graph.rs
View File

@ -431,6 +431,9 @@ impl QueryGraph {
let (start_term, dest_term) = node; let (start_term, dest_term) = node;
let end_term = Interned::from_raw(dest_term.into_raw()); let end_term = Interned::from_raw(dest_term.into_raw());
let src = if let Some(start_term) = start_term { let src = if let Some(start_term) = start_term {
// TODO: this is incorrect! should take the intersection
// between the prev node and the start term if they refer to the same
// original query term!
let start_term = Interned::from_raw(start_term.into_raw()); let start_term = Interned::from_raw(start_term.into_raw());
nodes.get_mut(prev_node).successors.insert(start_term); nodes.get_mut(prev_node).successors.insert(start_term);
nodes.get_mut(start_term).predecessors.insert(prev_node); nodes.get_mut(start_term).predecessors.insert(prev_node);