Commit Graph
3 Commits
Author SHA1 Message Date
Kevin Veen-BirkenbachandClaude Opus 5.5 393803db3a perf(merge-fix): batch find_fix git calls and run -S in parallel slices
Almost all of find_fix's time went to git child processes: one merge-base per hit (2105 x 132 ms for a broad --grep), a single-threaded git log --all -S, and one branch --contains per printed candidate, run one after another. One rev-list HEAD set now decides in_head, -S runs as strided slices of rev-list --all through a thread pool and is sorted back into git log --all order, and the candidate lines are built in parallel. Output stays byte-identical on four real calls (3x to 142x faster). Tests pin the -S order and that the filters are alternatives.

Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
2026-11-04 17:07:21 +01:00
Kevin Veen-BirkenbachandClaude Opus 5.5 90b0a2ee88 fix(ci-artifacts): sign lint failures by their finding and ignore steps after the failure
Co-Authored-By: Claude Opus 5.5 (1M context) <noreply@anthropic.com>
2026-10-30 20:20:04 +01:00
Kevin Veen-BirkenbachandClaude Opus 5.5 6544f01eef feat(ci-artifacts,merge-fix): cluster failed CI jobs and search refs through scripts
Co-Authored-By: Claude Opus 5.5 (1M context) <noreply@anthropic.com>
2026-10-30 16:54:37 +01:00