@simpleapps-com/augur-config 2026.11.5 → 2026.11.6

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 CHANGED
@@ -61,7 +61,10 @@ proxy adoption, package versions) and exits 1 when any check fails. Each install
61
61
  `@simpleapps-com/augur-*` package is checked against its own latest published version.
62
62
  `query-gc-time` reads the provider and proxy files and every `.ts`/`.tsx` under `hooks/` and
63
63
  `app/` (or `src/…`): a finite `gcTime` fails on any version, a `...CACHE_CONFIG.` spread only
64
- while the site's augur-utils range allows a version before 2026.11.3 (#94). `next-floor`,
64
+ while the site's augur-utils range allows a version before 2026.11.3 (#94). A cache tier's
65
+ `gcTime` (inside `static: { … }` or `semiStatic: { … }`, augur-core `CacheConfig`) passes: the
66
+ proxies resolve it to `Infinity` on the server (atlas#203; proved `inTierObjectAt` over utils
67
+ `back-scan`). `next-floor`,
65
68
  `react-floor`, `react-dom-floor` and `augur-api-floor` fail a site whose range allows a `next`
66
69
  below 16.4.5, a `react` / `react-dom` below 19.3.1 or an augur-api below 2026.11.5, the platform
67
70
  minimums (#85, proved in `rules.ts`), reading the range's lowest
@@ -40,7 +40,7 @@ import {
40
40
  tsconfigStatus,
41
41
  utilsRangeBeforeFix,
42
42
  walksDir
43
- } from "./chunk-5QU6KOO3.js";
43
+ } from "./chunk-AAHHCSZC.js";
44
44
 
45
45
  // src/doctor/cli.ts
46
46
  import { existsSync as existsSync2 } from "fs";
@@ -579,7 +579,7 @@ function queryGcTime(site, pkg) {
579
579
  PASS: ["No finite gcTime in provider/query setup", ""],
580
580
  FAIL: [
581
581
  "Finite gcTime in provider/query setup (leaks memory during SSR)",
582
- `${files.join(", ")}: remove it, or wrap with resolveGcTime() from augur-utils; a ...CACHE_CONFIG spread needs @simpleapps-com/augur-utils >= 2026.11.3`
582
+ `${files.join(", ")}: remove it, or wrap with resolveGcTime() from augur-utils; a ...CACHE_CONFIG spread needs @simpleapps-com/augur-utils >= 2026.11.3 (a cache tier's gcTime, in static: { } or semiStatic: { }, is fine: the proxies resolve it)`
583
583
  ]
584
584
  });
585
585
  }
@@ -1 +1 @@
1
- {"version":3,"sources":["../src/doctor/cli.ts","../../utils/src/lists.ts","../src/doctor/checks.ts","../src/doctor/node-reader.ts","../src/doctor/report.ts","../src/augur-doctor.ts"],"sourcesContent":["/** augur-doctor's command line: `augur-doctor [site]` (the current directory by default). */\n\nimport { existsSync } from \"node:fs\";\nimport { basename, resolve } from \"node:path\";\nimport { runChecks, type SiteReader } from \"./checks\";\nimport { nodeReader } from \"./node-reader\";\nimport { reportLines } from \"./report\";\nimport { exitCodeOf } from \"./rules\";\n\n/** Where the CLI writes, and how it reads a site (the real file system by default). */\nexport interface CliIo {\n log: (line: string) => void;\n error: (line: string) => void;\n reader?: (siteDir: string) => SiteReader;\n}\n\nconst USAGE = [\n \"\",\n \"Usage: augur-doctor [/path/to/site]\",\n \"\",\n \"Run from a site directory, or pass the path as an argument.\",\n \"Examples:\",\n \" npx augur-doctor\",\n \" npx augur-doctor ./sites/example-site\",\n];\n\n/** Runs the doctor and returns its exit code: 1 for a missing site or any failing check. */\nexport function runDoctor(args: string[], io: CliIo): number {\n const siteDir = resolve(args[0] || \".\");\n if (!existsSync(siteDir)) {\n io.error(`Site directory not found: ${siteDir}`);\n return 1;\n }\n if (!existsSync(resolve(siteDir, \"package.json\"))) {\n io.error(`No package.json found in: ${siteDir}`);\n USAGE.forEach((line) => io.error(line));\n return 1;\n }\n const results = runChecks((io.reader ?? nodeReader)(siteDir));\n reportLines(basename(siteDir), siteDir, results).forEach((line) => io.log(line));\n return exitCodeOf(results.map((r) => r.status));\n}\n","//@ backend dafny\nimport { includesFrom } from \"./includes\";\nimport { compareFrom, endsWith } from \"./strings\";\n\n/* Pure list helpers, verified with LemmaScript → Dafny (model: models/Utils.dfy; link:\n models/links/utils-lists.dfy). */\n\n/**\n * The items from index `i` joined by `sep` (JS `xs.join(sep)` at i = 0).\n *\n * @ensures exactly the model's JoinFrom\n */\nexport function joinFrom(xs: string[], sep: string, i: number): string {\n //@ verify\n //@ type i nat\n //@ requires i >= 0\n //@ decreases xs.length - i\n //@ ensures i >= xs.length ==> \\result === \"\"\n //@ ensures i + 1 === xs.length ==> \\result === xs[i]\n //@ ensures i + 1 < xs.length ==> (\\result.length >= xs[i].length + sep.length && \\result.slice(0, xs[i].length + sep.length) === xs[i] + sep)\n if (i >= xs.length) return \"\";\n return joinRange(xs, sep, i, xs.length);\n}\n\n/**\n * The items joined by `sep`, or `fallback` when there are none (a validation issue's path in\n * augur-api: its segments joined by \".\", or \"root\"; lifted 2026-11-10).\n *\n * @ensures exactly the model's JoinOr\n */\nexport function joinOr(xs: string[], sep: string, fallback: string): string {\n //@ verify\n //@ ensures xs.length === 0 ==> \\result === fallback\n //@ ensures xs.length > 0 ==> \\result === joinFrom(xs, sep, 0)\n return xs.length === 0 ? fallback : joinFrom(xs, sep, 0);\n}\n\n/**\n * The items from `lo` up to `hi` (at least one) joined by `sep`, by halves: a list of n items\n * recurses log n deep, so a generated file of many thousand lines fits the stack.\n *\n * @ensures = the model's JoinFrom(xs[..hi], sep, lo) (links/utils-lists.dfy, by JoinFromSplits)\n */\nfunction joinRange(xs: string[], sep: string, lo: number, hi: number): string {\n //@ verify\n //@ type lo nat\n //@ type hi nat\n //@ requires lo < hi && hi <= xs.length\n //@ decreases hi - lo\n //@ ensures hi === lo + 1 ==> \\result === xs[lo]\n if (hi - lo === 1) return xs[lo] as string;\n const mid = lo + Math.floor((hi - lo) / 2);\n return joinRange(xs, sep, lo, mid) + sep + joinRange(xs, sep, mid, hi);\n}\n\n/**\n * The first index ≥ `i` holding `x`, or -1 (JS `xs.indexOf(x, i)`): how a table of parallel\n * lists is read.\n *\n * @ensures result = -1 ∨ (i ≤ result < |xs| ∧ xs[result] = x) — and the first such index: the\n * model's ItemIndexFrom (links/utils-lists.dfy)\n */\nexport function itemIndexFrom(xs: string[], x: string, i: number): number {\n //@ verify\n //@ type i nat\n //@ requires i >= 0\n //@ decreases xs.length - i\n //@ ensures \\result === -1 || (i <= \\result && \\result < xs.length && xs[\\result] === x)\n //@ ensures \\result === -1 ==> forall(k: nat, (i <= k && k < xs.length) ==> xs[k] !== x)\n //@ ensures \\result >= 0 ==> forall(k: nat, (i <= k && k < \\result) ==> xs[k] !== x)\n if (i >= xs.length) return -1;\n return (xs[i] as string) === x ? i : itemIndexFrom(xs, x, i + 1);\n}\n\n/**\n * The sum of `xs[i..]`, 0 past the end (JS `xs.slice(i).reduce((a, b) => a + b, 0)`).\n *\n * @ensures result = Σ xs[i..] — exactly the model's SumFrom\n */\nexport function sumFrom(xs: number[], i: number): number {\n //@ verify\n //@ type i nat\n //@ requires i >= 0\n //@ decreases xs.length - i\n //@ ensures \\result === (i >= xs.length ? 0 : xs[i] + sumFrom(xs, i + 1))\n if (i >= xs.length) return 0;\n return (xs[i] as number) + sumFrom(xs, i + 1);\n}\n\n/**\n * Whether `x` is one of `xs` from index `i` on (JS `xs.includes(x)` at i = 0).\n *\n * @ensures result ⟺ ∃ k. i ≤ k < |xs| ∧ xs[k] = x — exactly the model's HasItemFrom\n */\nexport function hasItemFrom(xs: string[], x: string, i: number): boolean {\n //@ verify\n //@ type i nat\n //@ requires i >= 0 && i <= xs.length\n //@ decreases xs.length - i\n //@ ensures \\result <==> exists(k: nat, i <= k && k < xs.length && xs[k] === x)\n // `===`, not `>=`: past the end xs[i] is undefined, never x, so `>=` vs `>` is equivalent\n if (i === xs.length) return false;\n if ((xs[i] as string) === x) return true;\n return hasItemFrom(xs, x, i + 1);\n}\n\n/**\n * Whether the number `x` is one of `xs` from index `i` on (JS `xs.includes(x)` at i = 0, for\n * numbers).\n *\n * @ensures result ⟺ ∃ k. i ≤ k < |xs| ∧ xs[k] = x — exactly the model's HasNumberFrom\n */\nexport function hasNumberFrom(xs: number[], x: number, i: number): boolean {\n //@ verify\n //@ type i nat\n //@ requires i >= 0 && i <= xs.length\n //@ decreases xs.length - i\n //@ ensures \\result <==> exists(k: nat, i <= k && k < xs.length && xs[k] === x)\n if (i === xs.length) return false;\n if ((xs[i] as number) === x) return true;\n return hasNumberFrom(xs, x, i + 1);\n}\n\n/**\n * Whether `s` ends with one of `xs` from index `i` on (a regex `(a|b|…)$` at i = 0).\n *\n * @ensures exactly the model's EndsWithAnyFrom\n */\nexport function endsWithAnyFrom(s: string, xs: string[], i: number): boolean {\n //@ verify\n //@ type i nat\n //@ requires i >= 0 && i <= xs.length\n //@ decreases xs.length - i\n //@ ensures \\result <==> exists(k: nat, i <= k && k < xs.length && endsWith(s, xs[k]))\n if (i === xs.length) return false;\n if (endsWith(s, xs[i] as string)) return true;\n return endsWithAnyFrom(s, xs, i + 1);\n}\n\n/**\n * Whether one of `xs` from index `i` on occurs in `s` (a regex `(a|b|…)` at i = 0).\n *\n * @ensures exactly the model's IncludesAnyFrom\n */\nexport function includesAnyFrom(s: string, xs: string[], i: number): boolean {\n //@ verify\n //@ type i nat\n //@ requires i >= 0 && i <= xs.length\n //@ decreases xs.length - i\n //@ ensures \\result <==> exists(k: nat, i <= k && k < xs.length && includesFrom(s, xs[k], 0))\n if (i === xs.length) return false;\n if (includesFrom(s, xs[i] as string, 0)) return true;\n return includesAnyFrom(s, xs, i + 1);\n}\n\n/**\n * The items of `xs` from index `i` that `allowed` doesn't hold, in order (JS\n * `xs.filter((x) => !allowed.includes(x))` at i = 0).\n *\n * @ensures exactly the model's NotInFrom (NotInFromIsTheUnknown: the unknown ones, all of them)\n */\nexport function notInFrom(xs: string[], allowed: string[], i: number): string[] {\n //@ verify\n //@ type i nat\n //@ requires i >= 0\n //@ decreases xs.length - i\n //@ ensures i >= xs.length ==> \\result.length === 0\n if (i >= xs.length) return [];\n const rest = notInFrom(xs, allowed, i + 1);\n return hasItemFrom(allowed, xs[i] as string, 0) ? rest : [xs[i] as string, ...rest];\n}\n\n/**\n * Whether `x` is one of the first `k` items of `xs` (JS `xs.slice(0, k).includes(x)`).\n *\n * @ensures result ⟺ ∃ j < k. xs[j] = x — exactly the model's HasItemBelow\n */\nexport function hasItemBelow(xs: string[], x: string, k: number): boolean {\n //@ verify\n //@ type k nat\n //@ requires k >= 0 && k <= xs.length\n //@ decreases k\n //@ ensures \\result <==> exists(j: nat, j < k && xs[j] === x)\n if (k === 0) return false;\n if ((xs[k - 1] as string) === x) return true;\n return hasItemBelow(xs, x, k - 1);\n}\n\n/**\n * The items of `xs` from index `i` that repeat an earlier item, in order (at i = 0, every\n * duplicate after its first; none ⟺ the items are unique).\n *\n * @ensures exactly the model's RepeatsFrom (RepeatsFromEmpty: none exactly when unique)\n */\nexport function repeatsFrom(xs: string[], i: number): string[] {\n //@ verify\n //@ type i nat\n //@ requires i >= 0\n //@ decreases xs.length - i\n //@ ensures i >= xs.length ==> \\result.length === 0\n if (i >= xs.length) return [];\n const rest = repeatsFrom(xs, i + 1);\n return hasItemBelow(xs, xs[i] as string, i) ? [xs[i] as string, ...rest] : rest;\n}\n\n/**\n * The items of `xs` from index `i` that no earlier item repeats, in order (at i = 0, JS\n * `[...new Set(xs)]`: each item once, first occurrence kept).\n *\n * @ensures exactly the model's FirstsFrom\n */\nexport function firstsFrom(xs: string[], i: number): string[] {\n //@ verify\n //@ type i nat\n //@ requires i >= 0\n //@ decreases xs.length - i\n //@ ensures i >= xs.length ==> \\result.length === 0\n //@ ensures forall(j: nat, forall(k: nat, (j < k && k < \\result.length) ==> \\result[j] !== \\result[k]))\n if (i >= xs.length) return [];\n const rest = firstsFrom(xs, i + 1);\n return hasItemBelow(xs, xs[i] as string, i) ? rest : [xs[i] as string, ...rest];\n}\n\n/**\n * At most the first `n` items (JS `xs.slice(0, n)` for n ≥ 0).\n *\n * @ensures exactly the model's TakeAtMost\n */\nexport function takeAtMost(xs: string[], n: number): string[] {\n //@ verify\n //@ type n nat\n //@ requires n >= 0\n //@ ensures \\result === (n < xs.length ? xs.slice(0, n) : xs)\n return n < xs.length ? xs.slice(0, n) : xs;\n}\n\n/**\n * Whether two number lists are equal from index `i` on (the whole lists at i = 0).\n *\n * @ensures result ⟺ |a| = |b| ∧ ∀ k ∈ [i, |a|). a[k] = b[k] — exactly the model's\n * SameNumbersFrom\n */\nexport function sameNumbersFrom(a: number[], b: number[], i: number): boolean {\n //@ verify\n //@ type i nat\n //@ requires i >= 0 && i <= a.length\n //@ decreases a.length - i\n //@ ensures \\result <==> (a.length === b.length && forall(k: nat, i <= k && k < a.length ==> a[k] === b[k]))\n if (a.length !== b.length) return false;\n if (i === a.length) return true;\n return (a[i] as number) === (b[i] as number) && sameNumbersFrom(a, b, i + 1);\n}\n\n/**\n * Whether two text lists are equal from index `i` on (the whole lists at i = 0, as their\n * `JSON.stringify` texts compare).\n *\n * @ensures result ⟺ |a| = |b| ∧ ∀ k ∈ [i, |a|). a[k] = b[k] — exactly the model's\n * SameTextsFrom\n */\nexport function sameTextsFrom(a: string[], b: string[], i: number): boolean {\n //@ verify\n //@ type i nat\n //@ requires i >= 0 && i <= a.length\n //@ decreases a.length - i\n //@ ensures \\result <==> (a.length === b.length && forall(k: nat, i <= k && k < a.length ==> a[k] === b[k]))\n if (a.length !== b.length) return false;\n if (i === a.length) return true;\n return (a[i] as string) === (b[i] as string) && sameTextsFrom(a, b, i + 1);\n}\n\n/**\n * The texts in code-unit order (JS's default `sort`, stable: of two equal texts the earlier\n * stays first).\n *\n * @ensures exactly the model's SortedTexts (in the link); the same length\n */\nexport function sortedTexts(xs: string[]): string[] {\n //@ verify\n //@ ensures \\result.length === xs.length\n if (xs.length === 0) return [];\n return insertText(xs[0] as string, sortedTexts(xs.slice(1)));\n}\n\n/**\n * `x` placed into sorted texts before the first it doesn't sort after.\n *\n * @ensures exactly the model's InsertText (in the link); one longer\n */\nexport function insertText(x: string, sorted: string[]): string[] {\n //@ verify\n //@ ensures \\result.length === sorted.length + 1\n if (sorted.length === 0) return [x];\n const first = sorted[0] as string;\n if (compareFrom(x, first, 0) <= 0) return [x, ...sorted];\n return [first, ...insertText(x, sorted.slice(1))];\n}\n","/**\n * augur-doctor's checks: each reads facts from the site through a {@link SiteReader} and takes\n * its outcome from the proved rules (rules.ts). Labels and details are the original\n * bin/augur-doctor.mjs text, except the version checks (no lockstep, owner 2026-11-05).\n */\n\nimport { firstsFrom } from \"@atlas/utils/lists\";\nimport {\n actionsStatus,\n apiVersionStatus,\n augurApiFloorStatus,\n authStatus,\n contractTestsStatus,\n conventionPath,\n deprecatedStatus,\n fileUses,\n gcTimeOffenderIn,\n headersStatus,\n iconsStatus,\n imageLoaderStatus,\n ioredisStatus,\n knipStatus,\n latestStatus,\n localHooksStatus,\n middlewareStatus,\n nextExternalStatus,\n nextFloorStatus,\n noOffenderStatus,\n noWrapperStatus,\n optimizeStatus,\n packageStateOf,\n preCommitStatus,\n presetStatus,\n proxyFailDetail,\n proxyWarnDetail,\n qualityStatus,\n reactFloorStatus,\n serverQueryStatus,\n siteHooksStatus,\n strictStatus,\n tailwindStatus,\n tsconfigStatus,\n utilsRangeBeforeFix,\n type NextFacts,\n type PackageState,\n type Status,\n} from \"./rules\";\n\n/** What the checks may ask of a site. Paths are relative to the site directory. */\nexport interface SiteReader {\n /** Whether the path exists. */\n exists(relPath: string): boolean;\n /** The file's text, or null when it is missing. */\n read(relPath: string): string | null;\n /** The first of these names found walking up from the site to its git root: its path and text. */\n readUpward(names: string[]): { path: string; content: string } | null;\n /** The package's latest published version, or \"\" when npm cannot say. */\n latestVersion(packageName: string): string;\n /** The `.ts`/`.tsx` files under these folders, recursively, `node_modules` skipped ([] for a missing one). */\n sourceFiles(dirs: string[]): string[];\n}\n\n/** One line of the scorecard. */\nexport interface CheckResult {\n status: Status;\n id: string;\n label: string;\n detail: string;\n}\n\ntype Deps = Record<string, string | undefined>;\n\n/** The parts of a site's package.json the checks read. */\ninterface PackageJson {\n dependencies?: Deps;\n devDependencies?: Deps;\n scripts?: Record<string, string | undefined>;\n prettier?: unknown;\n \"lint-staged\"?: unknown;\n}\n\n/** Files where proxy pattern wiring commonly lives across different site layouts. */\nconst PROXY_FILES = [\n \"lib/augur-query.ts\",\n \"src/lib/augur-query.ts\",\n \"lib/augur.ts\",\n \"src/lib/augur.ts\",\n \"lib/augur-options.ts\",\n \"src/lib/augur-options.ts\",\n \"app/providers.tsx\",\n \"src/app/providers.tsx\",\n \"app/context/ReactQueryProvider.tsx\",\n \"src/app/context/ReactQueryProvider.tsx\",\n];\n\nconst PROXY_PATTERN = /createServerQueryProxy|queryAction|createAugurOptions|registerQueryAction/;\nconst MODULE_SCOPE_CLIENT = /^(?:export\\s+)?(?:const|let|var)\\s+\\w+\\s*=\\s*new QueryClient\\(/m;\n// query-gc-time's scans (a finite gcTime, a CACHE_CONFIG spread, the range's version) are the\n// proved rules.ts `gcTimeOffenderIn` and `utilsRangeBeforeFix` (#94).\n/** Where query options are written besides the proxy files (#94). */\nconst QUERY_SOURCE_DIRS = [\"hooks\", \"app\", \"src/hooks\", \"src/app\"];\n\n/** The augur packages a site may install; each is checked against its own latest. */\nexport const AUGUR_PACKAGES = [\n \"@simpleapps-com/augur-config\",\n \"@simpleapps-com/augur-core\",\n \"@simpleapps-com/augur-hooks\",\n \"@simpleapps-com/augur-mobile\",\n \"@simpleapps-com/augur-server\",\n \"@simpleapps-com/augur-tailwind\",\n \"@simpleapps-com/augur-utils\",\n \"@simpleapps-com/augur-web\",\n];\n\n/** The migration runbook on augur.build, which the scorecard and the checks' details link to. */\nexport const RUNBOOK = \"https://augur.build/docs/packages/migration-runbook\";\nconst GETTING_STARTED = \"https://augur.build/docs/packages/getting-started\";\n\n/**\n * A check's result for a status, with a label (and detail) per status. Each check lists every\n * status its rule can return (rules.ts and its ensures), so the lookup always finds one.\n */\nfunction result(\n id: string,\n status: Status,\n labels: Partial<Record<Status, [string, string]>>,\n): CheckResult {\n const [label, detail] = labels[status]!;\n return { status, id, label, detail };\n}\n\n/** The reads every check shares. */\nclass Site {\n constructor(private readonly reader: SiteReader) {}\n\n find(...candidates: string[]): string | null {\n return candidates.find((c) => this.reader.exists(c)) ?? null;\n }\n\n read(relPath: string): string | null {\n return this.reader.read(relPath);\n }\n\n contains(relPath: string | null, pattern: string | RegExp): boolean {\n const content = relPath === null ? null : this.reader.read(relPath);\n if (!content) return false;\n return typeof pattern === \"string\" ? content.includes(pattern) : pattern.test(content);\n }\n\n json<T>(relPath: string): T | null {\n const content = this.reader.read(relPath);\n if (!content) return null;\n try {\n return JSON.parse(content) as T;\n } catch {\n return null;\n }\n }\n\n /** The proxy files that exist and match the pattern. */\n proxyFilesMatching(pattern: RegExp): string[] {\n return PROXY_FILES.filter((f) => this.contains(f, pattern));\n }\n\n /** The proxy files, then the query source folders' files, each once, in that order. */\n queryFiles(): { path: string; text: string }[] {\n const paths = firstsFrom([...PROXY_FILES, ...this.reader.sourceFiles(QUERY_SOURCE_DIRS)], 0);\n return paths.flatMap((path) => {\n const text = this.reader.read(path);\n return text === null ? [] : [{ path, text }];\n });\n }\n}\n\nfunction siteConfig(site: Site): CheckResult {\n const file = site.find(\n \"lib/augur-config.ts\",\n \"src/lib/augur-config.ts\",\n \"config/augur-config.ts\",\n );\n return result(\"site-config\", fileUses(file !== null, site.contains(file, \"defineSite\")), {\n PASS: [\"augur-config.ts with defineSite()\", file ?? \"\"],\n WARN: [\"augur-config.ts exists but does not use defineSite()\", file ?? \"\"],\n FAIL: [\"augur-config.ts with defineSite()\", \"Expected lib/augur-config.ts\"],\n });\n}\n\nfunction serverSite(site: Site): CheckResult {\n const file = site.find(\"lib/augur-site.ts\", \"src/lib/augur-site.ts\", \"config/augur-site.ts\");\n return result(\"server-site\", fileUses(file !== null, site.contains(file, \"createServerSite\")), {\n PASS: [\"augur-site.ts using createServerSite()\", file ?? \"\"],\n WARN: [\"augur-site.ts exists but does not use createServerSite()\", file ?? \"\"],\n FAIL: [\"augur-site.ts using createServerSite()\", \"Expected lib/augur-site.ts\"],\n });\n}\n\nfunction actions(site: Site): CheckResult {\n const file = site.find(\"lib/augur-actions.ts\", \"src/lib/augur-actions.ts\", \"lib/actions.ts\");\n const reExports = site.contains(file, /site\\.actions|actions\\./);\n const usesProxy = site.proxyFilesMatching(PROXY_PATTERN).length > 0;\n const status = actionsStatus(file !== null, reExports, usesProxy);\n return result(\"actions\", status, {\n PASS: file\n ? [\"augur-actions.ts re-exporting site.actions\", file]\n : [\"Using proxy pattern (augur-actions.ts not needed)\", \"\"],\n WARN: [\"augur-actions.ts exists but may not re-export site.actions\", file ?? \"\"],\n FAIL: [\n \"augur-actions.ts re-exporting site.actions.*\",\n \"Expected lib/augur-actions.ts or createServerQueryProxy usage\",\n ],\n });\n}\n\nfunction siteHooks(site: Site): CheckResult {\n const file = site.find(\n \"lib/augur.ts\",\n \"src/lib/augur.ts\",\n \"lib/augur-hooks.ts\",\n \"src/lib/augur-hooks.ts\",\n );\n const createSiteHooks = site.contains(file, \"createSiteHooks\");\n const status = siteHooksStatus(\n file !== null,\n createSiteHooks,\n site.contains(file, /AugurHooksProvider|augur-hooks/),\n );\n return result(\"site-hooks\", status, {\n PASS: [\n createSiteHooks ? \"augur.ts with createSiteHooks()\" : \"augur.ts with hooks setup\",\n file ?? \"\",\n ],\n WARN: [\"augur.ts exists but does not use createSiteHooks()\", file ?? \"\"],\n FAIL: [\"augur.ts with createSiteHooks()\", \"Expected lib/augur.ts\"],\n });\n}\n\nfunction ssrOptions(site: Site): CheckResult {\n const file = site.find(\"lib/augur-options.ts\", \"src/lib/augur-options.ts\");\n return result(\"ssr-options\", fileUses(file !== null, site.contains(file, /Options/)), {\n PASS: [\"augur-options.ts for SSR prefetching\", file ?? \"\"],\n WARN: [\"augur-options.ts exists but may not export options\", file ?? \"\"],\n FAIL: [\"augur-options.ts for SSR prefetching\", \"Expected lib/augur-options.ts\"],\n });\n}\n\nfunction tsconfig(site: Site): CheckResult {\n const config = site.json<{ extends?: string }>(\"tsconfig.json\");\n const extendsVal = config?.extends || \"\";\n const status = tsconfigStatus(\n config !== null,\n extendsVal.includes(\"augur-config/tsconfig/next\"),\n extendsVal.includes(\"augur-config\"),\n );\n return result(\"tsconfig\", status, {\n PASS: [\"tsconfig.json extends augur-config/tsconfig/next\", \"\"],\n WARN: [\"tsconfig.json extends augur-config but not /tsconfig/next\", `extends: ${extendsVal}`],\n FAIL: config\n ? [\n \"tsconfig.json extends augur-config/tsconfig/next\",\n extendsVal ? `extends: ${extendsVal}` : \"No extends field\",\n ]\n : [\"tsconfig.json exists\", \"File not found\"],\n });\n}\n\nfunction eslintFailDetail(site: Site, file: string | null): [string, string] {\n if (file) {\n return [\n \"eslint.config.mjs uses augur-config/eslint/next\",\n \"Config exists but does not import augur-config/eslint\",\n ];\n }\n if (site.find(\".eslintrc.json\", \".eslintrc.js\", \".eslintrc\", \".eslintrc.cjs\")) {\n return [\n \"eslint.config.mjs uses augur-config/eslint/next\",\n \"Site uses legacy .eslintrc format -- migrate to eslint.config.mjs\",\n ];\n }\n return [\"eslint.config.mjs exists\", \"No ESLint config found\"];\n}\n\nfunction eslint(site: Site, file: string | null): CheckResult {\n return result(\"eslint\", presetStatus(file !== null, site.contains(file, \"augur-config/eslint\")), {\n PASS: [\"eslint.config.mjs uses augur-config/eslint/next\", file ?? \"\"],\n FAIL: eslintFailDetail(site, file),\n });\n}\n\nfunction eslintDeprecated(site: Site, file: string | null): CheckResult {\n const status = deprecatedStatus(\n file !== null,\n site.contains(file, /no-deprecated[\"']?\\s*:\\s*[\"'](error|warn)[\"']/),\n site.contains(file, \"no-deprecated\"),\n );\n return result(\"eslint-deprecated\", status, {\n SKIP: [\"ESLint: no-deprecated rule\", \"No ESLint config found\"],\n PASS: [\"ESLint: no-deprecated rule enabled\", \"\"],\n WARN: [\n \"ESLint: no-deprecated found but may not be warn/error\",\n \"Set @typescript-eslint/no-deprecated to warn or error\",\n ],\n FAIL: [\n \"ESLint: @typescript-eslint/no-deprecated rule\",\n 'Add \"@typescript-eslint/no-deprecated\": \"warn\" to eslint.config.mjs rules',\n ],\n });\n}\n\nfunction prettierFailDetail(\n site: Site,\n file: string | null,\n pkg: PackageJson | null,\n): [string, string] {\n const label = \"Prettier uses augur-config/prettier preset\";\n if (file) return [label, \"Config exists but does not import augur-config/prettier\"];\n if (pkg?.prettier) {\n return [label, \"Prettier config is inline in package.json -- move to prettier.config.mjs\"];\n }\n if (site.find(\".prettierrc\", \".prettierrc.json\", \".prettierrc.yaml\")) {\n return [\n label,\n \"Site uses static prettier config -- migrate to prettier.config.mjs with augur-config/prettier\",\n ];\n }\n return [\"Prettier config exists\", \"No Prettier config found\"];\n}\n\nfunction prettier(site: Site, pkg: PackageJson | null): CheckResult {\n const file = site.find(\n \"prettier.config.mjs\",\n \"prettier.config.js\",\n \".prettierrc.mjs\",\n \".prettierrc.js\",\n );\n return result(\n \"prettier\",\n presetStatus(file !== null, site.contains(file, \"augur-config/prettier\")),\n {\n PASS: [\"Prettier uses augur-config/prettier preset\", file ?? \"\"],\n FAIL: prettierFailDetail(site, file, pkg),\n },\n );\n}\n\nfunction knip(site: Site, pkg: PackageJson | null): CheckResult {\n const config = site.find(\n \"knip.json\",\n \"knip.jsonc\",\n \"knip.ts\",\n \"knip.config.ts\",\n \"knip.config.js\",\n );\n return result(\"knip\", knipStatus(config !== null, hasDep(pkg, \"knip\")), {\n PASS: [\"Knip configured for dead code detection\", config ?? \"\"],\n WARN: [\n \"Knip installed but no config file found\",\n \"Add knip.json or knip.ts -- see https://knip.dev/overview/configuration\",\n ],\n FAIL: config\n ? [\n \"Knip for dead code detection\",\n \"Config exists but knip not in devDependencies -- run pnpm add -D knip\",\n ]\n : [\n \"Knip for dead code detection\",\n \"Add knip to devDependencies and create knip.json -- see https://knip.dev\",\n ],\n });\n}\n\n/** Whether package.json lists the package in its dependencies or devDependencies. */\nfunction hasDep(pkg: PackageJson | null, name: string): boolean {\n return !!(pkg?.dependencies?.[name] || pkg?.devDependencies?.[name]);\n}\n\n/** The text holds every one of the strings. */\nfunction includesAll(text: string, parts: string[]): boolean {\n return parts.every((part) => text.includes(part));\n}\n\n/** What next.config (and package.json's ioredis) tell the Next.js checks. */\nfunction nextFacts(site: Site, pkg: PackageJson | null): NextFacts {\n const file = site.find(\"next.config.ts\", \"next.config.mjs\", \"next.config.js\");\n const text = (file === null ? null : site.read(file)) ?? \"\";\n return {\n hasConfig: file !== null,\n hasExternal: text.includes(\"serverExternalPackages\"),\n externalHasServer: text.includes(\"augur-server\"),\n usesIoredis: hasDep(pkg, \"ioredis\"),\n externalHasIoredis: text.includes(\"ioredis\"),\n hasAllHeaders: includesAll(text, [\n \"Strict-Transport-Security\",\n \"X-Content-Type-Options\",\n \"Permissions-Policy\",\n ]),\n hasHeaders: text.includes(\"headers\"),\n hasOptimize: text.includes(\"optimizePackageImports\"),\n hasStrict: text.includes(\"reactStrictMode\"),\n hasAgrMedia: /agr\\.media|agrMedia/.test(text),\n hasImages: text.includes(\"images\"),\n };\n}\n\nfunction nextExternal(n: NextFacts): CheckResult {\n return result(\"next-external\", nextExternalStatus(n), {\n PASS: [\"next.config: serverExternalPackages correct\", \"\"],\n WARN: [\n \"next.config: no serverExternalPackages found\",\n \"Add serverExternalPackages for native Node modules\",\n ],\n FAIL: n.hasConfig\n ? [\n \"next.config: augur-server NOT in serverExternalPackages\",\n \"augur-server must be bundled, not externalized\",\n ]\n : [\"next.config exists\", \"No next.config found\"],\n });\n}\n\nfunction ioredisSkipDetail(n: NextFacts): string {\n if (!n.hasConfig) return \"No next.config\";\n if (!n.hasExternal) return \"No serverExternalPackages\";\n return \"Site does not use ioredis\";\n}\n\nfunction nextIoredis(n: NextFacts): CheckResult {\n return result(\"next-ioredis\", ioredisStatus(n), {\n SKIP: [\"next.config: ioredis check\", ioredisSkipDetail(n)],\n PASS: [\"next.config: ioredis in serverExternalPackages\", \"\"],\n WARN: [\n \"next.config: ioredis should be in serverExternalPackages\",\n \"Site uses ioredis but it is not externalized\",\n ],\n });\n}\n\nfunction nextHeaders(n: NextFacts): CheckResult {\n return result(\"next-headers\", headersStatus(n), {\n PASS: [\"next.config: security headers\", \"\"],\n WARN: [\n \"next.config: security headers incomplete\",\n \"Missing HSTS, X-Content-Type-Options, or Permissions-Policy\",\n ],\n FAIL: [\n \"next.config: security headers\",\n n.hasConfig ? \"No headers() function found\" : \"No next.config\",\n ],\n });\n}\n\nfunction nextOptimize(n: NextFacts): CheckResult {\n return result(\"next-optimize\", optimizeStatus(n), {\n PASS: [\"next.config: optimizePackageImports\", \"\"],\n FAIL: [\n \"next.config: optimizePackageImports\",\n n.hasConfig ? \"Add experimental.optimizePackageImports for augur packages\" : \"No next.config\",\n ],\n });\n}\n\nfunction nextStrict(n: NextFacts): CheckResult {\n return result(\"next-strict\", strictStatus(n), {\n SKIP: [\"next.config: reactStrictMode\", \"No next.config\"],\n PASS: [\"next.config: reactStrictMode\", \"\"],\n WARN: [\"next.config: reactStrictMode not set\", \"Recommended for development error detection\"],\n });\n}\n\nconst PROXY_FIX = `${RUNBOOK}#proxy-file`;\n\n/** next-proxy (atlas#88): Next.js 16 renamed `middleware` to `proxy`; both files break the build. */\nfunction nextProxy(site: Site): CheckResult {\n const middleware = site.find(\n conventionPath(\"middleware\", false, false),\n conventionPath(\"middleware\", false, true),\n conventionPath(\"middleware\", true, false),\n conventionPath(\"middleware\", true, true),\n );\n const proxy = site.find(\n conventionPath(\"proxy\", false, false),\n conventionPath(\"proxy\", false, true),\n conventionPath(\"proxy\", true, false),\n conventionPath(\"proxy\", true, true),\n );\n return result(\"next-proxy\", middlewareStatus(middleware !== null, proxy !== null), {\n PASS: [\"proxy file convention\", proxy ?? \"\"],\n WARN: [\n \"middleware is deprecated in Next.js 16: rename it to proxy\",\n proxyWarnDetail(middleware ?? \"\", PROXY_FIX),\n ],\n FAIL: [\n \"Both middleware and proxy files: Next.js 16 will not build\",\n proxyFailDetail(middleware ?? \"\", proxy ?? \"\", PROXY_FIX),\n ],\n SKIP: [\"Middleware/proxy file convention\", \"No middleware or proxy file\"],\n });\n}\n\nfunction imageLoader(n: NextFacts): CheckResult {\n return result(\"image-loader\", imageLoaderStatus(n), {\n SKIP: [\"Image loader check\", \"No next.config\"],\n PASS: [\"Image loader for agr.media CDN\", \"\"],\n WARN: n.hasImages\n ? [\n \"next.config has images config but no agr.media\",\n \"Add agr.media to remotePatterns if site has product images\",\n ]\n : [\"No image configuration found\", \"Add agr.media CDN to next.config images.remotePatterns\"],\n });\n}\n\nfunction contractTests(site: Site): CheckResult {\n const present =\n site.find(\n \"__tests__/sdk-contracts\",\n \"src/__tests__/sdk-contracts\",\n \"__tests__/sdk-contract.test.ts\",\n \"src/__tests__/sdk-contract.test.ts\",\n ) !== null;\n return result(\"contract-tests\", contractTestsStatus(present), {\n PASS: [\"SDK contract tests present\", \"\"],\n FAIL: [\"SDK contract tests in __tests__/sdk-contracts/\", \"No contract tests found\"],\n });\n}\n\nfunction noWrapper(site: Site): CheckResult {\n const file = site.find(\n \"lib/augur-client.ts\",\n \"src/lib/augur-client.ts\",\n \"lib/augurClient.ts\",\n \"src/lib/augurClient.ts\",\n );\n const wraps = site.contains(file, \"class AugurClient\") || site.contains(file, \"extends AugurAPI\");\n const hasLib = site.find(\"lib\", \"src/lib\") !== null;\n return result(\"no-wrapper\", noWrapperStatus(hasLib, wraps), {\n SKIP: [\"No custom AugurClient wrapper\", \"No lib/ directory\"],\n PASS: [\"No custom AugurClient wrapper\", file ? \"Uses augur-api directly\" : \"\"],\n FAIL: [\"No custom AugurClient wrapper\", `${file} wraps AugurAPI -- use augur-api directly`],\n });\n}\n\nfunction auth(site: Site): CheckResult {\n const file = site.find(\"auth.ts\", \"lib/auth.ts\", \"src/lib/auth.ts\", \"src/auth.ts\");\n const usesFactory =\n site.contains(file, \"site.auth\") ||\n site.contains(file, \"createAuthConfig\") ||\n site.contains(file, \"createServerSite\");\n const status = authStatus(file !== null, usesFactory, site.contains(file, \"NextAuth\"));\n return result(\"auth\", status, {\n PASS: [\"Auth uses createAuthConfig or site.auth\", file ?? \"\"],\n FAIL: [\n \"Auth uses createAuthConfig or site.auth\",\n `${file} uses raw NextAuth -- migrate to createAuthConfig()`,\n ],\n WARN: file\n ? [\"Auth pattern unclear\", file]\n : [\"No auth.ts found\", \"Expected auth.ts or lib/auth.ts\"],\n });\n}\n\nfunction qualityScript(pkg: PackageJson | null): CheckResult {\n const quality = pkg?.scripts?.[\"quality\"];\n const complete =\n !!quality &&\n quality.includes(\"typecheck\") &&\n quality.includes(\"lint\") &&\n quality.includes(\"test\");\n return result(\"quality-script\", qualityStatus(!!quality, complete), {\n PASS: [\"quality script: typecheck + lint + test\", \"\"],\n WARN: [\"quality script exists but may be incomplete\", `\"quality\": \"${quality}\"`],\n FAIL: [\n \"quality script in package.json\",\n 'Add \"quality\": \"pnpm typecheck && pnpm lint && pnpm test\"',\n ],\n });\n}\n\nfunction allDeps(pkg: PackageJson): Deps {\n return { ...pkg.dependencies, ...pkg.devDependencies };\n}\n\nfunction icons(pkg: PackageJson): CheckResult {\n const deps = allDeps(pkg);\n const heroicons = !!deps[\"@heroicons/react\"];\n const status = iconsStatus(!!deps[\"react-icons\"], heroicons, !!deps[\"lucide-react\"]);\n return result(\"icons\", status, {\n PASS: [\"Uses react-icons (platform standard)\", \"\"],\n FAIL: [\n \"Uses react-icons (platform standard)\",\n heroicons\n ? \"Site uses @heroicons/react -- migrate to react-icons/lu\"\n : \"Site uses lucide-react -- migrate to react-icons/lu\",\n ],\n WARN: [\"No icon library found\", \"Expected react-icons\"],\n });\n}\n\nfunction tailwind(pkg: PackageJson): CheckResult {\n const range = allDeps(pkg)[\"tailwindcss\"] || \"\";\n return result(\"tailwind\", tailwindStatus(range), {\n PASS: [\"Tailwind v4 (platform standard)\", \"\"],\n FAIL: [\"Tailwind v4\", `Found tailwindcss: ${range} -- upgrade to ^4.0.0`],\n WARN: range\n ? [\"Tailwind version unclear\", `tailwindcss: ${range}`]\n : [\"No tailwindcss dependency found\", \"\"],\n });\n}\n\nfunction preCommitSuggestion(\n site: Site,\n lefthookFile: string | null,\n hasPreCommit: boolean,\n hasLefthook: boolean,\n): [string, string] {\n const see = `See ${RUNBOOK}#pre-commit-hooks`;\n if (hasPreCommit) return [\"Pre-commit hooks: lefthook found but no lint-staged config\", see];\n if (lefthookFile) return [\"Pre-commit hooks: lefthook found but no pre-commit section\", see];\n if (hasLefthook) {\n return [\n \"Pre-commit hooks: lefthook in devDependencies but no config file\",\n `Add lefthook.yml -- see ${RUNBOOK}#pre-commit-hooks`,\n ];\n }\n if (site.find(\".husky/pre-commit\", \".husky/_/pre-commit\")) {\n return [\"Pre-commit hooks: husky found -- consider switching to lefthook\", see];\n }\n return [\"No pre-commit hooks found -- recommended for code quality\", see];\n}\n\n/** The site's own lefthook config, else one in a parent folder (monorepo layouts). */\nfunction lefthookConfig(\n site: Site,\n reader: SiteReader,\n): { file: string | null; hasPreCommit: boolean } {\n const local = site.find(\"lefthook.yml\", \".lefthook.yml\");\n if (local) return { file: local, hasPreCommit: site.contains(local, \"pre-commit\") };\n const upward = reader.readUpward([\"lefthook.yml\", \".lefthook.yml\"]);\n if (upward === null) return { file: null, hasPreCommit: false };\n return { file: upward.path, hasPreCommit: upward.content.includes(\"pre-commit\") };\n}\n\nfunction hasLintStaged(site: Site, pkg: PackageJson | null): boolean {\n const files = [\n \".lintstagedrc\",\n \".lintstagedrc.json\",\n \"lint-staged.config.js\",\n \"lint-staged.config.mjs\",\n ];\n return !!pkg?.[\"lint-staged\"] || site.find(...files) !== null;\n}\n\nfunction preCommit(site: Site, reader: SiteReader, pkg: PackageJson | null): CheckResult {\n const { file: lefthookFile, hasPreCommit } = lefthookConfig(site, reader);\n const hasLefthook = lefthookFile !== null || hasDep(pkg, \"lefthook\");\n return result(\"pre-commit\", preCommitStatus(hasPreCommit, hasLintStaged(site, pkg)), {\n PASS: [\"Pre-commit hooks: lefthook + lint-staged\", lefthookFile ?? \"package.json\"],\n SUGGEST: preCommitSuggestion(site, lefthookFile, hasPreCommit, hasLefthook),\n });\n}\n\nfunction proxyLocalHooks(site: Site): CheckResult {\n const file = site.find(\"lib/augur.ts\", \"src/lib/augur.ts\", \"hooks/augur.ts\");\n const hasUseQuery = site.contains(file, /useQuery|useInfiniteQuery/);\n const wrapsActions = site.contains(file, /unwrap\\(|serverAction|augur-server\\/actions/);\n return result(\"proxy-local-hooks\", localHooksStatus(hasUseQuery), {\n PASS: [\"No local hook wrappers detected\", \"\"],\n SUGGEST: wrapsActions\n ? [\n \"Local hooks wrapping server actions -- replace with createServerQueryProxy\",\n `${file} -- see ${RUNBOOK}#proxy-migration`,\n ]\n : [\"Local hooks found -- check if createServerQueryProxy can replace them\", file ?? \"\"],\n });\n}\n\nfunction proxyServerQuery(site: Site): CheckResult {\n const serverProxy =\n site.proxyFilesMatching(/createServerQueryProxy|createAugurOptions/).length > 0;\n const augurOptions = site.proxyFilesMatching(/useAugurOptions|registerQueryAction/).length > 0;\n return result(\"proxy-server-query\", serverQueryStatus(serverProxy, augurOptions), {\n PASS: serverProxy\n ? [\"Uses createServerQueryProxy for data fetching\", \"\"]\n : [\"Uses useAugurOptions for data fetching\", \"\"],\n SUGGEST: [\n \"No proxy-based data fetching detected\",\n \"Consider createServerQueryProxy (augur-server/hooks) or useAugurOptions (augur-hooks)\",\n ],\n });\n}\n\nfunction queryClientScope(site: Site): CheckResult {\n const files = site.proxyFilesMatching(MODULE_SCOPE_CLIENT);\n return result(\"query-client-scope\", noOffenderStatus(files.length), {\n PASS: [\"No module-scope QueryClient\", \"\"],\n FAIL: [\n \"QueryClient created at module scope (shared across server requests)\",\n `${files.join(\", \")}: create it per request (see ${GETTING_STARTED}#provider-setup)`,\n ],\n });\n}\n\n/**\n * A finite gcTime, or a CACHE_CONFIG tier spread while the site's augur-utils may predate the\n * server-safe tiers, in the proxy files or anywhere under hooks/ or app/ (#94).\n */\nfunction queryGcTime(site: Site, pkg: PackageJson | null): CheckResult {\n const range = pkg === null ? \"\" : allDeps(pkg)[\"@simpleapps-com/augur-utils\"] || \"\";\n // Both decisions are proved scans (rules.ts), each the regex it replaced\n const oldUtils = utilsRangeBeforeFix(range);\n const files = site\n .queryFiles()\n .filter((f) => gcTimeOffenderIn(f.text, oldUtils))\n .map((f) => f.path);\n return result(\"query-gc-time\", noOffenderStatus(files.length), {\n PASS: [\"No finite gcTime in provider/query setup\", \"\"],\n FAIL: [\n \"Finite gcTime in provider/query setup (leaks memory during SSR)\",\n `${files.join(\", \")}: remove it, or wrap with resolveGcTime() from augur-utils; a ...CACHE_CONFIG spread needs @simpleapps-com/augur-utils >= 2026.11.3`,\n ],\n });\n}\n\nfunction apiVersion(pkg: PackageJson): CheckResult {\n const range = allDeps(pkg)[\"@simpleapps-com/augur-api\"] || \"\";\n const match = /(\\d{4})\\.(\\d+)\\.(\\d+)/.exec(range);\n const status = apiVersionStatus(\n match !== null,\n Number(match?.[1]),\n Number(match?.[2]),\n Number(match?.[3]),\n );\n return result(\"api-version\", status, {\n PASS: [\"augur-api SDK version supports typed proxies\", range],\n WARN: match\n ? [\n \"augur-api SDK may lack typed proxy support\",\n `${range} -- upgrade to >= 2026.3.7 for typed responses`,\n ]\n : range\n ? [\"augur-api version format not recognized\", range]\n : [\"No augur-api dependency found\", \"\"],\n });\n}\n\n/**\n * A platform minimum (atlas#85, owner 2026-11-12): the site's range for `dep` judged by its\n * proved rule (`floor`, whose minimum `want` names for the message; the tests pin the two\n * together). `fix` names every package to raise together (React refuses a `react` and\n * `react-dom` of different versions).\n */\nfunction floorCheck(\n pkg: PackageJson,\n id: string,\n dep: string,\n floor: (present: boolean, range: string) => Status,\n want: string,\n fix: string,\n): CheckResult {\n const range = allDeps(pkg)[dep] ?? \"\";\n return result(id, floor(range !== \"\", range), {\n PASS: [`${dep} is at or above the platform minimum ${want}`, range],\n FAIL: [\n `${dep} allows a version below the platform minimum ${want}`,\n `${range}; set ${fix} to ^${want}, then run pnpm install`,\n ],\n WARN: [`${dep} version format not recognized`, range],\n SKIP: [`No ${dep} dependency found`, \"\"],\n });\n}\n\n/** next-floor: the platform minimum Next.js (every Next 16 advisory is fixed by 16.4.1). */\nfunction nextFloor(pkg: PackageJson): CheckResult {\n return floorCheck(pkg, \"next-floor\", \"next\", nextFloorStatus, \"16.4.5\", \"next\");\n}\n\nconst REACT_FIX = \"react and react-dom\";\n\n/** react-floor: the platform minimum React (with the Server Components RCE fix). */\nfunction reactFloor(pkg: PackageJson): CheckResult {\n return floorCheck(pkg, \"react-floor\", \"react\", reactFloorStatus, \"19.3.1\", REACT_FIX);\n}\n\n/** react-dom-floor: react-dom at the same minimum, so the two never part. */\nfunction reactDomFloor(pkg: PackageJson): CheckResult {\n return floorCheck(pkg, \"react-dom-floor\", \"react-dom\", reactFloorStatus, \"19.3.1\", REACT_FIX);\n}\n\nconst AUGUR_API = \"@simpleapps-com/augur-api\";\n\n/** augur-api-floor: the platform minimum Augur SDK, the latest release when it was set. */\nfunction augurApiFloor(pkg: PackageJson): CheckResult {\n return floorCheck(pkg, \"augur-api-floor\", AUGUR_API, augurApiFloorStatus, \"2026.11.5\", AUGUR_API);\n}\n\n/** The short name of an augur package (`augur-core`). */\nfunction shortName(name: string): string {\n return name.replace(\"@simpleapps-com/\", \"\");\n}\n\n/** augur-version-latest: each installed augur package against its own latest (no lockstep). */\nfunction augurVersionLatest(reader: SiteReader, pkg: PackageJson | null): CheckResult {\n const deps = pkg ? allDeps(pkg) : {};\n const installed = AUGUR_PACKAGES.filter((name) => deps[name]);\n const latest = installed.map((name) => reader.latestVersion(name));\n const states: PackageState[] = installed.map((name, k) =>\n packageStateOf(deps[name] as string, latest[k] as string),\n );\n const behind = installed.filter((_, k) => states[k] === \"behind\");\n return result(\"augur-version-latest\", latestStatus(states), {\n SKIP: installed.length\n ? [\n \"Augur latest version check\",\n \"Could not fetch latest version from npm (offline or not published)\",\n ]\n : [\"Augur latest version check\", pkg ? \"No augur packages found\" : \"No package.json\"],\n PASS: [\n \"Augur packages on their latest versions\",\n installed.map((name, k) => `${shortName(name)}: ${latest[k]}`).join(\", \"),\n ],\n FAIL: [\n \"Augur packages should be on their latest versions\",\n `${behind\n .map(\n (name) =>\n `${shortName(name)}: installed ${deps[name]}, latest ${latest[installed.indexOf(name)]}`,\n )\n .join(\", \")} -- set the latest in package.json, then run pnpm install (not pnpm update)`,\n ],\n });\n}\n\n/** Every check, in the original order; the package.json checks only when there is one. */\nexport function runChecks(reader: SiteReader): CheckResult[] {\n const site = new Site(reader);\n const pkg = site.json<PackageJson>(\"package.json\");\n const eslintFile = site.find(\"eslint.config.mjs\", \"eslint.config.js\");\n const next = nextFacts(site, pkg);\n return [\n siteConfig(site),\n serverSite(site),\n actions(site),\n siteHooks(site),\n ssrOptions(site),\n tsconfig(site),\n eslint(site, eslintFile),\n eslintDeprecated(site, eslintFile),\n prettier(site, pkg),\n knip(site, pkg),\n nextExternal(next),\n nextIoredis(next),\n nextHeaders(next),\n nextOptimize(next),\n nextStrict(next),\n nextProxy(site),\n contractTests(site),\n noWrapper(site),\n auth(site),\n imageLoader(next),\n qualityScript(pkg),\n ...(pkg ? [icons(pkg), tailwind(pkg)] : []),\n preCommit(site, reader, pkg),\n proxyLocalHooks(site),\n proxyServerQuery(site),\n queryClientScope(site),\n queryGcTime(site, pkg),\n ...(pkg\n ? [apiVersion(pkg), nextFloor(pkg), reactFloor(pkg), reactDomFloor(pkg), augurApiFloor(pkg)]\n : []),\n augurVersionLatest(reader, pkg),\n ];\n}\n","/** The {@link SiteReader} over the real file system and npm. */\n\nimport { execFileSync } from \"node:child_process\";\nimport { existsSync, readdirSync, readFileSync } from \"node:fs\";\nimport { dirname, join, resolve } from \"node:path\";\nimport type { SiteReader } from \"./checks\";\nimport { isQuerySourceName, walksDir } from \"./rules\";\n\n/**\n * The `.ts`/`.tsx` files under `rel` (relative to `siteDir`), recursively, skipping node_modules\n * (which names and folders count: the proved `isQuerySourceName`, `walksDir`).\n */\nfunction sourceFilesUnder(siteDir: string, rel: string): string[] {\n if (!existsSync(resolve(siteDir, rel))) return [];\n return readdirSync(resolve(siteDir, rel), { withFileTypes: true }).flatMap((entry) => {\n const path = join(rel, entry.name);\n if (entry.isDirectory()) return walksDir(entry.name) ? sourceFilesUnder(siteDir, path) : [];\n return isQuerySourceName(entry.name) ? [path] : [];\n });\n}\n\n/** The first of `names` found walking up from `start`, stopping at a git repo root. */\nfunction findUpward(start: string, names: string[]): string | null {\n let dir = start;\n const root = resolve(\"/\");\n while (dir !== root) {\n const hit = names.map((name) => resolve(dir, name)).find((path) => existsSync(path));\n if (hit) return hit;\n if (existsSync(resolve(dir, \".git\"))) break;\n dir = dirname(dir);\n }\n return null;\n}\n\n/** A package's latest published version from `npm view`, or \"\" when npm cannot say. */\nfunction npmLatest(packageName: string): string {\n try {\n return execFileSync(\"npm\", [\"view\", packageName, \"version\"], {\n encoding: \"utf-8\",\n stdio: [\"ignore\", \"pipe\", \"ignore\"],\n }).trim();\n } catch {\n return \"\";\n }\n}\n\nexport function nodeReader(siteDir: string, latestVersion = npmLatest): SiteReader {\n const read = (path: string) => (existsSync(path) ? readFileSync(path, \"utf-8\") : null);\n return {\n exists: (relPath) => existsSync(resolve(siteDir, relPath)),\n read: (relPath) => read(resolve(siteDir, relPath)),\n readUpward: (names) => {\n const path = findUpward(siteDir, names);\n return path === null ? null : { path, content: readFileSync(path, \"utf-8\") };\n },\n latestVersion,\n sourceFiles: (dirs) => dirs.flatMap((dir) => sourceFilesUnder(siteDir, dir)),\n };\n}\n","/** augur-doctor's scorecard: the check results as terminal lines, grouped as before. */\n\nimport { RUNBOOK, type CheckResult } from \"./checks\";\nimport { countStatusFrom, scoredTotal, type Status } from \"./rules\";\n\nconst ICONS: Record<Status, string> = {\n PASS: \"\\x1b[32m[PASS]\\x1b[0m\",\n FAIL: \"\\x1b[31m[FAIL]\\x1b[0m\",\n WARN: \"\\x1b[33m[WARN]\\x1b[0m\",\n SUGGEST: \"\\x1b[36m[SUGGEST]\\x1b[0m\",\n SKIP: \"\\x1b[90m[SKIP]\\x1b[0m\",\n};\n\n/** The scorecard's groups, in order (no lockstep: the one-version check is gone). */\nconst GROUPS: [string, string[]][] = [\n [\"Site Architecture\", [\"site-config\", \"server-site\", \"actions\", \"site-hooks\", \"ssr-options\"]],\n [\n \"Config Alignment\",\n [\"tsconfig\", \"eslint\", \"eslint-deprecated\", \"prettier\", \"knip\", \"tailwind\", \"icons\"],\n ],\n [\n \"Next.js Config\",\n [\"next-external\", \"next-ioredis\", \"next-headers\", \"next-optimize\", \"next-strict\", \"next-proxy\"],\n ],\n [\"Testing & Quality\", [\"contract-tests\", \"quality-script\", \"pre-commit\"]],\n [\n \"Proxy Adoption\",\n [\n \"proxy-local-hooks\",\n \"proxy-server-query\",\n \"query-client-scope\",\n \"query-gc-time\",\n \"api-version\",\n ],\n ],\n [\"Platform Minimums\", [\"next-floor\", \"react-floor\", \"react-dom-floor\", \"augur-api-floor\"]],\n [\"Package Versions\", [\"augur-version-latest\"]],\n [\"Patterns\", [\"no-wrapper\", \"auth\", \"image-loader\"]],\n];\n\n/** A group's lines: its heading, each of its results, a blank line. */\nfunction groupLines(name: string, ids: string[], results: CheckResult[]): string[] {\n const lines = ids.flatMap((id) => {\n const r = results.find((x) => x.id === id);\n if (!r) return [];\n const detail = r.detail ? ` \\x1b[90m${r.detail}\\x1b[0m` : \"\";\n return [` ${ICONS[r.status]} ${r.label}${detail}`];\n });\n return [`\\x1b[1m${name}\\x1b[0m`, ...lines, \"\"];\n}\n\n/** The score line: passing out of the scored total, then the failing, warning, suggestion counts. */\nfunction scoreLine(statuses: Status[]): string {\n const count = (s: Status) => countStatusFrom(statuses, s, 0);\n const failing = count(\"FAIL\");\n const warnings = count(\"WARN\");\n const suggestions = count(\"SUGGEST\");\n return (\n `\\x1b[1mScore: ${count(\"PASS\")}/${scoredTotal(statuses)}\\x1b[0m` +\n (failing > 0 ? ` \\x1b[31m(${failing} failing)\\x1b[0m` : \"\") +\n (warnings > 0 ? ` \\x1b[33m(${warnings} warnings)\\x1b[0m` : \"\") +\n (suggestions > 0 ? ` \\x1b[36m(${suggestions} suggestions)\\x1b[0m` : \"\")\n );\n}\n\n/** The whole scorecard for a site. */\nexport function reportLines(siteName: string, siteDir: string, results: CheckResult[]): string[] {\n const statuses = results.map((r) => r.status);\n const runbook =\n countStatusFrom(statuses, \"FAIL\", 0) > 0\n ? [\"See the migration runbook for fixes:\", RUNBOOK, \"\"]\n : [];\n return [\n \"\",\n `\\x1b[1mAugur Doctor: ${siteName}\\x1b[0m`,\n `Path: ${siteDir}`,\n \"\",\n ...GROUPS.flatMap(([name, ids]) => groupLines(name, ids, results)),\n scoreLine(statuses),\n \"\",\n ...runbook,\n ];\n}\n","#!/usr/bin/env node\n/**\n * augur-doctor -- Site health check against the Augur platform standard.\n *\n * Usage:\n * npx augur-doctor (runs against current directory)\n * npx augur-doctor /path/to/site\n *\n * Checks a consumer site for alignment with the reference implementation and prints a\n * pass/fail/warn scorecard.\n */\n\nimport { runDoctor } from \"./doctor/cli\";\n\nprocess.exit(\n runDoctor(process.argv.slice(2), {\n log: (line) => console.log(line),\n error: (line) => console.error(line),\n }),\n);\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAEA,SAAS,cAAAA,mBAAkB;AAC3B,SAAS,UAAU,WAAAC,gBAAe;;;AC8K3B,SAAS,aAAa,IAAc,GAAW,GAAoB;AAMxE,MAAI,MAAM,EAAG,QAAO;AACpB,MAAK,GAAG,IAAI,CAAC,MAAiB,EAAG,QAAO;AACxC,SAAO,aAAa,IAAI,GAAG,IAAI,CAAC;AAClC;AAyBO,SAAS,WAAW,IAAc,GAAqB;AAO5D,MAAI,KAAK,GAAG,OAAQ,QAAO,CAAC;AAC5B,QAAM,OAAO,WAAW,IAAI,IAAI,CAAC;AACjC,SAAO,aAAa,IAAI,GAAG,CAAC,GAAa,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,GAAa,GAAG,IAAI;AAChF;;;AC3IA,IAAM,cAAc;AAAA,EAClB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAEA,IAAM,gBAAgB;AACtB,IAAM,sBAAsB;AAI5B,IAAM,oBAAoB,CAAC,SAAS,OAAO,aAAa,SAAS;AAG1D,IAAM,iBAAiB;AAAA,EAC5B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAGO,IAAM,UAAU;AACvB,IAAM,kBAAkB;AAMxB,SAAS,OACP,IACA,QACA,QACa;AACb,QAAM,CAAC,OAAO,MAAM,IAAI,OAAO,MAAM;AACrC,SAAO,EAAE,QAAQ,IAAI,OAAO,OAAO;AACrC;AAGA,IAAM,OAAN,MAAW;AAAA,EACT,YAA6B,QAAoB;AAApB;AAAA,EAAqB;AAAA,EAArB;AAAA,EAE7B,QAAQ,YAAqC;AAC3C,WAAO,WAAW,KAAK,CAAC,MAAM,KAAK,OAAO,OAAO,CAAC,CAAC,KAAK;AAAA,EAC1D;AAAA,EAEA,KAAK,SAAgC;AACnC,WAAO,KAAK,OAAO,KAAK,OAAO;AAAA,EACjC;AAAA,EAEA,SAAS,SAAwB,SAAmC;AAClE,UAAM,UAAU,YAAY,OAAO,OAAO,KAAK,OAAO,KAAK,OAAO;AAClE,QAAI,CAAC,QAAS,QAAO;AACrB,WAAO,OAAO,YAAY,WAAW,QAAQ,SAAS,OAAO,IAAI,QAAQ,KAAK,OAAO;AAAA,EACvF;AAAA,EAEA,KAAQ,SAA2B;AACjC,UAAM,UAAU,KAAK,OAAO,KAAK,OAAO;AACxC,QAAI,CAAC,QAAS,QAAO;AACrB,QAAI;AACF,aAAO,KAAK,MAAM,OAAO;AAAA,IAC3B,QAAQ;AACN,aAAO;AAAA,IACT;AAAA,EACF;AAAA;AAAA,EAGA,mBAAmB,SAA2B;AAC5C,WAAO,YAAY,OAAO,CAAC,MAAM,KAAK,SAAS,GAAG,OAAO,CAAC;AAAA,EAC5D;AAAA;AAAA,EAGA,aAA+C;AAC7C,UAAM,QAAQ,WAAW,CAAC,GAAG,aAAa,GAAG,KAAK,OAAO,YAAY,iBAAiB,CAAC,GAAG,CAAC;AAC3F,WAAO,MAAM,QAAQ,CAAC,SAAS;AAC7B,YAAM,OAAO,KAAK,OAAO,KAAK,IAAI;AAClC,aAAO,SAAS,OAAO,CAAC,IAAI,CAAC,EAAE,MAAM,KAAK,CAAC;AAAA,IAC7C,CAAC;AAAA,EACH;AACF;AAEA,SAAS,WAAW,MAAyB;AAC3C,QAAM,OAAO,KAAK;AAAA,IAChB;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACA,SAAO,OAAO,eAAe,SAAS,SAAS,MAAM,KAAK,SAAS,MAAM,YAAY,CAAC,GAAG;AAAA,IACvF,MAAM,CAAC,qCAAqC,QAAQ,EAAE;AAAA,IACtD,MAAM,CAAC,wDAAwD,QAAQ,EAAE;AAAA,IACzE,MAAM,CAAC,qCAAqC,8BAA8B;AAAA,EAC5E,CAAC;AACH;AAEA,SAAS,WAAW,MAAyB;AAC3C,QAAM,OAAO,KAAK,KAAK,qBAAqB,yBAAyB,sBAAsB;AAC3F,SAAO,OAAO,eAAe,SAAS,SAAS,MAAM,KAAK,SAAS,MAAM,kBAAkB,CAAC,GAAG;AAAA,IAC7F,MAAM,CAAC,0CAA0C,QAAQ,EAAE;AAAA,IAC3D,MAAM,CAAC,4DAA4D,QAAQ,EAAE;AAAA,IAC7E,MAAM,CAAC,0CAA0C,4BAA4B;AAAA,EAC/E,CAAC;AACH;AAEA,SAAS,QAAQ,MAAyB;AACxC,QAAM,OAAO,KAAK,KAAK,wBAAwB,4BAA4B,gBAAgB;AAC3F,QAAM,YAAY,KAAK,SAAS,MAAM,yBAAyB;AAC/D,QAAM,YAAY,KAAK,mBAAmB,aAAa,EAAE,SAAS;AAClE,QAAM,SAAS,cAAc,SAAS,MAAM,WAAW,SAAS;AAChE,SAAO,OAAO,WAAW,QAAQ;AAAA,IAC/B,MAAM,OACF,CAAC,8CAA8C,IAAI,IACnD,CAAC,qDAAqD,EAAE;AAAA,IAC5D,MAAM,CAAC,8DAA8D,QAAQ,EAAE;AAAA,IAC/E,MAAM;AAAA,MACJ;AAAA,MACA;AAAA,IACF;AAAA,EACF,CAAC;AACH;AAEA,SAAS,UAAU,MAAyB;AAC1C,QAAM,OAAO,KAAK;AAAA,IAChB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACA,QAAM,kBAAkB,KAAK,SAAS,MAAM,iBAAiB;AAC7D,QAAM,SAAS;AAAA,IACb,SAAS;AAAA,IACT;AAAA,IACA,KAAK,SAAS,MAAM,gCAAgC;AAAA,EACtD;AACA,SAAO,OAAO,cAAc,QAAQ;AAAA,IAClC,MAAM;AAAA,MACJ,kBAAkB,oCAAoC;AAAA,MACtD,QAAQ;AAAA,IACV;AAAA,IACA,MAAM,CAAC,sDAAsD,QAAQ,EAAE;AAAA,IACvE,MAAM,CAAC,mCAAmC,uBAAuB;AAAA,EACnE,CAAC;AACH;AAEA,SAAS,WAAW,MAAyB;AAC3C,QAAM,OAAO,KAAK,KAAK,wBAAwB,0BAA0B;AACzE,SAAO,OAAO,eAAe,SAAS,SAAS,MAAM,KAAK,SAAS,MAAM,SAAS,CAAC,GAAG;AAAA,IACpF,MAAM,CAAC,wCAAwC,QAAQ,EAAE;AAAA,IACzD,MAAM,CAAC,sDAAsD,QAAQ,EAAE;AAAA,IACvE,MAAM,CAAC,wCAAwC,+BAA+B;AAAA,EAChF,CAAC;AACH;AAEA,SAAS,SAAS,MAAyB;AACzC,QAAM,SAAS,KAAK,KAA2B,eAAe;AAC9D,QAAM,aAAa,QAAQ,WAAW;AACtC,QAAM,SAAS;AAAA,IACb,WAAW;AAAA,IACX,WAAW,SAAS,4BAA4B;AAAA,IAChD,WAAW,SAAS,cAAc;AAAA,EACpC;AACA,SAAO,OAAO,YAAY,QAAQ;AAAA,IAChC,MAAM,CAAC,oDAAoD,EAAE;AAAA,IAC7D,MAAM,CAAC,6DAA6D,YAAY,UAAU,EAAE;AAAA,IAC5F,MAAM,SACF;AAAA,MACE;AAAA,MACA,aAAa,YAAY,UAAU,KAAK;AAAA,IAC1C,IACA,CAAC,wBAAwB,gBAAgB;AAAA,EAC/C,CAAC;AACH;AAEA,SAAS,iBAAiB,MAAY,MAAuC;AAC3E,MAAI,MAAM;AACR,WAAO;AAAA,MACL;AAAA,MACA;AAAA,IACF;AAAA,EACF;AACA,MAAI,KAAK,KAAK,kBAAkB,gBAAgB,aAAa,eAAe,GAAG;AAC7E,WAAO;AAAA,MACL;AAAA,MACA;AAAA,IACF;AAAA,EACF;AACA,SAAO,CAAC,4BAA4B,wBAAwB;AAC9D;AAEA,SAAS,OAAO,MAAY,MAAkC;AAC5D,SAAO,OAAO,UAAU,aAAa,SAAS,MAAM,KAAK,SAAS,MAAM,qBAAqB,CAAC,GAAG;AAAA,IAC/F,MAAM,CAAC,mDAAmD,QAAQ,EAAE;AAAA,IACpE,MAAM,iBAAiB,MAAM,IAAI;AAAA,EACnC,CAAC;AACH;AAEA,SAAS,iBAAiB,MAAY,MAAkC;AACtE,QAAM,SAAS;AAAA,IACb,SAAS;AAAA,IACT,KAAK,SAAS,MAAM,+CAA+C;AAAA,IACnE,KAAK,SAAS,MAAM,eAAe;AAAA,EACrC;AACA,SAAO,OAAO,qBAAqB,QAAQ;AAAA,IACzC,MAAM,CAAC,8BAA8B,wBAAwB;AAAA,IAC7D,MAAM,CAAC,sCAAsC,EAAE;AAAA,IAC/C,MAAM;AAAA,MACJ;AAAA,MACA;AAAA,IACF;AAAA,IACA,MAAM;AAAA,MACJ;AAAA,MACA;AAAA,IACF;AAAA,EACF,CAAC;AACH;AAEA,SAAS,mBACP,MACA,MACA,KACkB;AAClB,QAAM,QAAQ;AACd,MAAI,KAAM,QAAO,CAAC,OAAO,yDAAyD;AAClF,MAAI,KAAK,UAAU;AACjB,WAAO,CAAC,OAAO,0EAA0E;AAAA,EAC3F;AACA,MAAI,KAAK,KAAK,eAAe,oBAAoB,kBAAkB,GAAG;AACpE,WAAO;AAAA,MACL;AAAA,MACA;AAAA,IACF;AAAA,EACF;AACA,SAAO,CAAC,0BAA0B,0BAA0B;AAC9D;AAEA,SAAS,SAAS,MAAY,KAAsC;AAClE,QAAM,OAAO,KAAK;AAAA,IAChB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACA,SAAO;AAAA,IACL;AAAA,IACA,aAAa,SAAS,MAAM,KAAK,SAAS,MAAM,uBAAuB,CAAC;AAAA,IACxE;AAAA,MACE,MAAM,CAAC,8CAA8C,QAAQ,EAAE;AAAA,MAC/D,MAAM,mBAAmB,MAAM,MAAM,GAAG;AAAA,IAC1C;AAAA,EACF;AACF;AAEA,SAAS,KAAK,MAAY,KAAsC;AAC9D,QAAM,SAAS,KAAK;AAAA,IAClB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACA,SAAO,OAAO,QAAQ,WAAW,WAAW,MAAM,OAAO,KAAK,MAAM,CAAC,GAAG;AAAA,IACtE,MAAM,CAAC,2CAA2C,UAAU,EAAE;AAAA,IAC9D,MAAM;AAAA,MACJ;AAAA,MACA;AAAA,IACF;AAAA,IACA,MAAM,SACF;AAAA,MACE;AAAA,MACA;AAAA,IACF,IACA;AAAA,MACE;AAAA,MACA;AAAA,IACF;AAAA,EACN,CAAC;AACH;AAGA,SAAS,OAAO,KAAyB,MAAuB;AAC9D,SAAO,CAAC,EAAE,KAAK,eAAe,IAAI,KAAK,KAAK,kBAAkB,IAAI;AACpE;AAGA,SAAS,YAAY,MAAc,OAA0B;AAC3D,SAAO,MAAM,MAAM,CAAC,SAAS,KAAK,SAAS,IAAI,CAAC;AAClD;AAGA,SAAS,UAAU,MAAY,KAAoC;AACjE,QAAM,OAAO,KAAK,KAAK,kBAAkB,mBAAmB,gBAAgB;AAC5E,QAAM,QAAQ,SAAS,OAAO,OAAO,KAAK,KAAK,IAAI,MAAM;AACzD,SAAO;AAAA,IACL,WAAW,SAAS;AAAA,IACpB,aAAa,KAAK,SAAS,wBAAwB;AAAA,IACnD,mBAAmB,KAAK,SAAS,cAAc;AAAA,IAC/C,aAAa,OAAO,KAAK,SAAS;AAAA,IAClC,oBAAoB,KAAK,SAAS,SAAS;AAAA,IAC3C,eAAe,YAAY,MAAM;AAAA,MAC/B;AAAA,MACA;AAAA,MACA;AAAA,IACF,CAAC;AAAA,IACD,YAAY,KAAK,SAAS,SAAS;AAAA,IACnC,aAAa,KAAK,SAAS,wBAAwB;AAAA,IACnD,WAAW,KAAK,SAAS,iBAAiB;AAAA,IAC1C,aAAa,sBAAsB,KAAK,IAAI;AAAA,IAC5C,WAAW,KAAK,SAAS,QAAQ;AAAA,EACnC;AACF;AAEA,SAAS,aAAa,GAA2B;AAC/C,SAAO,OAAO,iBAAiB,mBAAmB,CAAC,GAAG;AAAA,IACpD,MAAM,CAAC,+CAA+C,EAAE;AAAA,IACxD,MAAM;AAAA,MACJ;AAAA,MACA;AAAA,IACF;AAAA,IACA,MAAM,EAAE,YACJ;AAAA,MACE;AAAA,MACA;AAAA,IACF,IACA,CAAC,sBAAsB,sBAAsB;AAAA,EACnD,CAAC;AACH;AAEA,SAAS,kBAAkB,GAAsB;AAC/C,MAAI,CAAC,EAAE,UAAW,QAAO;AACzB,MAAI,CAAC,EAAE,YAAa,QAAO;AAC3B,SAAO;AACT;AAEA,SAAS,YAAY,GAA2B;AAC9C,SAAO,OAAO,gBAAgB,cAAc,CAAC,GAAG;AAAA,IAC9C,MAAM,CAAC,8BAA8B,kBAAkB,CAAC,CAAC;AAAA,IACzD,MAAM,CAAC,kDAAkD,EAAE;AAAA,IAC3D,MAAM;AAAA,MACJ;AAAA,MACA;AAAA,IACF;AAAA,EACF,CAAC;AACH;AAEA,SAAS,YAAY,GAA2B;AAC9C,SAAO,OAAO,gBAAgB,cAAc,CAAC,GAAG;AAAA,IAC9C,MAAM,CAAC,iCAAiC,EAAE;AAAA,IAC1C,MAAM;AAAA,MACJ;AAAA,MACA;AAAA,IACF;AAAA,IACA,MAAM;AAAA,MACJ;AAAA,MACA,EAAE,YAAY,gCAAgC;AAAA,IAChD;AAAA,EACF,CAAC;AACH;AAEA,SAAS,aAAa,GAA2B;AAC/C,SAAO,OAAO,iBAAiB,eAAe,CAAC,GAAG;AAAA,IAChD,MAAM,CAAC,uCAAuC,EAAE;AAAA,IAChD,MAAM;AAAA,MACJ;AAAA,MACA,EAAE,YAAY,+DAA+D;AAAA,IAC/E;AAAA,EACF,CAAC;AACH;AAEA,SAAS,WAAW,GAA2B;AAC7C,SAAO,OAAO,eAAe,aAAa,CAAC,GAAG;AAAA,IAC5C,MAAM,CAAC,gCAAgC,gBAAgB;AAAA,IACvD,MAAM,CAAC,gCAAgC,EAAE;AAAA,IACzC,MAAM,CAAC,wCAAwC,6CAA6C;AAAA,EAC9F,CAAC;AACH;AAEA,IAAM,YAAY,GAAG,OAAO;AAG5B,SAAS,UAAU,MAAyB;AAC1C,QAAM,aAAa,KAAK;AAAA,IACtB,eAAe,cAAc,OAAO,KAAK;AAAA,IACzC,eAAe,cAAc,OAAO,IAAI;AAAA,IACxC,eAAe,cAAc,MAAM,KAAK;AAAA,IACxC,eAAe,cAAc,MAAM,IAAI;AAAA,EACzC;AACA,QAAM,QAAQ,KAAK;AAAA,IACjB,eAAe,SAAS,OAAO,KAAK;AAAA,IACpC,eAAe,SAAS,OAAO,IAAI;AAAA,IACnC,eAAe,SAAS,MAAM,KAAK;AAAA,IACnC,eAAe,SAAS,MAAM,IAAI;AAAA,EACpC;AACA,SAAO,OAAO,cAAc,iBAAiB,eAAe,MAAM,UAAU,IAAI,GAAG;AAAA,IACjF,MAAM,CAAC,yBAAyB,SAAS,EAAE;AAAA,IAC3C,MAAM;AAAA,MACJ;AAAA,MACA,gBAAgB,cAAc,IAAI,SAAS;AAAA,IAC7C;AAAA,IACA,MAAM;AAAA,MACJ;AAAA,MACA,gBAAgB,cAAc,IAAI,SAAS,IAAI,SAAS;AAAA,IAC1D;AAAA,IACA,MAAM,CAAC,oCAAoC,6BAA6B;AAAA,EAC1E,CAAC;AACH;AAEA,SAAS,YAAY,GAA2B;AAC9C,SAAO,OAAO,gBAAgB,kBAAkB,CAAC,GAAG;AAAA,IAClD,MAAM,CAAC,sBAAsB,gBAAgB;AAAA,IAC7C,MAAM,CAAC,kCAAkC,EAAE;AAAA,IAC3C,MAAM,EAAE,YACJ;AAAA,MACE;AAAA,MACA;AAAA,IACF,IACA,CAAC,gCAAgC,wDAAwD;AAAA,EAC/F,CAAC;AACH;AAEA,SAAS,cAAc,MAAyB;AAC9C,QAAM,UACJ,KAAK;AAAA,IACH;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF,MAAM;AACR,SAAO,OAAO,kBAAkB,oBAAoB,OAAO,GAAG;AAAA,IAC5D,MAAM,CAAC,8BAA8B,EAAE;AAAA,IACvC,MAAM,CAAC,kDAAkD,yBAAyB;AAAA,EACpF,CAAC;AACH;AAEA,SAAS,UAAU,MAAyB;AAC1C,QAAM,OAAO,KAAK;AAAA,IAChB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACA,QAAM,QAAQ,KAAK,SAAS,MAAM,mBAAmB,KAAK,KAAK,SAAS,MAAM,kBAAkB;AAChG,QAAM,SAAS,KAAK,KAAK,OAAO,SAAS,MAAM;AAC/C,SAAO,OAAO,cAAc,gBAAgB,QAAQ,KAAK,GAAG;AAAA,IAC1D,MAAM,CAAC,iCAAiC,mBAAmB;AAAA,IAC3D,MAAM,CAAC,iCAAiC,OAAO,4BAA4B,EAAE;AAAA,IAC7E,MAAM,CAAC,iCAAiC,GAAG,IAAI,2CAA2C;AAAA,EAC5F,CAAC;AACH;AAEA,SAAS,KAAK,MAAyB;AACrC,QAAM,OAAO,KAAK,KAAK,WAAW,eAAe,mBAAmB,aAAa;AACjF,QAAM,cACJ,KAAK,SAAS,MAAM,WAAW,KAC/B,KAAK,SAAS,MAAM,kBAAkB,KACtC,KAAK,SAAS,MAAM,kBAAkB;AACxC,QAAM,SAAS,WAAW,SAAS,MAAM,aAAa,KAAK,SAAS,MAAM,UAAU,CAAC;AACrF,SAAO,OAAO,QAAQ,QAAQ;AAAA,IAC5B,MAAM,CAAC,2CAA2C,QAAQ,EAAE;AAAA,IAC5D,MAAM;AAAA,MACJ;AAAA,MACA,GAAG,IAAI;AAAA,IACT;AAAA,IACA,MAAM,OACF,CAAC,wBAAwB,IAAI,IAC7B,CAAC,oBAAoB,iCAAiC;AAAA,EAC5D,CAAC;AACH;AAEA,SAAS,cAAc,KAAsC;AAC3D,QAAM,UAAU,KAAK,UAAU,SAAS;AACxC,QAAM,WACJ,CAAC,CAAC,WACF,QAAQ,SAAS,WAAW,KAC5B,QAAQ,SAAS,MAAM,KACvB,QAAQ,SAAS,MAAM;AACzB,SAAO,OAAO,kBAAkB,cAAc,CAAC,CAAC,SAAS,QAAQ,GAAG;AAAA,IAClE,MAAM,CAAC,2CAA2C,EAAE;AAAA,IACpD,MAAM,CAAC,+CAA+C,eAAe,OAAO,GAAG;AAAA,IAC/E,MAAM;AAAA,MACJ;AAAA,MACA;AAAA,IACF;AAAA,EACF,CAAC;AACH;AAEA,SAAS,QAAQ,KAAwB;AACvC,SAAO,EAAE,GAAG,IAAI,cAAc,GAAG,IAAI,gBAAgB;AACvD;AAEA,SAAS,MAAM,KAA+B;AAC5C,QAAM,OAAO,QAAQ,GAAG;AACxB,QAAM,YAAY,CAAC,CAAC,KAAK,kBAAkB;AAC3C,QAAM,SAAS,YAAY,CAAC,CAAC,KAAK,aAAa,GAAG,WAAW,CAAC,CAAC,KAAK,cAAc,CAAC;AACnF,SAAO,OAAO,SAAS,QAAQ;AAAA,IAC7B,MAAM,CAAC,wCAAwC,EAAE;AAAA,IACjD,MAAM;AAAA,MACJ;AAAA,MACA,YACI,4DACA;AAAA,IACN;AAAA,IACA,MAAM,CAAC,yBAAyB,sBAAsB;AAAA,EACxD,CAAC;AACH;AAEA,SAAS,SAAS,KAA+B;AAC/C,QAAM,QAAQ,QAAQ,GAAG,EAAE,aAAa,KAAK;AAC7C,SAAO,OAAO,YAAY,eAAe,KAAK,GAAG;AAAA,IAC/C,MAAM,CAAC,mCAAmC,EAAE;AAAA,IAC5C,MAAM,CAAC,eAAe,sBAAsB,KAAK,uBAAuB;AAAA,IACxE,MAAM,QACF,CAAC,4BAA4B,gBAAgB,KAAK,EAAE,IACpD,CAAC,mCAAmC,EAAE;AAAA,EAC5C,CAAC;AACH;AAEA,SAAS,oBACP,MACA,cACA,cACA,aACkB;AAClB,QAAM,MAAM,OAAO,OAAO;AAC1B,MAAI,aAAc,QAAO,CAAC,8DAA8D,GAAG;AAC3F,MAAI,aAAc,QAAO,CAAC,8DAA8D,GAAG;AAC3F,MAAI,aAAa;AACf,WAAO;AAAA,MACL;AAAA,MACA,2BAA2B,OAAO;AAAA,IACpC;AAAA,EACF;AACA,MAAI,KAAK,KAAK,qBAAqB,qBAAqB,GAAG;AACzD,WAAO,CAAC,mEAAmE,GAAG;AAAA,EAChF;AACA,SAAO,CAAC,6DAA6D,GAAG;AAC1E;AAGA,SAAS,eACP,MACA,QACgD;AAChD,QAAM,QAAQ,KAAK,KAAK,gBAAgB,eAAe;AACvD,MAAI,MAAO,QAAO,EAAE,MAAM,OAAO,cAAc,KAAK,SAAS,OAAO,YAAY,EAAE;AAClF,QAAM,SAAS,OAAO,WAAW,CAAC,gBAAgB,eAAe,CAAC;AAClE,MAAI,WAAW,KAAM,QAAO,EAAE,MAAM,MAAM,cAAc,MAAM;AAC9D,SAAO,EAAE,MAAM,OAAO,MAAM,cAAc,OAAO,QAAQ,SAAS,YAAY,EAAE;AAClF;AAEA,SAAS,cAAc,MAAY,KAAkC;AACnE,QAAM,QAAQ;AAAA,IACZ;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACA,SAAO,CAAC,CAAC,MAAM,aAAa,KAAK,KAAK,KAAK,GAAG,KAAK,MAAM;AAC3D;AAEA,SAAS,UAAU,MAAY,QAAoB,KAAsC;AACvF,QAAM,EAAE,MAAM,cAAc,aAAa,IAAI,eAAe,MAAM,MAAM;AACxE,QAAM,cAAc,iBAAiB,QAAQ,OAAO,KAAK,UAAU;AACnE,SAAO,OAAO,cAAc,gBAAgB,cAAc,cAAc,MAAM,GAAG,CAAC,GAAG;AAAA,IACnF,MAAM,CAAC,4CAA4C,gBAAgB,cAAc;AAAA,IACjF,SAAS,oBAAoB,MAAM,cAAc,cAAc,WAAW;AAAA,EAC5E,CAAC;AACH;AAEA,SAAS,gBAAgB,MAAyB;AAChD,QAAM,OAAO,KAAK,KAAK,gBAAgB,oBAAoB,gBAAgB;AAC3E,QAAM,cAAc,KAAK,SAAS,MAAM,2BAA2B;AACnE,QAAM,eAAe,KAAK,SAAS,MAAM,6CAA6C;AACtF,SAAO,OAAO,qBAAqB,iBAAiB,WAAW,GAAG;AAAA,IAChE,MAAM,CAAC,mCAAmC,EAAE;AAAA,IAC5C,SAAS,eACL;AAAA,MACE;AAAA,MACA,GAAG,IAAI,WAAW,OAAO;AAAA,IAC3B,IACA,CAAC,yEAAyE,QAAQ,EAAE;AAAA,EAC1F,CAAC;AACH;AAEA,SAAS,iBAAiB,MAAyB;AACjD,QAAM,cACJ,KAAK,mBAAmB,2CAA2C,EAAE,SAAS;AAChF,QAAM,eAAe,KAAK,mBAAmB,qCAAqC,EAAE,SAAS;AAC7F,SAAO,OAAO,sBAAsB,kBAAkB,aAAa,YAAY,GAAG;AAAA,IAChF,MAAM,cACF,CAAC,iDAAiD,EAAE,IACpD,CAAC,0CAA0C,EAAE;AAAA,IACjD,SAAS;AAAA,MACP;AAAA,MACA;AAAA,IACF;AAAA,EACF,CAAC;AACH;AAEA,SAAS,iBAAiB,MAAyB;AACjD,QAAM,QAAQ,KAAK,mBAAmB,mBAAmB;AACzD,SAAO,OAAO,sBAAsB,iBAAiB,MAAM,MAAM,GAAG;AAAA,IAClE,MAAM,CAAC,+BAA+B,EAAE;AAAA,IACxC,MAAM;AAAA,MACJ;AAAA,MACA,GAAG,MAAM,KAAK,IAAI,CAAC,gCAAgC,eAAe;AAAA,IACpE;AAAA,EACF,CAAC;AACH;AAMA,SAAS,YAAY,MAAY,KAAsC;AACrE,QAAM,QAAQ,QAAQ,OAAO,KAAK,QAAQ,GAAG,EAAE,6BAA6B,KAAK;AAEjF,QAAM,WAAW,oBAAoB,KAAK;AAC1C,QAAM,QAAQ,KACX,WAAW,EACX,OAAO,CAAC,MAAM,iBAAiB,EAAE,MAAM,QAAQ,CAAC,EAChD,IAAI,CAAC,MAAM,EAAE,IAAI;AACpB,SAAO,OAAO,iBAAiB,iBAAiB,MAAM,MAAM,GAAG;AAAA,IAC7D,MAAM,CAAC,4CAA4C,EAAE;AAAA,IACrD,MAAM;AAAA,MACJ;AAAA,MACA,GAAG,MAAM,KAAK,IAAI,CAAC;AAAA,IACrB;AAAA,EACF,CAAC;AACH;AAEA,SAAS,WAAW,KAA+B;AACjD,QAAM,QAAQ,QAAQ,GAAG,EAAE,2BAA2B,KAAK;AAC3D,QAAM,QAAQ,wBAAwB,KAAK,KAAK;AAChD,QAAM,SAAS;AAAA,IACb,UAAU;AAAA,IACV,OAAO,QAAQ,CAAC,CAAC;AAAA,IACjB,OAAO,QAAQ,CAAC,CAAC;AAAA,IACjB,OAAO,QAAQ,CAAC,CAAC;AAAA,EACnB;AACA,SAAO,OAAO,eAAe,QAAQ;AAAA,IACnC,MAAM,CAAC,gDAAgD,KAAK;AAAA,IAC5D,MAAM,QACF;AAAA,MACE;AAAA,MACA,GAAG,KAAK;AAAA,IACV,IACA,QACE,CAAC,2CAA2C,KAAK,IACjD,CAAC,iCAAiC,EAAE;AAAA,EAC5C,CAAC;AACH;AAQA,SAAS,WACP,KACA,IACA,KACA,OACA,MACA,KACa;AACb,QAAM,QAAQ,QAAQ,GAAG,EAAE,GAAG,KAAK;AACnC,SAAO,OAAO,IAAI,MAAM,UAAU,IAAI,KAAK,GAAG;AAAA,IAC5C,MAAM,CAAC,GAAG,GAAG,wCAAwC,IAAI,IAAI,KAAK;AAAA,IAClE,MAAM;AAAA,MACJ,GAAG,GAAG,gDAAgD,IAAI;AAAA,MAC1D,GAAG,KAAK,SAAS,GAAG,QAAQ,IAAI;AAAA,IAClC;AAAA,IACA,MAAM,CAAC,GAAG,GAAG,kCAAkC,KAAK;AAAA,IACpD,MAAM,CAAC,MAAM,GAAG,qBAAqB,EAAE;AAAA,EACzC,CAAC;AACH;AAGA,SAAS,UAAU,KAA+B;AAChD,SAAO,WAAW,KAAK,cAAc,QAAQ,iBAAiB,UAAU,MAAM;AAChF;AAEA,IAAM,YAAY;AAGlB,SAAS,WAAW,KAA+B;AACjD,SAAO,WAAW,KAAK,eAAe,SAAS,kBAAkB,UAAU,SAAS;AACtF;AAGA,SAAS,cAAc,KAA+B;AACpD,SAAO,WAAW,KAAK,mBAAmB,aAAa,kBAAkB,UAAU,SAAS;AAC9F;AAEA,IAAM,YAAY;AAGlB,SAAS,cAAc,KAA+B;AACpD,SAAO,WAAW,KAAK,mBAAmB,WAAW,qBAAqB,aAAa,SAAS;AAClG;AAGA,SAAS,UAAU,MAAsB;AACvC,SAAO,KAAK,QAAQ,oBAAoB,EAAE;AAC5C;AAGA,SAAS,mBAAmB,QAAoB,KAAsC;AACpF,QAAM,OAAO,MAAM,QAAQ,GAAG,IAAI,CAAC;AACnC,QAAM,YAAY,eAAe,OAAO,CAAC,SAAS,KAAK,IAAI,CAAC;AAC5D,QAAM,SAAS,UAAU,IAAI,CAAC,SAAS,OAAO,cAAc,IAAI,CAAC;AACjE,QAAM,SAAyB,UAAU;AAAA,IAAI,CAAC,MAAM,MAClD,eAAe,KAAK,IAAI,GAAa,OAAO,CAAC,CAAW;AAAA,EAC1D;AACA,QAAM,SAAS,UAAU,OAAO,CAAC,GAAG,MAAM,OAAO,CAAC,MAAM,QAAQ;AAChE,SAAO,OAAO,wBAAwB,aAAa,MAAM,GAAG;AAAA,IAC1D,MAAM,UAAU,SACZ;AAAA,MACE;AAAA,MACA;AAAA,IACF,IACA,CAAC,8BAA8B,MAAM,4BAA4B,iBAAiB;AAAA,IACtF,MAAM;AAAA,MACJ;AAAA,MACA,UAAU,IAAI,CAAC,MAAM,MAAM,GAAG,UAAU,IAAI,CAAC,KAAK,OAAO,CAAC,CAAC,EAAE,EAAE,KAAK,IAAI;AAAA,IAC1E;AAAA,IACA,MAAM;AAAA,MACJ;AAAA,MACA,GAAG,OACA;AAAA,QACC,CAAC,SACC,GAAG,UAAU,IAAI,CAAC,eAAe,KAAK,IAAI,CAAC,YAAY,OAAO,UAAU,QAAQ,IAAI,CAAC,CAAC;AAAA,MAC1F,EACC,KAAK,IAAI,CAAC;AAAA,IACf;AAAA,EACF,CAAC;AACH;AAGO,SAAS,UAAU,QAAmC;AAC3D,QAAM,OAAO,IAAI,KAAK,MAAM;AAC5B,QAAM,MAAM,KAAK,KAAkB,cAAc;AACjD,QAAM,aAAa,KAAK,KAAK,qBAAqB,kBAAkB;AACpE,QAAM,OAAO,UAAU,MAAM,GAAG;AAChC,SAAO;AAAA,IACL,WAAW,IAAI;AAAA,IACf,WAAW,IAAI;AAAA,IACf,QAAQ,IAAI;AAAA,IACZ,UAAU,IAAI;AAAA,IACd,WAAW,IAAI;AAAA,IACf,SAAS,IAAI;AAAA,IACb,OAAO,MAAM,UAAU;AAAA,IACvB,iBAAiB,MAAM,UAAU;AAAA,IACjC,SAAS,MAAM,GAAG;AAAA,IAClB,KAAK,MAAM,GAAG;AAAA,IACd,aAAa,IAAI;AAAA,IACjB,YAAY,IAAI;AAAA,IAChB,YAAY,IAAI;AAAA,IAChB,aAAa,IAAI;AAAA,IACjB,WAAW,IAAI;AAAA,IACf,UAAU,IAAI;AAAA,IACd,cAAc,IAAI;AAAA,IAClB,UAAU,IAAI;AAAA,IACd,KAAK,IAAI;AAAA,IACT,YAAY,IAAI;AAAA,IAChB,cAAc,GAAG;AAAA,IACjB,GAAI,MAAM,CAAC,MAAM,GAAG,GAAG,SAAS,GAAG,CAAC,IAAI,CAAC;AAAA,IACzC,UAAU,MAAM,QAAQ,GAAG;AAAA,IAC3B,gBAAgB,IAAI;AAAA,IACpB,iBAAiB,IAAI;AAAA,IACrB,iBAAiB,IAAI;AAAA,IACrB,YAAY,MAAM,GAAG;AAAA,IACrB,GAAI,MACA,CAAC,WAAW,GAAG,GAAG,UAAU,GAAG,GAAG,WAAW,GAAG,GAAG,cAAc,GAAG,GAAG,cAAc,GAAG,CAAC,IACzF,CAAC;AAAA,IACL,mBAAmB,QAAQ,GAAG;AAAA,EAChC;AACF;;;ACp2BA,SAAS,oBAAoB;AAC7B,SAAS,YAAY,aAAa,oBAAoB;AACtD,SAAS,SAAS,MAAM,eAAe;AAQvC,SAAS,iBAAiB,SAAiB,KAAuB;AAChE,MAAI,CAAC,WAAW,QAAQ,SAAS,GAAG,CAAC,EAAG,QAAO,CAAC;AAChD,SAAO,YAAY,QAAQ,SAAS,GAAG,GAAG,EAAE,eAAe,KAAK,CAAC,EAAE,QAAQ,CAAC,UAAU;AACpF,UAAM,OAAO,KAAK,KAAK,MAAM,IAAI;AACjC,QAAI,MAAM,YAAY,EAAG,QAAO,SAAS,MAAM,IAAI,IAAI,iBAAiB,SAAS,IAAI,IAAI,CAAC;AAC1F,WAAO,kBAAkB,MAAM,IAAI,IAAI,CAAC,IAAI,IAAI,CAAC;AAAA,EACnD,CAAC;AACH;AAGA,SAAS,WAAW,OAAe,OAAgC;AACjE,MAAI,MAAM;AACV,QAAM,OAAO,QAAQ,GAAG;AACxB,SAAO,QAAQ,MAAM;AACnB,UAAM,MAAM,MAAM,IAAI,CAAC,SAAS,QAAQ,KAAK,IAAI,CAAC,EAAE,KAAK,CAAC,SAAS,WAAW,IAAI,CAAC;AACnF,QAAI,IAAK,QAAO;AAChB,QAAI,WAAW,QAAQ,KAAK,MAAM,CAAC,EAAG;AACtC,UAAM,QAAQ,GAAG;AAAA,EACnB;AACA,SAAO;AACT;AAGA,SAAS,UAAU,aAA6B;AAC9C,MAAI;AACF,WAAO,aAAa,OAAO,CAAC,QAAQ,aAAa,SAAS,GAAG;AAAA,MAC3D,UAAU;AAAA,MACV,OAAO,CAAC,UAAU,QAAQ,QAAQ;AAAA,IACpC,CAAC,EAAE,KAAK;AAAA,EACV,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEO,SAAS,WAAW,SAAiB,gBAAgB,WAAuB;AACjF,QAAM,OAAO,CAAC,SAAkB,WAAW,IAAI,IAAI,aAAa,MAAM,OAAO,IAAI;AACjF,SAAO;AAAA,IACL,QAAQ,CAAC,YAAY,WAAW,QAAQ,SAAS,OAAO,CAAC;AAAA,IACzD,MAAM,CAAC,YAAY,KAAK,QAAQ,SAAS,OAAO,CAAC;AAAA,IACjD,YAAY,CAAC,UAAU;AACrB,YAAM,OAAO,WAAW,SAAS,KAAK;AACtC,aAAO,SAAS,OAAO,OAAO,EAAE,MAAM,SAAS,aAAa,MAAM,OAAO,EAAE;AAAA,IAC7E;AAAA,IACA;AAAA,IACA,aAAa,CAAC,SAAS,KAAK,QAAQ,CAAC,QAAQ,iBAAiB,SAAS,GAAG,CAAC;AAAA,EAC7E;AACF;;;ACrDA,IAAM,QAAgC;AAAA,EACpC,MAAM;AAAA,EACN,MAAM;AAAA,EACN,MAAM;AAAA,EACN,SAAS;AAAA,EACT,MAAM;AACR;AAGA,IAAM,SAA+B;AAAA,EACnC,CAAC,qBAAqB,CAAC,eAAe,eAAe,WAAW,cAAc,aAAa,CAAC;AAAA,EAC5F;AAAA,IACE;AAAA,IACA,CAAC,YAAY,UAAU,qBAAqB,YAAY,QAAQ,YAAY,OAAO;AAAA,EACrF;AAAA,EACA;AAAA,IACE;AAAA,IACA,CAAC,iBAAiB,gBAAgB,gBAAgB,iBAAiB,eAAe,YAAY;AAAA,EAChG;AAAA,EACA,CAAC,qBAAqB,CAAC,kBAAkB,kBAAkB,YAAY,CAAC;AAAA,EACxE;AAAA,IACE;AAAA,IACA;AAAA,MACE;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAAA,EACA,CAAC,qBAAqB,CAAC,cAAc,eAAe,mBAAmB,iBAAiB,CAAC;AAAA,EACzF,CAAC,oBAAoB,CAAC,sBAAsB,CAAC;AAAA,EAC7C,CAAC,YAAY,CAAC,cAAc,QAAQ,cAAc,CAAC;AACrD;AAGA,SAAS,WAAW,MAAc,KAAe,SAAkC;AACjF,QAAM,QAAQ,IAAI,QAAQ,CAAC,OAAO;AAChC,UAAM,IAAI,QAAQ,KAAK,CAAC,MAAM,EAAE,OAAO,EAAE;AACzC,QAAI,CAAC,EAAG,QAAO,CAAC;AAChB,UAAM,SAAS,EAAE,SAAS,aAAa,EAAE,MAAM,YAAY;AAC3D,WAAO,CAAC,KAAK,MAAM,EAAE,MAAM,CAAC,IAAI,EAAE,KAAK,GAAG,MAAM,EAAE;AAAA,EACpD,CAAC;AACD,SAAO,CAAC,UAAU,IAAI,WAAW,GAAG,OAAO,EAAE;AAC/C;AAGA,SAAS,UAAU,UAA4B;AAC7C,QAAM,QAAQ,CAAC,MAAc,gBAAgB,UAAU,GAAG,CAAC;AAC3D,QAAM,UAAU,MAAM,MAAM;AAC5B,QAAM,WAAW,MAAM,MAAM;AAC7B,QAAM,cAAc,MAAM,SAAS;AACnC,SACE,iBAAiB,MAAM,MAAM,CAAC,IAAI,YAAY,QAAQ,CAAC,aACtD,UAAU,IAAI,aAAa,OAAO,qBAAqB,OACvD,WAAW,IAAI,aAAa,QAAQ,sBAAsB,OAC1D,cAAc,IAAI,aAAa,WAAW,yBAAyB;AAExE;AAGO,SAAS,YAAY,UAAkB,SAAiB,SAAkC;AAC/F,QAAM,WAAW,QAAQ,IAAI,CAAC,MAAM,EAAE,MAAM;AAC5C,QAAM,UACJ,gBAAgB,UAAU,QAAQ,CAAC,IAAI,IACnC,CAAC,wCAAwC,SAAS,EAAE,IACpD,CAAC;AACP,SAAO;AAAA,IACL;AAAA,IACA,wBAAwB,QAAQ;AAAA,IAChC,SAAS,OAAO;AAAA,IAChB;AAAA,IACA,GAAG,OAAO,QAAQ,CAAC,CAAC,MAAM,GAAG,MAAM,WAAW,MAAM,KAAK,OAAO,CAAC;AAAA,IACjE,UAAU,QAAQ;AAAA,IAClB;AAAA,IACA,GAAG;AAAA,EACL;AACF;;;AJlEA,IAAM,QAAQ;AAAA,EACZ;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAGO,SAAS,UAAU,MAAgB,IAAmB;AAC3D,QAAM,UAAUC,SAAQ,KAAK,CAAC,KAAK,GAAG;AACtC,MAAI,CAACC,YAAW,OAAO,GAAG;AACxB,OAAG,MAAM,6BAA6B,OAAO,EAAE;AAC/C,WAAO;AAAA,EACT;AACA,MAAI,CAACA,YAAWD,SAAQ,SAAS,cAAc,CAAC,GAAG;AACjD,OAAG,MAAM,6BAA6B,OAAO,EAAE;AAC/C,UAAM,QAAQ,CAAC,SAAS,GAAG,MAAM,IAAI,CAAC;AACtC,WAAO;AAAA,EACT;AACA,QAAM,UAAU,WAAW,GAAG,UAAU,YAAY,OAAO,CAAC;AAC5D,cAAY,SAAS,OAAO,GAAG,SAAS,OAAO,EAAE,QAAQ,CAAC,SAAS,GAAG,IAAI,IAAI,CAAC;AAC/E,SAAO,WAAW,QAAQ,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC;AAChD;;;AK3BA,QAAQ;AAAA,EACN,UAAU,QAAQ,KAAK,MAAM,CAAC,GAAG;AAAA,IAC/B,KAAK,CAAC,SAAS,QAAQ,IAAI,IAAI;AAAA,IAC/B,OAAO,CAAC,SAAS,QAAQ,MAAM,IAAI;AAAA,EACrC,CAAC;AACH;","names":["existsSync","resolve","resolve","existsSync"]}
1
+ {"version":3,"sources":["../src/doctor/cli.ts","../../utils/src/lists.ts","../src/doctor/checks.ts","../src/doctor/node-reader.ts","../src/doctor/report.ts","../src/augur-doctor.ts"],"sourcesContent":["/** augur-doctor's command line: `augur-doctor [site]` (the current directory by default). */\n\nimport { existsSync } from \"node:fs\";\nimport { basename, resolve } from \"node:path\";\nimport { runChecks, type SiteReader } from \"./checks\";\nimport { nodeReader } from \"./node-reader\";\nimport { reportLines } from \"./report\";\nimport { exitCodeOf } from \"./rules\";\n\n/** Where the CLI writes, and how it reads a site (the real file system by default). */\nexport interface CliIo {\n log: (line: string) => void;\n error: (line: string) => void;\n reader?: (siteDir: string) => SiteReader;\n}\n\nconst USAGE = [\n \"\",\n \"Usage: augur-doctor [/path/to/site]\",\n \"\",\n \"Run from a site directory, or pass the path as an argument.\",\n \"Examples:\",\n \" npx augur-doctor\",\n \" npx augur-doctor ./sites/example-site\",\n];\n\n/** Runs the doctor and returns its exit code: 1 for a missing site or any failing check. */\nexport function runDoctor(args: string[], io: CliIo): number {\n const siteDir = resolve(args[0] || \".\");\n if (!existsSync(siteDir)) {\n io.error(`Site directory not found: ${siteDir}`);\n return 1;\n }\n if (!existsSync(resolve(siteDir, \"package.json\"))) {\n io.error(`No package.json found in: ${siteDir}`);\n USAGE.forEach((line) => io.error(line));\n return 1;\n }\n const results = runChecks((io.reader ?? nodeReader)(siteDir));\n reportLines(basename(siteDir), siteDir, results).forEach((line) => io.log(line));\n return exitCodeOf(results.map((r) => r.status));\n}\n","//@ backend dafny\nimport { includesFrom } from \"./includes\";\nimport { compareFrom, endsWith } from \"./strings\";\n\n/* Pure list helpers, verified with LemmaScript → Dafny (model: models/Utils.dfy; link:\n models/links/utils-lists.dfy). */\n\n/**\n * The items from index `i` joined by `sep` (JS `xs.join(sep)` at i = 0).\n *\n * @ensures exactly the model's JoinFrom\n */\nexport function joinFrom(xs: string[], sep: string, i: number): string {\n //@ verify\n //@ type i nat\n //@ requires i >= 0\n //@ decreases xs.length - i\n //@ ensures i >= xs.length ==> \\result === \"\"\n //@ ensures i + 1 === xs.length ==> \\result === xs[i]\n //@ ensures i + 1 < xs.length ==> (\\result.length >= xs[i].length + sep.length && \\result.slice(0, xs[i].length + sep.length) === xs[i] + sep)\n if (i >= xs.length) return \"\";\n return joinRange(xs, sep, i, xs.length);\n}\n\n/**\n * The items joined by `sep`, or `fallback` when there are none (a validation issue's path in\n * augur-api: its segments joined by \".\", or \"root\"; lifted 2026-11-10).\n *\n * @ensures exactly the model's JoinOr\n */\nexport function joinOr(xs: string[], sep: string, fallback: string): string {\n //@ verify\n //@ ensures xs.length === 0 ==> \\result === fallback\n //@ ensures xs.length > 0 ==> \\result === joinFrom(xs, sep, 0)\n return xs.length === 0 ? fallback : joinFrom(xs, sep, 0);\n}\n\n/**\n * The items from `lo` up to `hi` (at least one) joined by `sep`, by halves: a list of n items\n * recurses log n deep, so a generated file of many thousand lines fits the stack.\n *\n * @ensures = the model's JoinFrom(xs[..hi], sep, lo) (links/utils-lists.dfy, by JoinFromSplits)\n */\nfunction joinRange(xs: string[], sep: string, lo: number, hi: number): string {\n //@ verify\n //@ type lo nat\n //@ type hi nat\n //@ requires lo < hi && hi <= xs.length\n //@ decreases hi - lo\n //@ ensures hi === lo + 1 ==> \\result === xs[lo]\n if (hi - lo === 1) return xs[lo] as string;\n const mid = lo + Math.floor((hi - lo) / 2);\n return joinRange(xs, sep, lo, mid) + sep + joinRange(xs, sep, mid, hi);\n}\n\n/**\n * The first index ≥ `i` holding `x`, or -1 (JS `xs.indexOf(x, i)`): how a table of parallel\n * lists is read.\n *\n * @ensures result = -1 ∨ (i ≤ result < |xs| ∧ xs[result] = x) — and the first such index: the\n * model's ItemIndexFrom (links/utils-lists.dfy)\n */\nexport function itemIndexFrom(xs: string[], x: string, i: number): number {\n //@ verify\n //@ type i nat\n //@ requires i >= 0\n //@ decreases xs.length - i\n //@ ensures \\result === -1 || (i <= \\result && \\result < xs.length && xs[\\result] === x)\n //@ ensures \\result === -1 ==> forall(k: nat, (i <= k && k < xs.length) ==> xs[k] !== x)\n //@ ensures \\result >= 0 ==> forall(k: nat, (i <= k && k < \\result) ==> xs[k] !== x)\n if (i >= xs.length) return -1;\n return (xs[i] as string) === x ? i : itemIndexFrom(xs, x, i + 1);\n}\n\n/**\n * The sum of `xs[i..]`, 0 past the end (JS `xs.slice(i).reduce((a, b) => a + b, 0)`).\n *\n * @ensures result = Σ xs[i..] — exactly the model's SumFrom\n */\nexport function sumFrom(xs: number[], i: number): number {\n //@ verify\n //@ type i nat\n //@ requires i >= 0\n //@ decreases xs.length - i\n //@ ensures \\result === (i >= xs.length ? 0 : xs[i] + sumFrom(xs, i + 1))\n if (i >= xs.length) return 0;\n return (xs[i] as number) + sumFrom(xs, i + 1);\n}\n\n/**\n * Whether `x` is one of `xs` from index `i` on (JS `xs.includes(x)` at i = 0).\n *\n * @ensures result ⟺ ∃ k. i ≤ k < |xs| ∧ xs[k] = x — exactly the model's HasItemFrom\n */\nexport function hasItemFrom(xs: string[], x: string, i: number): boolean {\n //@ verify\n //@ type i nat\n //@ requires i >= 0 && i <= xs.length\n //@ decreases xs.length - i\n //@ ensures \\result <==> exists(k: nat, i <= k && k < xs.length && xs[k] === x)\n // `===`, not `>=`: past the end xs[i] is undefined, never x, so `>=` vs `>` is equivalent\n if (i === xs.length) return false;\n if ((xs[i] as string) === x) return true;\n return hasItemFrom(xs, x, i + 1);\n}\n\n/**\n * Whether the number `x` is one of `xs` from index `i` on (JS `xs.includes(x)` at i = 0, for\n * numbers).\n *\n * @ensures result ⟺ ∃ k. i ≤ k < |xs| ∧ xs[k] = x — exactly the model's HasNumberFrom\n */\nexport function hasNumberFrom(xs: number[], x: number, i: number): boolean {\n //@ verify\n //@ type i nat\n //@ requires i >= 0 && i <= xs.length\n //@ decreases xs.length - i\n //@ ensures \\result <==> exists(k: nat, i <= k && k < xs.length && xs[k] === x)\n if (i === xs.length) return false;\n if ((xs[i] as number) === x) return true;\n return hasNumberFrom(xs, x, i + 1);\n}\n\n/**\n * Whether `s` ends with one of `xs` from index `i` on (a regex `(a|b|…)$` at i = 0).\n *\n * @ensures exactly the model's EndsWithAnyFrom\n */\nexport function endsWithAnyFrom(s: string, xs: string[], i: number): boolean {\n //@ verify\n //@ type i nat\n //@ requires i >= 0 && i <= xs.length\n //@ decreases xs.length - i\n //@ ensures \\result <==> exists(k: nat, i <= k && k < xs.length && endsWith(s, xs[k]))\n if (i === xs.length) return false;\n if (endsWith(s, xs[i] as string)) return true;\n return endsWithAnyFrom(s, xs, i + 1);\n}\n\n/**\n * Whether one of `xs` from index `i` on occurs in `s` (a regex `(a|b|…)` at i = 0).\n *\n * @ensures exactly the model's IncludesAnyFrom\n */\nexport function includesAnyFrom(s: string, xs: string[], i: number): boolean {\n //@ verify\n //@ type i nat\n //@ requires i >= 0 && i <= xs.length\n //@ decreases xs.length - i\n //@ ensures \\result <==> exists(k: nat, i <= k && k < xs.length && includesFrom(s, xs[k], 0))\n if (i === xs.length) return false;\n if (includesFrom(s, xs[i] as string, 0)) return true;\n return includesAnyFrom(s, xs, i + 1);\n}\n\n/**\n * The items of `xs` from index `i` that `allowed` doesn't hold, in order (JS\n * `xs.filter((x) => !allowed.includes(x))` at i = 0).\n *\n * @ensures exactly the model's NotInFrom (NotInFromIsTheUnknown: the unknown ones, all of them)\n */\nexport function notInFrom(xs: string[], allowed: string[], i: number): string[] {\n //@ verify\n //@ type i nat\n //@ requires i >= 0\n //@ decreases xs.length - i\n //@ ensures i >= xs.length ==> \\result.length === 0\n if (i >= xs.length) return [];\n const rest = notInFrom(xs, allowed, i + 1);\n return hasItemFrom(allowed, xs[i] as string, 0) ? rest : [xs[i] as string, ...rest];\n}\n\n/**\n * Whether `x` is one of the first `k` items of `xs` (JS `xs.slice(0, k).includes(x)`).\n *\n * @ensures result ⟺ ∃ j < k. xs[j] = x — exactly the model's HasItemBelow\n */\nexport function hasItemBelow(xs: string[], x: string, k: number): boolean {\n //@ verify\n //@ type k nat\n //@ requires k >= 0 && k <= xs.length\n //@ decreases k\n //@ ensures \\result <==> exists(j: nat, j < k && xs[j] === x)\n if (k === 0) return false;\n if ((xs[k - 1] as string) === x) return true;\n return hasItemBelow(xs, x, k - 1);\n}\n\n/**\n * The items of `xs` from index `i` that repeat an earlier item, in order (at i = 0, every\n * duplicate after its first; none ⟺ the items are unique).\n *\n * @ensures exactly the model's RepeatsFrom (RepeatsFromEmpty: none exactly when unique)\n */\nexport function repeatsFrom(xs: string[], i: number): string[] {\n //@ verify\n //@ type i nat\n //@ requires i >= 0\n //@ decreases xs.length - i\n //@ ensures i >= xs.length ==> \\result.length === 0\n if (i >= xs.length) return [];\n const rest = repeatsFrom(xs, i + 1);\n return hasItemBelow(xs, xs[i] as string, i) ? [xs[i] as string, ...rest] : rest;\n}\n\n/**\n * The items of `xs` from index `i` that no earlier item repeats, in order (at i = 0, JS\n * `[...new Set(xs)]`: each item once, first occurrence kept).\n *\n * @ensures exactly the model's FirstsFrom\n */\nexport function firstsFrom(xs: string[], i: number): string[] {\n //@ verify\n //@ type i nat\n //@ requires i >= 0\n //@ decreases xs.length - i\n //@ ensures i >= xs.length ==> \\result.length === 0\n //@ ensures forall(j: nat, forall(k: nat, (j < k && k < \\result.length) ==> \\result[j] !== \\result[k]))\n if (i >= xs.length) return [];\n const rest = firstsFrom(xs, i + 1);\n return hasItemBelow(xs, xs[i] as string, i) ? rest : [xs[i] as string, ...rest];\n}\n\n/**\n * At most the first `n` items (JS `xs.slice(0, n)` for n ≥ 0).\n *\n * @ensures exactly the model's TakeAtMost\n */\nexport function takeAtMost(xs: string[], n: number): string[] {\n //@ verify\n //@ type n nat\n //@ requires n >= 0\n //@ ensures \\result === (n < xs.length ? xs.slice(0, n) : xs)\n return n < xs.length ? xs.slice(0, n) : xs;\n}\n\n/**\n * Whether two number lists are equal from index `i` on (the whole lists at i = 0).\n *\n * @ensures result ⟺ |a| = |b| ∧ ∀ k ∈ [i, |a|). a[k] = b[k] — exactly the model's\n * SameNumbersFrom\n */\nexport function sameNumbersFrom(a: number[], b: number[], i: number): boolean {\n //@ verify\n //@ type i nat\n //@ requires i >= 0 && i <= a.length\n //@ decreases a.length - i\n //@ ensures \\result <==> (a.length === b.length && forall(k: nat, i <= k && k < a.length ==> a[k] === b[k]))\n if (a.length !== b.length) return false;\n if (i === a.length) return true;\n return (a[i] as number) === (b[i] as number) && sameNumbersFrom(a, b, i + 1);\n}\n\n/**\n * Whether two text lists are equal from index `i` on (the whole lists at i = 0, as their\n * `JSON.stringify` texts compare).\n *\n * @ensures result ⟺ |a| = |b| ∧ ∀ k ∈ [i, |a|). a[k] = b[k] — exactly the model's\n * SameTextsFrom\n */\nexport function sameTextsFrom(a: string[], b: string[], i: number): boolean {\n //@ verify\n //@ type i nat\n //@ requires i >= 0 && i <= a.length\n //@ decreases a.length - i\n //@ ensures \\result <==> (a.length === b.length && forall(k: nat, i <= k && k < a.length ==> a[k] === b[k]))\n if (a.length !== b.length) return false;\n if (i === a.length) return true;\n return (a[i] as string) === (b[i] as string) && sameTextsFrom(a, b, i + 1);\n}\n\n/**\n * The texts in code-unit order (JS's default `sort`, stable: of two equal texts the earlier\n * stays first).\n *\n * @ensures exactly the model's SortedTexts (in the link); the same length\n */\nexport function sortedTexts(xs: string[]): string[] {\n //@ verify\n //@ ensures \\result.length === xs.length\n if (xs.length === 0) return [];\n return insertText(xs[0] as string, sortedTexts(xs.slice(1)));\n}\n\n/**\n * `x` placed into sorted texts before the first it doesn't sort after.\n *\n * @ensures exactly the model's InsertText (in the link); one longer\n */\nexport function insertText(x: string, sorted: string[]): string[] {\n //@ verify\n //@ ensures \\result.length === sorted.length + 1\n if (sorted.length === 0) return [x];\n const first = sorted[0] as string;\n if (compareFrom(x, first, 0) <= 0) return [x, ...sorted];\n return [first, ...insertText(x, sorted.slice(1))];\n}\n","/**\n * augur-doctor's checks: each reads facts from the site through a {@link SiteReader} and takes\n * its outcome from the proved rules (rules.ts). Labels and details are the original\n * bin/augur-doctor.mjs text, except the version checks (no lockstep, owner 2026-11-05).\n */\n\nimport { firstsFrom } from \"@atlas/utils/lists\";\nimport {\n actionsStatus,\n apiVersionStatus,\n augurApiFloorStatus,\n authStatus,\n contractTestsStatus,\n conventionPath,\n deprecatedStatus,\n fileUses,\n gcTimeOffenderIn,\n headersStatus,\n iconsStatus,\n imageLoaderStatus,\n ioredisStatus,\n knipStatus,\n latestStatus,\n localHooksStatus,\n middlewareStatus,\n nextExternalStatus,\n nextFloorStatus,\n noOffenderStatus,\n noWrapperStatus,\n optimizeStatus,\n packageStateOf,\n preCommitStatus,\n presetStatus,\n proxyFailDetail,\n proxyWarnDetail,\n qualityStatus,\n reactFloorStatus,\n serverQueryStatus,\n siteHooksStatus,\n strictStatus,\n tailwindStatus,\n tsconfigStatus,\n utilsRangeBeforeFix,\n type NextFacts,\n type PackageState,\n type Status,\n} from \"./rules\";\n\n/** What the checks may ask of a site. Paths are relative to the site directory. */\nexport interface SiteReader {\n /** Whether the path exists. */\n exists(relPath: string): boolean;\n /** The file's text, or null when it is missing. */\n read(relPath: string): string | null;\n /** The first of these names found walking up from the site to its git root: its path and text. */\n readUpward(names: string[]): { path: string; content: string } | null;\n /** The package's latest published version, or \"\" when npm cannot say. */\n latestVersion(packageName: string): string;\n /** The `.ts`/`.tsx` files under these folders, recursively, `node_modules` skipped ([] for a missing one). */\n sourceFiles(dirs: string[]): string[];\n}\n\n/** One line of the scorecard. */\nexport interface CheckResult {\n status: Status;\n id: string;\n label: string;\n detail: string;\n}\n\ntype Deps = Record<string, string | undefined>;\n\n/** The parts of a site's package.json the checks read. */\ninterface PackageJson {\n dependencies?: Deps;\n devDependencies?: Deps;\n scripts?: Record<string, string | undefined>;\n prettier?: unknown;\n \"lint-staged\"?: unknown;\n}\n\n/** Files where proxy pattern wiring commonly lives across different site layouts. */\nconst PROXY_FILES = [\n \"lib/augur-query.ts\",\n \"src/lib/augur-query.ts\",\n \"lib/augur.ts\",\n \"src/lib/augur.ts\",\n \"lib/augur-options.ts\",\n \"src/lib/augur-options.ts\",\n \"app/providers.tsx\",\n \"src/app/providers.tsx\",\n \"app/context/ReactQueryProvider.tsx\",\n \"src/app/context/ReactQueryProvider.tsx\",\n];\n\nconst PROXY_PATTERN = /createServerQueryProxy|queryAction|createAugurOptions|registerQueryAction/;\nconst MODULE_SCOPE_CLIENT = /^(?:export\\s+)?(?:const|let|var)\\s+\\w+\\s*=\\s*new QueryClient\\(/m;\n// query-gc-time's scans (a finite gcTime, a CACHE_CONFIG spread, the range's version) are the\n// proved rules.ts `gcTimeOffenderIn` and `utilsRangeBeforeFix` (#94).\n/** Where query options are written besides the proxy files (#94). */\nconst QUERY_SOURCE_DIRS = [\"hooks\", \"app\", \"src/hooks\", \"src/app\"];\n\n/** The augur packages a site may install; each is checked against its own latest. */\nexport const AUGUR_PACKAGES = [\n \"@simpleapps-com/augur-config\",\n \"@simpleapps-com/augur-core\",\n \"@simpleapps-com/augur-hooks\",\n \"@simpleapps-com/augur-mobile\",\n \"@simpleapps-com/augur-server\",\n \"@simpleapps-com/augur-tailwind\",\n \"@simpleapps-com/augur-utils\",\n \"@simpleapps-com/augur-web\",\n];\n\n/** The migration runbook on augur.build, which the scorecard and the checks' details link to. */\nexport const RUNBOOK = \"https://augur.build/docs/packages/migration-runbook\";\nconst GETTING_STARTED = \"https://augur.build/docs/packages/getting-started\";\n\n/**\n * A check's result for a status, with a label (and detail) per status. Each check lists every\n * status its rule can return (rules.ts and its ensures), so the lookup always finds one.\n */\nfunction result(\n id: string,\n status: Status,\n labels: Partial<Record<Status, [string, string]>>,\n): CheckResult {\n const [label, detail] = labels[status]!;\n return { status, id, label, detail };\n}\n\n/** The reads every check shares. */\nclass Site {\n constructor(private readonly reader: SiteReader) {}\n\n find(...candidates: string[]): string | null {\n return candidates.find((c) => this.reader.exists(c)) ?? null;\n }\n\n read(relPath: string): string | null {\n return this.reader.read(relPath);\n }\n\n contains(relPath: string | null, pattern: string | RegExp): boolean {\n const content = relPath === null ? null : this.reader.read(relPath);\n if (!content) return false;\n return typeof pattern === \"string\" ? content.includes(pattern) : pattern.test(content);\n }\n\n json<T>(relPath: string): T | null {\n const content = this.reader.read(relPath);\n if (!content) return null;\n try {\n return JSON.parse(content) as T;\n } catch {\n return null;\n }\n }\n\n /** The proxy files that exist and match the pattern. */\n proxyFilesMatching(pattern: RegExp): string[] {\n return PROXY_FILES.filter((f) => this.contains(f, pattern));\n }\n\n /** The proxy files, then the query source folders' files, each once, in that order. */\n queryFiles(): { path: string; text: string }[] {\n const paths = firstsFrom([...PROXY_FILES, ...this.reader.sourceFiles(QUERY_SOURCE_DIRS)], 0);\n return paths.flatMap((path) => {\n const text = this.reader.read(path);\n return text === null ? [] : [{ path, text }];\n });\n }\n}\n\nfunction siteConfig(site: Site): CheckResult {\n const file = site.find(\n \"lib/augur-config.ts\",\n \"src/lib/augur-config.ts\",\n \"config/augur-config.ts\",\n );\n return result(\"site-config\", fileUses(file !== null, site.contains(file, \"defineSite\")), {\n PASS: [\"augur-config.ts with defineSite()\", file ?? \"\"],\n WARN: [\"augur-config.ts exists but does not use defineSite()\", file ?? \"\"],\n FAIL: [\"augur-config.ts with defineSite()\", \"Expected lib/augur-config.ts\"],\n });\n}\n\nfunction serverSite(site: Site): CheckResult {\n const file = site.find(\"lib/augur-site.ts\", \"src/lib/augur-site.ts\", \"config/augur-site.ts\");\n return result(\"server-site\", fileUses(file !== null, site.contains(file, \"createServerSite\")), {\n PASS: [\"augur-site.ts using createServerSite()\", file ?? \"\"],\n WARN: [\"augur-site.ts exists but does not use createServerSite()\", file ?? \"\"],\n FAIL: [\"augur-site.ts using createServerSite()\", \"Expected lib/augur-site.ts\"],\n });\n}\n\nfunction actions(site: Site): CheckResult {\n const file = site.find(\"lib/augur-actions.ts\", \"src/lib/augur-actions.ts\", \"lib/actions.ts\");\n const reExports = site.contains(file, /site\\.actions|actions\\./);\n const usesProxy = site.proxyFilesMatching(PROXY_PATTERN).length > 0;\n const status = actionsStatus(file !== null, reExports, usesProxy);\n return result(\"actions\", status, {\n PASS: file\n ? [\"augur-actions.ts re-exporting site.actions\", file]\n : [\"Using proxy pattern (augur-actions.ts not needed)\", \"\"],\n WARN: [\"augur-actions.ts exists but may not re-export site.actions\", file ?? \"\"],\n FAIL: [\n \"augur-actions.ts re-exporting site.actions.*\",\n \"Expected lib/augur-actions.ts or createServerQueryProxy usage\",\n ],\n });\n}\n\nfunction siteHooks(site: Site): CheckResult {\n const file = site.find(\n \"lib/augur.ts\",\n \"src/lib/augur.ts\",\n \"lib/augur-hooks.ts\",\n \"src/lib/augur-hooks.ts\",\n );\n const createSiteHooks = site.contains(file, \"createSiteHooks\");\n const status = siteHooksStatus(\n file !== null,\n createSiteHooks,\n site.contains(file, /AugurHooksProvider|augur-hooks/),\n );\n return result(\"site-hooks\", status, {\n PASS: [\n createSiteHooks ? \"augur.ts with createSiteHooks()\" : \"augur.ts with hooks setup\",\n file ?? \"\",\n ],\n WARN: [\"augur.ts exists but does not use createSiteHooks()\", file ?? \"\"],\n FAIL: [\"augur.ts with createSiteHooks()\", \"Expected lib/augur.ts\"],\n });\n}\n\nfunction ssrOptions(site: Site): CheckResult {\n const file = site.find(\"lib/augur-options.ts\", \"src/lib/augur-options.ts\");\n return result(\"ssr-options\", fileUses(file !== null, site.contains(file, /Options/)), {\n PASS: [\"augur-options.ts for SSR prefetching\", file ?? \"\"],\n WARN: [\"augur-options.ts exists but may not export options\", file ?? \"\"],\n FAIL: [\"augur-options.ts for SSR prefetching\", \"Expected lib/augur-options.ts\"],\n });\n}\n\nfunction tsconfig(site: Site): CheckResult {\n const config = site.json<{ extends?: string }>(\"tsconfig.json\");\n const extendsVal = config?.extends || \"\";\n const status = tsconfigStatus(\n config !== null,\n extendsVal.includes(\"augur-config/tsconfig/next\"),\n extendsVal.includes(\"augur-config\"),\n );\n return result(\"tsconfig\", status, {\n PASS: [\"tsconfig.json extends augur-config/tsconfig/next\", \"\"],\n WARN: [\"tsconfig.json extends augur-config but not /tsconfig/next\", `extends: ${extendsVal}`],\n FAIL: config\n ? [\n \"tsconfig.json extends augur-config/tsconfig/next\",\n extendsVal ? `extends: ${extendsVal}` : \"No extends field\",\n ]\n : [\"tsconfig.json exists\", \"File not found\"],\n });\n}\n\nfunction eslintFailDetail(site: Site, file: string | null): [string, string] {\n if (file) {\n return [\n \"eslint.config.mjs uses augur-config/eslint/next\",\n \"Config exists but does not import augur-config/eslint\",\n ];\n }\n if (site.find(\".eslintrc.json\", \".eslintrc.js\", \".eslintrc\", \".eslintrc.cjs\")) {\n return [\n \"eslint.config.mjs uses augur-config/eslint/next\",\n \"Site uses legacy .eslintrc format -- migrate to eslint.config.mjs\",\n ];\n }\n return [\"eslint.config.mjs exists\", \"No ESLint config found\"];\n}\n\nfunction eslint(site: Site, file: string | null): CheckResult {\n return result(\"eslint\", presetStatus(file !== null, site.contains(file, \"augur-config/eslint\")), {\n PASS: [\"eslint.config.mjs uses augur-config/eslint/next\", file ?? \"\"],\n FAIL: eslintFailDetail(site, file),\n });\n}\n\nfunction eslintDeprecated(site: Site, file: string | null): CheckResult {\n const status = deprecatedStatus(\n file !== null,\n site.contains(file, /no-deprecated[\"']?\\s*:\\s*[\"'](error|warn)[\"']/),\n site.contains(file, \"no-deprecated\"),\n );\n return result(\"eslint-deprecated\", status, {\n SKIP: [\"ESLint: no-deprecated rule\", \"No ESLint config found\"],\n PASS: [\"ESLint: no-deprecated rule enabled\", \"\"],\n WARN: [\n \"ESLint: no-deprecated found but may not be warn/error\",\n \"Set @typescript-eslint/no-deprecated to warn or error\",\n ],\n FAIL: [\n \"ESLint: @typescript-eslint/no-deprecated rule\",\n 'Add \"@typescript-eslint/no-deprecated\": \"warn\" to eslint.config.mjs rules',\n ],\n });\n}\n\nfunction prettierFailDetail(\n site: Site,\n file: string | null,\n pkg: PackageJson | null,\n): [string, string] {\n const label = \"Prettier uses augur-config/prettier preset\";\n if (file) return [label, \"Config exists but does not import augur-config/prettier\"];\n if (pkg?.prettier) {\n return [label, \"Prettier config is inline in package.json -- move to prettier.config.mjs\"];\n }\n if (site.find(\".prettierrc\", \".prettierrc.json\", \".prettierrc.yaml\")) {\n return [\n label,\n \"Site uses static prettier config -- migrate to prettier.config.mjs with augur-config/prettier\",\n ];\n }\n return [\"Prettier config exists\", \"No Prettier config found\"];\n}\n\nfunction prettier(site: Site, pkg: PackageJson | null): CheckResult {\n const file = site.find(\n \"prettier.config.mjs\",\n \"prettier.config.js\",\n \".prettierrc.mjs\",\n \".prettierrc.js\",\n );\n return result(\n \"prettier\",\n presetStatus(file !== null, site.contains(file, \"augur-config/prettier\")),\n {\n PASS: [\"Prettier uses augur-config/prettier preset\", file ?? \"\"],\n FAIL: prettierFailDetail(site, file, pkg),\n },\n );\n}\n\nfunction knip(site: Site, pkg: PackageJson | null): CheckResult {\n const config = site.find(\n \"knip.json\",\n \"knip.jsonc\",\n \"knip.ts\",\n \"knip.config.ts\",\n \"knip.config.js\",\n );\n return result(\"knip\", knipStatus(config !== null, hasDep(pkg, \"knip\")), {\n PASS: [\"Knip configured for dead code detection\", config ?? \"\"],\n WARN: [\n \"Knip installed but no config file found\",\n \"Add knip.json or knip.ts -- see https://knip.dev/overview/configuration\",\n ],\n FAIL: config\n ? [\n \"Knip for dead code detection\",\n \"Config exists but knip not in devDependencies -- run pnpm add -D knip\",\n ]\n : [\n \"Knip for dead code detection\",\n \"Add knip to devDependencies and create knip.json -- see https://knip.dev\",\n ],\n });\n}\n\n/** Whether package.json lists the package in its dependencies or devDependencies. */\nfunction hasDep(pkg: PackageJson | null, name: string): boolean {\n return !!(pkg?.dependencies?.[name] || pkg?.devDependencies?.[name]);\n}\n\n/** The text holds every one of the strings. */\nfunction includesAll(text: string, parts: string[]): boolean {\n return parts.every((part) => text.includes(part));\n}\n\n/** What next.config (and package.json's ioredis) tell the Next.js checks. */\nfunction nextFacts(site: Site, pkg: PackageJson | null): NextFacts {\n const file = site.find(\"next.config.ts\", \"next.config.mjs\", \"next.config.js\");\n const text = (file === null ? null : site.read(file)) ?? \"\";\n return {\n hasConfig: file !== null,\n hasExternal: text.includes(\"serverExternalPackages\"),\n externalHasServer: text.includes(\"augur-server\"),\n usesIoredis: hasDep(pkg, \"ioredis\"),\n externalHasIoredis: text.includes(\"ioredis\"),\n hasAllHeaders: includesAll(text, [\n \"Strict-Transport-Security\",\n \"X-Content-Type-Options\",\n \"Permissions-Policy\",\n ]),\n hasHeaders: text.includes(\"headers\"),\n hasOptimize: text.includes(\"optimizePackageImports\"),\n hasStrict: text.includes(\"reactStrictMode\"),\n hasAgrMedia: /agr\\.media|agrMedia/.test(text),\n hasImages: text.includes(\"images\"),\n };\n}\n\nfunction nextExternal(n: NextFacts): CheckResult {\n return result(\"next-external\", nextExternalStatus(n), {\n PASS: [\"next.config: serverExternalPackages correct\", \"\"],\n WARN: [\n \"next.config: no serverExternalPackages found\",\n \"Add serverExternalPackages for native Node modules\",\n ],\n FAIL: n.hasConfig\n ? [\n \"next.config: augur-server NOT in serverExternalPackages\",\n \"augur-server must be bundled, not externalized\",\n ]\n : [\"next.config exists\", \"No next.config found\"],\n });\n}\n\nfunction ioredisSkipDetail(n: NextFacts): string {\n if (!n.hasConfig) return \"No next.config\";\n if (!n.hasExternal) return \"No serverExternalPackages\";\n return \"Site does not use ioredis\";\n}\n\nfunction nextIoredis(n: NextFacts): CheckResult {\n return result(\"next-ioredis\", ioredisStatus(n), {\n SKIP: [\"next.config: ioredis check\", ioredisSkipDetail(n)],\n PASS: [\"next.config: ioredis in serverExternalPackages\", \"\"],\n WARN: [\n \"next.config: ioredis should be in serverExternalPackages\",\n \"Site uses ioredis but it is not externalized\",\n ],\n });\n}\n\nfunction nextHeaders(n: NextFacts): CheckResult {\n return result(\"next-headers\", headersStatus(n), {\n PASS: [\"next.config: security headers\", \"\"],\n WARN: [\n \"next.config: security headers incomplete\",\n \"Missing HSTS, X-Content-Type-Options, or Permissions-Policy\",\n ],\n FAIL: [\n \"next.config: security headers\",\n n.hasConfig ? \"No headers() function found\" : \"No next.config\",\n ],\n });\n}\n\nfunction nextOptimize(n: NextFacts): CheckResult {\n return result(\"next-optimize\", optimizeStatus(n), {\n PASS: [\"next.config: optimizePackageImports\", \"\"],\n FAIL: [\n \"next.config: optimizePackageImports\",\n n.hasConfig ? \"Add experimental.optimizePackageImports for augur packages\" : \"No next.config\",\n ],\n });\n}\n\nfunction nextStrict(n: NextFacts): CheckResult {\n return result(\"next-strict\", strictStatus(n), {\n SKIP: [\"next.config: reactStrictMode\", \"No next.config\"],\n PASS: [\"next.config: reactStrictMode\", \"\"],\n WARN: [\"next.config: reactStrictMode not set\", \"Recommended for development error detection\"],\n });\n}\n\nconst PROXY_FIX = `${RUNBOOK}#proxy-file`;\n\n/** next-proxy (atlas#88): Next.js 16 renamed `middleware` to `proxy`; both files break the build. */\nfunction nextProxy(site: Site): CheckResult {\n const middleware = site.find(\n conventionPath(\"middleware\", false, false),\n conventionPath(\"middleware\", false, true),\n conventionPath(\"middleware\", true, false),\n conventionPath(\"middleware\", true, true),\n );\n const proxy = site.find(\n conventionPath(\"proxy\", false, false),\n conventionPath(\"proxy\", false, true),\n conventionPath(\"proxy\", true, false),\n conventionPath(\"proxy\", true, true),\n );\n return result(\"next-proxy\", middlewareStatus(middleware !== null, proxy !== null), {\n PASS: [\"proxy file convention\", proxy ?? \"\"],\n WARN: [\n \"middleware is deprecated in Next.js 16: rename it to proxy\",\n proxyWarnDetail(middleware ?? \"\", PROXY_FIX),\n ],\n FAIL: [\n \"Both middleware and proxy files: Next.js 16 will not build\",\n proxyFailDetail(middleware ?? \"\", proxy ?? \"\", PROXY_FIX),\n ],\n SKIP: [\"Middleware/proxy file convention\", \"No middleware or proxy file\"],\n });\n}\n\nfunction imageLoader(n: NextFacts): CheckResult {\n return result(\"image-loader\", imageLoaderStatus(n), {\n SKIP: [\"Image loader check\", \"No next.config\"],\n PASS: [\"Image loader for agr.media CDN\", \"\"],\n WARN: n.hasImages\n ? [\n \"next.config has images config but no agr.media\",\n \"Add agr.media to remotePatterns if site has product images\",\n ]\n : [\"No image configuration found\", \"Add agr.media CDN to next.config images.remotePatterns\"],\n });\n}\n\nfunction contractTests(site: Site): CheckResult {\n const present =\n site.find(\n \"__tests__/sdk-contracts\",\n \"src/__tests__/sdk-contracts\",\n \"__tests__/sdk-contract.test.ts\",\n \"src/__tests__/sdk-contract.test.ts\",\n ) !== null;\n return result(\"contract-tests\", contractTestsStatus(present), {\n PASS: [\"SDK contract tests present\", \"\"],\n FAIL: [\"SDK contract tests in __tests__/sdk-contracts/\", \"No contract tests found\"],\n });\n}\n\nfunction noWrapper(site: Site): CheckResult {\n const file = site.find(\n \"lib/augur-client.ts\",\n \"src/lib/augur-client.ts\",\n \"lib/augurClient.ts\",\n \"src/lib/augurClient.ts\",\n );\n const wraps = site.contains(file, \"class AugurClient\") || site.contains(file, \"extends AugurAPI\");\n const hasLib = site.find(\"lib\", \"src/lib\") !== null;\n return result(\"no-wrapper\", noWrapperStatus(hasLib, wraps), {\n SKIP: [\"No custom AugurClient wrapper\", \"No lib/ directory\"],\n PASS: [\"No custom AugurClient wrapper\", file ? \"Uses augur-api directly\" : \"\"],\n FAIL: [\"No custom AugurClient wrapper\", `${file} wraps AugurAPI -- use augur-api directly`],\n });\n}\n\nfunction auth(site: Site): CheckResult {\n const file = site.find(\"auth.ts\", \"lib/auth.ts\", \"src/lib/auth.ts\", \"src/auth.ts\");\n const usesFactory =\n site.contains(file, \"site.auth\") ||\n site.contains(file, \"createAuthConfig\") ||\n site.contains(file, \"createServerSite\");\n const status = authStatus(file !== null, usesFactory, site.contains(file, \"NextAuth\"));\n return result(\"auth\", status, {\n PASS: [\"Auth uses createAuthConfig or site.auth\", file ?? \"\"],\n FAIL: [\n \"Auth uses createAuthConfig or site.auth\",\n `${file} uses raw NextAuth -- migrate to createAuthConfig()`,\n ],\n WARN: file\n ? [\"Auth pattern unclear\", file]\n : [\"No auth.ts found\", \"Expected auth.ts or lib/auth.ts\"],\n });\n}\n\nfunction qualityScript(pkg: PackageJson | null): CheckResult {\n const quality = pkg?.scripts?.[\"quality\"];\n const complete =\n !!quality &&\n quality.includes(\"typecheck\") &&\n quality.includes(\"lint\") &&\n quality.includes(\"test\");\n return result(\"quality-script\", qualityStatus(!!quality, complete), {\n PASS: [\"quality script: typecheck + lint + test\", \"\"],\n WARN: [\"quality script exists but may be incomplete\", `\"quality\": \"${quality}\"`],\n FAIL: [\n \"quality script in package.json\",\n 'Add \"quality\": \"pnpm typecheck && pnpm lint && pnpm test\"',\n ],\n });\n}\n\nfunction allDeps(pkg: PackageJson): Deps {\n return { ...pkg.dependencies, ...pkg.devDependencies };\n}\n\nfunction icons(pkg: PackageJson): CheckResult {\n const deps = allDeps(pkg);\n const heroicons = !!deps[\"@heroicons/react\"];\n const status = iconsStatus(!!deps[\"react-icons\"], heroicons, !!deps[\"lucide-react\"]);\n return result(\"icons\", status, {\n PASS: [\"Uses react-icons (platform standard)\", \"\"],\n FAIL: [\n \"Uses react-icons (platform standard)\",\n heroicons\n ? \"Site uses @heroicons/react -- migrate to react-icons/lu\"\n : \"Site uses lucide-react -- migrate to react-icons/lu\",\n ],\n WARN: [\"No icon library found\", \"Expected react-icons\"],\n });\n}\n\nfunction tailwind(pkg: PackageJson): CheckResult {\n const range = allDeps(pkg)[\"tailwindcss\"] || \"\";\n return result(\"tailwind\", tailwindStatus(range), {\n PASS: [\"Tailwind v4 (platform standard)\", \"\"],\n FAIL: [\"Tailwind v4\", `Found tailwindcss: ${range} -- upgrade to ^4.0.0`],\n WARN: range\n ? [\"Tailwind version unclear\", `tailwindcss: ${range}`]\n : [\"No tailwindcss dependency found\", \"\"],\n });\n}\n\nfunction preCommitSuggestion(\n site: Site,\n lefthookFile: string | null,\n hasPreCommit: boolean,\n hasLefthook: boolean,\n): [string, string] {\n const see = `See ${RUNBOOK}#pre-commit-hooks`;\n if (hasPreCommit) return [\"Pre-commit hooks: lefthook found but no lint-staged config\", see];\n if (lefthookFile) return [\"Pre-commit hooks: lefthook found but no pre-commit section\", see];\n if (hasLefthook) {\n return [\n \"Pre-commit hooks: lefthook in devDependencies but no config file\",\n `Add lefthook.yml -- see ${RUNBOOK}#pre-commit-hooks`,\n ];\n }\n if (site.find(\".husky/pre-commit\", \".husky/_/pre-commit\")) {\n return [\"Pre-commit hooks: husky found -- consider switching to lefthook\", see];\n }\n return [\"No pre-commit hooks found -- recommended for code quality\", see];\n}\n\n/** The site's own lefthook config, else one in a parent folder (monorepo layouts). */\nfunction lefthookConfig(\n site: Site,\n reader: SiteReader,\n): { file: string | null; hasPreCommit: boolean } {\n const local = site.find(\"lefthook.yml\", \".lefthook.yml\");\n if (local) return { file: local, hasPreCommit: site.contains(local, \"pre-commit\") };\n const upward = reader.readUpward([\"lefthook.yml\", \".lefthook.yml\"]);\n if (upward === null) return { file: null, hasPreCommit: false };\n return { file: upward.path, hasPreCommit: upward.content.includes(\"pre-commit\") };\n}\n\nfunction hasLintStaged(site: Site, pkg: PackageJson | null): boolean {\n const files = [\n \".lintstagedrc\",\n \".lintstagedrc.json\",\n \"lint-staged.config.js\",\n \"lint-staged.config.mjs\",\n ];\n return !!pkg?.[\"lint-staged\"] || site.find(...files) !== null;\n}\n\nfunction preCommit(site: Site, reader: SiteReader, pkg: PackageJson | null): CheckResult {\n const { file: lefthookFile, hasPreCommit } = lefthookConfig(site, reader);\n const hasLefthook = lefthookFile !== null || hasDep(pkg, \"lefthook\");\n return result(\"pre-commit\", preCommitStatus(hasPreCommit, hasLintStaged(site, pkg)), {\n PASS: [\"Pre-commit hooks: lefthook + lint-staged\", lefthookFile ?? \"package.json\"],\n SUGGEST: preCommitSuggestion(site, lefthookFile, hasPreCommit, hasLefthook),\n });\n}\n\nfunction proxyLocalHooks(site: Site): CheckResult {\n const file = site.find(\"lib/augur.ts\", \"src/lib/augur.ts\", \"hooks/augur.ts\");\n const hasUseQuery = site.contains(file, /useQuery|useInfiniteQuery/);\n const wrapsActions = site.contains(file, /unwrap\\(|serverAction|augur-server\\/actions/);\n return result(\"proxy-local-hooks\", localHooksStatus(hasUseQuery), {\n PASS: [\"No local hook wrappers detected\", \"\"],\n SUGGEST: wrapsActions\n ? [\n \"Local hooks wrapping server actions -- replace with createServerQueryProxy\",\n `${file} -- see ${RUNBOOK}#proxy-migration`,\n ]\n : [\"Local hooks found -- check if createServerQueryProxy can replace them\", file ?? \"\"],\n });\n}\n\nfunction proxyServerQuery(site: Site): CheckResult {\n const serverProxy =\n site.proxyFilesMatching(/createServerQueryProxy|createAugurOptions/).length > 0;\n const augurOptions = site.proxyFilesMatching(/useAugurOptions|registerQueryAction/).length > 0;\n return result(\"proxy-server-query\", serverQueryStatus(serverProxy, augurOptions), {\n PASS: serverProxy\n ? [\"Uses createServerQueryProxy for data fetching\", \"\"]\n : [\"Uses useAugurOptions for data fetching\", \"\"],\n SUGGEST: [\n \"No proxy-based data fetching detected\",\n \"Consider createServerQueryProxy (augur-server/hooks) or useAugurOptions (augur-hooks)\",\n ],\n });\n}\n\nfunction queryClientScope(site: Site): CheckResult {\n const files = site.proxyFilesMatching(MODULE_SCOPE_CLIENT);\n return result(\"query-client-scope\", noOffenderStatus(files.length), {\n PASS: [\"No module-scope QueryClient\", \"\"],\n FAIL: [\n \"QueryClient created at module scope (shared across server requests)\",\n `${files.join(\", \")}: create it per request (see ${GETTING_STARTED}#provider-setup)`,\n ],\n });\n}\n\n/**\n * A finite gcTime, or a CACHE_CONFIG tier spread while the site's augur-utils may predate the\n * server-safe tiers, in the proxy files or anywhere under hooks/ or app/ (#94).\n */\nfunction queryGcTime(site: Site, pkg: PackageJson | null): CheckResult {\n const range = pkg === null ? \"\" : allDeps(pkg)[\"@simpleapps-com/augur-utils\"] || \"\";\n // Both decisions are proved scans (rules.ts), each the regex it replaced\n const oldUtils = utilsRangeBeforeFix(range);\n const files = site\n .queryFiles()\n .filter((f) => gcTimeOffenderIn(f.text, oldUtils))\n .map((f) => f.path);\n return result(\"query-gc-time\", noOffenderStatus(files.length), {\n PASS: [\"No finite gcTime in provider/query setup\", \"\"],\n FAIL: [\n \"Finite gcTime in provider/query setup (leaks memory during SSR)\",\n `${files.join(\", \")}: remove it, or wrap with resolveGcTime() from augur-utils; a ...CACHE_CONFIG spread needs @simpleapps-com/augur-utils >= 2026.11.3 (a cache tier's gcTime, in static: { } or semiStatic: { }, is fine: the proxies resolve it)`,\n ],\n });\n}\n\nfunction apiVersion(pkg: PackageJson): CheckResult {\n const range = allDeps(pkg)[\"@simpleapps-com/augur-api\"] || \"\";\n const match = /(\\d{4})\\.(\\d+)\\.(\\d+)/.exec(range);\n const status = apiVersionStatus(\n match !== null,\n Number(match?.[1]),\n Number(match?.[2]),\n Number(match?.[3]),\n );\n return result(\"api-version\", status, {\n PASS: [\"augur-api SDK version supports typed proxies\", range],\n WARN: match\n ? [\n \"augur-api SDK may lack typed proxy support\",\n `${range} -- upgrade to >= 2026.3.7 for typed responses`,\n ]\n : range\n ? [\"augur-api version format not recognized\", range]\n : [\"No augur-api dependency found\", \"\"],\n });\n}\n\n/**\n * A platform minimum (atlas#85, owner 2026-11-12): the site's range for `dep` judged by its\n * proved rule (`floor`, whose minimum `want` names for the message; the tests pin the two\n * together). `fix` names every package to raise together (React refuses a `react` and\n * `react-dom` of different versions).\n */\nfunction floorCheck(\n pkg: PackageJson,\n id: string,\n dep: string,\n floor: (present: boolean, range: string) => Status,\n want: string,\n fix: string,\n): CheckResult {\n const range = allDeps(pkg)[dep] ?? \"\";\n return result(id, floor(range !== \"\", range), {\n PASS: [`${dep} is at or above the platform minimum ${want}`, range],\n FAIL: [\n `${dep} allows a version below the platform minimum ${want}`,\n `${range}; set ${fix} to ^${want}, then run pnpm install`,\n ],\n WARN: [`${dep} version format not recognized`, range],\n SKIP: [`No ${dep} dependency found`, \"\"],\n });\n}\n\n/** next-floor: the platform minimum Next.js (every Next 16 advisory is fixed by 16.4.1). */\nfunction nextFloor(pkg: PackageJson): CheckResult {\n return floorCheck(pkg, \"next-floor\", \"next\", nextFloorStatus, \"16.4.5\", \"next\");\n}\n\nconst REACT_FIX = \"react and react-dom\";\n\n/** react-floor: the platform minimum React (with the Server Components RCE fix). */\nfunction reactFloor(pkg: PackageJson): CheckResult {\n return floorCheck(pkg, \"react-floor\", \"react\", reactFloorStatus, \"19.3.1\", REACT_FIX);\n}\n\n/** react-dom-floor: react-dom at the same minimum, so the two never part. */\nfunction reactDomFloor(pkg: PackageJson): CheckResult {\n return floorCheck(pkg, \"react-dom-floor\", \"react-dom\", reactFloorStatus, \"19.3.1\", REACT_FIX);\n}\n\nconst AUGUR_API = \"@simpleapps-com/augur-api\";\n\n/** augur-api-floor: the platform minimum Augur SDK, the latest release when it was set. */\nfunction augurApiFloor(pkg: PackageJson): CheckResult {\n return floorCheck(pkg, \"augur-api-floor\", AUGUR_API, augurApiFloorStatus, \"2026.11.5\", AUGUR_API);\n}\n\n/** The short name of an augur package (`augur-core`). */\nfunction shortName(name: string): string {\n return name.replace(\"@simpleapps-com/\", \"\");\n}\n\n/** augur-version-latest: each installed augur package against its own latest (no lockstep). */\nfunction augurVersionLatest(reader: SiteReader, pkg: PackageJson | null): CheckResult {\n const deps = pkg ? allDeps(pkg) : {};\n const installed = AUGUR_PACKAGES.filter((name) => deps[name]);\n const latest = installed.map((name) => reader.latestVersion(name));\n const states: PackageState[] = installed.map((name, k) =>\n packageStateOf(deps[name] as string, latest[k] as string),\n );\n const behind = installed.filter((_, k) => states[k] === \"behind\");\n return result(\"augur-version-latest\", latestStatus(states), {\n SKIP: installed.length\n ? [\n \"Augur latest version check\",\n \"Could not fetch latest version from npm (offline or not published)\",\n ]\n : [\"Augur latest version check\", pkg ? \"No augur packages found\" : \"No package.json\"],\n PASS: [\n \"Augur packages on their latest versions\",\n installed.map((name, k) => `${shortName(name)}: ${latest[k]}`).join(\", \"),\n ],\n FAIL: [\n \"Augur packages should be on their latest versions\",\n `${behind\n .map(\n (name) =>\n `${shortName(name)}: installed ${deps[name]}, latest ${latest[installed.indexOf(name)]}`,\n )\n .join(\", \")} -- set the latest in package.json, then run pnpm install (not pnpm update)`,\n ],\n });\n}\n\n/** Every check, in the original order; the package.json checks only when there is one. */\nexport function runChecks(reader: SiteReader): CheckResult[] {\n const site = new Site(reader);\n const pkg = site.json<PackageJson>(\"package.json\");\n const eslintFile = site.find(\"eslint.config.mjs\", \"eslint.config.js\");\n const next = nextFacts(site, pkg);\n return [\n siteConfig(site),\n serverSite(site),\n actions(site),\n siteHooks(site),\n ssrOptions(site),\n tsconfig(site),\n eslint(site, eslintFile),\n eslintDeprecated(site, eslintFile),\n prettier(site, pkg),\n knip(site, pkg),\n nextExternal(next),\n nextIoredis(next),\n nextHeaders(next),\n nextOptimize(next),\n nextStrict(next),\n nextProxy(site),\n contractTests(site),\n noWrapper(site),\n auth(site),\n imageLoader(next),\n qualityScript(pkg),\n ...(pkg ? [icons(pkg), tailwind(pkg)] : []),\n preCommit(site, reader, pkg),\n proxyLocalHooks(site),\n proxyServerQuery(site),\n queryClientScope(site),\n queryGcTime(site, pkg),\n ...(pkg\n ? [apiVersion(pkg), nextFloor(pkg), reactFloor(pkg), reactDomFloor(pkg), augurApiFloor(pkg)]\n : []),\n augurVersionLatest(reader, pkg),\n ];\n}\n","/** The {@link SiteReader} over the real file system and npm. */\n\nimport { execFileSync } from \"node:child_process\";\nimport { existsSync, readdirSync, readFileSync } from \"node:fs\";\nimport { dirname, join, resolve } from \"node:path\";\nimport type { SiteReader } from \"./checks\";\nimport { isQuerySourceName, walksDir } from \"./rules\";\n\n/**\n * The `.ts`/`.tsx` files under `rel` (relative to `siteDir`), recursively, skipping node_modules\n * (which names and folders count: the proved `isQuerySourceName`, `walksDir`).\n */\nfunction sourceFilesUnder(siteDir: string, rel: string): string[] {\n if (!existsSync(resolve(siteDir, rel))) return [];\n return readdirSync(resolve(siteDir, rel), { withFileTypes: true }).flatMap((entry) => {\n const path = join(rel, entry.name);\n if (entry.isDirectory()) return walksDir(entry.name) ? sourceFilesUnder(siteDir, path) : [];\n return isQuerySourceName(entry.name) ? [path] : [];\n });\n}\n\n/** The first of `names` found walking up from `start`, stopping at a git repo root. */\nfunction findUpward(start: string, names: string[]): string | null {\n let dir = start;\n const root = resolve(\"/\");\n while (dir !== root) {\n const hit = names.map((name) => resolve(dir, name)).find((path) => existsSync(path));\n if (hit) return hit;\n if (existsSync(resolve(dir, \".git\"))) break;\n dir = dirname(dir);\n }\n return null;\n}\n\n/** A package's latest published version from `npm view`, or \"\" when npm cannot say. */\nfunction npmLatest(packageName: string): string {\n try {\n return execFileSync(\"npm\", [\"view\", packageName, \"version\"], {\n encoding: \"utf-8\",\n stdio: [\"ignore\", \"pipe\", \"ignore\"],\n }).trim();\n } catch {\n return \"\";\n }\n}\n\nexport function nodeReader(siteDir: string, latestVersion = npmLatest): SiteReader {\n const read = (path: string) => (existsSync(path) ? readFileSync(path, \"utf-8\") : null);\n return {\n exists: (relPath) => existsSync(resolve(siteDir, relPath)),\n read: (relPath) => read(resolve(siteDir, relPath)),\n readUpward: (names) => {\n const path = findUpward(siteDir, names);\n return path === null ? null : { path, content: readFileSync(path, \"utf-8\") };\n },\n latestVersion,\n sourceFiles: (dirs) => dirs.flatMap((dir) => sourceFilesUnder(siteDir, dir)),\n };\n}\n","/** augur-doctor's scorecard: the check results as terminal lines, grouped as before. */\n\nimport { RUNBOOK, type CheckResult } from \"./checks\";\nimport { countStatusFrom, scoredTotal, type Status } from \"./rules\";\n\nconst ICONS: Record<Status, string> = {\n PASS: \"\\x1b[32m[PASS]\\x1b[0m\",\n FAIL: \"\\x1b[31m[FAIL]\\x1b[0m\",\n WARN: \"\\x1b[33m[WARN]\\x1b[0m\",\n SUGGEST: \"\\x1b[36m[SUGGEST]\\x1b[0m\",\n SKIP: \"\\x1b[90m[SKIP]\\x1b[0m\",\n};\n\n/** The scorecard's groups, in order (no lockstep: the one-version check is gone). */\nconst GROUPS: [string, string[]][] = [\n [\"Site Architecture\", [\"site-config\", \"server-site\", \"actions\", \"site-hooks\", \"ssr-options\"]],\n [\n \"Config Alignment\",\n [\"tsconfig\", \"eslint\", \"eslint-deprecated\", \"prettier\", \"knip\", \"tailwind\", \"icons\"],\n ],\n [\n \"Next.js Config\",\n [\"next-external\", \"next-ioredis\", \"next-headers\", \"next-optimize\", \"next-strict\", \"next-proxy\"],\n ],\n [\"Testing & Quality\", [\"contract-tests\", \"quality-script\", \"pre-commit\"]],\n [\n \"Proxy Adoption\",\n [\n \"proxy-local-hooks\",\n \"proxy-server-query\",\n \"query-client-scope\",\n \"query-gc-time\",\n \"api-version\",\n ],\n ],\n [\"Platform Minimums\", [\"next-floor\", \"react-floor\", \"react-dom-floor\", \"augur-api-floor\"]],\n [\"Package Versions\", [\"augur-version-latest\"]],\n [\"Patterns\", [\"no-wrapper\", \"auth\", \"image-loader\"]],\n];\n\n/** A group's lines: its heading, each of its results, a blank line. */\nfunction groupLines(name: string, ids: string[], results: CheckResult[]): string[] {\n const lines = ids.flatMap((id) => {\n const r = results.find((x) => x.id === id);\n if (!r) return [];\n const detail = r.detail ? ` \\x1b[90m${r.detail}\\x1b[0m` : \"\";\n return [` ${ICONS[r.status]} ${r.label}${detail}`];\n });\n return [`\\x1b[1m${name}\\x1b[0m`, ...lines, \"\"];\n}\n\n/** The score line: passing out of the scored total, then the failing, warning, suggestion counts. */\nfunction scoreLine(statuses: Status[]): string {\n const count = (s: Status) => countStatusFrom(statuses, s, 0);\n const failing = count(\"FAIL\");\n const warnings = count(\"WARN\");\n const suggestions = count(\"SUGGEST\");\n return (\n `\\x1b[1mScore: ${count(\"PASS\")}/${scoredTotal(statuses)}\\x1b[0m` +\n (failing > 0 ? ` \\x1b[31m(${failing} failing)\\x1b[0m` : \"\") +\n (warnings > 0 ? ` \\x1b[33m(${warnings} warnings)\\x1b[0m` : \"\") +\n (suggestions > 0 ? ` \\x1b[36m(${suggestions} suggestions)\\x1b[0m` : \"\")\n );\n}\n\n/** The whole scorecard for a site. */\nexport function reportLines(siteName: string, siteDir: string, results: CheckResult[]): string[] {\n const statuses = results.map((r) => r.status);\n const runbook =\n countStatusFrom(statuses, \"FAIL\", 0) > 0\n ? [\"See the migration runbook for fixes:\", RUNBOOK, \"\"]\n : [];\n return [\n \"\",\n `\\x1b[1mAugur Doctor: ${siteName}\\x1b[0m`,\n `Path: ${siteDir}`,\n \"\",\n ...GROUPS.flatMap(([name, ids]) => groupLines(name, ids, results)),\n scoreLine(statuses),\n \"\",\n ...runbook,\n ];\n}\n","#!/usr/bin/env node\n/**\n * augur-doctor -- Site health check against the Augur platform standard.\n *\n * Usage:\n * npx augur-doctor (runs against current directory)\n * npx augur-doctor /path/to/site\n *\n * Checks a consumer site for alignment with the reference implementation and prints a\n * pass/fail/warn scorecard.\n */\n\nimport { runDoctor } from \"./doctor/cli\";\n\nprocess.exit(\n runDoctor(process.argv.slice(2), {\n log: (line) => console.log(line),\n error: (line) => console.error(line),\n }),\n);\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAEA,SAAS,cAAAA,mBAAkB;AAC3B,SAAS,UAAU,WAAAC,gBAAe;;;AC8K3B,SAAS,aAAa,IAAc,GAAW,GAAoB;AAMxE,MAAI,MAAM,EAAG,QAAO;AACpB,MAAK,GAAG,IAAI,CAAC,MAAiB,EAAG,QAAO;AACxC,SAAO,aAAa,IAAI,GAAG,IAAI,CAAC;AAClC;AAyBO,SAAS,WAAW,IAAc,GAAqB;AAO5D,MAAI,KAAK,GAAG,OAAQ,QAAO,CAAC;AAC5B,QAAM,OAAO,WAAW,IAAI,IAAI,CAAC;AACjC,SAAO,aAAa,IAAI,GAAG,CAAC,GAAa,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,GAAa,GAAG,IAAI;AAChF;;;AC3IA,IAAM,cAAc;AAAA,EAClB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAEA,IAAM,gBAAgB;AACtB,IAAM,sBAAsB;AAI5B,IAAM,oBAAoB,CAAC,SAAS,OAAO,aAAa,SAAS;AAG1D,IAAM,iBAAiB;AAAA,EAC5B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAGO,IAAM,UAAU;AACvB,IAAM,kBAAkB;AAMxB,SAAS,OACP,IACA,QACA,QACa;AACb,QAAM,CAAC,OAAO,MAAM,IAAI,OAAO,MAAM;AACrC,SAAO,EAAE,QAAQ,IAAI,OAAO,OAAO;AACrC;AAGA,IAAM,OAAN,MAAW;AAAA,EACT,YAA6B,QAAoB;AAApB;AAAA,EAAqB;AAAA,EAArB;AAAA,EAE7B,QAAQ,YAAqC;AAC3C,WAAO,WAAW,KAAK,CAAC,MAAM,KAAK,OAAO,OAAO,CAAC,CAAC,KAAK;AAAA,EAC1D;AAAA,EAEA,KAAK,SAAgC;AACnC,WAAO,KAAK,OAAO,KAAK,OAAO;AAAA,EACjC;AAAA,EAEA,SAAS,SAAwB,SAAmC;AAClE,UAAM,UAAU,YAAY,OAAO,OAAO,KAAK,OAAO,KAAK,OAAO;AAClE,QAAI,CAAC,QAAS,QAAO;AACrB,WAAO,OAAO,YAAY,WAAW,QAAQ,SAAS,OAAO,IAAI,QAAQ,KAAK,OAAO;AAAA,EACvF;AAAA,EAEA,KAAQ,SAA2B;AACjC,UAAM,UAAU,KAAK,OAAO,KAAK,OAAO;AACxC,QAAI,CAAC,QAAS,QAAO;AACrB,QAAI;AACF,aAAO,KAAK,MAAM,OAAO;AAAA,IAC3B,QAAQ;AACN,aAAO;AAAA,IACT;AAAA,EACF;AAAA;AAAA,EAGA,mBAAmB,SAA2B;AAC5C,WAAO,YAAY,OAAO,CAAC,MAAM,KAAK,SAAS,GAAG,OAAO,CAAC;AAAA,EAC5D;AAAA;AAAA,EAGA,aAA+C;AAC7C,UAAM,QAAQ,WAAW,CAAC,GAAG,aAAa,GAAG,KAAK,OAAO,YAAY,iBAAiB,CAAC,GAAG,CAAC;AAC3F,WAAO,MAAM,QAAQ,CAAC,SAAS;AAC7B,YAAM,OAAO,KAAK,OAAO,KAAK,IAAI;AAClC,aAAO,SAAS,OAAO,CAAC,IAAI,CAAC,EAAE,MAAM,KAAK,CAAC;AAAA,IAC7C,CAAC;AAAA,EACH;AACF;AAEA,SAAS,WAAW,MAAyB;AAC3C,QAAM,OAAO,KAAK;AAAA,IAChB;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACA,SAAO,OAAO,eAAe,SAAS,SAAS,MAAM,KAAK,SAAS,MAAM,YAAY,CAAC,GAAG;AAAA,IACvF,MAAM,CAAC,qCAAqC,QAAQ,EAAE;AAAA,IACtD,MAAM,CAAC,wDAAwD,QAAQ,EAAE;AAAA,IACzE,MAAM,CAAC,qCAAqC,8BAA8B;AAAA,EAC5E,CAAC;AACH;AAEA,SAAS,WAAW,MAAyB;AAC3C,QAAM,OAAO,KAAK,KAAK,qBAAqB,yBAAyB,sBAAsB;AAC3F,SAAO,OAAO,eAAe,SAAS,SAAS,MAAM,KAAK,SAAS,MAAM,kBAAkB,CAAC,GAAG;AAAA,IAC7F,MAAM,CAAC,0CAA0C,QAAQ,EAAE;AAAA,IAC3D,MAAM,CAAC,4DAA4D,QAAQ,EAAE;AAAA,IAC7E,MAAM,CAAC,0CAA0C,4BAA4B;AAAA,EAC/E,CAAC;AACH;AAEA,SAAS,QAAQ,MAAyB;AACxC,QAAM,OAAO,KAAK,KAAK,wBAAwB,4BAA4B,gBAAgB;AAC3F,QAAM,YAAY,KAAK,SAAS,MAAM,yBAAyB;AAC/D,QAAM,YAAY,KAAK,mBAAmB,aAAa,EAAE,SAAS;AAClE,QAAM,SAAS,cAAc,SAAS,MAAM,WAAW,SAAS;AAChE,SAAO,OAAO,WAAW,QAAQ;AAAA,IAC/B,MAAM,OACF,CAAC,8CAA8C,IAAI,IACnD,CAAC,qDAAqD,EAAE;AAAA,IAC5D,MAAM,CAAC,8DAA8D,QAAQ,EAAE;AAAA,IAC/E,MAAM;AAAA,MACJ;AAAA,MACA;AAAA,IACF;AAAA,EACF,CAAC;AACH;AAEA,SAAS,UAAU,MAAyB;AAC1C,QAAM,OAAO,KAAK;AAAA,IAChB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACA,QAAM,kBAAkB,KAAK,SAAS,MAAM,iBAAiB;AAC7D,QAAM,SAAS;AAAA,IACb,SAAS;AAAA,IACT;AAAA,IACA,KAAK,SAAS,MAAM,gCAAgC;AAAA,EACtD;AACA,SAAO,OAAO,cAAc,QAAQ;AAAA,IAClC,MAAM;AAAA,MACJ,kBAAkB,oCAAoC;AAAA,MACtD,QAAQ;AAAA,IACV;AAAA,IACA,MAAM,CAAC,sDAAsD,QAAQ,EAAE;AAAA,IACvE,MAAM,CAAC,mCAAmC,uBAAuB;AAAA,EACnE,CAAC;AACH;AAEA,SAAS,WAAW,MAAyB;AAC3C,QAAM,OAAO,KAAK,KAAK,wBAAwB,0BAA0B;AACzE,SAAO,OAAO,eAAe,SAAS,SAAS,MAAM,KAAK,SAAS,MAAM,SAAS,CAAC,GAAG;AAAA,IACpF,MAAM,CAAC,wCAAwC,QAAQ,EAAE;AAAA,IACzD,MAAM,CAAC,sDAAsD,QAAQ,EAAE;AAAA,IACvE,MAAM,CAAC,wCAAwC,+BAA+B;AAAA,EAChF,CAAC;AACH;AAEA,SAAS,SAAS,MAAyB;AACzC,QAAM,SAAS,KAAK,KAA2B,eAAe;AAC9D,QAAM,aAAa,QAAQ,WAAW;AACtC,QAAM,SAAS;AAAA,IACb,WAAW;AAAA,IACX,WAAW,SAAS,4BAA4B;AAAA,IAChD,WAAW,SAAS,cAAc;AAAA,EACpC;AACA,SAAO,OAAO,YAAY,QAAQ;AAAA,IAChC,MAAM,CAAC,oDAAoD,EAAE;AAAA,IAC7D,MAAM,CAAC,6DAA6D,YAAY,UAAU,EAAE;AAAA,IAC5F,MAAM,SACF;AAAA,MACE;AAAA,MACA,aAAa,YAAY,UAAU,KAAK;AAAA,IAC1C,IACA,CAAC,wBAAwB,gBAAgB;AAAA,EAC/C,CAAC;AACH;AAEA,SAAS,iBAAiB,MAAY,MAAuC;AAC3E,MAAI,MAAM;AACR,WAAO;AAAA,MACL;AAAA,MACA;AAAA,IACF;AAAA,EACF;AACA,MAAI,KAAK,KAAK,kBAAkB,gBAAgB,aAAa,eAAe,GAAG;AAC7E,WAAO;AAAA,MACL;AAAA,MACA;AAAA,IACF;AAAA,EACF;AACA,SAAO,CAAC,4BAA4B,wBAAwB;AAC9D;AAEA,SAAS,OAAO,MAAY,MAAkC;AAC5D,SAAO,OAAO,UAAU,aAAa,SAAS,MAAM,KAAK,SAAS,MAAM,qBAAqB,CAAC,GAAG;AAAA,IAC/F,MAAM,CAAC,mDAAmD,QAAQ,EAAE;AAAA,IACpE,MAAM,iBAAiB,MAAM,IAAI;AAAA,EACnC,CAAC;AACH;AAEA,SAAS,iBAAiB,MAAY,MAAkC;AACtE,QAAM,SAAS;AAAA,IACb,SAAS;AAAA,IACT,KAAK,SAAS,MAAM,+CAA+C;AAAA,IACnE,KAAK,SAAS,MAAM,eAAe;AAAA,EACrC;AACA,SAAO,OAAO,qBAAqB,QAAQ;AAAA,IACzC,MAAM,CAAC,8BAA8B,wBAAwB;AAAA,IAC7D,MAAM,CAAC,sCAAsC,EAAE;AAAA,IAC/C,MAAM;AAAA,MACJ;AAAA,MACA;AAAA,IACF;AAAA,IACA,MAAM;AAAA,MACJ;AAAA,MACA;AAAA,IACF;AAAA,EACF,CAAC;AACH;AAEA,SAAS,mBACP,MACA,MACA,KACkB;AAClB,QAAM,QAAQ;AACd,MAAI,KAAM,QAAO,CAAC,OAAO,yDAAyD;AAClF,MAAI,KAAK,UAAU;AACjB,WAAO,CAAC,OAAO,0EAA0E;AAAA,EAC3F;AACA,MAAI,KAAK,KAAK,eAAe,oBAAoB,kBAAkB,GAAG;AACpE,WAAO;AAAA,MACL;AAAA,MACA;AAAA,IACF;AAAA,EACF;AACA,SAAO,CAAC,0BAA0B,0BAA0B;AAC9D;AAEA,SAAS,SAAS,MAAY,KAAsC;AAClE,QAAM,OAAO,KAAK;AAAA,IAChB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACA,SAAO;AAAA,IACL;AAAA,IACA,aAAa,SAAS,MAAM,KAAK,SAAS,MAAM,uBAAuB,CAAC;AAAA,IACxE;AAAA,MACE,MAAM,CAAC,8CAA8C,QAAQ,EAAE;AAAA,MAC/D,MAAM,mBAAmB,MAAM,MAAM,GAAG;AAAA,IAC1C;AAAA,EACF;AACF;AAEA,SAAS,KAAK,MAAY,KAAsC;AAC9D,QAAM,SAAS,KAAK;AAAA,IAClB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACA,SAAO,OAAO,QAAQ,WAAW,WAAW,MAAM,OAAO,KAAK,MAAM,CAAC,GAAG;AAAA,IACtE,MAAM,CAAC,2CAA2C,UAAU,EAAE;AAAA,IAC9D,MAAM;AAAA,MACJ;AAAA,MACA;AAAA,IACF;AAAA,IACA,MAAM,SACF;AAAA,MACE;AAAA,MACA;AAAA,IACF,IACA;AAAA,MACE;AAAA,MACA;AAAA,IACF;AAAA,EACN,CAAC;AACH;AAGA,SAAS,OAAO,KAAyB,MAAuB;AAC9D,SAAO,CAAC,EAAE,KAAK,eAAe,IAAI,KAAK,KAAK,kBAAkB,IAAI;AACpE;AAGA,SAAS,YAAY,MAAc,OAA0B;AAC3D,SAAO,MAAM,MAAM,CAAC,SAAS,KAAK,SAAS,IAAI,CAAC;AAClD;AAGA,SAAS,UAAU,MAAY,KAAoC;AACjE,QAAM,OAAO,KAAK,KAAK,kBAAkB,mBAAmB,gBAAgB;AAC5E,QAAM,QAAQ,SAAS,OAAO,OAAO,KAAK,KAAK,IAAI,MAAM;AACzD,SAAO;AAAA,IACL,WAAW,SAAS;AAAA,IACpB,aAAa,KAAK,SAAS,wBAAwB;AAAA,IACnD,mBAAmB,KAAK,SAAS,cAAc;AAAA,IAC/C,aAAa,OAAO,KAAK,SAAS;AAAA,IAClC,oBAAoB,KAAK,SAAS,SAAS;AAAA,IAC3C,eAAe,YAAY,MAAM;AAAA,MAC/B;AAAA,MACA;AAAA,MACA;AAAA,IACF,CAAC;AAAA,IACD,YAAY,KAAK,SAAS,SAAS;AAAA,IACnC,aAAa,KAAK,SAAS,wBAAwB;AAAA,IACnD,WAAW,KAAK,SAAS,iBAAiB;AAAA,IAC1C,aAAa,sBAAsB,KAAK,IAAI;AAAA,IAC5C,WAAW,KAAK,SAAS,QAAQ;AAAA,EACnC;AACF;AAEA,SAAS,aAAa,GAA2B;AAC/C,SAAO,OAAO,iBAAiB,mBAAmB,CAAC,GAAG;AAAA,IACpD,MAAM,CAAC,+CAA+C,EAAE;AAAA,IACxD,MAAM;AAAA,MACJ;AAAA,MACA;AAAA,IACF;AAAA,IACA,MAAM,EAAE,YACJ;AAAA,MACE;AAAA,MACA;AAAA,IACF,IACA,CAAC,sBAAsB,sBAAsB;AAAA,EACnD,CAAC;AACH;AAEA,SAAS,kBAAkB,GAAsB;AAC/C,MAAI,CAAC,EAAE,UAAW,QAAO;AACzB,MAAI,CAAC,EAAE,YAAa,QAAO;AAC3B,SAAO;AACT;AAEA,SAAS,YAAY,GAA2B;AAC9C,SAAO,OAAO,gBAAgB,cAAc,CAAC,GAAG;AAAA,IAC9C,MAAM,CAAC,8BAA8B,kBAAkB,CAAC,CAAC;AAAA,IACzD,MAAM,CAAC,kDAAkD,EAAE;AAAA,IAC3D,MAAM;AAAA,MACJ;AAAA,MACA;AAAA,IACF;AAAA,EACF,CAAC;AACH;AAEA,SAAS,YAAY,GAA2B;AAC9C,SAAO,OAAO,gBAAgB,cAAc,CAAC,GAAG;AAAA,IAC9C,MAAM,CAAC,iCAAiC,EAAE;AAAA,IAC1C,MAAM;AAAA,MACJ;AAAA,MACA;AAAA,IACF;AAAA,IACA,MAAM;AAAA,MACJ;AAAA,MACA,EAAE,YAAY,gCAAgC;AAAA,IAChD;AAAA,EACF,CAAC;AACH;AAEA,SAAS,aAAa,GAA2B;AAC/C,SAAO,OAAO,iBAAiB,eAAe,CAAC,GAAG;AAAA,IAChD,MAAM,CAAC,uCAAuC,EAAE;AAAA,IAChD,MAAM;AAAA,MACJ;AAAA,MACA,EAAE,YAAY,+DAA+D;AAAA,IAC/E;AAAA,EACF,CAAC;AACH;AAEA,SAAS,WAAW,GAA2B;AAC7C,SAAO,OAAO,eAAe,aAAa,CAAC,GAAG;AAAA,IAC5C,MAAM,CAAC,gCAAgC,gBAAgB;AAAA,IACvD,MAAM,CAAC,gCAAgC,EAAE;AAAA,IACzC,MAAM,CAAC,wCAAwC,6CAA6C;AAAA,EAC9F,CAAC;AACH;AAEA,IAAM,YAAY,GAAG,OAAO;AAG5B,SAAS,UAAU,MAAyB;AAC1C,QAAM,aAAa,KAAK;AAAA,IACtB,eAAe,cAAc,OAAO,KAAK;AAAA,IACzC,eAAe,cAAc,OAAO,IAAI;AAAA,IACxC,eAAe,cAAc,MAAM,KAAK;AAAA,IACxC,eAAe,cAAc,MAAM,IAAI;AAAA,EACzC;AACA,QAAM,QAAQ,KAAK;AAAA,IACjB,eAAe,SAAS,OAAO,KAAK;AAAA,IACpC,eAAe,SAAS,OAAO,IAAI;AAAA,IACnC,eAAe,SAAS,MAAM,KAAK;AAAA,IACnC,eAAe,SAAS,MAAM,IAAI;AAAA,EACpC;AACA,SAAO,OAAO,cAAc,iBAAiB,eAAe,MAAM,UAAU,IAAI,GAAG;AAAA,IACjF,MAAM,CAAC,yBAAyB,SAAS,EAAE;AAAA,IAC3C,MAAM;AAAA,MACJ;AAAA,MACA,gBAAgB,cAAc,IAAI,SAAS;AAAA,IAC7C;AAAA,IACA,MAAM;AAAA,MACJ;AAAA,MACA,gBAAgB,cAAc,IAAI,SAAS,IAAI,SAAS;AAAA,IAC1D;AAAA,IACA,MAAM,CAAC,oCAAoC,6BAA6B;AAAA,EAC1E,CAAC;AACH;AAEA,SAAS,YAAY,GAA2B;AAC9C,SAAO,OAAO,gBAAgB,kBAAkB,CAAC,GAAG;AAAA,IAClD,MAAM,CAAC,sBAAsB,gBAAgB;AAAA,IAC7C,MAAM,CAAC,kCAAkC,EAAE;AAAA,IAC3C,MAAM,EAAE,YACJ;AAAA,MACE;AAAA,MACA;AAAA,IACF,IACA,CAAC,gCAAgC,wDAAwD;AAAA,EAC/F,CAAC;AACH;AAEA,SAAS,cAAc,MAAyB;AAC9C,QAAM,UACJ,KAAK;AAAA,IACH;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF,MAAM;AACR,SAAO,OAAO,kBAAkB,oBAAoB,OAAO,GAAG;AAAA,IAC5D,MAAM,CAAC,8BAA8B,EAAE;AAAA,IACvC,MAAM,CAAC,kDAAkD,yBAAyB;AAAA,EACpF,CAAC;AACH;AAEA,SAAS,UAAU,MAAyB;AAC1C,QAAM,OAAO,KAAK;AAAA,IAChB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACA,QAAM,QAAQ,KAAK,SAAS,MAAM,mBAAmB,KAAK,KAAK,SAAS,MAAM,kBAAkB;AAChG,QAAM,SAAS,KAAK,KAAK,OAAO,SAAS,MAAM;AAC/C,SAAO,OAAO,cAAc,gBAAgB,QAAQ,KAAK,GAAG;AAAA,IAC1D,MAAM,CAAC,iCAAiC,mBAAmB;AAAA,IAC3D,MAAM,CAAC,iCAAiC,OAAO,4BAA4B,EAAE;AAAA,IAC7E,MAAM,CAAC,iCAAiC,GAAG,IAAI,2CAA2C;AAAA,EAC5F,CAAC;AACH;AAEA,SAAS,KAAK,MAAyB;AACrC,QAAM,OAAO,KAAK,KAAK,WAAW,eAAe,mBAAmB,aAAa;AACjF,QAAM,cACJ,KAAK,SAAS,MAAM,WAAW,KAC/B,KAAK,SAAS,MAAM,kBAAkB,KACtC,KAAK,SAAS,MAAM,kBAAkB;AACxC,QAAM,SAAS,WAAW,SAAS,MAAM,aAAa,KAAK,SAAS,MAAM,UAAU,CAAC;AACrF,SAAO,OAAO,QAAQ,QAAQ;AAAA,IAC5B,MAAM,CAAC,2CAA2C,QAAQ,EAAE;AAAA,IAC5D,MAAM;AAAA,MACJ;AAAA,MACA,GAAG,IAAI;AAAA,IACT;AAAA,IACA,MAAM,OACF,CAAC,wBAAwB,IAAI,IAC7B,CAAC,oBAAoB,iCAAiC;AAAA,EAC5D,CAAC;AACH;AAEA,SAAS,cAAc,KAAsC;AAC3D,QAAM,UAAU,KAAK,UAAU,SAAS;AACxC,QAAM,WACJ,CAAC,CAAC,WACF,QAAQ,SAAS,WAAW,KAC5B,QAAQ,SAAS,MAAM,KACvB,QAAQ,SAAS,MAAM;AACzB,SAAO,OAAO,kBAAkB,cAAc,CAAC,CAAC,SAAS,QAAQ,GAAG;AAAA,IAClE,MAAM,CAAC,2CAA2C,EAAE;AAAA,IACpD,MAAM,CAAC,+CAA+C,eAAe,OAAO,GAAG;AAAA,IAC/E,MAAM;AAAA,MACJ;AAAA,MACA;AAAA,IACF;AAAA,EACF,CAAC;AACH;AAEA,SAAS,QAAQ,KAAwB;AACvC,SAAO,EAAE,GAAG,IAAI,cAAc,GAAG,IAAI,gBAAgB;AACvD;AAEA,SAAS,MAAM,KAA+B;AAC5C,QAAM,OAAO,QAAQ,GAAG;AACxB,QAAM,YAAY,CAAC,CAAC,KAAK,kBAAkB;AAC3C,QAAM,SAAS,YAAY,CAAC,CAAC,KAAK,aAAa,GAAG,WAAW,CAAC,CAAC,KAAK,cAAc,CAAC;AACnF,SAAO,OAAO,SAAS,QAAQ;AAAA,IAC7B,MAAM,CAAC,wCAAwC,EAAE;AAAA,IACjD,MAAM;AAAA,MACJ;AAAA,MACA,YACI,4DACA;AAAA,IACN;AAAA,IACA,MAAM,CAAC,yBAAyB,sBAAsB;AAAA,EACxD,CAAC;AACH;AAEA,SAAS,SAAS,KAA+B;AAC/C,QAAM,QAAQ,QAAQ,GAAG,EAAE,aAAa,KAAK;AAC7C,SAAO,OAAO,YAAY,eAAe,KAAK,GAAG;AAAA,IAC/C,MAAM,CAAC,mCAAmC,EAAE;AAAA,IAC5C,MAAM,CAAC,eAAe,sBAAsB,KAAK,uBAAuB;AAAA,IACxE,MAAM,QACF,CAAC,4BAA4B,gBAAgB,KAAK,EAAE,IACpD,CAAC,mCAAmC,EAAE;AAAA,EAC5C,CAAC;AACH;AAEA,SAAS,oBACP,MACA,cACA,cACA,aACkB;AAClB,QAAM,MAAM,OAAO,OAAO;AAC1B,MAAI,aAAc,QAAO,CAAC,8DAA8D,GAAG;AAC3F,MAAI,aAAc,QAAO,CAAC,8DAA8D,GAAG;AAC3F,MAAI,aAAa;AACf,WAAO;AAAA,MACL;AAAA,MACA,2BAA2B,OAAO;AAAA,IACpC;AAAA,EACF;AACA,MAAI,KAAK,KAAK,qBAAqB,qBAAqB,GAAG;AACzD,WAAO,CAAC,mEAAmE,GAAG;AAAA,EAChF;AACA,SAAO,CAAC,6DAA6D,GAAG;AAC1E;AAGA,SAAS,eACP,MACA,QACgD;AAChD,QAAM,QAAQ,KAAK,KAAK,gBAAgB,eAAe;AACvD,MAAI,MAAO,QAAO,EAAE,MAAM,OAAO,cAAc,KAAK,SAAS,OAAO,YAAY,EAAE;AAClF,QAAM,SAAS,OAAO,WAAW,CAAC,gBAAgB,eAAe,CAAC;AAClE,MAAI,WAAW,KAAM,QAAO,EAAE,MAAM,MAAM,cAAc,MAAM;AAC9D,SAAO,EAAE,MAAM,OAAO,MAAM,cAAc,OAAO,QAAQ,SAAS,YAAY,EAAE;AAClF;AAEA,SAAS,cAAc,MAAY,KAAkC;AACnE,QAAM,QAAQ;AAAA,IACZ;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACA,SAAO,CAAC,CAAC,MAAM,aAAa,KAAK,KAAK,KAAK,GAAG,KAAK,MAAM;AAC3D;AAEA,SAAS,UAAU,MAAY,QAAoB,KAAsC;AACvF,QAAM,EAAE,MAAM,cAAc,aAAa,IAAI,eAAe,MAAM,MAAM;AACxE,QAAM,cAAc,iBAAiB,QAAQ,OAAO,KAAK,UAAU;AACnE,SAAO,OAAO,cAAc,gBAAgB,cAAc,cAAc,MAAM,GAAG,CAAC,GAAG;AAAA,IACnF,MAAM,CAAC,4CAA4C,gBAAgB,cAAc;AAAA,IACjF,SAAS,oBAAoB,MAAM,cAAc,cAAc,WAAW;AAAA,EAC5E,CAAC;AACH;AAEA,SAAS,gBAAgB,MAAyB;AAChD,QAAM,OAAO,KAAK,KAAK,gBAAgB,oBAAoB,gBAAgB;AAC3E,QAAM,cAAc,KAAK,SAAS,MAAM,2BAA2B;AACnE,QAAM,eAAe,KAAK,SAAS,MAAM,6CAA6C;AACtF,SAAO,OAAO,qBAAqB,iBAAiB,WAAW,GAAG;AAAA,IAChE,MAAM,CAAC,mCAAmC,EAAE;AAAA,IAC5C,SAAS,eACL;AAAA,MACE;AAAA,MACA,GAAG,IAAI,WAAW,OAAO;AAAA,IAC3B,IACA,CAAC,yEAAyE,QAAQ,EAAE;AAAA,EAC1F,CAAC;AACH;AAEA,SAAS,iBAAiB,MAAyB;AACjD,QAAM,cACJ,KAAK,mBAAmB,2CAA2C,EAAE,SAAS;AAChF,QAAM,eAAe,KAAK,mBAAmB,qCAAqC,EAAE,SAAS;AAC7F,SAAO,OAAO,sBAAsB,kBAAkB,aAAa,YAAY,GAAG;AAAA,IAChF,MAAM,cACF,CAAC,iDAAiD,EAAE,IACpD,CAAC,0CAA0C,EAAE;AAAA,IACjD,SAAS;AAAA,MACP;AAAA,MACA;AAAA,IACF;AAAA,EACF,CAAC;AACH;AAEA,SAAS,iBAAiB,MAAyB;AACjD,QAAM,QAAQ,KAAK,mBAAmB,mBAAmB;AACzD,SAAO,OAAO,sBAAsB,iBAAiB,MAAM,MAAM,GAAG;AAAA,IAClE,MAAM,CAAC,+BAA+B,EAAE;AAAA,IACxC,MAAM;AAAA,MACJ;AAAA,MACA,GAAG,MAAM,KAAK,IAAI,CAAC,gCAAgC,eAAe;AAAA,IACpE;AAAA,EACF,CAAC;AACH;AAMA,SAAS,YAAY,MAAY,KAAsC;AACrE,QAAM,QAAQ,QAAQ,OAAO,KAAK,QAAQ,GAAG,EAAE,6BAA6B,KAAK;AAEjF,QAAM,WAAW,oBAAoB,KAAK;AAC1C,QAAM,QAAQ,KACX,WAAW,EACX,OAAO,CAAC,MAAM,iBAAiB,EAAE,MAAM,QAAQ,CAAC,EAChD,IAAI,CAAC,MAAM,EAAE,IAAI;AACpB,SAAO,OAAO,iBAAiB,iBAAiB,MAAM,MAAM,GAAG;AAAA,IAC7D,MAAM,CAAC,4CAA4C,EAAE;AAAA,IACrD,MAAM;AAAA,MACJ;AAAA,MACA,GAAG,MAAM,KAAK,IAAI,CAAC;AAAA,IACrB;AAAA,EACF,CAAC;AACH;AAEA,SAAS,WAAW,KAA+B;AACjD,QAAM,QAAQ,QAAQ,GAAG,EAAE,2BAA2B,KAAK;AAC3D,QAAM,QAAQ,wBAAwB,KAAK,KAAK;AAChD,QAAM,SAAS;AAAA,IACb,UAAU;AAAA,IACV,OAAO,QAAQ,CAAC,CAAC;AAAA,IACjB,OAAO,QAAQ,CAAC,CAAC;AAAA,IACjB,OAAO,QAAQ,CAAC,CAAC;AAAA,EACnB;AACA,SAAO,OAAO,eAAe,QAAQ;AAAA,IACnC,MAAM,CAAC,gDAAgD,KAAK;AAAA,IAC5D,MAAM,QACF;AAAA,MACE;AAAA,MACA,GAAG,KAAK;AAAA,IACV,IACA,QACE,CAAC,2CAA2C,KAAK,IACjD,CAAC,iCAAiC,EAAE;AAAA,EAC5C,CAAC;AACH;AAQA,SAAS,WACP,KACA,IACA,KACA,OACA,MACA,KACa;AACb,QAAM,QAAQ,QAAQ,GAAG,EAAE,GAAG,KAAK;AACnC,SAAO,OAAO,IAAI,MAAM,UAAU,IAAI,KAAK,GAAG;AAAA,IAC5C,MAAM,CAAC,GAAG,GAAG,wCAAwC,IAAI,IAAI,KAAK;AAAA,IAClE,MAAM;AAAA,MACJ,GAAG,GAAG,gDAAgD,IAAI;AAAA,MAC1D,GAAG,KAAK,SAAS,GAAG,QAAQ,IAAI;AAAA,IAClC;AAAA,IACA,MAAM,CAAC,GAAG,GAAG,kCAAkC,KAAK;AAAA,IACpD,MAAM,CAAC,MAAM,GAAG,qBAAqB,EAAE;AAAA,EACzC,CAAC;AACH;AAGA,SAAS,UAAU,KAA+B;AAChD,SAAO,WAAW,KAAK,cAAc,QAAQ,iBAAiB,UAAU,MAAM;AAChF;AAEA,IAAM,YAAY;AAGlB,SAAS,WAAW,KAA+B;AACjD,SAAO,WAAW,KAAK,eAAe,SAAS,kBAAkB,UAAU,SAAS;AACtF;AAGA,SAAS,cAAc,KAA+B;AACpD,SAAO,WAAW,KAAK,mBAAmB,aAAa,kBAAkB,UAAU,SAAS;AAC9F;AAEA,IAAM,YAAY;AAGlB,SAAS,cAAc,KAA+B;AACpD,SAAO,WAAW,KAAK,mBAAmB,WAAW,qBAAqB,aAAa,SAAS;AAClG;AAGA,SAAS,UAAU,MAAsB;AACvC,SAAO,KAAK,QAAQ,oBAAoB,EAAE;AAC5C;AAGA,SAAS,mBAAmB,QAAoB,KAAsC;AACpF,QAAM,OAAO,MAAM,QAAQ,GAAG,IAAI,CAAC;AACnC,QAAM,YAAY,eAAe,OAAO,CAAC,SAAS,KAAK,IAAI,CAAC;AAC5D,QAAM,SAAS,UAAU,IAAI,CAAC,SAAS,OAAO,cAAc,IAAI,CAAC;AACjE,QAAM,SAAyB,UAAU;AAAA,IAAI,CAAC,MAAM,MAClD,eAAe,KAAK,IAAI,GAAa,OAAO,CAAC,CAAW;AAAA,EAC1D;AACA,QAAM,SAAS,UAAU,OAAO,CAAC,GAAG,MAAM,OAAO,CAAC,MAAM,QAAQ;AAChE,SAAO,OAAO,wBAAwB,aAAa,MAAM,GAAG;AAAA,IAC1D,MAAM,UAAU,SACZ;AAAA,MACE;AAAA,MACA;AAAA,IACF,IACA,CAAC,8BAA8B,MAAM,4BAA4B,iBAAiB;AAAA,IACtF,MAAM;AAAA,MACJ;AAAA,MACA,UAAU,IAAI,CAAC,MAAM,MAAM,GAAG,UAAU,IAAI,CAAC,KAAK,OAAO,CAAC,CAAC,EAAE,EAAE,KAAK,IAAI;AAAA,IAC1E;AAAA,IACA,MAAM;AAAA,MACJ;AAAA,MACA,GAAG,OACA;AAAA,QACC,CAAC,SACC,GAAG,UAAU,IAAI,CAAC,eAAe,KAAK,IAAI,CAAC,YAAY,OAAO,UAAU,QAAQ,IAAI,CAAC,CAAC;AAAA,MAC1F,EACC,KAAK,IAAI,CAAC;AAAA,IACf;AAAA,EACF,CAAC;AACH;AAGO,SAAS,UAAU,QAAmC;AAC3D,QAAM,OAAO,IAAI,KAAK,MAAM;AAC5B,QAAM,MAAM,KAAK,KAAkB,cAAc;AACjD,QAAM,aAAa,KAAK,KAAK,qBAAqB,kBAAkB;AACpE,QAAM,OAAO,UAAU,MAAM,GAAG;AAChC,SAAO;AAAA,IACL,WAAW,IAAI;AAAA,IACf,WAAW,IAAI;AAAA,IACf,QAAQ,IAAI;AAAA,IACZ,UAAU,IAAI;AAAA,IACd,WAAW,IAAI;AAAA,IACf,SAAS,IAAI;AAAA,IACb,OAAO,MAAM,UAAU;AAAA,IACvB,iBAAiB,MAAM,UAAU;AAAA,IACjC,SAAS,MAAM,GAAG;AAAA,IAClB,KAAK,MAAM,GAAG;AAAA,IACd,aAAa,IAAI;AAAA,IACjB,YAAY,IAAI;AAAA,IAChB,YAAY,IAAI;AAAA,IAChB,aAAa,IAAI;AAAA,IACjB,WAAW,IAAI;AAAA,IACf,UAAU,IAAI;AAAA,IACd,cAAc,IAAI;AAAA,IAClB,UAAU,IAAI;AAAA,IACd,KAAK,IAAI;AAAA,IACT,YAAY,IAAI;AAAA,IAChB,cAAc,GAAG;AAAA,IACjB,GAAI,MAAM,CAAC,MAAM,GAAG,GAAG,SAAS,GAAG,CAAC,IAAI,CAAC;AAAA,IACzC,UAAU,MAAM,QAAQ,GAAG;AAAA,IAC3B,gBAAgB,IAAI;AAAA,IACpB,iBAAiB,IAAI;AAAA,IACrB,iBAAiB,IAAI;AAAA,IACrB,YAAY,MAAM,GAAG;AAAA,IACrB,GAAI,MACA,CAAC,WAAW,GAAG,GAAG,UAAU,GAAG,GAAG,WAAW,GAAG,GAAG,cAAc,GAAG,GAAG,cAAc,GAAG,CAAC,IACzF,CAAC;AAAA,IACL,mBAAmB,QAAQ,GAAG;AAAA,EAChC;AACF;;;ACp2BA,SAAS,oBAAoB;AAC7B,SAAS,YAAY,aAAa,oBAAoB;AACtD,SAAS,SAAS,MAAM,eAAe;AAQvC,SAAS,iBAAiB,SAAiB,KAAuB;AAChE,MAAI,CAAC,WAAW,QAAQ,SAAS,GAAG,CAAC,EAAG,QAAO,CAAC;AAChD,SAAO,YAAY,QAAQ,SAAS,GAAG,GAAG,EAAE,eAAe,KAAK,CAAC,EAAE,QAAQ,CAAC,UAAU;AACpF,UAAM,OAAO,KAAK,KAAK,MAAM,IAAI;AACjC,QAAI,MAAM,YAAY,EAAG,QAAO,SAAS,MAAM,IAAI,IAAI,iBAAiB,SAAS,IAAI,IAAI,CAAC;AAC1F,WAAO,kBAAkB,MAAM,IAAI,IAAI,CAAC,IAAI,IAAI,CAAC;AAAA,EACnD,CAAC;AACH;AAGA,SAAS,WAAW,OAAe,OAAgC;AACjE,MAAI,MAAM;AACV,QAAM,OAAO,QAAQ,GAAG;AACxB,SAAO,QAAQ,MAAM;AACnB,UAAM,MAAM,MAAM,IAAI,CAAC,SAAS,QAAQ,KAAK,IAAI,CAAC,EAAE,KAAK,CAAC,SAAS,WAAW,IAAI,CAAC;AACnF,QAAI,IAAK,QAAO;AAChB,QAAI,WAAW,QAAQ,KAAK,MAAM,CAAC,EAAG;AACtC,UAAM,QAAQ,GAAG;AAAA,EACnB;AACA,SAAO;AACT;AAGA,SAAS,UAAU,aAA6B;AAC9C,MAAI;AACF,WAAO,aAAa,OAAO,CAAC,QAAQ,aAAa,SAAS,GAAG;AAAA,MAC3D,UAAU;AAAA,MACV,OAAO,CAAC,UAAU,QAAQ,QAAQ;AAAA,IACpC,CAAC,EAAE,KAAK;AAAA,EACV,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEO,SAAS,WAAW,SAAiB,gBAAgB,WAAuB;AACjF,QAAM,OAAO,CAAC,SAAkB,WAAW,IAAI,IAAI,aAAa,MAAM,OAAO,IAAI;AACjF,SAAO;AAAA,IACL,QAAQ,CAAC,YAAY,WAAW,QAAQ,SAAS,OAAO,CAAC;AAAA,IACzD,MAAM,CAAC,YAAY,KAAK,QAAQ,SAAS,OAAO,CAAC;AAAA,IACjD,YAAY,CAAC,UAAU;AACrB,YAAM,OAAO,WAAW,SAAS,KAAK;AACtC,aAAO,SAAS,OAAO,OAAO,EAAE,MAAM,SAAS,aAAa,MAAM,OAAO,EAAE;AAAA,IAC7E;AAAA,IACA;AAAA,IACA,aAAa,CAAC,SAAS,KAAK,QAAQ,CAAC,QAAQ,iBAAiB,SAAS,GAAG,CAAC;AAAA,EAC7E;AACF;;;ACrDA,IAAM,QAAgC;AAAA,EACpC,MAAM;AAAA,EACN,MAAM;AAAA,EACN,MAAM;AAAA,EACN,SAAS;AAAA,EACT,MAAM;AACR;AAGA,IAAM,SAA+B;AAAA,EACnC,CAAC,qBAAqB,CAAC,eAAe,eAAe,WAAW,cAAc,aAAa,CAAC;AAAA,EAC5F;AAAA,IACE;AAAA,IACA,CAAC,YAAY,UAAU,qBAAqB,YAAY,QAAQ,YAAY,OAAO;AAAA,EACrF;AAAA,EACA;AAAA,IACE;AAAA,IACA,CAAC,iBAAiB,gBAAgB,gBAAgB,iBAAiB,eAAe,YAAY;AAAA,EAChG;AAAA,EACA,CAAC,qBAAqB,CAAC,kBAAkB,kBAAkB,YAAY,CAAC;AAAA,EACxE;AAAA,IACE;AAAA,IACA;AAAA,MACE;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAAA,EACA,CAAC,qBAAqB,CAAC,cAAc,eAAe,mBAAmB,iBAAiB,CAAC;AAAA,EACzF,CAAC,oBAAoB,CAAC,sBAAsB,CAAC;AAAA,EAC7C,CAAC,YAAY,CAAC,cAAc,QAAQ,cAAc,CAAC;AACrD;AAGA,SAAS,WAAW,MAAc,KAAe,SAAkC;AACjF,QAAM,QAAQ,IAAI,QAAQ,CAAC,OAAO;AAChC,UAAM,IAAI,QAAQ,KAAK,CAAC,MAAM,EAAE,OAAO,EAAE;AACzC,QAAI,CAAC,EAAG,QAAO,CAAC;AAChB,UAAM,SAAS,EAAE,SAAS,aAAa,EAAE,MAAM,YAAY;AAC3D,WAAO,CAAC,KAAK,MAAM,EAAE,MAAM,CAAC,IAAI,EAAE,KAAK,GAAG,MAAM,EAAE;AAAA,EACpD,CAAC;AACD,SAAO,CAAC,UAAU,IAAI,WAAW,GAAG,OAAO,EAAE;AAC/C;AAGA,SAAS,UAAU,UAA4B;AAC7C,QAAM,QAAQ,CAAC,MAAc,gBAAgB,UAAU,GAAG,CAAC;AAC3D,QAAM,UAAU,MAAM,MAAM;AAC5B,QAAM,WAAW,MAAM,MAAM;AAC7B,QAAM,cAAc,MAAM,SAAS;AACnC,SACE,iBAAiB,MAAM,MAAM,CAAC,IAAI,YAAY,QAAQ,CAAC,aACtD,UAAU,IAAI,aAAa,OAAO,qBAAqB,OACvD,WAAW,IAAI,aAAa,QAAQ,sBAAsB,OAC1D,cAAc,IAAI,aAAa,WAAW,yBAAyB;AAExE;AAGO,SAAS,YAAY,UAAkB,SAAiB,SAAkC;AAC/F,QAAM,WAAW,QAAQ,IAAI,CAAC,MAAM,EAAE,MAAM;AAC5C,QAAM,UACJ,gBAAgB,UAAU,QAAQ,CAAC,IAAI,IACnC,CAAC,wCAAwC,SAAS,EAAE,IACpD,CAAC;AACP,SAAO;AAAA,IACL;AAAA,IACA,wBAAwB,QAAQ;AAAA,IAChC,SAAS,OAAO;AAAA,IAChB;AAAA,IACA,GAAG,OAAO,QAAQ,CAAC,CAAC,MAAM,GAAG,MAAM,WAAW,MAAM,KAAK,OAAO,CAAC;AAAA,IACjE,UAAU,QAAQ;AAAA,IAClB;AAAA,IACA,GAAG;AAAA,EACL;AACF;;;AJlEA,IAAM,QAAQ;AAAA,EACZ;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAGO,SAAS,UAAU,MAAgB,IAAmB;AAC3D,QAAM,UAAUC,SAAQ,KAAK,CAAC,KAAK,GAAG;AACtC,MAAI,CAACC,YAAW,OAAO,GAAG;AACxB,OAAG,MAAM,6BAA6B,OAAO,EAAE;AAC/C,WAAO;AAAA,EACT;AACA,MAAI,CAACA,YAAWD,SAAQ,SAAS,cAAc,CAAC,GAAG;AACjD,OAAG,MAAM,6BAA6B,OAAO,EAAE;AAC/C,UAAM,QAAQ,CAAC,SAAS,GAAG,MAAM,IAAI,CAAC;AACtC,WAAO;AAAA,EACT;AACA,QAAM,UAAU,WAAW,GAAG,UAAU,YAAY,OAAO,CAAC;AAC5D,cAAY,SAAS,OAAO,GAAG,SAAS,OAAO,EAAE,QAAQ,CAAC,SAAS,GAAG,IAAI,IAAI,CAAC;AAC/E,SAAO,WAAW,QAAQ,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC;AAChD;;;AK3BA,QAAQ;AAAA,EACN,UAAU,QAAQ,KAAK,MAAM,CAAC,GAAG;AAAA,IAC/B,KAAK,CAAC,SAAS,QAAQ,IAAI,IAAI;AAAA,IAC/B,OAAO,CAAC,SAAS,QAAQ,MAAM,IAAI;AAAA,EACrC,CAAC;AACH;","names":["existsSync","resolve","resolve","existsSync"]}
@@ -18,6 +18,22 @@ function isWordChar(c) {
18
18
  return c >= 65 && c <= 90 || c >= 97 && c <= 122 || c >= 48 && c <= 57 || c === 95;
19
19
  }
20
20
 
21
+ // ../utils/src/back-scan.ts
22
+ function spaceRunStart(s, e) {
23
+ if (e === 0 || !isJsSpace(s.charCodeAt(e - 1))) return e;
24
+ return spaceRunStart(s, e - 1);
25
+ }
26
+ function openBraceBefore(s, k, depth) {
27
+ if (k === 0) return -1;
28
+ const c = s.charCodeAt(k - 1);
29
+ if (c === 123) return depth === 0 ? k - 1 : openBraceBefore(s, k - 1, depth - 1);
30
+ if (c === 125) return openBraceBefore(s, k - 1, depth + 1);
31
+ return openBraceBefore(s, k - 1, depth);
32
+ }
33
+ function wordEndsAt(s, w, e) {
34
+ return w.length <= e && s.slice(e - w.length, e) === w && (e === w.length || !isWordChar(s.charCodeAt(e - w.length - 1)));
35
+ }
36
+
21
37
  // ../utils/src/strings.ts
22
38
  function codeAt(s, i) {
23
39
  return i >= 0 && i < s.length ? s.charCodeAt(i) : -1;
@@ -165,13 +181,24 @@ function wordAt(s, i) {
165
181
  function allowedGcValue(s, p) {
166
182
  return startsWithAt(s, "Infinity", p) && !wordAt(s, p + 8) || startsWithAt(s, "resolveGcTime(", p) || startsWithAt(s, "0", p) && !wordAt(s, p + 1);
167
183
  }
168
- function finiteGcTimeAt(s, k) {
184
+ function gcTimeSetAt(s, k) {
169
185
  if (!startsWithAt(s, "gcTime", k)) return false;
170
186
  const a = spaceRunEnd(s, k + 6);
171
187
  if (codeAt(s, a) !== 58) return false;
172
188
  const p = spaceRunEnd(s, a + 1);
173
189
  return p < s.length && !allowedGcValue(s, p);
174
190
  }
191
+ function inTierObjectAt(s, k) {
192
+ const b = openBraceBefore(s, k, 0);
193
+ if (b < 0) return false;
194
+ const c = spaceRunStart(s, b);
195
+ if (c === 0 || s.charCodeAt(c - 1) !== 58) return false;
196
+ const e = spaceRunStart(s, c - 1);
197
+ return wordEndsAt(s, "static", e) || wordEndsAt(s, "semiStatic", e);
198
+ }
199
+ function finiteGcTimeAt(s, k) {
200
+ return gcTimeSetAt(s, k) && !inTierObjectAt(s, k);
201
+ }
175
202
  function hasFiniteGcTime(s) {
176
203
  let k = 0;
177
204
  while (k < s.length) {
@@ -371,4 +398,4 @@ export {
371
398
  exitCodeOf,
372
399
  resolveUrl
373
400
  };
374
- //# sourceMappingURL=chunk-5QU6KOO3.js.map
401
+ //# sourceMappingURL=chunk-AAHHCSZC.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"sources":["../../foundation/src/chars.ts","../../utils/src/back-scan.ts","../../utils/src/strings.ts","../../utils/src/versions.ts","../src/doctor/rules.ts"],"sourcesContent":["//@ backend dafny\n\n/* Character classes over UTF-16 code units (what charCodeAt returns), verified with\n LemmaScript → Dafny (model: models/Foundation.dfy; link: models/links/foundation-chars.dfy).\n Every contract is an iff, so an importer, which sees only the contract, knows each class\n exactly. */\n\n/**\n * A decimal digit: 0-9.\n *\n * @ensures result ⟺ c ∈ [48, 57]\n */\nexport function isDigit(c: number): boolean {\n //@ verify\n //@ ensures \\result <==> (c >= 48 && c <= 57)\n return c >= 48 && c <= 57;\n}\n\n/**\n * A JS line terminator (what regex `.` doesn't match): LF, CR, LS, PS.\n *\n * @ensures result ⟺ c ∈ {10, 13, 8232, 8233}\n */\nexport function isLineTerminator(c: number): boolean {\n //@ verify\n //@ ensures \\result <==> (c === 10 || c === 13 || c === 8232 || c === 8233)\n return c === 10 || c === 13 || c === 8232 || c === 8233;\n}\n\n/**\n * The code ASCII-lowered: A-Z to a-z, any other value (-1 from `codeAt` included) unchanged.\n *\n * @ensures exactly the model's LowerCode\n */\nexport function lowerCode(c: number): number {\n //@ verify\n //@ ensures \\result === (c >= 65 && c <= 90 ? c + 32 : c)\n return c >= 65 && c <= 90 ? c + 32 : c;\n}\n/**\n * A lowercase ASCII letter: a-z.\n *\n * @ensures result ⟺ c ∈ [97, 122]\n */\nexport function isLowerAlphaChar(c: number): boolean {\n //@ verify\n //@ ensures \\result <==> (c >= 97 && c <= 122)\n return c >= 97 && c <= 122;\n}\n\n/**\n * An ASCII letter or digit: A-Z a-z 0-9.\n *\n * @ensures result ⟺ c ∈ [A-Z] ∪ [a-z] ∪ [0-9]\n */\nexport function isAlnumChar(c: number): boolean {\n //@ verify\n //@ ensures \\result <==> ((c >= 65 && c <= 90) || (c >= 97 && c <= 122) || (c >= 48 && c <= 57))\n return (c >= 65 && c <= 90) || (c >= 97 && c <= 122) || (c >= 48 && c <= 57);\n}\n\n/**\n * A lowercase hex digit: 0-9 a-f.\n *\n * @ensures result ⟺ c ∈ [0-9] ∪ [a-f]\n */\nexport function isLowerHexChar(c: number): boolean {\n //@ verify\n //@ ensures \\result <==> ((c >= 48 && c <= 57) || (c >= 97 && c <= 102))\n return (c >= 48 && c <= 57) || (c >= 97 && c <= 102);\n}\n\n/**\n * A hex digit in either case: 0-9 a-f A-F.\n *\n * @ensures result ⟺ c ∈ [0-9] ∪ [a-f] ∪ [A-F]\n */\nexport function isHexChar(c: number): boolean {\n //@ verify\n //@ ensures \\result <==> ((c >= 48 && c <= 57) || (c >= 97 && c <= 102) || (c >= 65 && c <= 70))\n return (c >= 48 && c <= 57) || (c >= 97 && c <= 102) || (c >= 65 && c <= 70);\n}\n\n/**\n * A base64url character (RFC 4648 §5): A-Z a-z 0-9 - _.\n *\n * @ensures result ⟺ c ∈ [A-Z] ∪ [a-z] ∪ [0-9] ∪ {\"-\", \"_\"} — never \".\" or \"=\"\n */\nexport function isBase64UrlChar(c: number): boolean {\n //@ verify\n //@ ensures \\result <==> ((c >= 65 && c <= 90) || (c >= 97 && c <= 122) || (c >= 48 && c <= 57) || c === 45 || c === 95)\n return (\n (c >= 65 && c <= 90) || (c >= 97 && c <= 122) || (c >= 48 && c <= 57) || c === 45 || c === 95\n );\n}\n\n/**\n * JS whitespace, the regex `\\s` and what `trim()` strips: tab, LF, VT, FF, CR, space, NBSP,\n * U+1680, U+2000-U+200A, LS, PS, U+202F, U+205F, U+3000 and the BOM.\n *\n * @ensures result ⟺ c ∈ {9..13, 32, 160, 5760, 8192..8202, 8232, 8233, 8239, 8287, 12288, 65279}\n */\nexport function isJsSpace(c: number): boolean {\n //@ verify\n //@ ensures \\result <==> ((c >= 9 && c <= 13) || c === 32 || c === 160 || c === 5760 || (c >= 8192 && c <= 8202) || c === 8232 || c === 8233 || c === 8239 || c === 8287 || c === 12288 || c === 65279)\n return isAsciiSpace(c) || isGeneralPunctuationSpace(c) || isOtherSpace(c);\n}\n\n/**\n * ASCII whitespace: tab, LF, VT, FF, CR and space.\n *\n * @ensures result ⟺ c ∈ [9, 13] ∪ {32}\n */\nfunction isAsciiSpace(c: number): boolean {\n //@ verify\n //@ ensures \\result <==> ((c >= 9 && c <= 13) || c === 32)\n return (c >= 9 && c <= 13) || c === 32;\n}\n\n/**\n * The spaces in the General Punctuation block: U+2000-U+200A, LS, PS, U+202F, U+205F.\n *\n * @ensures result ⟺ c ∈ [8192, 8202] ∪ {8232, 8233, 8239, 8287}\n */\nfunction isGeneralPunctuationSpace(c: number): boolean {\n //@ verify\n //@ ensures \\result <==> ((c >= 8192 && c <= 8202) || c === 8232 || c === 8233 || c === 8239 || c === 8287)\n return (c >= 8192 && c <= 8202) || c === 8232 || c === 8233 || c === 8239 || c === 8287;\n}\n\n/**\n * The other spaces: NBSP, U+1680 (Ogham), U+3000 (ideographic) and the BOM.\n *\n * @ensures result ⟺ c ∈ {160, 5760, 12288, 65279}\n */\nfunction isOtherSpace(c: number): boolean {\n //@ verify\n //@ ensures \\result <==> (c === 160 || c === 5760 || c === 12288 || c === 65279)\n return c === 160 || c === 5760 || c === 12288 || c === 65279;\n}\n\n/**\n * A word character, the regex `\\w`: A-Z a-z 0-9 _.\n *\n * @ensures result ⟺ c ∈ [A-Z] ∪ [a-z] ∪ [0-9] ∪ {\"_\"}\n */\nexport function isWordChar(c: number): boolean {\n //@ verify\n //@ ensures \\result <==> ((c >= 65 && c <= 90) || (c >= 97 && c <= 122) || (c >= 48 && c <= 57) || c === 95)\n return (c >= 65 && c <= 90) || (c >= 97 && c <= 122) || (c >= 48 && c <= 57) || c === 95;\n}\n\n/**\n * A snake_case character: a-z 0-9 _.\n *\n * @ensures result ⟺ c ∈ [a-z] ∪ [0-9] ∪ {\"_\"}\n */\nexport function isSnakeChar(c: number): boolean {\n //@ verify\n //@ ensures \\result <==> ((c >= 97 && c <= 122) || (c >= 48 && c <= 57) || c === 95)\n return (c >= 97 && c <= 122) || (c >= 48 && c <= 57) || c === 95;\n}\n","//@ backend dafny\nimport { isJsSpace, isWordChar } from \"@atlas/foundation/chars\";\n\n/* Backward text scans (atlas#203): reading a text right to left from a position, verified with\n LemmaScript → Dafny (model: models/BackScan.dfy; link: models/links/utils-back-scan.dfy).\n General scans no domain rule shapes; augur-doctor uses them to tell a cache tier's gcTime\n from a React Query one. Recursive, so specs can name them. */\n\n/**\n * The start of the JS-whitespace (`\\s`) run ending at `e`: the least index ≤ e such that every\n * character from it up to `e` is whitespace.\n *\n * @ensures exactly the model's SpaceRunStart\n */\nexport function spaceRunStart(s: string, e: number): number {\n //@ verify\n //@ type e nat\n //@ requires e >= 0 && e <= s.length\n //@ decreases e\n //@ ensures \\result >= 0 && \\result <= e\n //@ ensures \\result === (e === 0 || !isJsSpace(s.charCodeAt(e - 1)) ? e : spaceRunStart(s, e - 1))\n if (e === 0 || !isJsSpace(s.charCodeAt(e - 1))) return e;\n return spaceRunStart(s, e - 1);\n}\n\n/**\n * The nearest `{` before `k` that no `}` between it and `k` closes (`depth` counts the `}` still\n * unmatched on the way back; start at 0), or -1 when there is none, as `indexOf` (a nullable\n * index can't be read by an importer: models/LSC-GAPS.md).\n *\n * @ensures exactly the model's OpenBraceBefore\n */\nexport function openBraceBefore(s: string, k: number, depth: number): number {\n //@ verify\n //@ type k nat\n //@ type depth nat\n //@ requires k >= 0 && k <= s.length && depth >= 0\n //@ decreases k\n //@ ensures \\result >= -1 && \\result < k\n //@ ensures \\result >= 0 ==> s.charCodeAt(\\result) === 123\n if (k === 0) return -1;\n const c = s.charCodeAt(k - 1);\n if (c === 123) return depth === 0 ? k - 1 : openBraceBefore(s, k - 1, depth - 1);\n if (c === 125) return openBraceBefore(s, k - 1, depth + 1);\n return openBraceBefore(s, k - 1, depth);\n}\n\n/**\n * The word `w` ends at `e`: the text right before `e` is `w`, and no word character (`\\w`) comes\n * right before that.\n *\n * @ensures exactly the model's WordEndsAt\n */\nexport function wordEndsAt(s: string, w: string, e: number): boolean {\n //@ verify\n //@ type e nat\n //@ requires e >= 0 && e <= s.length\n //@ ensures \\result === (w.length <= e && s.slice(e - w.length, e) === w && (e === w.length || !isWordChar(s.charCodeAt(e - w.length - 1))))\n return (\n w.length <= e &&\n s.slice(e - w.length, e) === w &&\n (e === w.length || !isWordChar(s.charCodeAt(e - w.length - 1)))\n );\n}\n","//@ 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 \"@atlas/foundation/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 //@ requires i >= 0\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 //@ requires i >= 0\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 //@ requires i >= 0\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 //@ requires i >= 0\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 * `s` is `min` to `max` ASCII digits long and nothing else (`/^\\d{min,max}$/`).\n *\n * @ensures result ⟺ min ≤ |s| ≤ max ∧ ∀ k ∈ [0, |s|). s[k] ∈ 0-9 — stated over the codes,\n * so an importer can use it\n */\nexport function isDigitsOfLength(s: string, min: number, max: number): boolean {\n //@ verify\n //@ type min nat\n //@ type max nat\n //@ requires min >= 0\n //@ requires max >= 0\n //@ ensures \\result <==> (min <= s.length && s.length <= max && forall(k: nat, k < s.length ==> (s.charCodeAt(k) >= 48 && s.charCodeAt(k) <= 57)))\n return min <= s.length && s.length <= max && digitsFrom(s, 0);\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 //@ requires i >= 0\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 //@ requires i >= 0\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 //@ requires i >= 0\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 //@ requires i >= 0\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 0 <= end && 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 0 <= i && 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 && from >= 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| ∧ ∀ k < |s|. result[k] = (s[k] ∈ A-Z ? s[k] + 32 : s[k]) — A-Z\n * lowered, every other code unit unchanged; true in JS (a contract `=== s.toLowerCase()` held\n * only in lsc's ASCII model of the built-in, Fable review 2026-11-06). Helper-free, since an\n * importer is given only the helpers its own body calls; exactly the model's LowerAscii in\n * the link\n */\nexport function lowerAscii(s: string): string {\n //@ verify\n //@ decreases s.length\n //@ ensures \\result.length === s.length\n //@ ensures forall(k: nat, k < s.length ==> \\result.charCodeAt(k) === ((s.charCodeAt(k) >= 65 && s.charCodeAt(k) <= 90) ? s.charCodeAt(k) + 32 : s.charCodeAt(k)))\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| ∧ ∀ j < |x|. lowered(s[pos + j]) = x[j] — the text at pos,\n * ASCII-lowered (A-Z + 32), is x; helper-free; exactly the model's StartsWithCaseless in the link\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 && forall(j: nat, j < x.length ==> ((s.charCodeAt(pos + j) >= 65 && s.charCodeAt(pos + j) <= 90) ? s.charCodeAt(pos + j) + 32 : s.charCodeAt(pos + j)) === x.charCodeAt(j)))\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 * The end of the ASCII-digit run starting at `i` (a regex's `\\d+`, from `i`): the first index\n * ≥ i that is not 0-9, or |s|.\n *\n * @ensures i ≤ result ≤ |s| ∧ s[i, result) all digits ∧ (result = |s| ∨ ¬digit(s[result])) —\n * exactly the model's DigitRunEnd\n */\nexport function digitRunEnd(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) ==> (s.charCodeAt(k) >= 48 && s.charCodeAt(k) <= 57))\n //@ ensures \\result < s.length ==> !(s.charCodeAt(\\result) >= 48 && s.charCodeAt(\\result) <= 57)\n // codeAt is -1 at the end, which is no digit\n if (!isDigit(codeAt(s, i))) return i;\n return digitRunEnd(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 * A canonical natural number's value, 0 for any other text (a count written as JSON).\n *\n * @ensures exactly the model's CanonicalNatValue (in the link: `digitsValue` needs the digits\n * isCanonicalNat's contract gives, which a contract can't call for); 0 for other text\n */\nexport function canonicalNatValue(s: string): number {\n //@ verify\n //@ ensures \\result >= 0\n //@ ensures !isCanonicalNat(s) ==> \\result === 0\n if (!isCanonicalNat(s)) return 0;\n return digitsValue(s);\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 // the run's end as a loop too: spaceRunEnd takes a frame per space (Fable review 2026-11-06)\n let e = i + 1;\n while (e !== s.length && isJsSpace(s.charCodeAt(e))) {\n //@ invariant i < e && e <= s.length\n //@ invariant forall(k: nat, (i <= k && k < e) ==> isJsSpace(s.charCodeAt(k)))\n //@ decreases s.length - e\n e = e + 1;\n }\n i = e;\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 // `<= 0`, not `=== 0`: the same for a nat, and a fraction a caller slips in (outside the\n // contract) ends instead of recursing forever (Fable review 2026-11-06: spaces(0.5))\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 * The first code point of `w` as text: a surrogate pair whole, else the first code unit, or \"\"\n * (Fable review 2026-11-06: an astral initial was a lone surrogate).\n *\n * @ensures exactly the model's FirstChar\n */\nexport function firstCodePoint(w: string): string {\n //@ verify\n //@ ensures \\result === ((w.length >= 2 && w.charCodeAt(0) >= 55296 && w.charCodeAt(0) <= 56319 && w.charCodeAt(1) >= 56320 && w.charCodeAt(1) <= 57343) ? w.slice(0, 2) : (w.length > 0 ? w.slice(0, 1) : \"\"))\n if (w.length >= 2) {\n const hi = w.charCodeAt(0);\n const lo = w.charCodeAt(1);\n if (hi >= 55296 && hi <= 56319 && lo >= 56320 && lo <= 57343) return w.slice(0, 2);\n }\n return w.length > 0 ? w.slice(0, 1) : \"\";\n}\n\n/**\n * An ASCII letter (A-Z, a-z) somewhere in `w` from `i` on (moved from readability.ts\n * 2026-11-06, so `readableWords`' contract can name it and importers resolve it).\n *\n * @ensures result ⟺ ∃ k ∈ [i, |w|). w[k] ∈ A-Z ∪ a-z — at i = 0 exactly the model's HasAsciiLetter\n */\nexport function hasAsciiLetterFrom(w: string, i: number): boolean {\n //@ verify\n //@ type i nat\n //@ requires i >= 0\n //@ decreases w.length - i\n //@ ensures \\result <==> exists(k: nat, i <= k && k < w.length && ((w.charCodeAt(k) >= 65 && w.charCodeAt(k) <= 90) || (w.charCodeAt(k) >= 97 && w.charCodeAt(k) <= 122)))\n if (i >= w.length) return false;\n const c = w.charCodeAt(i);\n if ((c >= 65 && c <= 90) || (c >= 97 && c <= 122)) return true;\n return hasAsciiLetterFrom(w, 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| ∧ ∀ k < |s|. result[k] = (s[k] ∈ a-z ? s[k] − 32 : s[k]) — a-z\n * raised, every other code unit unchanged; exactly the model's UpperAscii in the link\n */\nexport function upperAscii(s: string): string {\n //@ verify\n //@ decreases s.length\n //@ ensures \\result.length === s.length\n //@ ensures forall(k: nat, k < s.length ==> \\result.charCodeAt(k) === ((s.charCodeAt(k) >= 97 && s.charCodeAt(k) <= 122) ? s.charCodeAt(k) - 32 : s.charCodeAt(k)))\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\n\n/* Comparing an x.y.z version with a floor (model: models/Versions.dfy; link:\n models/links/utils-versions.dfy). Part by part: semver and CalVer order, no pre-release tags. */\n\n/**\n * `major.minor.patch` is at or above `floorMajor.floorMinor.floorPatch`: the first part that\n * differs decides.\n *\n * @ensures result ⟺ major > floorMajor ∨ (major = floorMajor ∧ (minor > floorMinor ∨\n * (minor = floorMinor ∧ patch ≥ floorPatch))), the model's Versions.AtLeast\n */\nexport function versionAtLeast(\n major: number,\n minor: number,\n patch: number,\n floorMajor: number,\n floorMinor: number,\n floorPatch: number,\n): boolean {\n //@ verify\n //@ ensures \\result === (major > floorMajor || (major === floorMajor && (minor > floorMinor || (minor === floorMinor && patch >= floorPatch))))\n return (\n major > floorMajor ||\n (major === floorMajor && (minor > floorMinor || (minor === floorMinor && patch >= floorPatch)))\n );\n}\n","//@ backend dafny\nimport { isWordChar } from \"@atlas/foundation/chars\";\nimport { openBraceBefore, spaceRunStart, wordEndsAt } from \"@atlas/utils/back-scan\";\nimport {\n codeAt,\n digitRunEnd,\n digitsValue,\n endsWith,\n spaceRunEnd,\n startsWithAt,\n} from \"@atlas/utils/strings\";\nimport { versionAtLeast } from \"@atlas/utils/versions\";\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 * next-proxy (atlas#88): Next.js 16 renamed the `middleware` file convention to `proxy`. Both\n * files fail (Next 16's build throws on both); proxy alone passes; middleware alone warns (it\n * still runs, deprecated); neither skips.\n *\n * @ensures exactly the model's MiddlewareStatus\n */\nexport function middlewareStatus(hasMiddleware: boolean, hasProxy: boolean): Status {\n //@ verify\n //@ ensures hasMiddleware && hasProxy ==> \\result === \"FAIL\"\n //@ ensures !hasMiddleware && hasProxy ==> \\result === \"PASS\"\n //@ ensures hasMiddleware && !hasProxy ==> \\result === \"WARN\"\n //@ ensures !hasMiddleware && !hasProxy ==> \\result === \"SKIP\"\n if (hasProxy) return hasMiddleware ? \"FAIL\" : \"PASS\";\n return hasMiddleware ? \"WARN\" : \"SKIP\";\n}\n\n/**\n * Where Next.js reads a file convention: the site root or `src/`, as `.ts` or `.js`.\n *\n * @ensures exactly the model's ConventionPath\n */\nexport function conventionPath(name: string, inSrc: boolean, js: boolean): string {\n //@ verify\n //@ ensures \\result === (inSrc ? \"src/\" : \"\") + name + (js ? \".js\" : \".ts\")\n return (inSrc ? \"src/\" : \"\") + name + (js ? \".js\" : \".ts\");\n}\n\n/**\n * next-proxy's WARN detail: the middleware file to rename, the codemod, Node.js only, the fix.\n *\n * @ensures exactly the model's ProxyWarnDetail\n */\nexport function proxyWarnDetail(middleware: string, fix: string): string {\n //@ verify\n //@ ensures \\result === middleware + \": rename the file and its middleware() export to proxy(), or run \" + \"npx @next/codemod@canary middleware-to-proxy . (proxy runs on Node.js only) -- \" + fix\n return (\n middleware +\n \": rename the file and its middleware() export to proxy(), or run \" +\n \"npx @next/codemod@canary middleware-to-proxy . (proxy runs on Node.js only) -- \" +\n fix\n );\n}\n\n/**\n * next-proxy's FAIL detail: delete the middleware file, keep the proxy file.\n *\n * @ensures exactly the model's ProxyFailDetail\n */\nexport function proxyFailDetail(middleware: string, proxy: string, fix: string): string {\n //@ verify\n //@ ensures \\result === middleware + \" and \" + proxy + \": delete \" + middleware + \", keep \" + proxy + \" -- \" + fix\n return middleware + \" and \" + proxy + \": delete \" + middleware + \", keep \" + proxy + \" -- \" + fix;\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 * query-gc-time's offender (#94): a file that sets a finite gcTime, or that spreads a\n * CACHE_CONFIG tier while the site's augur-utils may predate the server-safe tiers (a spread\n * on a fixed augur-utils is safe; owner 2026-11-07: \"only for older version before this fix\").\n *\n * @ensures exactly the model's GcTimeOffender\n */\nexport function gcTimeOffender(\n finiteLiteral: boolean,\n spreadsTier: boolean,\n utilsBeforeFix: boolean,\n): boolean {\n //@ verify\n //@ ensures \\result <==> (finiteLiteral || (spreadsTier && utilsBeforeFix))\n return finiteLiteral || (spreadsTier && utilsBeforeFix);\n}\n\n/**\n * The first augur-utils with server-safe CACHE_CONFIG tiers: 2026.11.3.\n *\n * @ensures exactly the model's ServerSafeTiersVersion\n */\nexport function serverSafeTiersVersion(year: number, minor: number, patch: number): boolean {\n //@ verify\n //@ ensures \\result === (year > 2026 || (year === 2026 && minor > 11) || (year === 2026 && minor === 11 && patch >= 3))\n return (\n year > 2026 || (year === 2026 && minor > 11) || (year === 2026 && minor === 11 && patch >= 3)\n );\n}\n\n/**\n * The site's augur-utils range may give a version before the fix: its lowest version (the\n * first x.y.z in the range, `parsed`) is older. No recognised version is not.\n *\n * @ensures exactly the model's UtilsBeforeServerSafeTiers\n */\nexport function utilsBeforeServerSafeTiers(\n parsed: boolean,\n year: number,\n minor: number,\n patch: number,\n): boolean {\n //@ verify\n //@ ensures \\result === (parsed && !serverSafeTiersVersion(year, minor, patch))\n return parsed && !serverSafeTiersVersion(year, minor, patch);\n}\n\n/* query-gc-time's text scans (#94): each is exactly the regex it replaced, which the tests keep\n as its oracle. A `…From` function is the spec (one call per character); the scan run over a\n whole file is its loop twin, proved equal, at a constant stack depth. */\n\n/** A word character (`\\w`) at `i`; none past the end. */\nfunction wordAt(s: string, i: number): boolean {\n //@ verify\n //@ type i nat\n //@ ensures \\result <==> (i < s.length && isWordChar(s.charCodeAt(i)))\n return isWordChar(codeAt(s, i));\n}\n\n/**\n * After `gcTime:`, an allowed value: `Infinity` or `0` as a whole word, or a `resolveGcTime(`\n * call (`(?!Infinity\\b|resolveGcTime\\(|0\\b)`).\n *\n * @ensures exactly the model's AllowedGcValue\n */\nfunction allowedGcValue(s: string, p: number): boolean {\n //@ verify\n //@ type p nat\n //@ ensures \\result <==> ((startsWithAt(s, \"Infinity\", p) && !wordAt(s, p + 8)) || startsWithAt(s, \"resolveGcTime(\", p) || (startsWithAt(s, \"0\", p) && !wordAt(s, p + 1)))\n return (\n (startsWithAt(s, \"Infinity\", p) && !wordAt(s, p + 8)) ||\n startsWithAt(s, \"resolveGcTime(\", p) ||\n (startsWithAt(s, \"0\", p) && !wordAt(s, p + 1))\n );\n}\n\n/**\n * `gcTime\\s*:\\s*(?!Infinity\\b|resolveGcTime\\(|0\\b)\\S` at `k`: \"gcTime\", spaces, \":\", spaces,\n * then a character that is no space and no allowed value.\n *\n * @ensures exactly the model's GcTimeSetAt\n */\nfunction gcTimeSetAt(s: string, k: number): boolean {\n //@ verify\n //@ type k nat\n //@ requires k <= s.length\n //@ ensures !startsWithAt(s, \"gcTime\", k) ==> !\\result\n if (!startsWithAt(s, \"gcTime\", k)) return false;\n const a = spaceRunEnd(s, k + 6);\n if (codeAt(s, a) !== 58) return false;\n const p = spaceRunEnd(s, a + 1);\n return p < s.length && !allowedGcValue(s, p);\n}\n\n/**\n * A cache tier's object (atlas#203): the nearest unclosed `{` before `k` is the value of a\n * `static` or `semiStatic` key (augur-core CacheConfig's two tiers), as `static: {`. A tier's\n * gcTime is browser-only: the proxies set `gcTime: resolveGcTime(tier.gcTime)`, `Infinity` on\n * the server, so it never leaks.\n *\n * @ensures exactly the model's InTierObjectAt\n */\nfunction inTierObjectAt(s: string, k: number): boolean {\n //@ verify\n //@ type k nat\n //@ requires k <= s.length\n //@ ensures \\result === (openBraceBefore(s, k, 0) >= 0 && spaceRunStart(s, openBraceBefore(s, k, 0)) > 0 && s.charCodeAt(spaceRunStart(s, openBraceBefore(s, k, 0)) - 1) === 58 && (wordEndsAt(s, \"static\", spaceRunStart(s, spaceRunStart(s, openBraceBefore(s, k, 0)) - 1)) || wordEndsAt(s, \"semiStatic\", spaceRunStart(s, spaceRunStart(s, openBraceBefore(s, k, 0)) - 1))))\n const b = openBraceBefore(s, k, 0);\n if (b < 0) return false;\n const c = spaceRunStart(s, b);\n if (c === 0 || s.charCodeAt(c - 1) !== 58) return false;\n const e = spaceRunStart(s, c - 1);\n return wordEndsAt(s, \"static\", e) || wordEndsAt(s, \"semiStatic\", e);\n}\n\n/**\n * A finite gcTime that can leak: set at `k`, and not a cache tier's (atlas#203).\n *\n * @ensures exactly the model's FiniteGcTimeAt\n */\nfunction finiteGcTimeAt(s: string, k: number): boolean {\n //@ verify\n //@ type k nat\n //@ requires k <= s.length\n //@ ensures !startsWithAt(s, \"gcTime\", k) ==> !\\result\n return gcTimeSetAt(s, k) && !inTierObjectAt(s, k);\n}\n\n/**\n * The text sets a finite gcTime somewhere from `k` on (the spec; see `hasFiniteGcTime`).\n *\n * @ensures exactly the model's HasFiniteGcTimeFrom\n */\nexport function hasFiniteGcTimeFrom(s: string, k: number): boolean {\n //@ verify\n //@ type k nat\n //@ requires k <= s.length\n //@ decreases s.length - k\n //@ ensures k === s.length ==> !\\result\n return k < s.length && (finiteGcTimeAt(s, k) || hasFiniteGcTimeFrom(s, k + 1));\n}\n\n/**\n * The text sets a finite gcTime (`/gcTime\\s*:\\s*(?!Infinity\\b|resolveGcTime\\(|0\\b)\\S/.test`),\n * as a loop.\n *\n * @ensures result = hasFiniteGcTimeFrom(s, 0)\n */\nexport function hasFiniteGcTime(s: string): boolean {\n //@ verify\n //@ ensures \\result === hasFiniteGcTimeFrom(s, 0)\n let k = 0;\n while (k < s.length) {\n //@ invariant 0 <= k && k <= s.length\n //@ invariant hasFiniteGcTimeFrom(s, k) === hasFiniteGcTimeFrom(s, 0)\n //@ decreases s.length - k\n if (finiteGcTimeAt(s, k)) return true;\n k = k + 1;\n }\n return false;\n}\n\n/**\n * `\\.\\.\\.\\s*CACHE_CONFIG\\.` at `k`.\n *\n * @ensures exactly the model's TierSpreadAt\n */\nfunction tierSpreadAt(s: string, k: number): boolean {\n //@ verify\n //@ type k nat\n //@ requires k <= s.length\n //@ ensures !startsWithAt(s, \"...\", k) ==> !\\result\n return startsWithAt(s, \"...\", k) && startsWithAt(s, \"CACHE_CONFIG.\", spaceRunEnd(s, k + 3));\n}\n\n/**\n * A CACHE_CONFIG tier is spread somewhere from `k` on (the spec; see `hasTierSpread`).\n *\n * @ensures exactly the model's HasTierSpreadFrom\n */\nexport function hasTierSpreadFrom(s: string, k: number): boolean {\n //@ verify\n //@ type k nat\n //@ requires k <= s.length\n //@ decreases s.length - k\n //@ ensures k === s.length ==> !\\result\n return k < s.length && (tierSpreadAt(s, k) || hasTierSpreadFrom(s, k + 1));\n}\n\n/**\n * A CACHE_CONFIG tier is spread (`/\\.\\.\\.\\s*CACHE_CONFIG\\./.test`), as a loop.\n *\n * @ensures result = hasTierSpreadFrom(s, 0)\n */\nexport function hasTierSpread(s: string): boolean {\n //@ verify\n //@ ensures \\result === hasTierSpreadFrom(s, 0)\n let k = 0;\n while (k < s.length) {\n //@ invariant 0 <= k && k <= s.length\n //@ invariant hasTierSpreadFrom(s, k) === hasTierSpreadFrom(s, 0)\n //@ decreases s.length - k\n if (tierSpreadAt(s, k)) return true;\n k = k + 1;\n }\n return false;\n}\n\n/** An x.y.z version found in a range: whether there is one, and its three numbers. */\ninterface Version {\n found: boolean;\n year: number;\n minor: number;\n patch: number;\n}\n\nfunction noVersion(): Version {\n //@ verify\n //@ ensures !\\result.found && \\result.year === 0 && \\result.minor === 0 && \\result.patch === 0\n return { found: false, year: 0, minor: 0, patch: 0 };\n}\n\n/**\n * `(\\d+)\\.(\\d+)\\.(\\d+)` at `k`: three digit runs, the first two each ended by a \".\".\n *\n * @ensures exactly the model's VersionAt\n */\nfunction versionAt(s: string, k: number): Version {\n //@ verify\n //@ type k nat\n //@ requires k <= s.length\n //@ ensures \\result.found ==> \\result.year >= 0\n const a = digitRunEnd(s, k);\n if (a === k || codeAt(s, a) !== 46) return noVersion();\n const b = digitRunEnd(s, a + 1);\n if (b === a + 1 || codeAt(s, b) !== 46) return noVersion();\n const c = digitRunEnd(s, b + 1);\n if (c === b + 1) return noVersion();\n return {\n found: true,\n year: digitsValue(s.slice(k, a)),\n minor: digitsValue(s.slice(a + 1, b)),\n patch: digitsValue(s.slice(b + 1, c)),\n };\n}\n\n/**\n * The first x.y.z from `k` on, as `/(\\d+)\\.(\\d+)\\.(\\d+)/.exec` finds it (each start in turn).\n *\n * @ensures exactly the model's FirstVersionFrom\n */\nfunction firstVersionFrom(s: string, k: number): Version {\n //@ verify\n //@ type k nat\n //@ requires k <= s.length\n //@ decreases s.length - k\n //@ ensures k === s.length ==> !\\result.found\n if (k === s.length) return noVersion();\n const v = versionAt(s, k);\n return v.found ? v : firstVersionFrom(s, k + 1);\n}\n\n/**\n * A file offends query-gc-time: its text, and whether the site's augur-utils predates the fix.\n *\n * @ensures exactly the model's GcTimeOffenderIn\n */\nexport function gcTimeOffenderIn(text: string, utilsBeforeFix: boolean): boolean {\n //@ verify\n //@ ensures \\result === gcTimeOffender(hasFiniteGcTimeFrom(text, 0), hasTierSpreadFrom(text, 0), utilsBeforeFix)\n return gcTimeOffender(hasFiniteGcTime(text), hasTierSpread(text), utilsBeforeFix);\n}\n\n/**\n * The site's augur-utils range predates the fix: its first x.y.z is before 2026.11.3.\n *\n * @ensures exactly the model's UtilsRangeBeforeFix\n */\nexport function utilsRangeBeforeFix(range: string): boolean {\n //@ verify\n //@ ensures \\result === utilsBeforeServerSafeTiers(firstVersionFrom(range, 0).found, firstVersionFrom(range, 0).year, firstVersionFrom(range, 0).minor, firstVersionFrom(range, 0).patch)\n const v = firstVersionFrom(range, 0);\n return utilsBeforeServerSafeTiers(v.found, v.year, v.minor, v.patch);\n}\n\n/**\n * A site's dependency against the platform's minimum (atlas#85, owner 2026-11-12: \"make nextjs\n * 16.4.5 the min\"): absent skips; a range with no version warns; at or above the minimum\n * passes; a range admitting a version below it fails.\n *\n * @ensures exactly the model's FloorStatus\n */\nexport function floorStatus(present: boolean, parsed: boolean, atFloor: boolean): Status {\n //@ verify\n //@ ensures !present ==> \\result === \"SKIP\"\n //@ ensures present && !parsed ==> \\result === \"WARN\"\n //@ ensures present && parsed && atFloor ==> \\result === \"PASS\"\n //@ ensures present && parsed && !atFloor ==> \\result === \"FAIL\"\n if (!present) return \"SKIP\";\n if (!parsed) return \"WARN\";\n return atFloor ? \"PASS\" : \"FAIL\";\n}\n\n/**\n * A range's lowest version as the minimum checks read it (the model's Lowest): the first digit\n * run is the major, a `.digits` minor and patch follow when given, else 0 (`^19.3` is 19.3.0,\n * `16.x` is 16.0.0); `pre` when a `-` follows (a prerelease, below its x.y.z); `upper` when a\n * `<` stands before it (spaces and `=` between): a bound from above, admitting every version\n * under it.\n */\ninterface Lowest {\n found: boolean;\n major: number;\n minor: number;\n patch: number;\n pre: boolean;\n upper: boolean;\n}\n\nfunction noLowest(): Lowest {\n //@ verify\n //@ ensures !\\result.found && \\result.major === 0 && \\result.minor === 0 && \\result.patch === 0 && !\\result.pre && !\\result.upper\n return { found: false, major: 0, minor: 0, patch: 0, pre: false, upper: false };\n}\n\n/**\n * The end of a `.digits` part right after `end`, or `end` when none follows.\n *\n * @ensures exactly the model's PartEnd\n */\nfunction partEnd(s: string, end: number): number {\n //@ verify\n //@ type end nat\n //@ requires end <= s.length\n //@ ensures end <= \\result && \\result <= s.length\n //@ ensures \\result === (codeAt(s, end) === 46 && digitRunEnd(s, end + 1) > end + 1 ? digitRunEnd(s, end + 1) : end)\n return codeAt(s, end) === 46 && digitRunEnd(s, end + 1) > end + 1 ? digitRunEnd(s, end + 1) : end;\n}\n\n/**\n * That part's value, 0 when the range leaves it out.\n *\n * @ensures exactly the model's PartValue\n */\nfunction partValue(s: string, end: number): number {\n //@ verify\n //@ type end nat\n //@ requires end <= s.length\n //@ ensures \\result >= 0\n const e = partEnd(s, end);\n return e === end ? 0 : digitsValue(s.slice(end + 1, e));\n}\n\n/**\n * A `<` before `k`, with only spaces and `=` between: the version at `k` is an upper bound.\n *\n * @ensures exactly the model's UpperBoundBefore\n */\nfunction upperBoundBefore(s: string, k: number): boolean {\n //@ verify\n //@ type k nat\n //@ requires k <= s.length\n //@ decreases k\n //@ ensures k === 0 ==> !\\result\n if (k === 0) return false;\n const c = codeAt(s, k - 1);\n return c === 32 || c === 61 ? upperBoundBefore(s, k - 1) : c === 60;\n}\n\n/**\n * The version whose major starts at `k`; not found when no digit is there.\n *\n * @ensures exactly the model's LowestAt\n */\nfunction lowestAt(s: string, k: number): Lowest {\n //@ verify\n //@ type k nat\n //@ requires k <= s.length\n //@ ensures \\result.found ==> \\result.major >= 0\n const a = digitRunEnd(s, k);\n if (a === k) return noLowest();\n const b = partEnd(s, a);\n const c = partEnd(s, b);\n return {\n found: true,\n major: digitsValue(s.slice(k, a)),\n minor: partValue(s, a),\n patch: partValue(s, b),\n pre: codeAt(s, c) === 45,\n upper: upperBoundBefore(s, k),\n };\n}\n\n/**\n * The first version from `k` on: the range's lowest bound.\n *\n * @ensures exactly the model's FirstLowestFrom\n */\nfunction firstLowestFrom(s: string, k: number): Lowest {\n //@ verify\n //@ type k nat\n //@ requires k <= s.length\n //@ decreases s.length - k\n //@ ensures k === s.length ==> !\\result.found\n if (k === s.length) return noLowest();\n const v = lowestAt(s, k);\n return v.found ? v : firstLowestFrom(s, k + 1);\n}\n\n/**\n * At or above the minimum: not an upper bound, and the version at or above it; a prerelease\n * only when its x.y.z is above it (v > floor ⟺ v ≥ floor with its patch + 1).\n *\n * @ensures exactly the model's LowestAtFloor\n */\nfunction lowestAtFloor(\n v: Lowest,\n floorMajor: number,\n floorMinor: number,\n floorPatch: number,\n): boolean {\n //@ verify\n //@ ensures \\result === (!v.upper && versionAtLeast(v.major, v.minor, v.patch, floorMajor, floorMinor, v.pre ? floorPatch + 1 : floorPatch))\n return (\n !v.upper &&\n versionAtLeast(\n v.major,\n v.minor,\n v.patch,\n floorMajor,\n floorMinor,\n v.pre ? floorPatch + 1 : floorPatch,\n )\n );\n}\n\n/**\n * The minimum check on a range: its lowest version against `floorMajor.floorMinor.floorPatch`.\n *\n * @ensures exactly the model's RangeFloorStatus\n */\nexport function rangeFloorStatus(\n present: boolean,\n range: string,\n floorMajor: number,\n floorMinor: number,\n floorPatch: number,\n): Status {\n //@ verify\n //@ ensures \\result === floorStatus(present, firstLowestFrom(range, 0).found, lowestAtFloor(firstLowestFrom(range, 0), floorMajor, floorMinor, floorPatch))\n const v = firstLowestFrom(range, 0);\n return floorStatus(present, v.found, lowestAtFloor(v, floorMajor, floorMinor, floorPatch));\n}\n\n/**\n * next-floor: the platform minimum Next.js, 16.4.5.\n *\n * @ensures exactly the model's NextFloorStatus\n */\nexport function nextFloorStatus(present: boolean, range: string): Status {\n //@ verify\n //@ ensures \\result === rangeFloorStatus(present, range, 16, 4, 5)\n return rangeFloorStatus(present, range, 16, 4, 5);\n}\n\n/**\n * react-floor and react-dom-floor: the platform minimum React, 19.3.1.\n *\n * @ensures exactly the model's ReactFloorStatus\n */\nexport function reactFloorStatus(present: boolean, range: string): Status {\n //@ verify\n //@ ensures \\result === rangeFloorStatus(present, range, 19, 3, 1)\n return rangeFloorStatus(present, range, 19, 3, 1);\n}\n\n/**\n * augur-api-floor: the platform minimum Augur SDK, 2026.11.5, the latest release when it was set\n * (owner 2026-11-12); a CalVer reads as year.month.sequence.\n *\n * @ensures exactly the model's AugurApiFloorStatus\n */\nexport function augurApiFloorStatus(present: boolean, range: string): Status {\n //@ verify\n //@ ensures \\result === rangeFloorStatus(present, range, 2026, 11, 5)\n return rangeFloorStatus(present, range, 2026, 11, 5);\n}\n\n/**\n * Which files the scan reads: a `.ts`/`.tsx` file name.\n *\n * @ensures exactly the model's QuerySourceName\n */\nexport function isQuerySourceName(name: string): boolean {\n //@ verify\n //@ ensures \\result <==> (endsWith(name, \".ts\") || endsWith(name, \".tsx\"))\n return endsWith(name, \".ts\") || endsWith(name, \".tsx\");\n}\n\n/**\n * Which folders the scan walks into: every one but node_modules.\n *\n * @ensures exactly the model's WalksDir\n */\nexport function walksDir(name: string): boolean {\n //@ verify\n //@ ensures \\result <==> name !== \"node_modules\"\n return name !== \"node_modules\";\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":";AAYO,SAAS,QAAQ,GAAoB;AAG1C,SAAO,KAAK,MAAM,KAAK;AACzB;AAsFO,SAAS,UAAU,GAAoB;AAG5C,SAAO,aAAa,CAAC,KAAK,0BAA0B,CAAC,KAAK,aAAa,CAAC;AAC1E;AAOA,SAAS,aAAa,GAAoB;AAGxC,SAAQ,KAAK,KAAK,KAAK,MAAO,MAAM;AACtC;AAOA,SAAS,0BAA0B,GAAoB;AAGrD,SAAQ,KAAK,QAAQ,KAAK,QAAS,MAAM,QAAQ,MAAM,QAAQ,MAAM,QAAQ,MAAM;AACrF;AAOA,SAAS,aAAa,GAAoB;AAGxC,SAAO,MAAM,OAAO,MAAM,QAAQ,MAAM,SAAS,MAAM;AACzD;AAOO,SAAS,WAAW,GAAoB;AAG7C,SAAQ,KAAK,MAAM,KAAK,MAAQ,KAAK,MAAM,KAAK,OAAS,KAAK,MAAM,KAAK,MAAO,MAAM;AACxF;;;ACxIO,SAAS,cAAc,GAAW,GAAmB;AAO1D,MAAI,MAAM,KAAK,CAAC,UAAU,EAAE,WAAW,IAAI,CAAC,CAAC,EAAG,QAAO;AACvD,SAAO,cAAc,GAAG,IAAI,CAAC;AAC/B;AASO,SAAS,gBAAgB,GAAW,GAAW,OAAuB;AAQ3E,MAAI,MAAM,EAAG,QAAO;AACpB,QAAM,IAAI,EAAE,WAAW,IAAI,CAAC;AAC5B,MAAI,MAAM,IAAK,QAAO,UAAU,IAAI,IAAI,IAAI,gBAAgB,GAAG,IAAI,GAAG,QAAQ,CAAC;AAC/E,MAAI,MAAM,IAAK,QAAO,gBAAgB,GAAG,IAAI,GAAG,QAAQ,CAAC;AACzD,SAAO,gBAAgB,GAAG,IAAI,GAAG,KAAK;AACxC;AAQO,SAAS,WAAW,GAAW,GAAW,GAAoB;AAKnE,SACE,EAAE,UAAU,KACZ,EAAE,MAAM,IAAI,EAAE,QAAQ,CAAC,MAAM,MAC5B,MAAM,EAAE,UAAU,CAAC,WAAW,EAAE,WAAW,IAAI,EAAE,SAAS,CAAC,CAAC;AAEjE;;;ACjCO,SAAS,OAAO,GAAW,GAAmB;AAInD,SAAO,KAAK,KAAK,IAAI,EAAE,SAAS,EAAE,WAAW,CAAC,IAAI;AACpD;AAoVO,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;AA4FO,SAAS,SAAS,GAAW,QAAyB;AAI3D,SAAO,EAAE,MAAM,KAAK,IAAI,EAAE,SAAS,OAAO,QAAQ,CAAC,CAAC,MAAM;AAC5D;AAyDO,SAAS,YAAY,GAAW,GAAmB;AASxD,MAAI,CAAC,UAAU,OAAO,GAAG,CAAC,CAAC,EAAG,QAAO;AACrC,SAAO,YAAY,GAAG,IAAI,CAAC;AAC7B;AASO,SAAS,YAAY,GAAW,GAAmB;AASxD,MAAI,CAAC,QAAQ,OAAO,GAAG,CAAC,CAAC,EAAG,QAAO;AACnC,SAAO,YAAY,GAAG,IAAI,CAAC;AAC7B;AAuBO,SAAS,YAAY,GAAmB;AAK7C,MAAI,EAAE,WAAW,EAAG,QAAO;AAC3B,SAAO,YAAY,EAAE,MAAM,GAAG,EAAE,SAAS,CAAC,CAAC,IAAI,MAAM,EAAE,WAAW,EAAE,SAAS,CAAC,IAAI;AACpF;;;AC7kBO,SAAS,eACd,OACA,OACA,OACA,YACA,YACA,YACS;AAGT,SACE,QAAQ,cACP,UAAU,eAAe,QAAQ,cAAe,UAAU,cAAc,SAAS;AAEtF;;;ACAO,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;AASO,SAAS,iBAAiB,eAAwB,UAA2B;AAMlF,MAAI,SAAU,QAAO,gBAAgB,SAAS;AAC9C,SAAO,gBAAgB,SAAS;AAClC;AAOO,SAAS,eAAe,MAAc,OAAgB,IAAqB;AAGhF,UAAQ,QAAQ,SAAS,MAAM,QAAQ,KAAK,QAAQ;AACtD;AAOO,SAAS,gBAAgB,YAAoB,KAAqB;AAGvE,SACE,aACA,qJAEA;AAEJ;AAOO,SAAS,gBAAgB,YAAoB,OAAe,KAAqB;AAGtF,SAAO,aAAa,UAAU,QAAQ,cAAc,aAAa,YAAY,QAAQ,SAAS;AAChG;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;AASO,SAAS,eACd,eACA,aACA,gBACS;AAGT,SAAO,iBAAkB,eAAe;AAC1C;AAOO,SAAS,uBAAuB,MAAc,OAAe,OAAwB;AAG1F,SACE,OAAO,QAAS,SAAS,QAAQ,QAAQ,MAAQ,SAAS,QAAQ,UAAU,MAAM,SAAS;AAE/F;AAQO,SAAS,2BACd,QACA,MACA,OACA,OACS;AAGT,SAAO,UAAU,CAAC,uBAAuB,MAAM,OAAO,KAAK;AAC7D;AAOA,SAAS,OAAO,GAAW,GAAoB;AAI7C,SAAO,WAAW,OAAO,GAAG,CAAC,CAAC;AAChC;AAQA,SAAS,eAAe,GAAW,GAAoB;AAIrD,SACG,aAAa,GAAG,YAAY,CAAC,KAAK,CAAC,OAAO,GAAG,IAAI,CAAC,KACnD,aAAa,GAAG,kBAAkB,CAAC,KAClC,aAAa,GAAG,KAAK,CAAC,KAAK,CAAC,OAAO,GAAG,IAAI,CAAC;AAEhD;AAQA,SAAS,YAAY,GAAW,GAAoB;AAKlD,MAAI,CAAC,aAAa,GAAG,UAAU,CAAC,EAAG,QAAO;AAC1C,QAAM,IAAI,YAAY,GAAG,IAAI,CAAC;AAC9B,MAAI,OAAO,GAAG,CAAC,MAAM,GAAI,QAAO;AAChC,QAAM,IAAI,YAAY,GAAG,IAAI,CAAC;AAC9B,SAAO,IAAI,EAAE,UAAU,CAAC,eAAe,GAAG,CAAC;AAC7C;AAUA,SAAS,eAAe,GAAW,GAAoB;AAKrD,QAAM,IAAI,gBAAgB,GAAG,GAAG,CAAC;AACjC,MAAI,IAAI,EAAG,QAAO;AAClB,QAAM,IAAI,cAAc,GAAG,CAAC;AAC5B,MAAI,MAAM,KAAK,EAAE,WAAW,IAAI,CAAC,MAAM,GAAI,QAAO;AAClD,QAAM,IAAI,cAAc,GAAG,IAAI,CAAC;AAChC,SAAO,WAAW,GAAG,UAAU,CAAC,KAAK,WAAW,GAAG,cAAc,CAAC;AACpE;AAOA,SAAS,eAAe,GAAW,GAAoB;AAKrD,SAAO,YAAY,GAAG,CAAC,KAAK,CAAC,eAAe,GAAG,CAAC;AAClD;AAsBO,SAAS,gBAAgB,GAAoB;AAGlD,MAAI,IAAI;AACR,SAAO,IAAI,EAAE,QAAQ;AAInB,QAAI,eAAe,GAAG,CAAC,EAAG,QAAO;AACjC,QAAI,IAAI;AAAA,EACV;AACA,SAAO;AACT;AAOA,SAAS,aAAa,GAAW,GAAoB;AAKnD,SAAO,aAAa,GAAG,OAAO,CAAC,KAAK,aAAa,GAAG,iBAAiB,YAAY,GAAG,IAAI,CAAC,CAAC;AAC5F;AAqBO,SAAS,cAAc,GAAoB;AAGhD,MAAI,IAAI;AACR,SAAO,IAAI,EAAE,QAAQ;AAInB,QAAI,aAAa,GAAG,CAAC,EAAG,QAAO;AAC/B,QAAI,IAAI;AAAA,EACV;AACA,SAAO;AACT;AAUA,SAAS,YAAqB;AAG5B,SAAO,EAAE,OAAO,OAAO,MAAM,GAAG,OAAO,GAAG,OAAO,EAAE;AACrD;AAOA,SAAS,UAAU,GAAW,GAAoB;AAKhD,QAAM,IAAI,YAAY,GAAG,CAAC;AAC1B,MAAI,MAAM,KAAK,OAAO,GAAG,CAAC,MAAM,GAAI,QAAO,UAAU;AACrD,QAAM,IAAI,YAAY,GAAG,IAAI,CAAC;AAC9B,MAAI,MAAM,IAAI,KAAK,OAAO,GAAG,CAAC,MAAM,GAAI,QAAO,UAAU;AACzD,QAAM,IAAI,YAAY,GAAG,IAAI,CAAC;AAC9B,MAAI,MAAM,IAAI,EAAG,QAAO,UAAU;AAClC,SAAO;AAAA,IACL,OAAO;AAAA,IACP,MAAM,YAAY,EAAE,MAAM,GAAG,CAAC,CAAC;AAAA,IAC/B,OAAO,YAAY,EAAE,MAAM,IAAI,GAAG,CAAC,CAAC;AAAA,IACpC,OAAO,YAAY,EAAE,MAAM,IAAI,GAAG,CAAC,CAAC;AAAA,EACtC;AACF;AAOA,SAAS,iBAAiB,GAAW,GAAoB;AAMvD,MAAI,MAAM,EAAE,OAAQ,QAAO,UAAU;AACrC,QAAM,IAAI,UAAU,GAAG,CAAC;AACxB,SAAO,EAAE,QAAQ,IAAI,iBAAiB,GAAG,IAAI,CAAC;AAChD;AAOO,SAAS,iBAAiB,MAAc,gBAAkC;AAG/E,SAAO,eAAe,gBAAgB,IAAI,GAAG,cAAc,IAAI,GAAG,cAAc;AAClF;AAOO,SAAS,oBAAoB,OAAwB;AAG1D,QAAM,IAAI,iBAAiB,OAAO,CAAC;AACnC,SAAO,2BAA2B,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK;AACrE;AASO,SAAS,YAAY,SAAkB,QAAiB,SAA0B;AAMvF,MAAI,CAAC,QAAS,QAAO;AACrB,MAAI,CAAC,OAAQ,QAAO;AACpB,SAAO,UAAU,SAAS;AAC5B;AAkBA,SAAS,WAAmB;AAG1B,SAAO,EAAE,OAAO,OAAO,OAAO,GAAG,OAAO,GAAG,OAAO,GAAG,KAAK,OAAO,OAAO,MAAM;AAChF;AAOA,SAAS,QAAQ,GAAW,KAAqB;AAM/C,SAAO,OAAO,GAAG,GAAG,MAAM,MAAM,YAAY,GAAG,MAAM,CAAC,IAAI,MAAM,IAAI,YAAY,GAAG,MAAM,CAAC,IAAI;AAChG;AAOA,SAAS,UAAU,GAAW,KAAqB;AAKjD,QAAM,IAAI,QAAQ,GAAG,GAAG;AACxB,SAAO,MAAM,MAAM,IAAI,YAAY,EAAE,MAAM,MAAM,GAAG,CAAC,CAAC;AACxD;AAOA,SAAS,iBAAiB,GAAW,GAAoB;AAMvD,MAAI,MAAM,EAAG,QAAO;AACpB,QAAM,IAAI,OAAO,GAAG,IAAI,CAAC;AACzB,SAAO,MAAM,MAAM,MAAM,KAAK,iBAAiB,GAAG,IAAI,CAAC,IAAI,MAAM;AACnE;AAOA,SAAS,SAAS,GAAW,GAAmB;AAK9C,QAAM,IAAI,YAAY,GAAG,CAAC;AAC1B,MAAI,MAAM,EAAG,QAAO,SAAS;AAC7B,QAAM,IAAI,QAAQ,GAAG,CAAC;AACtB,QAAM,IAAI,QAAQ,GAAG,CAAC;AACtB,SAAO;AAAA,IACL,OAAO;AAAA,IACP,OAAO,YAAY,EAAE,MAAM,GAAG,CAAC,CAAC;AAAA,IAChC,OAAO,UAAU,GAAG,CAAC;AAAA,IACrB,OAAO,UAAU,GAAG,CAAC;AAAA,IACrB,KAAK,OAAO,GAAG,CAAC,MAAM;AAAA,IACtB,OAAO,iBAAiB,GAAG,CAAC;AAAA,EAC9B;AACF;AAOA,SAAS,gBAAgB,GAAW,GAAmB;AAMrD,MAAI,MAAM,EAAE,OAAQ,QAAO,SAAS;AACpC,QAAM,IAAI,SAAS,GAAG,CAAC;AACvB,SAAO,EAAE,QAAQ,IAAI,gBAAgB,GAAG,IAAI,CAAC;AAC/C;AAQA,SAAS,cACP,GACA,YACA,YACA,YACS;AAGT,SACE,CAAC,EAAE,SACH;AAAA,IACE,EAAE;AAAA,IACF,EAAE;AAAA,IACF,EAAE;AAAA,IACF;AAAA,IACA;AAAA,IACA,EAAE,MAAM,aAAa,IAAI;AAAA,EAC3B;AAEJ;AAOO,SAAS,iBACd,SACA,OACA,YACA,YACA,YACQ;AAGR,QAAM,IAAI,gBAAgB,OAAO,CAAC;AAClC,SAAO,YAAY,SAAS,EAAE,OAAO,cAAc,GAAG,YAAY,YAAY,UAAU,CAAC;AAC3F;AAOO,SAAS,gBAAgB,SAAkB,OAAuB;AAGvE,SAAO,iBAAiB,SAAS,OAAO,IAAI,GAAG,CAAC;AAClD;AAOO,SAAS,iBAAiB,SAAkB,OAAuB;AAGxE,SAAO,iBAAiB,SAAS,OAAO,IAAI,GAAG,CAAC;AAClD;AAQO,SAAS,oBAAoB,SAAkB,OAAuB;AAG3E,SAAO,iBAAiB,SAAS,OAAO,MAAM,IAAI,CAAC;AACrD;AAOO,SAAS,kBAAkB,MAAuB;AAGvD,SAAO,SAAS,MAAM,KAAK,KAAK,SAAS,MAAM,MAAM;AACvD;AAOO,SAAS,SAAS,MAAuB;AAG9C,SAAO,SAAS;AAClB;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":[]}
@@ -1 +1 @@
1
- {"version":3,"file":"rules.d.ts","sourceRoot":"","sources":["../../src/doctor/rules.ts"],"names":[],"mappings":"AAgBA,yBAAyB;AACzB,MAAM,MAAM,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,SAAS,GAAG,MAAM,CAAC;AAEnE;;;;;GAKG;AACH,wBAAgB,QAAQ,CAAC,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,GAAG,MAAM,CAO9D;AAED;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,SAAS,EAAE,OAAO,GAAG,MAAM,CAQ5F;AAED;;;;GAIG;AACH,wBAAgB,eAAe,CAC7B,KAAK,EAAE,OAAO,EACd,eAAe,EAAE,OAAO,EACxB,UAAU,EAAE,OAAO,GAClB,MAAM,CAMR;AAED;;;;;GAKG;AACH,wBAAgB,cAAc,CAC5B,KAAK,EAAE,OAAO,EACd,WAAW,EAAE,OAAO,EACpB,YAAY,EAAE,OAAO,GACpB,MAAM,CASR;AAED;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,OAAO,EAAE,UAAU,EAAE,OAAO,GAAG,MAAM,CAIxE;AAED;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,SAAS,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,GAAG,MAAM,CAS5F;AAED;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,SAAS,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,GAAG,MAAM,CAOtE;AAED;;;;GAIG;AACH,wBAAgB,WAAW,CAAC,UAAU,EAAE,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,GAAG,MAAM,CAO5F;AAED;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAQpD;AAED,gDAAgD;AAChD,MAAM,WAAW,SAAS;IACxB,SAAS,EAAE,OAAO,CAAC;IACnB,WAAW,EAAE,OAAO,CAAC;IACrB,iBAAiB,EAAE,OAAO,CAAC;IAC3B,WAAW,EAAE,OAAO,CAAC;IACrB,kBAAkB,EAAE,OAAO,CAAC;IAC5B,aAAa,EAAE,OAAO,CAAC;IACvB,UAAU,EAAE,OAAO,CAAC;IACpB,WAAW,EAAE,OAAO,CAAC;IACrB,SAAS,EAAE,OAAO,CAAC;IACnB,WAAW,EAAE,OAAO,CAAC;IACrB,SAAS,EAAE,OAAO,CAAC;CACpB;AAED;;;;GAIG;AACH,wBAAgB,kBAAkB,CAAC,CAAC,EAAE,SAAS,GAAG,MAAM,CAQvD;AAED;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,SAAS,GAAG,MAAM,CAMlD;AAED;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,SAAS,GAAG,MAAM,CASlD;AAED;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,CAAC,EAAE,SAAS,GAAG,MAAM,CAInD;AAED;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,SAAS,GAAG,MAAM,CAMjD;AAED;;;;GAIG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,SAAS,GAAG,MAAM,CAMtD;AAED;;;;;;GAMG;AACH,wBAAgB,gBAAgB,CAAC,aAAa,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,GAAG,MAAM,CAQlF;AAED;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,GAAG,MAAM,CAIhF;AAED;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,UAAU,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,CASvE;AAED;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,UAAU,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,CAItF;AAED;;;;GAIG;AACH,wBAAgB,mBAAmB,CAAC,OAAO,EAAE,OAAO,GAAG,MAAM,CAI5D;AAED;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,GAAG,MAAM,CAMvE;AAED;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,OAAO,EAAE,WAAW,EAAE,OAAO,EAAE,WAAW,EAAE,OAAO,GAAG,MAAM,CAO7F;AAED;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,SAAS,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,GAAG,MAAM,CAM3E;AAED;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,YAAY,EAAE,OAAO,EAAE,aAAa,EAAE,OAAO,GAAG,MAAM,CAIrF;AAED;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,WAAW,EAAE,OAAO,GAAG,MAAM,CAI7D;AAED;;;;GAIG;AACH,wBAAgB,iBAAiB,CAAC,eAAe,EAAE,OAAO,EAAE,gBAAgB,EAAE,OAAO,GAAG,MAAM,CAI7F;AAED;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM,CAI1D;AAED;;;;;;GAMG;AACH,wBAAgB,cAAc,CAC5B,aAAa,EAAE,OAAO,EACtB,WAAW,EAAE,OAAO,EACpB,cAAc,EAAE,OAAO,GACtB,OAAO,CAIT;AAED;;;;GAIG;AACH,wBAAgB,sBAAsB,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAM1F;AAED;;;;;GAKG;AACH,wBAAgB,0BAA0B,CACxC,MAAM,EAAE,OAAO,EACf,IAAI,EAAE,MAAM,EACZ,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,MAAM,GACZ,OAAO,CAIT;AAiDD;;;;GAIG;AACH,wBAAgB,mBAAmB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO,CAOjE;AAED;;;;;GAKG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO,CAYlD;AAeD;;;;GAIG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO,CAO/D;AAED;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO,CAYhD;AAwDD;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,MAAM,EAAE,cAAc,EAAE,OAAO,GAAG,OAAO,CAI/E;AAED;;;;GAIG;AACH,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAK1D;AAED;;;;;;GAMG;AACH,wBAAgB,WAAW,CAAC,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,GAAG,MAAM,CASvF;AAuID;;;;GAIG;AACH,wBAAgB,gBAAgB,CAC9B,OAAO,EAAE,OAAO,EAChB,KAAK,EAAE,MAAM,EACb,UAAU,EAAE,MAAM,EAClB,UAAU,EAAE,MAAM,EAClB,UAAU,EAAE,MAAM,GACjB,MAAM,CAKR;AAED;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAIvE;AAED;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAIxE;AAED;;;;;GAKG;AACH,wBAAgB,mBAAmB,CAAC,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAI3E;AAED;;;;GAIG;AACH,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAIvD;AAED;;;;GAIG;AACH,wBAAgB,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAI9C;AAED;;;;GAIG;AACH,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAMrF;AAED;;;;GAIG;AACH,wBAAgB,gBAAgB,CAC9B,MAAM,EAAE,OAAO,EACf,IAAI,EAAE,MAAM,EACZ,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,MAAM,GACZ,MAAM,CAIR;AAED;;;;GAIG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO,CAc5C;AAED;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAM5C;AAED,0DAA0D;AAC1D,MAAM,MAAM,YAAY,GAAG,SAAS,GAAG,QAAQ,GAAG,SAAS,CAAC;AAE5D;;;;;GAKG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,YAAY,CAO1E;AAED;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,MAAM,EAAE,YAAY,EAAE,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CASzF;AAED;;;;;GAKG;AACH,wBAAgB,YAAY,CAAC,MAAM,EAAE,YAAY,EAAE,GAAG,MAAM,CAS3D;AAED;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAS/E;AAED;;;;GAIG;AACH,wBAAgB,WAAW,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,MAAM,CAMrD;AAED;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,MAAM,CAIpD;AAED;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,MAAM,CAK7D"}
1
+ {"version":3,"file":"rules.d.ts","sourceRoot":"","sources":["../../src/doctor/rules.ts"],"names":[],"mappings":"AAiBA,yBAAyB;AACzB,MAAM,MAAM,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,SAAS,GAAG,MAAM,CAAC;AAEnE;;;;;GAKG;AACH,wBAAgB,QAAQ,CAAC,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,GAAG,MAAM,CAO9D;AAED;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,SAAS,EAAE,OAAO,GAAG,MAAM,CAQ5F;AAED;;;;GAIG;AACH,wBAAgB,eAAe,CAC7B,KAAK,EAAE,OAAO,EACd,eAAe,EAAE,OAAO,EACxB,UAAU,EAAE,OAAO,GAClB,MAAM,CAMR;AAED;;;;;GAKG;AACH,wBAAgB,cAAc,CAC5B,KAAK,EAAE,OAAO,EACd,WAAW,EAAE,OAAO,EACpB,YAAY,EAAE,OAAO,GACpB,MAAM,CASR;AAED;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,OAAO,EAAE,UAAU,EAAE,OAAO,GAAG,MAAM,CAIxE;AAED;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,SAAS,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,GAAG,MAAM,CAS5F;AAED;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,SAAS,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,GAAG,MAAM,CAOtE;AAED;;;;GAIG;AACH,wBAAgB,WAAW,CAAC,UAAU,EAAE,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,GAAG,MAAM,CAO5F;AAED;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAQpD;AAED,gDAAgD;AAChD,MAAM,WAAW,SAAS;IACxB,SAAS,EAAE,OAAO,CAAC;IACnB,WAAW,EAAE,OAAO,CAAC;IACrB,iBAAiB,EAAE,OAAO,CAAC;IAC3B,WAAW,EAAE,OAAO,CAAC;IACrB,kBAAkB,EAAE,OAAO,CAAC;IAC5B,aAAa,EAAE,OAAO,CAAC;IACvB,UAAU,EAAE,OAAO,CAAC;IACpB,WAAW,EAAE,OAAO,CAAC;IACrB,SAAS,EAAE,OAAO,CAAC;IACnB,WAAW,EAAE,OAAO,CAAC;IACrB,SAAS,EAAE,OAAO,CAAC;CACpB;AAED;;;;GAIG;AACH,wBAAgB,kBAAkB,CAAC,CAAC,EAAE,SAAS,GAAG,MAAM,CAQvD;AAED;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,SAAS,GAAG,MAAM,CAMlD;AAED;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,SAAS,GAAG,MAAM,CASlD;AAED;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,CAAC,EAAE,SAAS,GAAG,MAAM,CAInD;AAED;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,SAAS,GAAG,MAAM,CAMjD;AAED;;;;GAIG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,SAAS,GAAG,MAAM,CAMtD;AAED;;;;;;GAMG;AACH,wBAAgB,gBAAgB,CAAC,aAAa,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,GAAG,MAAM,CAQlF;AAED;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,GAAG,MAAM,CAIhF;AAED;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,UAAU,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,CASvE;AAED;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,UAAU,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,CAItF;AAED;;;;GAIG;AACH,wBAAgB,mBAAmB,CAAC,OAAO,EAAE,OAAO,GAAG,MAAM,CAI5D;AAED;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,GAAG,MAAM,CAMvE;AAED;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,OAAO,EAAE,WAAW,EAAE,OAAO,EAAE,WAAW,EAAE,OAAO,GAAG,MAAM,CAO7F;AAED;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,SAAS,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,GAAG,MAAM,CAM3E;AAED;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,YAAY,EAAE,OAAO,EAAE,aAAa,EAAE,OAAO,GAAG,MAAM,CAIrF;AAED;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,WAAW,EAAE,OAAO,GAAG,MAAM,CAI7D;AAED;;;;GAIG;AACH,wBAAgB,iBAAiB,CAAC,eAAe,EAAE,OAAO,EAAE,gBAAgB,EAAE,OAAO,GAAG,MAAM,CAI7F;AAED;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM,CAI1D;AAED;;;;;;GAMG;AACH,wBAAgB,cAAc,CAC5B,aAAa,EAAE,OAAO,EACtB,WAAW,EAAE,OAAO,EACpB,cAAc,EAAE,OAAO,GACtB,OAAO,CAIT;AAED;;;;GAIG;AACH,wBAAgB,sBAAsB,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAM1F;AAED;;;;;GAKG;AACH,wBAAgB,0BAA0B,CACxC,MAAM,EAAE,OAAO,EACf,IAAI,EAAE,MAAM,EACZ,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,MAAM,GACZ,OAAO,CAIT;AAmFD;;;;GAIG;AACH,wBAAgB,mBAAmB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO,CAOjE;AAED;;;;;GAKG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO,CAYlD;AAeD;;;;GAIG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO,CAO/D;AAED;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO,CAYhD;AAwDD;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,MAAM,EAAE,cAAc,EAAE,OAAO,GAAG,OAAO,CAI/E;AAED;;;;GAIG;AACH,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAK1D;AAED;;;;;;GAMG;AACH,wBAAgB,WAAW,CAAC,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,GAAG,MAAM,CASvF;AAuID;;;;GAIG;AACH,wBAAgB,gBAAgB,CAC9B,OAAO,EAAE,OAAO,EAChB,KAAK,EAAE,MAAM,EACb,UAAU,EAAE,MAAM,EAClB,UAAU,EAAE,MAAM,EAClB,UAAU,EAAE,MAAM,GACjB,MAAM,CAKR;AAED;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAIvE;AAED;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAIxE;AAED;;;;;GAKG;AACH,wBAAgB,mBAAmB,CAAC,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAI3E;AAED;;;;GAIG;AACH,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAIvD;AAED;;;;GAIG;AACH,wBAAgB,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAI9C;AAED;;;;GAIG;AACH,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAMrF;AAED;;;;GAIG;AACH,wBAAgB,gBAAgB,CAC9B,MAAM,EAAE,OAAO,EACf,IAAI,EAAE,MAAM,EACZ,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,MAAM,GACZ,MAAM,CAIR;AAED;;;;GAIG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO,CAc5C;AAED;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAM5C;AAED,0DAA0D;AAC1D,MAAM,MAAM,YAAY,GAAG,SAAS,GAAG,QAAQ,GAAG,SAAS,CAAC;AAE5D;;;;;GAKG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,YAAY,CAO1E;AAED;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,MAAM,EAAE,YAAY,EAAE,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CASzF;AAED;;;;;GAKG;AACH,wBAAgB,YAAY,CAAC,MAAM,EAAE,YAAY,EAAE,GAAG,MAAM,CAS3D;AAED;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAS/E;AAED;;;;GAIG;AACH,wBAAgB,WAAW,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,MAAM,CAMrD;AAED;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,MAAM,CAIpD;AAED;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,MAAM,CAK7D"}
@@ -1,6 +1,6 @@
1
1
  import {
2
2
  resolveUrl
3
- } from "./chunk-5QU6KOO3.js";
3
+ } from "./chunk-AAHHCSZC.js";
4
4
 
5
5
  // src/lighthouse-rules.ts
6
6
  function urlPathsOf(urls) {
package/package.json CHANGED
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "name": "@simpleapps-com/augur-config",
3
- "version": "2026.11.5",
3
+ "version": "2026.11.6",
4
4
  "description": "Shared tooling configuration presets for Augur ecommerce sites",
5
5
  "license": "MIT",
6
6
  "repository": {
@@ -1 +0,0 @@
1
- {"version":3,"sources":["../../foundation/src/chars.ts","../../utils/src/strings.ts","../../utils/src/versions.ts","../src/doctor/rules.ts"],"sourcesContent":["//@ backend dafny\n\n/* Character classes over UTF-16 code units (what charCodeAt returns), verified with\n LemmaScript → Dafny (model: models/Foundation.dfy; link: models/links/foundation-chars.dfy).\n Every contract is an iff, so an importer, which sees only the contract, knows each class\n exactly. */\n\n/**\n * A decimal digit: 0-9.\n *\n * @ensures result ⟺ c ∈ [48, 57]\n */\nexport function isDigit(c: number): boolean {\n //@ verify\n //@ ensures \\result <==> (c >= 48 && c <= 57)\n return c >= 48 && c <= 57;\n}\n\n/**\n * A JS line terminator (what regex `.` doesn't match): LF, CR, LS, PS.\n *\n * @ensures result ⟺ c ∈ {10, 13, 8232, 8233}\n */\nexport function isLineTerminator(c: number): boolean {\n //@ verify\n //@ ensures \\result <==> (c === 10 || c === 13 || c === 8232 || c === 8233)\n return c === 10 || c === 13 || c === 8232 || c === 8233;\n}\n\n/**\n * The code ASCII-lowered: A-Z to a-z, any other value (-1 from `codeAt` included) unchanged.\n *\n * @ensures exactly the model's LowerCode\n */\nexport function lowerCode(c: number): number {\n //@ verify\n //@ ensures \\result === (c >= 65 && c <= 90 ? c + 32 : c)\n return c >= 65 && c <= 90 ? c + 32 : c;\n}\n/**\n * A lowercase ASCII letter: a-z.\n *\n * @ensures result ⟺ c ∈ [97, 122]\n */\nexport function isLowerAlphaChar(c: number): boolean {\n //@ verify\n //@ ensures \\result <==> (c >= 97 && c <= 122)\n return c >= 97 && c <= 122;\n}\n\n/**\n * An ASCII letter or digit: A-Z a-z 0-9.\n *\n * @ensures result ⟺ c ∈ [A-Z] ∪ [a-z] ∪ [0-9]\n */\nexport function isAlnumChar(c: number): boolean {\n //@ verify\n //@ ensures \\result <==> ((c >= 65 && c <= 90) || (c >= 97 && c <= 122) || (c >= 48 && c <= 57))\n return (c >= 65 && c <= 90) || (c >= 97 && c <= 122) || (c >= 48 && c <= 57);\n}\n\n/**\n * A lowercase hex digit: 0-9 a-f.\n *\n * @ensures result ⟺ c ∈ [0-9] ∪ [a-f]\n */\nexport function isLowerHexChar(c: number): boolean {\n //@ verify\n //@ ensures \\result <==> ((c >= 48 && c <= 57) || (c >= 97 && c <= 102))\n return (c >= 48 && c <= 57) || (c >= 97 && c <= 102);\n}\n\n/**\n * A hex digit in either case: 0-9 a-f A-F.\n *\n * @ensures result ⟺ c ∈ [0-9] ∪ [a-f] ∪ [A-F]\n */\nexport function isHexChar(c: number): boolean {\n //@ verify\n //@ ensures \\result <==> ((c >= 48 && c <= 57) || (c >= 97 && c <= 102) || (c >= 65 && c <= 70))\n return (c >= 48 && c <= 57) || (c >= 97 && c <= 102) || (c >= 65 && c <= 70);\n}\n\n/**\n * A base64url character (RFC 4648 §5): A-Z a-z 0-9 - _.\n *\n * @ensures result ⟺ c ∈ [A-Z] ∪ [a-z] ∪ [0-9] ∪ {\"-\", \"_\"} — never \".\" or \"=\"\n */\nexport function isBase64UrlChar(c: number): boolean {\n //@ verify\n //@ ensures \\result <==> ((c >= 65 && c <= 90) || (c >= 97 && c <= 122) || (c >= 48 && c <= 57) || c === 45 || c === 95)\n return (\n (c >= 65 && c <= 90) || (c >= 97 && c <= 122) || (c >= 48 && c <= 57) || c === 45 || c === 95\n );\n}\n\n/**\n * JS whitespace, the regex `\\s` and what `trim()` strips: tab, LF, VT, FF, CR, space, NBSP,\n * U+1680, U+2000-U+200A, LS, PS, U+202F, U+205F, U+3000 and the BOM.\n *\n * @ensures result ⟺ c ∈ {9..13, 32, 160, 5760, 8192..8202, 8232, 8233, 8239, 8287, 12288, 65279}\n */\nexport function isJsSpace(c: number): boolean {\n //@ verify\n //@ ensures \\result <==> ((c >= 9 && c <= 13) || c === 32 || c === 160 || c === 5760 || (c >= 8192 && c <= 8202) || c === 8232 || c === 8233 || c === 8239 || c === 8287 || c === 12288 || c === 65279)\n return isAsciiSpace(c) || isGeneralPunctuationSpace(c) || isOtherSpace(c);\n}\n\n/**\n * ASCII whitespace: tab, LF, VT, FF, CR and space.\n *\n * @ensures result ⟺ c ∈ [9, 13] ∪ {32}\n */\nfunction isAsciiSpace(c: number): boolean {\n //@ verify\n //@ ensures \\result <==> ((c >= 9 && c <= 13) || c === 32)\n return (c >= 9 && c <= 13) || c === 32;\n}\n\n/**\n * The spaces in the General Punctuation block: U+2000-U+200A, LS, PS, U+202F, U+205F.\n *\n * @ensures result ⟺ c ∈ [8192, 8202] ∪ {8232, 8233, 8239, 8287}\n */\nfunction isGeneralPunctuationSpace(c: number): boolean {\n //@ verify\n //@ ensures \\result <==> ((c >= 8192 && c <= 8202) || c === 8232 || c === 8233 || c === 8239 || c === 8287)\n return (c >= 8192 && c <= 8202) || c === 8232 || c === 8233 || c === 8239 || c === 8287;\n}\n\n/**\n * The other spaces: NBSP, U+1680 (Ogham), U+3000 (ideographic) and the BOM.\n *\n * @ensures result ⟺ c ∈ {160, 5760, 12288, 65279}\n */\nfunction isOtherSpace(c: number): boolean {\n //@ verify\n //@ ensures \\result <==> (c === 160 || c === 5760 || c === 12288 || c === 65279)\n return c === 160 || c === 5760 || c === 12288 || c === 65279;\n}\n\n/**\n * A word character, the regex `\\w`: A-Z a-z 0-9 _.\n *\n * @ensures result ⟺ c ∈ [A-Z] ∪ [a-z] ∪ [0-9] ∪ {\"_\"}\n */\nexport function isWordChar(c: number): boolean {\n //@ verify\n //@ ensures \\result <==> ((c >= 65 && c <= 90) || (c >= 97 && c <= 122) || (c >= 48 && c <= 57) || c === 95)\n return (c >= 65 && c <= 90) || (c >= 97 && c <= 122) || (c >= 48 && c <= 57) || c === 95;\n}\n\n/**\n * A snake_case character: a-z 0-9 _.\n *\n * @ensures result ⟺ c ∈ [a-z] ∪ [0-9] ∪ {\"_\"}\n */\nexport function isSnakeChar(c: number): boolean {\n //@ verify\n //@ ensures \\result <==> ((c >= 97 && c <= 122) || (c >= 48 && c <= 57) || c === 95)\n return (c >= 97 && c <= 122) || (c >= 48 && c <= 57) || c === 95;\n}\n","//@ 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 \"@atlas/foundation/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 //@ requires i >= 0\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 //@ requires i >= 0\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 //@ requires i >= 0\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 //@ requires i >= 0\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 //@ requires i >= 0\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 //@ requires i >= 0\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 //@ requires i >= 0\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 //@ requires i >= 0\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 0 <= end && 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 0 <= i && 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 && from >= 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| ∧ ∀ k < |s|. result[k] = (s[k] ∈ A-Z ? s[k] + 32 : s[k]) — A-Z\n * lowered, every other code unit unchanged; true in JS (a contract `=== s.toLowerCase()` held\n * only in lsc's ASCII model of the built-in, Fable review 2026-11-06). Helper-free, since an\n * importer is given only the helpers its own body calls; exactly the model's LowerAscii in\n * the link\n */\nexport function lowerAscii(s: string): string {\n //@ verify\n //@ decreases s.length\n //@ ensures \\result.length === s.length\n //@ ensures forall(k: nat, k < s.length ==> \\result.charCodeAt(k) === ((s.charCodeAt(k) >= 65 && s.charCodeAt(k) <= 90) ? s.charCodeAt(k) + 32 : s.charCodeAt(k)))\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| ∧ ∀ j < |x|. lowered(s[pos + j]) = x[j] — the text at pos,\n * ASCII-lowered (A-Z + 32), is x; helper-free; exactly the model's StartsWithCaseless in the link\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 && forall(j: nat, j < x.length ==> ((s.charCodeAt(pos + j) >= 65 && s.charCodeAt(pos + j) <= 90) ? s.charCodeAt(pos + j) + 32 : s.charCodeAt(pos + j)) === x.charCodeAt(j)))\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 * The end of the ASCII-digit run starting at `i` (a regex's `\\d+`, from `i`): the first index\n * ≥ i that is not 0-9, or |s|.\n *\n * @ensures i ≤ result ≤ |s| ∧ s[i, result) all digits ∧ (result = |s| ∨ ¬digit(s[result])) —\n * exactly the model's DigitRunEnd\n */\nexport function digitRunEnd(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) ==> (s.charCodeAt(k) >= 48 && s.charCodeAt(k) <= 57))\n //@ ensures \\result < s.length ==> !(s.charCodeAt(\\result) >= 48 && s.charCodeAt(\\result) <= 57)\n // codeAt is -1 at the end, which is no digit\n if (!isDigit(codeAt(s, i))) return i;\n return digitRunEnd(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 * A canonical natural number's value, 0 for any other text (a count written as JSON).\n *\n * @ensures exactly the model's CanonicalNatValue (in the link: `digitsValue` needs the digits\n * isCanonicalNat's contract gives, which a contract can't call for); 0 for other text\n */\nexport function canonicalNatValue(s: string): number {\n //@ verify\n //@ ensures \\result >= 0\n //@ ensures !isCanonicalNat(s) ==> \\result === 0\n if (!isCanonicalNat(s)) return 0;\n return digitsValue(s);\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 // the run's end as a loop too: spaceRunEnd takes a frame per space (Fable review 2026-11-06)\n let e = i + 1;\n while (e !== s.length && isJsSpace(s.charCodeAt(e))) {\n //@ invariant i < e && e <= s.length\n //@ invariant forall(k: nat, (i <= k && k < e) ==> isJsSpace(s.charCodeAt(k)))\n //@ decreases s.length - e\n e = e + 1;\n }\n i = e;\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 // `<= 0`, not `=== 0`: the same for a nat, and a fraction a caller slips in (outside the\n // contract) ends instead of recursing forever (Fable review 2026-11-06: spaces(0.5))\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 * The first code point of `w` as text: a surrogate pair whole, else the first code unit, or \"\"\n * (Fable review 2026-11-06: an astral initial was a lone surrogate).\n *\n * @ensures exactly the model's FirstChar\n */\nexport function firstCodePoint(w: string): string {\n //@ verify\n //@ ensures \\result === ((w.length >= 2 && w.charCodeAt(0) >= 55296 && w.charCodeAt(0) <= 56319 && w.charCodeAt(1) >= 56320 && w.charCodeAt(1) <= 57343) ? w.slice(0, 2) : (w.length > 0 ? w.slice(0, 1) : \"\"))\n if (w.length >= 2) {\n const hi = w.charCodeAt(0);\n const lo = w.charCodeAt(1);\n if (hi >= 55296 && hi <= 56319 && lo >= 56320 && lo <= 57343) return w.slice(0, 2);\n }\n return w.length > 0 ? w.slice(0, 1) : \"\";\n}\n\n/**\n * An ASCII letter (A-Z, a-z) somewhere in `w` from `i` on (moved from readability.ts\n * 2026-11-06, so `readableWords`' contract can name it and importers resolve it).\n *\n * @ensures result ⟺ ∃ k ∈ [i, |w|). w[k] ∈ A-Z ∪ a-z — at i = 0 exactly the model's HasAsciiLetter\n */\nexport function hasAsciiLetterFrom(w: string, i: number): boolean {\n //@ verify\n //@ type i nat\n //@ requires i >= 0\n //@ decreases w.length - i\n //@ ensures \\result <==> exists(k: nat, i <= k && k < w.length && ((w.charCodeAt(k) >= 65 && w.charCodeAt(k) <= 90) || (w.charCodeAt(k) >= 97 && w.charCodeAt(k) <= 122)))\n if (i >= w.length) return false;\n const c = w.charCodeAt(i);\n if ((c >= 65 && c <= 90) || (c >= 97 && c <= 122)) return true;\n return hasAsciiLetterFrom(w, 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| ∧ ∀ k < |s|. result[k] = (s[k] ∈ a-z ? s[k] − 32 : s[k]) — a-z\n * raised, every other code unit unchanged; exactly the model's UpperAscii in the link\n */\nexport function upperAscii(s: string): string {\n //@ verify\n //@ decreases s.length\n //@ ensures \\result.length === s.length\n //@ ensures forall(k: nat, k < s.length ==> \\result.charCodeAt(k) === ((s.charCodeAt(k) >= 97 && s.charCodeAt(k) <= 122) ? s.charCodeAt(k) - 32 : s.charCodeAt(k)))\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\n\n/* Comparing an x.y.z version with a floor (model: models/Versions.dfy; link:\n models/links/utils-versions.dfy). Part by part: semver and CalVer order, no pre-release tags. */\n\n/**\n * `major.minor.patch` is at or above `floorMajor.floorMinor.floorPatch`: the first part that\n * differs decides.\n *\n * @ensures result ⟺ major > floorMajor ∨ (major = floorMajor ∧ (minor > floorMinor ∨\n * (minor = floorMinor ∧ patch ≥ floorPatch))), the model's Versions.AtLeast\n */\nexport function versionAtLeast(\n major: number,\n minor: number,\n patch: number,\n floorMajor: number,\n floorMinor: number,\n floorPatch: number,\n): boolean {\n //@ verify\n //@ ensures \\result === (major > floorMajor || (major === floorMajor && (minor > floorMinor || (minor === floorMinor && patch >= floorPatch))))\n return (\n major > floorMajor ||\n (major === floorMajor && (minor > floorMinor || (minor === floorMinor && patch >= floorPatch)))\n );\n}\n","//@ backend dafny\nimport { isWordChar } from \"@atlas/foundation/chars\";\nimport {\n codeAt,\n digitRunEnd,\n digitsValue,\n endsWith,\n spaceRunEnd,\n startsWithAt,\n} from \"@atlas/utils/strings\";\nimport { versionAtLeast } from \"@atlas/utils/versions\";\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 * next-proxy (atlas#88): Next.js 16 renamed the `middleware` file convention to `proxy`. Both\n * files fail (Next 16's build throws on both); proxy alone passes; middleware alone warns (it\n * still runs, deprecated); neither skips.\n *\n * @ensures exactly the model's MiddlewareStatus\n */\nexport function middlewareStatus(hasMiddleware: boolean, hasProxy: boolean): Status {\n //@ verify\n //@ ensures hasMiddleware && hasProxy ==> \\result === \"FAIL\"\n //@ ensures !hasMiddleware && hasProxy ==> \\result === \"PASS\"\n //@ ensures hasMiddleware && !hasProxy ==> \\result === \"WARN\"\n //@ ensures !hasMiddleware && !hasProxy ==> \\result === \"SKIP\"\n if (hasProxy) return hasMiddleware ? \"FAIL\" : \"PASS\";\n return hasMiddleware ? \"WARN\" : \"SKIP\";\n}\n\n/**\n * Where Next.js reads a file convention: the site root or `src/`, as `.ts` or `.js`.\n *\n * @ensures exactly the model's ConventionPath\n */\nexport function conventionPath(name: string, inSrc: boolean, js: boolean): string {\n //@ verify\n //@ ensures \\result === (inSrc ? \"src/\" : \"\") + name + (js ? \".js\" : \".ts\")\n return (inSrc ? \"src/\" : \"\") + name + (js ? \".js\" : \".ts\");\n}\n\n/**\n * next-proxy's WARN detail: the middleware file to rename, the codemod, Node.js only, the fix.\n *\n * @ensures exactly the model's ProxyWarnDetail\n */\nexport function proxyWarnDetail(middleware: string, fix: string): string {\n //@ verify\n //@ ensures \\result === middleware + \": rename the file and its middleware() export to proxy(), or run \" + \"npx @next/codemod@canary middleware-to-proxy . (proxy runs on Node.js only) -- \" + fix\n return (\n middleware +\n \": rename the file and its middleware() export to proxy(), or run \" +\n \"npx @next/codemod@canary middleware-to-proxy . (proxy runs on Node.js only) -- \" +\n fix\n );\n}\n\n/**\n * next-proxy's FAIL detail: delete the middleware file, keep the proxy file.\n *\n * @ensures exactly the model's ProxyFailDetail\n */\nexport function proxyFailDetail(middleware: string, proxy: string, fix: string): string {\n //@ verify\n //@ ensures \\result === middleware + \" and \" + proxy + \": delete \" + middleware + \", keep \" + proxy + \" -- \" + fix\n return middleware + \" and \" + proxy + \": delete \" + middleware + \", keep \" + proxy + \" -- \" + fix;\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 * query-gc-time's offender (#94): a file that sets a finite gcTime, or that spreads a\n * CACHE_CONFIG tier while the site's augur-utils may predate the server-safe tiers (a spread\n * on a fixed augur-utils is safe; owner 2026-11-07: \"only for older version before this fix\").\n *\n * @ensures exactly the model's GcTimeOffender\n */\nexport function gcTimeOffender(\n finiteLiteral: boolean,\n spreadsTier: boolean,\n utilsBeforeFix: boolean,\n): boolean {\n //@ verify\n //@ ensures \\result <==> (finiteLiteral || (spreadsTier && utilsBeforeFix))\n return finiteLiteral || (spreadsTier && utilsBeforeFix);\n}\n\n/**\n * The first augur-utils with server-safe CACHE_CONFIG tiers: 2026.11.3.\n *\n * @ensures exactly the model's ServerSafeTiersVersion\n */\nexport function serverSafeTiersVersion(year: number, minor: number, patch: number): boolean {\n //@ verify\n //@ ensures \\result === (year > 2026 || (year === 2026 && minor > 11) || (year === 2026 && minor === 11 && patch >= 3))\n return (\n year > 2026 || (year === 2026 && minor > 11) || (year === 2026 && minor === 11 && patch >= 3)\n );\n}\n\n/**\n * The site's augur-utils range may give a version before the fix: its lowest version (the\n * first x.y.z in the range, `parsed`) is older. No recognised version is not.\n *\n * @ensures exactly the model's UtilsBeforeServerSafeTiers\n */\nexport function utilsBeforeServerSafeTiers(\n parsed: boolean,\n year: number,\n minor: number,\n patch: number,\n): boolean {\n //@ verify\n //@ ensures \\result === (parsed && !serverSafeTiersVersion(year, minor, patch))\n return parsed && !serverSafeTiersVersion(year, minor, patch);\n}\n\n/* query-gc-time's text scans (#94): each is exactly the regex it replaced, which the tests keep\n as its oracle. A `…From` function is the spec (one call per character); the scan run over a\n whole file is its loop twin, proved equal, at a constant stack depth. */\n\n/** A word character (`\\w`) at `i`; none past the end. */\nfunction wordAt(s: string, i: number): boolean {\n //@ verify\n //@ type i nat\n //@ ensures \\result <==> (i < s.length && isWordChar(s.charCodeAt(i)))\n return isWordChar(codeAt(s, i));\n}\n\n/**\n * After `gcTime:`, an allowed value: `Infinity` or `0` as a whole word, or a `resolveGcTime(`\n * call (`(?!Infinity\\b|resolveGcTime\\(|0\\b)`).\n *\n * @ensures exactly the model's AllowedGcValue\n */\nfunction allowedGcValue(s: string, p: number): boolean {\n //@ verify\n //@ type p nat\n //@ ensures \\result <==> ((startsWithAt(s, \"Infinity\", p) && !wordAt(s, p + 8)) || startsWithAt(s, \"resolveGcTime(\", p) || (startsWithAt(s, \"0\", p) && !wordAt(s, p + 1)))\n return (\n (startsWithAt(s, \"Infinity\", p) && !wordAt(s, p + 8)) ||\n startsWithAt(s, \"resolveGcTime(\", p) ||\n (startsWithAt(s, \"0\", p) && !wordAt(s, p + 1))\n );\n}\n\n/**\n * `gcTime\\s*:\\s*(?!Infinity\\b|resolveGcTime\\(|0\\b)\\S` at `k`: \"gcTime\", spaces, \":\", spaces,\n * then a character that is no space and no allowed value.\n *\n * @ensures exactly the model's FiniteGcTimeAt\n */\nfunction finiteGcTimeAt(s: string, k: number): boolean {\n //@ verify\n //@ type k nat\n //@ requires k <= s.length\n //@ ensures !startsWithAt(s, \"gcTime\", k) ==> !\\result\n if (!startsWithAt(s, \"gcTime\", k)) return false;\n const a = spaceRunEnd(s, k + 6);\n if (codeAt(s, a) !== 58) return false;\n const p = spaceRunEnd(s, a + 1);\n return p < s.length && !allowedGcValue(s, p);\n}\n\n/**\n * The text sets a finite gcTime somewhere from `k` on (the spec; see `hasFiniteGcTime`).\n *\n * @ensures exactly the model's HasFiniteGcTimeFrom\n */\nexport function hasFiniteGcTimeFrom(s: string, k: number): boolean {\n //@ verify\n //@ type k nat\n //@ requires k <= s.length\n //@ decreases s.length - k\n //@ ensures k === s.length ==> !\\result\n return k < s.length && (finiteGcTimeAt(s, k) || hasFiniteGcTimeFrom(s, k + 1));\n}\n\n/**\n * The text sets a finite gcTime (`/gcTime\\s*:\\s*(?!Infinity\\b|resolveGcTime\\(|0\\b)\\S/.test`),\n * as a loop.\n *\n * @ensures result = hasFiniteGcTimeFrom(s, 0)\n */\nexport function hasFiniteGcTime(s: string): boolean {\n //@ verify\n //@ ensures \\result === hasFiniteGcTimeFrom(s, 0)\n let k = 0;\n while (k < s.length) {\n //@ invariant 0 <= k && k <= s.length\n //@ invariant hasFiniteGcTimeFrom(s, k) === hasFiniteGcTimeFrom(s, 0)\n //@ decreases s.length - k\n if (finiteGcTimeAt(s, k)) return true;\n k = k + 1;\n }\n return false;\n}\n\n/**\n * `\\.\\.\\.\\s*CACHE_CONFIG\\.` at `k`.\n *\n * @ensures exactly the model's TierSpreadAt\n */\nfunction tierSpreadAt(s: string, k: number): boolean {\n //@ verify\n //@ type k nat\n //@ requires k <= s.length\n //@ ensures !startsWithAt(s, \"...\", k) ==> !\\result\n return startsWithAt(s, \"...\", k) && startsWithAt(s, \"CACHE_CONFIG.\", spaceRunEnd(s, k + 3));\n}\n\n/**\n * A CACHE_CONFIG tier is spread somewhere from `k` on (the spec; see `hasTierSpread`).\n *\n * @ensures exactly the model's HasTierSpreadFrom\n */\nexport function hasTierSpreadFrom(s: string, k: number): boolean {\n //@ verify\n //@ type k nat\n //@ requires k <= s.length\n //@ decreases s.length - k\n //@ ensures k === s.length ==> !\\result\n return k < s.length && (tierSpreadAt(s, k) || hasTierSpreadFrom(s, k + 1));\n}\n\n/**\n * A CACHE_CONFIG tier is spread (`/\\.\\.\\.\\s*CACHE_CONFIG\\./.test`), as a loop.\n *\n * @ensures result = hasTierSpreadFrom(s, 0)\n */\nexport function hasTierSpread(s: string): boolean {\n //@ verify\n //@ ensures \\result === hasTierSpreadFrom(s, 0)\n let k = 0;\n while (k < s.length) {\n //@ invariant 0 <= k && k <= s.length\n //@ invariant hasTierSpreadFrom(s, k) === hasTierSpreadFrom(s, 0)\n //@ decreases s.length - k\n if (tierSpreadAt(s, k)) return true;\n k = k + 1;\n }\n return false;\n}\n\n/** An x.y.z version found in a range: whether there is one, and its three numbers. */\ninterface Version {\n found: boolean;\n year: number;\n minor: number;\n patch: number;\n}\n\nfunction noVersion(): Version {\n //@ verify\n //@ ensures !\\result.found && \\result.year === 0 && \\result.minor === 0 && \\result.patch === 0\n return { found: false, year: 0, minor: 0, patch: 0 };\n}\n\n/**\n * `(\\d+)\\.(\\d+)\\.(\\d+)` at `k`: three digit runs, the first two each ended by a \".\".\n *\n * @ensures exactly the model's VersionAt\n */\nfunction versionAt(s: string, k: number): Version {\n //@ verify\n //@ type k nat\n //@ requires k <= s.length\n //@ ensures \\result.found ==> \\result.year >= 0\n const a = digitRunEnd(s, k);\n if (a === k || codeAt(s, a) !== 46) return noVersion();\n const b = digitRunEnd(s, a + 1);\n if (b === a + 1 || codeAt(s, b) !== 46) return noVersion();\n const c = digitRunEnd(s, b + 1);\n if (c === b + 1) return noVersion();\n return {\n found: true,\n year: digitsValue(s.slice(k, a)),\n minor: digitsValue(s.slice(a + 1, b)),\n patch: digitsValue(s.slice(b + 1, c)),\n };\n}\n\n/**\n * The first x.y.z from `k` on, as `/(\\d+)\\.(\\d+)\\.(\\d+)/.exec` finds it (each start in turn).\n *\n * @ensures exactly the model's FirstVersionFrom\n */\nfunction firstVersionFrom(s: string, k: number): Version {\n //@ verify\n //@ type k nat\n //@ requires k <= s.length\n //@ decreases s.length - k\n //@ ensures k === s.length ==> !\\result.found\n if (k === s.length) return noVersion();\n const v = versionAt(s, k);\n return v.found ? v : firstVersionFrom(s, k + 1);\n}\n\n/**\n * A file offends query-gc-time: its text, and whether the site's augur-utils predates the fix.\n *\n * @ensures exactly the model's GcTimeOffenderIn\n */\nexport function gcTimeOffenderIn(text: string, utilsBeforeFix: boolean): boolean {\n //@ verify\n //@ ensures \\result === gcTimeOffender(hasFiniteGcTimeFrom(text, 0), hasTierSpreadFrom(text, 0), utilsBeforeFix)\n return gcTimeOffender(hasFiniteGcTime(text), hasTierSpread(text), utilsBeforeFix);\n}\n\n/**\n * The site's augur-utils range predates the fix: its first x.y.z is before 2026.11.3.\n *\n * @ensures exactly the model's UtilsRangeBeforeFix\n */\nexport function utilsRangeBeforeFix(range: string): boolean {\n //@ verify\n //@ ensures \\result === utilsBeforeServerSafeTiers(firstVersionFrom(range, 0).found, firstVersionFrom(range, 0).year, firstVersionFrom(range, 0).minor, firstVersionFrom(range, 0).patch)\n const v = firstVersionFrom(range, 0);\n return utilsBeforeServerSafeTiers(v.found, v.year, v.minor, v.patch);\n}\n\n/**\n * A site's dependency against the platform's minimum (atlas#85, owner 2026-11-12: \"make nextjs\n * 16.4.5 the min\"): absent skips; a range with no version warns; at or above the minimum\n * passes; a range admitting a version below it fails.\n *\n * @ensures exactly the model's FloorStatus\n */\nexport function floorStatus(present: boolean, parsed: boolean, atFloor: boolean): Status {\n //@ verify\n //@ ensures !present ==> \\result === \"SKIP\"\n //@ ensures present && !parsed ==> \\result === \"WARN\"\n //@ ensures present && parsed && atFloor ==> \\result === \"PASS\"\n //@ ensures present && parsed && !atFloor ==> \\result === \"FAIL\"\n if (!present) return \"SKIP\";\n if (!parsed) return \"WARN\";\n return atFloor ? \"PASS\" : \"FAIL\";\n}\n\n/**\n * A range's lowest version as the minimum checks read it (the model's Lowest): the first digit\n * run is the major, a `.digits` minor and patch follow when given, else 0 (`^19.3` is 19.3.0,\n * `16.x` is 16.0.0); `pre` when a `-` follows (a prerelease, below its x.y.z); `upper` when a\n * `<` stands before it (spaces and `=` between): a bound from above, admitting every version\n * under it.\n */\ninterface Lowest {\n found: boolean;\n major: number;\n minor: number;\n patch: number;\n pre: boolean;\n upper: boolean;\n}\n\nfunction noLowest(): Lowest {\n //@ verify\n //@ ensures !\\result.found && \\result.major === 0 && \\result.minor === 0 && \\result.patch === 0 && !\\result.pre && !\\result.upper\n return { found: false, major: 0, minor: 0, patch: 0, pre: false, upper: false };\n}\n\n/**\n * The end of a `.digits` part right after `end`, or `end` when none follows.\n *\n * @ensures exactly the model's PartEnd\n */\nfunction partEnd(s: string, end: number): number {\n //@ verify\n //@ type end nat\n //@ requires end <= s.length\n //@ ensures end <= \\result && \\result <= s.length\n //@ ensures \\result === (codeAt(s, end) === 46 && digitRunEnd(s, end + 1) > end + 1 ? digitRunEnd(s, end + 1) : end)\n return codeAt(s, end) === 46 && digitRunEnd(s, end + 1) > end + 1 ? digitRunEnd(s, end + 1) : end;\n}\n\n/**\n * That part's value, 0 when the range leaves it out.\n *\n * @ensures exactly the model's PartValue\n */\nfunction partValue(s: string, end: number): number {\n //@ verify\n //@ type end nat\n //@ requires end <= s.length\n //@ ensures \\result >= 0\n const e = partEnd(s, end);\n return e === end ? 0 : digitsValue(s.slice(end + 1, e));\n}\n\n/**\n * A `<` before `k`, with only spaces and `=` between: the version at `k` is an upper bound.\n *\n * @ensures exactly the model's UpperBoundBefore\n */\nfunction upperBoundBefore(s: string, k: number): boolean {\n //@ verify\n //@ type k nat\n //@ requires k <= s.length\n //@ decreases k\n //@ ensures k === 0 ==> !\\result\n if (k === 0) return false;\n const c = codeAt(s, k - 1);\n return c === 32 || c === 61 ? upperBoundBefore(s, k - 1) : c === 60;\n}\n\n/**\n * The version whose major starts at `k`; not found when no digit is there.\n *\n * @ensures exactly the model's LowestAt\n */\nfunction lowestAt(s: string, k: number): Lowest {\n //@ verify\n //@ type k nat\n //@ requires k <= s.length\n //@ ensures \\result.found ==> \\result.major >= 0\n const a = digitRunEnd(s, k);\n if (a === k) return noLowest();\n const b = partEnd(s, a);\n const c = partEnd(s, b);\n return {\n found: true,\n major: digitsValue(s.slice(k, a)),\n minor: partValue(s, a),\n patch: partValue(s, b),\n pre: codeAt(s, c) === 45,\n upper: upperBoundBefore(s, k),\n };\n}\n\n/**\n * The first version from `k` on: the range's lowest bound.\n *\n * @ensures exactly the model's FirstLowestFrom\n */\nfunction firstLowestFrom(s: string, k: number): Lowest {\n //@ verify\n //@ type k nat\n //@ requires k <= s.length\n //@ decreases s.length - k\n //@ ensures k === s.length ==> !\\result.found\n if (k === s.length) return noLowest();\n const v = lowestAt(s, k);\n return v.found ? v : firstLowestFrom(s, k + 1);\n}\n\n/**\n * At or above the minimum: not an upper bound, and the version at or above it; a prerelease\n * only when its x.y.z is above it (v > floor ⟺ v ≥ floor with its patch + 1).\n *\n * @ensures exactly the model's LowestAtFloor\n */\nfunction lowestAtFloor(\n v: Lowest,\n floorMajor: number,\n floorMinor: number,\n floorPatch: number,\n): boolean {\n //@ verify\n //@ ensures \\result === (!v.upper && versionAtLeast(v.major, v.minor, v.patch, floorMajor, floorMinor, v.pre ? floorPatch + 1 : floorPatch))\n return (\n !v.upper &&\n versionAtLeast(\n v.major,\n v.minor,\n v.patch,\n floorMajor,\n floorMinor,\n v.pre ? floorPatch + 1 : floorPatch,\n )\n );\n}\n\n/**\n * The minimum check on a range: its lowest version against `floorMajor.floorMinor.floorPatch`.\n *\n * @ensures exactly the model's RangeFloorStatus\n */\nexport function rangeFloorStatus(\n present: boolean,\n range: string,\n floorMajor: number,\n floorMinor: number,\n floorPatch: number,\n): Status {\n //@ verify\n //@ ensures \\result === floorStatus(present, firstLowestFrom(range, 0).found, lowestAtFloor(firstLowestFrom(range, 0), floorMajor, floorMinor, floorPatch))\n const v = firstLowestFrom(range, 0);\n return floorStatus(present, v.found, lowestAtFloor(v, floorMajor, floorMinor, floorPatch));\n}\n\n/**\n * next-floor: the platform minimum Next.js, 16.4.5.\n *\n * @ensures exactly the model's NextFloorStatus\n */\nexport function nextFloorStatus(present: boolean, range: string): Status {\n //@ verify\n //@ ensures \\result === rangeFloorStatus(present, range, 16, 4, 5)\n return rangeFloorStatus(present, range, 16, 4, 5);\n}\n\n/**\n * react-floor and react-dom-floor: the platform minimum React, 19.3.1.\n *\n * @ensures exactly the model's ReactFloorStatus\n */\nexport function reactFloorStatus(present: boolean, range: string): Status {\n //@ verify\n //@ ensures \\result === rangeFloorStatus(present, range, 19, 3, 1)\n return rangeFloorStatus(present, range, 19, 3, 1);\n}\n\n/**\n * augur-api-floor: the platform minimum Augur SDK, 2026.11.5, the latest release when it was set\n * (owner 2026-11-12); a CalVer reads as year.month.sequence.\n *\n * @ensures exactly the model's AugurApiFloorStatus\n */\nexport function augurApiFloorStatus(present: boolean, range: string): Status {\n //@ verify\n //@ ensures \\result === rangeFloorStatus(present, range, 2026, 11, 5)\n return rangeFloorStatus(present, range, 2026, 11, 5);\n}\n\n/**\n * Which files the scan reads: a `.ts`/`.tsx` file name.\n *\n * @ensures exactly the model's QuerySourceName\n */\nexport function isQuerySourceName(name: string): boolean {\n //@ verify\n //@ ensures \\result <==> (endsWith(name, \".ts\") || endsWith(name, \".tsx\"))\n return endsWith(name, \".ts\") || endsWith(name, \".tsx\");\n}\n\n/**\n * Which folders the scan walks into: every one but node_modules.\n *\n * @ensures exactly the model's WalksDir\n */\nexport function walksDir(name: string): boolean {\n //@ verify\n //@ ensures \\result <==> name !== \"node_modules\"\n return name !== \"node_modules\";\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":";AAYO,SAAS,QAAQ,GAAoB;AAG1C,SAAO,KAAK,MAAM,KAAK;AACzB;AAsFO,SAAS,UAAU,GAAoB;AAG5C,SAAO,aAAa,CAAC,KAAK,0BAA0B,CAAC,KAAK,aAAa,CAAC;AAC1E;AAOA,SAAS,aAAa,GAAoB;AAGxC,SAAQ,KAAK,KAAK,KAAK,MAAO,MAAM;AACtC;AAOA,SAAS,0BAA0B,GAAoB;AAGrD,SAAQ,KAAK,QAAQ,KAAK,QAAS,MAAM,QAAQ,MAAM,QAAQ,MAAM,QAAQ,MAAM;AACrF;AAOA,SAAS,aAAa,GAAoB;AAGxC,SAAO,MAAM,OAAO,MAAM,QAAQ,MAAM,SAAS,MAAM;AACzD;AAOO,SAAS,WAAW,GAAoB;AAG7C,SAAQ,KAAK,MAAM,KAAK,MAAQ,KAAK,MAAM,KAAK,OAAS,KAAK,MAAM,KAAK,MAAO,MAAM;AACxF;;;ACxHO,SAAS,OAAO,GAAW,GAAmB;AAInD,SAAO,KAAK,KAAK,IAAI,EAAE,SAAS,EAAE,WAAW,CAAC,IAAI;AACpD;AAoUO,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;AA4FO,SAAS,SAAS,GAAW,QAAyB;AAI3D,SAAO,EAAE,MAAM,KAAK,IAAI,EAAE,SAAS,OAAO,QAAQ,CAAC,CAAC,MAAM;AAC5D;AAyDO,SAAS,YAAY,GAAW,GAAmB;AASxD,MAAI,CAAC,UAAU,OAAO,GAAG,CAAC,CAAC,EAAG,QAAO;AACrC,SAAO,YAAY,GAAG,IAAI,CAAC;AAC7B;AASO,SAAS,YAAY,GAAW,GAAmB;AASxD,MAAI,CAAC,QAAQ,OAAO,GAAG,CAAC,CAAC,EAAG,QAAO;AACnC,SAAO,YAAY,GAAG,IAAI,CAAC;AAC7B;AAuBO,SAAS,YAAY,GAAmB;AAK7C,MAAI,EAAE,WAAW,EAAG,QAAO;AAC3B,SAAO,YAAY,EAAE,MAAM,GAAG,EAAE,SAAS,CAAC,CAAC,IAAI,MAAM,EAAE,WAAW,EAAE,SAAS,CAAC,IAAI;AACpF;;;AC7jBO,SAAS,eACd,OACA,OACA,OACA,YACA,YACA,YACS;AAGT,SACE,QAAQ,cACP,UAAU,eAAe,QAAQ,cAAe,UAAU,cAAc,SAAS;AAEtF;;;ACDO,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;AASO,SAAS,iBAAiB,eAAwB,UAA2B;AAMlF,MAAI,SAAU,QAAO,gBAAgB,SAAS;AAC9C,SAAO,gBAAgB,SAAS;AAClC;AAOO,SAAS,eAAe,MAAc,OAAgB,IAAqB;AAGhF,UAAQ,QAAQ,SAAS,MAAM,QAAQ,KAAK,QAAQ;AACtD;AAOO,SAAS,gBAAgB,YAAoB,KAAqB;AAGvE,SACE,aACA,qJAEA;AAEJ;AAOO,SAAS,gBAAgB,YAAoB,OAAe,KAAqB;AAGtF,SAAO,aAAa,UAAU,QAAQ,cAAc,aAAa,YAAY,QAAQ,SAAS;AAChG;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;AASO,SAAS,eACd,eACA,aACA,gBACS;AAGT,SAAO,iBAAkB,eAAe;AAC1C;AAOO,SAAS,uBAAuB,MAAc,OAAe,OAAwB;AAG1F,SACE,OAAO,QAAS,SAAS,QAAQ,QAAQ,MAAQ,SAAS,QAAQ,UAAU,MAAM,SAAS;AAE/F;AAQO,SAAS,2BACd,QACA,MACA,OACA,OACS;AAGT,SAAO,UAAU,CAAC,uBAAuB,MAAM,OAAO,KAAK;AAC7D;AAOA,SAAS,OAAO,GAAW,GAAoB;AAI7C,SAAO,WAAW,OAAO,GAAG,CAAC,CAAC;AAChC;AAQA,SAAS,eAAe,GAAW,GAAoB;AAIrD,SACG,aAAa,GAAG,YAAY,CAAC,KAAK,CAAC,OAAO,GAAG,IAAI,CAAC,KACnD,aAAa,GAAG,kBAAkB,CAAC,KAClC,aAAa,GAAG,KAAK,CAAC,KAAK,CAAC,OAAO,GAAG,IAAI,CAAC;AAEhD;AAQA,SAAS,eAAe,GAAW,GAAoB;AAKrD,MAAI,CAAC,aAAa,GAAG,UAAU,CAAC,EAAG,QAAO;AAC1C,QAAM,IAAI,YAAY,GAAG,IAAI,CAAC;AAC9B,MAAI,OAAO,GAAG,CAAC,MAAM,GAAI,QAAO;AAChC,QAAM,IAAI,YAAY,GAAG,IAAI,CAAC;AAC9B,SAAO,IAAI,EAAE,UAAU,CAAC,eAAe,GAAG,CAAC;AAC7C;AAsBO,SAAS,gBAAgB,GAAoB;AAGlD,MAAI,IAAI;AACR,SAAO,IAAI,EAAE,QAAQ;AAInB,QAAI,eAAe,GAAG,CAAC,EAAG,QAAO;AACjC,QAAI,IAAI;AAAA,EACV;AACA,SAAO;AACT;AAOA,SAAS,aAAa,GAAW,GAAoB;AAKnD,SAAO,aAAa,GAAG,OAAO,CAAC,KAAK,aAAa,GAAG,iBAAiB,YAAY,GAAG,IAAI,CAAC,CAAC;AAC5F;AAqBO,SAAS,cAAc,GAAoB;AAGhD,MAAI,IAAI;AACR,SAAO,IAAI,EAAE,QAAQ;AAInB,QAAI,aAAa,GAAG,CAAC,EAAG,QAAO;AAC/B,QAAI,IAAI;AAAA,EACV;AACA,SAAO;AACT;AAUA,SAAS,YAAqB;AAG5B,SAAO,EAAE,OAAO,OAAO,MAAM,GAAG,OAAO,GAAG,OAAO,EAAE;AACrD;AAOA,SAAS,UAAU,GAAW,GAAoB;AAKhD,QAAM,IAAI,YAAY,GAAG,CAAC;AAC1B,MAAI,MAAM,KAAK,OAAO,GAAG,CAAC,MAAM,GAAI,QAAO,UAAU;AACrD,QAAM,IAAI,YAAY,GAAG,IAAI,CAAC;AAC9B,MAAI,MAAM,IAAI,KAAK,OAAO,GAAG,CAAC,MAAM,GAAI,QAAO,UAAU;AACzD,QAAM,IAAI,YAAY,GAAG,IAAI,CAAC;AAC9B,MAAI,MAAM,IAAI,EAAG,QAAO,UAAU;AAClC,SAAO;AAAA,IACL,OAAO;AAAA,IACP,MAAM,YAAY,EAAE,MAAM,GAAG,CAAC,CAAC;AAAA,IAC/B,OAAO,YAAY,EAAE,MAAM,IAAI,GAAG,CAAC,CAAC;AAAA,IACpC,OAAO,YAAY,EAAE,MAAM,IAAI,GAAG,CAAC,CAAC;AAAA,EACtC;AACF;AAOA,SAAS,iBAAiB,GAAW,GAAoB;AAMvD,MAAI,MAAM,EAAE,OAAQ,QAAO,UAAU;AACrC,QAAM,IAAI,UAAU,GAAG,CAAC;AACxB,SAAO,EAAE,QAAQ,IAAI,iBAAiB,GAAG,IAAI,CAAC;AAChD;AAOO,SAAS,iBAAiB,MAAc,gBAAkC;AAG/E,SAAO,eAAe,gBAAgB,IAAI,GAAG,cAAc,IAAI,GAAG,cAAc;AAClF;AAOO,SAAS,oBAAoB,OAAwB;AAG1D,QAAM,IAAI,iBAAiB,OAAO,CAAC;AACnC,SAAO,2BAA2B,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK;AACrE;AASO,SAAS,YAAY,SAAkB,QAAiB,SAA0B;AAMvF,MAAI,CAAC,QAAS,QAAO;AACrB,MAAI,CAAC,OAAQ,QAAO;AACpB,SAAO,UAAU,SAAS;AAC5B;AAkBA,SAAS,WAAmB;AAG1B,SAAO,EAAE,OAAO,OAAO,OAAO,GAAG,OAAO,GAAG,OAAO,GAAG,KAAK,OAAO,OAAO,MAAM;AAChF;AAOA,SAAS,QAAQ,GAAW,KAAqB;AAM/C,SAAO,OAAO,GAAG,GAAG,MAAM,MAAM,YAAY,GAAG,MAAM,CAAC,IAAI,MAAM,IAAI,YAAY,GAAG,MAAM,CAAC,IAAI;AAChG;AAOA,SAAS,UAAU,GAAW,KAAqB;AAKjD,QAAM,IAAI,QAAQ,GAAG,GAAG;AACxB,SAAO,MAAM,MAAM,IAAI,YAAY,EAAE,MAAM,MAAM,GAAG,CAAC,CAAC;AACxD;AAOA,SAAS,iBAAiB,GAAW,GAAoB;AAMvD,MAAI,MAAM,EAAG,QAAO;AACpB,QAAM,IAAI,OAAO,GAAG,IAAI,CAAC;AACzB,SAAO,MAAM,MAAM,MAAM,KAAK,iBAAiB,GAAG,IAAI,CAAC,IAAI,MAAM;AACnE;AAOA,SAAS,SAAS,GAAW,GAAmB;AAK9C,QAAM,IAAI,YAAY,GAAG,CAAC;AAC1B,MAAI,MAAM,EAAG,QAAO,SAAS;AAC7B,QAAM,IAAI,QAAQ,GAAG,CAAC;AACtB,QAAM,IAAI,QAAQ,GAAG,CAAC;AACtB,SAAO;AAAA,IACL,OAAO;AAAA,IACP,OAAO,YAAY,EAAE,MAAM,GAAG,CAAC,CAAC;AAAA,IAChC,OAAO,UAAU,GAAG,CAAC;AAAA,IACrB,OAAO,UAAU,GAAG,CAAC;AAAA,IACrB,KAAK,OAAO,GAAG,CAAC,MAAM;AAAA,IACtB,OAAO,iBAAiB,GAAG,CAAC;AAAA,EAC9B;AACF;AAOA,SAAS,gBAAgB,GAAW,GAAmB;AAMrD,MAAI,MAAM,EAAE,OAAQ,QAAO,SAAS;AACpC,QAAM,IAAI,SAAS,GAAG,CAAC;AACvB,SAAO,EAAE,QAAQ,IAAI,gBAAgB,GAAG,IAAI,CAAC;AAC/C;AAQA,SAAS,cACP,GACA,YACA,YACA,YACS;AAGT,SACE,CAAC,EAAE,SACH;AAAA,IACE,EAAE;AAAA,IACF,EAAE;AAAA,IACF,EAAE;AAAA,IACF;AAAA,IACA;AAAA,IACA,EAAE,MAAM,aAAa,IAAI;AAAA,EAC3B;AAEJ;AAOO,SAAS,iBACd,SACA,OACA,YACA,YACA,YACQ;AAGR,QAAM,IAAI,gBAAgB,OAAO,CAAC;AAClC,SAAO,YAAY,SAAS,EAAE,OAAO,cAAc,GAAG,YAAY,YAAY,UAAU,CAAC;AAC3F;AAOO,SAAS,gBAAgB,SAAkB,OAAuB;AAGvE,SAAO,iBAAiB,SAAS,OAAO,IAAI,GAAG,CAAC;AAClD;AAOO,SAAS,iBAAiB,SAAkB,OAAuB;AAGxE,SAAO,iBAAiB,SAAS,OAAO,IAAI,GAAG,CAAC;AAClD;AAQO,SAAS,oBAAoB,SAAkB,OAAuB;AAG3E,SAAO,iBAAiB,SAAS,OAAO,MAAM,IAAI,CAAC;AACrD;AAOO,SAAS,kBAAkB,MAAuB;AAGvD,SAAO,SAAS,MAAM,KAAK,KAAK,SAAS,MAAM,MAAM;AACvD;AAOO,SAAS,SAAS,MAAuB;AAG9C,SAAO,SAAS;AAClB;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":[]}