pagegraph 0.11.0 → 0.13.0

package/dist/index.js

@@ -1,139 +1,32 @@
-import { c as contentSignal, d as lastModified, f as renderRobots, i as checkRenderedCoverage, l as inspectNode, n as checkFreshness, o as hasStructuralViolations, p as renderSitemap, r as checkGraph, s as freshnessReport, t as checkCoverage, u as isSitemapEligible } from "./checks-nk8ZRRIA.js";
-import { a as RENDERED_EDGE_ARTIFACT_SCHEMA_VERSION, c as diffLinkGraph, d as renderedGraphFromEdges, f as hasBlockingIssues, i as renderedCheckTargets, l as extractAnchors, n as checkRenderedContent, o as buildRenderedGraph, p as inspectHtml, r as extractPageContent, s as decodeRenderedEdgeArtifact, t as checkPageContent, u as normalizePath } from "./content-CB_kHmJ3.js";
-//#region src/core/graph.ts
-/** Kind for instances whose collection route carries no declaration to inherit. */
-const FALLBACK_KIND = "page";
-/**
-* Join a child's local path onto its parent's computed full path with the same
-* semantics as TanStack's route init (relative segments, index "/" inherits the
-* parent, pathless/group routes are transparent), then normalize trailing slashes.
-*/
-function joinPath(parent, seg) {
-	if (seg === void 0) return parent;
-	if (seg === "/") return parent;
-	const trimmed = seg.replace(/^\/+/, "").replace(/\/+$/, "");
-	return `${parent === "/" ? "" : parent}/${trimmed}`.replace(/\/{2,}/g, "/");
-}
-/** Merge a route's declaration into an existing same-path node (deeper route wins). */
-function mergeSeo(base, override) {
+import { t as applyTitleTemplate } from "./declare-D5o7hwmv.js";
+import { t as buildSeoGraph } from "./graph-DMNOLXLu.js";
+import { n as graphToJson, t as graphFromJson } from "./wire-B4RQMc4e.js";
+import { i as lastModified, n as inspectNode, o as renderRobots, r as isSitemapEligible, s as renderSitemap, t as contentSignal } from "./projections-D0oOFKiY.js";
+import { i as checkRenderedCoverage, n as checkFreshness, o as hasStructuralViolations, r as checkGraph, s as freshnessReport, t as checkCoverage } from "./checks-BS-aDXB_.js";
+import { a as RENDERED_EDGE_ARTIFACT_SCHEMA_VERSION, c as diffLinkGraph, d as renderedGraphFromEdges, f as hasBlockingIssues, i as renderedCheckTargets, l as extractAnchors, n as checkRenderedContent, o as buildRenderedGraph, p as inspectHtml, r as extractPageContent, s as decodeRenderedEdgeArtifact, t as checkPageContent, u as normalizePath } from "./content-CHd0X4s6.js";
+import { n as selectPageHeadNodes, t as pageHeads } from "./page-heads-BgbaIjj9.js";
+import { o as hashDocument, s as contentHash } from "./inline-BbS93GAT.js";
+import { i as resolveFact, n as defineFacts, r as fact } from "./facts-1OKclPOk.js";
+import { n as documentMarkdown, r as sectionMarkdown, t as defineSectionKind } from "./markdown-C6dRE9zD.js";
+import { n as llmsSection, t as llmsMarkdown } from "./llms-Dhr_5u2O.js";
+//#region src/core/collections.ts
+function contentCollection(options) {
+	const entries = options.pages.map((page) => {
+		const entry = options.entry(page);
+		return {
+			...entry,
+			path: entry.path ?? page.url
+		};
+	});
 	return {
-		kind: override.kind,
-		crumb: override.crumb ?? base.crumb,
-		sitemap: override.sitemap ?? base.sitemap,
-		robots: override.robots ?? base.robots,
-		related: override.related ?? base.related,
-		link: override.link ?? base.link,
-		redirectTo: override.redirectTo ?? base.redirectTo,
-		modifiedAt: override.modifiedAt ?? base.modifiedAt
-	};
-}
-/**
-* Walk the route tree building structural nodes and crumb-parent edges. `crumbStack`
-* holds the paths of crumb-declaring ancestors so each crumb node links to its nearest
-* crumb ancestor down the real route-parent chain (matching render-time breadcrumbs).
-*/
-function walkRoutes(route, parentPath, isRoot, nodes, edges, crumbStack) {
-	const path = isRoot ? "/" : joinPath(parentPath, route.options.path);
-	const seo = route.options.staticData?.seo;
-	if (seo) {
-		const existing = nodes.get(path);
-		if (existing) {
-			existing.policy = mergeSeo(existing.policy, seo);
-			existing.kind = existing.policy.kind;
-		} else nodes.set(path, {
-			path,
-			kind: seo.kind,
-			source: "route",
-			policy: { ...seo }
-		});
-		const nearestCrumbAncestor = crumbStack[crumbStack.length - 1];
-		if (seo.crumb !== void 0 && nearestCrumbAncestor !== void 0) edges.push({
-			from: path,
-			to: nearestCrumbAncestor,
-			type: "crumb-parent"
-		});
-	}
-	const pushedCrumb = seo?.crumb !== void 0;
-	if (pushedCrumb) crumbStack.push(path);
-	for (const child of route.children ?? []) walkRoutes(child, path, false, nodes, edges, crumbStack);
-	if (pushedCrumb) crumbStack.pop();
-}
-/**
-* Add one collection's instance nodes, inheriting kind + sitemap policy from the
-* collection route's declaration, then append the edges it declares. A path already
-* owned by another node is a collision: the first owner keeps the path and the
-* conflict is reported (the `path-owner-collision` check turns it into a violation).
-*/
-function addCollection(nodes, edges, collisions, collection) {
-	const collectionNode = nodes.get(collection.route);
-	const kind = collectionNode?.kind ?? FALLBACK_KIND;
-	const sitemap = collectionNode?.policy.sitemap;
-	/**
-	* Paths this collection lost to an earlier owner. Their instances never enter
-	* the graph, so any edge declared out of them would dangle — and the dead-edge
-	* check only validates an edge's `to`, so nothing downstream would catch it.
-	*/
-	const rejected = /* @__PURE__ */ new Set();
-	for (const instance of collection.instances) {
-		const existing = nodes.get(instance.path);
-		if (existing) {
-			collisions.push({
-				path: instance.path,
-				sources: [existing.source, collection.source]
-			});
-			rejected.add(instance.path);
-			continue;
-		}
-		nodes.set(instance.path, {
-			path: instance.path,
-			kind,
-			source: collection.source,
-			policy: {
-				kind,
-				sitemap
-			},
-			instance: {
-				title: instance.title,
-				description: instance.description,
-				publishedAt: instance.publishedAt,
-				modifiedAt: instance.modifiedAt
-			}
-		});
-	}
-	for (const edge of collection.edges ?? []) {
-		if (rejected.has(edge.from)) continue;
-		edges.push(edge);
-	}
-}
-/**
-* Build the SEO graph from route declarations and content collections.
-*
-* Synchronous: the caller materializes its collections before calling, so there is
-* no async work here. Callers own the origin.
-*/
-function buildSeoGraph(input) {
-	const nodes = /* @__PURE__ */ new Map();
-	const edges = [];
-	const collisions = [];
-	walkRoutes(input.routeTree, "/", true, nodes, edges, []);
-	for (const collection of input.collections ?? []) addCollection(nodes, edges, collisions, collection);
-	for (const node of nodes.values()) {
-		if (node.source !== "route") continue;
-		for (const to of node.policy.related ?? []) edges.push({
-			from: node.path,
+		route: options.route,
+		source: options.source,
+		instances: entries.map(({ related: _related, ...instance }) => instance),
+		edges: [...entries.flatMap((entry) => [...new Set(entry.related ?? [])].map((to) => ({
+			from: entry.path,
 			to,
 			type: "related"
-		});
-		if (node.policy.redirectTo !== void 0) edges.push({
-			from: node.path,
-			to: node.policy.redirectTo,
-			type: "redirect"
-		});
-	}
-	return {
-		nodes,
-		edges,
-		collisions
+		}))), ...options.edges ?? []]
 	};
 }
 //#endregion
@@ -282,6 +175,34 @@ function resolveRouteLink(router, path) {
 	return Object.values(routesById).find((route) => route.fullPath === path)?.options.staticData?.seo?.link;
 }
 //#endregion
-export { RENDERED_EDGE_ARTIFACT_SCHEMA_VERSION, buildRenderedGraph, buildSeoGraph, candidateSourceText, checkCoverage, checkFreshness, checkGraph, checkPageContent, checkRenderedContent, checkRenderedCoverage, contentSignal, decodeRenderedEdgeArtifact, decodeRenderedEdges, diffLinkGraph, extractAnchors, extractPageContent, freshnessReport, generateLinkCandidates, hasBlockingIssues, hasStructuralViolations, inspectHtml, inspectNode, isSitemapEligible, lastModified, matchesClusterFilter, normalizePath, renderRobots, renderSitemap, renderedCheckTargets, renderedGraphFromEdges, resolveRouteLink, undirectedEdgeKey };
+//#region src/markdown/lock.ts
+const compare = (left, right) => left < right ? -1 : left > right ? 1 : 0;
+/** Build the v1 lock without changing document hashes, message hashes, or sources. */
+function createMarkdownLock(documents) {
+	const pages = Object.create(null);
+	for (const document of [...documents].sort((left, right) => compare(left.path, right.path))) {
+		if (Object.hasOwn(pages, document.path)) throw new Error(`Duplicate document page path "${document.path}"`);
+		if (!/^[0-9a-f]{64}$/.test(document.hash)) throw new Error(`Invalid document document hash "${document.hash}" on "${document.path}"`);
+		const messages = Object.create(null);
+		for (const message of [...document.messages].sort((left, right) => compare(left.hash, right.hash) || compare(left.source, right.source))) {
+			if (!/^[0-9a-f]{16}$/.test(message.hash)) throw new Error(`Invalid document message hash "${message.hash}" on "${document.path}"`);
+			if (!Object.hasOwn(messages, message.hash)) messages[message.hash] = message.source;
+		}
+		pages[document.path] = {
+			document: document.hash,
+			messages
+		};
+	}
+	for (const [path, page] of Object.entries(pages)) {
+		if (typeof page.document !== "string") throw new Error(`Expected string\n  at ["pages"][${JSON.stringify(path)}]["document"]`);
+		for (const [hash, source] of Object.entries(page.messages)) if (typeof source !== "string") throw new Error(`Expected string\n  at ["pages"][${JSON.stringify(path)}]["messages"][${JSON.stringify(hash)}]`);
+	}
+	return {
+		version: 1,
+		pages
+	};
+}
+//#endregion
+export { RENDERED_EDGE_ARTIFACT_SCHEMA_VERSION, applyTitleTemplate, buildRenderedGraph, buildSeoGraph, candidateSourceText, checkCoverage, checkFreshness, checkGraph, checkPageContent, checkRenderedContent, checkRenderedCoverage, contentCollection, contentHash, contentSignal, createMarkdownLock, decodeRenderedEdgeArtifact, decodeRenderedEdges, defineFacts, defineSectionKind, diffLinkGraph, documentMarkdown, extractAnchors, extractPageContent, fact, freshnessReport, generateLinkCandidates, graphFromJson, graphToJson, hasBlockingIssues, hasStructuralViolations, hashDocument, inspectHtml, inspectNode, isSitemapEligible, lastModified, llmsMarkdown, llmsSection, matchesClusterFilter, normalizePath, pageHeads, renderRobots, renderSitemap, renderedCheckTargets, renderedGraphFromEdges, resolveFact, resolveRouteLink, sectionMarkdown, selectPageHeadNodes, undirectedEdgeKey };
 
 //# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","names":[],"sources":["../src/core/graph.ts","../src/core/link-candidates.ts","../src/core/resolve-route-link.ts"],"sourcesContent":["/**\n * SEO graph — the derived model that projections (sitemap, robots), the CLI, and\n * the check engine all read from. Built from route declarations (`staticData.seo`)\n * plus consumer-supplied content collections. This module is pure: no React, no\n * env, no knowledge of where instances come from. Origins and env-derived values\n * are injected by the callers of the projections, never read here.\n *\n * A node is one of:\n *  - a structural route (`source: \"route\"`), keyed by its normalized full path,\n *    merging a layout route's declaration (crumb) with its index child's (kind,\n *    sitemap policy) when both resolve to the same URL;\n *  - a content instance (`source` = the collection's label), keyed by the page URL\n *    and carrying page-level metadata.\n *\n * Edges: `crumb-parent` (breadcrumb ancestry), `related` (deliberate cross-links),\n * `collection-member` (membership in a curated set), and `redirect` (route aliases).\n * The route walk emits crumb/related/redirect edges from declarations; a collection\n * may declare any additional edges its instances need.\n */\n\nimport type { AnyRoute } from \"@tanstack/react-router\";\n\nimport type { PublicPath, RouteSeo, SeoKind } from \"./declare\";\n\n/**\n * Where a node came from: `\"route\"` for a structural route declaration, or the\n * `source` label of the collection that produced the instance (e.g. \"blog\").\n */\nexport type SeoSource = string;\n\nexport interface SeoNode {\n  /** Canonical path, no origin (e.g. \"/pricing\", \"/blog/my-post\"). */\n  path: string;\n  kind: SeoKind;\n  source: SeoSource;\n  /** Route-declared policy, or synthesized (kind + inherited sitemap) for instances. */\n  policy: RouteSeo;\n  instance?:\n    | {\n        title: string;\n        description?: string | undefined;\n        publishedAt?: string | undefined;\n        modifiedAt?: string | undefined;\n      }\n    | undefined;\n}\n\nexport type SeoEdgeType = \"crumb-parent\" | \"related\" | \"redirect\" | \"collection-member\";\n\nexport interface SeoEdge {\n  from: string;\n  to: string;\n  type: SeoEdgeType;\n}\n\nexport interface SeoGraph {\n  nodes: Map<string, SeoNode>;\n  edges: Array<SeoEdge>;\n  /** Exact-path ownership conflicts encountered while assembling graph sources. */\n  collisions?: ReadonlyArray<{ path: string; sources: ReadonlyArray<SeoSource> }> | undefined;\n}\n\n/** One concrete page produced by a collection. */\nexport interface SeoInstance {\n  /** Canonical path of the page (e.g. \"/blog/my-post\"). */\n  readonly path: string;\n  readonly title: string;\n  readonly description?: string | undefined;\n  readonly publishedAt?: string | undefined;\n  readonly modifiedAt?: string | undefined;\n}\n\nexport interface SeoCollection {\n  /**\n   * The param route these instances render through (e.g. \"/blog/$slug\"). Instances\n   * inherit this route's declared policy (kind + sitemap) — the graph reads it from\n   * the structural node, so declarations stay the single source of truth.\n   */\n  readonly route: PublicPath;\n  /** The `source` stamped on every node this collection produces (e.g. \"blog\"). */\n  readonly source: SeoSource;\n  readonly instances: ReadonlyArray<SeoInstance>;\n  /** Edges the collection declares between its instances and the rest of the graph. */\n  readonly edges?: ReadonlyArray<SeoEdge> | undefined;\n}\n\nexport interface BuildSeoGraphInput {\n  readonly routeTree: AnyRoute;\n  readonly collections?: ReadonlyArray<SeoCollection> | undefined;\n}\n\n/** Kind for instances whose collection route carries no declaration to inherit. */\nconst FALLBACK_KIND: SeoKind = \"page\";\n\n/** Structural view of a route we walk — the fields present before router init(). */\ninterface WalkableRoute {\n  readonly options: {\n    readonly path?: string | undefined;\n    readonly staticData?: { readonly seo?: RouteSeo | undefined } | undefined;\n  };\n  readonly children?: ReadonlyArray<WalkableRoute> | undefined;\n}\n\n/**\n * Join a child's local path onto its parent's computed full path with the same\n * semantics as TanStack's route init (relative segments, index \"/\" inherits the\n * parent, pathless/group routes are transparent), then normalize trailing slashes.\n */\nfunction joinPath(parent: string, seg: string | undefined): string {\n  if (seg === undefined) return parent; // pathless layout / route group\n  if (seg === \"/\") return parent; // index route resolves to its parent's URL\n  const trimmed = seg.replace(/^\\/+/, \"\").replace(/\\/+$/, \"\");\n  const joined = `${parent === \"/\" ? \"\" : parent}/${trimmed}`;\n  return joined.replace(/\\/{2,}/g, \"/\");\n}\n\n/** Merge a route's declaration into an existing same-path node (deeper route wins). */\nfunction mergeSeo(base: RouteSeo, override: RouteSeo): RouteSeo {\n  return {\n    kind: override.kind,\n    crumb: override.crumb ?? base.crumb,\n    sitemap: override.sitemap ?? base.sitemap,\n    robots: override.robots ?? base.robots,\n    related: override.related ?? base.related,\n    link: override.link ?? base.link,\n    redirectTo: override.redirectTo ?? base.redirectTo,\n    modifiedAt: override.modifiedAt ?? base.modifiedAt,\n  };\n}\n\n/**\n * Walk the route tree building structural nodes and crumb-parent edges. `crumbStack`\n * holds the paths of crumb-declaring ancestors so each crumb node links to its nearest\n * crumb ancestor down the real route-parent chain (matching render-time breadcrumbs).\n */\nfunction walkRoutes(\n  route: WalkableRoute,\n  parentPath: string,\n  isRoot: boolean,\n  nodes: Map<string, SeoNode>,\n  edges: Array<SeoEdge>,\n  crumbStack: Array<string>,\n): void {\n  const path = isRoot ? \"/\" : joinPath(parentPath, route.options.path);\n  const seo = route.options.staticData?.seo;\n\n  if (seo) {\n    const existing = nodes.get(path);\n    if (existing) {\n      existing.policy = mergeSeo(existing.policy, seo);\n      existing.kind = existing.policy.kind;\n    } else {\n      nodes.set(path, { path, kind: seo.kind, source: \"route\", policy: { ...seo } });\n    }\n\n    const nearestCrumbAncestor = crumbStack[crumbStack.length - 1];\n    if (seo.crumb !== undefined && nearestCrumbAncestor !== undefined) {\n      edges.push({ from: path, to: nearestCrumbAncestor, type: \"crumb-parent\" });\n    }\n  }\n\n  const pushedCrumb = seo?.crumb !== undefined;\n  if (pushedCrumb) crumbStack.push(path);\n  for (const child of route.children ?? []) {\n    walkRoutes(child, path, false, nodes, edges, crumbStack);\n  }\n  if (pushedCrumb) crumbStack.pop();\n}\n\n/**\n * Add one collection's instance nodes, inheriting kind + sitemap policy from the\n * collection route's declaration, then append the edges it declares. A path already\n * owned by another node is a collision: the first owner keeps the path and the\n * conflict is reported (the `path-owner-collision` check turns it into a violation).\n */\nfunction addCollection(\n  nodes: Map<string, SeoNode>,\n  edges: Array<SeoEdge>,\n  collisions: Array<{ path: string; sources: ReadonlyArray<SeoSource> }>,\n  collection: SeoCollection,\n): void {\n  const collectionNode = nodes.get(collection.route);\n  const kind = collectionNode?.kind ?? FALLBACK_KIND;\n  const sitemap = collectionNode?.policy.sitemap;\n\n  /**\n   * Paths this collection lost to an earlier owner. Their instances never enter\n   * the graph, so any edge declared out of them would dangle — and the dead-edge\n   * check only validates an edge's `to`, so nothing downstream would catch it.\n   */\n  const rejected = new Set<string>();\n\n  for (const instance of collection.instances) {\n    const existing = nodes.get(instance.path);\n    if (existing) {\n      collisions.push({ path: instance.path, sources: [existing.source, collection.source] });\n      rejected.add(instance.path);\n      continue;\n    }\n    nodes.set(instance.path, {\n      path: instance.path,\n      kind,\n      source: collection.source,\n      policy: { kind, sitemap },\n      instance: {\n        title: instance.title,\n        description: instance.description,\n        publishedAt: instance.publishedAt,\n        modifiedAt: instance.modifiedAt,\n      },\n    });\n  }\n\n  for (const edge of collection.edges ?? []) {\n    if (rejected.has(edge.from)) continue;\n    edges.push(edge);\n  }\n}\n\n/**\n * Build the SEO graph from route declarations and content collections.\n *\n * Synchronous: the caller materializes its collections before calling, so there is\n * no async work here. Callers own the origin.\n */\nexport function buildSeoGraph(input: BuildSeoGraphInput): SeoGraph {\n  const nodes = new Map<string, SeoNode>();\n  const edges: Array<SeoEdge> = [];\n  const collisions: Array<{ path: string; sources: ReadonlyArray<SeoSource> }> = [];\n\n  walkRoutes(input.routeTree as unknown as WalkableRoute, \"/\", true, nodes, edges, []);\n\n  for (const collection of input.collections ?? []) {\n    addCollection(nodes, edges, collisions, collection);\n  }\n\n  for (const node of nodes.values()) {\n    if (node.source !== \"route\") continue;\n    for (const to of node.policy.related ?? []) {\n      edges.push({ from: node.path, to, type: \"related\" });\n    }\n    if (node.policy.redirectTo !== undefined) {\n      edges.push({ from: node.path, to: node.policy.redirectTo, type: \"redirect\" });\n    }\n  }\n\n  return { nodes, edges, collisions };\n}\n","/**\n * Pure candidate generation for contextual cross-links.\n *\n * Given the declared graph, enumerate `(source, destination)` pairs that are\n * *plausible* contextual links and *not already connected*. A pair is plausible\n * when the two pages sit in the same cluster: a shared top-level section (e.g.\n * `/blog/a` and `/blog/b` under `/blog`) or, for root-level pages that share no\n * section, the same `kind`. Only sitemap-eligible pages are candidates — a\n * noindex, redirect, or param template is not a link surface.\n *\n * The plan is a proposal, never an application: nothing here writes a\n * declaration. Effect- and framework-free so it runs in the CLI, a Worker, or a\n * test on the same graph.\n */\n\nimport type { SeoGraph, SeoNode } from \"./graph\";\nimport type { AnchorRegion, SimpleEdge } from \"./links\";\nimport { isSitemapEligible } from \"./projections\";\n\n/** One proposed contextual link, in the direction the link would be authored. */\nexport interface LinkCandidatePair {\n  readonly source: string;\n  readonly destination: string;\n  /** The cluster the pair shares: a top-level section, or `kind:<kind>`. */\n  readonly cluster: string;\n  /** Why the pair is plausible, e.g. `same top-level section \"/blog\"`. */\n  readonly reason: string;\n}\n\nexport interface LinkCandidateOptions {\n  /** Maximum candidates to return after ordering (default 50). */\n  readonly limit?: number;\n  /** Restrict to these clusters; a filter may be a section or a bare kind. */\n  readonly clusters?: ReadonlyArray<string>;\n  /** Anchors already served in HTML. Only body-region edges exclude their own direction. */\n  readonly renderedEdges?: ReadonlyArray<SimpleEdge & { readonly region?: AnchorRegion }>;\n}\n\n/** One cluster and how many candidate pairs it contributes (before `limit`). */\nexport interface LinkClusterSummary {\n  readonly key: string;\n  readonly candidates: number;\n}\n\nexport interface LinkCandidateResult {\n  readonly candidates: ReadonlyArray<LinkCandidatePair>;\n  /** Candidate pairs before `limit` was applied (after cluster filters). */\n  readonly total: number;\n  readonly truncated: boolean;\n  readonly clusters: ReadonlyArray<LinkClusterSummary>;\n}\n\n/**\n * Canonical path key: query and hash stripped, trailing slashes removed, \"/\"\n * preserved. This is the same path key the graph and the rendered-link core\n * use, so a served anchor like `/blog/a?ref=nav` still matches the graph pair\n * `/blog/a`.\n */\nconst normalize = (path: string): string => {\n  const pathname = path.split(/[?#]/, 1)[0] ?? \"\";\n  const trimmed = pathname.replace(/\\/+$/, \"\");\n  return trimmed === \"\" ? \"/\" : trimmed;\n};\n\n/** Directionless pair key, so an edge in either direction means \"connected\". */\nexport const undirectedEdgeKey = (from: string, to: string): string => {\n  const [a, b] = [normalize(from), normalize(to)].sort();\n  return `${a}\\u0000${b}`;\n};\n\nconst directedEdgeKey = (from: string, to: string): string => `${normalize(from)}\\u0000${normalize(to)}`;\n\n/** First path segment, or undefined for the root page. */\nconst topSegment = (path: string): string | undefined => {\n  const segment = path.split(\"/\").filter(Boolean)[0];\n  return segment === undefined || segment === \"\" ? undefined : segment;\n};\n\n/** A page with no nested segment (`/`, `/pricing`, `/blog`) is root-level. */\nconst isRootLevel = (path: string): boolean => path.split(\"/\").filter(Boolean).length <= 1;\n\n/**\n * The cluster a pair shares, or undefined when they share none. Section-first:\n * a shared top-level section wins. The kind fallback is local to root-level\n * pages, so it never pairs two nested pages from different sections.\n */\nexport const candidateClusterOf = (a: SeoNode, b: SeoNode): { key: string; reason: string } | undefined => {\n  const aSegment = topSegment(a.path);\n  const bSegment = topSegment(b.path);\n  if (aSegment !== undefined && aSegment === bSegment) {\n    return { key: aSegment, reason: `same top-level section \"/${aSegment}\"` };\n  }\n  if (isRootLevel(a.path) && isRootLevel(b.path) && a.kind === b.kind) {\n    return { key: `kind:${a.kind}`, reason: `same kind \"${a.kind}\"` };\n  }\n  return undefined;\n};\n\n/** A `--cluster` filter matches a section by name, or a kind via its bare label. */\nexport const matchesClusterFilter = (cluster: string, filter: string): boolean => {\n  const normalized = filter.replace(/^\\/+/, \"\").toLowerCase();\n  const key = cluster.toLowerCase();\n  return key === normalized || key === `kind:${normalized}`;\n};\n\n/** Human reason string for a candidate's source page, used when handing a plan to Jev. */\nexport const candidateSourceText = (node: SeoNode): string =>\n  node.instance?.description?.trim() ||\n  node.instance?.title?.trim() ||\n  node.policy.link?.description?.trim() ||\n  node.policy.link?.title?.trim() ||\n  node.path;\n\n/**\n * Enumerate reviewable contextual-link candidates from the declared graph.\n *\n * Excluded: self-pairs, pages that are not sitemap-eligible, pairs already\n * declared as a `related` edge, and — when {@link LinkCandidateOptions.renderedEdges}\n * is supplied — pairs already rendered as an anchor. Queries, hashes, and\n * trailing slashes are normalized so both sides compare by the graph's path key.\n */\nexport const generateLinkCandidates = (\n  graph: SeoGraph,\n  options: LinkCandidateOptions = {},\n): LinkCandidateResult => {\n  const limit = options.limit ?? 50;\n  const filters = options.clusters ?? [];\n  // Legacy bare edges have no region. Treat them as body links so a v1 edge dump\n  // remains conservative; region-aware artifacts retain nav/header/footer edges.\n  const rendered = new Set(\n    (options.renderedEdges ?? []).filter((edge) => edge.region === undefined || edge.region === \"body\")\n      .map((edge) => directedEdgeKey(edge.from, edge.to)),\n  );\n  const declared = new Set(\n    graph.edges\n      .filter((edge) => edge.type === \"related\")\n      .map((edge) => directedEdgeKey(edge.from, edge.to)),\n  );\n\n  const eligible = [...graph.nodes.values()].filter(isSitemapEligible);\n\n  const all: Array<LinkCandidatePair> = [];\n  for (let i = 0; i < eligible.length; i++) {\n    for (let j = i + 1; j < eligible.length; j++) {\n      const a = eligible[i]!;\n      const b = eligible[j]!;\n      const cluster = candidateClusterOf(a, b);\n      if (cluster === undefined) continue;\n      if (filters.length > 0 && !filters.some((filter) => matchesClusterFilter(cluster.key, filter))) {\n        continue;\n      }\n      for (const [source, destination] of [[a.path, b.path], [b.path, a.path]]) {\n        const key = directedEdgeKey(source!, destination!);\n        if (declared.has(key) || rendered.has(key)) continue;\n        all.push({ source: source!, destination: destination!, cluster: cluster.key, reason: cluster.reason });\n      }\n    }\n  }\n\n  const compare = (x: LinkCandidatePair, y: LinkCandidatePair): number =>\n    x.cluster < y.cluster\n      ? -1\n      : x.cluster > y.cluster\n        ? 1\n        : x.source < y.source\n          ? -1\n          : x.source > y.source\n            ? 1\n            : x.destination < y.destination\n              ? -1\n              : x.destination > y.destination\n                ? 1\n                : 0;\n  all.sort(compare);\n\n  const counts = new Map<string, number>();\n  for (const pair of all) counts.set(pair.cluster, (counts.get(pair.cluster) ?? 0) + 1);\n\n  const candidates = all.slice(0, limit);\n  return {\n    candidates,\n    total: all.length,\n    truncated: all.length > candidates.length,\n    clusters: [...counts.entries()].map(([key, count]) => ({ key, candidates: count })),\n  };\n};\n\n/**\n * Decode a rendered-edge dump supplied to the CLI: either a bare array of\n * `{ from, to }` edges, or an object carrying `edges` (or `internalEdges`).\n * Throws on any other shape — this is user input, not a provider payload.\n */\nexport const decodeRenderedEdges = (input: unknown): ReadonlyArray<SimpleEdge & { readonly region?: AnchorRegion }> => {\n  const array =\n    Array.isArray(input)\n      ? input\n      : input !== null && typeof input === \"object\" && Array.isArray((input as { edges?: unknown }).edges)\n        ? (input as { edges: ReadonlyArray<unknown> }).edges\n        : input !== null &&\n            typeof input === \"object\" &&\n            Array.isArray((input as { internalEdges?: unknown }).internalEdges)\n          ? (input as { internalEdges: ReadonlyArray<unknown> }).internalEdges\n          : undefined;\n\n  if (array === undefined) {\n    throw new Error(\n      \"expected an array of { from, to } edges, or an object with an `edges` array\",\n    );\n  }\n\n  return array.map((item) => {\n    if (item === null || typeof item !== \"object\") {\n      throw new Error(\"each rendered edge must be an object with string `from` and `to`\");\n    }\n    const { from, to, region } = item as { from?: unknown; to?: unknown; region?: unknown };\n    if (typeof from !== \"string\" || typeof to !== \"string\") {\n      throw new Error(\"each rendered edge must have string `from` and `to`\");\n    }\n    if (region !== undefined && ![\"nav\", \"header\", \"footer\", \"body\"].includes(region as string)) {\n      throw new Error(\"rendered edge region must be nav, header, footer, or body\");\n    }\n    return region === undefined ? { from, to } : { from, to, region: region as AnchorRegion };\n  });\n};\n","import type { AnyRoute, AnyRouter } from \"@tanstack/react-router\";\n\nimport type { RouteSeo } from \"./declare\";\n\ninterface RouteMaps {\n  routesByPath: Record<string, AnyRoute | undefined>;\n  routesById: Record<string, AnyRoute>;\n}\n\n/**\n * Resolve a route's declared `seo.link` card (title + description) by its full\n * path.\n *\n * `useRouter()` returns a Router typed to this app's exact route tree, so\n * `routesByPath` is keyed by the literal `FileRouteTypes[\"fullPaths\"]` union —\n * but callers here (declared `related` targets) hold arbitrary runtime path\n * strings, not that literal type. `routesByPath` and `routesById` are plain\n * Records on every Router instance regardless of which route tree it's\n * parameterized over, so this narrows to that structural shape once, at this\n * boundary, instead of threading an `AnyRoute` cast through every call site.\n */\nexport function resolveRouteLink(router: AnyRouter, path: string): RouteSeo[\"link\"] {\n  const { routesByPath, routesById } = router as unknown as RouteMaps;\n\n  const direct = routesByPath[path];\n  if (direct) return direct.options.staticData?.seo?.link;\n\n  const byFullPath = Object.values(routesById).find((route) => route.fullPath === path);\n  return byFullPath?.options.staticData?.seo?.link;\n}\n"],"mappings":";;;;AA4FA,MAAM,gBAAyB;;;;;;AAgB/B,SAAS,SAAS,QAAgB,KAAiC;CACjE,IAAI,QAAQ,KAAA,GAAW,OAAO;CAC9B,IAAI,QAAQ,KAAK,OAAO;CACxB,MAAM,UAAU,IAAI,QAAQ,QAAQ,EAAE,CAAC,CAAC,QAAQ,QAAQ,EAAE;CAE1D,OAAO,GADW,WAAW,MAAM,KAAK,OAAO,GAAG,UACpC,QAAQ,WAAW,GAAG;AACtC;;AAGA,SAAS,SAAS,MAAgB,UAA8B;CAC9D,OAAO;EACL,MAAM,SAAS;EACf,OAAO,SAAS,SAAS,KAAK;EAC9B,SAAS,SAAS,WAAW,KAAK;EAClC,QAAQ,SAAS,UAAU,KAAK;EAChC,SAAS,SAAS,WAAW,KAAK;EAClC,MAAM,SAAS,QAAQ,KAAK;EAC5B,YAAY,SAAS,cAAc,KAAK;EACxC,YAAY,SAAS,cAAc,KAAK;CAC1C;AACF;;;;;;AAOA,SAAS,WACP,OACA,YACA,QACA,OACA,OACA,YACM;CACN,MAAM,OAAO,SAAS,MAAM,SAAS,YAAY,MAAM,QAAQ,IAAI;CACnE,MAAM,MAAM,MAAM,QAAQ,YAAY;CAEtC,IAAI,KAAK;EACP,MAAM,WAAW,MAAM,IAAI,IAAI;EAC/B,IAAI,UAAU;GACZ,SAAS,SAAS,SAAS,SAAS,QAAQ,GAAG;GAC/C,SAAS,OAAO,SAAS,OAAO;EAClC,OACE,MAAM,IAAI,MAAM;GAAE;GAAM,MAAM,IAAI;GAAM,QAAQ;GAAS,QAAQ,EAAE,GAAG,IAAI;EAAE,CAAC;EAG/E,MAAM,uBAAuB,WAAW,WAAW,SAAS;EAC5D,IAAI,IAAI,UAAU,KAAA,KAAa,yBAAyB,KAAA,GACtD,MAAM,KAAK;GAAE,MAAM;GAAM,IAAI;GAAsB,MAAM;EAAe,CAAC;CAE7E;CAEA,MAAM,cAAc,KAAK,UAAU,KAAA;CACnC,IAAI,aAAa,WAAW,KAAK,IAAI;CACrC,KAAK,MAAM,SAAS,MAAM,YAAY,CAAC,GACrC,WAAW,OAAO,MAAM,OAAO,OAAO,OAAO,UAAU;CAEzD,IAAI,aAAa,WAAW,IAAI;AAClC;;;;;;;AAQA,SAAS,cACP,OACA,OACA,YACA,YACM;CACN,MAAM,iBAAiB,MAAM,IAAI,WAAW,KAAK;CACjD,MAAM,OAAO,gBAAgB,QAAQ;CACrC,MAAM,UAAU,gBAAgB,OAAO;;;;;;CAOvC,MAAM,2BAAW,IAAI,IAAY;CAEjC,KAAK,MAAM,YAAY,WAAW,WAAW;EAC3C,MAAM,WAAW,MAAM,IAAI,SAAS,IAAI;EACxC,IAAI,UAAU;GACZ,WAAW,KAAK;IAAE,MAAM,SAAS;IAAM,SAAS,CAAC,SAAS,QAAQ,WAAW,MAAM;GAAE,CAAC;GACtF,SAAS,IAAI,SAAS,IAAI;GAC1B;EACF;EACA,MAAM,IAAI,SAAS,MAAM;GACvB,MAAM,SAAS;GACf;GACA,QAAQ,WAAW;GACnB,QAAQ;IAAE;IAAM;GAAQ;GACxB,UAAU;IACR,OAAO,SAAS;IAChB,aAAa,SAAS;IACtB,aAAa,SAAS;IACtB,YAAY,SAAS;GACvB;EACF,CAAC;CACH;CAEA,KAAK,MAAM,QAAQ,WAAW,SAAS,CAAC,GAAG;EACzC,IAAI,SAAS,IAAI,KAAK,IAAI,GAAG;EAC7B,MAAM,KAAK,IAAI;CACjB;AACF;;;;;;;AAQA,SAAgB,cAAc,OAAqC;CACjE,MAAM,wBAAQ,IAAI,IAAqB;CACvC,MAAM,QAAwB,CAAC;CAC/B,MAAM,aAAyE,CAAC;CAEhF,WAAW,MAAM,WAAuC,KAAK,MAAM,OAAO,OAAO,CAAC,CAAC;CAEnF,KAAK,MAAM,cAAc,MAAM,eAAe,CAAC,GAC7C,cAAc,OAAO,OAAO,YAAY,UAAU;CAGpD,KAAK,MAAM,QAAQ,MAAM,OAAO,GAAG;EACjC,IAAI,KAAK,WAAW,SAAS;EAC7B,KAAK,MAAM,MAAM,KAAK,OAAO,WAAW,CAAC,GACvC,MAAM,KAAK;GAAE,MAAM,KAAK;GAAM;GAAI,MAAM;EAAU,CAAC;EAErD,IAAI,KAAK,OAAO,eAAe,KAAA,GAC7B,MAAM,KAAK;GAAE,MAAM,KAAK;GAAM,IAAI,KAAK,OAAO;GAAY,MAAM;EAAW,CAAC;CAEhF;CAEA,OAAO;EAAE;EAAO;EAAO;CAAW;AACpC;;;;;;;;;AC7LA,MAAM,aAAa,SAAyB;CAE1C,MAAM,WADW,KAAK,MAAM,QAAQ,CAAC,CAAC,CAAC,MAAM,GAAA,CACpB,QAAQ,QAAQ,EAAE;CAC3C,OAAO,YAAY,KAAK,MAAM;AAChC;;AAGA,MAAa,qBAAqB,MAAc,OAAuB;CACrE,MAAM,CAAC,GAAG,KAAK,CAAC,UAAU,IAAI,GAAG,UAAU,EAAE,CAAC,CAAC,CAAC,KAAK;CACrD,OAAO,GAAG,EAAE,QAAQ;AACtB;AAEA,MAAM,mBAAmB,MAAc,OAAuB,GAAG,UAAU,IAAI,EAAE,QAAQ,UAAU,EAAE;;AAGrG,MAAM,cAAc,SAAqC;CACvD,MAAM,UAAU,KAAK,MAAM,GAAG,CAAC,CAAC,OAAO,OAAO,CAAC,CAAC;CAChD,OAAO,YAAY,KAAA,KAAa,YAAY,KAAK,KAAA,IAAY;AAC/D;;AAGA,MAAM,eAAe,SAA0B,KAAK,MAAM,GAAG,CAAC,CAAC,OAAO,OAAO,CAAC,CAAC,UAAU;;;;;;AAOzF,MAAa,sBAAsB,GAAY,MAA4D;CACzG,MAAM,WAAW,WAAW,EAAE,IAAI;CAClC,MAAM,WAAW,WAAW,EAAE,IAAI;CAClC,IAAI,aAAa,KAAA,KAAa,aAAa,UACzC,OAAO;EAAE,KAAK;EAAU,QAAQ,4BAA4B,SAAS;CAAG;CAE1E,IAAI,YAAY,EAAE,IAAI,KAAK,YAAY,EAAE,IAAI,KAAK,EAAE,SAAS,EAAE,MAC7D,OAAO;EAAE,KAAK,QAAQ,EAAE;EAAQ,QAAQ,cAAc,EAAE,KAAK;CAAG;AAGpE;;AAGA,MAAa,wBAAwB,SAAiB,WAA4B;CAChF,MAAM,aAAa,OAAO,QAAQ,QAAQ,EAAE,CAAC,CAAC,YAAY;CAC1D,MAAM,MAAM,QAAQ,YAAY;CAChC,OAAO,QAAQ,cAAc,QAAQ,QAAQ;AAC/C;;AAGA,MAAa,uBAAuB,SAClC,KAAK,UAAU,aAAa,KAAK,KACjC,KAAK,UAAU,OAAO,KAAK,KAC3B,KAAK,OAAO,MAAM,aAAa,KAAK,KACpC,KAAK,OAAO,MAAM,OAAO,KAAK,KAC9B,KAAK;;;;;;;;;AAUP,MAAa,0BACX,OACA,UAAgC,CAAC,MACT;CACxB,MAAM,QAAQ,QAAQ,SAAS;CAC/B,MAAM,UAAU,QAAQ,YAAY,CAAC;CAGrC,MAAM,WAAW,IAAI,KAClB,QAAQ,iBAAiB,CAAC,EAAA,CAAG,QAAQ,SAAS,KAAK,WAAW,KAAA,KAAa,KAAK,WAAW,MAAM,CAAC,CAChG,KAAK,SAAS,gBAAgB,KAAK,MAAM,KAAK,EAAE,CAAC,CACtD;CACA,MAAM,WAAW,IAAI,IACnB,MAAM,MACH,QAAQ,SAAS,KAAK,SAAS,SAAS,CAAC,CACzC,KAAK,SAAS,gBAAgB,KAAK,MAAM,KAAK,EAAE,CAAC,CACtD;CAEA,MAAM,WAAW,CAAC,GAAG,MAAM,MAAM,OAAO,CAAC,CAAC,CAAC,OAAO,iBAAiB;CAEnE,MAAM,MAAgC,CAAC;CACvC,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KACnC,KAAK,IAAI,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;EAC5C,MAAM,IAAI,SAAS;EACnB,MAAM,IAAI,SAAS;EACnB,MAAM,UAAU,mBAAmB,GAAG,CAAC;EACvC,IAAI,YAAY,KAAA,GAAW;EAC3B,IAAI,QAAQ,SAAS,KAAK,CAAC,QAAQ,MAAM,WAAW,qBAAqB,QAAQ,KAAK,MAAM,CAAC,GAC3F;EAEF,KAAK,MAAM,CAAC,QAAQ,gBAAgB,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,GAAG,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,GAAG;GACxE,MAAM,MAAM,gBAAgB,QAAS,WAAY;GACjD,IAAI,SAAS,IAAI,GAAG,KAAK,SAAS,IAAI,GAAG,GAAG;GAC5C,IAAI,KAAK;IAAU;IAAsB;IAAc,SAAS,QAAQ;IAAK,QAAQ,QAAQ;GAAO,CAAC;EACvG;CACF;CAGF,MAAM,WAAW,GAAsB,MACrC,EAAE,UAAU,EAAE,UACV,KACA,EAAE,UAAU,EAAE,UACZ,IACA,EAAE,SAAS,EAAE,SACX,KACA,EAAE,SAAS,EAAE,SACX,IACA,EAAE,cAAc,EAAE,cAChB,KACA,EAAE,cAAc,EAAE,cAChB,IACA;CAChB,IAAI,KAAK,OAAO;CAEhB,MAAM,yBAAS,IAAI,IAAoB;CACvC,KAAK,MAAM,QAAQ,KAAK,OAAO,IAAI,KAAK,UAAU,OAAO,IAAI,KAAK,OAAO,KAAK,KAAK,CAAC;CAEpF,MAAM,aAAa,IAAI,MAAM,GAAG,KAAK;CACrC,OAAO;EACL;EACA,OAAO,IAAI;EACX,WAAW,IAAI,SAAS,WAAW;EACnC,UAAU,CAAC,GAAG,OAAO,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,YAAY;GAAE;GAAK,YAAY;EAAM,EAAE;CACpF;AACF;;;;;;AAOA,MAAa,uBAAuB,UAAmF;CACrH,MAAM,QACJ,MAAM,QAAQ,KAAK,IACf,QACA,UAAU,QAAQ,OAAO,UAAU,YAAY,MAAM,QAAS,MAA8B,KAAK,IAC9F,MAA4C,QAC7C,UAAU,QACR,OAAO,UAAU,YACjB,MAAM,QAAS,MAAsC,aAAa,IACjE,MAAoD,gBACrD,KAAA;CAEV,IAAI,UAAU,KAAA,GACZ,MAAM,IAAI,MACR,6EACF;CAGF,OAAO,MAAM,KAAK,SAAS;EACzB,IAAI,SAAS,QAAQ,OAAO,SAAS,UACnC,MAAM,IAAI,MAAM,kEAAkE;EAEpF,MAAM,EAAE,MAAM,IAAI,WAAW;EAC7B,IAAI,OAAO,SAAS,YAAY,OAAO,OAAO,UAC5C,MAAM,IAAI,MAAM,qDAAqD;EAEvE,IAAI,WAAW,KAAA,KAAa,CAAC;GAAC;GAAO;GAAU;GAAU;EAAM,CAAC,CAAC,SAAS,MAAgB,GACxF,MAAM,IAAI,MAAM,2DAA2D;EAE7E,OAAO,WAAW,KAAA,IAAY;GAAE;GAAM;EAAG,IAAI;GAAE;GAAM;GAAY;EAAuB;CAC1F,CAAC;AACH;;;;;;;;;;;;;;;AC1MA,SAAgB,iBAAiB,QAAmB,MAAgC;CAClF,MAAM,EAAE,cAAc,eAAe;CAErC,MAAM,SAAS,aAAa;CAC5B,IAAI,QAAQ,OAAO,OAAO,QAAQ,YAAY,KAAK;CAGnD,OADmB,OAAO,OAAO,UAAU,CAAC,CAAC,MAAM,UAAU,MAAM,aAAa,IAChE,CAAC,EAAE,QAAQ,YAAY,KAAK;AAC9C"}
+{"version":3,"file":"index.js","names":[],"sources":["../src/core/collections.ts","../src/core/link-candidates.ts","../src/core/resolve-route-link.ts","../src/markdown/lock.ts"],"sourcesContent":["/**\n * Content collections — pages a param route renders from content (MDX, a CMS,\n * a manifest) — in the shape the graph reads. Works with any source whose\n * pages carry a URL, which covers Fumadocs `loader().getPages()` directly.\n */\n\nimport type { PublicPath } from \"./declare\";\nimport type { SeoCollection, SeoEdge, SeoInstance, SeoSource } from \"./graph\";\n\n/** What a page contributes: its instance metadata plus the paths it links to deliberately. */\nexport interface ContentEntry extends Omit<SeoInstance, \"path\"> {\n  /** Defaults to the page's `url`. */\n  readonly path?: string | undefined;\n  /** Deliberate cross-links, emitted as `related` edges from this page. */\n  readonly related?: ReadonlyArray<string> | undefined;\n}\n\nexport interface ContentCollectionOptions<Page> {\n  /** The param route these pages render through, e.g. `/blog/$slug`. */\n  readonly route: PublicPath;\n  /** The `source` label stamped on every node, e.g. `\"blog\"`. */\n  readonly source: SeoSource;\n  readonly pages: ReadonlyArray<Page>;\n  /** Map one page to its entry; decode frontmatter here. */\n  readonly entry: (page: Page) => ContentEntry;\n  /** Edges beyond `related` (crumb parents, collection membership). */\n  readonly edges?: ReadonlyArray<SeoEdge> | undefined;\n}\n\nexport function contentCollection<Page extends { readonly url: string }>(\n  options: ContentCollectionOptions<Page>,\n): SeoCollection {\n  const entries = options.pages.map((page) => {\n    const entry = options.entry(page);\n    return { ...entry, path: entry.path ?? page.url };\n  });\n  return {\n    route: options.route,\n    source: options.source,\n    instances: entries.map(({ related: _related, ...instance }) => instance),\n    edges: [\n      ...entries.flatMap((entry) =>\n        [...new Set(entry.related ?? [])].map((to): SeoEdge => ({ from: entry.path, to, type: \"related\" })),\n      ),\n      ...(options.edges ?? []),\n    ],\n  };\n}\n","/**\n * Pure candidate generation for contextual cross-links.\n *\n * Given the declared graph, enumerate `(source, destination)` pairs that are\n * *plausible* contextual links and *not already connected*. A pair is plausible\n * when the two pages sit in the same cluster: a shared top-level section (e.g.\n * `/blog/a` and `/blog/b` under `/blog`) or, for root-level pages that share no\n * section, the same `kind`. Only sitemap-eligible pages are candidates — a\n * noindex, redirect, or param template is not a link surface.\n *\n * The plan is a proposal, never an application: nothing here writes a\n * declaration. Effect- and framework-free so it runs in the CLI, a Worker, or a\n * test on the same graph.\n */\n\nimport type { SeoGraph, SeoNode } from \"./graph\";\nimport type { AnchorRegion, SimpleEdge } from \"./links\";\nimport { isSitemapEligible } from \"./projections\";\n\n/** One proposed contextual link, in the direction the link would be authored. */\nexport interface LinkCandidatePair {\n  readonly source: string;\n  readonly destination: string;\n  /** The cluster the pair shares: a top-level section, or `kind:<kind>`. */\n  readonly cluster: string;\n  /** Why the pair is plausible, e.g. `same top-level section \"/blog\"`. */\n  readonly reason: string;\n}\n\nexport interface LinkCandidateOptions {\n  /** Maximum candidates to return after ordering (default 50). */\n  readonly limit?: number;\n  /** Restrict to these clusters; a filter may be a section or a bare kind. */\n  readonly clusters?: ReadonlyArray<string>;\n  /** Anchors already served in HTML. Only body-region edges exclude their own direction. */\n  readonly renderedEdges?: ReadonlyArray<SimpleEdge & { readonly region?: AnchorRegion }>;\n}\n\n/** One cluster and how many candidate pairs it contributes (before `limit`). */\nexport interface LinkClusterSummary {\n  readonly key: string;\n  readonly candidates: number;\n}\n\nexport interface LinkCandidateResult {\n  readonly candidates: ReadonlyArray<LinkCandidatePair>;\n  /** Candidate pairs before `limit` was applied (after cluster filters). */\n  readonly total: number;\n  readonly truncated: boolean;\n  readonly clusters: ReadonlyArray<LinkClusterSummary>;\n}\n\n/**\n * Canonical path key: query and hash stripped, trailing slashes removed, \"/\"\n * preserved. This is the same path key the graph and the rendered-link core\n * use, so a served anchor like `/blog/a?ref=nav` still matches the graph pair\n * `/blog/a`.\n */\nconst normalize = (path: string): string => {\n  const pathname = path.split(/[?#]/, 1)[0] ?? \"\";\n  const trimmed = pathname.replace(/\\/+$/, \"\");\n  return trimmed === \"\" ? \"/\" : trimmed;\n};\n\n/** Directionless pair key, so an edge in either direction means \"connected\". */\nexport const undirectedEdgeKey = (from: string, to: string): string => {\n  const [a, b] = [normalize(from), normalize(to)].sort();\n  return `${a}\\u0000${b}`;\n};\n\nconst directedEdgeKey = (from: string, to: string): string => `${normalize(from)}\\u0000${normalize(to)}`;\n\n/** First path segment, or undefined for the root page. */\nconst topSegment = (path: string): string | undefined => {\n  const segment = path.split(\"/\").filter(Boolean)[0];\n  return segment === undefined || segment === \"\" ? undefined : segment;\n};\n\n/** A page with no nested segment (`/`, `/pricing`, `/blog`) is root-level. */\nconst isRootLevel = (path: string): boolean => path.split(\"/\").filter(Boolean).length <= 1;\n\n/**\n * The cluster a pair shares, or undefined when they share none. Section-first:\n * a shared top-level section wins. The kind fallback is local to root-level\n * pages, so it never pairs two nested pages from different sections.\n */\nexport const candidateClusterOf = (a: SeoNode, b: SeoNode): { key: string; reason: string } | undefined => {\n  const aSegment = topSegment(a.path);\n  const bSegment = topSegment(b.path);\n  if (aSegment !== undefined && aSegment === bSegment) {\n    return { key: aSegment, reason: `same top-level section \"/${aSegment}\"` };\n  }\n  if (isRootLevel(a.path) && isRootLevel(b.path) && a.kind === b.kind) {\n    return { key: `kind:${a.kind}`, reason: `same kind \"${a.kind}\"` };\n  }\n  return undefined;\n};\n\n/** A `--cluster` filter matches a section by name, or a kind via its bare label. */\nexport const matchesClusterFilter = (cluster: string, filter: string): boolean => {\n  const normalized = filter.replace(/^\\/+/, \"\").toLowerCase();\n  const key = cluster.toLowerCase();\n  return key === normalized || key === `kind:${normalized}`;\n};\n\n/** Human reason string for a candidate's source page, used when handing a plan to Jev. */\nexport const candidateSourceText = (node: SeoNode): string =>\n  node.instance?.description?.trim() ||\n  node.instance?.title?.trim() ||\n  node.policy.link?.description?.trim() ||\n  node.policy.link?.title?.trim() ||\n  node.path;\n\n/**\n * Enumerate reviewable contextual-link candidates from the declared graph.\n *\n * Excluded: self-pairs, pages that are not sitemap-eligible, pairs already\n * declared as a `related` edge, and — when {@link LinkCandidateOptions.renderedEdges}\n * is supplied — pairs already rendered as an anchor. Queries, hashes, and\n * trailing slashes are normalized so both sides compare by the graph's path key.\n */\nexport const generateLinkCandidates = (\n  graph: SeoGraph,\n  options: LinkCandidateOptions = {},\n): LinkCandidateResult => {\n  const limit = options.limit ?? 50;\n  const filters = options.clusters ?? [];\n  // Legacy bare edges have no region. Treat them as body links so a v1 edge dump\n  // remains conservative; region-aware artifacts retain nav/header/footer edges.\n  const rendered = new Set(\n    (options.renderedEdges ?? []).filter((edge) => edge.region === undefined || edge.region === \"body\")\n      .map((edge) => directedEdgeKey(edge.from, edge.to)),\n  );\n  const declared = new Set(\n    graph.edges\n      .filter((edge) => edge.type === \"related\")\n      .map((edge) => directedEdgeKey(edge.from, edge.to)),\n  );\n\n  const eligible = [...graph.nodes.values()].filter(isSitemapEligible);\n\n  const all: Array<LinkCandidatePair> = [];\n  for (let i = 0; i < eligible.length; i++) {\n    for (let j = i + 1; j < eligible.length; j++) {\n      const a = eligible[i]!;\n      const b = eligible[j]!;\n      const cluster = candidateClusterOf(a, b);\n      if (cluster === undefined) continue;\n      if (filters.length > 0 && !filters.some((filter) => matchesClusterFilter(cluster.key, filter))) {\n        continue;\n      }\n      for (const [source, destination] of [[a.path, b.path], [b.path, a.path]]) {\n        const key = directedEdgeKey(source!, destination!);\n        if (declared.has(key) || rendered.has(key)) continue;\n        all.push({ source: source!, destination: destination!, cluster: cluster.key, reason: cluster.reason });\n      }\n    }\n  }\n\n  const compare = (x: LinkCandidatePair, y: LinkCandidatePair): number =>\n    x.cluster < y.cluster\n      ? -1\n      : x.cluster > y.cluster\n        ? 1\n        : x.source < y.source\n          ? -1\n          : x.source > y.source\n            ? 1\n            : x.destination < y.destination\n              ? -1\n              : x.destination > y.destination\n                ? 1\n                : 0;\n  all.sort(compare);\n\n  const counts = new Map<string, number>();\n  for (const pair of all) counts.set(pair.cluster, (counts.get(pair.cluster) ?? 0) + 1);\n\n  const candidates = all.slice(0, limit);\n  return {\n    candidates,\n    total: all.length,\n    truncated: all.length > candidates.length,\n    clusters: [...counts.entries()].map(([key, count]) => ({ key, candidates: count })),\n  };\n};\n\n/**\n * Decode a rendered-edge dump supplied to the CLI: either a bare array of\n * `{ from, to }` edges, or an object carrying `edges` (or `internalEdges`).\n * Throws on any other shape — this is user input, not a provider payload.\n */\nexport const decodeRenderedEdges = (input: unknown): ReadonlyArray<SimpleEdge & { readonly region?: AnchorRegion }> => {\n  const array =\n    Array.isArray(input)\n      ? input\n      : input !== null && typeof input === \"object\" && Array.isArray((input as { edges?: unknown }).edges)\n        ? (input as { edges: ReadonlyArray<unknown> }).edges\n        : input !== null &&\n            typeof input === \"object\" &&\n            Array.isArray((input as { internalEdges?: unknown }).internalEdges)\n          ? (input as { internalEdges: ReadonlyArray<unknown> }).internalEdges\n          : undefined;\n\n  if (array === undefined) {\n    throw new Error(\n      \"expected an array of { from, to } edges, or an object with an `edges` array\",\n    );\n  }\n\n  return array.map((item) => {\n    if (item === null || typeof item !== \"object\") {\n      throw new Error(\"each rendered edge must be an object with string `from` and `to`\");\n    }\n    const { from, to, region } = item as { from?: unknown; to?: unknown; region?: unknown };\n    if (typeof from !== \"string\" || typeof to !== \"string\") {\n      throw new Error(\"each rendered edge must have string `from` and `to`\");\n    }\n    if (region !== undefined && ![\"nav\", \"header\", \"footer\", \"body\"].includes(region as string)) {\n      throw new Error(\"rendered edge region must be nav, header, footer, or body\");\n    }\n    return region === undefined ? { from, to } : { from, to, region: region as AnchorRegion };\n  });\n};\n","import type { AnyRoute, AnyRouter } from \"@tanstack/react-router\";\n\nimport type { RouteSeo } from \"./declare\";\n\ninterface RouteMaps {\n  routesByPath: Record<string, AnyRoute | undefined>;\n  routesById: Record<string, AnyRoute>;\n}\n\n/**\n * Resolve a route's declared `seo.link` card (title + description) by its full\n * path.\n *\n * `useRouter()` returns a Router typed to this app's exact route tree, so\n * `routesByPath` is keyed by the literal `FileRouteTypes[\"fullPaths\"]` union —\n * but callers here (declared `related` targets) hold arbitrary runtime path\n * strings, not that literal type. `routesByPath` and `routesById` are plain\n * Records on every Router instance regardless of which route tree it's\n * parameterized over, so this narrows to that structural shape once, at this\n * boundary, instead of threading an `AnyRoute` cast through every call site.\n */\nexport function resolveRouteLink(router: AnyRouter, path: string): RouteSeo[\"link\"] {\n  const { routesByPath, routesById } = router as unknown as RouteMaps;\n\n  const direct = routesByPath[path];\n  if (direct) return direct.options.staticData?.seo?.link;\n\n  const byFullPath = Object.values(routesById).find((route) => route.fullPath === path);\n  return byFullPath?.options.staticData?.seo?.link;\n}\n","import type { PageDocument } from \"./document\";\n\n/** Stable, reviewable snapshot of document and message hashes with source locations. */\nexport interface MarkdownLock {\n  readonly version: 1;\n  readonly pages: Readonly<Record<string, {\n    readonly document: string;\n    readonly messages: Readonly<Record<string, string>>;\n  }>>;\n}\n\nconst compare = (left: string, right: string): number => (left < right ? -1 : left > right ? 1 : 0);\n\n/** Build the v1 lock without changing document hashes, message hashes, or sources. */\nexport function createMarkdownLock(documents: ReadonlyArray<PageDocument>): MarkdownLock {\n  const pages: Record<string, { document: string; messages: Record<string, string> }> =\n    Object.create(null);\n\n  for (const document of [...documents].sort((left, right) => compare(left.path, right.path))) {\n    if (Object.hasOwn(pages, document.path))\n      throw new Error(`Duplicate document page path \"${document.path}\"`);\n    if (!/^[0-9a-f]{64}$/.test(document.hash))\n      throw new Error(`Invalid document document hash \"${document.hash}\" on \"${document.path}\"`);\n\n    const messages: Record<string, string> = Object.create(null);\n    for (const message of [...document.messages].sort(\n      (left, right) => compare(left.hash, right.hash) || compare(left.source, right.source),\n    )) {\n      if (!/^[0-9a-f]{16}$/.test(message.hash))\n        throw new Error(`Invalid document message hash \"${message.hash}\" on \"${document.path}\"`);\n      if (!Object.hasOwn(messages, message.hash)) messages[message.hash] = message.source;\n    }\n    pages[document.path] = { document: document.hash, messages };\n  }\n\n  // Typed callers supply strings, but the lock remains a validating runtime boundary.\n  for (const [path, page] of Object.entries(pages)) {\n    if (typeof page.document !== \"string\")\n      throw new Error(`Expected string\\n  at [\"pages\"][${JSON.stringify(path)}][\"document\"]`);\n    for (const [hash, source] of Object.entries(page.messages)) {\n      if (typeof source !== \"string\")\n        throw new Error(`Expected string\\n  at [\"pages\"][${JSON.stringify(path)}][\"messages\"][${JSON.stringify(hash)}]`);\n    }\n  }\n  return { version: 1, pages };\n}\n"],"mappings":";;;;;;;;;;;;AA6BA,SAAgB,kBACd,SACe;CACf,MAAM,UAAU,QAAQ,MAAM,KAAK,SAAS;EAC1C,MAAM,QAAQ,QAAQ,MAAM,IAAI;EAChC,OAAO;GAAE,GAAG;GAAO,MAAM,MAAM,QAAQ,KAAK;EAAI;CAClD,CAAC;CACD,OAAO;EACL,OAAO,QAAQ;EACf,QAAQ,QAAQ;EAChB,WAAW,QAAQ,KAAK,EAAE,SAAS,UAAU,GAAG,eAAe,QAAQ;EACvE,OAAO,CACL,GAAG,QAAQ,SAAS,UAClB,CAAC,GAAG,IAAI,IAAI,MAAM,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,QAAiB;GAAE,MAAM,MAAM;GAAM;GAAI,MAAM;EAAU,EAAE,CACpG,GACA,GAAI,QAAQ,SAAS,CAAC,CACxB;CACF;AACF;;;;;;;;;ACWA,MAAM,aAAa,SAAyB;CAE1C,MAAM,WADW,KAAK,MAAM,QAAQ,CAAC,CAAC,CAAC,MAAM,GAAA,CACpB,QAAQ,QAAQ,EAAE;CAC3C,OAAO,YAAY,KAAK,MAAM;AAChC;;AAGA,MAAa,qBAAqB,MAAc,OAAuB;CACrE,MAAM,CAAC,GAAG,KAAK,CAAC,UAAU,IAAI,GAAG,UAAU,EAAE,CAAC,CAAC,CAAC,KAAK;CACrD,OAAO,GAAG,EAAE,QAAQ;AACtB;AAEA,MAAM,mBAAmB,MAAc,OAAuB,GAAG,UAAU,IAAI,EAAE,QAAQ,UAAU,EAAE;;AAGrG,MAAM,cAAc,SAAqC;CACvD,MAAM,UAAU,KAAK,MAAM,GAAG,CAAC,CAAC,OAAO,OAAO,CAAC,CAAC;CAChD,OAAO,YAAY,KAAA,KAAa,YAAY,KAAK,KAAA,IAAY;AAC/D;;AAGA,MAAM,eAAe,SAA0B,KAAK,MAAM,GAAG,CAAC,CAAC,OAAO,OAAO,CAAC,CAAC,UAAU;;;;;;AAOzF,MAAa,sBAAsB,GAAY,MAA4D;CACzG,MAAM,WAAW,WAAW,EAAE,IAAI;CAClC,MAAM,WAAW,WAAW,EAAE,IAAI;CAClC,IAAI,aAAa,KAAA,KAAa,aAAa,UACzC,OAAO;EAAE,KAAK;EAAU,QAAQ,4BAA4B,SAAS;CAAG;CAE1E,IAAI,YAAY,EAAE,IAAI,KAAK,YAAY,EAAE,IAAI,KAAK,EAAE,SAAS,EAAE,MAC7D,OAAO;EAAE,KAAK,QAAQ,EAAE;EAAQ,QAAQ,cAAc,EAAE,KAAK;CAAG;AAGpE;;AAGA,MAAa,wBAAwB,SAAiB,WAA4B;CAChF,MAAM,aAAa,OAAO,QAAQ,QAAQ,EAAE,CAAC,CAAC,YAAY;CAC1D,MAAM,MAAM,QAAQ,YAAY;CAChC,OAAO,QAAQ,cAAc,QAAQ,QAAQ;AAC/C;;AAGA,MAAa,uBAAuB,SAClC,KAAK,UAAU,aAAa,KAAK,KACjC,KAAK,UAAU,OAAO,KAAK,KAC3B,KAAK,OAAO,MAAM,aAAa,KAAK,KACpC,KAAK,OAAO,MAAM,OAAO,KAAK,KAC9B,KAAK;;;;;;;;;AAUP,MAAa,0BACX,OACA,UAAgC,CAAC,MACT;CACxB,MAAM,QAAQ,QAAQ,SAAS;CAC/B,MAAM,UAAU,QAAQ,YAAY,CAAC;CAGrC,MAAM,WAAW,IAAI,KAClB,QAAQ,iBAAiB,CAAC,EAAA,CAAG,QAAQ,SAAS,KAAK,WAAW,KAAA,KAAa,KAAK,WAAW,MAAM,CAAC,CAChG,KAAK,SAAS,gBAAgB,KAAK,MAAM,KAAK,EAAE,CAAC,CACtD;CACA,MAAM,WAAW,IAAI,IACnB,MAAM,MACH,QAAQ,SAAS,KAAK,SAAS,SAAS,CAAC,CACzC,KAAK,SAAS,gBAAgB,KAAK,MAAM,KAAK,EAAE,CAAC,CACtD;CAEA,MAAM,WAAW,CAAC,GAAG,MAAM,MAAM,OAAO,CAAC,CAAC,CAAC,OAAO,iBAAiB;CAEnE,MAAM,MAAgC,CAAC;CACvC,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KACnC,KAAK,IAAI,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;EAC5C,MAAM,IAAI,SAAS;EACnB,MAAM,IAAI,SAAS;EACnB,MAAM,UAAU,mBAAmB,GAAG,CAAC;EACvC,IAAI,YAAY,KAAA,GAAW;EAC3B,IAAI,QAAQ,SAAS,KAAK,CAAC,QAAQ,MAAM,WAAW,qBAAqB,QAAQ,KAAK,MAAM,CAAC,GAC3F;EAEF,KAAK,MAAM,CAAC,QAAQ,gBAAgB,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,GAAG,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,GAAG;GACxE,MAAM,MAAM,gBAAgB,QAAS,WAAY;GACjD,IAAI,SAAS,IAAI,GAAG,KAAK,SAAS,IAAI,GAAG,GAAG;GAC5C,IAAI,KAAK;IAAU;IAAsB;IAAc,SAAS,QAAQ;IAAK,QAAQ,QAAQ;GAAO,CAAC;EACvG;CACF;CAGF,MAAM,WAAW,GAAsB,MACrC,EAAE,UAAU,EAAE,UACV,KACA,EAAE,UAAU,EAAE,UACZ,IACA,EAAE,SAAS,EAAE,SACX,KACA,EAAE,SAAS,EAAE,SACX,IACA,EAAE,cAAc,EAAE,cAChB,KACA,EAAE,cAAc,EAAE,cAChB,IACA;CAChB,IAAI,KAAK,OAAO;CAEhB,MAAM,yBAAS,IAAI,IAAoB;CACvC,KAAK,MAAM,QAAQ,KAAK,OAAO,IAAI,KAAK,UAAU,OAAO,IAAI,KAAK,OAAO,KAAK,KAAK,CAAC;CAEpF,MAAM,aAAa,IAAI,MAAM,GAAG,KAAK;CACrC,OAAO;EACL;EACA,OAAO,IAAI;EACX,WAAW,IAAI,SAAS,WAAW;EACnC,UAAU,CAAC,GAAG,OAAO,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,YAAY;GAAE;GAAK,YAAY;EAAM,EAAE;CACpF;AACF;;;;;;AAOA,MAAa,uBAAuB,UAAmF;CACrH,MAAM,QACJ,MAAM,QAAQ,KAAK,IACf,QACA,UAAU,QAAQ,OAAO,UAAU,YAAY,MAAM,QAAS,MAA8B,KAAK,IAC9F,MAA4C,QAC7C,UAAU,QACR,OAAO,UAAU,YACjB,MAAM,QAAS,MAAsC,aAAa,IACjE,MAAoD,gBACrD,KAAA;CAEV,IAAI,UAAU,KAAA,GACZ,MAAM,IAAI,MACR,6EACF;CAGF,OAAO,MAAM,KAAK,SAAS;EACzB,IAAI,SAAS,QAAQ,OAAO,SAAS,UACnC,MAAM,IAAI,MAAM,kEAAkE;EAEpF,MAAM,EAAE,MAAM,IAAI,WAAW;EAC7B,IAAI,OAAO,SAAS,YAAY,OAAO,OAAO,UAC5C,MAAM,IAAI,MAAM,qDAAqD;EAEvE,IAAI,WAAW,KAAA,KAAa,CAAC;GAAC;GAAO;GAAU;GAAU;EAAM,CAAC,CAAC,SAAS,MAAgB,GACxF,MAAM,IAAI,MAAM,2DAA2D;EAE7E,OAAO,WAAW,KAAA,IAAY;GAAE;GAAM;EAAG,IAAI;GAAE;GAAM;GAAY;EAAuB;CAC1F,CAAC;AACH;;;;;;;;;;;;;;;AC1MA,SAAgB,iBAAiB,QAAmB,MAAgC;CAClF,MAAM,EAAE,cAAc,eAAe;CAErC,MAAM,SAAS,aAAa;CAC5B,IAAI,QAAQ,OAAO,OAAO,QAAQ,YAAY,KAAK;CAGnD,OADmB,OAAO,OAAO,UAAU,CAAC,CAAC,MAAM,UAAU,MAAM,aAAa,IAChE,CAAC,EAAE,QAAQ,YAAY,KAAK;AAC9C;;;AClBA,MAAM,WAAW,MAAc,UAA2B,OAAO,QAAQ,KAAK,OAAO,QAAQ,IAAI;;AAGjG,SAAgB,mBAAmB,WAAsD;CACvF,MAAM,QACJ,OAAO,OAAO,IAAI;CAEpB,KAAK,MAAM,YAAY,CAAC,GAAG,SAAS,CAAC,CAAC,MAAM,MAAM,UAAU,QAAQ,KAAK,MAAM,MAAM,IAAI,CAAC,GAAG;EAC3F,IAAI,OAAO,OAAO,OAAO,SAAS,IAAI,GACpC,MAAM,IAAI,MAAM,iCAAiC,SAAS,KAAK,EAAE;EACnE,IAAI,CAAC,iBAAiB,KAAK,SAAS,IAAI,GACtC,MAAM,IAAI,MAAM,mCAAmC,SAAS,KAAK,QAAQ,SAAS,KAAK,EAAE;EAE3F,MAAM,WAAmC,OAAO,OAAO,IAAI;EAC3D,KAAK,MAAM,WAAW,CAAC,GAAG,SAAS,QAAQ,CAAC,CAAC,MAC1C,MAAM,UAAU,QAAQ,KAAK,MAAM,MAAM,IAAI,KAAK,QAAQ,KAAK,QAAQ,MAAM,MAAM,CACtF,GAAG;GACD,IAAI,CAAC,iBAAiB,KAAK,QAAQ,IAAI,GACrC,MAAM,IAAI,MAAM,kCAAkC,QAAQ,KAAK,QAAQ,SAAS,KAAK,EAAE;GACzF,IAAI,CAAC,OAAO,OAAO,UAAU,QAAQ,IAAI,GAAG,SAAS,QAAQ,QAAQ,QAAQ;EAC/E;EACA,MAAM,SAAS,QAAQ;GAAE,UAAU,SAAS;GAAM;EAAS;CAC7D;CAGA,KAAK,MAAM,CAAC,MAAM,SAAS,OAAO,QAAQ,KAAK,GAAG;EAChD,IAAI,OAAO,KAAK,aAAa,UAC3B,MAAM,IAAI,MAAM,mCAAmC,KAAK,UAAU,IAAI,EAAE,cAAc;EACxF,KAAK,MAAM,CAAC,MAAM,WAAW,OAAO,QAAQ,KAAK,QAAQ,GACvD,IAAI,OAAO,WAAW,UACpB,MAAM,IAAI,MAAM,mCAAmC,KAAK,UAAU,IAAI,EAAE,gBAAgB,KAAK,UAAU,IAAI,EAAE,EAAE;CAErH;CACA,OAAO;EAAE,SAAS;EAAG;CAAM;AAC7B"}