From 48a5f4db2d48b2b8fb98abf9e74acf90d349e9c0 Mon Sep 17 00:00:00 2001 From: Mubelotix Date: Mon, 28 Jul 2025 16:42:33 +0200 Subject: [PATCH] Improve comment --- crates/milli/src/search/facet/filter.rs | 9 +++++---- 1 file changed, 5 insertions(+), 4 deletions(-) diff --git a/crates/milli/src/search/facet/filter.rs b/crates/milli/src/search/facet/filter.rs index 907b12f1a..955e75753 100644 --- a/crates/milli/src/search/facet/filter.rs +++ b/crates/milli/src/search/facet/filter.rs @@ -419,11 +419,12 @@ impl<'a> Filter<'a> { Condition::StartsWith { keyword: _, word } => { // There are two algorithms: // - // - The first one looks directly at level 0 of the facet group database. - // This pessimistic approach is more efficient when the value is unique. - // - // - The second one is recursive over levels. + // - The first one is recursive over levels. // This is more efficient when the prefix is common among many values. + // + // - The second one looks directly at level 0 of the facet group database. + // This pessimistic approach is more efficient when the value is unique. + // It's used as a fallback. let value = crate::normalize_facet(word.value());