We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent d6b4803 commit a1ce2f1Copy full SHA for a1ce2f1
src/reader.rs
@@ -603,6 +603,7 @@ pub fn item_leaf<'a, D: Distance>(
603
}
604
605
606
+// Based on https://quickwit.io/blog/top-k-complexity, implemented in https://github.com/meilisearch/arroy/pull/129
607
pub fn median_based_top_k<T>(v: Vec<T>, k: usize, mut threshold: T) -> Vec<T>
608
where
609
T: Ord + Copy,
0 commit comments