snowykami/meilisearch
1
0
Fork 0
mirror of https://github.com/meilisearch/meilisearch.git synced 2024-11-29 16:45:30 +08:00
Code Issues Actions 5 Packages Projects Releases Wiki Activity

We do not do intersections with the universe when it is related to cache

Browse Source
This commit is contained in:
Clément Renault 2024-07-10 10:12:35 +02:00
parent ce61cb7fe6
commit 3bac22fd87
No known key found for this signature in database
GPG Key ID: F250A4C4E3AE5F5F
1 changed files with 0 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
milli/src/search/new/ranking_rule_graph/proximity/compute_docids.rs
View File

@ -136,7 +136,6 @@ fn compute_prefix_edges(
}
}
// TODO check that the fact that the universe always changes is not an issue, e.g. caching stuff.
if let Some(new_docids) = ctx.get_db_word_prefix_pair_proximity_docids(
Some(&universe),
left_word,
@ -152,7 +151,6 @@ fn compute_prefix_edges(
// No swapping when computing the proximity between a phrase and a word
if left_phrase.is_none() {
// TODO check that the fact that the universe always changes is not an issue, e.g. caching stuff.
if let Some(new_docids) = ctx.get_db_prefix_word_pair_proximity_docids(
Some(&universe),
right_prefix,
@ -190,7 +188,6 @@ fn compute_non_prefix_edges(
}
}
// TODO check that it is not an issue to alterate the universe
if let Some(new_docids) =
ctx.get_db_word_pair_proximity_docids(Some(&universe), word1, word2, forward_proximity)?
{