Simplify graph-based ranking rule impl

2025-07-29 18:04:47 +00:00 · 2023-03-19 14:43:14 +01:00
parent c6ff97a220
commit dd491320e5
2 changed files with 7 additions and 60 deletions
--- a/milli/src/search/new/ranking_rule_graph/cheapest_paths.rs
+++ b/milli/src/search/new/ranking_rule_graph/cheapest_paths.rs
@ -10,12 +10,6 @@ use crate::search::new::query_graph::QueryNode;
 use crate::search::new::small_bitmap::SmallBitmap;
 use crate::Result;

-#[derive(Debug, Clone, PartialEq, Eq, Hash)]
-pub struct Path {
-    pub edges: Vec<u16>,
-    pub cost: u64,
-}
-
 impl<G: RankingRuleGraphTrait> RankingRuleGraph<G> {
    pub fn visit_paths_of_cost(
        &mut self,