pagegraph 0.11.0 → 0.13.0

package/dist/audit.d.ts

@@ -1,6 +1,6 @@
-import "./content-DVL2iyGU.js";
-import * as Context from "effect/Context";
+import "./content-DgNr7apS.js";
 import * as Effect from "effect/Effect";
+import * as Context from "effect/Context";
 import * as Layer from "effect/Layer";
 import { Data, Schema } from "effect";
 import "node:net";

package/dist/audit.js

@@ -1,12 +1,13 @@
-import { l as extractAnchors, r as extractPageContent, t as checkPageContent } from "./content-CB_kHmJ3.js";
+import { l as extractAnchors, r as extractPageContent, t as checkPageContent } from "./content-CHd0X4s6.js";
 import { mkdir, mkdtemp, readFile, rename, rm, writeFile } from "node:fs/promises";
 import { join } from "node:path";
-import * as Context from "effect/Context";
 import * as Data$1 from "effect/Data";
 import * as Effect from "effect/Effect";
+import * as Schema$1 from "effect/Schema";
+import { createHash } from "node:crypto";
+import * as Context from "effect/Context";
 import * as Layer from "effect/Layer";
 import { Data, Schema } from "effect";
-import { createHash } from "node:crypto";
 import { createServer, request } from "node:http";
 import { request as request$1 } from "node:https";
 import { BlockList, connect, isIP } from "node:net";
@@ -16,7 +17,6 @@ import { spawn } from "node:child_process";
 import { createRequire } from "node:module";
 import { tmpdir } from "node:os";
 import * as Option from "effect/Option";
-import * as Schema$1 from "effect/Schema";
 //#region src/audit/rules.ts
 const record = (value) => typeof value === "object" && value !== null && !Array.isArray(value) ? value : void 0;
 const stringAt = (value, ...keys) => {

package/dist/build-only/audit.d.ts

@@ -0,0 +1 @@
+export {}

package/dist/build-only/audit.js

@@ -0,0 +1,6 @@
+import { t as buildOnlyError } from "../message-CuBjgZ74.js";
+//#region src/build-only/audit.ts
+throw buildOnlyError("pagegraph/audit");
+//#endregion
+
+//# sourceMappingURL=audit.js.map

package/dist/build-only/audit.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"audit.js","names":[],"sources":["../../src/build-only/audit.ts"],"sourcesContent":["import { buildOnlyError } from \"./message\";\n\nthrow buildOnlyError(\"pagegraph/audit\");\n"],"mappings":";;AAEA,MAAM,eAAe,iBAAiB"}

package/dist/build-only/claims.d.ts

@@ -0,0 +1 @@
+export {}

package/dist/build-only/claims.js

@@ -0,0 +1,6 @@
+import { t as buildOnlyError } from "../message-CuBjgZ74.js";
+//#region src/build-only/claims.ts
+throw buildOnlyError("pagegraph/claims");
+//#endregion
+
+//# sourceMappingURL=claims.js.map

package/dist/build-only/claims.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"claims.js","names":[],"sources":["../../src/build-only/claims.ts"],"sourcesContent":["import { buildOnlyError } from \"./message\";\n\nthrow buildOnlyError(\"pagegraph/claims\");\n"],"mappings":";;AAEA,MAAM,eAAe,kBAAkB"}

package/dist/build-only/config.d.ts

@@ -0,0 +1 @@
+export {}

package/dist/build-only/config.js

@@ -0,0 +1,6 @@
+import { t as buildOnlyError } from "../message-CuBjgZ74.js";
+//#region src/build-only/config.ts
+throw buildOnlyError("pagegraph/config");
+//#endregion
+
+//# sourceMappingURL=config.js.map

package/dist/build-only/config.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"config.js","names":[],"sources":["../../src/build-only/config.ts"],"sourcesContent":["import { buildOnlyError } from \"./message\";\n\nthrow buildOnlyError(\"pagegraph/config\");\n"],"mappings":";;AAEA,MAAM,eAAe,kBAAkB"}

package/dist/build-only/oxlint.d.ts

@@ -0,0 +1 @@
+export {}

package/dist/build-only/oxlint.js

@@ -0,0 +1,6 @@
+import { t as buildOnlyError } from "../message-CuBjgZ74.js";
+//#region src/build-only/oxlint.ts
+throw buildOnlyError("pagegraph/oxlint");
+//#endregion
+
+//# sourceMappingURL=oxlint.js.map

package/dist/build-only/oxlint.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"oxlint.js","names":[],"sources":["../../src/build-only/oxlint.ts"],"sourcesContent":["import { buildOnlyError } from \"./message\";\n\nthrow buildOnlyError(\"pagegraph/oxlint\");\n"],"mappings":";;AAEA,MAAM,eAAe,kBAAkB"}

package/dist/build-only/tanstack-start.d.ts

@@ -0,0 +1 @@
+export {}

package/dist/build-only/tanstack-start.js

@@ -0,0 +1,6 @@
+import { t as buildOnlyError } from "../message-CuBjgZ74.js";
+//#region src/build-only/tanstack-start.ts
+throw buildOnlyError("pagegraph/tanstack-start");
+//#endregion
+
+//# sourceMappingURL=tanstack-start.js.map

package/dist/build-only/tanstack-start.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tanstack-start.js","names":[],"sources":["../../src/build-only/tanstack-start.ts"],"sourcesContent":["import { buildOnlyError } from \"./message\";\n\nthrow buildOnlyError(\"pagegraph/tanstack-start\");\n"],"mappings":";;AAEA,MAAM,eAAe,0BAA0B"}

package/dist/build-only/vite.d.ts

@@ -0,0 +1 @@
+export {}

package/dist/build-only/vite.js

@@ -0,0 +1,6 @@
+import { t as buildOnlyError } from "../message-CuBjgZ74.js";
+//#region src/build-only/vite.ts
+throw buildOnlyError("pagegraph/vite");
+//#endregion
+
+//# sourceMappingURL=vite.js.map

package/dist/build-only/vite.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"vite.js","names":[],"sources":["../../src/build-only/vite.ts"],"sourcesContent":["import { buildOnlyError } from \"./message\";\n\nthrow buildOnlyError(\"pagegraph/vite\");\n"],"mappings":";;AAEA,MAAM,eAAe,gBAAgB"}

package/dist/{checks-nk8ZRRIA.js → checks-BS-aDXB_.js}

