Updated comment [skip ci]

This commit is contained in:
Andrew Kane
2023-10-06 14:07:35 -07:00
parent 71641ed84e
commit 65e70326b8

View File

@@ -1058,8 +1058,12 @@ HnswInsertElement(HnswElement element, HnswElement entryPoint, Relation index, F
else
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);
AddConnections(element, neighbors, lm, lc);