searchengines-web/MeiliSearch
searchengines-web/MeiliSearch
1
0
Fork 0
mirror of https://github.com/meilisearch/MeiliSearch synced 2024-11-04 20:18:55 +01:00
Code Issues Releases Wiki Activity

Small cleanup

Browse Source
This commit is contained in:
Loïc Lecrenier 2023-03-20 13:39:19 +01:00
parent c63c7377e6
commit 272cd7ebbd
4 changed files with 4 additions and 27 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
milli/src/search/new/logger/detailed.rs
View File

@ -488,9 +488,9 @@ shape: class"
let p = ctx.word_interner.get(*use_prefix_db);
writeln!(file, "use prefix DB : {p}").unwrap();
}
for d in distances.iter() {
writeln!(file, "\"d_{d}\" : distance").unwrap();
}
// for d in distances.iter() {
// writeln!(file, "\"d_{d}\" : distance").unwrap();
// }
writeln!(file, "}}").unwrap();
}

3
milli/src/search/new/ranking_rule_graph/mod.rs
View File

@ -71,9 +71,6 @@ impl<E> PartialEq for Edge<E> {
/// 1. Retrieve the set of edges (their cost and condition) between two nodes.
/// 2. Compute the document ids satisfying a condition
pub trait RankingRuleGraphTrait: Sized {
/// The condition of an edge connecting two query nodes. The condition
/// should be sufficient to compute the edge's cost and associated document ids
/// in [`resolve_condition`](RankingRuleGraphTrait::resolve_condition).
type Condition: Sized + Clone + PartialEq + Eq + Hash;
/// Return the label of the given edge condition, to be used when visualising

1
milli/src/search/new/ranking_rule_graph/typo/mod.rs
View File

@ -74,6 +74,7 @@ impl RankingRuleGraphTrait for TypoGraph {
is_prefix: term.is_prefix,
zero_typo: term.zero_typo,
prefix_of: term.prefix_of,
// TOOD: debatable
synonyms: term.synonyms,
split_words: None,
one_typo: Box::new([]),

21
milli/src/search/new/small_bitmap.rs
View File

@ -272,24 +272,3 @@ impl<'b> Iterator for SmallBitmapInternalIter<'b> {
}
}
}
// #[cfg(test)]
// mod tests {
// use super::SmallBitmap;
// #[test]
// fn test_small_bitmap() {
// let mut bitmap1 = SmallBitmap::new(32);
// for x in 0..16 {
// bitmap1.insert(x * 2);
// }
// let mut bitmap2 = SmallBitmap::new(32);
// for x in 0..=10 {
// bitmap2.insert(x * 3);
// }
// bitmap1.intersection(&bitmap2);
// for v in bitmap1.iter() {
// println!("{v}");
// }
// }
// }