pagegraph 0.12.0 → 0.14.0

package/dist/graph-DMNOLXLu.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-DMNOLXLu.js","names":[],"sources":["../src/core/graph.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 { applyTitleTemplate, type PublicPath, type RouteSeo, type 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 authored-document mode, inherited by collection instances. */\n  markdown?: \"rendered\" | \"source\" | undefined;\n  /** Group label for llms.txt, inherited by collection instances. */\n  llms?: string | undefined;\n  /** Route-declared policy, or synthesized (kind + inherited sitemap) for instances. */\n  policy: RouteSeo;\n  /**\n   * The head the page ships: a static route's declared `head`, or an instance's\n   * title (through its route's `titleTemplate`) and description. Absent when the\n   * route computes its head at request time and no collection supplies it.\n   */\n  head?: SeoNodeHead | undefined;\n  instance?:\n    | {\n        title: string;\n        description?: string | undefined;\n        publishedAt?: string | undefined;\n        modifiedAt?: string | undefined;\n      }\n    | undefined;\n}\n\n/**\n * A node's head as graph data: the full title, description, and FAQ text. An\n * instance without a description still carries its title.\n */\nexport interface SeoNodeHead {\n  readonly title: string;\n  readonly description?: string | undefined;\n  readonly faqs?: ReadonlyArray<{ readonly question: string; readonly answer: string }> | 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\n/**\n * The structural route shape the graph walks: a TanStack route tree has it\n * before `init()`, and an adapter can build it from parsed route files.\n */\nexport interface SeoRouteNode {\n  readonly options: {\n    readonly path?: string | undefined;\n    readonly staticData?:\n      | {\n          readonly seo?: RouteSeo | undefined;\n          readonly markdown?: SeoNode[\"markdown\"];\n          readonly llms?: SeoNode[\"llms\"];\n        }\n      | undefined;\n  };\n  readonly children?: ReadonlyArray<SeoRouteNode> | undefined;\n}\n\nexport interface BuildSeoGraphInput {\n  readonly routeTree: AnyRoute | SeoRouteNode;\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\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/** A route's declared head as graph data: templated title, description, and plain FAQs. */\nfunction declaredHead(seo: RouteSeo): SeoNodeHead | undefined {\n  if (seo.head === undefined) return undefined;\n  return {\n    title: applyTitleTemplate(seo.titleTemplate, seo.head.title),\n    description: seo.head.description,\n    faqs: seo.head.faqs?.map(({ question, answer }) => ({ question, answer })),\n  };\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    head: override.head ?? base.head,\n    titleTemplate: override.titleTemplate ?? base.titleTemplate,\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: SeoRouteNode,\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 data = route.options.staticData;\n  const seo = data?.seo;\n\n  if (seo || data?.markdown !== undefined || data?.llms !== undefined) {\n    const existing = nodes.get(path);\n    if (existing) {\n      if (seo) existing.policy = mergeSeo(existing.policy, seo);\n      existing.kind = existing.policy.kind;\n      // A head renders with its own route's template, never one merged from a layout.\n      existing.head = (seo && declaredHead(seo)) ?? existing.head;\n      existing.markdown = data?.markdown ?? existing.markdown;\n      existing.llms = data?.llms ?? existing.llms;\n    } else {\n      const policy = seo ?? { kind: FALLBACK_KIND };\n      nodes.set(path, {\n        path,\n        kind: policy.kind,\n        source: \"route\",\n        policy: { ...policy },\n        head: seo && declaredHead(seo),\n        markdown: data?.markdown,\n        llms: data?.llms,\n      });\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  const titleTemplate = collectionNode?.policy.titleTemplate;\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      markdown: collectionNode?.markdown,\n      llms: collectionNode?.llms,\n      policy: { kind, sitemap },\n      head: { title: applyTitleTemplate(titleTemplate, instance.title), description: instance.description },\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 SeoRouteNode, \"/\", 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"],"mappings":";;;AAkIA,MAAM,gBAAyB;;;;;;AAQ/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,aAAa,KAAwC;CAC5D,IAAI,IAAI,SAAS,KAAA,GAAW,OAAO,KAAA;CACnC,OAAO;EACL,OAAO,mBAAmB,IAAI,eAAe,IAAI,KAAK,KAAK;EAC3D,aAAa,IAAI,KAAK;EACtB,MAAM,IAAI,KAAK,MAAM,KAAK,EAAE,UAAU,cAAc;GAAE;GAAU;EAAO,EAAE;CAC3E;AACF;;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;EACxC,MAAM,SAAS,QAAQ,KAAK;EAC5B,eAAe,SAAS,iBAAiB,KAAK;CAChD;AACF;;;;;;AAOA,SAAS,WACP,OACA,YACA,QACA,OACA,OACA,YACM;CACN,MAAM,OAAO,SAAS,MAAM,SAAS,YAAY,MAAM,QAAQ,IAAI;CACnE,MAAM,OAAO,MAAM,QAAQ;CAC3B,MAAM,MAAM,MAAM;CAElB,IAAI,OAAO,MAAM,aAAa,KAAA,KAAa,MAAM,SAAS,KAAA,GAAW;EACnE,MAAM,WAAW,MAAM,IAAI,IAAI;EAC/B,IAAI,UAAU;GACZ,IAAI,KAAK,SAAS,SAAS,SAAS,SAAS,QAAQ,GAAG;GACxD,SAAS,OAAO,SAAS,OAAO;GAEhC,SAAS,QAAQ,OAAO,aAAa,GAAG,MAAM,SAAS;GACvD,SAAS,WAAW,MAAM,YAAY,SAAS;GAC/C,SAAS,OAAO,MAAM,QAAQ,SAAS;EACzC,OAAO;GACL,MAAM,SAAS,OAAO,EAAE,MAAM,cAAc;GAC5C,MAAM,IAAI,MAAM;IACd;IACA,MAAM,OAAO;IACb,QAAQ;IACR,QAAQ,EAAE,GAAG,OAAO;IACpB,MAAM,OAAO,aAAa,GAAG;IAC7B,UAAU,MAAM;IAChB,MAAM,MAAM;GACd,CAAC;EACH;EAEA,MAAM,uBAAuB,WAAW,WAAW,SAAS;EAC5D,IAAI,KAAK,UAAU,KAAA,KAAa,yBAAyB,KAAA,GACvD,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;CACvC,MAAM,gBAAgB,gBAAgB,OAAO;;;;;;CAO7C,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,UAAU,gBAAgB;GAC1B,MAAM,gBAAgB;GACtB,QAAQ;IAAE;IAAM;GAAQ;GACxB,MAAM;IAAE,OAAO,mBAAmB,eAAe,SAAS,KAAK;IAAG,aAAa,SAAS;GAAY;GACpG,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,WAAsC,KAAK,MAAM,OAAO,OAAO,CAAC,CAAC;CAElF,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"}

