Skip to content

Reduce sanitizer runtime for graph search tests #121

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

Closed
gouyt13 wants to merge 2 commits into from
Closed

Reduce sanitizer runtime for graph search tests #121

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
dd16bb9
Reduce sanitizer runtime for graph search tests
gouyt13 Sep 29, 2026
1a3cff9
Merge branch 'main' into optimize-sanitizer-tests
gouyt13 Sep 29, 2026
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
10 changes: 7 additions & 3 deletions tests/unit/rabitqlib/index/qg_test.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -377,9 +377,11 @@ TEST(BatchQueryTest, PreparedSumPreservesLookupTableAndMetric) {
}

TEST(QuantizedGraphSearchTest, ScratchSearchMatchesRegularSearch) {
constexpr size_t kNumPoints = 257;
for (const size_t kDim : {64U, 65U, 1025U, 4097U}) {
SCOPED_TRACE(kDim);
// Cover IDs beyond 255 at small dimensions; wide vectors need only
// a non-complete graph with the same degree and search window.
const size_t kNumPoints = kDim <= 65 ? 257 : 65;
constexpr size_t kDegree = 32;
constexpr size_t kEfSearch = 1;
const size_t kNumQueries = kDim == 64 ? 256 : 16;
Expand All @@ -395,7 +397,9 @@ TEST(QuantizedGraphSearchTest, ScratchSearchMatchesRegularSearch) {
QuantizedGraph<float> graph(
kNumPoints, kDim, kDegree, metric, RotatorType::FhtKacRotator, bits, 42
);
QGBuilder builder(graph, kDegree, data.data(), 1, 42);
// Graph construction is setup here; cache vectors to avoid repeated
// reconstruction. CachedResetMatchesFreshConstruction checks parity.
QGBuilder builder(graph, kDegree, data.data(), 1, 42, true);
graph.set_ef(kEfSearch);

std::vector<float> rotated_query(graph.padded_dim());
Expand Down Expand Up @@ -512,7 +516,7 @@ TEST(QuantizedGraphSearchTest, SingleResultMatchesTopKWithTiesAndHints) {
QuantizedGraph<float> graph(
kCount, dim, 32, metric, RotatorType::FhtKacRotator, bits, 42
);
QGBuilder builder(graph, 64, data.data(), 1, 42);
QGBuilder builder(graph, 64, data.data(), 1, 42, true);
builder.build();
graph.set_ef(kCount);
std::vector<float> rotated(graph.padded_dim());
Expand Down
Loading