Mirrors/the-algorithm
2
0
Fork 0
mirror of https://github.com/twitter/the-algorithm.git synced 2024-12-23 02:31:52 +01:00
Code Issues Packages Projects Releases Wiki Activity

I found some more

Browse Source
This commit is contained in:
Joanie Gannon 2023-03-31 20:07:28 -04:00
parent 9953b499bf
commit 4ba718b412
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
ann/src/main/java/com/twitter/ann/hnsw/HnswIndex.java
View File

@ -34,7 +34,7 @@ import com.twitter.mediaservices.commons.codec.ArrayByteBufferCodec;
import com.twitter.search.common.file.AbstractFile; import com.twitter.search.common.file.AbstractFile;
/** /**
* Typed multithreaded HNSW implementation supporting creation/querying of approximate nearest neighbour * Typed multithreaded HNSW implementation supporting creation/querying of approximate nearest neighbours
* Paper: https://arxiv.org/pdf/1603.09320.pdf * Paper: https://arxiv.org/pdf/1603.09320.pdf
* Multithreading impl based on NMSLIB version : https://github.com/nmslib/hnsw/blob/master/hnswlib/hnswalg.h * Multithreading impl based on NMSLIB version : https://github.com/nmslib/hnsw/blob/master/hnswlib/hnswalg.h
* *
@ -379,7 +379,7 @@ public class HnswIndex<T, Q> {
* This will reduce the recall. * This will reduce the recall.
* <p> * <p>
* For a full explanation of locking see this document: http://go/hnsw-locking * For a full explanation of locking see this document: http://go/hnsw-locking
* The method returns the closest nearest neighbor (can be used as an enter point) * The method returns the closest nearest neighbours (can be used as an enter point)
*/ */
private T mutuallyConnectNewElement( private T mutuallyConnectNewElement(
final T item, final T item,