package/dist/hash-Dp7EzZUo.js

@@ -0,0 +1,18 @@
+//#region node_modules/@earendil-works/pi-ai/dist/utils/hash.js
+/** Fast deterministic hash to shorten long strings */
+function shortHash(str) {
+	let h1 = 3735928559;
+	let h2 = 1103547991;
+	for (let i = 0; i < str.length; i++) {
+		const ch = str.charCodeAt(i);
+		h1 = Math.imul(h1 ^ ch, 2654435761);
+		h2 = Math.imul(h2 ^ ch, 1597334677);
+	}
+	h1 = Math.imul(h1 ^ h1 >>> 16, 2246822507) ^ Math.imul(h2 ^ h2 >>> 13, 3266489909);
+	h2 = Math.imul(h2 ^ h2 >>> 16, 2246822507) ^ Math.imul(h1 ^ h1 >>> 13, 3266489909);
+	return (h2 >>> 0).toString(36) + (h1 >>> 0).toString(36);
+}
+//#endregion
+export { shortHash as t };
+
+//# sourceMappingURL=hash-Dp7EzZUo.js.map

package/dist/hash-Dp7EzZUo.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"hash-Dp7EzZUo.js","names":[],"sources":["../node_modules/@earendil-works/pi-ai/dist/utils/hash.js"],"sourcesContent":["/** Fast deterministic hash to shorten long strings */\nexport function shortHash(str) {\n    let h1 = 0xdeadbeef;\n    let h2 = 0x41c6ce57;\n    for (let i = 0; i < str.length; i++) {\n        const ch = str.charCodeAt(i);\n        h1 = Math.imul(h1 ^ ch, 2654435761);\n        h2 = Math.imul(h2 ^ ch, 1597334677);\n    }\n    h1 = Math.imul(h1 ^ (h1 >>> 16), 2246822507) ^ Math.imul(h2 ^ (h2 >>> 13), 3266489909);\n    h2 = Math.imul(h2 ^ (h2 >>> 16), 2246822507) ^ Math.imul(h1 ^ (h1 >>> 13), 3266489909);\n    return (h2 >>> 0).toString(36) + (h1 >>> 0).toString(36);\n}\n//# sourceMappingURL=hash.js.map"],"x_google_ignoreList":[0],"mappings":";;AACA,SAAgB,UAAU,KAAK;CAC3B,IAAI,KAAK;CACT,IAAI,KAAK;CACT,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;EACjC,MAAM,KAAK,IAAI,WAAW,CAAC;EAC3B,KAAK,KAAK,KAAK,KAAK,IAAI,UAAU;EAClC,KAAK,KAAK,KAAK,KAAK,IAAI,UAAU;CACtC;CACA,KAAK,KAAK,KAAK,KAAM,OAAO,IAAK,UAAU,IAAI,KAAK,KAAK,KAAM,OAAO,IAAK,UAAU;CACrF,KAAK,KAAK,KAAK,KAAM,OAAO,IAAK,UAAU,IAAI,KAAK,KAAK,KAAM,OAAO,IAAK,UAAU;CACrF,QAAQ,OAAO,EAAA,CAAG,SAAS,EAAE,KAAK,OAAO,EAAA,CAAG,SAAS,EAAE;AAC3D"}

package/dist/headers-BRNMVpzu.js

