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

Fix more bugs + visual empty path cache logging

Browse Source
This commit is contained in:
Loïc Lecrenier
2023-02-27 15:04:40 +01:00
parent 0e1fbbf7c6
commit 6c85c0d95e
9 changed files with 107 additions and 68 deletions
Download Patch File Download Diff File Expand all files Collapse all files

33
milli/src/search/new/graph_based_ranking_rule.rs
View File

@ -71,30 +71,29 @@ impl<'transaction, G: RankingRuleGraphTrait> RankingRule<'transaction, QueryGrap
assert!(universe.len() > 1);
let mut state = self.state.take().unwrap();
let Some(cheapest_paths_state) = state.cheapest_paths_state.take() else {
let Some(mut cheapest_paths_state) = state.cheapest_paths_state.take() else {
return Ok(None);
};
let mut paths = PathsMap::default();
if let Some(next_cheapest_paths_state) = cheapest_paths_state
.compute_paths_of_next_lowest_cost(
&mut state.graph,
&state.empty_paths_cache,
&mut paths,
)
{
state.cheapest_paths_state = Some(next_cheapest_paths_state);
} else {
state.cheapest_paths_state = None;
while paths.is_empty() {
if let Some(next_cheapest_paths_state) = cheapest_paths_state
.compute_paths_of_next_lowest_cost(
&mut state.graph,
&state.empty_paths_cache,
&mut paths,
)
{
cheapest_paths_state = next_cheapest_paths_state;
} else {
self.state = None;
return Ok(None);
}
}
state.cheapest_paths_state = Some(cheapest_paths_state);
if paths.is_empty() {
self.state = None;
return Ok(None);
}
G::log_state(&state.graph, &paths, logger);
G::log_state(&state.graph, &paths, &state.empty_paths_cache, logger);
let bucket = state.graph.resolve_paths(
index,