1
81%
master: 85%

Ran 04 Jul 2026 05:58AM UTC

Files 221

Run time 4s

Badge

Embed ▾

Committed 04 Jul 2026 05:52AM UTC coverage: 81.484% (+0.004%) from 81.48%

Job # 28696852007.1

Build Type

Pull #197

github

Committed by

wegamekinglc

Commit Message

Reduce test_sparse_qform complexity below Codacy limit

Extract the per-row reference-solve loop into a SolveEachRow helper so the
TEST body drops from cyclomatic complexity 9 to 7 (Codacy limit is 8).
Behavior is unchanged -- the helper reproduces the prior solvedRows
computation verbatim, and the test still passes.

Co-Authored-By: Claude Opus 4.7 <noreply@anthropic.com>

Pull Request Pull Request #197: fix: out-of-bounds write in dense SymmetricDecomposition::QForm

Coverage Stats

6368 of 7815 relevant lines covered (81.48%)

3324036.24 hits per line

wegamekinglc / Derivatives-Algorithms-Lib / 28696852007 / 1
81%
master: 85%

README BADGES
x

Markdown

Textile

RDoc

HTML

Rst

Source Files on job 28696852007.1

wegamekinglc / Derivatives-Algorithms-Lib / 28696852007 / 1 81% master: 85%

README BADGES x

Markdown

Textile

RDoc

HTML

Rst

Source Files on job 28696852007.1

wegamekinglc / Derivatives-Algorithms-Lib / 28696852007 / 1
81%
master: 85%

README BADGES
x