@@ -0,0 +1,19 @@
+//#region node_modules/@earendil-works/pi-ai/dist/utils/headers.js
+function headersToRecord(headers) {
+	const result = {};
+	for (const [key, value] of headers.entries()) result[key] = value;
+	return result;
+}
+function providerHeadersToRecord(...headerSources) {
+	const merged = /* @__PURE__ */ new Map();
+	for (const source of headerSources) for (const [name, value] of Object.entries(source ?? {})) {
+		const normalizedName = name.toLowerCase();
+		merged.delete(normalizedName);
+		if (value !== null) merged.set(normalizedName, [name, value]);
+	}
+	return merged.size > 0 ? Object.fromEntries(merged.values()) : void 0;
+}
+//#endregion
+export { providerHeadersToRecord as n, headersToRecord as t };
+
+//# sourceMappingURL=headers-BRNMVpzu.js.map

package/dist/headers-BRNMVpzu.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"headers-BRNMVpzu.js","names":[],"sources":["../node_modules/@earendil-works/pi-ai/dist/utils/headers.js"],"sourcesContent":["export function headersToRecord(headers) {\n    const result = {};\n    for (const [key, value] of headers.entries()) {\n        result[key] = value;\n    }\n    return result;\n}\nexport function providerHeadersToRecord(...headerSources) {\n    const merged = new Map();\n    for (const source of headerSources) {\n        for (const [name, value] of Object.entries(source ?? {})) {\n            const normalizedName = name.toLowerCase();\n            merged.delete(normalizedName);\n            if (value !== null)\n                merged.set(normalizedName, [name, value]);\n        }\n    }\n    return merged.size > 0 ? Object.fromEntries(merged.values()) : undefined;\n}\n//# sourceMappingURL=headers.js.map"],"x_google_ignoreList":[0],"mappings":";AAAA,SAAgB,gBAAgB,SAAS;CACrC,MAAM,SAAS,CAAC;CAChB,KAAK,MAAM,CAAC,KAAK,UAAU,QAAQ,QAAQ,GACvC,OAAO,OAAO;CAElB,OAAO;AACX;AACA,SAAgB,wBAAwB,GAAG,eAAe;CACtD,MAAM,yBAAS,IAAI,IAAI;CACvB,KAAK,MAAM,UAAU,eACjB,KAAK,MAAM,CAAC,MAAM,UAAU,OAAO,QAAQ,UAAU,CAAC,CAAC,GAAG;EACtD,MAAM,iBAAiB,KAAK,YAAY;EACxC,OAAO,OAAO,cAAc;EAC5B,IAAI,UAAU,MACV,OAAO,IAAI,gBAAgB,CAAC,MAAM,KAAK,CAAC;CAChD;CAEJ,OAAO,OAAO,OAAO,IAAI,OAAO,YAAY,OAAO,OAAO,CAAC,IAAI,KAAA;AACnE"}

package/dist/index-C5w9ripz.d.ts

