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

Added sorting [skip ci]

Browse Source
This commit is contained in:
Andrew Kane
2024-09-21 22:56:03 -07:00
parent e07d17fe38
commit f1c7494c35
1 changed files with 24 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

26
src/hnswscan.c
View File

@@ -141,6 +141,24 @@ hnswrescan(IndexScanDesc scan, ScanKey keys, int nkeys, ScanKey orderbys, int no
memmove(scan->orderByData, orderbys, scan->numberOfOrderBys * sizeof(ScanKeyData)); memmove(scan->orderByData, orderbys, scan->numberOfOrderBys * sizeof(ScanKeyData));
} }
/*
* Compare search candidate distances
*/
static int
CompareSearchCandidateDistances(const ListCell *a, const ListCell *b)
{
HnswSearchCandidate *hca = lfirst(a);
HnswSearchCandidate *hcb = lfirst(b);
if (hca->distance < hcb->distance)
return 1;
if (hca->distance > hcb->distance)
return -1;
return 0;
}
/* /*
* Fetch the next tuple in the given scan * Fetch the next tuple in the given scan
*/ */
@@ -216,10 +234,12 @@ hnswgettuple(IndexScanDesc scan, ScanDirection dir)
break; break;
} }
/* Return remaining tuples and exit */ /* Return remaining tuples */
/* TODO sort */
so->w = so->discarded; so->w = so->discarded;
so->discarded = NIL; so->discarded = NIL;
/* Sort in reverse order since results are removed from end */
list_sort(so->w, CompareSearchCandidateDistances);
} }
else else
{ {
@@ -245,6 +265,8 @@ hnswgettuple(IndexScanDesc scan, ScanDirection dir)
hc = llast(so->w); hc = llast(so->w);
element = HnswPtrAccess(base, hc->element); element = HnswPtrAccess(base, hc->element);
elog(INFO, "distance = %f", hc->distance);
/* Move to next element if no valid heap TIDs */ /* Move to next element if no valid heap TIDs */
if (element->heaptidsLength == 0) if (element->heaptidsLength == 0)
{ {