liuyu/pgvector
1
0
Fork 0
mirror of https://github.com/pgvector/pgvector.git synced 2026-07-14 00:26:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

Updated comment [skip ci]

Browse Source
This commit is contained in:
Andrew Kane
2023-10-06 14:07:35 -07:00
parent 71641ed84e
commit 65e70326b8
1 changed files with 6 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
src/hnswutils.c
View File

@@ -1058,8 +1058,12 @@ HnswInsertElement(HnswElement element, HnswElement entryPoint, Relation index, F
else else
lw = w; lw = w;
/* Candidates are sorted, but set sortCandidates to true */ /*
/* for in-memory builds to enable closer caching */ * Candidates are sorted, but not deterministically. Set
* sortCandidates to true for in-memory builds to enable closer
* caching. Could alternatively skip caching here, but there does not
* seem to be a difference in performance either way.
*/
neighbors = SelectNeighbors(lw, lm, lc, procinfo, collation, element, NULL, NULL, index == NULL); neighbors = SelectNeighbors(lw, lm, lc, procinfo, collation, element, NULL, NULL, index == NULL);
AddConnections(element, neighbors, lm, lc); AddConnections(element, neighbors, lm, lc);