29444334518
88%
master: 88%

Ran 15 Jul 2026 07:29PM UTC

Jobs 1

Files 243

Run time 1min

Badge

Embed ▾

Committed 15 Jul 2026 07:23PM UTC coverage: 88.399%. Remained the same

Build # 29444334518

Build Type

Pull #231

github

Committed by

wegamekinglc

Commit Message

docs: fix linear interp contract claims in interpolation.md

The linear interpolator (dal-cpp/dal/math/interp/interplinear.cpp) does not
enforce a minimum knot count -- unlike log-linear and cubic, which gate on
size. It also checks monotonicity with std::less_equal, so it accepts equal
(duplicate) abscissae. The prior text overstated both contracts: the Linear
section claimed "Requires N >= 2" and the Common Interface stated
universally that abscissae "must be strictly increasing". Drop the false
minimum-size claim for linear and soften the shared monotonicity statement
to non-decreasing, which is the true common floor (cubic and log-linear
keep their stricter scheme-specific requirements).

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

Pull Request Pull Request #231: docs: reconcile documentation with current implementation

Coverage Stats

8176 of 9249 relevant lines covered (88.4%)

2859280.24 hits per line

Jobs

ID	Job ID	Ran	Files	Coverage
1	29444334518.1	15 Jul 2026 07:28PM UTC	243	88.4	GitHub Action Run

wegamekinglc / Derivatives-Algorithms-Lib / 29444334518
88%
master: 88%

README BADGES
x

Markdown

Textile

RDoc

HTML

Rst

Jobs

Source Files on build 29444334518

wegamekinglc / Derivatives-Algorithms-Lib / 29444334518 88% master: 88%

README BADGES x

Markdown

Textile

RDoc

HTML

Rst

Jobs

Source Files on build 29444334518

wegamekinglc / Derivatives-Algorithms-Lib / 29444334518
88%
master: 88%

README BADGES
x