Routines written once in pseudo and checked at every level, so programs can use them by name instead of rewriting and re-verifying them: - stats: Mean, Variance (two-pass) - numerics: KahanSum, LinearInterp, Trapezoid - align: LinearGapPenalty, AffineGapPenalty, MatchScore, NeedlemanWunschScore - md: LennardJones, LennardJonesForce, MinimumImage, PairDistance - seq: GCContent, HammingDistance - special: ErfApprox (Abramowitz and Stegun 7.1.26) Each has contracts, cases, reference implementations in Python, Mojo and (for the numerical ones) C at more than one level, and nine have a Dafny proof over exact numbers. status.json and STATUS.md are written by pplus-core's library-check: every check passes or is open/unverified as listed there. The Mojo references still need the pinned compiler's answers (library-verify-mojo, network). Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_01FgvbRdoEheAHqsRmr2WuKZ
13 lines
430 B
Plaintext
13 lines
430 B
Plaintext
// GCContent: the fraction of the letters of S that are G or C. Other letters
|
|
// (N for an unknown base, lowercase) count in the length and not in the count.
|
|
FUNCTION GCContent(S : STRING) RETURNS FLOAT
|
|
REQUIRE LENGTH(S) > 0
|
|
DECLARE Count : INTEGER <- 0
|
|
FOR I <- 0 TO LENGTH(S)
|
|
IF S[I] == 'G' OR S[I] == 'C' THEN
|
|
Count <- Count + 1
|
|
ENDIF
|
|
NEXT I
|
|
RETURN Count / LENGTH(S)
|
|
ENDFUNCTION
|