@simpleapps-com/augur-config 2026.11.1 → 2026.11.3
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +25 -2
- package/dist/augur-doctor.js +45 -10
- package/dist/augur-doctor.js.map +1 -1
- package/dist/{chunk-ZV56KMH3.js → chunk-3L322IID.js} +116 -1
- package/dist/chunk-3L322IID.js.map +1 -0
- package/dist/doctor/checks.d.ts +2 -0
- package/dist/doctor/checks.d.ts.map +1 -1
- package/dist/doctor/node-reader.d.ts.map +1 -1
- package/dist/doctor/rules.d.ts +70 -0
- package/dist/doctor/rules.d.ts.map +1 -1
- package/dist/lighthouse-rules.d.ts +28 -0
- package/dist/lighthouse-rules.d.ts.map +1 -0
- package/dist/lighthouse.d.ts.map +1 -1
- package/dist/lighthouse.js +35 -20
- package/dist/lighthouse.js.map +1 -1
- package/package.json +4 -3
- package/dist/chunk-ZV56KMH3.js.map +0 -1
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"sources":["../../utils/src/strings.ts","../src/doctor/rules.ts"],"sourcesContent":["//@ backend dafny\nimport {\n isAlnumChar,\n isBase64UrlChar,\n isDigit,\n isHexChar,\n isJsSpace,\n isLineTerminator,\n isLowerHexChar,\n isSnakeChar,\n isWordChar,\n lowerCode,\n} from \"./chars\";\n\n/* String scans and slices, verified with LemmaScript → Dafny (hand lemmas in strings.dfy;\n model: models/Utils.dfy; link: models/links/utils-strings.dfy). Recursive and\n expression-bodied so specs can use them, and each contract pins the result exactly, so\n an importer (which sees only the contract) knows what it returns. Two of them stand in\n for constructs lsc mistranslates: `prefix` for an unclamped `slice`, and the code-unit\n scans for \"\\r\" / \"\\n\" literals. */\n\n/**\n * The code unit at `i`, or -1 when `i` is outside `s`. JS `charCodeAt` gives NaN there,\n * which no code equals, so a scan's own bounds test would change no result and no test\n * could tell it from none (an equivalent mutant); with the bound here once, the boundary is\n * observable (tests pin -1) and the scans that use it carry no bound of their own. A code\n * unit is never negative, so -1 matches no `code` a caller passes (`requires code >= 0`).\n *\n * @ensures 0 ≤ i < |s| ⟹ result = s[i]; otherwise result = -1\n */\nexport function codeAt(s: string, i: number): number {\n //@ verify\n //@ ensures (i >= 0 && i < s.length) ==> \\result === s.charCodeAt(i)\n //@ ensures !(i >= 0 && i < s.length) ==> \\result === -1\n return i >= 0 && i < s.length ? s.charCodeAt(i) : -1;\n}\n\n/**\n * Every character of `s` from index `i` on is base64url.\n *\n * @ensures result ⟺ ∀ k ∈ [i, |s|). isBase64UrlChar(s[k])\n */\nexport function base64UrlFrom(s: string, i: number): boolean {\n //@ verify\n //@ type i nat\n //@ decreases s.length - i\n //@ ensures \\result <==> forall(k: nat, (i <= k && k < s.length) ==> isBase64UrlChar(s.charCodeAt(k)))\n return i >= s.length || (isBase64UrlChar(s.charCodeAt(i)) && base64UrlFrom(s, i + 1));\n}\n\n/**\n * The base64url digit for `v` (RFC 4648 §5): A-Z a-z 0-9 - _.\n *\n * @ensures exactly the model's Base64UrlDigit\n */\nexport function base64UrlDigit(v: number): string {\n //@ verify\n //@ type v nat\n //@ requires v >= 0 && v < 64\n //@ ensures \\result === \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_\".slice(v, v + 1)\n return \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_\".slice(v, v + 1);\n}\n\n/**\n * Bytes from `i` on as unpadded base64url: each three as four digits, a last one or two as two or\n * three (JS `btoa` with `+/` as `-_` and the `=` dropped). One frame per three bytes: a JWT part\n * is a few hundred.\n *\n * @ensures exactly the model's Base64UrlFrom (links/utils-strings.dfy)\n */\nexport function encodeBase64UrlFrom(b: number[], i: number): string {\n //@ verify\n //@ type i nat\n //@ requires i >= 0 && forall(k: nat, k < b.length ==> (b[k] >= 0 && b[k] < 256))\n //@ decreases b.length - i\n //@ ensures i >= b.length ==> \\result === \"\"\n if (i >= b.length) return \"\";\n const x = b[i] as number;\n const first = base64UrlDigit(Math.floor(x / 4));\n if (i + 1 === b.length) return first + base64UrlDigit((x % 4) * 16);\n const y = b[i + 1] as number;\n const second = base64UrlDigit((x % 4) * 16 + Math.floor(y / 16));\n if (i + 2 === b.length) return first + second + base64UrlDigit((y % 16) * 4);\n const z = b[i + 2] as number;\n return (\n first +\n second +\n base64UrlDigit((y % 16) * 4 + Math.floor(z / 64)) +\n base64UrlDigit(z % 64) +\n encodeBase64UrlFrom(b, i + 3)\n );\n}\n\n/**\n * Every character of `s` from index `i` on is lowercase hex.\n *\n * @ensures result ⟺ ∀ k ∈ [i, |s|). isLowerHexChar(s[k])\n */\nexport function lowerHexFrom(s: string, i: number): boolean {\n //@ verify\n //@ type i nat\n //@ decreases s.length - i\n //@ ensures \\result <==> forall(k: nat, (i <= k && k < s.length) ==> isLowerHexChar(s.charCodeAt(k)))\n return i >= s.length || (isLowerHexChar(s.charCodeAt(i)) && lowerHexFrom(s, i + 1));\n}\n\n/**\n * Every character of `s` from index `i` on is hex, either case.\n *\n * @ensures result ⟺ ∀ k ∈ [i, |s|). isHexChar(s[k])\n */\nexport function hexFrom(s: string, i: number): boolean {\n //@ verify\n //@ type i nat\n //@ decreases s.length - i\n //@ ensures \\result <==> forall(k: nat, (i <= k && k < s.length) ==> isHexChar(s.charCodeAt(k)))\n return i >= s.length || (isHexChar(s.charCodeAt(i)) && hexFrom(s, i + 1));\n}\n\n/**\n * Every character of `s` from index `i` on is an ASCII digit (`\\d` without the `u` flag).\n *\n * @ensures result ⟺ ∀ k ∈ [i, |s|). isDigit(s[k])\n */\nexport function digitsFrom(s: string, i: number): boolean {\n //@ verify\n //@ type i nat\n //@ decreases s.length - i\n //@ ensures \\result <==> forall(k: nat, (i <= k && k < s.length) ==> isDigit(s.charCodeAt(k)))\n return i >= s.length || (isDigit(s.charCodeAt(i)) && digitsFrom(s, i + 1));\n}\n\n/**\n * Every character of `s` from index `i` on is a word character (`\\w`: `[A-Za-z0-9_]`).\n *\n * @ensures result ⟺ ∀ k ∈ [i, |s|). isWordChar(s[k])\n */\nexport function wordCharsFrom(s: string, i: number): boolean {\n //@ verify\n //@ type i nat\n //@ decreases s.length - i\n //@ ensures \\result <==> forall(k: nat, (i <= k && k < s.length) ==> isWordChar(s.charCodeAt(k)))\n return i >= s.length || (isWordChar(s.charCodeAt(i)) && wordCharsFrom(s, i + 1));\n}\n\n/**\n * Every character of `s` from index `i` on is a snake_case character (`[a-z0-9_]`).\n *\n * @ensures result ⟺ ∀ k ∈ [i, |s|). isSnakeChar(s[k])\n */\nexport function snakeCharsFrom(s: string, i: number): boolean {\n //@ verify\n //@ type i nat\n //@ decreases s.length - i\n //@ ensures \\result <==> forall(k: nat, (i <= k && k < s.length) ==> isSnakeChar(s.charCodeAt(k)))\n return i >= s.length || (isSnakeChar(s.charCodeAt(i)) && snakeCharsFrom(s, i + 1));\n}\n\n/**\n * Every character of `s` from index `i` on is an ASCII letter or digit (`[A-Za-z0-9]`).\n *\n * @ensures result ⟺ ∀ k ∈ [i, |s|). isAlnumChar(s[k])\n */\nexport function alnumFrom(s: string, i: number): boolean {\n //@ verify\n //@ type i nat\n //@ decreases s.length - i\n //@ ensures \\result <==> forall(k: nat, (i <= k && k < s.length) ==> isAlnumChar(s.charCodeAt(k)))\n return i >= s.length || (isAlnumChar(s.charCodeAt(i)) && alnumFrom(s, i + 1));\n}\n\n/**\n * Every character of `s` from index `i` on is an ASCII letter, digit or `-` (`[A-Za-z0-9-]`):\n * a domain label's tail, a service name's tail.\n *\n * @ensures result ⟺ ∀ k ∈ [i, |s|). isAlnumChar(s[k]) ∨ s[k] = \"-\" — the model's AlnumDashFrom\n */\nexport function alnumDashFrom(s: string, i: number): boolean {\n //@ verify\n //@ type i nat\n //@ decreases s.length - i\n //@ ensures \\result <==> forall(k: nat, (i <= k && k < s.length) ==> (isAlnumChar(s.charCodeAt(k)) || s.charCodeAt(k) === 45))\n if (i >= s.length) return true;\n const c = s.charCodeAt(i);\n return (isAlnumChar(c) || c === 45) && alnumDashFrom(s, i + 1);\n}\n\n/**\n * The last index before `end` holding `code`, or -1 (JS `s.lastIndexOf(c)` at end = |s|).\n *\n * @ensures result = -1 ∨ (0 ≤ result < end ∧ s[result] = code ∧ no `code` in (result, end))\n */\nexport function lastIndexOfCode(s: string, code: number, end: number): number {\n //@ verify\n //@ type end nat\n //@ requires end <= s.length\n //@ decreases end\n //@ ensures \\result === -1 || (0 <= \\result && \\result < end)\n //@ ensures \\result >= 0 ==> s.charCodeAt(\\result) === code\n //@ ensures \\result >= 0 ==> forall(k: nat, (\\result < k && k < end) ==> s.charCodeAt(k) !== code)\n //@ ensures \\result === -1 ==> forall(k: nat, k < end ==> s.charCodeAt(k) !== code)\n if (end === 0) return -1;\n if (s.charCodeAt(end - 1) === code) return end - 1;\n return lastIndexOfCode(s, code, end - 1);\n}\n\n/**\n * No character of `s` from index `i` on is `code`.\n *\n * @ensures result ⟺ ∀ k ∈ [i, |s|). s[k] ≠ code\n */\nexport function lacksCode(s: string, code: number, i: number): boolean {\n //@ verify\n //@ type i nat\n //@ requires i <= s.length\n //@ decreases s.length - i\n //@ ensures \\result <==> forall(k: nat, (i <= k && k < s.length) ==> s.charCodeAt(k) !== code)\n // `===`, not `>=`: past the end a read is NaN !== code, so `>=` vs `>` would be equivalent\n return i === s.length || (s.charCodeAt(i) !== code && lacksCode(s, code, i + 1));\n}\n\n/**\n * The end of the run of `code` starting at `i`: the first index ≥ i that isn't `code`\n * (skip spaces: `codeRunEnd(header, 32, i)`).\n *\n * @requires i ≤ |s|\n * @ensures i ≤ result ≤ |s| ∧ ∀ k ∈ [i, result). s[k] = code ∧ (result < |s| ⟹ s[result] ≠ code)\n * — exactly the run's end\n */\nexport function codeRunEnd(s: string, code: number, i: number): number {\n //@ verify\n //@ type i nat\n //@ requires 0 <= i && i <= s.length\n //@ requires code >= 0\n //@ decreases s.length - i\n //@ ensures i <= \\result && \\result <= s.length\n //@ ensures forall(k: nat, (i <= k && k < \\result) ==> s.charCodeAt(k) === code)\n //@ ensures \\result < s.length ==> s.charCodeAt(\\result) !== code\n return codeAt(s, i) === code ? codeRunEnd(s, code, i + 1) : i;\n}\n\n/**\n * The first index ≥ `from` holding `code`, or -1 (`indexOf` for one code unit, so \"\\n\" is\n * passed as 10, never as a literal).\n *\n * @ensures result = -1 ∨ (from ≤ result < |s| ∧ s[result] = code), with no `code` in\n * [from, result) — the first one; result = -1 ⟹ none from `from` on\n */\nexport function indexOfCode(s: string, code: number, from: number): number {\n //@ verify\n //@ type from nat\n //@ requires code >= 0\n //@ decreases s.length - from\n //@ ensures \\result === -1 || (from <= \\result && \\result < s.length)\n //@ ensures \\result >= 0 ==> s.charCodeAt(\\result) === code\n //@ ensures \\result >= 0 ==> forall(k: nat, (from <= k && k < \\result) ==> s.charCodeAt(k) !== code)\n //@ ensures \\result === -1 ==> forall(k: nat, (from <= k && k < s.length) ==> s.charCodeAt(k) !== code)\n const c = codeAt(s, from);\n if (c === code) return from;\n if (c === -1) return -1;\n return indexOfCode(s, code, from + 1);\n}\n\n/**\n * The first index ≥ `i` holding `a` or `b`, or |s| (a run either code ends: a path segment's\n * run to \"/\" or \"?\"). One scan: the lesser of two `indexOfCode` ends is the same index, but\n * its two sides are equal only when both are |s|, a boundary no test can observe.\n *\n * @requires i ≤ |s|\n * @ensures i ≤ result ≤ |s| ∧ ∀ k ∈ [i, result). s[k] ∉ {a, b} ∧ (result < |s| ⟹ s[result] ∈ {a, b})\n * — exactly the first such index\n */\nexport function eitherCodeEnd(s: string, a: number, b: number, i: number): number {\n //@ verify\n //@ type i nat\n //@ requires 0 <= i && i <= s.length\n //@ requires a >= 0 && b >= 0\n //@ decreases s.length - i\n //@ ensures i <= \\result && \\result <= s.length\n //@ ensures forall(k: nat, (i <= k && k < \\result) ==> (s.charCodeAt(k) !== a && s.charCodeAt(k) !== b))\n //@ ensures \\result < s.length ==> (s.charCodeAt(\\result) === a || s.charCodeAt(\\result) === b)\n const c = codeAt(s, i);\n if (c === -1 || c === a || c === b) return i;\n return eitherCodeEnd(s, a, b, i + 1);\n}\n\n/**\n * `s` without one trailing `code` (\"\\r\" before a \"\\n\", say); unchanged otherwise.\n *\n * @ensures s ends with code ⟹ result = s[0, |s| − 1)\n * @ensures otherwise result = s\n */\nexport function dropLast(s: string, code: number): string {\n //@ verify\n //@ requires code >= 0\n //@ ensures (s.length > 0 && s.charCodeAt(s.length - 1) === code) ==> \\result === s.slice(0, s.length - 1)\n //@ ensures !(s.length > 0 && s.charCodeAt(s.length - 1) === code) ==> \\result === s\n return codeAt(s, s.length - 1) === code ? s.slice(0, s.length - 1) : s;\n}\n\n/**\n * `s` without its leading `code` units (every one of them).\n *\n * @ensures exactly the model's LStripCode\n */\nexport function lStripCode(s: string, code: number): string {\n //@ verify\n //@ requires code >= 0\n //@ decreases s.length\n //@ ensures \\result.length <= s.length\n if (codeAt(s, 0) === code) return lStripCode(s.slice(1), code);\n return s;\n}\n\n/**\n * `s` without its trailing `code` units (every one of them).\n *\n * @ensures exactly the model's RStripCode\n */\nexport function rStripCode(s: string, code: number): string {\n //@ verify\n //@ requires code >= 0\n //@ decreases s.length\n //@ ensures \\result.length <= s.length\n if (codeAt(s, s.length - 1) === code) {\n return rStripCode(s.slice(0, s.length - 1), code);\n }\n return s;\n}\n\n/**\n * `s` without its leading and trailing `code` units, the middle kept (`/a/b/` with `/` →\n * `a/b`).\n *\n * @ensures exactly the model's StripCode — neither end is `code` (StripCodeTrims)\n */\nexport function stripCode(s: string, code: number): string {\n //@ verify\n //@ requires code >= 0\n //@ ensures \\result === rStripCode(lStripCode(s, code), code)\n return rStripCode(lStripCode(s, code), code);\n}\n\n/**\n * JS `s.startsWith(x, pos)`, which lsc mistranslates (it drops `pos`). Like JS, a `pos`\n * past the end counts as the end, so the empty string matches anywhere.\n *\n * @ensures pos ≤ |s| ⟹ (result ⟺ pos + |x| ≤ |s| ∧ s[pos, pos + |x|) = x) — so a true\n * result also gives the bounds for slicing after the match\n * @ensures pos > |s| ⟹ (result ⟺ x = \"\")\n */\nexport function startsWithAt(s: string, x: string, pos: number): boolean {\n //@ verify\n //@ type pos nat\n //@ requires pos >= 0\n //@ ensures pos <= s.length ==> (\\result <==> (pos + x.length <= s.length && s.slice(pos, pos + x.length) === x))\n //@ ensures pos > s.length ==> (\\result <==> x.length === 0)\n // Math.min, not a ternary: at pos = |s| both branches agree, so `<` vs `<=` is equivalent\n const at = Math.min(pos, s.length);\n // The slice is clamped to the end, so a too-long x differs by length: no separate fit test\n // (JS slice clamps too, which made one unobservable)\n return s.slice(at, Math.min(at + x.length, s.length)) === x;\n}\n\n/**\n * `s` with A-Z lowercased and every other character kept: what lsc's proofs take\n * `toLowerCase()` to be. JS's `toLowerCase()` also maps non-ASCII letters, some onto ASCII\n * (the Kelvin sign K, U+212A, becomes \"k\") or onto two characters (İ, U+0130), so a proved\n * function that lowercases MUST use this, or the runtime does what the proof says it\n * doesn't.\n *\n * @ensures result = s with A-Z lowercased — same length, every other character unchanged\n */\nexport function lowerAscii(s: string): string {\n //@ verify\n //@ decreases s.length\n //@ ensures \\result === s.toLowerCase()\n if (s.length === 0) return \"\";\n const c = s.charCodeAt(0);\n const head =\n c >= 65 && c <= 90 ? \"abcdefghijklmnopqrstuvwxyz\".slice(c - 65, c - 64) : s.slice(0, 1);\n return head + lowerAscii(s.slice(1));\n}\n\n/**\n * `lowerAscii` as a loop: a constant stack depth (and linear time) on long text, where the\n * recursive spec takes a frame and a slice per character.\n *\n * @ensures result = lowerAscii(s)\n */\nexport function lowerAsciiText(s: string): string {\n //@ verify\n //@ ensures \\result === lowerAscii(s)\n let out = \"\";\n let i = 0;\n while (i !== s.length) {\n //@ invariant 0 <= i && i <= s.length\n //@ invariant out + lowerAscii(s.slice(i)) === lowerAscii(s)\n //@ decreases s.length - i\n const c = s.charCodeAt(i);\n out =\n out +\n (c >= 65 && c <= 90 ? \"abcdefghijklmnopqrstuvwxyz\".slice(c - 65, c - 64) : s.slice(i, i + 1));\n i = i + 1;\n }\n return out;\n}\n\n/**\n * Whether `x` from index `k` matches `s` from `pos + k`, code by code, ASCII-lowered. A code\n * past the end of `s` is -1 (`codeAt`), which no code of `x` is, so there is no bound to\n * check (a `pos + |x| ≤ |s|` guard before a slice never changed the answer at runtime, where\n * `slice` clamps: an equivalent mutant, 2026-11-02).\n *\n * @ensures exactly the model's CaselessFrom\n */\nexport function caselessFrom(s: string, x: string, pos: number, k: number): boolean {\n //@ verify\n //@ type pos nat\n //@ type k nat\n //@ requires pos >= 0 && k >= 0 && k <= x.length\n //@ decreases x.length - k\n //@ ensures k === x.length ==> \\result\n if (k === x.length) return true;\n return lowerCode(codeAt(s, pos + k)) === x.charCodeAt(k) && caselessFrom(s, x, pos, k + 1);\n}\n\n/**\n * Whether the text of `s` at `pos`, ASCII-lowered, is `x` (`x` given lowercase): a case-free\n * `startsWith`; callers carry no length guard of their own. Only `pos ≤ |s|` is checked: it\n * decides an empty `x` past the end, the one case the code-by-code test can't see.\n *\n * @ensures result ⟺ pos + |x| ≤ |s| ∧ lowerAscii(s[pos, pos + |x|)) = x — Utils.StartsWithCaseless\n */\nexport function startsWithCaseless(s: string, x: string, pos: number): boolean {\n //@ verify\n //@ type pos nat\n //@ requires pos >= 0\n //@ ensures \\result <==> (pos + x.length <= s.length && s.slice(pos, pos + x.length).toLowerCase() === x)\n return pos <= s.length && caselessFrom(s, x, pos, 0);\n}\n\n/**\n * Whether `s` ends with `suffix` (JS one-argument `endsWith`, which lsc reads as its\n * two-argument form; moved from the augur-api generator 2026-11-01).\n *\n * @ensures result ⟺ |s| ≥ |suffix| ∧ s[|s| − |suffix|, |s|) = suffix — exactly the model's EndsWith\n */\nexport function endsWith(s: string, suffix: string): boolean {\n //@ verify\n //@ ensures \\result <==> (s.length >= suffix.length && s.slice(s.length - suffix.length) === suffix)\n // No length test: from max(|s| − |suffix|, 0), a too-long suffix compares unequal by length\n return s.slice(Math.max(s.length - suffix.length, 0)) === suffix;\n}\n\n/**\n * The order of `a` and `b` by UTF-16 code unit from index `i`, as a recursive spec: -1, 0\n * or 1 (JS `<` on strings; a proper prefix comes first). Locale-free, unlike `localeCompare`.\n *\n * @ensures result ∈ {-1, 0, 1} — exactly the model's CompareFrom\n */\nexport function compareFrom(a: string, b: string, i: number): number {\n //@ verify\n //@ type i nat\n //@ requires i >= 0\n //@ decreases a.length - i\n //@ ensures \\result === -1 || \\result === 0 || \\result === 1\n if (i >= a.length) return i >= b.length ? 0 : -1;\n if (i >= b.length) return 1;\n const x = a.charCodeAt(i);\n const y = b.charCodeAt(i);\n if (x < y) return -1;\n if (x > y) return 1;\n return compareFrom(a, b, i + 1);\n}\n\n/**\n * The order of two strings by UTF-16 code unit, for `sort` (what the default `sort` uses on\n * strings), so sorted output never depends on locale.\n *\n * @ensures result = compareFrom(a, b, 0)\n */\nexport function compareCodeUnits(a: string, b: string): number {\n //@ verify\n //@ ensures \\result === compareFrom(a, b, 0)\n return compareFrom(a, b, 0);\n}\n\n/**\n * JS `s.slice(0, n)`: at most `n` characters, clamped to the length. lsc reads a bare\n * `slice(0, n)` without JS's clamp, so use this instead.\n *\n * @ensures result = s[0, min(n, |s|))\n */\nexport function prefix(s: string, n: number): string {\n //@ verify\n //@ type n nat\n //@ requires n >= 0\n //@ ensures n < s.length ==> \\result === s.slice(0, n)\n //@ ensures n >= s.length ==> \\result === s\n // Math.min, not a ternary: JS slice already clamps, so a ternary's branch is unobservable\n return s.slice(0, Math.min(n, s.length));\n}\n\n/**\n * The end of the JS-whitespace (`\\s`) run starting at `i`: the first index ≥ i that is not\n * whitespace, or |s|.\n *\n * @ensures i ≤ result ≤ |s| ∧ s[i, result) all whitespace ∧ (result = |s| ∨ ¬space(s[result]))\n */\nexport function spaceRunEnd(s: string, i: number): number {\n //@ verify\n //@ type i nat\n //@ requires 0 <= i && i <= s.length\n //@ decreases s.length - i\n //@ ensures i <= \\result && \\result <= s.length\n //@ ensures forall(k: nat, (i <= k && k < \\result) ==> isJsSpace(s.charCodeAt(k)))\n //@ ensures \\result < s.length ==> !isJsSpace(s.charCodeAt(\\result))\n // codeAt is -1 at the end, which is no space: the bound needs no test of its own here\n if (!isJsSpace(codeAt(s, i))) return i;\n return spaceRunEnd(s, i + 1);\n}\n\n/**\n * A natural number written canonically (`^(0|[1-9][0-9]*)$`): the keys JS objects move\n * first, ahead of their source order.\n *\n * @ensures exactly the model's CanonicalNat, stated over the codes themselves so an importer\n * can use it (a contract naming `digitsFrom` can't be resolved there, models/LSC-GAPS.md)\n */\nexport function isCanonicalNat(s: string): boolean {\n //@ verify\n //@ ensures \\result <==> (s === \"0\" || (s.length > 0 && s.charCodeAt(0) >= 49 && s.charCodeAt(0) <= 57 && forall(k: nat, (1 <= k && k < s.length) ==> (s.charCodeAt(k) >= 48 && s.charCodeAt(k) <= 57))))\n if (s === \"0\") return true;\n const first = codeAt(s, 0);\n return first >= 49 && first <= 57 && digitsFrom(s, 1);\n}\n\n/**\n * The value of a run of decimal digits, most significant first (\"\" is 0).\n *\n * @requires ∀ k ∈ [0, |s|). isDigit(s[k])\n * @ensures exactly the model's DigitsValue (proved in links/utils-strings.dfy)\n */\nexport function digitsValue(s: string): number {\n //@ verify\n //@ requires forall(k: nat, k < s.length ==> (s.charCodeAt(k) >= 48 && s.charCodeAt(k) <= 57))\n //@ decreases s.length\n //@ ensures \\result >= 0\n if (s.length === 0) return 0;\n return digitsValue(s.slice(0, s.length - 1)) * 10 + (s.charCodeAt(s.length - 1) - 48);\n}\n\n/**\n * What a number from the environment means (owner 2026-11-04: a bad one fails at start):\n * \"default\" when unset (\"\": the wrapper reads a missing variable as \"\"), \"value\" when it is\n * a canonical natural number at least `min` (its value is `digitsValue(raw)`), and \"bad\"\n * otherwise: a sign, a space, a fraction, an exponent, hex, text, or below `min`.\n *\n * @ensures exactly the model's EnvNumberOf (proved in links/utils-strings.dfy)\n */\nexport function envNumberKind(raw: string, min: number): string {\n //@ verify\n //@ type min nat\n //@ ensures raw === \"\" ==> \\result === \"default\"\n //@ ensures (raw !== \"\" && !isCanonicalNat(raw)) ==> \\result === \"bad\"\n if (raw === \"\") return \"default\";\n if (!isCanonicalNat(raw)) return \"bad\";\n return digitsValue(raw) < min ? \"bad\" : \"value\";\n}\n\n/**\n * The first index ≥ `i` holding a line terminator, or |s|: where a regex `.+` started at `i`\n * stops.\n *\n * @ensures i ≤ result ≤ |s| ∧ no terminator in s[i, result) ∧ (result = |s| ∨ terminator at result)\n */\nexport function lineEnd(s: string, i: number): number {\n //@ verify\n //@ type i nat\n //@ requires 0 <= i && i <= s.length\n //@ decreases s.length - i\n //@ ensures i <= \\result && \\result <= s.length\n //@ ensures forall(k: nat, (i <= k && k < \\result) ==> !isLineTerminator(s.charCodeAt(k)))\n //@ ensures \\result < s.length ==> isLineTerminator(s.charCodeAt(\\result))\n if (i === s.length || isLineTerminator(s.charCodeAt(i))) return i;\n return lineEnd(s, i + 1);\n}\n\n/**\n * The largest p with lo ≤ p < hi whose character is not a line terminator, or -1: where a\n * backtracking regex `.` can start.\n *\n * @ensures result = -1 ∨ (lo ≤ result < hi ∧ ¬terminator(s[result]) ∧ only terminators in (result, hi))\n */\nexport function lastLineCharBelow(s: string, hi: number, lo: number): number {\n //@ verify\n //@ type hi nat\n //@ type lo nat\n //@ requires 0 <= lo && 0 <= hi && hi <= s.length\n //@ decreases hi\n //@ ensures \\result === -1 || (lo <= \\result && \\result < hi)\n //@ ensures \\result >= 0 ==> !isLineTerminator(s.charCodeAt(\\result))\n //@ ensures \\result >= 0 ==> forall(k: nat, (\\result < k && k < hi) ==> isLineTerminator(s.charCodeAt(k)))\n //@ ensures \\result === -1 ==> forall(k: nat, (lo <= k && k < hi) ==> isLineTerminator(s.charCodeAt(k)))\n if (hi <= lo) return -1;\n if (!isLineTerminator(s.charCodeAt(hi - 1))) return hi - 1;\n return lastLineCharBelow(s, hi - 1, lo);\n}\n\n/**\n * Nothing but JS whitespace (`s.trim() === \"\"`).\n *\n * @ensures exactly the model's Blank\n */\nexport function isBlank(s: string): boolean {\n //@ verify\n //@ ensures \\result <==> s.trim() === \"\"\n return s.trim() === \"\";\n}\n\n/**\n * The first index ≥ `i` where `x` occurs in `s`, or -1 (JS `s.indexOf(x, i)` for i ≤ |s|).\n *\n * @ensures result = -1 ∨ (i ≤ result ∧ s[result, result + |x|) = x) — and the first such\n * index: links/utils-strings.dfy proves it is exactly the model's IndexOfFrom (lsc can't\n * give the \"no earlier match\" quantifier a trigger)\n */\nexport function indexOfFrom(s: string, x: string, i: number): number {\n //@ verify\n //@ type i nat\n //@ requires i >= 0 && i <= s.length\n //@ decreases s.length - i\n //@ ensures \\result === -1 || (i <= \\result && \\result + x.length <= s.length)\n //@ ensures \\result >= 0 ==> s.slice(\\result, \\result + x.length) === x\n // A match here, else the end, else the next index: stopping at `i === |s|` (not \"x no\n // longer fits\") leaves no bound whose slip a later, harmless step would hide\n if (startsWithAt(s, x, i)) return i;\n if (i === s.length) return -1;\n return indexOfFrom(s, x, i + 1);\n}\n\n/**\n * `indexOfFrom` as a loop: the same answer at a constant stack depth, for text long enough that\n * one frame per character would overflow the stack (a rendered page, 50–60 KB with its inlined\n * stylesheet). Specs and links use `indexOfFrom`; runtime scans over long text use this.\n *\n * @ensures result = indexOfFrom(s, x, i)\n */\nexport function findFrom(s: string, x: string, i: number): number {\n //@ verify\n //@ type i nat\n //@ requires i >= 0 && i <= s.length\n //@ ensures \\result === indexOfFrom(s, x, i)\n let k = i;\n while (k !== s.length) {\n //@ invariant i <= k && k <= s.length\n //@ invariant indexOfFrom(s, x, k) === indexOfFrom(s, x, i)\n //@ decreases s.length - k\n if (startsWithAt(s, x, k)) return k;\n k = k + 1;\n }\n return startsWithAt(s, x, k) ? k : -1;\n}\n\n/**\n * `indexOfCode` as a loop: the same answer at a constant stack depth (see `findFrom`).\n *\n * @ensures result = indexOfCode(s, code, from)\n */\nexport function findCodeFrom(s: string, code: number, from: number): number {\n //@ verify\n //@ type from nat\n //@ requires code >= 0 && from >= 0\n //@ ensures \\result === indexOfCode(s, code, from)\n let k = from;\n while (k < s.length) {\n //@ invariant from <= k\n //@ invariant indexOfCode(s, code, k) === indexOfCode(s, code, from)\n //@ decreases s.length - k\n if (s.charCodeAt(k) === code) return k;\n k = k + 1;\n }\n return -1;\n}\n\n/**\n * How many times `x` occurs in `s` from `i` on, left to right without overlaps (repeated JS\n * `s.indexOf(x, at + x.length)`).\n *\n * @requires |x| > 0\n * @ensures result ≥ 0 — exactly the model's CountFrom (links/utils-strings.dfy)\n */\nexport function countFrom(s: string, x: string, i: number): number {\n //@ verify\n //@ type i nat\n //@ requires x.length > 0 && i >= 0 && i <= s.length\n //@ decreases s.length - i\n //@ ensures \\result >= 0\n const at = indexOfFrom(s, x, i);\n if (at === -1) return 0;\n return 1 + countFrom(s, x, at + x.length);\n}\n\n/**\n * `countFrom(s, x, 0)` as a loop: a constant stack depth on long text (see `findFrom`).\n *\n * @requires |x| > 0\n * @ensures result = countFrom(s, x, 0)\n */\nexport function countOf(s: string, x: string): number {\n //@ verify\n //@ requires x.length > 0\n //@ ensures \\result === countFrom(s, x, 0)\n let n = 0;\n let i = 0;\n let at = findFrom(s, x, 0);\n while (at !== -1) {\n //@ invariant 0 <= i && i <= s.length\n //@ invariant at === indexOfFrom(s, x, i)\n //@ invariant n + countFrom(s, x, i) === countFrom(s, x, 0)\n //@ decreases s.length - i\n n = n + 1;\n i = at + x.length;\n at = findFrom(s, x, i);\n }\n return n;\n}\n\n/**\n * The text before the first `code`, or all of it when there is none (JS `s.split(c)[0]`).\n *\n * @ensures result = s[0, first code) when s holds one, else s — the model's UntilCode\n */\nexport function untilCode(s: string, code: number): string {\n //@ verify\n //@ requires code >= 0\n //@ ensures \\result === (indexOfCode(s, code, 0) >= 0 && indexOfCode(s, code, 0) <= s.length ? s.slice(0, indexOfCode(s, code, 0)) : s)\n const k = indexOfCode(s, code, 0);\n return k >= 0 ? s.slice(0, k) : s;\n}\n\n/**\n * `s` from `i` on split at every `code` (JS `s.split(c)` at i = 0, for a one-character\n * separator): always at least one part.\n *\n * @ensures |result| ≥ 1 — exactly the model's SplitCodeFrom (links/utils-strings.dfy)\n */\nexport function splitCodeFrom(s: string, code: number, i: number): string[] {\n //@ verify\n //@ type i nat\n //@ requires code >= 0 && i >= 0 && i <= s.length\n //@ decreases s.length - i\n //@ ensures \\result.length > 0\n const k = indexOfCode(s, code, i);\n if (k === -1) return [s.slice(i)];\n return [s.slice(i, k), ...splitCodeFrom(s, code, k + 1)];\n}\n\n/**\n * Every run of JS whitespace in `s` from `i` on as one space (JS `s.replace(/\\s+/g, \" \")` at\n * i = 0).\n *\n * @ensures |result| ≤ |s| − i — exactly the model's CollapseSpacesFrom (links/utils-strings.dfy)\n */\nexport function collapseSpacesFrom(s: string, i: number): string {\n //@ verify\n //@ type i nat\n //@ requires 0 <= i && i <= s.length\n //@ decreases s.length - i\n //@ ensures \\result.length <= s.length - i\n if (i === s.length) return \"\";\n if (isJsSpace(s.charCodeAt(i))) return \" \" + collapseSpacesFrom(s, spaceRunEnd(s, i));\n return s.slice(i, i + 1) + collapseSpacesFrom(s, i + 1);\n}\n\n/**\n * `collapseSpacesFrom(s, 0)` at a constant stack depth (a page's text is tens of KB).\n *\n * @ensures result = collapseSpacesFrom(s, 0)\n */\nexport function collapseSpaces(s: string): string {\n //@ verify\n //@ ensures \\result === collapseSpacesFrom(s, 0)\n let out = \"\";\n let i = 0;\n while (i < s.length) {\n //@ invariant 0 <= i && i <= s.length\n //@ invariant out + collapseSpacesFrom(s, i) === collapseSpacesFrom(s, 0)\n //@ decreases s.length - i\n if (isJsSpace(s.charCodeAt(i))) {\n out = out + \" \";\n i = spaceRunEnd(s, i);\n } else {\n out = out + s.slice(i, i + 1);\n i = i + 1;\n }\n }\n return out;\n}\n\n/**\n * `n` spaces.\n *\n * @ensures result = \" \" repeated n times — the model's Spaces\n */\nexport function spaces(n: number): string {\n //@ verify\n //@ type n nat\n //@ requires n >= 0\n //@ decreases n\n //@ ensures \\result.length === n\n //@ ensures forall(k: nat, k < n ==> \\result.charCodeAt(k) === 32)\n if (n === 0) return \"\";\n return \" \" + spaces(n - 1);\n}\n\n/**\n * A line feed, `\"\\n\"`, for proved text that spans lines: lsc emits a `\"\\n\"` escape raw, which\n * Dafny cannot parse (models/LSC-GAPS.md), so the contract pins it by code unit and the body is\n * a template literal holding the line break itself.\n *\n * @ensures result = \"\\n\" — one code unit, 10\n */\nexport function lineFeed(): string {\n //@ verify\n //@ ensures \\result.length === 1 && \\result.charCodeAt(0) === 10\n return `\n`;\n}\n\n/**\n * `s` padded on the left with spaces to `width` (JS `s.padStart(width)`).\n *\n * @ensures result = Spaces(width − |s|) + s when width > |s|, else s\n */\nexport function padLeft(s: string, width: number): string {\n //@ verify\n //@ ensures width <= s.length ==> \\result === s\n // width > |s| ⟹ spaces(width − |s|) + s: a hand ensures in strings.dfy, so importers'\n // axioms name no helper (models/LSC-GAPS.md). Math.max, not a ternary: at width = |s|\n // both branches agree (spaces(0) is \"\"), so `>` vs `>=` would be equivalent.\n return spaces(Math.max(width - s.length, 0)) + s;\n}\n\n/**\n * `s` padded on the right with spaces to `width` (JS `s.padEnd(width)`).\n *\n * @ensures result = s + Spaces(width − |s|) when width > |s|, else s\n */\nexport function padRight(s: string, width: number): string {\n //@ verify\n //@ ensures width <= s.length ==> \\result === s\n // width > |s| ⟹ s + spaces(width − |s|): a hand ensures in strings.dfy, as padLeft's.\n return s + spaces(Math.max(width - s.length, 0));\n}\n\n/**\n * An optional part of a key: `tag` then `text`, or nothing when `text` is empty, so an absent\n * part never leaves a bare tag.\n *\n * @ensures result = \"\" when text = \"\", else tag + text — exactly the model's KeyPart\n */\nexport function keyPart(tag: string, text: string): string {\n //@ verify\n //@ ensures \\result === (text === \"\" ? \"\" : tag + text)\n return text === \"\" ? \"\" : tag + text;\n}\n\n/**\n * Two texts joined by one space: the one rule behind a loader key's `<column> <direction>`, a\n * sync line's `METHOD /path` and a field's description then note.\n *\n * @ensures result = a + \" \" + b — exactly the model's SpaceJoined\n */\nexport function spaceJoined(a: string, b: string): string {\n //@ verify\n //@ ensures \\result === a + \" \" + b\n return a + \" \" + b;\n}\n\n/**\n * Whether `x` occurs in `s` at some index ≥ `i` (JS `s.includes(x, i)` for i ≤ |s|).\n *\n * @ensures result ⟺ ∃ k. i ≤ k ≤ |s| ∧ startsWithAt(s, x, k) — exactly the model's\n * IncludesFrom: a hand lemma in strings.dfy (`includesFrom_exists`), so importers' axioms\n * name no helper (models/LSC-GAPS.md)\n */\nexport function includesFrom(s: string, x: string, i: number): boolean {\n //@ verify\n //@ type i nat\n //@ requires i >= 0\n //@ decreases s.length + 1 - i\n if (i > s.length) return false;\n if (startsWithAt(s, x, i)) return true;\n return includesFrom(s, x, i + 1);\n}\n\n/**\n * `s` with a-z uppercased and every other character kept, the mirror of `lowerAscii`: JS's\n * `toUpperCase()` also maps non-ASCII letters (ß becomes \"SS\").\n *\n * @ensures result = s with a-z uppercased — same length, every other character unchanged\n */\nexport function upperAscii(s: string): string {\n //@ verify\n //@ decreases s.length\n //@ ensures \\result === s.toUpperCase()\n if (s.length === 0) return \"\";\n const c = s.charCodeAt(0);\n const head =\n c >= 97 && c <= 122 ? \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\".slice(c - 97, c - 96) : s.slice(0, 1);\n return head + upperAscii(s.slice(1));\n}\n","//@ backend dafny\nimport { codeAt, startsWithAt } from \"@atlas/utils/strings\";\n\n/* augur-doctor's decisions, verified with LemmaScript → Dafny (model: models/AugurConfig.dfy;\n link: models/links/augur-config-doctor-rules.dfy). What a check reads from the site (a file\n exists, its text holds a string or matches a regex) is a fact handed in by facts.ts. */\n\n/** A check's outcome. */\nexport type Status = \"PASS\" | \"FAIL\" | \"WARN\" | \"SUGGEST\" | \"SKIP\";\n\n/**\n * A file that should use a factory: there and using it passes; there without it warns; missing\n * fails (site-config, server-site, ssr-options).\n *\n * @ensures exactly the model's FileUses\n */\nexport function fileUses(found: boolean, uses: boolean): Status {\n //@ verify\n //@ ensures found && uses ==> \\result === \"PASS\"\n //@ ensures found && !uses ==> \\result === \"WARN\"\n //@ ensures !found ==> \\result === \"FAIL\"\n if (found && uses) return \"PASS\";\n return found ? \"WARN\" : \"FAIL\";\n}\n\n/**\n * actions: re-exporting passes, there otherwise warns; missing passes with the proxy pattern.\n *\n * @ensures exactly the model's ActionsStatus\n */\nexport function actionsStatus(found: boolean, reExports: boolean, usesProxy: boolean): Status {\n //@ verify\n //@ ensures found && reExports ==> \\result === \"PASS\"\n //@ ensures found && !reExports ==> \\result === \"WARN\"\n //@ ensures !found && usesProxy ==> \\result === \"PASS\"\n //@ ensures !found && !usesProxy ==> \\result === \"FAIL\"\n if (found) return reExports ? \"PASS\" : \"WARN\";\n return usesProxy ? \"PASS\" : \"FAIL\";\n}\n\n/**\n * site-hooks: createSiteHooks or another hooks setup passes; a file without either warns.\n *\n * @ensures exactly the model's SiteHooksStatus\n */\nexport function siteHooksStatus(\n found: boolean,\n createSiteHooks: boolean,\n hooksSetup: boolean,\n): Status {\n //@ verify\n //@ ensures found && (createSiteHooks || hooksSetup) ==> \\result === \"PASS\"\n //@ ensures found && !(createSiteHooks || hooksSetup) ==> \\result === \"WARN\"\n //@ ensures !found ==> \\result === \"FAIL\"\n return fileUses(found, createSiteHooks || hooksSetup);\n}\n\n/**\n * tsconfig: extends augur-config/tsconfig/next passes; another augur-config preset warns; else\n * (or no tsconfig.json) fails.\n *\n * @ensures exactly the model's TsconfigStatus\n */\nexport function tsconfigStatus(\n found: boolean,\n extendsNext: boolean,\n extendsAugur: boolean,\n): Status {\n //@ verify\n //@ ensures !found ==> \\result === \"FAIL\"\n //@ ensures found && extendsNext ==> \\result === \"PASS\"\n //@ ensures found && !extendsNext && extendsAugur ==> \\result === \"WARN\"\n //@ ensures found && !extendsNext && !extendsAugur ==> \\result === \"FAIL\"\n if (!found) return \"FAIL\";\n if (extendsNext) return \"PASS\";\n return extendsAugur ? \"WARN\" : \"FAIL\";\n}\n\n/**\n * eslint and prettier: a config using the shared preset passes; every other case fails.\n *\n * @ensures exactly the model's PresetStatus\n */\nexport function presetStatus(found: boolean, usesPreset: boolean): Status {\n //@ verify\n //@ ensures \\result === (found && usesPreset ? \"PASS\" : \"FAIL\")\n return found && usesPreset ? \"PASS\" : \"FAIL\";\n}\n\n/**\n * eslint-deprecated: skipped without an ESLint config; on passes; named otherwise warns.\n *\n * @ensures exactly the model's DeprecatedStatus\n */\nexport function deprecatedStatus(hasEslint: boolean, ruleOn: boolean, named: boolean): Status {\n //@ verify\n //@ ensures !hasEslint ==> \\result === \"SKIP\"\n //@ ensures hasEslint && ruleOn ==> \\result === \"PASS\"\n //@ ensures hasEslint && !ruleOn && named ==> \\result === \"WARN\"\n //@ ensures hasEslint && !ruleOn && !named ==> \\result === \"FAIL\"\n if (!hasEslint) return \"SKIP\";\n if (ruleOn) return \"PASS\";\n return named ? \"WARN\" : \"FAIL\";\n}\n\n/**\n * knip: config and dependency pass; the dependency alone warns; else fails.\n *\n * @ensures exactly the model's KnipStatus\n */\nexport function knipStatus(hasConfig: boolean, hasDep: boolean): Status {\n //@ verify\n //@ ensures hasConfig && hasDep ==> \\result === \"PASS\"\n //@ ensures !hasConfig && hasDep ==> \\result === \"WARN\"\n //@ ensures !hasDep ==> \\result === \"FAIL\"\n if (!hasDep) return \"FAIL\";\n return hasConfig ? \"PASS\" : \"WARN\";\n}\n\n/**\n * icons: react-icons alone passes; heroicons or lucide fails; none warns.\n *\n * @ensures exactly the model's IconsStatus\n */\nexport function iconsStatus(reactIcons: boolean, heroicons: boolean, lucide: boolean): Status {\n //@ verify\n //@ ensures reactIcons && !heroicons && !lucide ==> \\result === \"PASS\"\n //@ ensures (heroicons || lucide) ==> \\result === \"FAIL\"\n //@ ensures !reactIcons && !heroicons && !lucide ==> \\result === \"WARN\"\n if (heroicons || lucide) return \"FAIL\";\n return reactIcons ? \"PASS\" : \"WARN\";\n}\n\n/**\n * tailwind: a range starting \"^4\" or \"4\" passes, \"^3\" or \"3\" fails, anything else warns.\n *\n * @ensures exactly the model's TailwindStatus\n */\nexport function tailwindStatus(range: string): Status {\n //@ verify\n //@ ensures (startsWithAt(range, \"^4\", 0) || startsWithAt(range, \"4\", 0)) ==> \\result === \"PASS\"\n //@ ensures !(startsWithAt(range, \"^4\", 0) || startsWithAt(range, \"4\", 0)) && (startsWithAt(range, \"^3\", 0) || startsWithAt(range, \"3\", 0)) ==> \\result === \"FAIL\"\n //@ ensures !(startsWithAt(range, \"^4\", 0) || startsWithAt(range, \"4\", 0)) && !(startsWithAt(range, \"^3\", 0) || startsWithAt(range, \"3\", 0)) ==> \\result === \"WARN\"\n if (startsWithAt(range, \"^4\", 0) || startsWithAt(range, \"4\", 0)) return \"PASS\";\n if (startsWithAt(range, \"^3\", 0) || startsWithAt(range, \"3\", 0)) return \"FAIL\";\n return \"WARN\";\n}\n\n/** What augur-doctor reads from next.config. */\nexport interface NextFacts {\n hasConfig: boolean;\n hasExternal: boolean;\n externalHasServer: boolean;\n usesIoredis: boolean;\n externalHasIoredis: boolean;\n hasAllHeaders: boolean;\n hasHeaders: boolean;\n hasOptimize: boolean;\n hasStrict: boolean;\n hasAgrMedia: boolean;\n hasImages: boolean;\n}\n\n/**\n * next-external: augur-server MUST NOT be externalized; no serverExternalPackages warns.\n *\n * @ensures exactly the model's NextExternalStatus\n */\nexport function nextExternalStatus(n: NextFacts): Status {\n //@ verify\n //@ ensures !n.hasConfig ==> \\result === \"FAIL\"\n //@ ensures n.hasConfig && n.hasExternal ==> \\result === (n.externalHasServer ? \"FAIL\" : \"PASS\")\n //@ ensures n.hasConfig && !n.hasExternal ==> \\result === \"WARN\"\n if (!n.hasConfig) return \"FAIL\";\n if (n.hasExternal) return n.externalHasServer ? \"FAIL\" : \"PASS\";\n return \"WARN\";\n}\n\n/**\n * next-ioredis: checked only when the site uses ioredis and has serverExternalPackages.\n *\n * @ensures exactly the model's IoredisStatus\n */\nexport function ioredisStatus(n: NextFacts): Status {\n //@ verify\n //@ ensures (!n.hasConfig || !n.hasExternal || !n.usesIoredis) ==> \\result === \"SKIP\"\n //@ ensures n.hasConfig && n.hasExternal && n.usesIoredis ==> \\result === (n.externalHasIoredis ? \"PASS\" : \"WARN\")\n if (!n.hasConfig || !n.hasExternal || !n.usesIoredis) return \"SKIP\";\n return n.externalHasIoredis ? \"PASS\" : \"WARN\";\n}\n\n/**\n * next-headers: HSTS, X-Content-Type-Options and Permissions-Policy all pass; some warns.\n *\n * @ensures exactly the model's HeadersStatus\n */\nexport function headersStatus(n: NextFacts): Status {\n //@ verify\n //@ ensures !n.hasConfig ==> \\result === \"FAIL\"\n //@ ensures n.hasConfig && n.hasAllHeaders ==> \\result === \"PASS\"\n //@ ensures n.hasConfig && !n.hasAllHeaders && n.hasHeaders ==> \\result === \"WARN\"\n //@ ensures n.hasConfig && !n.hasAllHeaders && !n.hasHeaders ==> \\result === \"FAIL\"\n if (!n.hasConfig) return \"FAIL\";\n if (n.hasAllHeaders) return \"PASS\";\n return n.hasHeaders ? \"WARN\" : \"FAIL\";\n}\n\n/**\n * next-optimize: optimizePackageImports set passes, else fails.\n *\n * @ensures exactly the model's OptimizeStatus\n */\nexport function optimizeStatus(n: NextFacts): Status {\n //@ verify\n //@ ensures \\result === (n.hasConfig && n.hasOptimize ? \"PASS\" : \"FAIL\")\n return n.hasConfig && n.hasOptimize ? \"PASS\" : \"FAIL\";\n}\n\n/**\n * next-strict: reactStrictMode set passes, else warns; skipped with no config.\n *\n * @ensures exactly the model's StrictStatus\n */\nexport function strictStatus(n: NextFacts): Status {\n //@ verify\n //@ ensures !n.hasConfig ==> \\result === \"SKIP\"\n //@ ensures n.hasConfig ==> \\result === (n.hasStrict ? \"PASS\" : \"WARN\")\n if (!n.hasConfig) return \"SKIP\";\n return n.hasStrict ? \"PASS\" : \"WARN\";\n}\n\n/**\n * image-loader: agr.media in next.config passes, else warns; skipped with no config.\n *\n * @ensures exactly the model's ImageLoaderStatus\n */\nexport function imageLoaderStatus(n: NextFacts): Status {\n //@ verify\n //@ ensures !n.hasConfig ==> \\result === \"SKIP\"\n //@ ensures n.hasConfig ==> \\result === (n.hasAgrMedia ? \"PASS\" : \"WARN\")\n if (!n.hasConfig) return \"SKIP\";\n return n.hasAgrMedia ? \"PASS\" : \"WARN\";\n}\n\n/**\n * contract-tests: present passes, else fails.\n *\n * @ensures exactly the model's ContractTestsStatus\n */\nexport function contractTestsStatus(present: boolean): Status {\n //@ verify\n //@ ensures \\result === (present ? \"PASS\" : \"FAIL\")\n return present ? \"PASS\" : \"FAIL\";\n}\n\n/**\n * no-wrapper: skipped without lib/; a client file that wraps AugurAPI fails.\n *\n * @ensures exactly the model's NoWrapperStatus\n */\nexport function noWrapperStatus(hasLib: boolean, wraps: boolean): Status {\n //@ verify\n //@ ensures !hasLib ==> \\result === \"SKIP\"\n //@ ensures hasLib ==> \\result === (wraps ? \"FAIL\" : \"PASS\")\n if (!hasLib) return \"SKIP\";\n return wraps ? \"FAIL\" : \"PASS\";\n}\n\n/**\n * auth: a factory passes; raw NextAuth fails; otherwise (or no auth file) warns.\n *\n * @ensures exactly the model's AuthStatus\n */\nexport function authStatus(found: boolean, usesFactory: boolean, rawNextAuth: boolean): Status {\n //@ verify\n //@ ensures found && usesFactory ==> \\result === \"PASS\"\n //@ ensures found && !usesFactory && rawNextAuth ==> \\result === \"FAIL\"\n //@ ensures !(found && usesFactory) && !(found && rawNextAuth) ==> \\result === \"WARN\"\n if (found && usesFactory) return \"PASS\";\n return found && rawNextAuth ? \"FAIL\" : \"WARN\";\n}\n\n/**\n * quality-script: typecheck, lint and test all named passes; incomplete warns; none fails.\n *\n * @ensures exactly the model's QualityStatus\n */\nexport function qualityStatus(hasScript: boolean, complete: boolean): Status {\n //@ verify\n //@ ensures !hasScript ==> \\result === \"FAIL\"\n //@ ensures hasScript ==> \\result === (complete ? \"PASS\" : \"WARN\")\n if (!hasScript) return \"FAIL\";\n return complete ? \"PASS\" : \"WARN\";\n}\n\n/**\n * pre-commit: lefthook's pre-commit section with lint-staged passes; else a suggestion.\n *\n * @ensures exactly the model's PreCommitStatus\n */\nexport function preCommitStatus(hasPreCommit: boolean, hasLintStaged: boolean): Status {\n //@ verify\n //@ ensures \\result === (hasPreCommit && hasLintStaged ? \"PASS\" : \"SUGGEST\")\n return hasPreCommit && hasLintStaged ? \"PASS\" : \"SUGGEST\";\n}\n\n/**\n * proxy-local-hooks: local useQuery hooks are a suggestion.\n *\n * @ensures exactly the model's LocalHooksStatus\n */\nexport function localHooksStatus(hasUseQuery: boolean): Status {\n //@ verify\n //@ ensures \\result === (hasUseQuery ? \"SUGGEST\" : \"PASS\")\n return hasUseQuery ? \"SUGGEST\" : \"PASS\";\n}\n\n/**\n * proxy-server-query: either proxy form passes, else a suggestion.\n *\n * @ensures exactly the model's ServerQueryStatus\n */\nexport function serverQueryStatus(usesServerProxy: boolean, usesAugurOptions: boolean): Status {\n //@ verify\n //@ ensures \\result === (usesServerProxy || usesAugurOptions ? \"PASS\" : \"SUGGEST\")\n return usesServerProxy || usesAugurOptions ? \"PASS\" : \"SUGGEST\";\n}\n\n/**\n * query-client-scope and query-gc-time: any offending file fails.\n *\n * @ensures exactly the model's NoOffenderStatus\n */\nexport function noOffenderStatus(offenders: number): Status {\n //@ verify\n //@ ensures \\result === (offenders > 0 ? \"FAIL\" : \"PASS\")\n return offenders > 0 ? \"FAIL\" : \"PASS\";\n}\n\n/**\n * An augur-api CalVer at or after 2026.3.7 has typed proxies.\n *\n * @ensures exactly the model's TypedProxyVersion\n */\nexport function typedProxyVersion(year: number, minor: number, patch: number): boolean {\n //@ verify\n //@ ensures \\result === (year > 2026 || (year === 2026 && minor > 3) || (year === 2026 && minor === 3 && patch >= 7))\n return (\n year > 2026 || (year === 2026 && minor > 3) || (year === 2026 && minor === 3 && patch >= 7)\n );\n}\n\n/**\n * api-version: a recognised, typed CalVer passes; anything else warns.\n *\n * @ensures exactly the model's ApiVersionStatus\n */\nexport function apiVersionStatus(\n parsed: boolean,\n year: number,\n minor: number,\n patch: number,\n): Status {\n //@ verify\n //@ ensures \\result === (parsed && typedProxyVersion(year, minor, patch) ? \"PASS\" : \"WARN\")\n return parsed && typedProxyVersion(year, minor, patch) ? \"PASS\" : \"WARN\";\n}\n\n/**\n * A range mark: ^ ~ > = < or whitespace (space, tab, line feed, carriage return).\n *\n * @ensures exactly the model's RangeMark on the code unit\n */\nexport function rangeMark(c: number): boolean {\n //@ verify\n //@ ensures \\result === (c === 94 || c === 126 || c === 62 || c === 61 || c === 60 || c === 32 || c === 9 || c === 10 || c === 13)\n return (\n c === 94 ||\n c === 126 ||\n c === 62 ||\n c === 61 ||\n c === 60 ||\n c === 32 ||\n c === 9 ||\n c === 10 ||\n c === 13\n );\n}\n\n/**\n * A range's version: its leading range marks stripped.\n *\n * @ensures exactly the model's StripRange\n */\nexport function stripRange(s: string): string {\n //@ verify\n //@ decreases s.length\n //@ ensures !rangeMark(codeAt(s, 0)) ==> \\result === s\n if (!rangeMark(codeAt(s, 0))) return s;\n return stripRange(s.slice(1));\n}\n\n/** One installed augur package against its own latest. */\nexport type PackageState = \"current\" | \"behind\" | \"unknown\";\n\n/**\n * A package's state: unknown when npm could not say (\"\" here), current when its range's\n * version is the latest, else behind.\n *\n * @ensures exactly the model's PackageStateOf\n */\nexport function packageStateOf(range: string, latest: string): PackageState {\n //@ verify\n //@ ensures latest === \"\" ==> \\result === \"unknown\"\n //@ ensures latest !== \"\" && stripRange(range) === latest ==> \\result === \"current\"\n //@ ensures latest !== \"\" && stripRange(range) !== latest ==> \\result === \"behind\"\n if (latest === \"\") return \"unknown\";\n return stripRange(range) === latest ? \"current\" : \"behind\";\n}\n\n/**\n * How many of the states from index `i` are `s`.\n *\n * @ensures exactly the model's CountState\n */\nexport function countStateFrom(states: PackageState[], s: PackageState, i: number): number {\n //@ verify\n //@ type i nat\n //@ requires i >= 0\n //@ decreases states.length - i\n //@ ensures i >= states.length ==> \\result === 0\n //@ ensures i < states.length ==> \\result === (states[i] === s ? 1 : 0) + countStateFrom(states, s, i + 1)\n if (i >= states.length) return 0;\n return ((states[i] as PackageState) === s ? 1 : 0) + countStateFrom(states, s, i + 1);\n}\n\n/**\n * augur-version-latest: skipped with none installed; any package behind its own latest fails;\n * else any unknown skips; else passes.\n *\n * @ensures exactly the model's LatestStatus\n */\nexport function latestStatus(states: PackageState[]): Status {\n //@ verify\n //@ ensures states.length === 0 ==> \\result === \"SKIP\"\n //@ ensures states.length > 0 && countStateFrom(states, \"behind\", 0) > 0 ==> \\result === \"FAIL\"\n //@ ensures states.length > 0 && countStateFrom(states, \"behind\", 0) === 0 && countStateFrom(states, \"unknown\", 0) > 0 ==> \\result === \"SKIP\"\n //@ ensures states.length > 0 && countStateFrom(states, \"behind\", 0) === 0 && countStateFrom(states, \"unknown\", 0) === 0 ==> \\result === \"PASS\"\n if (states.length === 0) return \"SKIP\";\n if (countStateFrom(states, \"behind\", 0) > 0) return \"FAIL\";\n return countStateFrom(states, \"unknown\", 0) > 0 ? \"SKIP\" : \"PASS\";\n}\n\n/**\n * How many of the results from index `i` are `s`.\n *\n * @ensures exactly the model's CountStatus\n */\nexport function countStatusFrom(results: Status[], s: Status, i: number): number {\n //@ verify\n //@ type i nat\n //@ requires i >= 0\n //@ decreases results.length - i\n //@ ensures i >= results.length ==> \\result === 0\n //@ ensures i < results.length ==> \\result === (results[i] === s ? 1 : 0) + countStatusFrom(results, s, i + 1)\n if (i >= results.length) return 0;\n return ((results[i] as Status) === s ? 1 : 0) + countStatusFrom(results, s, i + 1);\n}\n\n/**\n * The scored total: skips and suggestions left out.\n *\n * @ensures exactly the model's ScoredTotal\n */\nexport function scoredTotal(results: Status[]): number {\n //@ verify\n //@ ensures \\result === results.length - countStatusFrom(results, \"SKIP\", 0) - countStatusFrom(results, \"SUGGEST\", 0)\n return (\n results.length - countStatusFrom(results, \"SKIP\", 0) - countStatusFrom(results, \"SUGGEST\", 0)\n );\n}\n\n/**\n * The exit code: 1 on any failure, else 0.\n *\n * @ensures exactly the model's ExitCode\n */\nexport function exitCodeOf(results: Status[]): number {\n //@ verify\n //@ ensures \\result === (countStatusFrom(results, \"FAIL\", 0) > 0 ? 1 : 0)\n return countStatusFrom(results, \"FAIL\", 0) > 0 ? 1 : 0;\n}\n\n/**\n * Lighthouse: a URL starting \"http\" is used as is; a path gets the base URL in front.\n *\n * @ensures exactly the model's ResolveUrl\n */\nexport function resolveUrl(u: string, baseUrl: string): string {\n //@ verify\n //@ ensures startsWithAt(u, \"http\", 0) ==> \\result === u\n //@ ensures !startsWithAt(u, \"http\", 0) ==> \\result === baseUrl + u\n return startsWithAt(u, \"http\", 0) ? u : baseUrl + u;\n}\n"],"mappings":";AA8BO,SAAS,OAAO,GAAW,GAAmB;AAInD,SAAO,KAAK,KAAK,IAAI,EAAE,SAAS,EAAE,WAAW,CAAC,IAAI;AACpD;AA4TO,SAAS,aAAa,GAAW,GAAW,KAAsB;AAOvE,QAAM,KAAK,KAAK,IAAI,KAAK,EAAE,MAAM;AAGjC,SAAO,EAAE,MAAM,IAAI,KAAK,IAAI,KAAK,EAAE,QAAQ,EAAE,MAAM,CAAC,MAAM;AAC5D;;;AC1VO,SAAS,SAAS,OAAgB,MAAuB;AAK9D,MAAI,SAAS,KAAM,QAAO;AAC1B,SAAO,QAAQ,SAAS;AAC1B;AAOO,SAAS,cAAc,OAAgB,WAAoB,WAA4B;AAM5F,MAAI,MAAO,QAAO,YAAY,SAAS;AACvC,SAAO,YAAY,SAAS;AAC9B;AAOO,SAAS,gBACd,OACA,iBACA,YACQ;AAKR,SAAO,SAAS,OAAO,mBAAmB,UAAU;AACtD;AAQO,SAAS,eACd,OACA,aACA,cACQ;AAMR,MAAI,CAAC,MAAO,QAAO;AACnB,MAAI,YAAa,QAAO;AACxB,SAAO,eAAe,SAAS;AACjC;AAOO,SAAS,aAAa,OAAgB,YAA6B;AAGxE,SAAO,SAAS,aAAa,SAAS;AACxC;AAOO,SAAS,iBAAiB,WAAoB,QAAiB,OAAwB;AAM5F,MAAI,CAAC,UAAW,QAAO;AACvB,MAAI,OAAQ,QAAO;AACnB,SAAO,QAAQ,SAAS;AAC1B;AAOO,SAAS,WAAW,WAAoB,QAAyB;AAKtE,MAAI,CAAC,OAAQ,QAAO;AACpB,SAAO,YAAY,SAAS;AAC9B;AAOO,SAAS,YAAY,YAAqB,WAAoB,QAAyB;AAK5F,MAAI,aAAa,OAAQ,QAAO;AAChC,SAAO,aAAa,SAAS;AAC/B;AAOO,SAAS,eAAe,OAAuB;AAKpD,MAAI,aAAa,OAAO,MAAM,CAAC,KAAK,aAAa,OAAO,KAAK,CAAC,EAAG,QAAO;AACxE,MAAI,aAAa,OAAO,MAAM,CAAC,KAAK,aAAa,OAAO,KAAK,CAAC,EAAG,QAAO;AACxE,SAAO;AACT;AAsBO,SAAS,mBAAmB,GAAsB;AAKvD,MAAI,CAAC,EAAE,UAAW,QAAO;AACzB,MAAI,EAAE,YAAa,QAAO,EAAE,oBAAoB,SAAS;AACzD,SAAO;AACT;AAOO,SAAS,cAAc,GAAsB;AAIlD,MAAI,CAAC,EAAE,aAAa,CAAC,EAAE,eAAe,CAAC,EAAE,YAAa,QAAO;AAC7D,SAAO,EAAE,qBAAqB,SAAS;AACzC;AAOO,SAAS,cAAc,GAAsB;AAMlD,MAAI,CAAC,EAAE,UAAW,QAAO;AACzB,MAAI,EAAE,cAAe,QAAO;AAC5B,SAAO,EAAE,aAAa,SAAS;AACjC;AAOO,SAAS,eAAe,GAAsB;AAGnD,SAAO,EAAE,aAAa,EAAE,cAAc,SAAS;AACjD;AAOO,SAAS,aAAa,GAAsB;AAIjD,MAAI,CAAC,EAAE,UAAW,QAAO;AACzB,SAAO,EAAE,YAAY,SAAS;AAChC;AAOO,SAAS,kBAAkB,GAAsB;AAItD,MAAI,CAAC,EAAE,UAAW,QAAO;AACzB,SAAO,EAAE,cAAc,SAAS;AAClC;AAOO,SAAS,oBAAoB,SAA0B;AAG5D,SAAO,UAAU,SAAS;AAC5B;AAOO,SAAS,gBAAgB,QAAiB,OAAwB;AAIvE,MAAI,CAAC,OAAQ,QAAO;AACpB,SAAO,QAAQ,SAAS;AAC1B;AAOO,SAAS,WAAW,OAAgB,aAAsB,aAA8B;AAK7F,MAAI,SAAS,YAAa,QAAO;AACjC,SAAO,SAAS,cAAc,SAAS;AACzC;AAOO,SAAS,cAAc,WAAoB,UAA2B;AAI3E,MAAI,CAAC,UAAW,QAAO;AACvB,SAAO,WAAW,SAAS;AAC7B;AAOO,SAAS,gBAAgB,cAAuB,eAAgC;AAGrF,SAAO,gBAAgB,gBAAgB,SAAS;AAClD;AAOO,SAAS,iBAAiB,aAA8B;AAG7D,SAAO,cAAc,YAAY;AACnC;AAOO,SAAS,kBAAkB,iBAA0B,kBAAmC;AAG7F,SAAO,mBAAmB,mBAAmB,SAAS;AACxD;AAOO,SAAS,iBAAiB,WAA2B;AAG1D,SAAO,YAAY,IAAI,SAAS;AAClC;AAOO,SAAS,kBAAkB,MAAc,OAAe,OAAwB;AAGrF,SACE,OAAO,QAAS,SAAS,QAAQ,QAAQ,KAAO,SAAS,QAAQ,UAAU,KAAK,SAAS;AAE7F;AAOO,SAAS,iBACd,QACA,MACA,OACA,OACQ;AAGR,SAAO,UAAU,kBAAkB,MAAM,OAAO,KAAK,IAAI,SAAS;AACpE;AAOO,SAAS,UAAU,GAAoB;AAG5C,SACE,MAAM,MACN,MAAM,OACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,KACN,MAAM,MACN,MAAM;AAEV;AAOO,SAAS,WAAW,GAAmB;AAI5C,MAAI,CAAC,UAAU,OAAO,GAAG,CAAC,CAAC,EAAG,QAAO;AACrC,SAAO,WAAW,EAAE,MAAM,CAAC,CAAC;AAC9B;AAWO,SAAS,eAAe,OAAe,QAA8B;AAK1E,MAAI,WAAW,GAAI,QAAO;AAC1B,SAAO,WAAW,KAAK,MAAM,SAAS,YAAY;AACpD;AAOO,SAAS,eAAe,QAAwB,GAAiB,GAAmB;AAOzF,MAAI,KAAK,OAAO,OAAQ,QAAO;AAC/B,UAAS,OAAO,CAAC,MAAuB,IAAI,IAAI,KAAK,eAAe,QAAQ,GAAG,IAAI,CAAC;AACtF;AAQO,SAAS,aAAa,QAAgC;AAM3D,MAAI,OAAO,WAAW,EAAG,QAAO;AAChC,MAAI,eAAe,QAAQ,UAAU,CAAC,IAAI,EAAG,QAAO;AACpD,SAAO,eAAe,QAAQ,WAAW,CAAC,IAAI,IAAI,SAAS;AAC7D;AAOO,SAAS,gBAAgB,SAAmB,GAAW,GAAmB;AAO/E,MAAI,KAAK,QAAQ,OAAQ,QAAO;AAChC,UAAS,QAAQ,CAAC,MAAiB,IAAI,IAAI,KAAK,gBAAgB,SAAS,GAAG,IAAI,CAAC;AACnF;AAOO,SAAS,YAAY,SAA2B;AAGrD,SACE,QAAQ,SAAS,gBAAgB,SAAS,QAAQ,CAAC,IAAI,gBAAgB,SAAS,WAAW,CAAC;AAEhG;AAOO,SAAS,WAAW,SAA2B;AAGpD,SAAO,gBAAgB,SAAS,QAAQ,CAAC,IAAI,IAAI,IAAI;AACvD;AAOO,SAAS,WAAW,GAAW,SAAyB;AAI7D,SAAO,aAAa,GAAG,QAAQ,CAAC,IAAI,IAAI,UAAU;AACpD;","names":[]}
|