pgjdbc/pgjdbc GitHub issues and pull requests (mirror)
help / color / mirror / Atom feedFrom: vlsi (@vlsi) <[email protected]>
To: pgjdbc/pgjdbc <[email protected]>
Subject: [pgjdbc/pgjdbc] PR #3965: chore: use greedy pairwise coverage for CI matrix generation
Date: Mon, 16 Mar 2026 07:44:24 +0000
Message-ID: <[email protected]> (raw)
Replace the random-per-axis row generation with a greedy algorithm that maximizes pairwise parameter coverage. For each row, 1000 random candidates are generated and the one covering the most previously-uncovered parameter pairs is selected.
Pair scoring uses normalized weights (weight_i × weight_j) so that production-like values (e.g. autosave=never, query_mode=extended) are prioritized while non-default values still appear for coverage. Candidate generation uses uniform random to ensure diverse candidates.
This achieves ~43-47% pair coverage and ~76% weighted coverage with 5 jobs.
Use `node matrix.mjs --coverage` to see pair coverage statistics.
reply
Reply instructions:
You may reply publicly to this message via plain-text email
using any one of the following methods:
* Reply to all the recipients using the --to and --cc options:
reply via email
To: github://pgjdbc/pgjdbc
Cc: [email protected], [email protected]
Subject: Re: [pgjdbc/pgjdbc] PR #3965: chore: use greedy pairwise coverage for CI matrix generation
In-Reply-To: <<[email protected]>>
* Save the following mbox file, import it into your mail client,
and reply-to-all from there: mbox
This inbox is served by agora; see mirroring instructions
for how to clone and mirror all data and code used for this inbox