@@ -1,142 +1,4 @@
-//#region src/core/projections.ts
-const escapeXml = (value) => value.replace(/&/g, "&amp;").replace(/</g, "&lt;").replace(/>/g, "&gt;").replace(/"/g, "&quot;").replace(/'/g, "&apos;");
-/**
-* A node belongs in the sitemap when it declares a positive sitemap policy, is not
-* a redirect, is not robots-noindexed, and is not a param template (a route whose
-* path still contains a `$` segment — those exist only so their instances inherit).
-*/
-function isSitemapEligible(node) {
-	if (node.policy.redirectTo !== void 0) return false;
-	if (node.policy.robots?.includes("noindex")) return false;
-	if (!node.policy.sitemap) return false;
-	if (node.path.includes("$")) return false;
-	return true;
-}
-/** Canonical absolute URL for a node under the given origin. */
-function urlForNode(origin, node) {
-	return node.path === "/" ? origin : `${origin}${node.path}`;
-}
-/**
-* The date a node's content last changed, as declared: an instance's
-* `modifiedAt`, else its `publishedAt`; a route's own `modifiedAt`. A node with
-* no date (a docs page without frontmatter dates, an undated route) returns
-* undefined, and the sitemap omits its `<lastmod>`.
-*/
-function lastModified(node) {
-	if (node.instance) return node.instance.modifiedAt ?? node.instance.publishedAt;
-	return node.policy.modifiedAt;
-}
-/** An ISO 8601 date, or a date-time that states its offset. */
-const ISO_DATE = /^(\d{4})-(\d{2})-(\d{2})(?:T\d{2}:\d{2}(?::\d{2}(?:\.\d+)?)?(?:Z|[+-]\d{2}:\d{2}))?$/;
-/**
-* Parse a declared date to epoch milliseconds, or undefined when it is not an
-* ISO 8601 date (`2026-09-29`) or offset date-time (`2026-09-29T10:00:00Z`) on a
-* real calendar day. `Date.parse` alone would accept "Sep 29" in the host's
-* zone and roll "2026-02-30" into March; either would publish a wrong
-* `<lastmod>`. The `invalid-date` check reports the undefined case, so
-* projections that meet one fail loudly.
-*/
-function parseDeclaredDate(value) {
-	const match = ISO_DATE.exec(value);
-	if (match === null) return void 0;
-	const [year, month, day] = [
-		Number(match[1]),
-		Number(match[2]),
-		Number(match[3])
-	];
-	const calendar = new Date(Date.UTC(year, month - 1, day));
-	if (calendar.getUTCMonth() !== month - 1 || calendar.getUTCDate() !== day) return void 0;
-	const time = Date.parse(value);
-	return Number.isNaN(time) ? void 0 : time;
-}
-function sitemapLastmod(node) {
-	const date = lastModified(node);
-	if (date === void 0) return void 0;
-	const time = parseDeclaredDate(date);
-	if (time === void 0) throw new Error(`"${node.path}" declares an invalid date "${date}"; run \`pagegraph check\`.`);
-	return new Date(time).toISOString();
-}
-function renderUrlEntry(url, lastmod, node) {
-	const { changeFrequency, priority } = node.policy.sitemap;
-	const lines = [`  <url>`, `    <loc>${escapeXml(url)}</loc>`];
-	if (lastmod) lines.push(`    <lastmod>${lastmod}</lastmod>`);
-	lines.push(`    <changefreq>${changeFrequency}</changefreq>`, `    <priority>${priority.toFixed(1)}</priority>`, `  </url>`);
-	return lines.join("\n");
-}
-/**
-* Render sitemap.xml from the graph. Each entry's `<lastmod>` is its
-* {@link lastModified} date: frontmatter for content instances, the declared
-* `modifiedAt` for routes. Route entries are sorted by path, then instances follow in collection order.
-* `indexable` is intentionally unused — the sitemap body is host-independent;
-* robots.txt is what gates crawling.
-*/
-function renderSitemap(graph, cfg) {
-	const nodes = [...graph.nodes.values()];
-	const staticNodes = nodes.filter((node) => node.source === "route" && isSitemapEligible(node)).sort((a, b) => a.path < b.path ? -1 : a.path > b.path ? 1 : 0);
-	const instanceNodes = nodes.filter((node) => node.source !== "route" && isSitemapEligible(node));
-	const seen = /* @__PURE__ */ new Set();
-	const entries = [];
-	for (const node of [...staticNodes, ...instanceNodes]) {
-		const url = urlForNode(cfg.origin, node);
-		const key = url.toLowerCase().replace(/\/$/, "");
-		if (seen.has(key)) continue;
-		seen.add(key);
-		entries.push(renderUrlEntry(url, sitemapLastmod(node), node));
-	}
-	return `<?xml version="1.0" encoding="UTF-8"?>\n<urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9">\n${entries.join("\n")}\n</urlset>\n`;
-}
-/** Format a Content-Signal robots.txt directive from the preference list. */
-function contentSignal(value) {
-	return `Content-Signal: ${value}`;
-}
-const groupLines = (cfg) => {
-	const lines = [];
-	if (cfg.contentSignal !== void 0 && cfg.contentSignal !== "") lines.push(contentSignal(cfg.contentSignal));
-	for (const directive of cfg.directives ?? []) if (directive !== "") lines.push(directive);
-	return lines;
-};
-/**
-* Render robots.txt. A non-indexable host (previews) gets a disallow-all
-* with no Sitemap line; an indexable host disallows exactly the prefixes the caller
-* passes. Pages that declare `robots: noindex` are intentionally NOT added as
-* Disallow entries — a Disallow would stop crawlers reaching the page to read its
-* `noindex, follow` meta, so the graph's per-node robots policy never feeds this
-* list. `graph` is unused — kept for signature parity with the other projections,
-* which callers load the graph once for and pass to each.
-*
-* Origin-wide group directives (`contentSignal`, `directives`) are indexable-host
-* only. {@link RobotsConfig.transform} always runs last so a consumer can override
-* the whole file.
-*/
-function renderRobots(_graph, cfg) {
-	const rendered = cfg.indexable ? [
-		"User-agent: *",
-		...groupLines(cfg),
-		"Allow: /",
-		...cfg.disallow.map((path) => `Disallow: ${path}`),
-		"",
-		`Sitemap: ${cfg.origin}/sitemap.xml`,
-		`Host: ${cfg.origin}`,
-		""
-	].join("\n") : [
-		"User-agent: *",
-		"Disallow: /",
-		""
-	].join("\n");
-	return cfg.transform === void 0 ? rendered : cfg.transform(rendered);
-}
-/** Inspect a single node: its declaration, sitemap eligibility, and edges. */
-function inspectNode(graph, path) {
-	const node = graph.nodes.get(path);
-	if (!node) return void 0;
-	return {
-		node,
-		inSitemap: isSitemapEligible(node),
-		incoming: graph.edges.filter((edge) => edge.to === path),
-		outgoing: graph.edges.filter((edge) => edge.from === path)
-	};
-}
-//#endregion
+import { a as parseDeclaredDate, i as lastModified, r as isSitemapEligible } from "./projections-D0oOFKiY.js";
 //#region src/core/freshness.ts
 const DAY_MS = 864e5;
 /**
@@ -466,7 +328,7 @@ function checkCoverage(graph, rules) {
 * distinction the declared pass draws by counting `related` edges alone.
 *
 * The target universe is the declared graph's sitemap-eligible pages: the globs
-* in `seo.config.ts` are written against declared paths, and the crawl is what
+* in `pagegraph.config.ts` are written against declared paths, and the crawl is what
 * supplies the served edges. Pass the crawl's `internalEdges` (each edge carries
 * its `region`).
 */
@@ -485,6 +347,6 @@ function checkRenderedCoverage(graph, renderedEdges, rules) {
 /** Structural violations fail `pagegraph check`; editorial-only stays green. */
 const hasStructuralViolations = (violations) => violations.some((violation) => violation.severity === "structural");
 //#endregion
-export { globToRegExp as a, contentSignal as c, lastModified as d, renderRobots as f, checkRenderedCoverage as i, inspectNode as l, checkFreshness as n, hasStructuralViolations as o, renderSitemap as p, checkGraph as r, freshnessReport as s, checkCoverage as t, isSitemapEligible as u };
+export { globToRegExp as a, checkRenderedCoverage as i, checkFreshness as n, hasStructuralViolations as o, checkGraph as r, freshnessReport as s, checkCoverage as t };
 
-//# sourceMappingURL=checks-nk8ZRRIA.js.map
+//# sourceMappingURL=checks-BS-aDXB_.js.map

package/dist/checks-BS-aDXB_.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"checks-BS-aDXB_.js","names":[],"sources":["../src/core/freshness.ts","../src/core/checks.ts"],"sourcesContent":["/**\n * Freshness: how long ago each indexable page last changed, by the dates its\n * declaration carries ({@link lastModified}). Pure — the caller injects `now`,\n * so a test and the CLI read the same verdict from the same graph.\n *\n * Only sitemap-eligible pages are judged: a noindex or redirect page is not a\n * refresh candidate. A page with no date is reported as `undated` rather than\n * stale, because age cannot be inferred; the sitemap omits its `<lastmod>` too.\n */\n\nimport type { SeoKind } from \"./declare\";\nimport type { SeoGraph, SeoSource } from \"./graph\";\nimport { isSitemapEligible, lastModified, parseDeclaredDate } from \"./projections\";\n\n/** Project policy: pages whose last change is older than this are stale. */\nexport interface FreshnessPolicy {\n  readonly maxAgeDays: number;\n}\n\nexport interface FreshnessEntry {\n  readonly path: string;\n  readonly kind: SeoKind;\n  readonly source: SeoSource;\n  /** The declared date, normalized to ISO 8601. */\n  readonly lastModified: string;\n  /** Whole days between `lastModified` and the report's `asOf`. */\n  readonly ageDays: number;\n}\n\nexport interface FreshnessReport {\n  readonly asOf: string;\n  readonly maxAgeDays: number;\n  /** Pages older than `maxAgeDays`, oldest first: the refresh queue. */\n  readonly stale: ReadonlyArray<FreshnessEntry>;\n  /** Dated pages within `maxAgeDays`, newest first. */\n  readonly fresh: ReadonlyArray<FreshnessEntry>;\n  /** Sitemap-eligible pages that declare no date, in graph order. */\n  readonly undated: ReadonlyArray<string>;\n  /** Sitemap-eligible pages whose date does not parse; `check` fails on each. */\n  readonly invalid: ReadonlyArray<string>;\n}\n\nconst DAY_MS = 86_400_000;\n\n/**\n * Split the graph's sitemap-eligible pages into stale, fresh, undated, and\n * invalid. An invalid date cannot be aged, but it is listed so a report never\n * reads as complete while it skipped a page.\n */\nexport function freshnessReport(\n  graph: SeoGraph,\n  policy: FreshnessPolicy,\n  now: Date,\n): FreshnessReport {\n  const stale: Array<FreshnessEntry> = [];\n  const fresh: Array<FreshnessEntry> = [];\n  const undated: Array<string> = [];\n  const invalid: Array<string> = [];\n\n  for (const node of graph.nodes.values()) {\n    if (!isSitemapEligible(node)) continue;\n    const declared = lastModified(node);\n    if (declared === undefined) {\n      undated.push(node.path);\n      continue;\n    }\n    const time = parseDeclaredDate(declared);\n    if (time === undefined) {\n      invalid.push(node.path);\n      continue;\n    }\n    const entry: FreshnessEntry = {\n      path: node.path,\n      kind: node.kind,\n      source: node.source,\n      lastModified: new Date(time).toISOString(),\n      ageDays: Math.max(0, Math.floor((now.getTime() - time) / DAY_MS)),\n    };\n    (entry.ageDays > policy.maxAgeDays ? stale : fresh).push(entry);\n  }\n\n  stale.sort((a, b) => b.ageDays - a.ageDays || (a.path < b.path ? -1 : 1));\n  fresh.sort((a, b) => a.ageDays - b.ageDays || (a.path < b.path ? -1 : 1));\n  return {\n    asOf: now.toISOString(),\n    maxAgeDays: policy.maxAgeDays,\n    stale,\n    fresh,\n    undated,\n    invalid,\n  };\n}\n","/**\n * The SEO check engine: a set of rules run against the derived {@link SeoGraph}.\n * Pure — no I/O, no `clientEnv`, no React. The CLI's `pagegraph check` command and the\n * vitest suite both call {@link checkGraph}; nothing else derives correctness.\n *\n * Two severities, mapped to the CLI's exit contract:\n *  - `structural` — a declaration is internally broken (a link points nowhere, a\n *    card would render empty, a page contradicts its own robots/sitemap intent).\n *    Any structural violation fails `pagegraph check` (exit 1); these must not ship.\n *  - `editorial` — a quality smell (duplicate or mis-sized titles/descriptions).\n *    Reported as warnings; `pagegraph check` still exits 0 when only these are present.\n *\n * The graph only knows what declarations and frontmatter carry, so the rules are\n * scoped to that: per-node title/description live only on collection *instances*,\n * never on structural route nodes (whose head tags are composed at render time and\n * are not in the graph). Rules are data-driven and listed once in\n * {@link CHECK_RULES}.\n */\n\nimport type { SitemapPolicy } from \"./declare\";\nimport { freshnessReport, type FreshnessPolicy } from \"./freshness\";\nimport type { SeoGraph, SeoNode } from \"./graph\";\nimport type { LinkEdge } from \"./links\";\nimport { isSitemapEligible, parseDeclaredDate } from \"./projections\";\n\nexport type Severity = \"structural\" | \"editorial\";\n\nexport interface Violation {\n  severity: Severity;\n  rule: string;\n  path?: string | undefined;\n  message: string;\n  fix?: string | undefined;\n}\n\n/**\n * A contextual-link coverage rule: every sitemap-eligible page matching the\n * `path` glob must have at least `minInbound` incoming contextual links. Unlike\n * the static rules, these come from project policy (a CLI flag or\n * `pagegraph.config.ts`), because \"which pages are money pages\" is app knowledge.\n *\n * The same rule shape is evaluated twice: `checkCoverage` counts declared\n * `related` edges, and `checkRenderedCoverage` counts the contextual anchors a\n * crawl actually served. The target universe is always the declared graph's\n * sitemap-eligible pages — the rendered pass only swaps the edge source.\n */\nexport interface CoverageRule {\n  /** Path glob: `*` matches within a segment, `**` matches across segments. */\n  readonly path: string;\n  /** Minimum incoming contextual links the matched page needs. */\n  readonly minInbound: number;\n}\n\n/** A single finding before its rule's `severity`/`rule` name are attached. */\ninterface RawViolation {\n  path?: string | undefined;\n  message: string;\n  fix?: string | undefined;\n}\n\ninterface CheckRule {\n  readonly name: string;\n  readonly severity: Severity;\n  readonly evaluate: (graph: SeoGraph) => ReadonlyArray<RawViolation>;\n}\n\n/** A positive sitemap policy — the author asked for this page to be indexed. */\nconst hasPositiveSitemap = (sitemap: SitemapPolicy | false | undefined): sitemap is SitemapPolicy =>\n  sitemap !== undefined && sitemap !== false;\n\n/** Content and manifest instances carry page-level title/description. */\nconst isInstance = (node: SeoNode): boolean => node.source !== \"route\";\n\n/** Group instance nodes by a present, non-empty string field for duplicate detection. */\nconst groupInstancesBy = (\n  graph: SeoGraph,\n  field: (node: SeoNode) => string | undefined,\n): Map<string, Array<SeoNode>> => {\n  const groups = new Map<string, Array<SeoNode>>();\n  for (const node of graph.nodes.values()) {\n    if (!isInstance(node)) continue;\n    const value = field(node)?.trim();\n    if (!value) continue;\n    const bucket = groups.get(value);\n    if (bucket) bucket.push(node);\n    else groups.set(value, [node]);\n  }\n  return groups;\n};\n\nconst DESCRIPTION_MAX = 160;\nconst DESCRIPTION_MIN = 50;\n\n/**\n * Every check, in one place. `checkGraph` runs them in order and stamps each\n * finding with its rule name and severity, so the output is grouped by rule and\n * deterministic (nodes iterate in graph insertion order, edges in array order).\n */\nconst CHECK_RULES: ReadonlyArray<CheckRule> = [\n  {\n    name: \"path-owner-collision\",\n    severity: \"structural\",\n    evaluate: (graph) =>\n      (graph.collisions ?? []).map((collision) => ({\n        path: collision.path,\n        message: `Canonical path \"${collision.path}\" is owned by multiple sources: ${collision.sources.join(\", \")}.`,\n        fix: \"Give every concrete page one canonical path and one graph owner.\",\n      })),\n  },\n  {\n    name: \"canonical-path-collision\",\n    severity: \"structural\",\n    evaluate: (graph) => {\n      const groups = new Map<string, Array<string>>();\n      for (const path of graph.nodes.keys()) {\n        const canonical = path.toLowerCase().replace(/\\/$/, \"\") || \"/\";\n        const paths = groups.get(canonical);\n        if (paths) paths.push(path);\n        else groups.set(canonical, [path]);\n      }\n      return [...groups.values()]\n        .filter((paths) => paths.length > 1)\n        .flatMap((paths) =>\n          paths.map((path) => ({\n            path,\n            message: `Canonical path collides with ${paths.filter((candidate) => candidate !== path).join(\", \")}.`,\n            fix: \"Use one lowercase, trailing-slash-normalized canonical path.\",\n          })),\n        );\n    },\n  },\n  {\n    name: \"self-edge\",\n    severity: \"structural\",\n    evaluate: (graph) =>\n      graph.edges\n        .filter((edge) => edge.from === edge.to)\n        .map((edge) => ({\n          path: edge.from,\n          message: `${edge.type} edge points back to its own source node.`,\n          fix: \"Remove the self-reference from the canonical manifest or route declaration.\",\n        })),\n  },\n  {\n    name: \"duplicate-edge\",\n    severity: \"structural\",\n    evaluate: (graph) => {\n      const seen = new Set<string>();\n      const duplicates: Array<RawViolation> = [];\n      for (const edge of graph.edges) {\n        const key = `${edge.from}\\u0000${edge.to}\\u0000${edge.type}`;\n        if (seen.has(key)) {\n          duplicates.push({\n            path: edge.from,\n            message: `Duplicate ${edge.type} edge from \"${edge.from}\" to \"${edge.to}\".`,\n            fix: \"Declare each graph relationship exactly once.\",\n          });\n        } else {\n          seen.add(key);\n        }\n      }\n      return duplicates;\n    },\n  },\n  {\n    // A `related` or `redirect` edge points at a path with no node — the target\n    // route/page was renamed or deleted and the declaration wasn't updated.\n    name: \"dead-edge\",\n    severity: \"structural\",\n    evaluate: (graph) =>\n      graph.edges\n        .filter((edge) => edge.type !== \"crumb-parent\" && !graph.nodes.has(edge.to))\n        .map((edge) => ({\n          path: edge.from,\n          message: `${edge.type} edge from \"${edge.from}\" points at \"${edge.to}\", which is not a node in the graph.`,\n          fix: `Update the ${edge.type === \"redirect\" ? \"redirectTo\" : \"related\"} target on the \"${edge.from}\" route, or restore \"${edge.to}\".`,\n        })),\n  },\n  {\n    // A content instance with no usable title can't render a legible <title> or card.\n    name: \"instance-missing-title\",\n    severity: \"structural\",\n    evaluate: (graph) =>\n      [...graph.nodes.values()]\n        .filter((node) => isInstance(node) && !node.instance?.title.trim())\n        .map((node) => ({\n          path: node.path,\n          message: `Content page \"${node.path}\" has no title.`,\n          fix: \"Add a `title` to the page frontmatter.\",\n        })),\n  },\n  {\n    // The declaration asks for the page to be in the sitemap yet also marks it\n    // noindex — contradictory intent. The projection resolves it (noindex wins,\n    // excluded), but the declaration should say one thing.\n    name: \"sitemap-noindex-contradiction\",\n    severity: \"structural\",\n    evaluate: (graph) =>\n      [...graph.nodes.values()]\n        .filter(\n          (node) =>\n            hasPositiveSitemap(node.policy.sitemap) &&\n            node.policy.robots?.toLowerCase().includes(\"noindex\"),\n        )\n        .map((node) => ({\n          path: node.path,\n          message: `\"${node.path}\" declares a sitemap policy but its robots value is \"${node.policy.robots}\".`,\n          fix: \"Drop the sitemap policy (or set `sitemap: false`) on a noindex page, or remove the noindex robots value.\",\n        })),\n  },\n  {\n    // Robots declarations are house-convention lowercase: the sitemap projection\n    // matches `includes(\"noindex\")` literally, so a miscased value (\"Noindex\")\n    // would silently stay sitemap-eligible. This gate makes that unrepresentable.\n    name: \"robots-not-lowercase\",\n    severity: \"structural\",\n    evaluate: (graph) =>\n      [...graph.nodes.values()]\n        .filter(\n          (node) =>\n            node.policy.robots !== undefined &&\n            node.policy.robots !== node.policy.robots.toLowerCase(),\n        )\n        .map((node) => ({\n          path: node.path,\n          message: `\"${node.path}\" declares robots \"${node.policy.robots}\" — robots values must be lowercase.`,\n          fix: 'Lowercase the robots declaration (e.g. \"noindex, follow\").',\n        })),\n  },\n  {\n    // A `related` card for a route target renders from that route's `link`\n    // metadata; without it the card has no title/description and renders empty.\n    // (Content-instance targets render from their frontmatter, so they're exempt.)\n    name: \"related-target-missing-link\",\n    severity: \"structural\",\n    evaluate: (graph) => {\n      const linklessTargets = new Set<string>();\n      for (const edge of graph.edges) {\n        if (edge.type !== \"related\") continue;\n        const target = graph.nodes.get(edge.to);\n        if (target && target.source === \"route\" && target.policy.link === undefined) {\n          linklessTargets.add(edge.to);\n        }\n      }\n      return [...linklessTargets].map((path) => ({\n        path,\n        message: `Route \"${path}\" is a related-link target but declares no link metadata; its card would render empty.`,\n        fix: `Add \\`link: { title, description }\\` to the \"${path}\" route's staticData.seo.`,\n      }));\n    },\n  },\n  {\n    // A redirect/alias node should never advertise itself in the sitemap.\n    name: \"redirect-in-sitemap\",\n    severity: \"structural\",\n    evaluate: (graph) =>\n      [...graph.nodes.values()]\n        .filter(\n          (node) => node.policy.redirectTo !== undefined && hasPositiveSitemap(node.policy.sitemap),\n        )\n        .map((node) => ({\n          path: node.path,\n          message: `Redirect \"${node.path}\" (→ \"${node.policy.redirectTo}\") also declares a sitemap policy.`,\n          fix: \"Remove the sitemap policy from the redirect route; only its target belongs in the sitemap.\",\n        })),\n  },\n  {\n    // Every declared date feeds the sitemap's `<lastmod>`, and the sitemap\n    // projection refuses a date it cannot parse. Catch it here, at the\n    // declaration, instead of as a failed sitemap request.\n    name: \"invalid-date\",\n    severity: \"structural\",\n    evaluate: (graph) =>\n      [...graph.nodes.values()].flatMap((node) => {\n        const dates: Array<[string, string | undefined]> = node.instance\n          ? [\n              [\"publishedAt\", node.instance.publishedAt],\n              [\"modifiedAt\", node.instance.modifiedAt],\n            ]\n          : [[\"modifiedAt\", node.policy.modifiedAt]];\n        return dates.flatMap(([field, value]) =>\n          value !== undefined && parseDeclaredDate(value) === undefined\n            ? [\n                {\n                  path: node.path,\n                  message: `${field} \"${value}\" is not an ISO 8601 date on a real calendar day.`,\n                  fix: `Write ${field} as an ISO 8601 date, e.g. \"2026-09-29\".`,\n                },\n              ]\n            : [],\n        );\n      }),\n  },\n  {\n    name: \"duplicate-title\",\n    severity: \"editorial\",\n    evaluate: (graph) =>\n      [...groupInstancesBy(graph, (node) => node.instance?.title).entries()]\n        .filter(([, nodes]) => nodes.length > 1)\n        .flatMap(([title, nodes]) =>\n          nodes.map((node) => ({\n            path: node.path,\n            message: `Title \"${title}\" is shared by ${nodes.length} pages.`,\n            fix: \"Give each page a distinct title.\",\n          })),\n        ),\n  },\n  {\n    name: \"duplicate-description\",\n    severity: \"editorial\",\n    evaluate: (graph) =>\n      [...groupInstancesBy(graph, (node) => node.instance?.description).entries()]\n        .filter(([, nodes]) => nodes.length > 1)\n        .flatMap(([, nodes]) =>\n          nodes.map((node) => ({\n            path: node.path,\n            message: `Description is shared by ${nodes.length} pages.`,\n            fix: \"Write a distinct meta description for each page.\",\n          })),\n        ),\n  },\n  {\n    // Meta descriptions outside ~50–160 chars either get truncated in SERPs or\n    // read as too thin.\n    name: \"description-length\",\n    severity: \"editorial\",\n    evaluate: (graph) =>\n      [...graph.nodes.values()].flatMap((node) => {\n        if (!isInstance(node)) return [];\n        const description = node.instance?.description?.trim();\n        if (!description) return [];\n        if (description.length > DESCRIPTION_MAX) {\n          return [\n            {\n              path: node.path,\n              message: `Description is ${description.length} chars (max ${DESCRIPTION_MAX}); it will be truncated in results.`,\n              fix: `Trim the description to ${DESCRIPTION_MAX} characters or fewer.`,\n            },\n          ];\n        }\n        if (description.length < DESCRIPTION_MIN) {\n          return [\n            {\n              path: node.path,\n              message: `Description is ${description.length} chars (min ${DESCRIPTION_MIN}); it reads as thin.`,\n              fix: `Expand the description to at least ${DESCRIPTION_MIN} characters.`,\n            },\n          ];\n        }\n        return [];\n      }),\n  },\n];\n\n/**\n * Options for {@link checkGraph}. Freshness needs a clock, and the engine stays\n * pure, so a freshness policy is only accepted together with the `now` it is\n * judged against.\n */\nexport type CheckGraphOptions = {\n  readonly coverage?: ReadonlyArray<CoverageRule> | undefined;\n} & (\n  | { readonly freshness: FreshnessPolicy; readonly now: Date }\n  | { readonly freshness?: undefined; readonly now?: undefined }\n);\n\n/**\n * Run every static rule against the graph, then any caller-supplied\n * {@link CoverageRule}s and freshness policy, and return the flat list of\n * violations. With no options the result is exactly the static rule set.\n */\nexport function checkGraph(graph: SeoGraph, options: CheckGraphOptions = {}): Array<Violation> {\n  const violations: Array<Violation> = CHECK_RULES.flatMap((rule) =>\n    rule.evaluate(graph).map((raw): Violation => ({\n      severity: rule.severity,\n      rule: rule.name,\n      path: raw.path,\n      message: raw.message,\n      fix: raw.fix,\n    })),\n  );\n  const coverage = options.coverage;\n  if (coverage !== undefined && coverage.length > 0) {\n    violations.push(...checkCoverage(graph, coverage));\n  }\n  if (options.freshness !== undefined) {\n    violations.push(...checkFreshness(graph, options.freshness, options.now));\n  }\n  return violations;\n}\n\n/**\n * One editorial `stale-page` violation per sitemap-eligible page whose last\n * declared change is older than the policy allows. Undated pages are not\n * violations: see {@link freshnessReport} for the full picture.\n */\nexport function checkFreshness(\n  graph: SeoGraph,\n  policy: FreshnessPolicy,\n  now: Date,\n): Array<Violation> {\n  return freshnessReport(graph, policy, now).stale.map((entry) => ({\n    severity: \"editorial\",\n    rule: \"stale-page\",\n    path: entry.path,\n    message: `Last changed ${entry.lastModified.slice(0, 10)}, ${entry.ageDays} days ago (limit ${policy.maxAgeDays}).`,\n    fix: \"Review the page; when its content changes, update its modifiedAt.\",\n  }));\n}\n\n/** Escape a glob for `RegExp`, then expand `**`, `*`, and `?` to path-aware forms. */\nexport const globToRegExp = (glob: string): RegExp => {\n  const escaped = glob.replace(/[.+^${}()|[\\]\\\\]/g, \"\\\\$&\");\n  const source = escaped\n    .replace(/\\*\\*/g, \"\\u0000\")\n    .replace(/\\*/g, \"[^/]*\")\n    .replace(/\\?/g, \"[^/]\")\n    .replace(/\\u0000/g, \".*\");\n  return new RegExp(`^${source}$`);\n};\n\n/**\n * The minimal view a coverage rule needs: which paths exist (for the glob), which\n * of them are sitemap-eligible (the enforced set), and how many contextual links\n * each receives. Declared and rendered coverage differ only in how this surface\n * is built, so the rule engine itself stays single-sourced.\n */\ninterface CoverageSurface {\n  readonly paths: ReadonlyArray<string>;\n  readonly eligiblePaths: ReadonlyArray<string>;\n  readonly inbound: (path: string) => number;\n}\n\n/**\n * Enforce contextual-link coverage rules over an explicit surface.\n *\n * A rule that matches no sitemap-eligible page is itself a violation: a typo or\n * a rule aimed at a noindex page would otherwise pass silently forever.\n */\nconst checkCoverageRules = (\n  surface: CoverageSurface,\n  rules: ReadonlyArray<CoverageRule>,\n): Array<Violation> => {\n  const violations: Array<Violation> = [];\n  for (const rule of rules) {\n    const matcher = globToRegExp(rule.path);\n    const matched = surface.paths.filter((path) => matcher.test(path));\n    const eligible = surface.eligiblePaths.filter((path) => matcher.test(path));\n\n    if (eligible.length === 0) {\n      violations.push({\n        severity: \"structural\",\n        rule: \"coverage-rule-unmatched\",\n        message:\n          matched.length === 0\n            ? `Coverage rule \"${rule.path}\" matches no page in the graph.`\n            : `Coverage rule \"${rule.path}\" matches only pages that are not sitemap-eligible.`,\n        fix: \"Point the rule at a sitemap-eligible path, or drop it.\",\n      });\n      continue;\n    }\n\n    for (const path of eligible) {\n      const inbound = surface.inbound(path);\n      if (inbound >= rule.minInbound) continue;\n      violations.push({\n        severity: \"structural\",\n        rule: \"inbound-link-coverage\",\n        path,\n        message: `\"${path}\" has ${inbound} incoming contextual link(s); the coverage rule requires ${rule.minInbound}.`,\n        fix: `Add ${rule.minInbound - inbound} contextual link(s) pointing at \"${path}\".`,\n      });\n    }\n  }\n  return violations;\n};\n\n/** The sitemap-eligible path set of a declared graph, in graph insertion order. */\nconst eligiblePathsOf = (graph: SeoGraph): ReadonlyArray<string> =>\n  [...graph.nodes.values()].filter(isSitemapEligible).map((node) => node.path);\n\n/**\n * Enforce contextual-link coverage against the *declared* graph: only `related`\n * edges count — breadcrumb ancestry is navigation, not context.\n */\nexport function checkCoverage(\n  graph: SeoGraph,\n  rules: ReadonlyArray<CoverageRule>,\n): Array<Violation> {\n  return checkCoverageRules(\n    {\n      paths: [...graph.nodes.keys()],\n      eligiblePaths: eligiblePathsOf(graph),\n      inbound: (path) =>\n        graph.edges.filter((edge) => edge.type === \"related\" && edge.to === path).length,\n    },\n    rules,\n  );\n}\n\n/**\n * Enforce contextual-link coverage against the *rendered* graph: only same-origin\n * body-region anchors count. Nav, header, and footer anchors are site chrome, so\n * a page linked solely from them has no contextual inbound link — the same\n * distinction the declared pass draws by counting `related` edges alone.\n *\n * The target universe is the declared graph's sitemap-eligible pages: the globs\n * in `pagegraph.config.ts` are written against declared paths, and the crawl is what\n * supplies the served edges. Pass the crawl's `internalEdges` (each edge carries\n * its `region`).\n */\nexport function checkRenderedCoverage(\n  graph: SeoGraph,\n  renderedEdges: ReadonlyArray<LinkEdge>,\n  rules: ReadonlyArray<CoverageRule>,\n): Array<Violation> {\n  const inbound = new Map<string, number>();\n  for (const edge of renderedEdges) {\n    if (edge.region !== \"body\") continue;\n    inbound.set(edge.to, (inbound.get(edge.to) ?? 0) + 1);\n  }\n  return checkCoverageRules(\n    {\n      paths: [...graph.nodes.keys()],\n      eligiblePaths: eligiblePathsOf(graph),\n      inbound: (path) => inbound.get(path) ?? 0,\n    },\n    rules,\n  );\n}\n\n/** Structural violations fail `pagegraph check`; editorial-only stays green. */\nexport const hasStructuralViolations = (violations: ReadonlyArray<Violation>): boolean =>\n  violations.some((violation) => violation.severity === \"structural\");\n"],"mappings":";;AA0CA,MAAM,SAAS;;;;;;AAOf,SAAgB,gBACd,OACA,QACA,KACiB;CACjB,MAAM,QAA+B,CAAC;CACtC,MAAM,QAA+B,CAAC;CACtC,MAAM,UAAyB,CAAC;CAChC,MAAM,UAAyB,CAAC;CAEhC,KAAK,MAAM,QAAQ,MAAM,MAAM,OAAO,GAAG;EACvC,IAAI,CAAC,kBAAkB,IAAI,GAAG;EAC9B,MAAM,WAAW,aAAa,IAAI;EAClC,IAAI,aAAa,KAAA,GAAW;GAC1B,QAAQ,KAAK,KAAK,IAAI;GACtB;EACF;EACA,MAAM,OAAO,kBAAkB,QAAQ;EACvC,IAAI,SAAS,KAAA,GAAW;GACtB,QAAQ,KAAK,KAAK,IAAI;GACtB;EACF;EACA,MAAM,QAAwB;GAC5B,MAAM,KAAK;GACX,MAAM,KAAK;GACX,QAAQ,KAAK;GACb,cAAc,IAAI,KAAK,IAAI,CAAC,CAAC,YAAY;GACzC,SAAS,KAAK,IAAI,GAAG,KAAK,OAAO,IAAI,QAAQ,IAAI,QAAQ,MAAM,CAAC;EAClE;EACA,CAAC,MAAM,UAAU,OAAO,aAAa,QAAQ,MAAA,CAAO,KAAK,KAAK;CAChE;CAEA,MAAM,MAAM,GAAG,MAAM,EAAE,UAAU,EAAE,YAAY,EAAE,OAAO,EAAE,OAAO,KAAK,EAAE;CACxE,MAAM,MAAM,GAAG,MAAM,EAAE,UAAU,EAAE,YAAY,EAAE,OAAO,EAAE,OAAO,KAAK,EAAE;CACxE,OAAO;EACL,MAAM,IAAI,YAAY;EACtB,YAAY,OAAO;EACnB;EACA;EACA;EACA;CACF;AACF;;;;ACxBA,MAAM,sBAAsB,YAC1B,YAAY,KAAA,KAAa,YAAY;;AAGvC,MAAM,cAAc,SAA2B,KAAK,WAAW;;AAG/D,MAAM,oBACJ,OACA,UACgC;CAChC,MAAM,yBAAS,IAAI,IAA4B;CAC/C,KAAK,MAAM,QAAQ,MAAM,MAAM,OAAO,GAAG;EACvC,IAAI,CAAC,WAAW,IAAI,GAAG;EACvB,MAAM,QAAQ,MAAM,IAAI,CAAC,EAAE,KAAK;EAChC,IAAI,CAAC,OAAO;EACZ,MAAM,SAAS,OAAO,IAAI,KAAK;EAC/B,IAAI,QAAQ,OAAO,KAAK,IAAI;OACvB,OAAO,IAAI,OAAO,CAAC,IAAI,CAAC;CAC/B;CACA,OAAO;AACT;AAEA,MAAM,kBAAkB;AACxB,MAAM,kBAAkB;;;;;;AAOxB,MAAM,cAAwC;CAC5C;EACE,MAAM;EACN,UAAU;EACV,WAAW,WACR,MAAM,cAAc,CAAC,EAAA,CAAG,KAAK,eAAe;GAC3C,MAAM,UAAU;GAChB,SAAS,mBAAmB,UAAU,KAAK,kCAAkC,UAAU,QAAQ,KAAK,IAAI,EAAE;GAC1G,KAAK;EACP,EAAE;CACN;CACA;EACE,MAAM;EACN,UAAU;EACV,WAAW,UAAU;GACnB,MAAM,yBAAS,IAAI,IAA2B;GAC9C,KAAK,MAAM,QAAQ,MAAM,MAAM,KAAK,GAAG;IACrC,MAAM,YAAY,KAAK,YAAY,CAAC,CAAC,QAAQ,OAAO,EAAE,KAAK;IAC3D,MAAM,QAAQ,OAAO,IAAI,SAAS;IAClC,IAAI,OAAO,MAAM,KAAK,IAAI;SACrB,OAAO,IAAI,WAAW,CAAC,IAAI,CAAC;GACnC;GACA,OAAO,CAAC,GAAG,OAAO,OAAO,CAAC,CAAC,CACxB,QAAQ,UAAU,MAAM,SAAS,CAAC,CAAC,CACnC,SAAS,UACR,MAAM,KAAK,UAAU;IACnB;IACA,SAAS,gCAAgC,MAAM,QAAQ,cAAc,cAAc,IAAI,CAAC,CAAC,KAAK,IAAI,EAAE;IACpG,KAAK;GACP,EAAE,CACJ;EACJ;CACF;CACA;EACE,MAAM;EACN,UAAU;EACV,WAAW,UACT,MAAM,MACH,QAAQ,SAAS,KAAK,SAAS,KAAK,EAAE,CAAC,CACvC,KAAK,UAAU;GACd,MAAM,KAAK;GACX,SAAS,GAAG,KAAK,KAAK;GACtB,KAAK;EACP,EAAE;CACR;CACA;EACE,MAAM;EACN,UAAU;EACV,WAAW,UAAU;GACnB,MAAM,uBAAO,IAAI,IAAY;GAC7B,MAAM,aAAkC,CAAC;GACzC,KAAK,MAAM,QAAQ,MAAM,OAAO;IAC9B,MAAM,MAAM,GAAG,KAAK,KAAK,QAAQ,KAAK,GAAG,QAAQ,KAAK;IACtD,IAAI,KAAK,IAAI,GAAG,GACd,WAAW,KAAK;KACd,MAAM,KAAK;KACX,SAAS,aAAa,KAAK,KAAK,cAAc,KAAK,KAAK,QAAQ,KAAK,GAAG;KACxE,KAAK;IACP,CAAC;SAED,KAAK,IAAI,GAAG;GAEhB;GACA,OAAO;EACT;CACF;CACA;EAGE,MAAM;EACN,UAAU;EACV,WAAW,UACT,MAAM,MACH,QAAQ,SAAS,KAAK,SAAS,kBAAkB,CAAC,MAAM,MAAM,IAAI,KAAK,EAAE,CAAC,CAAC,CAC3E,KAAK,UAAU;GACd,MAAM,KAAK;GACX,SAAS,GAAG,KAAK,KAAK,cAAc,KAAK,KAAK,eAAe,KAAK,GAAG;GACrE,KAAK,cAAc,KAAK,SAAS,aAAa,eAAe,UAAU,kBAAkB,KAAK,KAAK,uBAAuB,KAAK,GAAG;EACpI,EAAE;CACR;CACA;EAEE,MAAM;EACN,UAAU;EACV,WAAW,UACT,CAAC,GAAG,MAAM,MAAM,OAAO,CAAC,CAAC,CACtB,QAAQ,SAAS,WAAW,IAAI,KAAK,CAAC,KAAK,UAAU,MAAM,KAAK,CAAC,CAAC,CAClE,KAAK,UAAU;GACd,MAAM,KAAK;GACX,SAAS,iBAAiB,KAAK,KAAK;GACpC,KAAK;EACP,EAAE;CACR;CACA;EAIE,MAAM;EACN,UAAU;EACV,WAAW,UACT,CAAC,GAAG,MAAM,MAAM,OAAO,CAAC,CAAC,CACtB,QACE,SACC,mBAAmB,KAAK,OAAO,OAAO,KACtC,KAAK,OAAO,QAAQ,YAAY,CAAC,CAAC,SAAS,SAAS,CACxD,CAAC,CACA,KAAK,UAAU;GACd,MAAM,KAAK;GACX,SAAS,IAAI,KAAK,KAAK,uDAAuD,KAAK,OAAO,OAAO;GACjG,KAAK;EACP,EAAE;CACR;CACA;EAIE,MAAM;EACN,UAAU;EACV,WAAW,UACT,CAAC,GAAG,MAAM,MAAM,OAAO,CAAC,CAAC,CACtB,QACE,SACC,KAAK,OAAO,WAAW,KAAA,KACvB,KAAK,OAAO,WAAW,KAAK,OAAO,OAAO,YAAY,CAC1D,CAAC,CACA,KAAK,UAAU;GACd,MAAM,KAAK;GACX,SAAS,IAAI,KAAK,KAAK,qBAAqB,KAAK,OAAO,OAAO;GAC/D,KAAK;EACP,EAAE;CACR;CACA;EAIE,MAAM;EACN,UAAU;EACV,WAAW,UAAU;GACnB,MAAM,kCAAkB,IAAI,IAAY;GACxC,KAAK,MAAM,QAAQ,MAAM,OAAO;IAC9B,IAAI,KAAK,SAAS,WAAW;IAC7B,MAAM,SAAS,MAAM,MAAM,IAAI,KAAK,EAAE;IACtC,IAAI,UAAU,OAAO,WAAW,WAAW,OAAO,OAAO,SAAS,KAAA,GAChE,gBAAgB,IAAI,KAAK,EAAE;GAE/B;GACA,OAAO,CAAC,GAAG,eAAe,CAAC,CAAC,KAAK,UAAU;IACzC;IACA,SAAS,UAAU,KAAK;IACxB,KAAK,gDAAgD,KAAK;GAC5D,EAAE;EACJ;CACF;CACA;EAEE,MAAM;EACN,UAAU;EACV,WAAW,UACT,CAAC,GAAG,MAAM,MAAM,OAAO,CAAC,CAAC,CACtB,QACE,SAAS,KAAK,OAAO,eAAe,KAAA,KAAa,mBAAmB,KAAK,OAAO,OAAO,CAC1F,CAAC,CACA,KAAK,UAAU;GACd,MAAM,KAAK;GACX,SAAS,aAAa,KAAK,KAAK,QAAQ,KAAK,OAAO,WAAW;GAC/D,KAAK;EACP,EAAE;CACR;CACA;EAIE,MAAM;EACN,UAAU;EACV,WAAW,UACT,CAAC,GAAG,MAAM,MAAM,OAAO,CAAC,CAAC,CAAC,SAAS,SAAS;GAO1C,QANmD,KAAK,WACpD,CACE,CAAC,eAAe,KAAK,SAAS,WAAW,GACzC,CAAC,cAAc,KAAK,SAAS,UAAU,CACzC,IACA,CAAC,CAAC,cAAc,KAAK,OAAO,UAAU,CAAC,EAAA,CAC9B,SAAS,CAAC,OAAO,WAC5B,UAAU,KAAA,KAAa,kBAAkB,KAAK,MAAM,KAAA,IAChD,CACE;IACE,MAAM,KAAK;IACX,SAAS,GAAG,MAAM,IAAI,MAAM;IAC5B,KAAK,SAAS,MAAM;GACtB,CACF,IACA,CAAC,CACP;EACF,CAAC;CACL;CACA;EACE,MAAM;EACN,UAAU;EACV,WAAW,UACT,CAAC,GAAG,iBAAiB,QAAQ,SAAS,KAAK,UAAU,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC,CACnE,QAAQ,GAAG,WAAW,MAAM,SAAS,CAAC,CAAC,CACvC,SAAS,CAAC,OAAO,WAChB,MAAM,KAAK,UAAU;GACnB,MAAM,KAAK;GACX,SAAS,UAAU,MAAM,iBAAiB,MAAM,OAAO;GACvD,KAAK;EACP,EAAE,CACJ;CACN;CACA;EACE,MAAM;EACN,UAAU;EACV,WAAW,UACT,CAAC,GAAG,iBAAiB,QAAQ,SAAS,KAAK,UAAU,WAAW,CAAC,CAAC,QAAQ,CAAC,CAAC,CACzE,QAAQ,GAAG,WAAW,MAAM,SAAS,CAAC,CAAC,CACvC,SAAS,GAAG,WACX,MAAM,KAAK,UAAU;GACnB,MAAM,KAAK;GACX,SAAS,4BAA4B,MAAM,OAAO;GAClD,KAAK;EACP,EAAE,CACJ;CACN;CACA;EAGE,MAAM;EACN,UAAU;EACV,WAAW,UACT,CAAC,GAAG,MAAM,MAAM,OAAO,CAAC,CAAC,CAAC,SAAS,SAAS;GAC1C,IAAI,CAAC,WAAW,IAAI,GAAG,OAAO,CAAC;GAC/B,MAAM,cAAc,KAAK,UAAU,aAAa,KAAK;GACrD,IAAI,CAAC,aAAa,OAAO,CAAC;GAC1B,IAAI,YAAY,SAAS,iBACvB,OAAO,CACL;IACE,MAAM,KAAK;IACX,SAAS,kBAAkB,YAAY,OAAO,cAAc,gBAAgB;IAC5E,KAAK,2BAA2B,gBAAgB;GAClD,CACF;GAEF,IAAI,YAAY,SAAS,iBACvB,OAAO,CACL;IACE,MAAM,KAAK;IACX,SAAS,kBAAkB,YAAY,OAAO,cAAc,gBAAgB;IAC5E,KAAK,sCAAsC,gBAAgB;GAC7D,CACF;GAEF,OAAO,CAAC;EACV,CAAC;CACL;AACF;;;;;;AAmBA,SAAgB,WAAW,OAAiB,UAA6B,CAAC,GAAqB;CAC7F,MAAM,aAA+B,YAAY,SAAS,SACxD,KAAK,SAAS,KAAK,CAAC,CAAC,KAAK,SAAoB;EAC5C,UAAU,KAAK;EACf,MAAM,KAAK;EACX,MAAM,IAAI;EACV,SAAS,IAAI;EACb,KAAK,IAAI;CACX,EAAE,CACJ;CACA,MAAM,WAAW,QAAQ;CACzB,IAAI,aAAa,KAAA,KAAa,SAAS,SAAS,GAC9C,WAAW,KAAK,GAAG,cAAc,OAAO,QAAQ,CAAC;CAEnD,IAAI,QAAQ,cAAc,KAAA,GACxB,WAAW,KAAK,GAAG,eAAe,OAAO,QAAQ,WAAW,QAAQ,GAAG,CAAC;CAE1E,OAAO;AACT;;;;;;AAOA,SAAgB,eACd,OACA,QACA,KACkB;CAClB,OAAO,gBAAgB,OAAO,QAAQ,GAAG,CAAC,CAAC,MAAM,KAAK,WAAW;EAC/D,UAAU;EACV,MAAM;EACN,MAAM,MAAM;EACZ,SAAS,gBAAgB,MAAM,aAAa,MAAM,GAAG,EAAE,EAAE,IAAI,MAAM,QAAQ,mBAAmB,OAAO,WAAW;EAChH,KAAK;CACP,EAAE;AACJ;;AAGA,MAAa,gBAAgB,SAAyB;CAEpD,MAAM,SADU,KAAK,QAAQ,qBAAqB,MAC7B,CAAC,CACnB,QAAQ,SAAS,IAAQ,CAAC,CAC1B,QAAQ,OAAO,OAAO,CAAC,CACvB,QAAQ,OAAO,MAAM,CAAC,CACtB,QAAQ,WAAW,IAAI;CAC1B,OAAO,IAAI,OAAO,IAAI,OAAO,EAAE;AACjC;;;;;;;AAoBA,MAAM,sBACJ,SACA,UACqB;CACrB,MAAM,aAA+B,CAAC;CACtC,KAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,UAAU,aAAa,KAAK,IAAI;EACtC,MAAM,UAAU,QAAQ,MAAM,QAAQ,SAAS,QAAQ,KAAK,IAAI,CAAC;EACjE,MAAM,WAAW,QAAQ,cAAc,QAAQ,SAAS,QAAQ,KAAK,IAAI,CAAC;EAE1E,IAAI,SAAS,WAAW,GAAG;GACzB,WAAW,KAAK;IACd,UAAU;IACV,MAAM;IACN,SACE,QAAQ,WAAW,IACf,kBAAkB,KAAK,KAAK,mCAC5B,kBAAkB,KAAK,KAAK;IAClC,KAAK;GACP,CAAC;GACD;EACF;EAEA,KAAK,MAAM,QAAQ,UAAU;GAC3B,MAAM,UAAU,QAAQ,QAAQ,IAAI;GACpC,IAAI,WAAW,KAAK,YAAY;GAChC,WAAW,KAAK;IACd,UAAU;IACV,MAAM;IACN;IACA,SAAS,IAAI,KAAK,QAAQ,QAAQ,2DAA2D,KAAK,WAAW;IAC7G,KAAK,OAAO,KAAK,aAAa,QAAQ,mCAAmC,KAAK;GAChF,CAAC;EACH;CACF;CACA,OAAO;AACT;;AAGA,MAAM,mBAAmB,UACvB,CAAC,GAAG,MAAM,MAAM,OAAO,CAAC,CAAC,CAAC,OAAO,iBAAiB,CAAC,CAAC,KAAK,SAAS,KAAK,IAAI;;;;;AAM7E,SAAgB,cACd,OACA,OACkB;CAClB,OAAO,mBACL;EACE,OAAO,CAAC,GAAG,MAAM,MAAM,KAAK,CAAC;EAC7B,eAAe,gBAAgB,KAAK;EACpC,UAAU,SACR,MAAM,MAAM,QAAQ,SAAS,KAAK,SAAS,aAAa,KAAK,OAAO,IAAI,CAAC,CAAC;CAC9E,GACA,KACF;AACF;;;;;;;;;;;;AAaA,SAAgB,sBACd,OACA,eACA,OACkB;CAClB,MAAM,0BAAU,IAAI,IAAoB;CACxC,KAAK,MAAM,QAAQ,eAAe;EAChC,IAAI,KAAK,WAAW,QAAQ;EAC5B,QAAQ,IAAI,KAAK,KAAK,QAAQ,IAAI,KAAK,EAAE,KAAK,KAAK,CAAC;CACtD;CACA,OAAO,mBACL;EACE,OAAO,CAAC,GAAG,MAAM,MAAM,KAAK,CAAC;EAC7B,eAAe,gBAAgB,KAAK;EACpC,UAAU,SAAS,QAAQ,IAAI,IAAI,KAAK;CAC1C,GACA,KACF;AACF;;AAGA,MAAa,2BAA2B,eACtC,WAAW,MAAM,cAAc,UAAU,aAAa,YAAY"}

package/dist/claims-Bch7Lxlo.d.ts

@@ -0,0 +1,92 @@
+import { o as Facts, p as PageDocument, t as PageHead } from "./page-heads-BfjWQvau.js";
+import "effect/Effect";
+import * as Schema from "effect/Schema";
+import { DecisionModel } from "effect/ai";
+import "effect/ai/AiError";
+import * as Decision from "effect/ai/Decision";
+//#region src/decide/cache.d.ts
+declare const DecisionCacheInvalid_base: new <A extends Record<string, any> = {}>(args: import("effect/Types").VoidIfEmpty<{ readonly [P in keyof A as P extends "_tag" ? never : P]: A[P]; }>) => import("effect/Cause").YieldableError & {
+  readonly _tag: "DecisionCacheInvalid";
+} & Readonly<A>;
+/** A committed answer that exists but cannot be trusted. */
+declare class DecisionCacheInvalid extends DecisionCacheInvalid_base<{
+  readonly file: string;
+  readonly message: string;
+}> {}
+//#endregion
+//#region src/decide/run.d.ts
+/**
+ * One decision family. `answers` in `evaluate` is erased because each family
+ * reads its own `Decision.Answers` shape; the family is the only place that
+ * shape is known, and a `DecisionModel` validates it before it arrives.
+ */
+interface DecisionFamily<Input> {
+  readonly name: string;
+  readonly input: Schema.ConstraintDecoder<Input>;
+  /** Build the definition for one input; dynamic-label families build per input. */
+  readonly definitionFor: (input: Input) => Decision.Definition<any, any>;
+  /** Stable human reference for the input in a report. */
+  readonly inputRef: (input: Input) => string;
+  /** Map validated answers to a verdict; `"review"` means a human decides. */
+  readonly evaluate: (input: Input, answers: any, threshold: number) => string;
+  /**
+   * Optional input-level guard for constraints a schema cannot express, such as
+   * "dynamic-label families need at least two candidates". Returns a message to
+   * fail the run, or `undefined` when the input is usable.
+   */
+  readonly validate?: (input: Input) => string | undefined;
+}
+declare const DecisionCacheMiss_base: new <A extends Record<string, any> = {}>(args: import("effect/Types").VoidIfEmpty<{ readonly [P in keyof A as P extends "_tag" ? never : P]: A[P]; }>) => import("effect/Cause").YieldableError & {
+  readonly _tag: "DecisionCacheMiss";
+} & Readonly<A>;
+/** Replay found no committed answer for an input. */
+declare class DecisionCacheMiss extends DecisionCacheMiss_base<{
+  readonly family: string;
+  readonly inputRef: string;
+  readonly key: string;
+  readonly message: string;
+}> {}
+//#endregion
+//#region src/decide/families/claims.d.ts
+/** Authored prose, code-owned facts, and evidence supplied to adopter rules. */
+declare const claimsInput: Schema.Struct<{
+  readonly path: Schema.String;
+  readonly evidence: Schema.optionalKey<Schema.String>;
+  readonly section: Schema.Struct<{
+    readonly id: Schema.String;
+    readonly kind: Schema.String;
+    readonly markdown: Schema.String;
+    readonly messages: Schema.$Array<Schema.Struct<{
+      readonly hash: Schema.String;
+      readonly text: Schema.String;
+      readonly facts: Schema.$Array<Schema.String>;
+    }>>;
+  }>;
+  readonly facts: Schema.$Record<Schema.String, Schema.Struct<{
+    readonly kind: Schema.Literals<readonly ["number", "money", "list", "text"]>;
+    readonly value: Schema.Codec<Schema.Json, Schema.Json, never, never>;
+    readonly text: Schema.String;
+    readonly items: Schema.optionalKey<Schema.$Array<Schema.String>>;
+  }>>;
+  readonly context: Schema.optionalKey<Schema.String>;
+}>;
+type ClaimsInput = typeof claimsInput.Type;
+type ClaimsRules = Decision.Definition<typeof claimsInput, Record<string, Decision.Probability>>;
+interface ClaimsOptions {
+  readonly rules: ClaimsRules;
+  readonly model: string;
+  readonly cutoff?: number;
+  readonly context?: string;
+  /** Exclude metadata by path glob; captured sections remain in the gate. */
+  readonly excludeHeads?: ReadonlyArray<string>;
+}
+type ClaimsVerdict = "pass" | "violation";
+/** Claims use a single upper cutoff; probabilities below it pass without a review band. */
+declare function claimsFamily(rules: ClaimsRules): DecisionFamily<ClaimsInput>;
+/** Heads describe only pages outside capture; duplicate ownership fails before evaluation. */
+declare function resolveClaimsDocuments(documents: ReadonlyArray<PageDocument>, heads: ReadonlyArray<PageHead>, excludeHeads?: ReadonlyArray<string>): ReadonlyArray<PageDocument>;
+/** Source locations do not enter model input or answer identity. */
+declare function claimsInputs(documents: ReadonlyArray<PageDocument>, heads: ReadonlyArray<PageHead>, facts: Facts, options?: Pick<ClaimsOptions, "context" | "excludeHeads">): ReadonlyArray<ClaimsInput>;
+//#endregion
+export { claimsFamily as a, resolveClaimsDocuments as c, DecisionCacheInvalid as d, ClaimsVerdict as i, DecisionCacheMiss as l, ClaimsOptions as n, claimsInput as o, ClaimsRules as r, claimsInputs as s, ClaimsInput as t, DecisionFamily as u };
+//# sourceMappingURL=claims-Bch7Lxlo.d.ts.map