@@ -0,0 +1,204 @@
+import { a as SeoGraph, h as RouteSeo, n as SeoCollection, o as SeoInstance, p as PublicPath, r as SeoEdge, s as SeoNode, u as SeoSource } from "./graph-D1PIndsC.js";
+import { N as SimpleEdge, w as AnchorRegion } from "./content-DgNr7apS.js";
+import { f as Message, m as SectionDocument, p as PageDocument } from "./page-heads-BfjWQvau.js";
+import "./projections-Bk-qOOsR.js";
+import { AnyRouter } from "@tanstack/react-router";
+//#region src/markdown/hash.d.ts
+declare const contentHash: (value: unknown) => string;
+//#endregion
+//#region src/markdown/markdown.d.ts
+interface MarkdownWriter {
+  text(value: Message | string | undefined): string;
+  heading(level: number, value: Message | string | undefined): string;
+  table(rows: ReadonlyArray<ReadonlyArray<Message | string>>): string;
+}
+interface SectionKind {
+  readonly kind: string;
+  readonly markdown: (section: SectionDocument, md: MarkdownWriter) => string;
+}
+/** A kind can be passed directly to Section; importing its definition registers its serializer. */
+declare function defineSectionKind<const K extends string>(definition: SectionKind & {
+  kind: K;
+}): SectionKind & {
+  kind: K;
+};
+declare function sectionMarkdown(section: SectionDocument, options?: {
+  includeHumans?: boolean;
+}): string;
+/** One public twin, in authored section order. Human-only messages never enter it. */
+declare function documentMarkdown(document: PageDocument, site: string): string;
+//#endregion
+//#region src/markdown/llms.d.ts
+interface LlmsPage {
+  document: Pick<PageDocument, "path" | "title" | "description">;
+  llms?: string;
+}
+declare function llmsSection(path: string): string;
+declare function llmsMarkdown(pages: ReadonlyArray<LlmsPage>, site: string): string;
+//#endregion
+//#region src/markdown/lock.d.ts
+/** Stable, reviewable snapshot of document and message hashes with source locations. */
+interface MarkdownLock {
+  readonly version: 1;
+  readonly pages: Readonly<Record<string, {
+    readonly document: string;
+    readonly messages: Readonly<Record<string, string>>;
+  }>>;
+}
+/** Build the v1 lock without changing document hashes, message hashes, or sources. */
+declare function createMarkdownLock(documents: ReadonlyArray<PageDocument>): MarkdownLock;
+//#endregion
+//#region src/core/collections.d.ts
+/** What a page contributes: its instance metadata plus the paths it links to deliberately. */
+interface ContentEntry extends Omit<SeoInstance, "path"> {
+  /** Defaults to the page's `url`. */
+  readonly path?: string | undefined;
+  /** Deliberate cross-links, emitted as `related` edges from this page. */
+  readonly related?: ReadonlyArray<string> | undefined;
+}
+interface ContentCollectionOptions<Page> {
+  /** The param route these pages render through, e.g. `/blog/$slug`. */
+  readonly route: PublicPath;
+  /** The `source` label stamped on every node, e.g. `"blog"`. */
+  readonly source: SeoSource;
+  readonly pages: ReadonlyArray<Page>;
+  /** Map one page to its entry; decode frontmatter here. */
+  readonly entry: (page: Page) => ContentEntry;
+  /** Edges beyond `related` (crumb parents, collection membership). */
+  readonly edges?: ReadonlyArray<SeoEdge> | undefined;
+}
+declare function contentCollection<Page extends {
+  readonly url: string;
+}>(options: ContentCollectionOptions<Page>): SeoCollection;
+//#endregion
+//#region src/core/wire.d.ts
+interface SeoGraphJson {
+  readonly nodes: ReadonlyArray<SeoNode>;
+  readonly edges: ReadonlyArray<SeoEdge>;
+  readonly collisions?: ReadonlyArray<{
+    readonly path: string;
+    readonly sources: ReadonlyArray<SeoSource>;
+  }> | undefined;
+}
+declare function graphToJson(graph: SeoGraph): SeoGraphJson;
+declare function graphFromJson(json: SeoGraphJson): SeoGraph;
+//#endregion
+//#region src/core/link-candidates.d.ts
+/** One proposed contextual link, in the direction the link would be authored. */
+interface LinkCandidatePair {
+  readonly source: string;
+  readonly destination: string;
+  /** The cluster the pair shares: a top-level section, or `kind:<kind>`. */
+  readonly cluster: string;
+  /** Why the pair is plausible, e.g. `same top-level section "/blog"`. */
+  readonly reason: string;
+}
+interface LinkCandidateOptions {
+  /** Maximum candidates to return after ordering (default 50). */
+  readonly limit?: number;
+  /** Restrict to these clusters; a filter may be a section or a bare kind. */
+  readonly clusters?: ReadonlyArray<string>;
+  /** Anchors already served in HTML. Only body-region edges exclude their own direction. */
+  readonly renderedEdges?: ReadonlyArray<SimpleEdge & {
+    readonly region?: AnchorRegion;
+  }>;
+}
+/** One cluster and how many candidate pairs it contributes (before `limit`). */
+interface LinkClusterSummary {
+  readonly key: string;
+  readonly candidates: number;
+}
+interface LinkCandidateResult {
+  readonly candidates: ReadonlyArray<LinkCandidatePair>;
+  /** Candidate pairs before `limit` was applied (after cluster filters). */
+  readonly total: number;
+  readonly truncated: boolean;
+  readonly clusters: ReadonlyArray<LinkClusterSummary>;
+}
+/** Directionless pair key, so an edge in either direction means "connected". */
+declare const undirectedEdgeKey: (from: string, to: string) => string;
+/** A `--cluster` filter matches a section by name, or a kind via its bare label. */
+declare const matchesClusterFilter: (cluster: string, filter: string) => boolean;
+/** Human reason string for a candidate's source page, used when handing a plan to Jev. */
+declare const candidateSourceText: (node: SeoNode) => string;
+/**
+ * Enumerate reviewable contextual-link candidates from the declared graph.
+ *
+ * Excluded: self-pairs, pages that are not sitemap-eligible, pairs already
+ * declared as a `related` edge, and — when {@link LinkCandidateOptions.renderedEdges}
+ * is supplied — pairs already rendered as an anchor. Queries, hashes, and
+ * trailing slashes are normalized so both sides compare by the graph's path key.
+ */
+declare const generateLinkCandidates: (graph: SeoGraph, options?: LinkCandidateOptions) => LinkCandidateResult;
+/**
+ * Decode a rendered-edge dump supplied to the CLI: either a bare array of
+ * `{ from, to }` edges, or an object carrying `edges` (or `internalEdges`).
+ * Throws on any other shape — this is user input, not a provider payload.
+ */
+declare const decodeRenderedEdges: (input: unknown) => ReadonlyArray<SimpleEdge & {
+  readonly region?: AnchorRegion;
+}>;
+//#endregion
+//#region src/core/inspect-html.d.ts
+/**
+ * Read a rendered `<head>` and validate it: title, meta
+ * (description/robots/og/twitter), canonical link, and `application/ld+json`
+ * blocks, with a minimal per-type JSON-LD check.
+ *
+ * This is the pure half of `pagegraph inspect --live` — the half worth having on its
+ * own. The CLI fetches a URL and hands the body here; a test suite can render a
+ * page and hand *that* here, asserting the head it actually ships. Both get the
+ * same verdict, because it is the same function.
+ *
+ * No HTML-parsing dependency, by design: a `<head>` is small and well-formed, so
+ * string/regex scanning is enough, and the package's core stays zero-dependency
+ * (which is also why the object guard below is hand-rolled — `effect/Predicate`
+ * is not reachable from this entry). It is honest about its limits: it does not
+ * build a DOM, so exotic markup (commented-out tags, CDATA, attributes spanning
+ * constructs) is out of scope. This validates *rendered output*, not arbitrary
+ * HTML.
+ *
+ * `issues` are blocking: a non-empty list makes `pagegraph inspect --live` exit 1.
+ * Required tags are `<title>`, `meta[name=description]`, and
+ * `link[rel=canonical]`; any JSON-LD that fails to parse or fails its minimal
+ * schema is also blocking.
+ */
+interface JsonLdReport {
+  type: string;
+  valid: boolean;
+  errors: Array<string>;
+}
+interface LiveHeadReport {
+  url: string;
+  status: number;
+  title?: string | undefined;
+  description?: string | undefined;
+  canonical?: string | undefined;
+  robots?: string | undefined;
+  og: Record<string, string>;
+  twitter: Record<string, string>;
+  jsonLd: Array<JsonLdReport>;
+  issues: Array<string>;
+}
+/** Parse a rendered HTML document's `<head>` into a report. Pure. */
+declare const inspectHtml: (url: string, status: number, html: string) => LiveHeadReport;
+/** A non-empty `issues` list fails `pagegraph inspect --live` (exit 1). */
+declare const hasBlockingIssues: (report: LiveHeadReport) => boolean;
+//#endregion
+//#region src/core/resolve-route-link.d.ts
+/**
+ * Resolve a route's declared `seo.link` card (title + description) by its full
+ * path.
+ *
+ * `useRouter()` returns a Router typed to this app's exact route tree, so
+ * `routesByPath` is keyed by the literal `FileRouteTypes["fullPaths"]` union —
+ * but callers here (declared `related` targets) hold arbitrary runtime path
+ * strings, not that literal type. `routesByPath` and `routesById` are plain
+ * Records on every Router instance regardless of which route tree it's
+ * parameterized over, so this narrows to that structural shape once, at this
+ * boundary, instead of threading an `AnyRoute` cast through every call site.
+ */
+declare function resolveRouteLink(router: AnyRouter, path: string): RouteSeo["link"];
+//#endregion
+export { sectionMarkdown as A, LlmsPage as C, SectionKind as D, MarkdownWriter as E, defineSectionKind as O, createMarkdownLock as S, llmsSection as T, graphToJson as _, inspectHtml as a, contentCollection as b, LinkCandidateResult as c, decodeRenderedEdges as d, generateLinkCandidates as f, graphFromJson as g, SeoGraphJson as h, hasBlockingIssues as i, contentHash as j, documentMarkdown as k, LinkClusterSummary as l, undirectedEdgeKey as m, JsonLdReport as n, LinkCandidateOptions as o, matchesClusterFilter as p, LiveHeadReport as r, LinkCandidatePair as s, resolveRouteLink as t, candidateSourceText as u, ContentCollectionOptions as v, llmsMarkdown as w, MarkdownLock as x, ContentEntry as y };
+//# sourceMappingURL=index-C5w9ripz.d.ts.map

