Sort nearest neighbors after pushing batch peers
This commit is contained in:
parent
d7c33e9e8f
commit
bd9c3f3897
|
@ -145,6 +145,9 @@ where
|
|||
for added in done.iter().copied() {
|
||||
search.push(added, &points[pid], &points);
|
||||
}
|
||||
// Because we've added new points, we need to sort the nearest neighbors
|
||||
search.nearest.sort_unstable();
|
||||
|
||||
insert(&mut zero, pid, &search.nearest, &points);
|
||||
done.push(pid);
|
||||
pool.push(search);
|
||||
|
|
Loading…
Reference in New Issue