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

Updated comments [skip ci]

Browse Source
This commit is contained in:
Andrew Kane
2023-10-04 18:14:08 -07:00
parent c28f4683f7
commit b5ae5fe9e7
1 changed files with 8 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
src/hnswutils.c
View File

@@ -770,16 +770,20 @@ SelectNeighbors(List *c, int m, int lc, FmgrInfo *procinfo, Oid collation, HnswE
w = list_delete_last(w); w = list_delete_last(w);
/* /*
* r and wd will be the same as previous calls until the new element, * r and wd will be the same as previous calls until the new
* so can skip distance calculations for as many elements as there is * candidate, so can skip distance calculations for as many candidates
* state for * as there is state for
*/ */
if (mustCalculate) if (mustCalculate)
closer = CheckElementCloser(e, r, lc, procinfo, collation); closer = CheckElementCloser(e, r, lc, procinfo, collation);
else if (e->element == e2->neighbors[lc].firstPruned) else if (e->element == e2->neighbors[lc].firstPruned)
{ {
closer = false; closer = false;
/* TODO Store multiple pruned and only calculate when exhausted */
/*
* Could store multiple pruned and only calculate when exhausted
* (or store full state) at the expense of memory
*/
mustCalculate = true; mustCalculate = true;
} }
else if (e == newCandidate) else if (e == newCandidate)