snowykami/meilisearch
1
0
Fork 0
mirror of https://github.com/meilisearch/meilisearch.git synced 2025-09-06 04:36:32 +00:00
Code Issues Packages Projects Releases Wiki Activity

Bump Hannoy's version

Browse Source
This commit is contained in:
Kerollmops
2025-08-06 15:08:14 +02:00
committed by Clément Renault
parent 636c072bf4
commit 69aa3a9976
3 changed files with 7 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
Cargo.lock generated
View File

@ -2603,8 +2603,8 @@ dependencies = [
[[package]] [[package]]
name = "hannoy" name = "hannoy"
version = "0.0.1" version = "0.0.2"
source = "git+https://github.com/Kerollmops/hannoy?branch=release-0.0.2#d734d5ab13ae34b3ee4d34b9eeb3ed8843cd11c2" source = "git+https://github.com/nnethercott/hannoy?rev=cab22c0#cab22c01dce4c825ae4d0d8824ba51ed4cef57e1"
dependencies = [ dependencies = [
"bytemuck", "bytemuck",
"byteorder", "byteorder",

2
crates/milli/Cargo.toml
View File

@ -88,7 +88,7 @@ rhai = { version = "1.22.2", features = [
"sync", "sync",
] } ] }
arroy = "0.6.1" arroy = "0.6.1"
hannoy = { git = "https://github.com/Kerollmops/hannoy", branch = "release-0.0.2" } hannoy = { git = "https://github.com/nnethercott/hannoy", rev = "cab22c0" }
rand = "0.8.5" rand = "0.8.5"
tracing = "0.1.41" tracing = "0.1.41"
ureq = { version = "2.12.1", features = ["json"] } ureq = { version = "2.12.1", features = ["json"] }

6
crates/milli/src/vector/mod.rs
View File

@ -468,7 +468,8 @@ impl VectorStore {
for reader in self.readers(rtxn, db) { for reader in self.readers(rtxn, db) {
let reader = reader?; let reader = reader?;
let mut searcher = reader.nns(limit, limit * 10); // TODO find better ef let mut searcher = reader.nns(limit);
searcher.ef_search(limit * 10); // TODO find better ef
if let Some(filter) = filter { if let Some(filter) = filter {
if reader.item_ids().is_disjoint(filter) { if reader.item_ids().is_disjoint(filter) {
continue; continue;
@ -510,7 +511,8 @@ impl VectorStore {
for reader in self.readers(rtxn, db) { for reader in self.readers(rtxn, db) {
let reader = reader?; let reader = reader?;
let mut searcher = reader.nns(limit, limit * 10); // TODO find better ef let mut searcher = reader.nns(limit);
searcher.ef_search(limit * 10); // TODO find better ef
if let Some(filter) = filter { if let Some(filter) = filter {
if reader.item_ids().is_disjoint(filter) { if reader.item_ids().is_disjoint(filter) {
continue; continue;