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

Added comments [skip ci]

Browse Source
This commit is contained in:
Andrew Kane
2023-10-04 17:58:41 -07:00
parent 8d09de7467
commit 0e5338676d
1 changed files with 2 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
src/hnswutils.c
View File

@@ -769,6 +769,7 @@ 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 new element */
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)
@@ -792,6 +793,7 @@ SelectNeighbors(List *c, int m, int lc, FmgrInfo *procinfo, Oid collation, HnswE
} }
/* Save first pruned */ /* Save first pruned */
/* OK to leave previous element if empty */
if (!pairingheap_is_empty(wd)) if (!pairingheap_is_empty(wd))
e2->neighbors[lc].firstPruned = ((HnswPairingHeapNode *) pairingheap_first(wd))->inner->element; e2->neighbors[lc].firstPruned = ((HnswPairingHeapNode *) pairingheap_first(wd))->inner->element;