osmarks/meme-search-engine
1
0
Fork 0
mirror of https://github.com/osmarks/meme-search-engine.git synced 2025-06-19 14:54:06 +00:00
Code Issues Releases Wiki Activity

remove rogue debug code

Browse Source
This commit is contained in:
osmarks 2025-01-16 21:28:01 +00:00
parent f4376f62ed
commit 9291eacead
1 changed files with 0 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
diskann/src/lib.rs
View File

@ -350,7 +350,6 @@ pub fn robust_stitch(rng: &mut Rng, graph: &mut IndexGraph, vecs: &VectorList, c
// The OOD-DiskANN paper itself seems to fill *all* the spare space at once with (out-neighbours of) the first query which is encountered, which feels like an odd choice. // The OOD-DiskANN paper itself seems to fill *all* the spare space at once with (out-neighbours of) the first query which is encountered, which feels like an odd choice.
// We have a switch for that instead. // We have a switch for that instead.
let query_out_neighbours = graph.out_neighbours(query_i); let query_out_neighbours = graph.out_neighbours(query_i);
println!("{} has {} in {} out", query_i, in_edges[(query_i - config.query_breakpoint) as usize].len(), query_out_neighbours.len());
for &in_neighbour in in_edges[(query_i - config.query_breakpoint) as usize].iter() { for &in_neighbour in in_edges[(query_i - config.query_breakpoint) as usize].iter() {
let mut candidates = Vec::with_capacity(query_out_neighbours.len()); let mut candidates = Vec::with_capacity(query_out_neighbours.len());
for (i, &neigh) in query_out_neighbours.iter().enumerate() { for (i, &neigh) in query_out_neighbours.iter().enumerate() {
@ -370,7 +369,6 @@ pub fn robust_stitch(rng: &mut Rng, graph: &mut IndexGraph, vecs: &VectorList, c
in_neighbour_out_edges.push(neigh); in_neighbour_out_edges.push(neigh);
added += 1; added += 1;
} }
println!("wrote {} out to {}", added, in_neighbour);
} }
}); });
} }