package/dist/index.d.ts

@@ -1,160 +1,6 @@
-import { a as SeoFaq, c as SitemapPolicy, i as RouteSeo, l as applyTitleTemplate, n as PublicPath, o as SeoKind, r as Register, s as SeoPageHead, t as JsonLdDocument } from "./declare-DVgdEdOL.js";
-import { a as SeoGraph, c as SeoNodeHead, d as buildSeoGraph, i as SeoEdgeType, l as SeoRouteNode, n as SeoCollection, o as SeoInstance, r as SeoEdge, s as SeoNode, t as BuildSeoGraphInput, u as SeoSource } from "./graph-BxCY90vq.js";
-import { A as RenderedEdgeFailure, B as FreshnessEntry, C as Anchor, D as RENDERED_EDGE_ARTIFACT_SCHEMA_VERSION, E as LinkGraphDiff, F as decodeRenderedEdgeArtifact, H as FreshnessReport, I as diffLinkGraph, L as extractAnchors, M as RenderedPage, N as SimpleEdge, O as RenderedEdgeArtifact, P as buildRenderedGraph, R as normalizePath, S as hasStructuralViolations, T as LinkEdge, U as freshnessReport, V as FreshnessPolicy, _ as Violation, a as Heading, b as checkGraph, c as RenderedDocument, d as checkRenderedContent, f as extractPageContent, g as Severity, h as CoverageRule, i as ContentRuleName, j as RenderedGraph, k as RenderedEdgeArtifactCrawl, l as WordCountRule, m as CheckGraphOptions, n as ContentFinding, o as JsonLdNode, p as renderedCheckTargets, r as ContentPolicy, s as PageContent, t as ContentCheckOptions, u as checkPageContent, v as checkCoverage, w as AnchorRegion, x as checkRenderedCoverage, y as checkFreshness, z as renderedGraphFromEdges } from "./content-B1cPtL8b.js";
-import { a as inspectNode, c as renderRobots, i as contentSignal, l as renderSitemap, n as ProjectionConfig, o as isSitemapEligible, r as RobotsConfig, s as lastModified, t as NodeReport } from "./projections-DeEFe7XT.js";
-import { i as selectPageHeadNodes, n as PageHeadsOptions, r as pageHeads, t as PageHead } from "./page-heads-DNkjMUEN.js";
-import { AnyRouter } from "@tanstack/react-router";
-//#region src/core/collections.d.ts
-/** What a page contributes: its instance metadata plus the paths it links to deliberately. */
-interface ContentEntry extends Omit<SeoInstance, "path"> {
-  /** Defaults to the page's `url`. */
-  readonly path?: string | undefined;
-  /** Deliberate cross-links, emitted as `related` edges from this page. */
-  readonly related?: ReadonlyArray<string> | undefined;
-}
-interface ContentCollectionOptions<Page> {
-  /** The param route these pages render through, e.g. `/blog/$slug`. */
-  readonly route: PublicPath;
-  /** The `source` label stamped on every node, e.g. `"blog"`. */
-  readonly source: SeoSource;
-  readonly pages: ReadonlyArray<Page>;
-  /** Map one page to its entry; decode frontmatter here. */
-  readonly entry: (page: Page) => ContentEntry;
-  /** Edges beyond `related` (crumb parents, collection membership). */
-  readonly edges?: ReadonlyArray<SeoEdge> | undefined;
-}
-declare function contentCollection<Page extends {
-  readonly url: string;
-}>(options: ContentCollectionOptions<Page>): SeoCollection;
-//#endregion
-//#region src/core/wire.d.ts
-interface SeoGraphJson {
-  readonly nodes: ReadonlyArray<SeoNode>;
-  readonly edges: ReadonlyArray<SeoEdge>;
-  readonly collisions?: ReadonlyArray<{
-    readonly path: string;
-    readonly sources: ReadonlyArray<SeoSource>;
-  }> | undefined;
-}
-declare function graphToJson(graph: SeoGraph): SeoGraphJson;
-declare function graphFromJson(json: SeoGraphJson): SeoGraph;
-//#endregion
-//#region src/core/link-candidates.d.ts
-/** One proposed contextual link, in the direction the link would be authored. */
-interface LinkCandidatePair {
-  readonly source: string;
-  readonly destination: string;
-  /** The cluster the pair shares: a top-level section, or `kind:<kind>`. */
-  readonly cluster: string;
-  /** Why the pair is plausible, e.g. `same top-level section "/blog"`. */
-  readonly reason: string;
-}
-interface LinkCandidateOptions {
-  /** Maximum candidates to return after ordering (default 50). */
-  readonly limit?: number;
-  /** Restrict to these clusters; a filter may be a section or a bare kind. */
-  readonly clusters?: ReadonlyArray<string>;
-  /** Anchors already served in HTML. Only body-region edges exclude their own direction. */
-  readonly renderedEdges?: ReadonlyArray<SimpleEdge & {
-    readonly region?: AnchorRegion;
-  }>;
-}
-/** One cluster and how many candidate pairs it contributes (before `limit`). */
-interface LinkClusterSummary {
-  readonly key: string;
-  readonly candidates: number;
-}
-interface LinkCandidateResult {
-  readonly candidates: ReadonlyArray<LinkCandidatePair>;
-  /** Candidate pairs before `limit` was applied (after cluster filters). */
-  readonly total: number;
-  readonly truncated: boolean;
-  readonly clusters: ReadonlyArray<LinkClusterSummary>;
-}
-/** Directionless pair key, so an edge in either direction means "connected". */
-declare const undirectedEdgeKey: (from: string, to: string) => string;
-/** A `--cluster` filter matches a section by name, or a kind via its bare label. */
-declare const matchesClusterFilter: (cluster: string, filter: string) => boolean;
-/** Human reason string for a candidate's source page, used when handing a plan to Jev. */
-declare const candidateSourceText: (node: SeoNode) => string;
-/**
- * Enumerate reviewable contextual-link candidates from the declared graph.
- *
- * Excluded: self-pairs, pages that are not sitemap-eligible, pairs already
- * declared as a `related` edge, and — when {@link LinkCandidateOptions.renderedEdges}
- * is supplied — pairs already rendered as an anchor. Queries, hashes, and
- * trailing slashes are normalized so both sides compare by the graph's path key.
- */
-declare const generateLinkCandidates: (graph: SeoGraph, options?: LinkCandidateOptions) => LinkCandidateResult;
-/**
- * Decode a rendered-edge dump supplied to the CLI: either a bare array of
- * `{ from, to }` edges, or an object carrying `edges` (or `internalEdges`).
- * Throws on any other shape — this is user input, not a provider payload.
- */
-declare const decodeRenderedEdges: (input: unknown) => ReadonlyArray<SimpleEdge & {
-  readonly region?: AnchorRegion;
-}>;
-//#endregion
-//#region src/core/inspect-html.d.ts
-/**
- * Read a rendered `<head>` and validate it: title, meta
- * (description/robots/og/twitter), canonical link, and `application/ld+json`
- * blocks, with a minimal per-type JSON-LD check.
- *
- * This is the pure half of `pagegraph inspect --live` — the half worth having on its
- * own. The CLI fetches a URL and hands the body here; a test suite can render a
- * page and hand *that* here, asserting the head it actually ships. Both get the
- * same verdict, because it is the same function.
- *
- * No HTML-parsing dependency, by design: a `<head>` is small and well-formed, so
- * string/regex scanning is enough, and the package's core stays zero-dependency
- * (which is also why the object guard below is hand-rolled — `effect/Predicate`
- * is not reachable from this entry). It is honest about its limits: it does not
- * build a DOM, so exotic markup (commented-out tags, CDATA, attributes spanning
- * constructs) is out of scope. This validates *rendered output*, not arbitrary
- * HTML.
- *
- * `issues` are blocking: a non-empty list makes `pagegraph inspect --live` exit 1.
- * Required tags are `<title>`, `meta[name=description]`, and
- * `link[rel=canonical]`; any JSON-LD that fails to parse or fails its minimal
- * schema is also blocking.
- */
-interface JsonLdReport {
-  type: string;
-  valid: boolean;
-  errors: Array<string>;
-}
-interface LiveHeadReport {
-  url: string;
-  status: number;
-  title?: string | undefined;
-  description?: string | undefined;
-  canonical?: string | undefined;
-  robots?: string | undefined;
-  og: Record<string, string>;
-  twitter: Record<string, string>;
-  jsonLd: Array<JsonLdReport>;
-  issues: Array<string>;
-}
-/** Parse a rendered HTML document's `<head>` into a report. Pure. */
-declare const inspectHtml: (url: string, status: number, html: string) => LiveHeadReport;
-/** A non-empty `issues` list fails `pagegraph inspect --live` (exit 1). */
-declare const hasBlockingIssues: (report: LiveHeadReport) => boolean;
-//#endregion
-//#region src/core/resolve-route-link.d.ts
-/**
- * Resolve a route's declared `seo.link` card (title + description) by its full
- * path.
- *
- * `useRouter()` returns a Router typed to this app's exact route tree, so
- * `routesByPath` is keyed by the literal `FileRouteTypes["fullPaths"]` union —
- * but callers here (declared `related` targets) hold arbitrary runtime path
- * strings, not that literal type. `routesByPath` and `routesById` are plain
- * Records on every Router instance regardless of which route tree it's
- * parameterized over, so this narrows to that structural shape once, at this
- * boundary, instead of threading an `AnyRoute` cast through every call site.
- */
-declare function resolveRouteLink(router: AnyRouter, path: string): RouteSeo["link"];
-//#endregion
-export { type Anchor, type AnchorRegion, type BuildSeoGraphInput, type CheckGraphOptions, type ContentCheckOptions, type ContentCollectionOptions, type ContentEntry, type ContentFinding, type ContentPolicy, type ContentRuleName, type CoverageRule, type FreshnessEntry, type FreshnessPolicy, type FreshnessReport, type Heading, type JsonLdDocument, type JsonLdNode, type JsonLdReport, type LinkCandidateOptions, type LinkCandidatePair, type LinkCandidateResult, type LinkClusterSummary, type LinkEdge, type LinkGraphDiff, type LiveHeadReport, type NodeReport, type PageContent, type PageHead, type PageHeadsOptions, type ProjectionConfig, type PublicPath, RENDERED_EDGE_ARTIFACT_SCHEMA_VERSION, type Register, type RenderedDocument, type RenderedEdgeArtifact, type RenderedEdgeArtifactCrawl, type RenderedEdgeFailure, type RenderedGraph, type RenderedPage, type RobotsConfig, type RouteSeo, type SeoCollection, type SeoEdge, type SeoEdgeType, type SeoFaq, type SeoGraph, type SeoGraphJson, type SeoInstance, type SeoKind, type SeoNode, type SeoNodeHead, type SeoPageHead, type SeoRouteNode, type SeoSource, type Severity, type SimpleEdge, type SitemapPolicy, type Violation, type WordCountRule, applyTitleTemplate, buildRenderedGraph, buildSeoGraph, candidateSourceText, checkCoverage, checkFreshness, checkGraph, checkPageContent, checkRenderedContent, checkRenderedCoverage, contentCollection, contentSignal, decodeRenderedEdgeArtifact, decodeRenderedEdges, diffLinkGraph, extractAnchors, extractPageContent, freshnessReport, generateLinkCandidates, graphFromJson, graphToJson, hasBlockingIssues, hasStructuralViolations, inspectHtml, inspectNode, isSitemapEligible, lastModified, matchesClusterFilter, normalizePath, pageHeads, renderRobots, renderSitemap, renderedCheckTargets, renderedGraphFromEdges, resolveRouteLink, selectPageHeadNodes, undirectedEdgeKey };
-//# sourceMappingURL=index.d.ts.map
+import { _ as SeoKind, a as SeoGraph, b as applyTitleTemplate, c as SeoNodeHead, d as buildSeoGraph, f as JsonLdDocument, g as SeoFaq, h as RouteSeo, i as SeoEdgeType, l as SeoRouteNode, m as Register, n as SeoCollection, o as SeoInstance, p as PublicPath, r as SeoEdge, s as SeoNode, t as BuildSeoGraphInput, u as SeoSource, v as SeoPageHead, y as SitemapPolicy } from "./graph-D1PIndsC.js";
+import { A as RenderedEdgeFailure, B as FreshnessEntry, C as Anchor, D as RENDERED_EDGE_ARTIFACT_SCHEMA_VERSION, E as LinkGraphDiff, F as decodeRenderedEdgeArtifact, H as FreshnessReport, I as diffLinkGraph, L as extractAnchors, M as RenderedPage, N as SimpleEdge, O as RenderedEdgeArtifact, P as buildRenderedGraph, R as normalizePath, S as hasStructuralViolations, T as LinkEdge, U as freshnessReport, V as FreshnessPolicy, _ as Violation, a as Heading, b as checkGraph, c as RenderedDocument, d as checkRenderedContent, f as extractPageContent, g as Severity, h as CoverageRule, i as ContentRuleName, j as RenderedGraph, k as RenderedEdgeArtifactCrawl, l as WordCountRule, m as CheckGraphOptions, n as ContentFinding, o as JsonLdNode, p as renderedCheckTargets, r as ContentPolicy, s as PageContent, t as ContentCheckOptions, u as checkPageContent, v as checkCoverage, w as AnchorRegion, x as checkRenderedCoverage, y as checkFreshness, z as renderedGraphFromEdges } from "./content-DgNr7apS.js";
+import { _ as hashDocument, a as FactDefinition, c as fact, d as InlineNode, f as Message, g as VisualDocument, h as SectionItem, i as selectPageHeadNodes, l as resolveFact, m as SectionDocument, n as PageHeadsOptions, o as Facts, p as PageDocument, r as pageHeads, s as defineFacts, t as PageHead, u as BodyEntry } from "./page-heads-BfjWQvau.js";
+import { A as sectionMarkdown, C as LlmsPage, D as SectionKind, E as MarkdownWriter, O as defineSectionKind, S as createMarkdownLock, T as llmsSection, _ as graphToJson, a as inspectHtml, b as contentCollection, c as LinkCandidateResult, d as decodeRenderedEdges, f as generateLinkCandidates, g as graphFromJson, h as SeoGraphJson, i as hasBlockingIssues, j as contentHash, k as documentMarkdown, l as LinkClusterSummary, m as undirectedEdgeKey, n as JsonLdReport, o as LinkCandidateOptions, p as matchesClusterFilter, r as LiveHeadReport, s as LinkCandidatePair, t as resolveRouteLink, u as candidateSourceText, v as ContentCollectionOptions, w as llmsMarkdown, x as MarkdownLock, y as ContentEntry } from "./index-C5w9ripz.js";
+import { a as inspectNode, c as renderRobots, i as contentSignal, l as renderSitemap, n as ProjectionConfig, o as isSitemapEligible, r as RobotsConfig, s as lastModified, t as NodeReport } from "./projections-Bk-qOOsR.js";
+export { type Anchor, type AnchorRegion, type BodyEntry, type BuildSeoGraphInput, type CheckGraphOptions, type ContentCheckOptions, type ContentCollectionOptions, type ContentEntry, type ContentFinding, type ContentPolicy, type ContentRuleName, type CoverageRule, type FactDefinition, type Facts, type FreshnessEntry, type FreshnessPolicy, type FreshnessReport, type Heading, type InlineNode, type JsonLdDocument, type JsonLdNode, type JsonLdReport, type LinkCandidateOptions, type LinkCandidatePair, type LinkCandidateResult, type LinkClusterSummary, type LinkEdge, type LinkGraphDiff, type LiveHeadReport, type LlmsPage, type MarkdownLock, type MarkdownWriter, type Message, type NodeReport, type PageContent, type PageDocument, type PageHead, type PageHeadsOptions, type ProjectionConfig, type PublicPath, RENDERED_EDGE_ARTIFACT_SCHEMA_VERSION, type Register, type RenderedDocument, type RenderedEdgeArtifact, type RenderedEdgeArtifactCrawl, type RenderedEdgeFailure, type RenderedGraph, type RenderedPage, type RobotsConfig, type RouteSeo, type SectionDocument, type SectionItem, type SectionKind, type SeoCollection, type SeoEdge, type SeoEdgeType, type SeoFaq, type SeoGraph, type SeoGraphJson, type SeoInstance, type SeoKind, type SeoNode, type SeoNodeHead, type SeoPageHead, type SeoRouteNode, type SeoSource, type Severity, type SimpleEdge, type SitemapPolicy, type Violation, type VisualDocument, type WordCountRule, 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 };

