mirror of
https://github.com/meilisearch/meilisearch.git
synced 2025-07-29 09:39:58 +00:00
Fix bug in computation of query term at a position
This commit is contained in:
@ -35,7 +35,6 @@ impl RankingRuleGraphTrait for PositionGraph {
|
||||
*position,
|
||||
)?;
|
||||
}
|
||||
|
||||
Ok(ComputedCondition {
|
||||
docids,
|
||||
universe_len: universe.len(),
|
||||
@ -91,15 +90,12 @@ impl RankingRuleGraphTrait for PositionGraph {
|
||||
};
|
||||
positions_for_costs.entry(cost).or_default().push(position);
|
||||
}
|
||||
println!(
|
||||
"positions for cost {} : {positions_for_costs:?}",
|
||||
term.term_subset.description(ctx)
|
||||
);
|
||||
|
||||
let mut edges = vec![];
|
||||
|
||||
for (cost, positions) in positions_for_costs {
|
||||
// TODO: We can improve performances and relevancy by storing
|
||||
// the term subsets associated to each position fetched.
|
||||
// the term subsets associated to each position fetched
|
||||
edges.push((
|
||||
cost,
|
||||
conditions_interner.insert(PositionCondition {
|
||||
|
Reference in New Issue
Block a user