@mulmoclaude/core 1.14.0 → 1.14.1

package/dist/{graph-DjE1Az1C.cjs → graph-BZJxiv1E.cjs}

@@ -41,10 +41,8 @@ var HASHTAG_PATTERN = /(?:^|\s)#([\p{L}\p{N}][\p{L}\p{N}_-]*)/gu;
 *  Only matches at word boundaries so mid-word `#` (e.g. anchor
 *  URLs) is left alone. */
 function extractHashTags(text) {
-	const tags = [];
 	HASHTAG_PATTERN.lastIndex = 0;
-	let match;
-	while ((match = HASHTAG_PATTERN.exec(text)) !== null) tags.push(match[1].toLowerCase());
+	const tags = [...text.matchAll(HASHTAG_PATTERN)].flatMap(([, tag]) => tag ? [tag.toLowerCase()] : []);
 	return {
 		description: text.replace(HASHTAG_PATTERN, "").replace(/\s+/g, " ").trim(),
 		tags: [...new Set(tags)].sort()
@@ -109,7 +107,7 @@ function extractSlugFromBulletHref(rawHref) {
 function parseBulletLinkRow(trimmed) {
 	const match = BULLET_LINK_PATTERN.exec(trimmed);
 	if (!match) return null;
-	const title = match[1].trim();
+	const title = match[1]?.trim() ?? "";
 	const href = match[2] ?? "";
 	const { description, tags } = extractHashTags(match[3]?.trim() ?? "");
 	return {
@@ -122,7 +120,7 @@ function parseBulletLinkRow(trimmed) {
 function parseBulletWikiLinkRow(trimmed) {
 	const match = BULLET_WIKI_LINK_PATTERN.exec(trimmed);
 	if (!match) return null;
-	const { target, display } = parseWikiLink(match[1]);
+	const { target, display } = parseWikiLink(match[1] ?? "");
 	const title = (display || target).trim();
 	const slug = target ? require_slug.wikiSlugify(target) : require_slug.wikiSlugify(title);
 	const { description, tags } = extractHashTags(match[2]?.trim() ?? "");
@@ -193,14 +191,14 @@ function findMissingFiles(pageEntries, fileSlugs) {
 function findBrokenLinksInPage(fileName, content, fileSlugs) {
 	const issues = [];
 	const matches = [...content.matchAll(WIKI_LINK_PATTERN)];
-	for (const match of matches) {
-		const { target } = parseWikiLink(match[1]);
+	for (const [, body = ""] of matches) {
+		const { target } = parseWikiLink(body);
 		const linkSlug = require_slug.wikiSlugify(target);
 		if (linkSlug.length === 0) {
-			issues.push(`- **Broken link** in \`${fileName}\`: [[${match[1]}]] → empty target`);
+			issues.push(`- **Broken link** in \`${fileName}\`: [[${body}]] → empty target`);
 			continue;
 		}
-		if (!fileSlugs.has(linkSlug)) issues.push(`- **Broken link** in \`${fileName}\`: [[${match[1]}]] → \`${linkSlug}.md\` not found`);
+		if (!fileSlugs.has(linkSlug)) issues.push(`- **Broken link** in \`${fileName}\`: [[${body}]] → \`${linkSlug}.md\` not found`);
 	}
 	return issues;
 }
@@ -250,8 +248,8 @@ function resolveLinkTarget(target, fileSlugs, slugByTitle) {
 *  lint "broken link", not a graph edge). */
 function pageOutgoingSlugs(fromSlug, content, fileSlugs, slugByTitle) {
 	const out = /* @__PURE__ */ new Set();
-	for (const match of content.matchAll(WIKI_LINK_PATTERN)) {
-		const { target } = parseWikiLink(match[1]);
+	for (const [, body = ""] of content.matchAll(WIKI_LINK_PATTERN)) {
+		const { target } = parseWikiLink(body);
 		const resolved = resolveLinkTarget(target, fileSlugs, slugByTitle);
 		if (resolved !== null && resolved !== fromSlug) out.add(resolved);
 	}
@@ -418,4 +416,4 @@ Object.defineProperty(exports, "resolveLinkTarget", {
 	}
 });
 
-//# sourceMappingURL=graph-DjE1Az1C.cjs.map
+//# sourceMappingURL=graph-BZJxiv1E.cjs.map

package/dist/graph-BZJxiv1E.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-BZJxiv1E.cjs","names":[],"sources":["../src/wiki/link.ts","../src/wiki/index-parse.ts","../src/wiki/lint.ts","../src/wiki/graph.ts"],"sourcesContent":["// Pure helpers for `[[wiki-link]]` syntax. Used by the lint\n// (`server/api/routes/wiki.ts`), the page resolver, and the\n// frontend renderer (`src/plugins/wiki/helpers.ts`) — before this\n// module the three sites each had their own implementation and\n// none of them handled the `[[target|display]]` form, producing\n// false-positive \"broken link\" warnings on slug-aliased links\n// (issue #1297).\n//\n// All functions are pure string operations; safe to import from\n// browser bundles. No `node:*` imports anywhere in this file.\n\n/** Inline `[[...]]` link pattern. The capture group is the raw\n *  text between the brackets — the caller is expected to feed it\n *  through `parseWikiLink` to split off any `|display` suffix.\n *\n *  Body length is capped at 200 chars to keep the regex linear:\n *  catastrophic backtracking isn't possible (no nested\n *  alternation), but a malicious page with thousands of\n *  unmatched `[[` could still pin the CPU. 200 is well above the\n *  longest legitimate title we've seen and matches the cap the\n *  server-side `WIKI_LINK_PATTERN` constant has carried since the\n *  original implementation in #951.\n *\n *  Shared with the renderer's hand-rolled scanner so the two can't\n *  drift: the renderer must reject the same newline-bearing and\n *  over-length bodies, or a link would render clickable while the\n *  graph / backlinks / lint (which use this pattern) never see it. */\nexport const WIKI_LINK_MAX_LEN = 200;\nexport const WIKI_LINK_PATTERN = new RegExp(`\\\\[\\\\[([^\\\\][\\\\r\\\\n]{1,${WIKI_LINK_MAX_LEN}})\\\\]\\\\]`, \"g\");\n\n/** The structural shape of an inline `[[target|display]]` link.\n *  `target` is what the resolver / lint compares against page\n *  slugs; `display` is what the renderer shows to the user.\n *  When the user writes `[[foo]]` (no pipe), both fields hold\n *  `foo`. */\nexport interface WikiLink {\n  target: string;\n  display: string;\n}\n\n/** Split the raw text inside `[[...]]` into target + display.\n *\n *  - `[[foo|Bar Baz]]` → `{ target: \"foo\", display: \"Bar Baz\" }`\n *  - `[[foo]]`         → `{ target: \"foo\", display: \"foo\" }`\n *  - `[[|empty target]]` → `{ target: \"\", display: \"empty target\" }`\n *    (caller decides whether an empty target is meaningful;\n *    typically lint flags it, renderer shows the display text raw)\n *  - `[[foo|]]`        → `{ target: \"foo\", display: \"\" }`\n *    (same — caller decides)\n *\n *  Whitespace around the pipe is preserved on the display side\n *  (so the user can write `[[foo| ある記事 ]]` and get the\n *  spacing intentionally) but TRIMMED on the target side, since\n *  a slug-comparable target with leading/trailing whitespace is\n *  always a typo.\n *\n *  Only the FIRST pipe splits. `[[a|b|c]]` becomes\n *  `{ target: \"a\", display: \"b|c\" }` so display strings can\n *  legitimately contain a literal `|`. */\nexport function parseWikiLink(inner: string): WikiLink {\n  const pipeIdx = inner.indexOf(\"|\");\n  if (pipeIdx === -1) {\n    return { target: inner, display: inner };\n  }\n  const target = inner.slice(0, pipeIdx).trim();\n  const display = inner.slice(pipeIdx + 1);\n  return { target, display };\n}\n","// Pure parsers for `data/wiki/index.md` content. Used by:\n//   - server/api/routes/wiki.ts — page resolver + lint\n//   - frontend lint preview (future) — same parser, no fork\n//\n// All exports here are pure string ops; no `node:*` imports allowed.\n// If a future caller needs to walk the filesystem, that wrapper goes\n// under `@mulmoclaude/core/wiki/server` (today only `server/paths.ts`\n// touches `node:path`; nothing here touches disk).\n\nimport { parseWikiLink } from \"./link.js\";\nimport { wikiSlugify } from \"./slug.js\";\n\nexport interface WikiPageEntry {\n  title: string;\n  slug: string;\n  description: string;\n  tags: string[];\n}\n\n// ── Patterns ──────────────────────────────────────────────────\n// Bullet patterns live here (not server/utils/regex.ts) because the\n// index parser is the only consumer and the regexes are part of the\n// public surface that callers may want to reason about in tests.\n// Linear in line length: every `[^x]+` runs over a fixed exclusion\n// set with a hard delimiter; the optional summary group's `(.*)` is\n// a single greedy run with no nested overlap.\n\n// eslint-disable-next-line security/detect-unsafe-regex -- bullet-link parser; bounded captures with hard delimiters\nexport const BULLET_LINK_PATTERN = /^[-*]\\s+\\[([^\\]]+)\\]\\(([^)]*)\\)(?:\\s*[—–-]\\s*(.*))?/;\n// eslint-disable-next-line security/detect-unsafe-regex -- same shape as BULLET_LINK_PATTERN\nexport const BULLET_WIKI_LINK_PATTERN = /^[-*]\\s+\\[\\[([^\\]]+)\\]\\](?:\\s*[—–-]\\s*(.*))?/;\n\nconst TABLE_SEPARATOR_PATTERN = /^\\|[\\s|:-]+\\|$/;\n\n// Unicode-aware tag body: any letter or number in any script (so\n// Japanese / Chinese / Korean tags like `#クラウド` or `#可視化` work),\n// plus `-` and `_` as internal joiners. First char is a letter or\n// number only — no leading punctuation.\nconst HASHTAG_PATTERN = /(?:^|\\s)#([\\p{L}\\p{N}][\\p{L}\\p{N}_-]*)/gu;\n\n// ── Tag extraction ────────────────────────────────────────────\n\n/** Extract `#tag` tokens from a bullet description, returning the\n *  stripped description and a sorted, deduped, lowercased tag list.\n *  Only matches at word boundaries so mid-word `#` (e.g. anchor\n *  URLs) is left alone. */\nexport function extractHashTags(text: string): { description: string; tags: string[] } {\n  HASHTAG_PATTERN.lastIndex = 0;\n  const tags = [...text.matchAll(HASHTAG_PATTERN)].flatMap(([, tag]) => (tag ? [tag.toLowerCase()] : []));\n  const description = text.replace(HASHTAG_PATTERN, \"\").replace(/\\s+/g, \" \").trim();\n  const deduped = [...new Set(tags)].sort();\n  return { description, tags: deduped };\n}\n\n/** Split a table Tags cell — tolerates comma, whitespace, or `#`\n *  prefixes. Empty cell yields an empty list. */\nexport function parseTagsCell(cell: string): string[] {\n  const tokens = cell\n    .split(/[,\\s]+/)\n    .map((token) => token.trim().replace(/^#/, \"\").toLowerCase())\n    .filter((token) => token.length > 0);\n  return [...new Set(tokens)].sort();\n}\n\n// ── Table parser ──────────────────────────────────────────────\n\n/** Map header cell names → column indices, case- and whitespace-\n *  tolerant. Used by the row parser to locate the Tags column (and\n *  any other named column) without assuming a fixed position, so\n *  older 3- and 4-column tables keep working. */\nexport function buildTableColumnMap(headerRow: string): Map<string, number> {\n  const cells = headerRow\n    .split(\"|\")\n    .slice(1, -1)\n    // Mirror parseTableRow's cell-normalising: strip the surrounding\n    // backticks that commonly wrap cell values in wiki tables.\n    // Without this, a `| \\`tags\\` |` header maps to the key \"`tags`\"\n    // and the subsequent `columnMap.get(\"tags\")` lookup silently\n    // misses the column, falling back to `tags: []`.\n    .map((cell) => cell.trim().replace(/^`|`$/g, \"\").toLowerCase());\n  const map = new Map<string, number>();\n  cells.forEach((cell, i) => {\n    if (cell) map.set(cell, i);\n  });\n  return map;\n}\n\ninterface TableColumnIndices {\n  slug: number;\n  title: number;\n  summary: number;\n  /** Undefined when the table has no `tags` column — caller skips\n   *  the tags lookup entirely and the row gets `tags: []`. */\n  tags: number | undefined;\n}\n\n/** Resolve the per-column indices the row parser needs. Falls back\n *  to positional defaults (0/1/2) when the table has no header map.\n *  \"summary\" is the canonical column name; \"description\" is accepted\n *  as a legacy alias used by older fixtures. */\nfunction resolveTableColumnIndices(columnMap: Map<string, number> | null): TableColumnIndices {\n  return {\n    slug: columnMap?.get(\"slug\") ?? 0,\n    title: columnMap?.get(\"title\") ?? 1,\n    summary: columnMap?.get(\"summary\") ?? columnMap?.get(\"description\") ?? 2,\n    tags: columnMap?.get(\"tags\"),\n  };\n}\n\nfunction parseTableRow(trimmed: string, columnMap: Map<string, number> | null): WikiPageEntry | null {\n  const cols = trimmed\n    .split(\"|\")\n    .slice(1, -1)\n    .map((column) => column.trim().replace(/^`|`$/g, \"\"));\n  if (cols.length < 2) return null;\n\n  const idx = resolveTableColumnIndices(columnMap);\n  const slug = cols[idx.slug] ?? \"\";\n  const title = cols[idx.title] || slug;\n  if (!slug || !title) return null;\n\n  const description = cols[idx.summary] ?? \"\";\n  const tags = idx.tags !== undefined ? parseTagsCell(cols[idx.tags] ?? \"\") : [];\n  return { title, slug, description, tags };\n}\n\n// ── Bullet-row parsers ────────────────────────────────────────\n\n/** Extract the slug segment from a bullet link's href. Accepts the\n *  canonical `pages/<slug>.md`, a bare `<slug>.md`, or just `<slug>`\n *  — the three forms produced by different historical writers of\n *  index.md. Returns \"\" for hrefs that don't look like a wiki page\n *  reference (e.g. `https://example.com`) so the caller can fall\n *  back to title-based slugification. */\nexport function extractSlugFromBulletHref(rawHref: string): string {\n  const href = rawHref.trim();\n  if (!href) return \"\";\n  if (/^[a-z]+:\\/\\//i.test(href)) return \"\";\n  const lastSegment = href.split(\"/\").pop() ?? href;\n  return lastSegment.replace(/\\.md$/i, \"\");\n}\n\nfunction parseBulletLinkRow(trimmed: string): WikiPageEntry | null {\n  const match = BULLET_LINK_PATTERN.exec(trimmed);\n  if (!match) return null;\n  const title = match[1]?.trim() ?? \"\";\n  const href = match[2] ?? \"\";\n  const raw = match[3]?.trim() ?? \"\";\n  const { description, tags } = extractHashTags(raw);\n  // Prefer the slug embedded in the href so non-ASCII titles keep\n  // a navigable slug. Fall back to slugifying the title only when\n  // the href has no recognisable slug (rare — usually means the\n  // author put an external URL here).\n  const slug = extractSlugFromBulletHref(href) || wikiSlugify(title);\n  return { title, slug, description, tags };\n}\n\nfunction parseBulletWikiLinkRow(trimmed: string): WikiPageEntry | null {\n  const match = BULLET_WIKI_LINK_PATTERN.exec(trimmed);\n  if (!match) return null;\n  // Split `[[target|display]]` so the bullet entry's slug derives\n  // from the TARGET (which is already a slug-shaped identifier\n  // when the author wrote the alias form) and the title shows\n  // the DISPLAY half. Pre-#1297 the parser slugified the full\n  // `target|display` body, which collapses `|` to \"\" and\n  // produces a wrong slug — Codex review on PR #1312.\n  const { target, display } = parseWikiLink(match[1] ?? \"\");\n  const title = (display || target).trim();\n  const slug = target ? wikiSlugify(target) : wikiSlugify(title);\n  const raw = match[2]?.trim() ?? \"\";\n  const { description, tags } = extractHashTags(raw);\n  return { title, slug, description, tags };\n}\n\n// ── Top-level parser ──────────────────────────────────────────\n\n/** Parse entries from index.md. Supports three formats:\n *  1. Table: `| slug | Title | Summary | (Tags) |`\n *  2. Bullet link: `- [Title](pages/slug.md) — description`\n *  3. Wiki link: `- [[Title]] — description`\n *\n *  Returns entries in source order. Any unrecognised line is\n *  silently skipped — index.md is freeform markdown otherwise. */\nexport function parseIndexEntries(content: string): WikiPageEntry[] {\n  const entries: WikiPageEntry[] = [];\n  let inTable = false;\n  let columnMap: Map<string, number> | null = null;\n\n  for (const line of content.split(\"\\n\")) {\n    const trimmed = line.trim();\n\n    if (trimmed.startsWith(\"|\")) {\n      if (TABLE_SEPARATOR_PATTERN.test(trimmed)) {\n        inTable = true;\n        continue;\n      }\n      if (!inTable) {\n        // First `|`-line before the separator is the header. Capture\n        // the column map so parseTableRow can locate the Tags\n        // column (if any) by name rather than position.\n        columnMap = buildTableColumnMap(trimmed);\n        inTable = true;\n        continue;\n      }\n      const entry = parseTableRow(trimmed, columnMap);\n      if (entry) entries.push(entry);\n      continue;\n    }\n\n    inTable = false;\n    columnMap = null;\n\n    const bullet = parseBulletLinkRow(trimmed) ?? parseBulletWikiLinkRow(trimmed);\n    if (bullet) entries.push(bullet);\n  }\n  return entries;\n}\n","// Pure wiki lint rules.\n//\n// Each rule takes plain inputs (Sets, page-entry arrays, raw file\n// contents) so the whole pipeline can be unit-tested without\n// filesystem fixtures. The Express route at\n// `server/api/routes/wiki.ts` is a thin shell that reads the disk,\n// calls these rules, formats the result. A future frontend \"lint\n// preview before save\" would call the same functions over an\n// in-memory snapshot.\n\nimport type { WikiPageEntry } from \"./index-parse.js\";\nimport { WIKI_LINK_PATTERN, parseWikiLink } from \"./link.js\";\nimport { wikiSlugify } from \"./slug.js\";\n\n/** Files on disk that aren't referenced by index.md. */\nexport function findOrphanPages(fileSlugs: ReadonlySet<string>, indexedSlugs: ReadonlySet<string>): string[] {\n  const issues: string[] = [];\n  for (const slug of fileSlugs) {\n    if (!indexedSlugs.has(slug)) {\n      issues.push(`- **Orphan page**: \\`${slug}.md\\` exists but is missing from index.md`);\n    }\n  }\n  return issues;\n}\n\n/** Slugs referenced by index.md that have no corresponding file. */\nexport function findMissingFiles(pageEntries: readonly WikiPageEntry[], fileSlugs: ReadonlySet<string>): string[] {\n  const issues: string[] = [];\n  for (const entry of pageEntries) {\n    if (!fileSlugs.has(entry.slug)) {\n      issues.push(`- **Missing file**: index.md references \\`${entry.slug}\\` but the file does not exist`);\n    }\n  }\n  return issues;\n}\n\n/** Walk a page's body for `[[…]]` links and flag any whose\n *  resolved slug doesn't exist in the file set.\n *\n *  Critically: this routes through `parseWikiLink` so\n *  `[[slug|display]]` is split correctly — the lint slugifies the\n *  TARGET, not the full bracket body. Pre-#1297 the lint\n *  slugified the entire content (`slug|display`), which collapsed\n *  to a slug that always missed and produced ~168 false-positive\n *  \"broken link\" warnings. */\nexport function findBrokenLinksInPage(fileName: string, content: string, fileSlugs: ReadonlySet<string>): string[] {\n  const issues: string[] = [];\n  const matches = [...content.matchAll(WIKI_LINK_PATTERN)];\n  for (const [, body = \"\"] of matches) {\n    const { target } = parseWikiLink(body);\n    const linkSlug = wikiSlugify(target);\n    // Empty target is its own diagnostic — `[[|display]]` or\n    // `[[]]` slugifies to \"\" and would otherwise be flagged\n    // identically to a real broken link. Keep the original raw\n    // bracket body in the report so the user can grep their pages\n    // for the malformed link.\n    if (linkSlug.length === 0) {\n      issues.push(`- **Broken link** in \\`${fileName}\\`: [[${body}]] → empty target`);\n      continue;\n    }\n    if (!fileSlugs.has(linkSlug)) {\n      issues.push(`- **Broken link** in \\`${fileName}\\`: [[${body}]] → \\`${linkSlug}.md\\` not found`);\n    }\n  }\n  return issues;\n}\n\nfunction formatTagList(tags: readonly string[]): string {\n  return `[${[...tags].sort().join(\", \")}]`;\n}\n\n/** Flag any slug whose index.md tags differ from the page's own\n *  frontmatter `tags:` field. Comparison is set-based and order-\n *  insensitive; both sides are lowercased at parse time. Slugs\n *  missing from `frontmatterTagsBySlug` are ignored here — the\n *  missing file itself is already reported by `findMissingFiles`. */\nexport function findTagDrift(pageEntries: readonly WikiPageEntry[], frontmatterTagsBySlug: ReadonlyMap<string, readonly string[]>): string[] {\n  const issues: string[] = [];\n  for (const entry of pageEntries) {\n    // Lowercase on lookup — the caller keys the map with\n    // lowercased slugs, so a `MyPage.md` filename still matches\n    // an `entry.slug` of `mypage` produced by `wikiSlugify` on the\n    // wiki-link parser path.\n    const pageTags = frontmatterTagsBySlug.get(entry.slug.toLowerCase());\n    if (pageTags === undefined) continue;\n    const pageSet = new Set(pageTags);\n    const indexSet = new Set(entry.tags);\n    if (pageSet.size !== indexSet.size || [...pageSet].some((tag) => !indexSet.has(tag))) {\n      issues.push(`- **Tag drift**: \\`${entry.slug}.md\\` frontmatter has ${formatTagList(pageTags)} but index.md has ${formatTagList(entry.tags)}`);\n    }\n  }\n  return issues;\n}\n\n/** Render the final markdown report from the accumulated issues\n *  list. Empty input yields the \"wiki is healthy\" sentinel so the\n *  caller can write the same file every time without branching on\n *  presence. */\nexport function formatLintReport(issues: readonly string[]): string {\n  if (issues.length === 0) {\n    return \"# Wiki Lint Report\\n\\n✓ No issues found. Wiki is healthy.\";\n  }\n  const noun = `issue${issues.length !== 1 ? \"s\" : \"\"}`;\n  return `# Wiki Lint Report\\n\\n${issues.length} ${noun} found:\\n\\n${issues.join(\"\\n\")}`;\n}\n","// Pure builder for the wiki page→page link graph. Used by:\n//   - server/api/routes/wiki.ts — the `graph` action endpoint\n//   - src/plugins/wiki/View.vue — backlinks (\"linked references\") +\n//     the Graph tab\n//\n// All functions are pure string / collection ops; no `node:*` imports,\n// so the frontend bundle can import them directly (same discipline as\n// the sibling `link.ts` / `lint.ts` / `index-parse.ts` modules).\n//\n// NOTE: this is page→page link structure, distinct from the\n// `server/workspace/wiki-backlinks/` module, which appends *session*\n// backlinks (a page → the chat that edited it, #109). Different concept\n// — do not conflate.\n\nimport { WIKI_LINK_PATTERN, parseWikiLink } from \"./link.js\";\nimport { wikiSlugify } from \"./slug.js\";\nimport type { WikiPageEntry } from \"./index-parse.js\";\n\nexport interface WikiGraphNode {\n  slug: string;\n  title: string;\n}\n\nexport interface WikiGraphEdge {\n  from: string;\n  to: string;\n}\n\nexport interface WikiGraph {\n  nodes: WikiGraphNode[];\n  edges: WikiGraphEdge[];\n}\n\n/** One page's raw body plus its canonical (file-derived) slug. */\nexport interface WikiPageContent {\n  slug: string;\n  content: string;\n}\n\n/** Resolve a raw `[[link]]` target to an existing page slug, or null.\n *  Mirrors the route resolver's strategy: slugify first, then fall\n *  back to matching an index entry title so non-ASCII targets like\n *  `[[さくらインターネット]]` resolve to their ASCII file slug. */\nexport function resolveLinkTarget(target: string, fileSlugs: ReadonlySet<string>, slugByTitle: ReadonlyMap<string, string>): string | null {\n  const slug = wikiSlugify(target);\n  if (slug.length > 0 && fileSlugs.has(slug)) return slug;\n  const byTitle = slugByTitle.get(target.trim());\n  if (byTitle !== undefined && fileSlugs.has(byTitle)) return byTitle;\n  return null;\n}\n\n/** Resolved, deduped outgoing slugs for one page body. Self-links and\n *  links to non-existent pages are dropped (the latter are already a\n *  lint \"broken link\", not a graph edge). */\nexport function pageOutgoingSlugs(fromSlug: string, content: string, fileSlugs: ReadonlySet<string>, slugByTitle: ReadonlyMap<string, string>): string[] {\n  const out = new Set<string>();\n  for (const [, body = \"\"] of content.matchAll(WIKI_LINK_PATTERN)) {\n    const { target } = parseWikiLink(body);\n    const resolved = resolveLinkTarget(target, fileSlugs, slugByTitle);\n    if (resolved !== null && resolved !== fromSlug) out.add(resolved);\n  }\n  return [...out];\n}\n\nfunction buildTitleMaps(entries: readonly WikiPageEntry[]): { titleBySlug: Map<string, string>; slugByTitle: Map<string, string> } {\n  const titleBySlug = new Map<string, string>();\n  const slugByTitle = new Map<string, string>();\n  for (const entry of entries) {\n    if (!titleBySlug.has(entry.slug)) titleBySlug.set(entry.slug, entry.title);\n    if (entry.title.length > 0 && !slugByTitle.has(entry.title)) slugByTitle.set(entry.title, entry.slug);\n  }\n  return { titleBySlug, slugByTitle };\n}\n\n/** Build the full page→page graph. Nodes are the existing page files\n *  (titled from index.md, falling back to the slug for un-indexed\n *  pages); edges are the resolved `[[links]]`, deduped per (from,to). */\nexport function buildWikiGraph(pages: readonly WikiPageContent[], entries: readonly WikiPageEntry[]): WikiGraph {\n  const fileSlugs = new Set(pages.map((page) => page.slug));\n  const { titleBySlug, slugByTitle } = buildTitleMaps(entries);\n  const nodes: WikiGraphNode[] = pages.map((page) => ({ slug: page.slug, title: titleBySlug.get(page.slug) ?? page.slug }));\n  const edges: WikiGraphEdge[] = [];\n  const seen = new Set<string>();\n  for (const page of pages) {\n    for (const toSlug of pageOutgoingSlugs(page.slug, page.content, fileSlugs, slugByTitle)) {\n      // Newline cannot appear in a wiki slug, so it is a safe pair key.\n      const key = [page.slug, toSlug].join(\"\\n\");\n      if (seen.has(key)) continue;\n      seen.add(key);\n      edges.push({ from: page.slug, to: toSlug });\n    }\n  }\n  return { nodes, edges };\n}\n\n/** Pages that link TO `slug` (incoming edges), deduped, as nodes. */\nexport function incomingLinks(graph: WikiGraph, slug: string): WikiGraphNode[] {\n  const nodeBySlug = new Map(graph.nodes.map((node) => [node.slug, node]));\n  const result: WikiGraphNode[] = [];\n  const seen = new Set<string>();\n  for (const edge of graph.edges) {\n    if (edge.to !== slug || seen.has(edge.from)) continue;\n    seen.add(edge.from);\n    const node = nodeBySlug.get(edge.from);\n    if (node) result.push(node);\n  }\n  return result;\n}\n"],"mappings":";AA4BA,IAAa,oBAAoB,IAAI,OAAO,sCAAuD,GAAG;;;;;;;;;;;;;;;;;;;;AA+BtG,SAAgB,cAAc,OAAyB;CACrD,MAAM,UAAU,MAAM,QAAQ,GAAG;CACjC,IAAI,YAAY,IACd,OAAO;EAAE,QAAQ;EAAO,SAAS;CAAM;CAIzC,OAAO;EAAE,QAFM,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,KAE9B;EAAQ,SADD,MAAM,MAAM,UAAU,CACrB;CAAQ;AAC3B;;;ACvCA,IAAa,sBAAsB;AAEnC,IAAa,2BAA2B;AAExC,IAAM,0BAA0B;AAMhC,IAAM,kBAAkB;;;;;AAQxB,SAAgB,gBAAgB,MAAuD;CACrF,gBAAgB,YAAY;CAC5B,MAAM,OAAO,CAAC,GAAG,KAAK,SAAS,eAAe,CAAC,CAAC,CAAC,SAAS,GAAG,SAAU,MAAM,CAAC,IAAI,YAAY,CAAC,IAAI,CAAC,CAAE;CAGtG,OAAO;EAAE,aAFW,KAAK,QAAQ,iBAAiB,EAAE,CAAC,CAAC,QAAQ,QAAQ,GAAG,CAAC,CAAC,KAElE;EAAa,MADN,CAAC,GAAG,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,KACP;CAAQ;AACtC;;;AAIA,SAAgB,cAAc,MAAwB;CACpD,MAAM,SAAS,KACZ,MAAM,QAAQ,CAAC,CACf,KAAK,UAAU,MAAM,KAAK,CAAC,CAAC,QAAQ,MAAM,EAAE,CAAC,CAAC,YAAY,CAAC,CAAC,CAC5D,QAAQ,UAAU,MAAM,SAAS,CAAC;CACrC,OAAO,CAAC,GAAG,IAAI,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK;AACnC;;;;;AAQA,SAAgB,oBAAoB,WAAwC;CAC1E,MAAM,QAAQ,UACX,MAAM,GAAG,CAAC,CACV,MAAM,GAAG,EAAE,CAAC,CAMZ,KAAK,SAAS,KAAK,KAAK,CAAC,CAAC,QAAQ,UAAU,EAAE,CAAC,CAAC,YAAY,CAAC;CAChE,MAAM,sBAAM,IAAI,IAAoB;CACpC,MAAM,SAAS,MAAM,MAAM;EACzB,IAAI,MAAM,IAAI,IAAI,MAAM,CAAC;CAC3B,CAAC;CACD,OAAO;AACT;;;;;AAeA,SAAS,0BAA0B,WAA2D;CAC5F,OAAO;EACL,MAAM,WAAW,IAAI,MAAM,KAAK;EAChC,OAAO,WAAW,IAAI,OAAO,KAAK;EAClC,SAAS,WAAW,IAAI,SAAS,KAAK,WAAW,IAAI,aAAa,KAAK;EACvE,MAAM,WAAW,IAAI,MAAM;CAC7B;AACF;AAEA,SAAS,cAAc,SAAiB,WAA6D;CACnG,MAAM,OAAO,QACV,MAAM,GAAG,CAAC,CACV,MAAM,GAAG,EAAE,CAAC,CACZ,KAAK,WAAW,OAAO,KAAK,CAAC,CAAC,QAAQ,UAAU,EAAE,CAAC;CACtD,IAAI,KAAK,SAAS,GAAG,OAAO;CAE5B,MAAM,MAAM,0BAA0B,SAAS;CAC/C,MAAM,OAAO,KAAK,IAAI,SAAS;CAC/B,MAAM,QAAQ,KAAK,IAAI,UAAU;CACjC,IAAI,CAAC,QAAQ,CAAC,OAAO,OAAO;CAI5B,OAAO;EAAE;EAAO;EAAM,aAFF,KAAK,IAAI,YAAY;EAEN,MADtB,IAAI,SAAS,KAAA,IAAY,cAAc,KAAK,IAAI,SAAS,EAAE,IAAI,CAAC;CACrC;AAC1C;;;;;;;AAUA,SAAgB,0BAA0B,SAAyB;CACjE,MAAM,OAAO,QAAQ,KAAK;CAC1B,IAAI,CAAC,MAAM,OAAO;CAClB,IAAI,gBAAgB,KAAK,IAAI,GAAG,OAAO;CAEvC,QADoB,KAAK,MAAM,GAAG,CAAC,CAAC,IAAI,KAAK,KAAA,CAC1B,QAAQ,UAAU,EAAE;AACzC;AAEA,SAAS,mBAAmB,SAAuC;CACjE,MAAM,QAAQ,oBAAoB,KAAK,OAAO;CAC9C,IAAI,CAAC,OAAO,OAAO;CACnB,MAAM,QAAQ,MAAM,EAAE,EAAE,KAAK,KAAK;CAClC,MAAM,OAAO,MAAM,MAAM;CAEzB,MAAM,EAAE,aAAa,SAAS,gBADlB,MAAM,EAAE,EAAE,KAAK,KAAK,EACiB;CAMjD,OAAO;EAAE;EAAO,MADH,0BAA0B,IAAI,KAAK,aAAA,YAAY,KAAK;EAC3C;EAAa;CAAK;AAC1C;AAEA,SAAS,uBAAuB,SAAuC;CACrE,MAAM,QAAQ,yBAAyB,KAAK,OAAO;CACnD,IAAI,CAAC,OAAO,OAAO;CAOnB,MAAM,EAAE,QAAQ,YAAY,cAAc,MAAM,MAAM,EAAE;CACxD,MAAM,SAAS,WAAW,OAAA,CAAQ,KAAK;CACvC,MAAM,OAAO,SAAS,aAAA,YAAY,MAAM,IAAI,aAAA,YAAY,KAAK;CAE7D,MAAM,EAAE,aAAa,SAAS,gBADlB,MAAM,EAAE,EAAE,KAAK,KAAK,EACiB;CACjD,OAAO;EAAE;EAAO;EAAM;EAAa;CAAK;AAC1C;;;;;;;;AAWA,SAAgB,kBAAkB,SAAkC;CAClE,MAAM,UAA2B,CAAC;CAClC,IAAI,UAAU;CACd,IAAI,YAAwC;CAE5C,KAAK,MAAM,QAAQ,QAAQ,MAAM,IAAI,GAAG;EACtC,MAAM,UAAU,KAAK,KAAK;EAE1B,IAAI,QAAQ,WAAW,GAAG,GAAG;GAC3B,IAAI,wBAAwB,KAAK,OAAO,GAAG;IACzC,UAAU;IACV;GACF;GACA,IAAI,CAAC,SAAS;IAIZ,YAAY,oBAAoB,OAAO;IACvC,UAAU;IACV;GACF;GACA,MAAM,QAAQ,cAAc,SAAS,SAAS;GAC9C,IAAI,OAAO,QAAQ,KAAK,KAAK;GAC7B;EACF;EAEA,UAAU;EACV,YAAY;EAEZ,MAAM,SAAS,mBAAmB,OAAO,KAAK,uBAAuB,OAAO;EAC5E,IAAI,QAAQ,QAAQ,KAAK,MAAM;CACjC;CACA,OAAO;AACT;;;;ACzMA,SAAgB,gBAAgB,WAAgC,cAA6C;CAC3G,MAAM,SAAmB,CAAC;CAC1B,KAAK,MAAM,QAAQ,WACjB,IAAI,CAAC,aAAa,IAAI,IAAI,GACxB,OAAO,KAAK,wBAAwB,KAAK,0CAA0C;CAGvF,OAAO;AACT;;AAGA,SAAgB,iBAAiB,aAAuC,WAA0C;CAChH,MAAM,SAAmB,CAAC;CAC1B,KAAK,MAAM,SAAS,aAClB,IAAI,CAAC,UAAU,IAAI,MAAM,IAAI,GAC3B,OAAO,KAAK,6CAA6C,MAAM,KAAK,+BAA+B;CAGvG,OAAO;AACT;;;;;;;;;;AAWA,SAAgB,sBAAsB,UAAkB,SAAiB,WAA0C;CACjH,MAAM,SAAmB,CAAC;CAC1B,MAAM,UAAU,CAAC,GAAG,QAAQ,SAAS,iBAAiB,CAAC;CACvD,KAAK,MAAM,GAAG,OAAO,OAAO,SAAS;EACnC,MAAM,EAAE,WAAW,cAAc,IAAI;EACrC,MAAM,WAAW,aAAA,YAAY,MAAM;EAMnC,IAAI,SAAS,WAAW,GAAG;GACzB,OAAO,KAAK,0BAA0B,SAAS,QAAQ,KAAK,kBAAkB;GAC9E;EACF;EACA,IAAI,CAAC,UAAU,IAAI,QAAQ,GACzB,OAAO,KAAK,0BAA0B,SAAS,QAAQ,KAAK,SAAS,SAAS,gBAAgB;CAElG;CACA,OAAO;AACT;AAEA,SAAS,cAAc,MAAiC;CACtD,OAAO,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,IAAI,EAAE;AACzC;;;;;;AAOA,SAAgB,aAAa,aAAuC,uBAAyE;CAC3I,MAAM,SAAmB,CAAC;CAC1B,KAAK,MAAM,SAAS,aAAa;EAK/B,MAAM,WAAW,sBAAsB,IAAI,MAAM,KAAK,YAAY,CAAC;EACnE,IAAI,aAAa,KAAA,GAAW;EAC5B,MAAM,UAAU,IAAI,IAAI,QAAQ;EAChC,MAAM,WAAW,IAAI,IAAI,MAAM,IAAI;EACnC,IAAI,QAAQ,SAAS,SAAS,QAAQ,CAAC,GAAG,OAAO,CAAC,CAAC,MAAM,QAAQ,CAAC,SAAS,IAAI,GAAG,CAAC,GACjF,OAAO,KAAK,sBAAsB,MAAM,KAAK,wBAAwB,cAAc,QAAQ,EAAE,oBAAoB,cAAc,MAAM,IAAI,GAAG;CAEhJ;CACA,OAAO;AACT;;;;;AAMA,SAAgB,iBAAiB,QAAmC;CAClE,IAAI,OAAO,WAAW,GACpB,OAAO;CAET,MAAM,OAAO,QAAQ,OAAO,WAAW,IAAI,MAAM;CACjD,OAAO,yBAAyB,OAAO,OAAO,GAAG,KAAK,aAAa,OAAO,KAAK,IAAI;AACrF;;;;;;;AC7DA,SAAgB,kBAAkB,QAAgB,WAAgC,aAAyD;CACzI,MAAM,OAAO,aAAA,YAAY,MAAM;CAC/B,IAAI,KAAK,SAAS,KAAK,UAAU,IAAI,IAAI,GAAG,OAAO;CACnD,MAAM,UAAU,YAAY,IAAI,OAAO,KAAK,CAAC;CAC7C,IAAI,YAAY,KAAA,KAAa,UAAU,IAAI,OAAO,GAAG,OAAO;CAC5D,OAAO;AACT;;;;AAKA,SAAgB,kBAAkB,UAAkB,SAAiB,WAAgC,aAAoD;CACvJ,MAAM,sBAAM,IAAI,IAAY;CAC5B,KAAK,MAAM,GAAG,OAAO,OAAO,QAAQ,SAAS,iBAAiB,GAAG;EAC/D,MAAM,EAAE,WAAW,cAAc,IAAI;EACrC,MAAM,WAAW,kBAAkB,QAAQ,WAAW,WAAW;EACjE,IAAI,aAAa,QAAQ,aAAa,UAAU,IAAI,IAAI,QAAQ;CAClE;CACA,OAAO,CAAC,GAAG,GAAG;AAChB;AAEA,SAAS,eAAe,SAA2G;CACjI,MAAM,8BAAc,IAAI,IAAoB;CAC5C,MAAM,8BAAc,IAAI,IAAoB;CAC5C,KAAK,MAAM,SAAS,SAAS;EAC3B,IAAI,CAAC,YAAY,IAAI,MAAM,IAAI,GAAG,YAAY,IAAI,MAAM,MAAM,MAAM,KAAK;EACzE,IAAI,MAAM,MAAM,SAAS,KAAK,CAAC,YAAY,IAAI,MAAM,KAAK,GAAG,YAAY,IAAI,MAAM,OAAO,MAAM,IAAI;CACtG;CACA,OAAO;EAAE;EAAa;CAAY;AACpC;;;;AAKA,SAAgB,eAAe,OAAmC,SAA8C;CAC9G,MAAM,YAAY,IAAI,IAAI,MAAM,KAAK,SAAS,KAAK,IAAI,CAAC;CACxD,MAAM,EAAE,aAAa,gBAAgB,eAAe,OAAO;CAC3D,MAAM,QAAyB,MAAM,KAAK,UAAU;EAAE,MAAM,KAAK;EAAM,OAAO,YAAY,IAAI,KAAK,IAAI,KAAK,KAAK;CAAK,EAAE;CACxH,MAAM,QAAyB,CAAC;CAChC,MAAM,uBAAO,IAAI,IAAY;CAC7B,KAAK,MAAM,QAAQ,OACjB,KAAK,MAAM,UAAU,kBAAkB,KAAK,MAAM,KAAK,SAAS,WAAW,WAAW,GAAG;EAEvF,MAAM,MAAM,CAAC,KAAK,MAAM,MAAM,CAAC,CAAC,KAAK,IAAI;EACzC,IAAI,KAAK,IAAI,GAAG,GAAG;EACnB,KAAK,IAAI,GAAG;EACZ,MAAM,KAAK;GAAE,MAAM,KAAK;GAAM,IAAI;EAAO,CAAC;CAC5C;CAEF,OAAO;EAAE;EAAO;CAAM;AACxB;;AAGA,SAAgB,cAAc,OAAkB,MAA+B;CAC7E,MAAM,aAAa,IAAI,IAAI,MAAM,MAAM,KAAK,SAAS,CAAC,KAAK,MAAM,IAAI,CAAC,CAAC;CACvE,MAAM,SAA0B,CAAC;CACjC,MAAM,uBAAO,IAAI,IAAY;CAC7B,KAAK,MAAM,QAAQ,MAAM,OAAO;EAC9B,IAAI,KAAK,OAAO,QAAQ,KAAK,IAAI,KAAK,IAAI,GAAG;EAC7C,KAAK,IAAI,KAAK,IAAI;EAClB,MAAM,OAAO,WAAW,IAAI,KAAK,IAAI;EACrC,IAAI,MAAM,OAAO,KAAK,IAAI;CAC5B;CACA,OAAO;AACT"}

package/dist/{graph-BcwqiSpR.js → graph-Ce7xsDTt.js}

@@ -41,10 +41,8 @@ var HASHTAG_PATTERN = /(?:^|\s)#([\p{L}\p{N}][\p{L}\p{N}_-]*)/gu;
 *  Only matches at word boundaries so mid-word `#` (e.g. anchor
 *  URLs) is left alone. */
 function extractHashTags(text) {
-	const tags = [];
 	HASHTAG_PATTERN.lastIndex = 0;
-	let match;
-	while ((match = HASHTAG_PATTERN.exec(text)) !== null) tags.push(match[1].toLowerCase());
+	const tags = [...text.matchAll(HASHTAG_PATTERN)].flatMap(([, tag]) => tag ? [tag.toLowerCase()] : []);
 	return {
 		description: text.replace(HASHTAG_PATTERN, "").replace(/\s+/g, " ").trim(),
 		tags: [...new Set(tags)].sort()
@@ -109,7 +107,7 @@ function extractSlugFromBulletHref(rawHref) {
 function parseBulletLinkRow(trimmed) {
 	const match = BULLET_LINK_PATTERN.exec(trimmed);
 	if (!match) return null;
-	const title = match[1].trim();
+	const title = match[1]?.trim() ?? "";
 	const href = match[2] ?? "";
 	const { description, tags } = extractHashTags(match[3]?.trim() ?? "");
 	return {
@@ -122,7 +120,7 @@ function parseBulletLinkRow(trimmed) {
 function parseBulletWikiLinkRow(trimmed) {
 	const match = BULLET_WIKI_LINK_PATTERN.exec(trimmed);
 	if (!match) return null;
-	const { target, display } = parseWikiLink(match[1]);
+	const { target, display } = parseWikiLink(match[1] ?? "");
 	const title = (display || target).trim();
 	const slug = target ? wikiSlugify(target) : wikiSlugify(title);
 	const { description, tags } = extractHashTags(match[2]?.trim() ?? "");
@@ -193,14 +191,14 @@ function findMissingFiles(pageEntries, fileSlugs) {
 function findBrokenLinksInPage(fileName, content, fileSlugs) {
 	const issues = [];
 	const matches = [...content.matchAll(WIKI_LINK_PATTERN)];
-	for (const match of matches) {
-		const { target } = parseWikiLink(match[1]);
+	for (const [, body = ""] of matches) {
+		const { target } = parseWikiLink(body);
 		const linkSlug = wikiSlugify(target);
 		if (linkSlug.length === 0) {
-			issues.push(`- **Broken link** in \`${fileName}\`: [[${match[1]}]] → empty target`);
+			issues.push(`- **Broken link** in \`${fileName}\`: [[${body}]] → empty target`);
 			continue;
 		}
-		if (!fileSlugs.has(linkSlug)) issues.push(`- **Broken link** in \`${fileName}\`: [[${match[1]}]] → \`${linkSlug}.md\` not found`);
+		if (!fileSlugs.has(linkSlug)) issues.push(`- **Broken link** in \`${fileName}\`: [[${body}]] → \`${linkSlug}.md\` not found`);
 	}
 	return issues;
 }
@@ -250,8 +248,8 @@ function resolveLinkTarget(target, fileSlugs, slugByTitle) {
 *  lint "broken link", not a graph edge). */
 function pageOutgoingSlugs(fromSlug, content, fileSlugs, slugByTitle) {
 	const out = /* @__PURE__ */ new Set();
-	for (const match of content.matchAll(WIKI_LINK_PATTERN)) {
-		const { target } = parseWikiLink(match[1]);
+	for (const [, body = ""] of content.matchAll(WIKI_LINK_PATTERN)) {
+		const { target } = parseWikiLink(body);
 		const resolved = resolveLinkTarget(target, fileSlugs, slugByTitle);
 		if (resolved !== null && resolved !== fromSlug) out.add(resolved);
 	}
@@ -311,4 +309,4 @@ function incomingLinks(graph, slug) {
 //#endregion
 export { WIKI_LINK_PATTERN as _, findBrokenLinksInPage as a, findTagDrift as c, BULLET_WIKI_LINK_PATTERN as d, buildTableColumnMap as f, parseTagsCell as g, parseIndexEntries as h, resolveLinkTarget as i, formatLintReport as l, extractSlugFromBulletHref as m, incomingLinks as n, findMissingFiles as o, extractHashTags as p, pageOutgoingSlugs as r, findOrphanPages as s, buildWikiGraph as t, BULLET_LINK_PATTERN as u, parseWikiLink as v };
 
-//# sourceMappingURL=graph-BcwqiSpR.js.map
+//# sourceMappingURL=graph-Ce7xsDTt.js.map

package/dist/graph-Ce7xsDTt.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-Ce7xsDTt.js","names":[],"sources":["../src/wiki/link.ts","../src/wiki/index-parse.ts","../src/wiki/lint.ts","../src/wiki/graph.ts"],"sourcesContent":["// Pure helpers for `[[wiki-link]]` syntax. Used by the lint\n// (`server/api/routes/wiki.ts`), the page resolver, and the\n// frontend renderer (`src/plugins/wiki/helpers.ts`) — before this\n// module the three sites each had their own implementation and\n// none of them handled the `[[target|display]]` form, producing\n// false-positive \"broken link\" warnings on slug-aliased links\n// (issue #1297).\n//\n// All functions are pure string operations; safe to import from\n// browser bundles. No `node:*` imports anywhere in this file.\n\n/** Inline `[[...]]` link pattern. The capture group is the raw\n *  text between the brackets — the caller is expected to feed it\n *  through `parseWikiLink` to split off any `|display` suffix.\n *\n *  Body length is capped at 200 chars to keep the regex linear:\n *  catastrophic backtracking isn't possible (no nested\n *  alternation), but a malicious page with thousands of\n *  unmatched `[[` could still pin the CPU. 200 is well above the\n *  longest legitimate title we've seen and matches the cap the\n *  server-side `WIKI_LINK_PATTERN` constant has carried since the\n *  original implementation in #951.\n *\n *  Shared with the renderer's hand-rolled scanner so the two can't\n *  drift: the renderer must reject the same newline-bearing and\n *  over-length bodies, or a link would render clickable while the\n *  graph / backlinks / lint (which use this pattern) never see it. */\nexport const WIKI_LINK_MAX_LEN = 200;\nexport const WIKI_LINK_PATTERN = new RegExp(`\\\\[\\\\[([^\\\\][\\\\r\\\\n]{1,${WIKI_LINK_MAX_LEN}})\\\\]\\\\]`, \"g\");\n\n/** The structural shape of an inline `[[target|display]]` link.\n *  `target` is what the resolver / lint compares against page\n *  slugs; `display` is what the renderer shows to the user.\n *  When the user writes `[[foo]]` (no pipe), both fields hold\n *  `foo`. */\nexport interface WikiLink {\n  target: string;\n  display: string;\n}\n\n/** Split the raw text inside `[[...]]` into target + display.\n *\n *  - `[[foo|Bar Baz]]` → `{ target: \"foo\", display: \"Bar Baz\" }`\n *  - `[[foo]]`         → `{ target: \"foo\", display: \"foo\" }`\n *  - `[[|empty target]]` → `{ target: \"\", display: \"empty target\" }`\n *    (caller decides whether an empty target is meaningful;\n *    typically lint flags it, renderer shows the display text raw)\n *  - `[[foo|]]`        → `{ target: \"foo\", display: \"\" }`\n *    (same — caller decides)\n *\n *  Whitespace around the pipe is preserved on the display side\n *  (so the user can write `[[foo| ある記事 ]]` and get the\n *  spacing intentionally) but TRIMMED on the target side, since\n *  a slug-comparable target with leading/trailing whitespace is\n *  always a typo.\n *\n *  Only the FIRST pipe splits. `[[a|b|c]]` becomes\n *  `{ target: \"a\", display: \"b|c\" }` so display strings can\n *  legitimately contain a literal `|`. */\nexport function parseWikiLink(inner: string): WikiLink {\n  const pipeIdx = inner.indexOf(\"|\");\n  if (pipeIdx === -1) {\n    return { target: inner, display: inner };\n  }\n  const target = inner.slice(0, pipeIdx).trim();\n  const display = inner.slice(pipeIdx + 1);\n  return { target, display };\n}\n","// Pure parsers for `data/wiki/index.md` content. Used by:\n//   - server/api/routes/wiki.ts — page resolver + lint\n//   - frontend lint preview (future) — same parser, no fork\n//\n// All exports here are pure string ops; no `node:*` imports allowed.\n// If a future caller needs to walk the filesystem, that wrapper goes\n// under `@mulmoclaude/core/wiki/server` (today only `server/paths.ts`\n// touches `node:path`; nothing here touches disk).\n\nimport { parseWikiLink } from \"./link.js\";\nimport { wikiSlugify } from \"./slug.js\";\n\nexport interface WikiPageEntry {\n  title: string;\n  slug: string;\n  description: string;\n  tags: string[];\n}\n\n// ── Patterns ──────────────────────────────────────────────────\n// Bullet patterns live here (not server/utils/regex.ts) because the\n// index parser is the only consumer and the regexes are part of the\n// public surface that callers may want to reason about in tests.\n// Linear in line length: every `[^x]+` runs over a fixed exclusion\n// set with a hard delimiter; the optional summary group's `(.*)` is\n// a single greedy run with no nested overlap.\n\n// eslint-disable-next-line security/detect-unsafe-regex -- bullet-link parser; bounded captures with hard delimiters\nexport const BULLET_LINK_PATTERN = /^[-*]\\s+\\[([^\\]]+)\\]\\(([^)]*)\\)(?:\\s*[—–-]\\s*(.*))?/;\n// eslint-disable-next-line security/detect-unsafe-regex -- same shape as BULLET_LINK_PATTERN\nexport const BULLET_WIKI_LINK_PATTERN = /^[-*]\\s+\\[\\[([^\\]]+)\\]\\](?:\\s*[—–-]\\s*(.*))?/;\n\nconst TABLE_SEPARATOR_PATTERN = /^\\|[\\s|:-]+\\|$/;\n\n// Unicode-aware tag body: any letter or number in any script (so\n// Japanese / Chinese / Korean tags like `#クラウド` or `#可視化` work),\n// plus `-` and `_` as internal joiners. First char is a letter or\n// number only — no leading punctuation.\nconst HASHTAG_PATTERN = /(?:^|\\s)#([\\p{L}\\p{N}][\\p{L}\\p{N}_-]*)/gu;\n\n// ── Tag extraction ────────────────────────────────────────────\n\n/** Extract `#tag` tokens from a bullet description, returning the\n *  stripped description and a sorted, deduped, lowercased tag list.\n *  Only matches at word boundaries so mid-word `#` (e.g. anchor\n *  URLs) is left alone. */\nexport function extractHashTags(text: string): { description: string; tags: string[] } {\n  HASHTAG_PATTERN.lastIndex = 0;\n  const tags = [...text.matchAll(HASHTAG_PATTERN)].flatMap(([, tag]) => (tag ? [tag.toLowerCase()] : []));\n  const description = text.replace(HASHTAG_PATTERN, \"\").replace(/\\s+/g, \" \").trim();\n  const deduped = [...new Set(tags)].sort();\n  return { description, tags: deduped };\n}\n\n/** Split a table Tags cell — tolerates comma, whitespace, or `#`\n *  prefixes. Empty cell yields an empty list. */\nexport function parseTagsCell(cell: string): string[] {\n  const tokens = cell\n    .split(/[,\\s]+/)\n    .map((token) => token.trim().replace(/^#/, \"\").toLowerCase())\n    .filter((token) => token.length > 0);\n  return [...new Set(tokens)].sort();\n}\n\n// ── Table parser ──────────────────────────────────────────────\n\n/** Map header cell names → column indices, case- and whitespace-\n *  tolerant. Used by the row parser to locate the Tags column (and\n *  any other named column) without assuming a fixed position, so\n *  older 3- and 4-column tables keep working. */\nexport function buildTableColumnMap(headerRow: string): Map<string, number> {\n  const cells = headerRow\n    .split(\"|\")\n    .slice(1, -1)\n    // Mirror parseTableRow's cell-normalising: strip the surrounding\n    // backticks that commonly wrap cell values in wiki tables.\n    // Without this, a `| \\`tags\\` |` header maps to the key \"`tags`\"\n    // and the subsequent `columnMap.get(\"tags\")` lookup silently\n    // misses the column, falling back to `tags: []`.\n    .map((cell) => cell.trim().replace(/^`|`$/g, \"\").toLowerCase());\n  const map = new Map<string, number>();\n  cells.forEach((cell, i) => {\n    if (cell) map.set(cell, i);\n  });\n  return map;\n}\n\ninterface TableColumnIndices {\n  slug: number;\n  title: number;\n  summary: number;\n  /** Undefined when the table has no `tags` column — caller skips\n   *  the tags lookup entirely and the row gets `tags: []`. */\n  tags: number | undefined;\n}\n\n/** Resolve the per-column indices the row parser needs. Falls back\n *  to positional defaults (0/1/2) when the table has no header map.\n *  \"summary\" is the canonical column name; \"description\" is accepted\n *  as a legacy alias used by older fixtures. */\nfunction resolveTableColumnIndices(columnMap: Map<string, number> | null): TableColumnIndices {\n  return {\n    slug: columnMap?.get(\"slug\") ?? 0,\n    title: columnMap?.get(\"title\") ?? 1,\n    summary: columnMap?.get(\"summary\") ?? columnMap?.get(\"description\") ?? 2,\n    tags: columnMap?.get(\"tags\"),\n  };\n}\n\nfunction parseTableRow(trimmed: string, columnMap: Map<string, number> | null): WikiPageEntry | null {\n  const cols = trimmed\n    .split(\"|\")\n    .slice(1, -1)\n    .map((column) => column.trim().replace(/^`|`$/g, \"\"));\n  if (cols.length < 2) return null;\n\n  const idx = resolveTableColumnIndices(columnMap);\n  const slug = cols[idx.slug] ?? \"\";\n  const title = cols[idx.title] || slug;\n  if (!slug || !title) return null;\n\n  const description = cols[idx.summary] ?? \"\";\n  const tags = idx.tags !== undefined ? parseTagsCell(cols[idx.tags] ?? \"\") : [];\n  return { title, slug, description, tags };\n}\n\n// ── Bullet-row parsers ────────────────────────────────────────\n\n/** Extract the slug segment from a bullet link's href. Accepts the\n *  canonical `pages/<slug>.md`, a bare `<slug>.md`, or just `<slug>`\n *  — the three forms produced by different historical writers of\n *  index.md. Returns \"\" for hrefs that don't look like a wiki page\n *  reference (e.g. `https://example.com`) so the caller can fall\n *  back to title-based slugification. */\nexport function extractSlugFromBulletHref(rawHref: string): string {\n  const href = rawHref.trim();\n  if (!href) return \"\";\n  if (/^[a-z]+:\\/\\//i.test(href)) return \"\";\n  const lastSegment = href.split(\"/\").pop() ?? href;\n  return lastSegment.replace(/\\.md$/i, \"\");\n}\n\nfunction parseBulletLinkRow(trimmed: string): WikiPageEntry | null {\n  const match = BULLET_LINK_PATTERN.exec(trimmed);\n  if (!match) return null;\n  const title = match[1]?.trim() ?? \"\";\n  const href = match[2] ?? \"\";\n  const raw = match[3]?.trim() ?? \"\";\n  const { description, tags } = extractHashTags(raw);\n  // Prefer the slug embedded in the href so non-ASCII titles keep\n  // a navigable slug. Fall back to slugifying the title only when\n  // the href has no recognisable slug (rare — usually means the\n  // author put an external URL here).\n  const slug = extractSlugFromBulletHref(href) || wikiSlugify(title);\n  return { title, slug, description, tags };\n}\n\nfunction parseBulletWikiLinkRow(trimmed: string): WikiPageEntry | null {\n  const match = BULLET_WIKI_LINK_PATTERN.exec(trimmed);\n  if (!match) return null;\n  // Split `[[target|display]]` so the bullet entry's slug derives\n  // from the TARGET (which is already a slug-shaped identifier\n  // when the author wrote the alias form) and the title shows\n  // the DISPLAY half. Pre-#1297 the parser slugified the full\n  // `target|display` body, which collapses `|` to \"\" and\n  // produces a wrong slug — Codex review on PR #1312.\n  const { target, display } = parseWikiLink(match[1] ?? \"\");\n  const title = (display || target).trim();\n  const slug = target ? wikiSlugify(target) : wikiSlugify(title);\n  const raw = match[2]?.trim() ?? \"\";\n  const { description, tags } = extractHashTags(raw);\n  return { title, slug, description, tags };\n}\n\n// ── Top-level parser ──────────────────────────────────────────\n\n/** Parse entries from index.md. Supports three formats:\n *  1. Table: `| slug | Title | Summary | (Tags) |`\n *  2. Bullet link: `- [Title](pages/slug.md) — description`\n *  3. Wiki link: `- [[Title]] — description`\n *\n *  Returns entries in source order. Any unrecognised line is\n *  silently skipped — index.md is freeform markdown otherwise. */\nexport function parseIndexEntries(content: string): WikiPageEntry[] {\n  const entries: WikiPageEntry[] = [];\n  let inTable = false;\n  let columnMap: Map<string, number> | null = null;\n\n  for (const line of content.split(\"\\n\")) {\n    const trimmed = line.trim();\n\n    if (trimmed.startsWith(\"|\")) {\n      if (TABLE_SEPARATOR_PATTERN.test(trimmed)) {\n        inTable = true;\n        continue;\n      }\n      if (!inTable) {\n        // First `|`-line before the separator is the header. Capture\n        // the column map so parseTableRow can locate the Tags\n        // column (if any) by name rather than position.\n        columnMap = buildTableColumnMap(trimmed);\n        inTable = true;\n        continue;\n      }\n      const entry = parseTableRow(trimmed, columnMap);\n      if (entry) entries.push(entry);\n      continue;\n    }\n\n    inTable = false;\n    columnMap = null;\n\n    const bullet = parseBulletLinkRow(trimmed) ?? parseBulletWikiLinkRow(trimmed);\n    if (bullet) entries.push(bullet);\n  }\n  return entries;\n}\n","// Pure wiki lint rules.\n//\n// Each rule takes plain inputs (Sets, page-entry arrays, raw file\n// contents) so the whole pipeline can be unit-tested without\n// filesystem fixtures. The Express route at\n// `server/api/routes/wiki.ts` is a thin shell that reads the disk,\n// calls these rules, formats the result. A future frontend \"lint\n// preview before save\" would call the same functions over an\n// in-memory snapshot.\n\nimport type { WikiPageEntry } from \"./index-parse.js\";\nimport { WIKI_LINK_PATTERN, parseWikiLink } from \"./link.js\";\nimport { wikiSlugify } from \"./slug.js\";\n\n/** Files on disk that aren't referenced by index.md. */\nexport function findOrphanPages(fileSlugs: ReadonlySet<string>, indexedSlugs: ReadonlySet<string>): string[] {\n  const issues: string[] = [];\n  for (const slug of fileSlugs) {\n    if (!indexedSlugs.has(slug)) {\n      issues.push(`- **Orphan page**: \\`${slug}.md\\` exists but is missing from index.md`);\n    }\n  }\n  return issues;\n}\n\n/** Slugs referenced by index.md that have no corresponding file. */\nexport function findMissingFiles(pageEntries: readonly WikiPageEntry[], fileSlugs: ReadonlySet<string>): string[] {\n  const issues: string[] = [];\n  for (const entry of pageEntries) {\n    if (!fileSlugs.has(entry.slug)) {\n      issues.push(`- **Missing file**: index.md references \\`${entry.slug}\\` but the file does not exist`);\n    }\n  }\n  return issues;\n}\n\n/** Walk a page's body for `[[…]]` links and flag any whose\n *  resolved slug doesn't exist in the file set.\n *\n *  Critically: this routes through `parseWikiLink` so\n *  `[[slug|display]]` is split correctly — the lint slugifies the\n *  TARGET, not the full bracket body. Pre-#1297 the lint\n *  slugified the entire content (`slug|display`), which collapsed\n *  to a slug that always missed and produced ~168 false-positive\n *  \"broken link\" warnings. */\nexport function findBrokenLinksInPage(fileName: string, content: string, fileSlugs: ReadonlySet<string>): string[] {\n  const issues: string[] = [];\n  const matches = [...content.matchAll(WIKI_LINK_PATTERN)];\n  for (const [, body = \"\"] of matches) {\n    const { target } = parseWikiLink(body);\n    const linkSlug = wikiSlugify(target);\n    // Empty target is its own diagnostic — `[[|display]]` or\n    // `[[]]` slugifies to \"\" and would otherwise be flagged\n    // identically to a real broken link. Keep the original raw\n    // bracket body in the report so the user can grep their pages\n    // for the malformed link.\n    if (linkSlug.length === 0) {\n      issues.push(`- **Broken link** in \\`${fileName}\\`: [[${body}]] → empty target`);\n      continue;\n    }\n    if (!fileSlugs.has(linkSlug)) {\n      issues.push(`- **Broken link** in \\`${fileName}\\`: [[${body}]] → \\`${linkSlug}.md\\` not found`);\n    }\n  }\n  return issues;\n}\n\nfunction formatTagList(tags: readonly string[]): string {\n  return `[${[...tags].sort().join(\", \")}]`;\n}\n\n/** Flag any slug whose index.md tags differ from the page's own\n *  frontmatter `tags:` field. Comparison is set-based and order-\n *  insensitive; both sides are lowercased at parse time. Slugs\n *  missing from `frontmatterTagsBySlug` are ignored here — the\n *  missing file itself is already reported by `findMissingFiles`. */\nexport function findTagDrift(pageEntries: readonly WikiPageEntry[], frontmatterTagsBySlug: ReadonlyMap<string, readonly string[]>): string[] {\n  const issues: string[] = [];\n  for (const entry of pageEntries) {\n    // Lowercase on lookup — the caller keys the map with\n    // lowercased slugs, so a `MyPage.md` filename still matches\n    // an `entry.slug` of `mypage` produced by `wikiSlugify` on the\n    // wiki-link parser path.\n    const pageTags = frontmatterTagsBySlug.get(entry.slug.toLowerCase());\n    if (pageTags === undefined) continue;\n    const pageSet = new Set(pageTags);\n    const indexSet = new Set(entry.tags);\n    if (pageSet.size !== indexSet.size || [...pageSet].some((tag) => !indexSet.has(tag))) {\n      issues.push(`- **Tag drift**: \\`${entry.slug}.md\\` frontmatter has ${formatTagList(pageTags)} but index.md has ${formatTagList(entry.tags)}`);\n    }\n  }\n  return issues;\n}\n\n/** Render the final markdown report from the accumulated issues\n *  list. Empty input yields the \"wiki is healthy\" sentinel so the\n *  caller can write the same file every time without branching on\n *  presence. */\nexport function formatLintReport(issues: readonly string[]): string {\n  if (issues.length === 0) {\n    return \"# Wiki Lint Report\\n\\n✓ No issues found. Wiki is healthy.\";\n  }\n  const noun = `issue${issues.length !== 1 ? \"s\" : \"\"}`;\n  return `# Wiki Lint Report\\n\\n${issues.length} ${noun} found:\\n\\n${issues.join(\"\\n\")}`;\n}\n","// Pure builder for the wiki page→page link graph. Used by:\n//   - server/api/routes/wiki.ts — the `graph` action endpoint\n//   - src/plugins/wiki/View.vue — backlinks (\"linked references\") +\n//     the Graph tab\n//\n// All functions are pure string / collection ops; no `node:*` imports,\n// so the frontend bundle can import them directly (same discipline as\n// the sibling `link.ts` / `lint.ts` / `index-parse.ts` modules).\n//\n// NOTE: this is page→page link structure, distinct from the\n// `server/workspace/wiki-backlinks/` module, which appends *session*\n// backlinks (a page → the chat that edited it, #109). Different concept\n// — do not conflate.\n\nimport { WIKI_LINK_PATTERN, parseWikiLink } from \"./link.js\";\nimport { wikiSlugify } from \"./slug.js\";\nimport type { WikiPageEntry } from \"./index-parse.js\";\n\nexport interface WikiGraphNode {\n  slug: string;\n  title: string;\n}\n\nexport interface WikiGraphEdge {\n  from: string;\n  to: string;\n}\n\nexport interface WikiGraph {\n  nodes: WikiGraphNode[];\n  edges: WikiGraphEdge[];\n}\n\n/** One page's raw body plus its canonical (file-derived) slug. */\nexport interface WikiPageContent {\n  slug: string;\n  content: string;\n}\n\n/** Resolve a raw `[[link]]` target to an existing page slug, or null.\n *  Mirrors the route resolver's strategy: slugify first, then fall\n *  back to matching an index entry title so non-ASCII targets like\n *  `[[さくらインターネット]]` resolve to their ASCII file slug. */\nexport function resolveLinkTarget(target: string, fileSlugs: ReadonlySet<string>, slugByTitle: ReadonlyMap<string, string>): string | null {\n  const slug = wikiSlugify(target);\n  if (slug.length > 0 && fileSlugs.has(slug)) return slug;\n  const byTitle = slugByTitle.get(target.trim());\n  if (byTitle !== undefined && fileSlugs.has(byTitle)) return byTitle;\n  return null;\n}\n\n/** Resolved, deduped outgoing slugs for one page body. Self-links and\n *  links to non-existent pages are dropped (the latter are already a\n *  lint \"broken link\", not a graph edge). */\nexport function pageOutgoingSlugs(fromSlug: string, content: string, fileSlugs: ReadonlySet<string>, slugByTitle: ReadonlyMap<string, string>): string[] {\n  const out = new Set<string>();\n  for (const [, body = \"\"] of content.matchAll(WIKI_LINK_PATTERN)) {\n    const { target } = parseWikiLink(body);\n    const resolved = resolveLinkTarget(target, fileSlugs, slugByTitle);\n    if (resolved !== null && resolved !== fromSlug) out.add(resolved);\n  }\n  return [...out];\n}\n\nfunction buildTitleMaps(entries: readonly WikiPageEntry[]): { titleBySlug: Map<string, string>; slugByTitle: Map<string, string> } {\n  const titleBySlug = new Map<string, string>();\n  const slugByTitle = new Map<string, string>();\n  for (const entry of entries) {\n    if (!titleBySlug.has(entry.slug)) titleBySlug.set(entry.slug, entry.title);\n    if (entry.title.length > 0 && !slugByTitle.has(entry.title)) slugByTitle.set(entry.title, entry.slug);\n  }\n  return { titleBySlug, slugByTitle };\n}\n\n/** Build the full page→page graph. Nodes are the existing page files\n *  (titled from index.md, falling back to the slug for un-indexed\n *  pages); edges are the resolved `[[links]]`, deduped per (from,to). */\nexport function buildWikiGraph(pages: readonly WikiPageContent[], entries: readonly WikiPageEntry[]): WikiGraph {\n  const fileSlugs = new Set(pages.map((page) => page.slug));\n  const { titleBySlug, slugByTitle } = buildTitleMaps(entries);\n  const nodes: WikiGraphNode[] = pages.map((page) => ({ slug: page.slug, title: titleBySlug.get(page.slug) ?? page.slug }));\n  const edges: WikiGraphEdge[] = [];\n  const seen = new Set<string>();\n  for (const page of pages) {\n    for (const toSlug of pageOutgoingSlugs(page.slug, page.content, fileSlugs, slugByTitle)) {\n      // Newline cannot appear in a wiki slug, so it is a safe pair key.\n      const key = [page.slug, toSlug].join(\"\\n\");\n      if (seen.has(key)) continue;\n      seen.add(key);\n      edges.push({ from: page.slug, to: toSlug });\n    }\n  }\n  return { nodes, edges };\n}\n\n/** Pages that link TO `slug` (incoming edges), deduped, as nodes. */\nexport function incomingLinks(graph: WikiGraph, slug: string): WikiGraphNode[] {\n  const nodeBySlug = new Map(graph.nodes.map((node) => [node.slug, node]));\n  const result: WikiGraphNode[] = [];\n  const seen = new Set<string>();\n  for (const edge of graph.edges) {\n    if (edge.to !== slug || seen.has(edge.from)) continue;\n    seen.add(edge.from);\n    const node = nodeBySlug.get(edge.from);\n    if (node) result.push(node);\n  }\n  return result;\n}\n"],"mappings":";AA4BA,IAAa,oBAAoB,IAAI,OAAO,sCAAuD,GAAG;;;;;;;;;;;;;;;;;;;;AA+BtG,SAAgB,cAAc,OAAyB;CACrD,MAAM,UAAU,MAAM,QAAQ,GAAG;CACjC,IAAI,YAAY,IACd,OAAO;EAAE,QAAQ;EAAO,SAAS;CAAM;CAIzC,OAAO;EAAE,QAFM,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,KAE9B;EAAQ,SADD,MAAM,MAAM,UAAU,CACrB;CAAQ;AAC3B;;;ACvCA,IAAa,sBAAsB;AAEnC,IAAa,2BAA2B;AAExC,IAAM,0BAA0B;AAMhC,IAAM,kBAAkB;;;;;AAQxB,SAAgB,gBAAgB,MAAuD;CACrF,gBAAgB,YAAY;CAC5B,MAAM,OAAO,CAAC,GAAG,KAAK,SAAS,eAAe,CAAC,CAAC,CAAC,SAAS,GAAG,SAAU,MAAM,CAAC,IAAI,YAAY,CAAC,IAAI,CAAC,CAAE;CAGtG,OAAO;EAAE,aAFW,KAAK,QAAQ,iBAAiB,EAAE,CAAC,CAAC,QAAQ,QAAQ,GAAG,CAAC,CAAC,KAElE;EAAa,MADN,CAAC,GAAG,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,KACP;CAAQ;AACtC;;;AAIA,SAAgB,cAAc,MAAwB;CACpD,MAAM,SAAS,KACZ,MAAM,QAAQ,CAAC,CACf,KAAK,UAAU,MAAM,KAAK,CAAC,CAAC,QAAQ,MAAM,EAAE,CAAC,CAAC,YAAY,CAAC,CAAC,CAC5D,QAAQ,UAAU,MAAM,SAAS,CAAC;CACrC,OAAO,CAAC,GAAG,IAAI,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK;AACnC;;;;;AAQA,SAAgB,oBAAoB,WAAwC;CAC1E,MAAM,QAAQ,UACX,MAAM,GAAG,CAAC,CACV,MAAM,GAAG,EAAE,CAAC,CAMZ,KAAK,SAAS,KAAK,KAAK,CAAC,CAAC,QAAQ,UAAU,EAAE,CAAC,CAAC,YAAY,CAAC;CAChE,MAAM,sBAAM,IAAI,IAAoB;CACpC,MAAM,SAAS,MAAM,MAAM;EACzB,IAAI,MAAM,IAAI,IAAI,MAAM,CAAC;CAC3B,CAAC;CACD,OAAO;AACT;;;;;AAeA,SAAS,0BAA0B,WAA2D;CAC5F,OAAO;EACL,MAAM,WAAW,IAAI,MAAM,KAAK;EAChC,OAAO,WAAW,IAAI,OAAO,KAAK;EAClC,SAAS,WAAW,IAAI,SAAS,KAAK,WAAW,IAAI,aAAa,KAAK;EACvE,MAAM,WAAW,IAAI,MAAM;CAC7B;AACF;AAEA,SAAS,cAAc,SAAiB,WAA6D;CACnG,MAAM,OAAO,QACV,MAAM,GAAG,CAAC,CACV,MAAM,GAAG,EAAE,CAAC,CACZ,KAAK,WAAW,OAAO,KAAK,CAAC,CAAC,QAAQ,UAAU,EAAE,CAAC;CACtD,IAAI,KAAK,SAAS,GAAG,OAAO;CAE5B,MAAM,MAAM,0BAA0B,SAAS;CAC/C,MAAM,OAAO,KAAK,IAAI,SAAS;CAC/B,MAAM,QAAQ,KAAK,IAAI,UAAU;CACjC,IAAI,CAAC,QAAQ,CAAC,OAAO,OAAO;CAI5B,OAAO;EAAE;EAAO;EAAM,aAFF,KAAK,IAAI,YAAY;EAEN,MADtB,IAAI,SAAS,KAAA,IAAY,cAAc,KAAK,IAAI,SAAS,EAAE,IAAI,CAAC;CACrC;AAC1C;;;;;;;AAUA,SAAgB,0BAA0B,SAAyB;CACjE,MAAM,OAAO,QAAQ,KAAK;CAC1B,IAAI,CAAC,MAAM,OAAO;CAClB,IAAI,gBAAgB,KAAK,IAAI,GAAG,OAAO;CAEvC,QADoB,KAAK,MAAM,GAAG,CAAC,CAAC,IAAI,KAAK,KAAA,CAC1B,QAAQ,UAAU,EAAE;AACzC;AAEA,SAAS,mBAAmB,SAAuC;CACjE,MAAM,QAAQ,oBAAoB,KAAK,OAAO;CAC9C,IAAI,CAAC,OAAO,OAAO;CACnB,MAAM,QAAQ,MAAM,EAAE,EAAE,KAAK,KAAK;CAClC,MAAM,OAAO,MAAM,MAAM;CAEzB,MAAM,EAAE,aAAa,SAAS,gBADlB,MAAM,EAAE,EAAE,KAAK,KAAK,EACiB;CAMjD,OAAO;EAAE;EAAO,MADH,0BAA0B,IAAI,KAAK,YAAY,KAAK;EAC3C;EAAa;CAAK;AAC1C;AAEA,SAAS,uBAAuB,SAAuC;CACrE,MAAM,QAAQ,yBAAyB,KAAK,OAAO;CACnD,IAAI,CAAC,OAAO,OAAO;CAOnB,MAAM,EAAE,QAAQ,YAAY,cAAc,MAAM,MAAM,EAAE;CACxD,MAAM,SAAS,WAAW,OAAA,CAAQ,KAAK;CACvC,MAAM,OAAO,SAAS,YAAY,MAAM,IAAI,YAAY,KAAK;CAE7D,MAAM,EAAE,aAAa,SAAS,gBADlB,MAAM,EAAE,EAAE,KAAK,KAAK,EACiB;CACjD,OAAO;EAAE;EAAO;EAAM;EAAa;CAAK;AAC1C;;;;;;;;AAWA,SAAgB,kBAAkB,SAAkC;CAClE,MAAM,UAA2B,CAAC;CAClC,IAAI,UAAU;CACd,IAAI,YAAwC;CAE5C,KAAK,MAAM,QAAQ,QAAQ,MAAM,IAAI,GAAG;EACtC,MAAM,UAAU,KAAK,KAAK;EAE1B,IAAI,QAAQ,WAAW,GAAG,GAAG;GAC3B,IAAI,wBAAwB,KAAK,OAAO,GAAG;IACzC,UAAU;IACV;GACF;GACA,IAAI,CAAC,SAAS;IAIZ,YAAY,oBAAoB,OAAO;IACvC,UAAU;IACV;GACF;GACA,MAAM,QAAQ,cAAc,SAAS,SAAS;GAC9C,IAAI,OAAO,QAAQ,KAAK,KAAK;GAC7B;EACF;EAEA,UAAU;EACV,YAAY;EAEZ,MAAM,SAAS,mBAAmB,OAAO,KAAK,uBAAuB,OAAO;EAC5E,IAAI,QAAQ,QAAQ,KAAK,MAAM;CACjC;CACA,OAAO;AACT;;;;ACzMA,SAAgB,gBAAgB,WAAgC,cAA6C;CAC3G,MAAM,SAAmB,CAAC;CAC1B,KAAK,MAAM,QAAQ,WACjB,IAAI,CAAC,aAAa,IAAI,IAAI,GACxB,OAAO,KAAK,wBAAwB,KAAK,0CAA0C;CAGvF,OAAO;AACT;;AAGA,SAAgB,iBAAiB,aAAuC,WAA0C;CAChH,MAAM,SAAmB,CAAC;CAC1B,KAAK,MAAM,SAAS,aAClB,IAAI,CAAC,UAAU,IAAI,MAAM,IAAI,GAC3B,OAAO,KAAK,6CAA6C,MAAM,KAAK,+BAA+B;CAGvG,OAAO;AACT;;;;;;;;;;AAWA,SAAgB,sBAAsB,UAAkB,SAAiB,WAA0C;CACjH,MAAM,SAAmB,CAAC;CAC1B,MAAM,UAAU,CAAC,GAAG,QAAQ,SAAS,iBAAiB,CAAC;CACvD,KAAK,MAAM,GAAG,OAAO,OAAO,SAAS;EACnC,MAAM,EAAE,WAAW,cAAc,IAAI;EACrC,MAAM,WAAW,YAAY,MAAM;EAMnC,IAAI,SAAS,WAAW,GAAG;GACzB,OAAO,KAAK,0BAA0B,SAAS,QAAQ,KAAK,kBAAkB;GAC9E;EACF;EACA,IAAI,CAAC,UAAU,IAAI,QAAQ,GACzB,OAAO,KAAK,0BAA0B,SAAS,QAAQ,KAAK,SAAS,SAAS,gBAAgB;CAElG;CACA,OAAO;AACT;AAEA,SAAS,cAAc,MAAiC;CACtD,OAAO,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,IAAI,EAAE;AACzC;;;;;;AAOA,SAAgB,aAAa,aAAuC,uBAAyE;CAC3I,MAAM,SAAmB,CAAC;CAC1B,KAAK,MAAM,SAAS,aAAa;EAK/B,MAAM,WAAW,sBAAsB,IAAI,MAAM,KAAK,YAAY,CAAC;EACnE,IAAI,aAAa,KAAA,GAAW;EAC5B,MAAM,UAAU,IAAI,IAAI,QAAQ;EAChC,MAAM,WAAW,IAAI,IAAI,MAAM,IAAI;EACnC,IAAI,QAAQ,SAAS,SAAS,QAAQ,CAAC,GAAG,OAAO,CAAC,CAAC,MAAM,QAAQ,CAAC,SAAS,IAAI,GAAG,CAAC,GACjF,OAAO,KAAK,sBAAsB,MAAM,KAAK,wBAAwB,cAAc,QAAQ,EAAE,oBAAoB,cAAc,MAAM,IAAI,GAAG;CAEhJ;CACA,OAAO;AACT;;;;;AAMA,SAAgB,iBAAiB,QAAmC;CAClE,IAAI,OAAO,WAAW,GACpB,OAAO;CAET,MAAM,OAAO,QAAQ,OAAO,WAAW,IAAI,MAAM;CACjD,OAAO,yBAAyB,OAAO,OAAO,GAAG,KAAK,aAAa,OAAO,KAAK,IAAI;AACrF;;;;;;;AC7DA,SAAgB,kBAAkB,QAAgB,WAAgC,aAAyD;CACzI,MAAM,OAAO,YAAY,MAAM;CAC/B,IAAI,KAAK,SAAS,KAAK,UAAU,IAAI,IAAI,GAAG,OAAO;CACnD,MAAM,UAAU,YAAY,IAAI,OAAO,KAAK,CAAC;CAC7C,IAAI,YAAY,KAAA,KAAa,UAAU,IAAI,OAAO,GAAG,OAAO;CAC5D,OAAO;AACT;;;;AAKA,SAAgB,kBAAkB,UAAkB,SAAiB,WAAgC,aAAoD;CACvJ,MAAM,sBAAM,IAAI,IAAY;CAC5B,KAAK,MAAM,GAAG,OAAO,OAAO,QAAQ,SAAS,iBAAiB,GAAG;EAC/D,MAAM,EAAE,WAAW,cAAc,IAAI;EACrC,MAAM,WAAW,kBAAkB,QAAQ,WAAW,WAAW;EACjE,IAAI,aAAa,QAAQ,aAAa,UAAU,IAAI,IAAI,QAAQ;CAClE;CACA,OAAO,CAAC,GAAG,GAAG;AAChB;AAEA,SAAS,eAAe,SAA2G;CACjI,MAAM,8BAAc,IAAI,IAAoB;CAC5C,MAAM,8BAAc,IAAI,IAAoB;CAC5C,KAAK,MAAM,SAAS,SAAS;EAC3B,IAAI,CAAC,YAAY,IAAI,MAAM,IAAI,GAAG,YAAY,IAAI,MAAM,MAAM,MAAM,KAAK;EACzE,IAAI,MAAM,MAAM,SAAS,KAAK,CAAC,YAAY,IAAI,MAAM,KAAK,GAAG,YAAY,IAAI,MAAM,OAAO,MAAM,IAAI;CACtG;CACA,OAAO;EAAE;EAAa;CAAY;AACpC;;;;AAKA,SAAgB,eAAe,OAAmC,SAA8C;CAC9G,MAAM,YAAY,IAAI,IAAI,MAAM,KAAK,SAAS,KAAK,IAAI,CAAC;CACxD,MAAM,EAAE,aAAa,gBAAgB,eAAe,OAAO;CAC3D,MAAM,QAAyB,MAAM,KAAK,UAAU;EAAE,MAAM,KAAK;EAAM,OAAO,YAAY,IAAI,KAAK,IAAI,KAAK,KAAK;CAAK,EAAE;CACxH,MAAM,QAAyB,CAAC;CAChC,MAAM,uBAAO,IAAI,IAAY;CAC7B,KAAK,MAAM,QAAQ,OACjB,KAAK,MAAM,UAAU,kBAAkB,KAAK,MAAM,KAAK,SAAS,WAAW,WAAW,GAAG;EAEvF,MAAM,MAAM,CAAC,KAAK,MAAM,MAAM,CAAC,CAAC,KAAK,IAAI;EACzC,IAAI,KAAK,IAAI,GAAG,GAAG;EACnB,KAAK,IAAI,GAAG;EACZ,MAAM,KAAK;GAAE,MAAM,KAAK;GAAM,IAAI;EAAO,CAAC;CAC5C;CAEF,OAAO;EAAE;EAAO;CAAM;AACxB;;AAGA,SAAgB,cAAc,OAAkB,MAA+B;CAC7E,MAAM,aAAa,IAAI,IAAI,MAAM,MAAM,KAAK,SAAS,CAAC,KAAK,MAAM,IAAI,CAAC,CAAC;CACvE,MAAM,SAA0B,CAAC;CACjC,MAAM,uBAAO,IAAI,IAAY;CAC7B,KAAK,MAAM,QAAQ,MAAM,OAAO;EAC9B,IAAI,KAAK,OAAO,QAAQ,KAAK,IAAI,KAAK,IAAI,GAAG;EAC7C,KAAK,IAAI,KAAK,IAAI;EAClB,MAAM,OAAO,WAAW,IAAI,KAAK,IAAI;EACrC,IAAI,MAAM,OAAO,KAAK,IAAI;CAC5B;CACA,OAAO;AACT"}

package/dist/{ingestTypes-C7IJSqv4.cjs → ingestTypes-CPR-h-OZ.cjs}

@@ -1,4 +1,4 @@
-const require_calendarGrid = require("./calendarGrid-BQYqOCnF.cjs");
+const require_calendarGrid = require("./calendarGrid-p8K-7cuB.cjs");
 require("./collection/index.cjs");
 //#region src/feeds/ingestTypes.ts
 var AGENT_INGEST_KIND = "agent";
@@ -29,4 +29,4 @@ Object.defineProperty(exports, "isFeedSchedule", {
 	}
 });
 
-//# sourceMappingURL=ingestTypes-C7IJSqv4.cjs.map
+//# sourceMappingURL=ingestTypes-CPR-h-OZ.cjs.map

package/dist/{ingestTypes-C7IJSqv4.cjs.map → ingestTypes-CPR-h-OZ.cjs.map}

@@ -1 +1 @@
-{"version":3,"file":"ingestTypes-C7IJSqv4.cjs","names":[],"sources":["../src/feeds/ingestTypes.ts"],"sourcesContent":["// Declarative retrieval config for the \"Feeds\" mechanism. A Feed is a\n// CollectionSchema plus this `ingest` block, registered as data (NOT as\n// a skill) under `<workspace>/feeds/<slug>/schema.json`. The host's\n// retrieval engine reads it to periodically refill the collection's\n// records via the shared collections io layer.\n//\n// The ingest vocab (INGEST_KINDS / FEED_SCHEDULES + their literal-union types)\n// lives in the sibling `../collection` subpath alongside the schema contract, so\n// the package's schema validator can enforce it. Re-exported here so the feeds\n// engine's existing importers resolve them unchanged.\nimport { INGEST_KINDS, FEED_SCHEDULES, type IngestKind, type FeedSchedule } from \"../collection/index.js\";\n// Type-only: keeps zod out of this module's runtime graph (the feeds engine\n// imports it browser-free through `../collection`'s type surface).\nimport type { z } from \"zod\";\nimport type { AgentIngestZ, DeclarativeIngestZ } from \"../collection/core/schemaZ\";\n//\n// Two flavours: the declarative kinds (`rss`/`atom`/`http-json`) fetch-and-map,\n// and `agent` dispatches a hidden worker. The `code` kind (LLM-generated\n// deterministic transform) is still reserved for a future retriever.\n\n// The agent ingest kind. Defined HERE (not imported from `../collection`) on\n// purpose: the engine only needs the literal to branch, and re-importing it as a\n// VALUE keeps this module free of a value dependency on the collection vocab.\n// Core owns its own copy for the schema validator; this matches the same literal.\nexport const AGENT_INGEST_KIND = \"agent\" as const;\nexport type AgentIngestKind = typeof AGENT_INGEST_KIND;\n\nexport { INGEST_KINDS, FEED_SCHEDULES, type IngestKind, type FeedSchedule };\n\nconst FEED_SCHEDULE_SET: ReadonlySet<string> = new Set(FEED_SCHEDULES);\n\nexport function isFeedSchedule(value: unknown): value is FeedSchedule {\n  return typeof value === \"string\" && FEED_SCHEDULE_SET.has(value);\n}\n\n/** Default cap on stored records per feed when `ingest.maxItems` is\n *  omitted. Keeps high-volume feeds (news / podcasts) bounded. */\nexport const DEFAULT_FEED_MAX_ITEMS = 100;\n\n/** Declarative field map: target collection field name → source path\n *  into the raw item (dot/bracket path, e.g. `\"title\"` or\n *  `\"data.name\"`). */\nexport type IngestFieldMap = Record<string, string>;\n\n/** Declarative retrieval (`rss`/`atom`/`http-json`): the host fetches `url`\n *  and projects each item through `map` (target field → source path; a\n *  `http-json` feed may add `itemsAt`, a dot/bracket path to the items\n *  array; `idFrom` derives the primaryKey; `maxItems` caps stored records,\n *  default {@link DEFAULT_FEED_MAX_ITEMS}, `0` = keep everything). The\n *  canonical loose contract stays the minimal `CollectionIngest`; this\n *  feeds subtype is derived from the zod source of truth\n *  (`collection/core/schemaZ` `DeclarativeIngestZ`), so the engine and the\n *  schema validator can never drift. */\nexport type DeclarativeIngestSpec = z.infer<typeof DeclarativeIngestZ>;\n\n/** Agent-performed retrieval (`kind: \"agent\"`). No `url`/`map`: the host seeds\n *  a hidden background worker (origin `system`) in `role` with `template` + a\n *  summary of every record, and the worker edits the records itself via the\n *  collections io layer. Valid on any collection (primarily skill-backed).\n *  Derived from `AgentIngestZ` in `collection/core/schemaZ`. */\nexport type AgentIngestSpec = z.infer<typeof AgentIngestZ>;\n\n/** The `ingest` block carried on a `CollectionSchema`, discriminated on `kind`. */\nexport type IngestSpec = DeclarativeIngestSpec | AgentIngestSpec;\n"],"mappings":";;;AAwBA,IAAa,oBAAoB;AAKjC,IAAM,oBAAyC,IAAI,IAAI,qBAAA,cAAc;AAErE,SAAgB,eAAe,OAAuC;CACpE,OAAO,OAAO,UAAU,YAAY,kBAAkB,IAAI,KAAK;AACjE;;;AAIA,IAAa,yBAAyB"}
+{"version":3,"file":"ingestTypes-CPR-h-OZ.cjs","names":[],"sources":["../src/feeds/ingestTypes.ts"],"sourcesContent":["// Declarative retrieval config for the \"Feeds\" mechanism. A Feed is a\n// CollectionSchema plus this `ingest` block, registered as data (NOT as\n// a skill) under `<workspace>/feeds/<slug>/schema.json`. The host's\n// retrieval engine reads it to periodically refill the collection's\n// records via the shared collections io layer.\n//\n// The ingest vocab (INGEST_KINDS / FEED_SCHEDULES + their literal-union types)\n// lives in the sibling `../collection` subpath alongside the schema contract, so\n// the package's schema validator can enforce it. Re-exported here so the feeds\n// engine's existing importers resolve them unchanged.\nimport { INGEST_KINDS, FEED_SCHEDULES, type IngestKind, type FeedSchedule } from \"../collection/index.js\";\n// Type-only: keeps zod out of this module's runtime graph (the feeds engine\n// imports it browser-free through `../collection`'s type surface).\nimport type { z } from \"zod\";\nimport type { AgentIngestZ, DeclarativeIngestZ } from \"../collection/core/schemaZ\";\n//\n// Two flavours: the declarative kinds (`rss`/`atom`/`http-json`) fetch-and-map,\n// and `agent` dispatches a hidden worker. The `code` kind (LLM-generated\n// deterministic transform) is still reserved for a future retriever.\n\n// The agent ingest kind. Defined HERE (not imported from `../collection`) on\n// purpose: the engine only needs the literal to branch, and re-importing it as a\n// VALUE keeps this module free of a value dependency on the collection vocab.\n// Core owns its own copy for the schema validator; this matches the same literal.\nexport const AGENT_INGEST_KIND = \"agent\" as const;\nexport type AgentIngestKind = typeof AGENT_INGEST_KIND;\n\nexport { INGEST_KINDS, FEED_SCHEDULES, type IngestKind, type FeedSchedule };\n\nconst FEED_SCHEDULE_SET: ReadonlySet<string> = new Set(FEED_SCHEDULES);\n\nexport function isFeedSchedule(value: unknown): value is FeedSchedule {\n  return typeof value === \"string\" && FEED_SCHEDULE_SET.has(value);\n}\n\n/** Default cap on stored records per feed when `ingest.maxItems` is\n *  omitted. Keeps high-volume feeds (news / podcasts) bounded. */\nexport const DEFAULT_FEED_MAX_ITEMS = 100;\n\n/** Declarative field map: target collection field name → source path\n *  into the raw item (dot/bracket path, e.g. `\"title\"` or\n *  `\"data.name\"`). */\nexport type IngestFieldMap = Record<string, string>;\n\n/** Declarative retrieval (`rss`/`atom`/`http-json`): the host fetches `url`\n *  and projects each item through `map` (target field → source path; a\n *  `http-json` feed may add `itemsAt`, a dot/bracket path to the items\n *  array; `idFrom` derives the primaryKey; `maxItems` caps stored records,\n *  default {@link DEFAULT_FEED_MAX_ITEMS}, `0` = keep everything). The\n *  canonical loose contract stays the minimal `CollectionIngest`; this\n *  feeds subtype is derived from the zod source of truth\n *  (`collection/core/schemaZ` `DeclarativeIngestZ`), so the engine and the\n *  schema validator can never drift. */\nexport type DeclarativeIngestSpec = z.infer<typeof DeclarativeIngestZ>;\n\n/** Agent-performed retrieval (`kind: \"agent\"`). No `url`/`map`: the host seeds\n *  a hidden background worker (origin `system`) in `role` with `template` + a\n *  summary of every record, and the worker edits the records itself via the\n *  collections io layer. Valid on any collection (primarily skill-backed).\n *  Derived from `AgentIngestZ` in `collection/core/schemaZ`. */\nexport type AgentIngestSpec = z.infer<typeof AgentIngestZ>;\n\n/** The `ingest` block carried on a `CollectionSchema`, discriminated on `kind`. */\nexport type IngestSpec = DeclarativeIngestSpec | AgentIngestSpec;\n"],"mappings":";;;AAwBA,IAAa,oBAAoB;AAKjC,IAAM,oBAAyC,IAAI,IAAI,qBAAA,cAAc;AAErE,SAAgB,eAAe,OAAuC;CACpE,OAAO,OAAO,UAAU,YAAY,kBAAkB,IAAI,KAAK;AACjE;;;AAIA,IAAa,yBAAyB"}

package/dist/{ingestTypes-DmtDLRmt.js → ingestTypes-F2IJhOLJ.js}

@@ -1,4 +1,4 @@
-import { C as FEED_SCHEDULES } from "./calendarGrid-DivcNKkX.js";
+import { C as FEED_SCHEDULES } from "./calendarGrid-Csy2rpjp.js";
 import "./collection/index.js";
 //#region src/feeds/ingestTypes.ts
 var AGENT_INGEST_KIND = "agent";
@@ -12,4 +12,4 @@ var DEFAULT_FEED_MAX_ITEMS = 100;
 //#endregion
 export { DEFAULT_FEED_MAX_ITEMS as n, isFeedSchedule as r, AGENT_INGEST_KIND as t };
 
-//# sourceMappingURL=ingestTypes-DmtDLRmt.js.map
+//# sourceMappingURL=ingestTypes-F2IJhOLJ.js.map

package/dist/{ingestTypes-DmtDLRmt.js.map → ingestTypes-F2IJhOLJ.js.map}

@@ -1 +1 @@
-{"version":3,"file":"ingestTypes-DmtDLRmt.js","names":[],"sources":["../src/feeds/ingestTypes.ts"],"sourcesContent":["// Declarative retrieval config for the \"Feeds\" mechanism. A Feed is a\n// CollectionSchema plus this `ingest` block, registered as data (NOT as\n// a skill) under `<workspace>/feeds/<slug>/schema.json`. The host's\n// retrieval engine reads it to periodically refill the collection's\n// records via the shared collections io layer.\n//\n// The ingest vocab (INGEST_KINDS / FEED_SCHEDULES + their literal-union types)\n// lives in the sibling `../collection` subpath alongside the schema contract, so\n// the package's schema validator can enforce it. Re-exported here so the feeds\n// engine's existing importers resolve them unchanged.\nimport { INGEST_KINDS, FEED_SCHEDULES, type IngestKind, type FeedSchedule } from \"../collection/index.js\";\n// Type-only: keeps zod out of this module's runtime graph (the feeds engine\n// imports it browser-free through `../collection`'s type surface).\nimport type { z } from \"zod\";\nimport type { AgentIngestZ, DeclarativeIngestZ } from \"../collection/core/schemaZ\";\n//\n// Two flavours: the declarative kinds (`rss`/`atom`/`http-json`) fetch-and-map,\n// and `agent` dispatches a hidden worker. The `code` kind (LLM-generated\n// deterministic transform) is still reserved for a future retriever.\n\n// The agent ingest kind. Defined HERE (not imported from `../collection`) on\n// purpose: the engine only needs the literal to branch, and re-importing it as a\n// VALUE keeps this module free of a value dependency on the collection vocab.\n// Core owns its own copy for the schema validator; this matches the same literal.\nexport const AGENT_INGEST_KIND = \"agent\" as const;\nexport type AgentIngestKind = typeof AGENT_INGEST_KIND;\n\nexport { INGEST_KINDS, FEED_SCHEDULES, type IngestKind, type FeedSchedule };\n\nconst FEED_SCHEDULE_SET: ReadonlySet<string> = new Set(FEED_SCHEDULES);\n\nexport function isFeedSchedule(value: unknown): value is FeedSchedule {\n  return typeof value === \"string\" && FEED_SCHEDULE_SET.has(value);\n}\n\n/** Default cap on stored records per feed when `ingest.maxItems` is\n *  omitted. Keeps high-volume feeds (news / podcasts) bounded. */\nexport const DEFAULT_FEED_MAX_ITEMS = 100;\n\n/** Declarative field map: target collection field name → source path\n *  into the raw item (dot/bracket path, e.g. `\"title\"` or\n *  `\"data.name\"`). */\nexport type IngestFieldMap = Record<string, string>;\n\n/** Declarative retrieval (`rss`/`atom`/`http-json`): the host fetches `url`\n *  and projects each item through `map` (target field → source path; a\n *  `http-json` feed may add `itemsAt`, a dot/bracket path to the items\n *  array; `idFrom` derives the primaryKey; `maxItems` caps stored records,\n *  default {@link DEFAULT_FEED_MAX_ITEMS}, `0` = keep everything). The\n *  canonical loose contract stays the minimal `CollectionIngest`; this\n *  feeds subtype is derived from the zod source of truth\n *  (`collection/core/schemaZ` `DeclarativeIngestZ`), so the engine and the\n *  schema validator can never drift. */\nexport type DeclarativeIngestSpec = z.infer<typeof DeclarativeIngestZ>;\n\n/** Agent-performed retrieval (`kind: \"agent\"`). No `url`/`map`: the host seeds\n *  a hidden background worker (origin `system`) in `role` with `template` + a\n *  summary of every record, and the worker edits the records itself via the\n *  collections io layer. Valid on any collection (primarily skill-backed).\n *  Derived from `AgentIngestZ` in `collection/core/schemaZ`. */\nexport type AgentIngestSpec = z.infer<typeof AgentIngestZ>;\n\n/** The `ingest` block carried on a `CollectionSchema`, discriminated on `kind`. */\nexport type IngestSpec = DeclarativeIngestSpec | AgentIngestSpec;\n"],"mappings":";;;AAwBA,IAAa,oBAAoB;AAKjC,IAAM,oBAAyC,IAAI,IAAI,cAAc;AAErE,SAAgB,eAAe,OAAuC;CACpE,OAAO,OAAO,UAAU,YAAY,kBAAkB,IAAI,KAAK;AACjE;;;AAIA,IAAa,yBAAyB"}
+{"version":3,"file":"ingestTypes-F2IJhOLJ.js","names":[],"sources":["../src/feeds/ingestTypes.ts"],"sourcesContent":["// Declarative retrieval config for the \"Feeds\" mechanism. A Feed is a\n// CollectionSchema plus this `ingest` block, registered as data (NOT as\n// a skill) under `<workspace>/feeds/<slug>/schema.json`. The host's\n// retrieval engine reads it to periodically refill the collection's\n// records via the shared collections io layer.\n//\n// The ingest vocab (INGEST_KINDS / FEED_SCHEDULES + their literal-union types)\n// lives in the sibling `../collection` subpath alongside the schema contract, so\n// the package's schema validator can enforce it. Re-exported here so the feeds\n// engine's existing importers resolve them unchanged.\nimport { INGEST_KINDS, FEED_SCHEDULES, type IngestKind, type FeedSchedule } from \"../collection/index.js\";\n// Type-only: keeps zod out of this module's runtime graph (the feeds engine\n// imports it browser-free through `../collection`'s type surface).\nimport type { z } from \"zod\";\nimport type { AgentIngestZ, DeclarativeIngestZ } from \"../collection/core/schemaZ\";\n//\n// Two flavours: the declarative kinds (`rss`/`atom`/`http-json`) fetch-and-map,\n// and `agent` dispatches a hidden worker. The `code` kind (LLM-generated\n// deterministic transform) is still reserved for a future retriever.\n\n// The agent ingest kind. Defined HERE (not imported from `../collection`) on\n// purpose: the engine only needs the literal to branch, and re-importing it as a\n// VALUE keeps this module free of a value dependency on the collection vocab.\n// Core owns its own copy for the schema validator; this matches the same literal.\nexport const AGENT_INGEST_KIND = \"agent\" as const;\nexport type AgentIngestKind = typeof AGENT_INGEST_KIND;\n\nexport { INGEST_KINDS, FEED_SCHEDULES, type IngestKind, type FeedSchedule };\n\nconst FEED_SCHEDULE_SET: ReadonlySet<string> = new Set(FEED_SCHEDULES);\n\nexport function isFeedSchedule(value: unknown): value is FeedSchedule {\n  return typeof value === \"string\" && FEED_SCHEDULE_SET.has(value);\n}\n\n/** Default cap on stored records per feed when `ingest.maxItems` is\n *  omitted. Keeps high-volume feeds (news / podcasts) bounded. */\nexport const DEFAULT_FEED_MAX_ITEMS = 100;\n\n/** Declarative field map: target collection field name → source path\n *  into the raw item (dot/bracket path, e.g. `\"title\"` or\n *  `\"data.name\"`). */\nexport type IngestFieldMap = Record<string, string>;\n\n/** Declarative retrieval (`rss`/`atom`/`http-json`): the host fetches `url`\n *  and projects each item through `map` (target field → source path; a\n *  `http-json` feed may add `itemsAt`, a dot/bracket path to the items\n *  array; `idFrom` derives the primaryKey; `maxItems` caps stored records,\n *  default {@link DEFAULT_FEED_MAX_ITEMS}, `0` = keep everything). The\n *  canonical loose contract stays the minimal `CollectionIngest`; this\n *  feeds subtype is derived from the zod source of truth\n *  (`collection/core/schemaZ` `DeclarativeIngestZ`), so the engine and the\n *  schema validator can never drift. */\nexport type DeclarativeIngestSpec = z.infer<typeof DeclarativeIngestZ>;\n\n/** Agent-performed retrieval (`kind: \"agent\"`). No `url`/`map`: the host seeds\n *  a hidden background worker (origin `system`) in `role` with `template` + a\n *  summary of every record, and the worker edits the records itself via the\n *  collections io layer. Valid on any collection (primarily skill-backed).\n *  Derived from `AgentIngestZ` in `collection/core/schemaZ`. */\nexport type AgentIngestSpec = z.infer<typeof AgentIngestZ>;\n\n/** The `ingest` block carried on a `CollectionSchema`, discriminated on `kind`. */\nexport type IngestSpec = DeclarativeIngestSpec | AgentIngestSpec;\n"],"mappings":";;;AAwBA,IAAa,oBAAoB;AAKjC,IAAM,oBAAyC,IAAI,IAAI,cAAc;AAErE,SAAgB,eAAe,OAAuC;CACpE,OAAO,OAAO,UAAU,YAAY,kBAAkB,IAAI,KAAK;AACjE;;;AAIA,IAAa,yBAAyB"}

package/dist/notifier/index.cjs

@@ -1,5 +1,5 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const require_notifier = require("../notifier-Wc4M24Bi.cjs");
+const require_notifier = require("../notifier-CKFVVwDP.cjs");
 exports.HISTORY_CAP = require_notifier.HISTORY_CAP;
 exports.NOTIFIER_LIFECYCLES = require_notifier.NOTIFIER_LIFECYCLES;
 exports.NOTIFIER_LIMITS = require_notifier.NOTIFIER_LIMITS;

package/dist/notifier/index.js

@@ -1,2 +1,2 @@
-import { _ as HISTORY_CAP, a as get, c as listFor, d as publish, f as resetNotifier, g as validatePublishInput, h as NOTIFIER_LIMITS, i as configureNotifier, l as listHistory, m as updateForPlugin, n as clear, o as getForPlugin, p as setNotifierFilePaths, r as clearForPlugin, s as listAll, t as cancel, u as onEvent, v as NOTIFIER_LIFECYCLES, y as NOTIFIER_SEVERITIES } from "../notifier-Dxh8mEFh.js";
+import { _ as HISTORY_CAP, a as get, c as listFor, d as publish, f as resetNotifier, g as validatePublishInput, h as NOTIFIER_LIMITS, i as configureNotifier, l as listHistory, m as updateForPlugin, n as clear, o as getForPlugin, p as setNotifierFilePaths, r as clearForPlugin, s as listAll, t as cancel, u as onEvent, v as NOTIFIER_LIFECYCLES, y as NOTIFIER_SEVERITIES } from "../notifier-CQD8NljP.js";
 export { HISTORY_CAP, NOTIFIER_LIFECYCLES, NOTIFIER_LIMITS, NOTIFIER_SEVERITIES, cancel, clear, clearForPlugin, configureNotifier, get, getForPlugin, listAll, listFor, listHistory, onEvent, publish, resetNotifier, setNotifierFilePaths, updateForPlugin, validatePublishInput };

package/dist/notifier/types.d.ts

@@ -75,10 +75,10 @@ export interface PublishInput<TPluginData = unknown> {
     pluginPkg: string;
     severity: NotifierSeverity;
     title: string;
-    body?: string;
-    lifecycle?: NotifierLifecycle;
-    navigateTarget?: string;
-    pluginData?: TPluginData;
+    body?: string | undefined;
+    lifecycle?: NotifierLifecycle | undefined;
+    navigateTarget?: string | undefined;
+    pluginData?: TPluginData | undefined;
 }
 /** On-disk shape of `~/mulmoclaude/data/notifier/active.json`. Holds
  *  only entries that haven't been cleared or cancelled — the file is

package/dist/{notifier-Wc4M24Bi.cjs → notifier-CKFVVwDP.cjs}

@@ -233,33 +233,36 @@ function applyBatchMutations(batch, state) {
 	return batch.map((waiter) => {
 		try {
 			return {
-				ok: true,
-				outcome: waiter.mutate(state)
+				waiter,
+				result: {
+					ok: true,
+					outcome: waiter.mutate(state)
+				}
 			};
 		} catch (err) {
 			return {
-				ok: false,
-				error: err
+				waiter,
+				result: {
+					ok: false,
+					error: err
+				}
 			};
 		}
 	});
 }
-function collectEvents(results) {
+function collectEvents(settled) {
 	const events = [];
-	for (const result of results) if (result.ok && result.outcome !== null) events.push(result.outcome.event);
+	for (const { result } of settled) if (result.ok && result.outcome !== null) events.push(result.outcome.event);
 	return events;
 }
-function collectHistoryEntries(results) {
+function collectHistoryEntries(settled) {
 	const entries = [];
-	for (const result of results) if (result.ok && result.outcome !== null && result.outcome.historyEntry) entries.push(result.outcome.historyEntry);
+	for (const { result } of settled) if (result.ok && result.outcome !== null && result.outcome.historyEntry) entries.push(result.outcome.historyEntry);
 	return entries;
 }
-function settleBatch(batch, results) {
-	for (let index = 0; index < batch.length; index += 1) {
-		const result = results[index];
-		if (result.ok) batch[index].resolve();
-		else batch[index].reject(result.error);
-	}
+function settleBatch(settled) {
+	for (const { waiter, result } of settled) if (result.ok) waiter.resolve();
+	else waiter.reject(result.error);
 }
 function rejectBatch(batch, err) {
 	for (const waiter of batch) waiter.reject(err);
@@ -278,9 +281,9 @@ async function processBatch(batch) {
 		rejectBatch(batch, err);
 		return;
 	}
-	const results = applyBatchMutations(batch, state);
-	const events = collectEvents(results);
-	const historyEntries = collectHistoryEntries(results);
+	const settled = applyBatchMutations(batch, state);
+	const events = collectEvents(settled);
+	const historyEntries = collectHistoryEntries(settled);
 	if (events.length > 0) {
 		try {
 			await saveActive(requireWriteJson(), activeFilePath, state);
@@ -296,7 +299,7 @@ async function processBatch(batch) {
 		}
 		for (const event of events) emit(event);
 	}
-	settleBatch(batch, results);
+	settleBatch(settled);
 }
 async function drain() {
 	writing = true;
@@ -331,6 +334,17 @@ function buildHistoryEntry(entry, terminalType) {
 		terminalAt: (/* @__PURE__ */ new Date()).toISOString()
 	};
 }
+/** The optional half of a publish input, with unset keys left OUT rather than
+*  written as `undefined` — an entry is persisted and re-read through JSON,
+*  where an unset field carries no key at all. */
+function optionalPublishFields(input) {
+	return {
+		...input.lifecycle !== void 0 ? { lifecycle: input.lifecycle } : {},
+		...input.body !== void 0 ? { body: input.body } : {},
+		...input.navigateTarget !== void 0 ? { navigateTarget: input.navigateTarget } : {},
+		...input.pluginData !== void 0 ? { pluginData: input.pluginData } : {}
+	};
+}
 async function publish(input) {
 	const validationError = validatePublishInput(input);
 	if (validationError) throw new Error(`notifier.publish: ${validationError}`);
@@ -339,12 +353,9 @@ async function publish(input) {
 		id: entryId,
 		pluginPkg: input.pluginPkg,
 		severity: input.severity,
-		lifecycle: input.lifecycle,
 		title: input.title,
-		body: input.body,
-		navigateTarget: input.navigateTarget,
-		pluginData: input.pluginData,
-		createdAt: (/* @__PURE__ */ new Date()).toISOString()
+		createdAt: (/* @__PURE__ */ new Date()).toISOString(),
+		...optionalPublishFields(input)
 	};
 	await enqueue((state) => {
 		state.entries[entryId] = entry;
@@ -586,4 +597,4 @@ Object.defineProperty(exports, "validatePublishInput", {
 	}
 });
 
-//# sourceMappingURL=notifier-Wc4M24Bi.cjs.map
+//# sourceMappingURL=notifier-CKFVVwDP.cjs.map

package/dist/notifier-CKFVVwDP.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"notifier-CKFVVwDP.cjs","names":[],"sources":["../src/notifier/types.ts","../src/notifier/store.ts","../src/notifier/validate.ts","../src/notifier/engine.ts"],"sourcesContent":["// Notifier value types. Kept dependency-free (no node, no fs, no\n// pubsub) so the host's API-route layer and any future browser\n// consumer can validate inbound payloads against the same enum\n// constants the engine accepts without pulling in the engine's I/O.\n\n/** Two notification shapes, distinguished by who fires the close call:\n *\n *    `fyi`    — informational. The host (bell panel) clears it when the\n *               user dismisses the row. No deep-link target.\n *    `action` — pending obligation. The plugin clears it when the\n *               underlying domain state changes (the user paid the tax,\n *               viewed the digest, etc.). The bell row navigates to\n *               `navigateTarget` on click.\n *\n *  The engine reads `lifecycle` only to enforce two publish-time rules\n *  (everything downstream — pubsub fan-out, persistence, history — is\n *  lifecycle-blind):\n *\n *    1. `action` requires a non-empty `navigateTarget`. Without one,\n *       clicking the row does nothing and the entry is a degraded fyi.\n *    2. `action` cannot use `info` severity. A low-priority obligation\n *       is incoherent — fyi if it's a ping, `nudge`/`urgent` if it's a\n *       real obligation worth a landing page.\n *\n *  Both rules are mirrored in the HTTP layer so plugin-runtime callers\n *  and HTTP callers hit the same wall. */\nexport const NOTIFIER_LIFECYCLES = [\"fyi\", \"action\"] as const;\nexport type NotifierLifecycle = (typeof NOTIFIER_LIFECYCLES)[number];\n\n/** Severity drives badge color (gray / amber / red, worst-wins) and\n *  in a future iteration channel routing. Mostly stored verbatim by\n *  the engine; the one engine-visible interaction is the rule that\n *  `action` lifecycle cannot pair with `info` severity (see\n *  `NotifierLifecycle` above). */\nexport const NOTIFIER_SEVERITIES = [\"info\", \"nudge\", \"urgent\"] as const;\nexport type NotifierSeverity = (typeof NOTIFIER_SEVERITIES)[number];\n\nexport interface NotifierEntry<TPluginData = unknown> {\n  /** Engine-assigned UUID. Generated synchronously inside `publish()`\n   *  so the caller can use it before persistence completes. */\n  id: string;\n  /** Plugin namespace (e.g. `\"encore\"`, `\"debug__system\"`). The\n   *  engine never inspects it — used only for `listFor()` filtering\n   *  and as a UI grouping key. */\n  pluginPkg: string;\n  severity: NotifierSeverity;\n  lifecycle?: NotifierLifecycle;\n  title: string;\n  body?: string;\n  /** Optional in-app deep-link target (relative URL). The bell popup\n   *  routes here on row click, with `&notificationId=<id>` appended\n   *  so the landing page can identify which entry to clear. The\n   *  engine doesn't read this — it's a UI hint stored on the entry. */\n  navigateTarget?: string;\n  /** Opaque to the engine. Round-trips through JSON unchanged; only\n   *  the originating plugin's UI knows the shape. */\n  pluginData?: TPluginData;\n  /** ISO-8601 timestamp set at `publish()` time. */\n  createdAt: string;\n}\n\n/** A history entry — a `NotifierEntry` after it has been cleared or\n *  cancelled, with the terminal type and timestamp recorded. The\n *  bell popup's \"History\" section renders these read-only. */\nexport interface NotifierHistoryEntry<TPluginData = unknown> extends NotifierEntry<TPluginData> {\n  terminalType: \"cleared\" | \"cancelled\";\n  terminalAt: string;\n}\n\n/** Caller-supplied input for `publish()`. The engine fills in `id`\n *  and `createdAt`; everything else flows through verbatim.\n *\n *  Two publish-time rules apply to `action` lifecycle (see\n *  `NotifierLifecycle`):\n *\n *    - `navigateTarget` MUST be a non-empty string.\n *    - `severity` MUST NOT be `\"info\"`.\n *\n *  Violations cause `publish()` to throw. Currently expressed as\n *  runtime validation rather than a discriminated-union type, so the\n *  fields below are all individually optional / loose at the\n *  type-level. */\nexport interface PublishInput<TPluginData = unknown> {\n  pluginPkg: string;\n  severity: NotifierSeverity;\n  title: string;\n  body?: string | undefined;\n  lifecycle?: NotifierLifecycle | undefined;\n  navigateTarget?: string | undefined;\n  pluginData?: TPluginData | undefined;\n}\n\n/** On-disk shape of `~/mulmoclaude/data/notifier/active.json`. Holds\n *  only entries that haven't been cleared or cancelled — the file is\n *  a snapshot, not an event log. */\nexport interface NotifierFile {\n  entries: Record<string, NotifierEntry>;\n}\n\n/** On-disk shape of `~/mulmoclaude/data/notifier/history.json`. Array\n *  of terminated entries newest-first, capped at `HISTORY_CAP` with\n *  FIFO eviction (push at index 0, slice from the tail). */\nexport interface NotifierHistoryFile {\n  entries: NotifierHistoryEntry[];\n}\n\n/** History size cap. The bell popup's History section renders this\n *  many entries; older ones fall off when new terminations land. */\nexport const HISTORY_CAP = 50;\n\n/** Pub-sub event published on the host's notifier channel after every\n *  successful state change. Discriminated union — subscribers switch\n *  on `type` to keep TypeScript narrowing the rest of the payload.\n *\n *  `updated` carries the post-mutation entry — the receiver swaps\n *  the matching `id` in their local active set. Reserved for in-\n *  place edits via `updateForPlugin`; no history record is written\n *  because the entry is still active, just with refreshed content. */\nexport type NotifierEvent =\n  { type: \"published\"; entry: NotifierEntry } | { type: \"cleared\"; id: string } | { type: \"cancelled\"; id: string } | { type: \"updated\"; entry: NotifierEntry };\n","// Low-level file I/O for the notifier. Reads use node:fs directly;\n// writes go through an injected atomic-JSON writer (the host owns the\n// rename-based atomic write so it stays single-sourced with its other\n// writers). Kept separate from `engine.ts` so the path can be\n// overridden in tests without monkey-patching.\n\nimport { hasStringProp, isErrorWithCode, isRecord, isUnknownArray } from \"@mulmoclaude/common\";\nimport { promises as fsPromises } from \"node:fs\";\nimport {\n  NOTIFIER_LIFECYCLES,\n  NOTIFIER_SEVERITIES,\n  type NotifierEntry,\n  type NotifierFile,\n  type NotifierHistoryEntry,\n  type NotifierHistoryFile,\n} from \"./types.js\";\n\n/** Injected atomic JSON writer — the host's `writeJsonAtomic`. */\nexport type WriteJson = (filePath: string, data: unknown) => Promise<void>;\n\nconst TERMINAL_TYPES = [\"cleared\", \"cancelled\"] as const;\n\nfunction isOneOf<T extends string>(allowed: readonly T[], value: unknown): value is T {\n  return allowed.some((candidate) => candidate === value);\n}\n\nfunction isOptionalString(value: unknown): boolean {\n  return value === undefined || typeof value === \"string\";\n}\n\n// Checks every field `NotifierEntry` declares — `pluginData` is `unknown`,\n// so nothing is left unverified. A partial check would be an assertion\n// wearing a predicate's clothes.\nfunction isNotifierEntry(value: unknown): value is NotifierEntry {\n  return (\n    hasStringProp(value, \"id\") &&\n    hasStringProp(value, \"pluginPkg\") &&\n    hasStringProp(value, \"title\") &&\n    hasStringProp(value, \"createdAt\") &&\n    isOneOf(NOTIFIER_SEVERITIES, value.severity) &&\n    (value.lifecycle === undefined || isOneOf(NOTIFIER_LIFECYCLES, value.lifecycle)) &&\n    isOptionalString(value.body) &&\n    isOptionalString(value.navigateTarget)\n  );\n}\n\nfunction isNotifierHistoryEntry(value: unknown): value is NotifierHistoryEntry {\n  return isNotifierEntry(value) && hasStringProp(value, \"terminalAt\") && isOneOf(TERMINAL_TYPES, value.terminalType);\n}\n\n// `isRecord` rejects `null` and arrays, so `{ entries: [] }` and\n// `{ entries: null }` stay malformed instead of reading as \"no entries\" —\n// downstream `engine.get` / `list*` mutations assume a plain object.\nfunction isNotifierFile(value: unknown): value is NotifierFile {\n  return isRecord(value) && isRecord(value.entries) && Object.values(value.entries).every(isNotifierEntry);\n}\n\nfunction isNotifierHistoryFile(value: unknown): value is NotifierHistoryFile {\n  return isRecord(value) && isUnknownArray(value.entries) && value.entries.every(isNotifierHistoryEntry);\n}\n\n/** Parsed JSON, or `undefined` when the file doesn't exist yet (first\n *  ever call on a fresh workspace) — unambiguous as a sentinel because\n *  no JSON document parses to `undefined`. */\nasync function readJsonIfPresent(filePath: string): Promise<unknown> {\n  try {\n    return JSON.parse(await fsPromises.readFile(filePath, \"utf-8\"));\n  } catch (err) {\n    if (isErrorWithCode(err) && err.code === \"ENOENT\") return undefined;\n    throw err;\n  }\n}\n\n/** Read the active-entries file. Returns an empty store when the file\n *  doesn't exist yet. Any other read or parse failure throws — the\n *  caller has to decide whether to surface or recover, since silently\n *  treating \"malformed file\" as \"no entries\" would lose data. A rejected\n *  file is never rewritten, so it stays on disk intact for repair. */\nexport async function loadActive(filePath: string): Promise<NotifierFile> {\n  const parsed = await readJsonIfPresent(filePath);\n  if (parsed === undefined) return { entries: {} };\n  if (!isNotifierFile(parsed)) throw new Error(`notifier: malformed active.json at ${filePath}`);\n  return parsed;\n}\n\n/** Write the active-entries file via the injected atomic writer so a\n *  half-written file is never visible to readers. The caller serialises\n *  writes (engine.ts queues mutations) — this function makes no\n *  concurrency guarantees of its own. */\nexport async function saveActive(writeJson: WriteJson, filePath: string, state: NotifierFile): Promise<void> {\n  await writeJson(filePath, state);\n}\n\n/** Read the history file. Empty array on first run. Same parse-error\n *  policy as `loadActive`. */\nexport async function loadHistory(filePath: string): Promise<NotifierHistoryFile> {\n  const parsed = await readJsonIfPresent(filePath);\n  if (parsed === undefined) return { entries: [] };\n  if (!isNotifierHistoryFile(parsed)) throw new Error(`notifier: malformed history.json at ${filePath}`);\n  return parsed;\n}\n\nexport async function saveHistory(writeJson: WriteJson, filePath: string, state: NotifierHistoryFile): Promise<void> {\n  await writeJson(filePath, state);\n}\n","// Publish-input validation — pure, dependency-free. Shared by\n// `engine.publish` (throws on error) and the host's HTTP route\n// (returns 400 on error). Single source of truth so plugin-runtime\n// callers and HTTP callers can't drift.\n\nimport type { PublishInput } from \"./types.js\";\n\n/** Hard caps on publish-input fields. The engine reads each entry on\n *  every list/get call (no in-memory cache), so unbounded fields hurt\n *  every reader. Caps chosen to be generous for legitimate UX copy\n *  while bounding active.json growth: a notification fundamentally is\n *  a short blurb, not a document. */\nexport const NOTIFIER_LIMITS = {\n  titleMax: 200,\n  bodyMax: 4000,\n  navigateTargetMax: 1000,\n  pluginDataMaxBytes: 16 * 1024,\n} as const;\n\nfunction validateTitle(title: string): string | null {\n  if (typeof title !== \"string\" || title.length === 0) return \"title must be a non-empty string\";\n  if (title.length > NOTIFIER_LIMITS.titleMax) return `title exceeds max length of ${NOTIFIER_LIMITS.titleMax} chars`;\n  return null;\n}\n\nfunction validateBody(body: string | undefined): string | null {\n  if (body === undefined) return null;\n  if (body.length > NOTIFIER_LIMITS.bodyMax) return `body exceeds max length of ${NOTIFIER_LIMITS.bodyMax} chars`;\n  return null;\n}\n\nfunction validateNavigateTarget(target: string | undefined): string | null {\n  if (target === undefined) return null;\n  if (target.length === 0) return \"navigateTarget must be a non-empty relative path when set\";\n  if (target.length > NOTIFIER_LIMITS.navigateTargetMax) {\n    return `navigateTarget exceeds max length of ${NOTIFIER_LIMITS.navigateTargetMax} chars`;\n  }\n  // Must be a same-origin relative path. Reject schemes\n  // (`javascript:`, `https://...`) and scheme-relative URLs\n  // (`//evil.com/...`, which an `<a href>` would resolve to the\n  // attacker's origin). One leading \"/\" only.\n  if (!target.startsWith(\"/\") || target.startsWith(\"//\")) {\n    return \"navigateTarget must be a relative path beginning with a single '/' (no scheme, no '//')\";\n  }\n  return null;\n}\n\nfunction validatePluginData(pluginData: unknown): string | null {\n  if (pluginData === undefined) return null;\n  let serialized: string | undefined;\n  try {\n    serialized = JSON.stringify(pluginData);\n  } catch (err) {\n    return `pluginData is not JSON-serialisable: ${String(err)}`;\n  }\n  // `JSON.stringify` returns `undefined` for non-serialisable roots\n  // (e.g. a bare function or symbol). Treat that as a serialisation\n  // failure so it doesn't slip through as an empty-string size.\n  if (typeof serialized !== \"string\") return \"pluginData is not JSON-serialisable\";\n  if (serialized.length > NOTIFIER_LIMITS.pluginDataMaxBytes) {\n    return `pluginData JSON exceeds ${NOTIFIER_LIMITS.pluginDataMaxBytes} bytes`;\n  }\n  return null;\n}\n\nfunction validateActionCoherence(input: PublishInput): string | null {\n  if (input.lifecycle !== \"action\") return null;\n  if (input.severity === \"info\") {\n    return \"action lifecycle is incompatible with info severity (use fyi for low-priority pings)\";\n  }\n  if (typeof input.navigateTarget !== \"string\" || input.navigateTarget.length === 0) {\n    return \"action lifecycle requires a non-empty navigateTarget\";\n  }\n  return null;\n}\n\n/** Validate a `PublishInput`. Returns `null` if OK, or a\n *  human-readable error string. Order matters — shape/size errors are\n *  reported before lifecycle/severity coherence errors so the message\n *  the caller sees points at the most fundamental problem first. */\nexport function validatePublishInput(input: PublishInput): string | null {\n  return (\n    validateTitle(input.title) ??\n    validateBody(input.body) ??\n    validateNavigateTarget(input.navigateTarget) ??\n    validatePluginData(input.pluginData) ??\n    validateActionCoherence(input)\n  );\n}\n","// Notifier engine — single-process, two-file (active + history),\n// single-channel. Host-agnostic: file paths, the atomic JSON writer,\n// the pub-sub event sink, and the logger are all injected via\n// `configureNotifier` + `setNotifierFilePaths` so MulmoClaude and\n// MulmoTerminal share one notification engine over their own\n// workspaces and pub-sub fabrics.\n//\n// API surface: publish / clear / cancel / get / listFor / listAll /\n// listHistory (+ plugin-scoped variants). Mutations queue through a\n// writing-flag + waiter-queue coordinator so concurrent callers can't\n// race on the atomic write's rename. Reads bypass the queue (rename\n// atomicity makes half-reads impossible) and trade strict\n// linearisability for simpler code: the contract is \"after\n// `await publish(x)` resolves, subsequent reads see x\" — which holds\n// because `publish` awaits the persist before returning.\n//\n// `clear` / `cancel` push to history *before* removing from active.\n// History persistence is best-effort: if it fails, the active write\n// still wins and the failure is logged. Active is the source of\n// truth; history is an audit aid.\n\nimport type { MinimalLogger } from \"@mulmoclaude/common\";\nimport { randomUUID } from \"node:crypto\";\nimport { loadActive, loadHistory, saveActive, saveHistory, type WriteJson } from \"./store.js\";\nimport { validatePublishInput } from \"./validate.js\";\nimport {\n  HISTORY_CAP,\n  type NotifierEntry,\n  type NotifierEvent,\n  type NotifierFile,\n  type NotifierHistoryEntry,\n  type NotifierSeverity,\n  type PublishInput,\n} from \"./types.js\";\n\nexport { NOTIFIER_LIMITS, validatePublishInput } from \"./validate.js\";\n\n// ── Dependency injection ──────────────────────────────────────────\n\n/** Minimal logger the engine needs. The host passes its structured\n *  logger; absent one, failures are swallowed (the engine never throws\n *  on a fan-out/persist-best-effort path). */\nexport type NotifierLogger = Pick<MinimalLogger, \"warn\" | \"error\">;\n\nexport interface NotifierConfig {\n  /** Atomic JSON writer (the host's `writeJsonAtomic`). */\n  writeJson: WriteJson;\n  /** Fan-out sink — the host binds this to `pubsub.publish(channel, event)`. */\n  publishEvent: (event: NotifierEvent) => void;\n  /** Optional logger. */\n  log?: NotifierLogger;\n}\n\nconst NOOP_LOG: NotifierLogger = { warn: () => {}, error: () => {} };\n\nlet config: NotifierConfig | null = null;\nlet activeFilePath = \"\";\nlet historyFilePath = \"\";\n\nfunction logger(): NotifierLogger {\n  return config?.log ?? NOOP_LOG;\n}\n\n/** Wire the engine's I/O deps. Call once at startup, before the first\n *  mutation. Does NOT set file paths — those are set independently via\n *  `setNotifierFilePaths` so a host can bind production paths at module\n *  load and a test can override them without re-supplying the deps. */\nexport function configureNotifier(injected: NotifierConfig): void {\n  config = injected;\n}\n\n// ── In-process event listeners ────────────────────────────────────\n//\n// Separate from the socket.io pubsub so server-side adapters (macOS\n// push, future Encore) can react to state changes without going\n// through a websocket round-trip. The host's pubsub is fan-out-only\n// with no server-side subscribe, so this listener registry is the\n// in-process equivalent. Listeners run synchronously inside `emit`,\n// before the pubsub fan-out.\n\ntype NotifierEventListener = (event: NotifierEvent) => void;\nconst listeners: NotifierEventListener[] = [];\n\n/** Register an in-process listener for engine events. Returns an\n *  unsubscribe function the caller can use during teardown. */\nexport function onEvent(listener: NotifierEventListener): () => void {\n  listeners.push(listener);\n  return () => {\n    const idx = listeners.indexOf(listener);\n    if (idx >= 0) listeners.splice(idx, 1);\n  };\n}\n\nfunction emit(event: NotifierEvent): void {\n  // In-process fan-out first. Each listener is wrapped: a throwing\n  // listener must not poison the rest, and must not propagate out of\n  // `processBatch` and strand the still-unsettled waiters (their\n  // resolve/reject is called *after* this emit loop). Fan-out is\n  // best-effort by contract — losing one subscriber must not lose\n  // the write that already committed.\n  for (const listener of listeners) {\n    try {\n      listener(event);\n    } catch (err) {\n      logger().error(\"in-process listener failed\", { type: event.type, error: String(err) });\n    }\n  }\n  if (!config) {\n    logger().warn(\"emit before init\", { type: event.type });\n    return;\n  }\n  try {\n    config.publishEvent(event);\n  } catch (err) {\n    logger().error(\"emit failed\", { type: event.type, error: String(err) });\n  }\n}\n\n// ── Write coordinator ─────────────────────────────────────────────\n\n/** A mutation function applied to the in-memory state object during\n *  drain. Returns either:\n *\n *    - `null` — no state change (e.g., `clear` on an unknown id).\n *      The drainer skips the disk write and the emit if every\n *      mutation in a batch returned `null`.\n *    - `{ event, historyEntry? }` — state changed. The drainer emits\n *      the event after the active write succeeds, and prepends\n *      `historyEntry` to history (best-effort) when present.\n *\n *  Mutations MUST NOT modify state when returning `null`. Violating\n *  this invariant produces a write skip with stale on-disk state. */\ntype MutationOutcome = { event: NotifierEvent; historyEntry?: NotifierHistoryEntry } | null;\ntype Mutation = (state: NotifierFile) => MutationOutcome;\n\ninterface Waiter {\n  mutate: Mutation;\n  resolve: () => void;\n  reject: (err: unknown) => void;\n}\n\ntype MutationResult = { ok: true; outcome: MutationOutcome } | { ok: false; error: unknown };\n\nlet writing = false;\nlet waiters: Waiter[] = [];\n\n/** Point the engine at its active/history files. Resets the write\n *  queue, so callers must not have in-flight mutations. The host calls\n *  this once with the workspace paths; tests call it per-case with temp\n *  files. */\nexport function setNotifierFilePaths(paths: { active: string; history: string }): void {\n  activeFilePath = paths.active;\n  historyFilePath = paths.history;\n  writing = false;\n  waiters = [];\n}\n\n/** Test-only: clear config + queue so each suite starts clean. */\nexport function resetNotifier(): void {\n  config = null;\n  activeFilePath = \"\";\n  historyFilePath = \"\";\n  writing = false;\n  waiters = [];\n  listeners.length = 0;\n}\n\nfunction requireWriteJson(): WriteJson {\n  if (!config) throw new Error(\"notifier: configureNotifier() not called\");\n  return config.writeJson;\n}\n\n/** A waiter carried alongside the outcome of its own mutation, so settling can\n *  never pair a result with the wrong caller's promise. */\ninterface SettledMutation {\n  waiter: Waiter;\n  result: MutationResult;\n}\n\nfunction applyBatchMutations(batch: Waiter[], state: NotifierFile): SettledMutation[] {\n  return batch.map((waiter) => {\n    try {\n      return { waiter, result: { ok: true, outcome: waiter.mutate(state) } };\n    } catch (err) {\n      return { waiter, result: { ok: false, error: err } };\n    }\n  });\n}\n\nfunction collectEvents(settled: SettledMutation[]): NotifierEvent[] {\n  const events: NotifierEvent[] = [];\n  for (const { result } of settled) {\n    if (result.ok && result.outcome !== null) events.push(result.outcome.event);\n  }\n  return events;\n}\n\nfunction collectHistoryEntries(settled: SettledMutation[]): NotifierHistoryEntry[] {\n  const entries: NotifierHistoryEntry[] = [];\n  for (const { result } of settled) {\n    if (result.ok && result.outcome !== null && result.outcome.historyEntry) {\n      entries.push(result.outcome.historyEntry);\n    }\n  }\n  return entries;\n}\n\nfunction settleBatch(settled: SettledMutation[]): void {\n  // Resolves come AFTER any emits so subscribers see the event\n  // before the caller's `await` returns.\n  for (const { waiter, result } of settled) {\n    if (result.ok) waiter.resolve();\n    else waiter.reject(result.error);\n  }\n}\n\nfunction rejectBatch(batch: Waiter[], err: unknown): void {\n  for (const waiter of batch) waiter.reject(err);\n}\n\nasync function persistHistory(newEntries: NotifierHistoryEntry[]): Promise<void> {\n  const existing = await loadHistory(historyFilePath);\n  // Newest-first ordering: a batch contains terminations in arrival\n  // order; we want the last one to land at index 0 of history.\n  const merged = [...newEntries.slice().reverse(), ...existing.entries].slice(0, HISTORY_CAP);\n  await saveHistory(requireWriteJson(), historyFilePath, { entries: merged });\n}\n\nasync function processBatch(batch: Waiter[]): Promise<void> {\n  let state: NotifierFile;\n  try {\n    state = await loadActive(activeFilePath);\n  } catch (err) {\n    logger().error(\"load failed\", { error: String(err) });\n    rejectBatch(batch, err);\n    return;\n  }\n  const settled = applyBatchMutations(batch, state);\n  const events = collectEvents(settled);\n  const historyEntries = collectHistoryEntries(settled);\n\n  if (events.length > 0) {\n    try {\n      await saveActive(requireWriteJson(), activeFilePath, state);\n    } catch (err) {\n      logger().error(\"active write failed\", { error: String(err) });\n      rejectBatch(batch, err);\n      return;\n    }\n    if (historyEntries.length > 0) {\n      // Best-effort: active is the source of truth, history is an\n      // audit aid. A failed history write is logged but doesn't\n      // unwind the active commit.\n      try {\n        await persistHistory(historyEntries);\n      } catch (err) {\n        logger().error(\"history write failed\", { error: String(err) });\n      }\n    }\n    for (const event of events) emit(event);\n  }\n  settleBatch(settled);\n}\n\nasync function drain(): Promise<void> {\n  writing = true;\n  try {\n    while (waiters.length > 0) {\n      const batch = waiters;\n      waiters = [];\n      await processBatch(batch);\n    }\n  } finally {\n    writing = false;\n  }\n}\n\nfunction enqueue(mutate: Mutation): Promise<void> {\n  return new Promise<void>((resolve, reject) => {\n    waiters.push({ mutate, resolve, reject });\n    if (!writing) void drain();\n  });\n}\n\nfunction removeEntry(state: NotifierFile, entryId: string): NotifierFile[\"entries\"] {\n  // Object-rest excludes the key without invoking `delete`.\n  const { [entryId]: __removed, ...remaining } = state.entries;\n  return remaining;\n}\n\nfunction buildHistoryEntry(entry: NotifierEntry, terminalType: \"cleared\" | \"cancelled\"): NotifierHistoryEntry {\n  return { ...entry, terminalType, terminalAt: new Date().toISOString() };\n}\n\n// ── Public API ────────────────────────────────────────────────────\n\n/** The optional half of a publish input, with unset keys left OUT rather than\n *  written as `undefined` — an entry is persisted and re-read through JSON,\n *  where an unset field carries no key at all. */\nfunction optionalPublishFields<TPluginData>(input: PublishInput<TPluginData>): Partial<NotifierEntry<TPluginData>> {\n  return {\n    ...(input.lifecycle !== undefined ? { lifecycle: input.lifecycle } : {}),\n    ...(input.body !== undefined ? { body: input.body } : {}),\n    ...(input.navigateTarget !== undefined ? { navigateTarget: input.navigateTarget } : {}),\n    ...(input.pluginData !== undefined ? { pluginData: input.pluginData } : {}),\n  };\n}\n\nexport async function publish<TPluginData = unknown>(input: PublishInput<TPluginData>): Promise<{ id: string }> {\n  // Validate at the engine boundary so plugin-runtime callers and\n  // HTTP callers hit the same wall.\n  const validationError = validatePublishInput(input);\n  if (validationError) {\n    throw new Error(`notifier.publish: ${validationError}`);\n  }\n  const entryId = randomUUID();\n  const entry: NotifierEntry<TPluginData> = {\n    id: entryId,\n    pluginPkg: input.pluginPkg,\n    severity: input.severity,\n    title: input.title,\n    createdAt: new Date().toISOString(),\n    ...optionalPublishFields(input),\n  };\n  await enqueue((state) => {\n    state.entries[entryId] = entry;\n    return { event: { type: \"published\", entry } };\n  });\n  return { id: entryId };\n}\n\n/** Remove an active entry and record its terminal history. `clear`\n *  (user dismissed) and `cancel` (producer withdrew) differ only in the\n *  emitted event / history reason. No-op when the id is unknown. */\nasync function terminateEntry(entryId: string, reason: \"cleared\" | \"cancelled\"): Promise<void> {\n  await enqueue((state) => {\n    const entry = state.entries[entryId];\n    if (!entry) return null;\n    state.entries = removeEntry(state, entryId);\n    return {\n      event: reason === \"cleared\" ? { type: \"cleared\", id: entryId } : { type: \"cancelled\", id: entryId },\n      historyEntry: buildHistoryEntry(entry, reason),\n    };\n  });\n}\n\nexport async function clear(entryId: string): Promise<void> {\n  await terminateEntry(entryId, \"cleared\");\n}\n\nexport async function cancel(entryId: string): Promise<void> {\n  await terminateEntry(entryId, \"cancelled\");\n}\n\n/** In-place update for an active entry. Only the fields present on\n *  `patch` are rewritten; `id`, `pluginPkg`, `lifecycle`, and\n *  `createdAt` stay fixed. Emits a single `\"updated\"` event with the\n *  post-mutation entry — no history record is written because the\n *  entry is still active, just with refreshed content.\n *\n *  No-ops (no throw) when the id is unknown, the entry belongs to a\n *  different plugin, or the merged shape would violate\n *  `validatePublishInput`. The silent skip matches `clearForPlugin`'s\n *  isolation semantics; validation failures are logged for diagnosis. */\nexport async function updateForPlugin<TPluginData = unknown>(\n  pluginPkg: string,\n  entryId: string,\n  patch: {\n    severity?: NotifierSeverity;\n    title?: string;\n    body?: string;\n    navigateTarget?: string;\n    pluginData?: TPluginData;\n  },\n): Promise<void> {\n  await enqueue((state) => {\n    const entry = state.entries[entryId];\n    if (!entry) return null;\n    if (entry.pluginPkg !== pluginPkg) return null;\n    const next: NotifierEntry = {\n      ...entry,\n      ...(patch.severity !== undefined ? { severity: patch.severity } : {}),\n      ...(patch.title !== undefined ? { title: patch.title } : {}),\n      ...(patch.body !== undefined ? { body: patch.body } : {}),\n      ...(patch.navigateTarget !== undefined ? { navigateTarget: patch.navigateTarget } : {}),\n      ...(patch.pluginData !== undefined ? { pluginData: patch.pluginData } : {}),\n    };\n    // Re-validate the merged shape so an update can't degrade the\n    // entry below publish-time invariants.\n    const validationError = validatePublishInput({\n      pluginPkg: next.pluginPkg,\n      severity: next.severity,\n      title: next.title,\n      body: next.body,\n      lifecycle: next.lifecycle,\n      navigateTarget: next.navigateTarget,\n      pluginData: next.pluginData,\n    });\n    if (validationError) {\n      logger().warn(\"update rejected by validation\", { entryId, pluginPkg, error: validationError });\n      return null;\n    }\n    state.entries[entryId] = next;\n    return { event: { type: \"updated\", entry: next } };\n  });\n}\n\n/** Plugin-scoped point lookup. Returns the entry by id, but only if it\n *  belongs to the caller's plugin; otherwise undefined. Cross-plugin\n *  reads return undefined for isolation — same property as\n *  `clearForPlugin` / `updateForPlugin`. */\nexport async function getForPlugin(pluginPkg: string, entryId: string): Promise<NotifierEntry | undefined> {\n  const state = await loadActive(activeFilePath);\n  const entry = state.entries[entryId];\n  if (!entry) return undefined;\n  if (entry.pluginPkg !== pluginPkg) return undefined;\n  return entry;\n}\n\n/** Plugin-scoped clear. Same as `clear` but no-ops if the entry's\n *  `pluginPkg` doesn't match the caller's, so a plugin can't dismiss\n *  another plugin's notification by guessing or scraping its id. */\nexport async function clearForPlugin(pluginPkg: string, entryId: string): Promise<void> {\n  await enqueue((state) => {\n    const entry = state.entries[entryId];\n    if (!entry) return null;\n    if (entry.pluginPkg !== pluginPkg) return null;\n    state.entries = removeEntry(state, entryId);\n    return {\n      event: { type: \"cleared\", id: entryId },\n      historyEntry: buildHistoryEntry(entry, \"cleared\"),\n    };\n  });\n}\n\nexport async function get(entryId: string): Promise<NotifierEntry | undefined> {\n  const state = await loadActive(activeFilePath);\n  return state.entries[entryId];\n}\n\nexport async function listFor(pluginPkg: string): Promise<NotifierEntry[]> {\n  const state = await loadActive(activeFilePath);\n  return Object.values(state.entries).filter((entry) => entry.pluginPkg === pluginPkg);\n}\n\nexport async function listAll(): Promise<NotifierEntry[]> {\n  const state = await loadActive(activeFilePath);\n  return Object.values(state.entries);\n}\n\nexport async function listHistory(): Promise<NotifierHistoryEntry[]> {\n  const state = await loadHistory(historyFilePath);\n  return state.entries;\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;AA0BA,IAAa,sBAAsB,CAAC,OAAO,QAAQ;;;;;;AAQnD,IAAa,sBAAsB;CAAC;CAAQ;CAAS;AAAQ;;;AA0E7D,IAAa,cAAc;;;ACxF3B,IAAM,iBAAiB,CAAC,WAAW,WAAW;AAE9C,SAAS,QAA0B,SAAuB,OAA4B;CACpF,OAAO,QAAQ,MAAM,cAAc,cAAc,KAAK;AACxD;AAEA,SAAS,iBAAiB,OAAyB;CACjD,OAAO,UAAU,KAAA,KAAa,OAAO,UAAU;AACjD;AAKA,SAAS,gBAAgB,OAAwC;CAC/D,OACE,aAAA,cAAc,OAAO,IAAI,KACzB,aAAA,cAAc,OAAO,WAAW,KAChC,aAAA,cAAc,OAAO,OAAO,KAC5B,aAAA,cAAc,OAAO,WAAW,KAChC,QAAQ,qBAAqB,MAAM,QAAQ,MAC1C,MAAM,cAAc,KAAA,KAAa,QAAQ,qBAAqB,MAAM,SAAS,MAC9E,iBAAiB,MAAM,IAAI,KAC3B,iBAAiB,MAAM,cAAc;AAEzC;AAEA,SAAS,uBAAuB,OAA+C;CAC7E,OAAO,gBAAgB,KAAK,KAAK,aAAA,cAAc,OAAO,YAAY,KAAK,QAAQ,gBAAgB,MAAM,YAAY;AACnH;AAKA,SAAS,eAAe,OAAuC;CAC7D,OAAO,aAAA,SAAS,KAAK,KAAK,aAAA,SAAS,MAAM,OAAO,KAAK,OAAO,OAAO,MAAM,OAAO,CAAC,CAAC,MAAM,eAAe;AACzG;AAEA,SAAS,sBAAsB,OAA8C;CAC3E,OAAO,aAAA,SAAS,KAAK,KAAK,aAAA,eAAe,MAAM,OAAO,KAAK,MAAM,QAAQ,MAAM,sBAAsB;AACvG;;;;AAKA,eAAe,kBAAkB,UAAoC;CACnE,IAAI;EACF,OAAO,KAAK,MAAM,MAAM,QAAA,SAAW,SAAS,UAAU,OAAO,CAAC;CAChE,SAAS,KAAK;EACZ,IAAI,aAAA,gBAAgB,GAAG,KAAK,IAAI,SAAS,UAAU,OAAO,KAAA;EAC1D,MAAM;CACR;AACF;;;;;;AAOA,eAAsB,WAAW,UAAyC;CACxE,MAAM,SAAS,MAAM,kBAAkB,QAAQ;CAC/C,IAAI,WAAW,KAAA,GAAW,OAAO,EAAE,SAAS,CAAC,EAAE;CAC/C,IAAI,CAAC,eAAe,MAAM,GAAG,MAAM,IAAI,MAAM,sCAAsC,UAAU;CAC7F,OAAO;AACT;;;;;AAMA,eAAsB,WAAW,WAAsB,UAAkB,OAAoC;CAC3G,MAAM,UAAU,UAAU,KAAK;AACjC;;;AAIA,eAAsB,YAAY,UAAgD;CAChF,MAAM,SAAS,MAAM,kBAAkB,QAAQ;CAC/C,IAAI,WAAW,KAAA,GAAW,OAAO,EAAE,SAAS,CAAC,EAAE;CAC/C,IAAI,CAAC,sBAAsB,MAAM,GAAG,MAAM,IAAI,MAAM,uCAAuC,UAAU;CACrG,OAAO;AACT;AAEA,eAAsB,YAAY,WAAsB,UAAkB,OAA2C;CACnH,MAAM,UAAU,UAAU,KAAK;AACjC;;;;;;;;AC5FA,IAAa,kBAAkB;CAC7B,UAAU;CACV,SAAS;CACT,mBAAmB;CACnB,oBAAoB,KAAK;AAC3B;AAEA,SAAS,cAAc,OAA8B;CACnD,IAAI,OAAO,UAAU,YAAY,MAAM,WAAW,GAAG,OAAO;CAC5D,IAAI,MAAM,SAAS,gBAAgB,UAAU,OAAO,+BAA+B,gBAAgB,SAAS;CAC5G,OAAO;AACT;AAEA,SAAS,aAAa,MAAyC;CAC7D,IAAI,SAAS,KAAA,GAAW,OAAO;CAC/B,IAAI,KAAK,SAAS,gBAAgB,SAAS,OAAO,8BAA8B,gBAAgB,QAAQ;CACxG,OAAO;AACT;AAEA,SAAS,uBAAuB,QAA2C;CACzE,IAAI,WAAW,KAAA,GAAW,OAAO;CACjC,IAAI,OAAO,WAAW,GAAG,OAAO;CAChC,IAAI,OAAO,SAAS,gBAAgB,mBAClC,OAAO,wCAAwC,gBAAgB,kBAAkB;CAMnF,IAAI,CAAC,OAAO,WAAW,GAAG,KAAK,OAAO,WAAW,IAAI,GACnD,OAAO;CAET,OAAO;AACT;AAEA,SAAS,mBAAmB,YAAoC;CAC9D,IAAI,eAAe,KAAA,GAAW,OAAO;CACrC,IAAI;CACJ,IAAI;EACF,aAAa,KAAK,UAAU,UAAU;CACxC,SAAS,KAAK;EACZ,OAAO,wCAAwC,OAAO,GAAG;CAC3D;CAIA,IAAI,OAAO,eAAe,UAAU,OAAO;CAC3C,IAAI,WAAW,SAAS,gBAAgB,oBACtC,OAAO,2BAA2B,gBAAgB,mBAAmB;CAEvE,OAAO;AACT;AAEA,SAAS,wBAAwB,OAAoC;CACnE,IAAI,MAAM,cAAc,UAAU,OAAO;CACzC,IAAI,MAAM,aAAa,QACrB,OAAO;CAET,IAAI,OAAO,MAAM,mBAAmB,YAAY,MAAM,eAAe,WAAW,GAC9E,OAAO;CAET,OAAO;AACT;;;;;AAMA,SAAgB,qBAAqB,OAAoC;CACvE,OACE,cAAc,MAAM,KAAK,KACzB,aAAa,MAAM,IAAI,KACvB,uBAAuB,MAAM,cAAc,KAC3C,mBAAmB,MAAM,UAAU,KACnC,wBAAwB,KAAK;AAEjC;;;ACnCA,IAAM,WAA2B;CAAE,YAAY,CAAC;CAAG,aAAa,CAAC;AAAE;AAEnE,IAAI,SAAgC;AACpC,IAAI,iBAAiB;AACrB,IAAI,kBAAkB;AAEtB,SAAS,SAAyB;CAChC,OAAO,QAAQ,OAAO;AACxB;;;;;AAMA,SAAgB,kBAAkB,UAAgC;CAChE,SAAS;AACX;AAYA,IAAM,YAAqC,CAAC;;;AAI5C,SAAgB,QAAQ,UAA6C;CACnE,UAAU,KAAK,QAAQ;CACvB,aAAa;EACX,MAAM,MAAM,UAAU,QAAQ,QAAQ;EACtC,IAAI,OAAO,GAAG,UAAU,OAAO,KAAK,CAAC;CACvC;AACF;AAEA,SAAS,KAAK,OAA4B;CAOxC,KAAK,MAAM,YAAY,WACrB,IAAI;EACF,SAAS,KAAK;CAChB,SAAS,KAAK;EACZ,OAAO,CAAC,CAAC,MAAM,8BAA8B;GAAE,MAAM,MAAM;GAAM,OAAO,OAAO,GAAG;EAAE,CAAC;CACvF;CAEF,IAAI,CAAC,QAAQ;EACX,OAAO,CAAC,CAAC,KAAK,oBAAoB,EAAE,MAAM,MAAM,KAAK,CAAC;EACtD;CACF;CACA,IAAI;EACF,OAAO,aAAa,KAAK;CAC3B,SAAS,KAAK;EACZ,OAAO,CAAC,CAAC,MAAM,eAAe;GAAE,MAAM,MAAM;GAAM,OAAO,OAAO,GAAG;EAAE,CAAC;CACxE;AACF;AA2BA,IAAI,UAAU;AACd,IAAI,UAAoB,CAAC;;;;;AAMzB,SAAgB,qBAAqB,OAAkD;CACrF,iBAAiB,MAAM;CACvB,kBAAkB,MAAM;CACxB,UAAU;CACV,UAAU,CAAC;AACb;;AAGA,SAAgB,gBAAsB;CACpC,SAAS;CACT,iBAAiB;CACjB,kBAAkB;CAClB,UAAU;CACV,UAAU,CAAC;CACX,UAAU,SAAS;AACrB;AAEA,SAAS,mBAA8B;CACrC,IAAI,CAAC,QAAQ,MAAM,IAAI,MAAM,0CAA0C;CACvE,OAAO,OAAO;AAChB;AASA,SAAS,oBAAoB,OAAiB,OAAwC;CACpF,OAAO,MAAM,KAAK,WAAW;EAC3B,IAAI;GACF,OAAO;IAAE;IAAQ,QAAQ;KAAE,IAAI;KAAM,SAAS,OAAO,OAAO,KAAK;IAAE;GAAE;EACvE,SAAS,KAAK;GACZ,OAAO;IAAE;IAAQ,QAAQ;KAAE,IAAI;KAAO,OAAO;IAAI;GAAE;EACrD;CACF,CAAC;AACH;AAEA,SAAS,cAAc,SAA6C;CAClE,MAAM,SAA0B,CAAC;CACjC,KAAK,MAAM,EAAE,YAAY,SACvB,IAAI,OAAO,MAAM,OAAO,YAAY,MAAM,OAAO,KAAK,OAAO,QAAQ,KAAK;CAE5E,OAAO;AACT;AAEA,SAAS,sBAAsB,SAAoD;CACjF,MAAM,UAAkC,CAAC;CACzC,KAAK,MAAM,EAAE,YAAY,SACvB,IAAI,OAAO,MAAM,OAAO,YAAY,QAAQ,OAAO,QAAQ,cACzD,QAAQ,KAAK,OAAO,QAAQ,YAAY;CAG5C,OAAO;AACT;AAEA,SAAS,YAAY,SAAkC;CAGrD,KAAK,MAAM,EAAE,QAAQ,YAAY,SAC/B,IAAI,OAAO,IAAI,OAAO,QAAQ;MACzB,OAAO,OAAO,OAAO,KAAK;AAEnC;AAEA,SAAS,YAAY,OAAiB,KAAoB;CACxD,KAAK,MAAM,UAAU,OAAO,OAAO,OAAO,GAAG;AAC/C;AAEA,eAAe,eAAe,YAAmD;CAC/E,MAAM,WAAW,MAAM,YAAY,eAAe;CAGlD,MAAM,SAAS,CAAC,GAAG,WAAW,MAAM,CAAC,CAAC,QAAQ,GAAG,GAAG,SAAS,OAAO,CAAC,CAAC,MAAM,GAAA,EAAc;CAC1F,MAAM,YAAY,iBAAiB,GAAG,iBAAiB,EAAE,SAAS,OAAO,CAAC;AAC5E;AAEA,eAAe,aAAa,OAAgC;CAC1D,IAAI;CACJ,IAAI;EACF,QAAQ,MAAM,WAAW,cAAc;CACzC,SAAS,KAAK;EACZ,OAAO,CAAC,CAAC,MAAM,eAAe,EAAE,OAAO,OAAO,GAAG,EAAE,CAAC;EACpD,YAAY,OAAO,GAAG;EACtB;CACF;CACA,MAAM,UAAU,oBAAoB,OAAO,KAAK;CAChD,MAAM,SAAS,cAAc,OAAO;CACpC,MAAM,iBAAiB,sBAAsB,OAAO;CAEpD,IAAI,OAAO,SAAS,GAAG;EACrB,IAAI;GACF,MAAM,WAAW,iBAAiB,GAAG,gBAAgB,KAAK;EAC5D,SAAS,KAAK;GACZ,OAAO,CAAC,CAAC,MAAM,uBAAuB,EAAE,OAAO,OAAO,GAAG,EAAE,CAAC;GAC5D,YAAY,OAAO,GAAG;GACtB;EACF;EACA,IAAI,eAAe,SAAS,GAI1B,IAAI;GACF,MAAM,eAAe,cAAc;EACrC,SAAS,KAAK;GACZ,OAAO,CAAC,CAAC,MAAM,wBAAwB,EAAE,OAAO,OAAO,GAAG,EAAE,CAAC;EAC/D;EAEF,KAAK,MAAM,SAAS,QAAQ,KAAK,KAAK;CACxC;CACA,YAAY,OAAO;AACrB;AAEA,eAAe,QAAuB;CACpC,UAAU;CACV,IAAI;EACF,OAAO,QAAQ,SAAS,GAAG;GACzB,MAAM,QAAQ;GACd,UAAU,CAAC;GACX,MAAM,aAAa,KAAK;EAC1B;CACF,UAAU;EACR,UAAU;CACZ;AACF;AAEA,SAAS,QAAQ,QAAiC;CAChD,OAAO,IAAI,SAAe,SAAS,WAAW;EAC5C,QAAQ,KAAK;GAAE;GAAQ;GAAS;EAAO,CAAC;EACxC,IAAI,CAAC,SAAS,MAAW;CAC3B,CAAC;AACH;AAEA,SAAS,YAAY,OAAqB,SAA0C;CAElF,MAAM,GAAG,UAAU,WAAW,GAAG,cAAc,MAAM;CACrD,OAAO;AACT;AAEA,SAAS,kBAAkB,OAAsB,cAA6D;CAC5G,OAAO;EAAE,GAAG;EAAO;EAAc,6BAAY,IAAI,KAAK,EAAA,CAAE,YAAY;CAAE;AACxE;;;;AAOA,SAAS,sBAAmC,OAAuE;CACjH,OAAO;EACL,GAAI,MAAM,cAAc,KAAA,IAAY,EAAE,WAAW,MAAM,UAAU,IAAI,CAAC;EACtE,GAAI,MAAM,SAAS,KAAA,IAAY,EAAE,MAAM,MAAM,KAAK,IAAI,CAAC;EACvD,GAAI,MAAM,mBAAmB,KAAA,IAAY,EAAE,gBAAgB,MAAM,eAAe,IAAI,CAAC;EACrF,GAAI,MAAM,eAAe,KAAA,IAAY,EAAE,YAAY,MAAM,WAAW,IAAI,CAAC;CAC3E;AACF;AAEA,eAAsB,QAA+B,OAA2D;CAG9G,MAAM,kBAAkB,qBAAqB,KAAK;CAClD,IAAI,iBACF,MAAM,IAAI,MAAM,qBAAqB,iBAAiB;CAExD,MAAM,WAAA,GAAA,YAAA,WAAA,CAAqB;CAC3B,MAAM,QAAoC;EACxC,IAAI;EACJ,WAAW,MAAM;EACjB,UAAU,MAAM;EAChB,OAAO,MAAM;EACb,4BAAW,IAAI,KAAK,EAAA,CAAE,YAAY;EAClC,GAAG,sBAAsB,KAAK;CAChC;CACA,MAAM,SAAS,UAAU;EACvB,MAAM,QAAQ,WAAW;EACzB,OAAO,EAAE,OAAO;GAAE,MAAM;GAAa;EAAM,EAAE;CAC/C,CAAC;CACD,OAAO,EAAE,IAAI,QAAQ;AACvB;;;;AAKA,eAAe,eAAe,SAAiB,QAAgD;CAC7F,MAAM,SAAS,UAAU;EACvB,MAAM,QAAQ,MAAM,QAAQ;EAC5B,IAAI,CAAC,OAAO,OAAO;EACnB,MAAM,UAAU,YAAY,OAAO,OAAO;EAC1C,OAAO;GACL,OAAO,WAAW,YAAY;IAAE,MAAM;IAAW,IAAI;GAAQ,IAAI;IAAE,MAAM;IAAa,IAAI;GAAQ;GAClG,cAAc,kBAAkB,OAAO,MAAM;EAC/C;CACF,CAAC;AACH;AAEA,eAAsB,MAAM,SAAgC;CAC1D,MAAM,eAAe,SAAS,SAAS;AACzC;AAEA,eAAsB,OAAO,SAAgC;CAC3D,MAAM,eAAe,SAAS,WAAW;AAC3C;;;;;;;;;;;AAYA,eAAsB,gBACpB,WACA,SACA,OAOe;CACf,MAAM,SAAS,UAAU;EACvB,MAAM,QAAQ,MAAM,QAAQ;EAC5B,IAAI,CAAC,OAAO,OAAO;EACnB,IAAI,MAAM,cAAc,WAAW,OAAO;EAC1C,MAAM,OAAsB;GAC1B,GAAG;GACH,GAAI,MAAM,aAAa,KAAA,IAAY,EAAE,UAAU,MAAM,SAAS,IAAI,CAAC;GACnE,GAAI,MAAM,UAAU,KAAA,IAAY,EAAE,OAAO,MAAM,MAAM,IAAI,CAAC;GAC1D,GAAI,MAAM,SAAS,KAAA,IAAY,EAAE,MAAM,MAAM,KAAK,IAAI,CAAC;GACvD,GAAI,MAAM,mBAAmB,KAAA,IAAY,EAAE,gBAAgB,MAAM,eAAe,IAAI,CAAC;GACrF,GAAI,MAAM,eAAe,KAAA,IAAY,EAAE,YAAY,MAAM,WAAW,IAAI,CAAC;EAC3E;EAGA,MAAM,kBAAkB,qBAAqB;GAC3C,WAAW,KAAK;GAChB,UAAU,KAAK;GACf,OAAO,KAAK;GACZ,MAAM,KAAK;GACX,WAAW,KAAK;GAChB,gBAAgB,KAAK;GACrB,YAAY,KAAK;EACnB,CAAC;EACD,IAAI,iBAAiB;GACnB,OAAO,CAAC,CAAC,KAAK,iCAAiC;IAAE;IAAS;IAAW,OAAO;GAAgB,CAAC;GAC7F,OAAO;EACT;EACA,MAAM,QAAQ,WAAW;EACzB,OAAO,EAAE,OAAO;GAAE,MAAM;GAAW,OAAO;EAAK,EAAE;CACnD,CAAC;AACH;;;;;AAMA,eAAsB,aAAa,WAAmB,SAAqD;CAEzG,MAAM,SAAQ,MADM,WAAW,cAAc,EAAA,CACzB,QAAQ;CAC5B,IAAI,CAAC,OAAO,OAAO,KAAA;CACnB,IAAI,MAAM,cAAc,WAAW,OAAO,KAAA;CAC1C,OAAO;AACT;;;;AAKA,eAAsB,eAAe,WAAmB,SAAgC;CACtF,MAAM,SAAS,UAAU;EACvB,MAAM,QAAQ,MAAM,QAAQ;EAC5B,IAAI,CAAC,OAAO,OAAO;EACnB,IAAI,MAAM,cAAc,WAAW,OAAO;EAC1C,MAAM,UAAU,YAAY,OAAO,OAAO;EAC1C,OAAO;GACL,OAAO;IAAE,MAAM;IAAW,IAAI;GAAQ;GACtC,cAAc,kBAAkB,OAAO,SAAS;EAClD;CACF,CAAC;AACH;AAEA,eAAsB,IAAI,SAAqD;CAE7E,QAAO,MADa,WAAW,cAAc,EAAA,CAChC,QAAQ;AACvB;AAEA,eAAsB,QAAQ,WAA6C;CACzE,MAAM,QAAQ,MAAM,WAAW,cAAc;CAC7C,OAAO,OAAO,OAAO,MAAM,OAAO,CAAC,CAAC,QAAQ,UAAU,MAAM,cAAc,SAAS;AACrF;AAEA,eAAsB,UAAoC;CACxD,MAAM,QAAQ,MAAM,WAAW,cAAc;CAC7C,OAAO,OAAO,OAAO,MAAM,OAAO;AACpC;AAEA,eAAsB,cAA+C;CAEnE,QAAO,MADa,YAAY,eAAe,EAAA,CAClC;AACf"}