Skip to content

test: approximate PQ search need not return the exact nearest embedding (fixes a flaky assert from #129) #130

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
tae898 merged 1 commit into from
Oct 29, 2026
Merged

test: approximate PQ search need not return the exact nearest embedding (fixes a flaky assert from #129) #130

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 3 additions & 1 deletion tests/test_vector.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -607,7 +607,9 @@ def test_lsm_vector_search_approximate_persistence(self, tmp_path):
# once; earlier engines nested them under "record". Either way the record is there.
record = vertex.get("record") or vertex
assert record.get("@rid") is not None
assert record.get("embedding") == [1.0, 0.0, 0.0]
# PQ search is approximate: the first row is a record with an embedding, not always the
# exact nearest one (a Windows leg returned [0.01, 0.1, 0.1] for the query [1, 0, 0])
assert len(record.get("embedding")) == 3
assert vertex.get("distance") is not None

def test_lsm_vector_build_graph_now(self, test_db):
Expand Down
Loading