package/dist/index.js

@@ -1,10 +1,14 @@
 import { t as applyTitleTemplate } from "./declare-D5o7hwmv.js";
-import { t as buildSeoGraph } from "./graph-Bcsourlv.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-uZk5Em9A.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-kcEnQdfi.js";
-import { n as selectPageHeadNodes, t as pageHeads } from "./page-heads-6y-CARRQ.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) => {
@@ -171,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, applyTitleTemplate, buildRenderedGraph, buildSeoGraph, candidateSourceText, checkCoverage, checkFreshness, checkGraph, checkPageContent, checkRenderedContent, checkRenderedCoverage, contentCollection, contentSignal, decodeRenderedEdgeArtifact, decodeRenderedEdges, diffLinkGraph, extractAnchors, extractPageContent, freshnessReport, generateLinkCandidates, graphFromJson, graphToJson, hasBlockingIssues, hasStructuralViolations, inspectHtml, inspectNode, isSitemapEligible, lastModified, matchesClusterFilter, normalizePath, pageHeads, renderRobots, renderSitemap, renderedCheckTargets, renderedGraphFromEdges, resolveRouteLink, selectPageHeadNodes, 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/collections.ts","../src/core/link-candidates.ts","../src/core/resolve-route-link.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"],"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"}
+{"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"}