@hawkeyexl/manni 4.4.1 → 4.6.0

package/dist/{chunk-JXLTXMJ7.js → chunk-T6SYGLWR.js}

@@ -6,10 +6,10 @@ import {
   shortPin,
   shortSrc,
   spellAt
-} from "./chunk-SKSDRUUK.js";
+} from "./chunk-UAKNZVCD.js";
 import {
   parseSrc
-} from "./chunk-YTURO7SI.js";
+} from "./chunk-MHM4QEBV.js";
 import {
   palette
 } from "./chunk-RNVYGWIC.js";
@@ -452,4 +452,4 @@ export {
   removalLine,
   renderRemovePretty
 };
-//# sourceMappingURL=chunk-JXLTXMJ7.js.map
+//# sourceMappingURL=chunk-T6SYGLWR.js.map

package/dist/{chunk-CK7SKVHR.js → chunk-TBAMBLF3.js}

@@ -1,15 +1,7 @@
 #!/usr/bin/env node
 import {
-  ToolError
-} from "./chunk-G3T47CFV.js";
-
-// src/lint/types.ts
-var LintError = class extends ToolError {
-  constructor(message) {
-    super(message);
-    this.name = "LintError";
-  }
-};
+  LintError
+} from "./chunk-YGFIQ6Y5.js";
 
 // src/lint/rules/paragraphs.ts
 function checkParagraphsIn(content, rule, ctx) {
@@ -1025,7 +1017,6 @@ function matchSections(sections, rules, options = {}) {
 }
 
 export {
-  LintError,
   checkHeading,
   checkSequence,
   checkSequenceIn,
@@ -1039,4 +1030,4 @@ export {
   headingMatches,
   matchSections
 };
-//# sourceMappingURL=chunk-CK7SKVHR.js.map
+//# sourceMappingURL=chunk-TBAMBLF3.js.map

package/dist/chunk-TBAMBLF3.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/lint/rules/paragraphs.ts","../src/lint/rules/code-blocks.ts","../src/lint/rules/tables.ts","../src/lint/rules/admonitions.ts","../src/lint/rules/images.ts","../src/lint/rules/blockquotes.ts","../src/lint/rules/definition-lists.ts","../src/lint/rules/sequence.ts","../src/lint/rules/elements.ts","../src/lint/rules/contains.ts","../src/lint/rules/lists.ts","../src/lint/rules/index.ts","../src/lint/rules/heading.ts","../src/lint/core/template.ts","../src/lint/core/match.ts"],"sourcesContent":["/**\n * `paragraphs:` - paragraph counts and a per-paragraph pattern.\n *\n * v1 took a cycling `patterns: string[]`; v2 simplifies to one `pattern`\n * every paragraph in the run must match, per proposal 0061's block-rule\n * vocabulary.\n */\n\nimport type { ContentNode, Finding, SectionNode } from \"../types.js\";\nimport {\n  checkCount,\n  compilePattern,\n  paragraphsOf,\n  sectionContext,\n  type ParagraphsRule,\n  type RuleContext,\n} from \"./index.js\";\n\n/** Checks the paragraphs a section holds directly. */\nexport function checkParagraphs(\n  section: SectionNode,\n  rule: ParagraphsRule | undefined,\n): Finding[] {\n  return checkParagraphsIn(section.children, rule, sectionContext(section));\n}\n\n/**\n * The reusable core: checks the paragraphs in any ordered content list.\n *\n * Used for a section's own content, for a list item's `children`, and for one\n * run of a `sequence`. `ctx` says where count findings land and what heading\n * they carry.\n */\nexport function checkParagraphsIn(\n  content: ContentNode[],\n  rule: ParagraphsRule | undefined,\n  ctx: RuleContext,\n): Finding[] {\n  if (!rule) return [];\n\n  const paragraphs = paragraphsOf(content);\n  const findings = checkCount(\n    paragraphs.length,\n    rule,\n    \"paragraph\",\n    \"paragraphs_count_error\",\n    ctx,\n  );\n\n  const pattern = rule.pattern;\n  if (pattern) {\n    const regex = compilePattern(pattern);\n    paragraphs.forEach((paragraph, index) => {\n      if (!regex.test(paragraph.text)) {\n        findings.push({\n          type: \"paragraphs_pattern_error\",\n          heading: ctx.heading,\n          message: `Paragraph ${index + 1} does not match /${pattern}/`,\n          position: paragraph.position,\n          severity: \"error\",\n        });\n      }\n    });\n  }\n\n  return findings;\n}\n","/**\n * `codeBlocks:` - code block counts, the language(s) every block must\n * declare, and a `fenceInfo` filter over the info-string tail.\n *\n * `language` reports per offending block (every code block must declare one\n * of the accepted languages), the same way v1 reported nothing about\n * language at all - this is new in v2. `fenceInfo` has no message form of its\n * own in proposal 0061's table, so it narrows which blocks count toward\n * `min`/`max` instead, the way `elements.tag` does.\n */\n\nimport type { CodeNode, ContentNode, Finding, SectionNode } from \"../types.js\";\nimport {\n  checkCount,\n  codeBlocksOf,\n  compilePattern,\n  sectionContext,\n  type CodeBlocksRule,\n  type RuleContext,\n} from \"./index.js\";\n\n/** Checks the code blocks a section holds directly. */\nexport function checkCodeBlocks(\n  section: SectionNode,\n  rule: CodeBlocksRule | undefined,\n): Finding[] {\n  return checkCodeBlocksIn(section.children, rule, sectionContext(section));\n}\n\n/**\n * The reusable core: checks the code blocks in any ordered content list -\n * a section's content, a list item's `children`, or one run of a `sequence`.\n */\nexport function checkCodeBlocksIn(\n  content: ContentNode[],\n  rule: CodeBlocksRule | undefined,\n  ctx: RuleContext,\n): Finding[] {\n  if (!rule) return [];\n\n  const codeBlocks = codeBlocksOf(content);\n  const counted = rule.fenceInfo\n    ? codeBlocks.filter((block) => matchesFenceInfo(block, rule.fenceInfo as string))\n    : codeBlocks;\n\n  const findings = checkCount(\n    counted.length,\n    rule,\n    \"code block\",\n    \"code_blocks_count_error\",\n    ctx,\n  );\n\n  if (rule.language) {\n    findings.push(...checkLanguages(codeBlocks, rule.language, ctx));\n  }\n\n  return findings;\n}\n\nfunction matchesFenceInfo(block: CodeNode, pattern: string): boolean {\n  return compilePattern(pattern).test(block.fenceInfo ?? \"\");\n}\n\n/** Every code block in the run must declare one of the accepted languages. */\nfunction checkLanguages(\n  codeBlocks: CodeNode[],\n  language: string | string[],\n  ctx: RuleContext,\n): Finding[] {\n  const languages = Array.isArray(language) ? language : [language];\n  const only = languages[0];\n  if (languages.length === 0 || only === undefined) return [];\n\n  const label =\n    languages.length === 1\n      ? `\"${only}\"`\n      : `one of ${languages.map((lang) => `\"${lang}\"`).join(\", \")}`;\n\n  const findings: Finding[] = [];\n  codeBlocks.forEach((block, index) => {\n    if (block.language !== undefined && languages.includes(block.language)) return;\n\n    const found = block.language ? `but found \"${block.language}\"` : \"but found no language\";\n    findings.push({\n      type: \"code_blocks_language_error\",\n      heading: ctx.heading,\n      message: `Expected code block ${index + 1} to declare ${label}, ${found}`,\n      position: block.position,\n      severity: \"error\",\n    });\n  });\n\n  return findings;\n}\n","/**\n * `tables:` - table counts and the header cells every table must carry.\n *\n * `columns` is diagnostic, not a count filter: every table in the run counts\n * toward `min`/`max` whether or not its columns match, and a mismatch is\n * reported once per offending table (the same treatment `codeBlocks.language`\n * and `admonitions.variant` get, and unlike `codeBlocks.fenceInfo`, which has\n * no message form and narrows the count instead).\n */\n\nimport type { ContentNode, Finding, SectionNode, TableNode } from \"../types.js\";\nimport {\n  checkCount,\n  quoteList,\n  sectionContext,\n  tablesOf,\n  type RuleContext,\n  type TablesRule,\n} from \"./index.js\";\n\n/** Checks the tables a section holds directly. */\nexport function checkTables(\n  section: SectionNode,\n  rule: TablesRule | undefined,\n): Finding[] {\n  return checkTablesIn(section.children, rule, sectionContext(section));\n}\n\n/** The reusable core: checks the tables in any ordered content list. */\nexport function checkTablesIn(\n  content: ContentNode[],\n  rule: TablesRule | undefined,\n  ctx: RuleContext,\n): Finding[] {\n  if (!rule) return [];\n\n  const tables = tablesOf(content);\n  const findings = checkCount(tables.length, rule, \"table\", \"tables_count_error\", ctx);\n\n  if (rule.columns) {\n    for (const table of tables) {\n      const actual = headerCells(table);\n      if (!sameColumns(actual, rule.columns)) {\n        findings.push({\n          type: \"tables_columns_error\",\n          heading: ctx.heading,\n          message: `Expected table columns ${quoteList(rule.columns)}, but found ${quoteList(actual)}`,\n          position: table.position,\n          severity: \"error\",\n        });\n      }\n    }\n  }\n\n  return findings;\n}\n\nfunction headerCells(table: TableNode): string[] {\n  const header = table.children.find((row) => row.header);\n  return header ? header.children.map((cell) => cell.text) : [];\n}\n\nfunction sameColumns(actual: string[], expected: string[]): boolean {\n  return actual.length === expected.length && actual.every((cell, index) => cell === expected[index]);\n}\n","/**\n * `admonitions:` - admonition counts and the variant every admonition must\n * carry.\n *\n * `variant` is diagnostic, not a count filter, for the same reason\n * `tables.columns` is: every admonition counts toward `min`/`max` regardless,\n * and a mismatch is reported once per offending admonition.\n */\n\nimport type { AdmonitionNode, ContentNode, Finding, SectionNode } from \"../types.js\";\nimport {\n  admonitionsOf,\n  checkCount,\n  sectionContext,\n  type AdmonitionsRule,\n  type RuleContext,\n} from \"./index.js\";\n\n/** Checks the admonitions a section holds directly. */\nexport function checkAdmonitions(\n  section: SectionNode,\n  rule: AdmonitionsRule | undefined,\n): Finding[] {\n  return checkAdmonitionsIn(section.children, rule, sectionContext(section));\n}\n\n/** The reusable core: checks the admonitions in any ordered content list. */\nexport function checkAdmonitionsIn(\n  content: ContentNode[],\n  rule: AdmonitionsRule | undefined,\n  ctx: RuleContext,\n): Finding[] {\n  if (!rule) return [];\n\n  const admonitions = admonitionsOf(content);\n  const findings = checkCount(\n    admonitions.length,\n    rule,\n    \"admonition\",\n    \"admonitions_count_error\",\n    ctx,\n  );\n\n  if (rule.variant) {\n    findings.push(...checkVariant(admonitions, rule.variant, ctx));\n  }\n\n  return findings;\n}\n\nfunction checkVariant(\n  admonitions: AdmonitionNode[],\n  variant: NonNullable<AdmonitionsRule[\"variant\"]>,\n  ctx: RuleContext,\n): Finding[] {\n  const findings: Finding[] = [];\n  for (const admonition of admonitions) {\n    if (admonition.variant !== variant) {\n      // A format may name a flavor this vocabulary does not have, or none at\n      // all: reStructuredText's `hint`, a bare HTML `<aside>`. The node then\n      // carries no variant, and saying \"found a undefined\" would be worse\n      // than saying what is true.\n      const found = admonition.variant\n        ? `but found a ${admonition.variant}`\n        : \"but found one with no type\";\n      findings.push({\n        type: \"admonitions_variant_error\",\n        heading: ctx.heading,\n        message: `Expected a ${variant} admonition, ${found}`,\n        position: admonition.position,\n        severity: \"error\",\n      });\n    }\n  }\n  return findings;\n}\n","/**\n * `images:` - how many images, filtered by `url`, `alt`, and `attributes`.\n *\n * All three narrow the counted set rather than reporting their own finding -\n * proposal 0061's message table gives `images` only `images_count_error`, no\n * per-field diagnostic the way `elements.attributes` gets one. `attributes`\n * in particular can never match: `ImageNode` carries no `attributes` of its\n * own (the node model gave that field to `element` only), so any non-empty\n * `attributes` requirement here excludes every image, same as an image whose\n * `url` or `alt` does not match.\n */\n\nimport type { ContentNode, Finding, ImageNode, SectionNode } from \"../types.js\";\nimport {\n  checkCount,\n  imagesOf,\n  sectionContext,\n  type ImagesRule,\n  type RuleContext,\n} from \"./index.js\";\n\n/** Checks the images a section holds directly. */\nexport function checkImages(\n  section: SectionNode,\n  rule: ImagesRule | undefined,\n): Finding[] {\n  return checkImagesIn(section.children, rule, sectionContext(section));\n}\n\n/** The reusable core: checks the images in any ordered content list. */\nexport function checkImagesIn(\n  content: ContentNode[],\n  rule: ImagesRule | undefined,\n  ctx: RuleContext,\n): Finding[] {\n  if (!rule) return [];\n\n  const matching = imagesOf(content).filter((image) => matches(image, rule));\n  return checkCount(matching.length, rule, \"image\", \"images_count_error\", ctx);\n}\n\nfunction matches(image: ImageNode, rule: ImagesRule): boolean {\n  if (rule.url !== undefined && image.url !== rule.url) return false;\n  if (rule.alt !== undefined && image.alt !== rule.alt) return false;\n  if (rule.attributes && Object.keys(rule.attributes).length > 0) return false;\n  return true;\n}\n","/** `blockquotes:` - a plain count, the schema's `counted` shape. */\n\nimport type { ContentNode, Finding, SectionNode } from \"../types.js\";\nimport { blockquotesOf, checkCount, sectionContext, type Occurrences, type RuleContext } from \"./index.js\";\n\n/** Checks the blockquotes a section holds directly. */\nexport function checkBlockquotes(\n  section: SectionNode,\n  rule: Occurrences | undefined,\n): Finding[] {\n  return checkBlockquotesIn(section.children, rule, sectionContext(section));\n}\n\n/** The reusable core: checks the blockquotes in any ordered content list. */\nexport function checkBlockquotesIn(\n  content: ContentNode[],\n  rule: Occurrences | undefined,\n  ctx: RuleContext,\n): Finding[] {\n  if (!rule) return [];\n  return checkCount(blockquotesOf(content).length, rule, \"blockquote\", \"blockquotes_count_error\", ctx);\n}\n","/** `definitionLists:` - a plain count, the schema's `counted` shape. */\n\nimport type { ContentNode, Finding, SectionNode } from \"../types.js\";\nimport {\n  checkCount,\n  definitionListsOf,\n  sectionContext,\n  type Occurrences,\n  type RuleContext,\n} from \"./index.js\";\n\n/** Checks the definition lists a section holds directly. */\nexport function checkDefinitionLists(\n  section: SectionNode,\n  rule: Occurrences | undefined,\n): Finding[] {\n  return checkDefinitionListsIn(section.children, rule, sectionContext(section));\n}\n\n/** The reusable core: checks the definition lists in any ordered content list. */\nexport function checkDefinitionListsIn(\n  content: ContentNode[],\n  rule: Occurrences | undefined,\n  ctx: RuleContext,\n): Finding[] {\n  if (!rule) return [];\n  return checkCount(\n    definitionListsOf(content).length,\n    rule,\n    \"definition list\",\n    \"definition_lists_count_error\",\n    ctx,\n  );\n}\n","/**\n * `sequence:` - the ordered runs of content a section (or an element's or\n * list item's own content) must hold.\n *\n * Content arrives flat and in document order, so consecutive nodes of the\n * same kind are first grouped into runs: `[p, p, code, table]` becomes three\n * runs (paragraph, codeBlock, table). Those runs are then matched\n * positionally against the template's sequence, and each run is handed to\n * `checkContainsIn` for its one set key.\n *\n * v1 reported a length mismatch and an order mismatch as two finding types,\n * `sequence_length_error` and `sequence_order_error`. v2 collapses both into\n * one `content_order_error`: the message states the full expected and actual\n * kind lists, which communicates a length difference as plainly as an order\n * one, and a template widening from three kinds to nine does not need a\n * matching widening of finding types. The bail-on-mismatch behavior stays -\n * once the runs are the wrong shape, per-run findings are noise about\n * content the author has not arranged yet.\n */\n\nimport type { ContentKind, ContentNode, Finding, Position, SectionNode } from \"../types.js\";\nimport { BLOCK_KINDS, sectionContext, type BlockKind, type BlockRule, type RuleContext } from \"./index.js\";\nimport { checkContainsIn } from \"./contains.js\";\n\n/** A maximal stretch of consecutive content nodes sharing one kind. */\nexport interface ContentRun {\n  kind: ContentKind;\n  nodes: ContentNode[];\n  /** First node's start through last node's end. */\n  position: Position;\n}\n\n/** Groups consecutive same-kind nodes into runs, preserving document order. */\nexport function groupRuns(content: ContentNode[]): ContentRun[] {\n  const runs: ContentRun[] = [];\n\n  for (const node of content) {\n    const current = runs[runs.length - 1];\n    if (current && current.kind === node.kind) {\n      current.nodes.push(node);\n      current.position = {\n        start: current.position.start,\n        end: node.position.end,\n      };\n    } else {\n      runs.push({\n        kind: node.kind,\n        nodes: [node],\n        position: { start: node.position.start, end: node.position.end },\n      });\n    }\n  }\n\n  return runs;\n}\n\n/** The content kind a block-rule key names, e.g. `codeBlocks` -> `codeBlock`. */\nconst KIND_OF_BLOCK: Record<BlockKind, ContentKind> = {\n  paragraphs: \"paragraph\",\n  codeBlocks: \"codeBlock\",\n  lists: \"list\",\n  tables: \"table\",\n  admonitions: \"admonition\",\n  images: \"image\",\n  blockquotes: \"blockquote\",\n  definitionLists: \"definitionList\",\n  elements: \"element\",\n};\n\n/** The short noun a `content_order_error` message uses for one kind. */\nfunction sequenceLabel(kind: ContentKind): string {\n  switch (kind) {\n    case \"paragraph\":\n      return \"paragraph\";\n    case \"codeBlock\":\n      return \"code\";\n    case \"list\":\n      return \"list\";\n    case \"table\":\n      return \"table\";\n    case \"admonition\":\n      return \"admonition\";\n    case \"image\":\n      return \"image\";\n    case \"blockquote\":\n      return \"blockquote\";\n    case \"definitionList\":\n      return \"definition list\";\n    case \"element\":\n      return \"element\";\n    default:\n      // tableRow/tableCell/definitionItem/listItem never appear as a top-level\n      // ContentNode.kind; groupRuns only ever sees the nine kinds above.\n      return kind;\n  }\n}\n\n/** The one key set on a `sequence:` entry, or `null` for a malformed one. */\nfunction keyOf(entry: BlockRule): BlockKind | null {\n  for (const kind of BLOCK_KINDS) {\n    if (entry[kind] !== undefined) return kind;\n  }\n  return null;\n}\n\n/** Checks a section's own content against a `sequence:` rule. */\nexport function checkSequence(\n  section: SectionNode,\n  rule: BlockRule[] | undefined,\n): Finding[] {\n  return checkSequenceIn(section.children, rule, sectionContext(section));\n}\n\n/**\n * The reusable core: checks any ordered content list against a `sequence:`\n * rule - a section's content, a list item's `children`, or an element's own\n * `children`.\n */\nexport function checkSequenceIn(\n  content: ContentNode[],\n  rule: BlockRule[] | undefined,\n  ctx: RuleContext,\n): Finding[] {\n  if (!rule) return [];\n\n  const runs = groupRuns(content);\n  const expectedKinds = rule.map((entry) => {\n    const key = keyOf(entry);\n    return key ? KIND_OF_BLOCK[key] : null;\n  });\n  const actualKinds = runs.map((run) => run.kind);\n\n  const matches =\n    expectedKinds.length === actualKinds.length &&\n    expectedKinds.every((kind, index) => kind === actualKinds[index]);\n\n  if (!matches) {\n    const expected = expectedKinds.map((kind) => (kind ? sequenceLabel(kind) : \"?\"));\n    const found = actualKinds.length > 0 ? actualKinds.map(sequenceLabel) : [\"nothing\"];\n    return [\n      {\n        type: \"content_order_error\",\n        heading: ctx.heading,\n        message: `Expected ${expected.join(\" then \")}, but found ${found.join(\" then \")}`,\n        position: ctx.position,\n        severity: \"error\",\n      },\n    ];\n  }\n\n  const findings: Finding[] = [];\n  runs.forEach((run, index) => {\n    const entry = rule[index];\n    if (!entry) return;\n    const runCtx: RuleContext = { heading: ctx.heading, position: run.position };\n    // A run holds one kind, so `checkContainsIn` sees exactly the nodes in\n    // this stretch, not the section's other content of the same kind - the\n    // entry has only that one key set, so every other dispatch is a no-op.\n    findings.push(...checkContainsIn(run.nodes, entry, runCtx));\n  });\n\n  return findings;\n}\n","/**\n * `elements:` - named-wrapper counts, filtered and labeled by `tag`, the\n * literal `attributes` a matched element must carry, and what it holds via\n * `sequence` | `contains` recursing into the element's own `children` -\n * never the enclosing section's, per proposal 0065 stress test 4.\n *\n * `tag` narrows the counted set the way `codeBlocks.fenceInfo` and\n * `images.url`/`alt` do, and also names the noun in count messages: `elements:\n * { tag: \"Steps\", min: 1 }` reports `Expected at least 1 \"Steps\" element, but\n * found 0`, not the generic `\"element\"`. `attributes` is diagnostic instead,\n * checked per matched element and reported once per offending attribute.\n */\n\nimport type { ContentNode, ElementNode, Finding, SectionNode } from \"../types.js\";\nimport {\n  checkCount,\n  elementsOf,\n  sectionContext,\n  type AttributesRule,\n  type ElementsRule,\n  type RuleContext,\n} from \"./index.js\";\nimport { checkContainsIn } from \"./contains.js\";\nimport { checkSequenceIn } from \"./sequence.js\";\n\n/** Checks the elements a section holds directly. */\nexport function checkElements(\n  section: SectionNode,\n  rule: ElementsRule | undefined,\n): Finding[] {\n  return checkElementsIn(section.children, rule, sectionContext(section));\n}\n\n/** The reusable core: checks the elements in any ordered content list. */\nexport function checkElementsIn(\n  content: ContentNode[],\n  rule: ElementsRule | undefined,\n  ctx: RuleContext,\n): Finding[] {\n  if (!rule) return [];\n\n  const tags = rule.tag === undefined ? undefined : Array.isArray(rule.tag) ? rule.tag : [rule.tag];\n  const matching = tags ? elementsOf(content).filter((element) => tags.includes(element.name)) : elementsOf(content);\n\n  // \"or\", not a comma list: the count applies to one combined label, so\n  // `\"Note\", \"Tip\" element` reads as two nouns with a singular verb where\n  // `\"Note\" or \"Tip\" element` reads as the one thing being counted.\n  const noun = tags\n    ? `${tags.map((tag) => `\"${tag}\"`).join(\" or \")} element`\n    : \"element\";\n  const findings = checkCount(matching.length, rule, noun, \"elements_count_error\", ctx);\n\n  if (rule.attributes) {\n    for (const element of matching) {\n      findings.push(...checkAttributes(element, rule.attributes, ctx));\n    }\n  }\n\n  // Both, unconditionally, as `validator.ts` runs them against a section. Each\n  // no-ops on an absent rule, and the schema refuses a rule that writes both\n  // (`oneOfSequenceOrContains`), so only one can ever fire. Writing it as a\n  // choice made this file's behaviour depend on a constraint declared in\n  // another, which reads like a silent drop whether or not it is one.\n  if (rule.sequence || rule.contains) {\n    for (const element of matching) {\n      const elementCtx: RuleContext = { heading: ctx.heading, position: element.position };\n      findings.push(...checkSequenceIn(element.children, rule.sequence, elementCtx));\n      findings.push(...checkContainsIn(element.children, rule.contains, elementCtx));\n    }\n  }\n\n  return findings;\n}\n\n/**\n * `true` requires presence (any value); `false` requires absence; a string\n * is the required literal value. An element's own `attributes` map values a\n * dynamic (JSX-expression) attribute as `true` too, since its literal value\n * cannot be known statically - `checkOne` tells that apart from \"absent\" by\n * checking membership before comparing values.\n */\nfunction checkAttributes(\n  element: ElementNode,\n  rule: AttributesRule,\n  ctx: RuleContext,\n): Finding[] {\n  const findings: Finding[] = [];\n  for (const [key, expected] of Object.entries(rule)) {\n    const finding = checkOne(element, key, expected, ctx);\n    if (finding) findings.push(finding);\n  }\n  return findings;\n}\n\nfunction checkOne(\n  element: ElementNode,\n  key: string,\n  expected: string | boolean,\n  ctx: RuleContext,\n): Finding | null {\n  const attributes = element.attributes ?? {};\n  const present = key in attributes;\n  const actual = attributes[key];\n\n  const fail = (want: string, detail: string): Finding => ({\n    type: \"elements_attribute_error\",\n    heading: ctx.heading,\n    message: `Expected the \"${element.name}\" element ${want}, but ${detail}`,\n    position: element.position,\n    severity: \"error\",\n  });\n\n  if (expected === false) {\n    if (!present) return null;\n    const found = actual === true ? `an expression` : `${key}=\"${String(actual)}\"`;\n    return fail(`not to carry ${key}`, `found ${found}`);\n  }\n\n  if (!present) return fail(attributeWant(key, expected), `it carries no ${key}`);\n  if (expected === true) return null;\n  if (actual === true) return fail(attributeWant(key, expected), `its ${key} is an expression`);\n  if (actual !== expected) return fail(attributeWant(key, expected), `found ${key}=\"${String(actual)}\"`);\n  return null;\n}\n\nfunction attributeWant(key: string, expected: string | true): string {\n  return expected === true ? `to carry ${key}` : `to carry ${key}=\"${expected}\"`;\n}\n","/**\n * `contains:` - what a section (or an element's or list item's own content)\n * holds, in any order. Each listed kind dispatches to that kind's own check.\n */\n\nimport type { ContentNode, Finding, SectionNode } from \"../types.js\";\nimport { BLOCK_KINDS, sectionContext, type BlockRule, type RuleContext } from \"./index.js\";\nimport { checkParagraphsIn } from \"./paragraphs.js\";\nimport { checkCodeBlocksIn } from \"./code-blocks.js\";\nimport { checkListsIn } from \"./lists.js\";\nimport { checkTablesIn } from \"./tables.js\";\nimport { checkAdmonitionsIn } from \"./admonitions.js\";\nimport { checkImagesIn } from \"./images.js\";\nimport { checkBlockquotesIn } from \"./blockquotes.js\";\nimport { checkDefinitionListsIn } from \"./definition-lists.js\";\nimport { checkElementsIn } from \"./elements.js\";\n\n/** Checks a section's own content against a `contains:` rule. */\nexport function checkContains(\n  section: SectionNode,\n  rule: BlockRule | undefined,\n): Finding[] {\n  return checkContainsIn(section.children, rule, sectionContext(section));\n}\n\n/**\n * The reusable core: checks any ordered content list against a `contains:`\n * rule - a section's content, a list item's `children`, an element's own\n * `children`, or one run of a `sequence` (which carries exactly one key).\n *\n * `BLOCK_KINDS` drives the dispatch so a ninth kind is one line here, not a\n * rewritten `if` chain.\n */\nexport function checkContainsIn(\n  content: ContentNode[],\n  rule: BlockRule | undefined,\n  ctx: RuleContext,\n): Finding[] {\n  if (!rule) return [];\n\n  const findings: Finding[] = [];\n  for (const kind of BLOCK_KINDS) {\n    switch (kind) {\n      case \"paragraphs\":\n        findings.push(...checkParagraphsIn(content, rule.paragraphs, ctx));\n        break;\n      case \"codeBlocks\":\n        findings.push(...checkCodeBlocksIn(content, rule.codeBlocks, ctx));\n        break;\n      case \"lists\":\n        findings.push(...checkListsIn(content, rule.lists, ctx));\n        break;\n      case \"tables\":\n        findings.push(...checkTablesIn(content, rule.tables, ctx));\n        break;\n      case \"admonitions\":\n        findings.push(...checkAdmonitionsIn(content, rule.admonitions, ctx));\n        break;\n      case \"images\":\n        findings.push(...checkImagesIn(content, rule.images, ctx));\n        break;\n      case \"blockquotes\":\n        findings.push(...checkBlockquotesIn(content, rule.blockquotes, ctx));\n        break;\n      case \"definitionLists\":\n        findings.push(...checkDefinitionListsIn(content, rule.definitionLists, ctx));\n        break;\n      case \"elements\":\n        findings.push(...checkElementsIn(content, rule.elements, ctx));\n        break;\n    }\n  }\n  return findings;\n}\n","/**\n * `lists:` - list counts, whether they are ordered, item counts, and what\n * each item holds.\n *\n * v1's `items` took its own flat `paragraphs`/`code_blocks`/`lists` keys. v2\n * replaces that split with the same `sequence` | `contains` every other\n * container uses (proposal 0061), so item-level rules recurse through the\n * same two functions as everything else instead of a third, list-shaped one.\n */\n\nimport type { ContentNode, Finding, ListNode, SectionNode } from \"../types.js\";\nimport {\n  checkCount,\n  listsOf,\n  sectionContext,\n  type ListsRule,\n  type RuleContext,\n} from \"./index.js\";\nimport { checkContainsIn } from \"./contains.js\";\nimport { checkSequenceIn } from \"./sequence.js\";\n\n/** Checks the lists a section holds directly. */\nexport function checkLists(\n  section: SectionNode,\n  rule: ListsRule | undefined,\n): Finding[] {\n  return checkListsIn(section.children, rule, sectionContext(section));\n}\n\n/**\n * The reusable core: checks the lists in any ordered content list.\n *\n * `rule.items` recurses - a list item's children are a `ContentNode[]` like\n * any other, so item-level `sequence`/`contains` rules run through the same\n * functions, arbitrarily deep.\n */\nexport function checkListsIn(\n  content: ContentNode[],\n  rule: ListsRule | undefined,\n  ctx: RuleContext,\n): Finding[] {\n  if (!rule) return [];\n\n  const lists = listsOf(content);\n  const findings = checkCount(lists.length, rule, \"list\", \"lists_count_error\", ctx);\n\n  if (rule.ordered !== undefined) {\n    findings.push(...checkOrdered(lists, rule.ordered, ctx));\n  }\n\n  const items = rule.items;\n  if (!items) return findings;\n\n  findings.push(...checkItemCounts(lists, items, ctx));\n\n  if (!items.sequence && !items.contains) return findings;\n\n  for (const list of lists) {\n    for (const item of list.items) {\n      const itemCtx: RuleContext = { heading: ctx.heading, position: item.position };\n      if (items.sequence) {\n        findings.push(...checkSequenceIn(item.children, items.sequence, itemCtx));\n      } else if (items.contains) {\n        findings.push(...checkContainsIn(item.children, items.contains, itemCtx));\n      }\n    }\n  }\n\n  return findings;\n}\n\nfunction checkOrdered(lists: ListNode[], ordered: boolean, ctx: RuleContext): Finding[] {\n  const findings: Finding[] = [];\n  for (const list of lists) {\n    if (list.ordered !== ordered) {\n      findings.push({\n        type: \"lists_ordered_error\",\n        heading: ctx.heading,\n        message: ordered\n          ? \"Expected a numbered list, but found a bulleted list\"\n          : \"Expected a bulleted list, but found a numbered list\",\n        position: list.position,\n        severity: \"error\",\n      });\n    }\n  }\n  return findings;\n}\n\n/**\n * Item counts report once per bound, anchored at the first list that breaks\n * it. `min` defaults to 1 like every other count, which is a harmless no-op\n * here: a list always has at least one item structurally, so only an\n * explicit `min` above 1 (or a rule that also forbids via `max`) ever fires.\n */\nfunction checkItemCounts(\n  lists: ListNode[],\n  items: { min?: number; max?: number },\n  ctx: RuleContext,\n): Finding[] {\n  const findings: Finding[] = [];\n  const min = items.min ?? (items.max === 0 ? 0 : 1);\n  const max = items.max ?? null;\n\n  if (max !== null) {\n    const offender = lists.find((list) => list.items.length > max);\n    if (offender) {\n      findings.push({\n        type: \"lists_items_count_error\",\n        heading: ctx.heading,\n        message: `Expected at most ${max} items in a list, but found ${offender.items.length}`,\n        position: offender.position,\n        severity: \"error\",\n      });\n    }\n  }\n\n  if (min > 0) {\n    const offender = lists.find((list) => list.items.length < min);\n    if (offender) {\n      findings.push({\n        type: \"lists_items_count_error\",\n        heading: ctx.heading,\n        message: `Expected at least ${min} items in a list, but found ${offender.items.length}`,\n        position: offender.position,\n        severity: \"error\",\n      });\n    }\n  }\n\n  return findings;\n}\n","/**\n * Content rules: the checks that run against a single section's own content.\n *\n * A rule is a pure, synchronous function of one `SectionNode` (or one ordered\n * `ContentNode[]` slice of it) and its slice of a template, returning\n * `Finding[]`. Rules never touch a parser AST and never await anything.\n *\n * The content model is format-neutral and flat: a section carries one ordered\n * `children: ContentNode[]`, and the per-kind \"buckets\" every rule needs are\n * queries over it (`paragraphsOf`, `codeBlocksOf`, ...) rather than separately\n * maintained arrays. The same queries work unchanged on a list item's\n * `children` or an element's own `children`, which is why `lists.items` and\n * `elements` can recurse.\n *\n * This module is deliberately independent of `../core/template.ts`. That file\n * is the DSL the v2 loader and schema agree on; this one is the DSL the rules\n * are written against. Where the two diverge - see `CodeBlocksRule.language`\n * and `ElementsRule.tag` below, which this chunk's task widened to `string |\n * string[]` while `core/template.ts` still types them as a bare `string` -\n * the validator chunk that wires the two together needs to reconcile it. That\n * mirrors the v1 shape of this file, whose own rule interfaces mirrored\n * `template-v1.ts` rather than importing it.\n */\n\nimport { LintError } from \"../types.js\";\nimport type {\n  AdmonitionNode,\n  BlockquoteNode,\n  CodeNode,\n  ContentNode,\n  DefinitionListNode,\n  ElementNode,\n  Finding,\n  ImageNode,\n  ListNode,\n  ParagraphNode,\n  Position,\n  SectionNode,\n  TableNode,\n} from \"../types.js\";\n\n/* -------------------------------------------------------------------------- *\n * Template rule shapes\n *\n * These mirror the v2 template DSL's block-rule vocabulary (proposal 0065 /\n * 0061): a block rule is keyed by a plural content kind and carries `min`\n * (default 1), `max` (absent unbounded, `0` forbids), plus per-kind keys.\n * -------------------------------------------------------------------------- */\n\n/** Shared by every counted rule: how many of the thing there must be. */\nexport interface Occurrences {\n  /** Fewest occurrences. Absent means one - see `checkCount` for the one\n   * exception, where an explicit `max: 0` with no `min` defaults `min` to 0\n   * too, so \"forbid this kind\" is satisfiable by finding none of it. */\n  min?: number;\n  /** Most occurrences. Absent is unbounded; `0` forbids. */\n  max?: number;\n}\n\n/**\n * What a rule's `heading` may say.\n *\n * `undefined` (the key absent) matches any heading or none. A string is exact\n * text, a list is one-of, `{ pattern }` is an unanchored regular expression,\n * and `false` means the section has no heading of its own.\n */\nexport type HeadingRule = string | string[] | { pattern: string } | false;\n\n/** Attributes a node must carry. `true` requires presence; `false` requires absence. */\nexport type AttributesRule = Record<string, string | boolean>;\n\n/** `paragraphs:` - how many paragraphs, and what they must look like. */\nexport interface ParagraphsRule extends Occurrences {\n  /** Unanchored regular expression every paragraph in the run must match. */\n  pattern?: string;\n}\n\n/** `codeBlocks:` - how many code blocks, and how they are tagged. */\nexport interface CodeBlocksRule extends Occurrences {\n  /** Language(s) every code block must declare one of. */\n  language?: string | string[];\n  /** Info-string tail after the language; narrows which blocks count. */\n  fenceInfo?: string;\n}\n\n/** `lists.items:` - how many items per list, and what each item holds. */\nexport interface ListItemsRule extends Occurrences {\n  sequence?: BlockRule[];\n  contains?: BlockRule;\n}\n\n/** `lists:` - how many lists, whether they are ordered, and item rules. */\nexport interface ListsRule extends Occurrences {\n  ordered?: boolean;\n  items?: ListItemsRule;\n}\n\n/** `tables:` - how many tables, and the header cells in order. */\nexport interface TablesRule extends Occurrences {\n  columns?: string[];\n}\n\n/** `admonitions:` - how many, and of which variant. */\nexport interface AdmonitionsRule extends Occurrences {\n  variant?: \"note\" | \"tip\" | \"important\" | \"caution\" | \"warning\" | \"danger\";\n}\n\n/** `images:` - how many, and what they point at. */\nexport interface ImagesRule extends Occurrences {\n  /** Narrows which images count: only images at this url are counted. */\n  url?: string;\n  /** Narrows which images count: only images with this alt text are counted. */\n  alt?: string;\n  /**\n   * Narrows which images count. `ImageNode` carries no `attributes` of its\n   * own (the node model gave that field to `element` only), so any non-empty\n   * requirement here matches no image - see `images.ts`.\n   */\n  attributes?: AttributesRule;\n}\n\n/** `elements:` - how many named wrappers, and what they hold. */\nexport interface ElementsRule extends Occurrences {\n  /** Narrows which elements count, and names the noun in count messages. */\n  tag?: string | string[];\n  attributes?: AttributesRule;\n  sequence?: BlockRule[];\n  contains?: BlockRule;\n}\n\n/**\n * What a section (or an element's or list item's own content) holds, keyed by\n * content kind.\n *\n * One of these is a whole `contains:`. As an entry of `sequence:` exactly one\n * key is set, and it names the kind expected at that position.\n */\nexport interface BlockRule {\n  paragraphs?: ParagraphsRule;\n  codeBlocks?: CodeBlocksRule;\n  lists?: ListsRule;\n  tables?: TablesRule;\n  admonitions?: AdmonitionsRule;\n  images?: ImagesRule;\n  blockquotes?: Occurrences;\n  definitionLists?: Occurrences;\n  elements?: ElementsRule;\n}\n\n/** `sequence:` - the ordered runs of content a section must contain. */\nexport type SequenceRule = BlockRule[];\n\n/** One block-rule key: a content kind, spelled plural. */\nexport type BlockKind = keyof BlockRule;\n\n/** Every block-rule key, in the order the schema declares them. */\nexport const BLOCK_KINDS: readonly BlockKind[] = [\n  \"paragraphs\",\n  \"codeBlocks\",\n  \"lists\",\n  \"tables\",\n  \"admonitions\",\n  \"images\",\n  \"blockquotes\",\n  \"definitionLists\",\n  \"elements\",\n];\n\n/* -------------------------------------------------------------------------- *\n * Finding anchoring\n * -------------------------------------------------------------------------- */\n\n/**\n * Where findings land when a rule runs over content that is not a whole\n * section - a list item's `children`, an element's `children`, or one run\n * inside a `sequence`.\n */\nexport interface RuleContext {\n  /** Stamped onto every finding as `Finding.heading`. */\n  heading: string | null;\n  /** Used when the offending thing is a count rather than a single node. */\n  position: Position;\n}\n\n/**\n * The context for rules run against a section's own content.\n *\n * The heading is normalised to `null` when there is none, as `match.ts` and\n * `validator.ts` both do. A headless section carries `title: \"\"`, and the JSON\n * reporter's `heading` is a wire key `manni docevals` parses rather than\n * validates, so `\"\"` and `null` would reach it as two spellings of one fact.\n */\nexport function sectionContext(section: SectionNode): RuleContext {\n  return { heading: section.title || null, position: section.position };\n}\n\n/* -------------------------------------------------------------------------- *\n * Content queries\n *\n * The single place the flat content array is bucketed by kind. Rules call\n * these; they never filter inline.\n * -------------------------------------------------------------------------- */\n\nexport function paragraphsOf(content: ContentNode[]): ParagraphNode[] {\n  return content.filter((node): node is ParagraphNode => node.kind === \"paragraph\");\n}\n\nexport function codeBlocksOf(content: ContentNode[]): CodeNode[] {\n  return content.filter((node): node is CodeNode => node.kind === \"codeBlock\");\n}\n\nexport function listsOf(content: ContentNode[]): ListNode[] {\n  return content.filter((node): node is ListNode => node.kind === \"list\");\n}\n\nexport function tablesOf(content: ContentNode[]): TableNode[] {\n  return content.filter((node): node is TableNode => node.kind === \"table\");\n}\n\nexport function admonitionsOf(content: ContentNode[]): AdmonitionNode[] {\n  return content.filter((node): node is AdmonitionNode => node.kind === \"admonition\");\n}\n\nexport function imagesOf(content: ContentNode[]): ImageNode[] {\n  return content.filter((node): node is ImageNode => node.kind === \"image\");\n}\n\nexport function blockquotesOf(content: ContentNode[]): BlockquoteNode[] {\n  return content.filter((node): node is BlockquoteNode => node.kind === \"blockquote\");\n}\n\nexport function definitionListsOf(content: ContentNode[]): DefinitionListNode[] {\n  return content.filter((node): node is DefinitionListNode => node.kind === \"definitionList\");\n}\n\nexport function elementsOf(content: ContentNode[]): ElementNode[] {\n  return content.filter((node): node is ElementNode => node.kind === \"element\");\n}\n\n/* -------------------------------------------------------------------------- *\n * Shared message helpers\n * -------------------------------------------------------------------------- */\n\n/** `\"paragraph\"`/1 -> `\"paragraph\"`; `\"paragraph\"`/2 -> `\"paragraphs\"`. */\nfunction plural(noun: string, count: number): string {\n  return count === 1 ? noun : `${noun}s`;\n}\n\n/** `[\"Field\", \"Type\"]` -> `\"Field\", \"Type\"`. */\nexport function quoteList(items: string[]): string {\n  return items.map((item) => `\"${item}\"`).join(\", \");\n}\n\n/**\n * The count half of every block rule: `min` (default 1) and `max` (default\n * unbounded), against one already-computed count.\n *\n * One default is not the naive `rule.min ?? 1`. The schema documents `max: 0`\n * as how a template forbids a kind outright, and that has to be satisfiable\n * by a section that truly has none of it. A blanket \"min defaults to 1\" would\n * make `{ max: 0 }` alone unsatisfiable - it would demand at least one and\n * permit at most zero. So `min` defaults to 0 exactly when `max` is written\n * as `0` and `min` itself is not, and to 1 otherwise. `min: 0` and `max: 0`\n * are each still tested explicitly; this is what makes both mean something\n * at once.\n */\nexport function checkCount(\n  count: number,\n  rule: Occurrences,\n  noun: string,\n  type: string,\n  ctx: RuleContext,\n): Finding[] {\n  const findings: Finding[] = [];\n  const min = rule.min ?? (rule.max === 0 ? 0 : 1);\n  const max = rule.max ?? null;\n\n  if (count < min) {\n    findings.push({\n      type,\n      heading: ctx.heading,\n      message: `Expected at least ${min} ${plural(noun, min)}, but found ${count}`,\n      position: ctx.position,\n      severity: \"error\",\n    });\n  }\n\n  if (max !== null && count > max) {\n    findings.push({\n      type,\n      heading: ctx.heading,\n      message: `Expected at most ${max} ${plural(noun, max)}, but found ${count}`,\n      position: ctx.position,\n      severity: \"error\",\n    });\n  }\n\n  return findings;\n}\n\n/* -------------------------------------------------------------------------- *\n * The rules\n * -------------------------------------------------------------------------- */\n\nexport { checkHeading } from \"./heading.js\";\nexport { checkParagraphs, checkParagraphsIn } from \"./paragraphs.js\";\nexport { checkCodeBlocks, checkCodeBlocksIn } from \"./code-blocks.js\";\nexport { checkLists, checkListsIn } from \"./lists.js\";\nexport { checkTables, checkTablesIn } from \"./tables.js\";\nexport { checkAdmonitions, checkAdmonitionsIn } from \"./admonitions.js\";\nexport { checkImages, checkImagesIn } from \"./images.js\";\nexport { checkBlockquotes, checkBlockquotesIn } from \"./blockquotes.js\";\nexport { checkDefinitionLists, checkDefinitionListsIn } from \"./definition-lists.js\";\nexport { checkElements, checkElementsIn } from \"./elements.js\";\nexport { checkContains, checkContainsIn } from \"./contains.js\";\nexport { checkSequence, checkSequenceIn, groupRuns } from \"./sequence.js\";\nexport type { ContentRun } from \"./sequence.js\";\n\n/**\n * Compile an author-supplied pattern, or say which one is broken.\n *\n * A pattern comes from a template, so a bad one is a broken template rather\n * than a lint finding - and the raw `SyntaxError` names the regex but not the\n * template, the section, or the file. Every caller must route the result\n * through the same containment a template load failure gets, or one bad\n * pattern takes the whole run down with it.\n *\n * ## A pattern that compiles can still hang\n *\n * This checks syntax, and syntax is all it checks. `(a+)+b$` is a valid regex\n * that backtracks catastrophically against a heading it cannot match, and\n * `loadTemplateFile` will fetch a template over HTTP, so an untrusted template\n * can supply one.\n *\n * Capping the input length is not the answer, however cheap it looks. The\n * blow-up is exponential in the length of the input, so a cap generous enough\n * for a real heading is already far past the point of hanging: `(a+)+b$` needs\n * on the order of 2^n steps, and n of 64 is out of reach. Any cap that\n * actually bounded the work would reject headings people legitimately write.\n *\n * The boundary that does hold is the one proposal 0015 drew for schemas: a\n * template from a URL is a trust decision made when the URL is configured, not\n * something this function can take back. Validating patterns for backtracking\n * safety at load time is the fix if that decision is ever delegated, and it is\n * a dependency and a proposal rather than a line here.\n */\nconst compiled = new Map<string, RegExp>();\n\nexport function compilePattern(pattern: string): RegExp {\n  // Memoized because heading matching is quadratic by nature: the matcher asks\n  // every rule about every section, so a template with ten pattern rules against\n  // a twenty-section page compiled the same ten regexes two hundred times.\n  //\n  // Safe to share one instance: these are built with no flags, and `lastIndex`\n  // is only carried between calls by `g` and `y`. Adding either to this\n  // construction would make the cached regex stateful across sections.\n  const hit = compiled.get(pattern);\n  if (hit) return hit;\n  try {\n    const regex = new RegExp(pattern);\n    compiled.set(pattern, regex);\n    return regex;\n  } catch (error) {\n    const reason = error instanceof Error ? error.message : String(error);\n    throw new LintError(`Invalid pattern \"${pattern}\": ${reason}`);\n  }\n}\n\n/** Drop the compiled-pattern memo. See `clearCaches` in the package root. */\nexport function clearPatternCache(): void {\n  compiled.clear();\n}\n","/**\n * `heading:` - the section's title against a string, a one-of list, a\n * `{ pattern }`, or `false` for \"no heading of its own\".\n *\n * One finding type, `heading_error`, covers all four forms; the message\n * names which form failed. v1 split this into `heading_const_error` and\n * `heading_pattern_error`, each of which could fire independently for the\n * same section. v2's `heading:` is one value, so it fires at most once.\n */\n\nimport type { Finding, SectionNode } from \"../types.js\";\nimport { compilePattern, type HeadingRule } from \"./index.js\";\n\n/**\n * A section's own title, in the vocabulary `heading:` speaks: `null` when the\n * section has no heading of its own (the implicit lead section), the title\n * text otherwise.\n *\n * `SectionNode.title` is `\"\"` rather than `null` for that section - `null` is\n * reserved for \"no heading\" so `headingMatches`-style checks elsewhere don't\n * have to special-case the empty string. This bridges the two.\n */\nfunction ownTitle(section: SectionNode): string | null {\n  return section.titlePosition === null ? null : section.title;\n}\n\n/** Checks a section's title against the template's `heading:` rule. */\nexport function checkHeading(\n  section: SectionNode,\n  rule: HeadingRule | undefined,\n): Finding[] {\n  if (rule === undefined) return [];\n\n  // The heading itself is the offending node when it has a span of its own;\n  // the implicit lead section has none, so fall back to the section.\n  const position = section.titlePosition ?? section.position;\n  const title = ownTitle(section);\n  const found = title === null ? \"no heading\" : `\"${title}\"`;\n\n  const fail = (message: string): Finding[] => [\n    {\n      type: \"heading_error\",\n      // `|| null`, as `sectionContext` and `match.ts`'s `anchor` both do. A\n      // headless section's title is `\"\"`, and the JSON reporter's `heading` is\n      // a wire key `manni docevals` parses rather than validates, so two\n      // spellings of \"no heading\" would reach it as two different facts.\n      heading: section.title || null,\n      message,\n      position,\n      severity: \"error\",\n    },\n  ];\n\n  if (rule === false) {\n    return title === null ? [] : fail(`Expected no heading of its own, but found ${found}`);\n  }\n\n  if (typeof rule === \"string\") {\n    return title === rule ? [] : fail(`Expected title \"${rule}\", but found ${found}`);\n  }\n\n  if (Array.isArray(rule)) {\n    if (title !== null && rule.includes(title)) return [];\n    return fail(`Expected one of ${rule.map((option) => `\"${option}\"`).join(\", \")}, but found ${found}`);\n  }\n\n  // { pattern }\n  if (title !== null && compilePattern(rule.pattern).test(title)) return [];\n  return fail(`Expected title matching /${rule.pattern}/, but found ${found}`);\n}\n","/**\n * The template DSL, as TypeScript. `schemas/lint/template.json` is the\n * authority that user input is validated against; this is the shape the rest of\n * the code reads once that validation has passed.\n *\n * Two things are worth knowing before reading it.\n *\n * A template *is* a rule. It describes the page, so it takes every rule key,\n * plus `title`, `types` and `extends`. It may not take `min` or `max`, because\n * a page is one page, and the loader refuses those two by hand.\n *\n * A rule's children are a **list**, not a map. The v1 format keyed section\n * rules by name and let YAML key order carry the grammar, which made the order\n * invisible to the schema and unspeakable in `extends`. A rule names itself\n * with `id` instead, and that is what `extends` targets.\n *\n * The block-rule keys are plural where the node model is singular. That is\n * deliberate: the node model names one node (`codeBlock`), while a template key\n * carries a count (`codeBlocks: { min: 1 }`).\n */\nimport type { ContentKind } from \"../types.js\";\nimport { compilePattern } from \"../rules/index.js\";\n\n/** Shared by every counted rule: how many of the thing there must be. */\nexport interface Occurrences {\n  /** Fewest occurrences. Absent means one. */\n  min?: number;\n  /** Most occurrences. Absent is unbounded; `0` forbids. */\n  max?: number;\n}\n\n/**\n * What a rule's `heading` may say.\n *\n * `undefined` (the key absent) matches any heading or none. A string is exact\n * text, a list is one-of, `{ pattern }` is an unanchored regular expression,\n * and `false` means the section has no heading of its own.\n */\nexport type HeadingRule = string | string[] | { pattern: string } | false;\n\n/**\n * Attributes a node must carry. A string is the required value, `true`\n * requires the attribute's presence, and `false` requires its absence.\n */\nexport type AttributesRule = Record<string, string | boolean>;\n\n/** `paragraphs:` - how many paragraphs, and what each must look like. */\nexport interface ParagraphsRule extends Occurrences {\n  /** Unanchored regular expression every paragraph in the run must match. */\n  pattern?: string;\n}\n\n/** `codeBlocks:` - how many code blocks, and how they are tagged. */\nexport interface CodeBlocksRule extends Occurrences {\n  /** Language, or languages, every code block must declare one of. */\n  language?: string | string[];\n  /** Info-string tail after the language; narrows which blocks count. */\n  fenceInfo?: string;\n}\n\n/** `lists.items:` - how many items per list, and what each item holds. */\nexport interface ListItemsRule extends Occurrences {\n  sequence?: BlockRule[];\n  contains?: BlockRule;\n}\n\n/** `lists:` - how many lists, whether they are ordered, and item rules. */\nexport interface ListsRule extends Occurrences {\n  ordered?: boolean;\n  items?: ListItemsRule;\n}\n\n/** `tables:` - how many tables, and the header cells in order. */\nexport interface TablesRule extends Occurrences {\n  columns?: string[];\n}\n\n/** `admonitions:` - how many, and of which variant. */\nexport interface AdmonitionsRule extends Occurrences {\n  variant?: \"note\" | \"tip\" | \"important\" | \"caution\" | \"warning\" | \"danger\";\n}\n\n/** `images:` - how many, and what they point at. */\nexport interface ImagesRule extends Occurrences {\n  url?: string;\n  alt?: string;\n  attributes?: AttributesRule;\n}\n\n/** `elements:` - how many named wrappers, and what they hold. */\nexport interface ElementsRule extends Occurrences {\n  /** Name, or names, an element must carry to be counted by this rule. */\n  tag?: string | string[];\n  attributes?: AttributesRule;\n  sequence?: BlockRule[];\n  contains?: BlockRule;\n}\n\n/**\n * What a section holds, keyed by content kind.\n *\n * One of these is a whole `contains:`. As an entry of `sequence:` exactly one\n * key is set, and it names the kind expected at that position.\n */\nexport interface BlockRule {\n  paragraphs?: ParagraphsRule;\n  codeBlocks?: CodeBlocksRule;\n  lists?: ListsRule;\n  tables?: TablesRule;\n  admonitions?: AdmonitionsRule;\n  images?: ImagesRule;\n  blockquotes?: Occurrences;\n  definitionLists?: Occurrences;\n  elements?: ElementsRule;\n}\n\n/** One block-rule key: a content kind, spelled plural. */\nexport type BlockKind = keyof BlockRule;\n\n/** Every block-rule key, in the order the schema declares them. */\nexport const BLOCK_KINDS: readonly BlockKind[] = [\n  \"paragraphs\",\n  \"codeBlocks\",\n  \"lists\",\n  \"tables\",\n  \"admonitions\",\n  \"images\",\n  \"blockquotes\",\n  \"definitionLists\",\n  \"elements\",\n];\n\n/**\n * The node a block-rule key counts: `codeBlocks` counts `codeBlock` nodes.\n *\n * It is what lets the validator ask a parser whether a rule can run at all -\n * a parser declares the kinds it emits, and a rule about a kind absent from\n * that list is reported rather than silently passing.\n *\n * `rules/sequence.ts` holds the same map, written against the rules' own copy\n * of the DSL. The duplication is the one this file's header describes: the two\n * vocabularies are kept apart deliberately, and this is the copy the loader and\n * the validator read.\n */\nexport const BLOCK_KIND_NODE: Record<BlockKind, ContentKind> = {\n  paragraphs: \"paragraph\",\n  codeBlocks: \"codeBlock\",\n  lists: \"list\",\n  tables: \"table\",\n  admonitions: \"admonition\",\n  images: \"image\",\n  blockquotes: \"blockquote\",\n  definitionLists: \"definitionList\",\n  elements: \"element\",\n};\n\n/** One rule: a section of the page, or a repeated run of sections. */\nexport interface Rule extends Occurrences {\n  /** Handle, unique among siblings. `extends` targets it. */\n  id?: string;\n  /** Prose description of what the rule is for. Never checked. */\n  description?: string;\n  heading?: HeadingRule;\n  /** Rules matched in order as one unit, repeated by this rule's `min`/`max`. */\n  repeat?: Rule[];\n  /** What the section holds, in order. Not combinable with `contains`. */\n  sequence?: BlockRule[];\n  /** What the section holds, in any order. Not combinable with `sequence`. */\n  contains?: BlockRule;\n  /** Rules for the subsections, in document order. */\n  sections?: Rule[];\n}\n\n/** One doctype template: the rule that describes a whole page. */\nexport interface Template extends Rule {\n  /** Human-readable name, shown by `manni lint templates`. */\n  title?: string;\n  /** Doctypes this template serves, matched against a page's `type`. */\n  types?: string[];\n  /** Built-in id, path, or URL to inherit from. */\n  extends?: string;\n}\n\n/** A template file: named templates plus reusable `$ref` targets. */\nexport interface TemplateFile {\n  /** Published schema URL, for editors. Ignored by the linter. */\n  $schema?: string;\n  templates?: Record<string, Template>;\n  components?: Record<string, unknown>;\n  info?: Record<string, unknown>;\n}\n\n/**\n * A rule is a wildcard when it says nothing about its heading.\n *\n * It then matches any heading, and matches a section with none. `heading:\n * false` is not a wildcard: it states that the section has no heading of its\n * own, which is as specific as naming one.\n */\nexport function isWildcard(rule: Rule): boolean {\n  return rule.heading === undefined;\n}\n\n/**\n * How many sections a rule claims: `min` defaulting to one, and `max` as\n * written, with `null` for unbounded.\n *\n * The defaults live here rather than in the schema. A default written into the\n * data by Ajv is indistinguishable from a value the author typed, so it wins\n * the `extends` merge against the parent's real value.\n *\n * One default is not the naive `min ?? 1`. `max: 0` is how the format forbids\n * a thing outright, and a bare `max: 0` has to be satisfiable by a page that\n * truly has none of it. A blanket \"min defaults to 1\" makes it unsatisfiable -\n * at least one demanded, at most zero permitted - so `min` defaults to 0\n * exactly when `max` is written as `0` and `min` itself is not, and to 1\n * otherwise. `checkCount` in `rules/index.ts` states the same rule for the\n * content counts; the two agree deliberately.\n */\nexport function occurrenceRange(rule: Occurrences): {\n  min: number;\n  max: number | null;\n} {\n  return { min: rule.min ?? (rule.max === 0 ? 0 : 1), max: rule.max ?? null };\n}\n\n/** Whether a section's title satisfies a rule's `heading`. */\nexport function headingMatches(\n  heading: HeadingRule | undefined,\n  title: string | null,\n): boolean {\n  if (heading === undefined) return true;\n  if (heading === false) return title === null;\n  if (title === null) return false;\n  if (typeof heading === \"string\") return title === heading;\n  if (Array.isArray(heading)) return heading.includes(title);\n  return compilePattern(heading.pattern).test(title);\n}\n","/**\n * Decide which rule describes which section, by alignment.\n *\n * A rule list is a regular expression over section predicates, and a document's\n * sibling sections are the string. The matcher compiles the first and aligns\n * the second against it at minimum cost:\n *\n *  1. Each rule contributes one predicate on a heading. `min`/`max` is counted\n *     repetition, and `repeat:` is a parenthesised subexpression.\n *  2. Bounded counts expand into copies; an absent `max` becomes a self-loop.\n *  3. Four edits close the gap between rules and sections: a *match* (the\n *     predicate holds), a *coercion* (a rule claiming one section takes a\n *     section its heading rejects), a *skipped rule* (a required occurrence\n *     consumes nothing) and a *skipped section* (no rule consumes it).\n *  4. Viterbi over a (sections + 1) x states lattice finds the cheapest edit\n *     sequence. Deletions can form zero-consuming cycles, so each column is\n *     closed with Dijkstra rather than a topological sweep; all weights are\n *     non-negative.\n *  5. Skipped rules become `missing_section` (or one `missing_group` for a\n *     `repeat` copy that is absent whole), skipped sections become\n *     `unexpected_section`, and every match is handed to the content rules.\n *\n * The predecessor of this file walked the rules left to right with no\n * backtracking, and each of its eight hand-written behaviours is now a\n * consequence of a weight or a tie-break instead of a special case. The two it\n * could not express are what forced the change: a rule list with counted\n * repetition is not a sequence of one-shot decisions, and a greedy walk has to\n * guess which of two rules wants a section before it has seen the rest.\n *\n * Heading mismatches are deliberately not reported here. This module pairs; the\n * content rules report `heading_error` on the pair it produced. `validator.ts`\n * explains why the two are separate.\n */\nimport { LintError } from \"../types.js\";\nimport type { Finding, Position, SectionNode } from \"../types.js\";\nimport { headingMatches, isWildcard, occurrenceRange } from \"./template.js\";\nimport type { Rule } from \"./template.js\";\n\n/* -------------------------------------------------------------------------- *\n * The cost model, which is interface\n * -------------------------------------------------------------------------- */\n\n/**\n * What each edit costs, in the units the alignment minimises.\n *\n * These weights are **interface, not implementation**. They decide which\n * findings a document produces, so changing one changes the report for\n * documents nobody edited - the same class of change as renaming a flag.\n * `test/lint/unit/match.test.ts` pins them, and the templates reference prints\n * them.\n *\n * Skipping an occurrence at or above its rule's `min` is free; only a required\n * occurrence pays `skipRule`.\n *\n * Coercion is open only to a *required* occurrence of a rule whose `max` is 1.\n * Both halves of that earn their place. Without the `max: 1` half a repeating\n * rule adopts any stray section for 1 rather than letting it report as\n * unexpected for 2. Without the \"required\" half an optional rule does the same\n * thing for the same reason, and there it is plainly wrong: standing aside\n * costs an optional rule nothing, so coercing trades a clean report for a\n * heading error about a section the template never insisted on.\n */\nexport const ALIGNMENT_COSTS = {\n  match: 0,\n  coerce: 1,\n  skipRule: 2,\n  skipSection: 2,\n} as const;\n\n/**\n * How equal-cost alignments are settled, in order, after the total cost.\n *\n * Also interface: two of these decide real reports, and all three are stated in\n * words so the docs page and the code cannot drift apart.\n */\nexport const TIE_BREAKS = [\n  \"a rule that names its heading beats a wildcard taking the same section\",\n  \"a repeating rule prefers its sections adjacent\",\n  \"earliest rule, then the smallest edit sequence under match < coerce < skip-rule < skip-section\",\n] as const;\n\n/**\n * Most states a compiled rule list may expand to.\n *\n * Counted repetition is expanded into copies, so `max: 100000` on a rule with\n * five subsections is a hundred thousand copies of five states and a lattice\n * nobody asked for. The cap turns that into a template error naming the file,\n * rather than a lint run that appears to hang.\n */\nexport const STATE_LIMIT = 2000;\n\n/* -------------------------------------------------------------------------- *\n * What the matcher hands on\n * -------------------------------------------------------------------------- */\n\n/** One rule paired with the section it claimed. */\nexport interface Match {\n  /** The rule itself - a `repeat` group's member, never the group. */\n  rule: Rule;\n  section: SectionNode;\n  /**\n   * True when the rule was paired with a section whose heading does not\n   * satisfy it, because nothing else could claim that section. Keeps the\n   * precise \"Expected title X, but found Y\" report for the common one-for-one\n   * case instead of degrading it into missing + unexpected.\n   */\n  coerced: boolean;\n}\n\nexport interface MatchResult {\n  matches: Match[];\n  findings: Finding[];\n}\n\nexport interface MatchOptions {\n  /** Section these are the subsections of, for anchoring a trailing gap. */\n  parent?: SectionNode | null;\n  /** File the rules came from. Used only to name the state-cap failure. */\n  source?: string;\n  /** Template within that file. Used only to name the state-cap failure. */\n  template?: string;\n}\n\n/* -------------------------------------------------------------------------- *\n * Compilation\n * -------------------------------------------------------------------------- */\n\n/**\n * One copy of a `repeat` group, and every leaf occurrence inside it.\n *\n * It exists so an absent copy can report once for the group. A copy whose\n * leaves were *all* skipped is a group that is not there at all, which reads\n * as one finding; a copy that matched some of them is a group that is there and\n * incomplete, whose absent members read better one by one.\n */\ninterface GroupCopy {\n  rule: Rule;\n  members: Occurrence[];\n}\n\n/** One occurrence of one rule: the chance to consume exactly one section. */\ninterface Occurrence {\n  rule: Rule;\n  /** Below the rule's `min`, so skipping it costs rather than being free. */\n  required: boolean;\n  /** Required and `max: 1`, so it may take a section its heading rejects. */\n  coercible: boolean;\n  /** Says nothing about its heading, so it loses ties to a rule that does. */\n  wildcard: boolean;\n  /** Enclosing `repeat` copies, outermost first. */\n  groups: GroupCopy[];\n}\n\ninterface Eps {\n  from: number;\n  to: number;\n  cost: number;\n  rank: number;\n  /** Set when this edge is a rule being skipped rather than structure. */\n  occ: Occurrence | null;\n}\n\ninterface Automaton {\n  states: number;\n  start: number;\n  accept: number;\n  /** The occurrence a state may consume a section through, if any. */\n  consume: (Occurrence | null)[];\n  /** Where that consumption lands. */\n  consumeTo: number[];\n  epsOut: Eps[][];\n  epsIn: Eps[][];\n  /** States strictly inside a repetition, where a skipped section breaks a run. */\n  inRepeat: boolean[];\n}\n\n/**\n * Edit ranks, used only to settle a tie the costs and the two structural\n * tie-breaks left open. Structural epsilons - entering, repeating and leaving a\n * self-loop - rank with `match`, because they are not edits at all and a path\n * must be free to leave a loop before it starts skipping the rules inside it.\n */\nconst RANK = {\n  match: 0,\n  structure: 0,\n  coerce: 1,\n  skipRule: 2,\n  skipSection: 3,\n} as const;\n\nconst NO_EPS: Eps[] = [];\n\n/**\n * States the rule list expands to, counted without building anything.\n *\n * Checked before compilation so a template with an absurd `max` fails on its\n * own terms rather than by exhausting memory. The two extra states per\n * unbounded rule are its self-loop's entry and exit.\n */\nfunction expandedStates(rules: Rule[]): number {\n  let total = 1;\n  for (const rule of rules) total += ruleStates(rule);\n  return total;\n}\n\nfunction ruleStates(rule: Rule): number {\n  let unit = 1;\n  if (rule.repeat) {\n    unit = 0;\n    for (const member of rule.repeat) unit += ruleStates(member);\n  }\n  const { min, max } = occurrenceRange(rule);\n  if (max === null) return unit * (Math.max(min, 0) + 1) + 2;\n  return unit * Math.max(0, max);\n}\n\nfunction listAt<T>(lists: T[][], index: number): T[] {\n  const list = lists[index];\n  if (list) return list;\n  const created: T[] = [];\n  lists[index] = created;\n  return created;\n}\n\n/**\n * Compile a rule list into an automaton over section predicates.\n *\n * Bounded repetition is unrolled: `min: 1, max: 3` is three copies, the first\n * required and the rest free to skip. An unbounded `max` is a self-loop after\n * the required copies, which is the only construct here that can consume\n * nothing and return to where it started - hence the Dijkstra in the alignment.\n */\nfunction compile(rules: Rule[]): Automaton {\n  const consume: (Occurrence | null)[] = [];\n  const consumeTo: number[] = [];\n  const epsOut: Eps[][] = [];\n  const epsIn: Eps[][] = [];\n  const inRepeat: boolean[] = [];\n\n  const newState = (): number => {\n    consume.push(null);\n    consumeTo.push(-1);\n    epsOut.push([]);\n    epsIn.push([]);\n    inRepeat.push(false);\n    return consume.length - 1;\n  };\n\n  const eps = (\n    from: number,\n    to: number,\n    cost: number,\n    rank: number,\n    occ: Occurrence | null,\n  ): void => {\n    const edge: Eps = { from, to, cost, rank, occ };\n    listAt(epsOut, from).push(edge);\n    listAt(epsIn, to).push(edge);\n  };\n\n  const leaf = (from: number, occ: Occurrence): number => {\n    const to = newState();\n    consume[from] = occ;\n    consumeTo[from] = to;\n    // Skipping the occurrence: free when the rule can do without it.\n    eps(from, to, occ.required ? ALIGNMENT_COSTS.skipRule : 0, RANK.skipRule, occ);\n    return to;\n  };\n\n  /** One copy of a rule's unit: its members, or the rule's own occurrence. */\n  const buildCopy = (\n    rule: Rule,\n    from: number,\n    groups: GroupCopy[],\n    required: boolean,\n  ): number => {\n    if (rule.repeat) {\n      const copy: GroupCopy = { rule, members: [] };\n      const nested = [...groups, copy];\n      let cursor = from;\n      for (const member of rule.repeat) {\n        cursor = buildRule(member, cursor, nested, required);\n      }\n      return cursor;\n    }\n    const { max } = occurrenceRange(rule);\n    const occ: Occurrence = {\n      rule,\n      required,\n      coercible: required && max === 1,\n      wildcard: isWildcard(rule),\n      groups,\n    };\n    for (const group of groups) group.members.push(occ);\n    return leaf(from, occ);\n  };\n\n  function buildRule(\n    rule: Rule,\n    from: number,\n    groups: GroupCopy[],\n    context: boolean,\n  ): number {\n    const { min, max } = occurrenceRange(rule);\n    // `max` below `min` is refused by the loader where both are written; a bare\n    // `max: 0` still reaches here against the default `min: 1`, and means none.\n    const floor = max === null ? Math.max(min, 0) : Math.min(Math.max(min, 0), max);\n    const copies = max === null ? floor : Math.max(0, max);\n    const first = consume.length;\n\n    let cursor = from;\n    for (let copy = 0; copy < copies; copy++) {\n      cursor = buildCopy(rule, cursor, groups, context && copy < floor);\n    }\n\n    let end = cursor;\n    if (max === null) {\n      const loop = newState();\n      eps(cursor, loop, 0, RANK.structure, null);\n      const back = buildCopy(rule, loop, groups, false);\n      eps(back, loop, 0, RANK.structure, null);\n      end = newState();\n      eps(loop, end, 0, RANK.structure, null);\n    }\n\n    // A skipped section inside a repetition breaks the run it is inside, which\n    // tie-break 2 charges for. The repetition's own boundaries are not inside\n    // it: a section skipped before the first copy or after the last one sits\n    // beside the run rather than in the middle of it.\n    if (copies > 1 || max === null) {\n      for (let state = first; state < consume.length; state++) {\n        if (state !== end) inRepeat[state] = true;\n      }\n    }\n    return end;\n  }\n\n  const start = newState();\n  let cursor = start;\n  for (const rule of rules) cursor = buildRule(rule, cursor, [], true);\n\n  return {\n    states: consume.length,\n    start,\n    accept: cursor,\n    consume,\n    consumeTo,\n    epsOut,\n    epsIn,\n    inRepeat,\n  };\n}\n\n/**\n * Compiled rule lists, keyed by the array the template holds.\n *\n * A template is loaded once and applied to every page of its doctype, and every\n * level of every page re-enters this module. The automaton is immutable once\n * built, so one compilation serves them all.\n */\nconst compiled = new WeakMap<Rule[], Automaton>();\n\nfunction automatonFor(rules: Rule[], options: MatchOptions): Automaton {\n  const hit = compiled.get(rules);\n  if (hit) return hit;\n\n  const states = expandedStates(rules);\n  if (states > STATE_LIMIT) {\n    const source = options.source ?? \"template\";\n    // A template is referred to as `./templates.yaml#how-to` everywhere else,\n    // so a named template fragment joins the source the same way here. Absent\n    // a name - the file failed to compile a rule list outside any named\n    // template - there is nothing to put after a `#`, so the sentence falls\n    // back to its old, colon-joined phrasing.\n    const label =\n      options.template != null ? `${source}#${options.template}` : `${source}: the rule list`;\n    throw new LintError(\n      `${label} expands to ${states} states; the limit is ${STATE_LIMIT}. ` +\n        `Cap a max, or split the template.`,\n    );\n  }\n\n  const built = compile(rules);\n  compiled.set(rules, built);\n  return built;\n}\n\n/* -------------------------------------------------------------------------- *\n * Alignment\n * -------------------------------------------------------------------------- */\n\ntype StepKind = \"match\" | \"coerce\" | \"skip-rule\" | \"skip-section\";\n\n/** One candidate edge out of a lattice node, during the forward walk. */\ninterface Move {\n  kind: StepKind;\n  /** State it lands in. */\n  to: number;\n  /** Section index it lands in - the same one unless a section was consumed. */\n  column: number;\n  occ: Occurrence | null;\n  /** This edge plus the cheapest completion from where it lands. */\n  total: number;\n  rank: number;\n}\n\ninterface Step {\n  kind: StepKind;\n  /** Section consumed, or where the cursor stood when a rule was skipped. */\n  index: number;\n  occ: Occurrence | null;\n}\n\n/** A section's heading, or `null` when it has none of its own. */\nfunction titleOf(section: SectionNode): string | null {\n  return section.titlePosition === null ? null : section.title;\n}\n\n/** Binary heap over (cost, state), smallest cost first. */\nclass Heap {\n  private readonly costs: number[] = [];\n  private readonly items: number[] = [];\n\n  get size(): number {\n    return this.items.length;\n  }\n\n  /*\n   * Every `?? 0` in this class is unreachable, and is here only because\n   * `noUncheckedIndexedAccess` cannot see the bounds the arithmetic already\n   * guarantees. `costs` and `items` are pushed and popped together and so\n   * always have the same length; `child` is the index just pushed, and\n   * `parent = (child - 1) >> 1` is in bounds whenever `child > 0`; `left` and\n   * `right` are compared against `length` before they are read.\n   *\n   * Worth stating rather than leaving to inference: were an index ever out of\n   * bounds, the fallback would read as cost 0, quietly inverting the heap\n   * order rather than throwing. It is a type-checker concession, not a\n   * defensive default.\n   */\n  push(cost: number, item: number): void {\n    this.costs.push(cost);\n    this.items.push(item);\n    let child = this.items.length - 1;\n    while (child > 0) {\n      const parent = (child - 1) >> 1;\n      if ((this.costs[parent] ?? 0) <= (this.costs[child] ?? 0)) break;\n      this.swap(parent, child);\n      child = parent;\n    }\n  }\n\n  pop(): { cost: number; item: number } {\n    const cost = this.costs[0] ?? 0;\n    const item = this.items[0] ?? 0;\n    const lastCost = this.costs.pop();\n    const lastItem = this.items.pop();\n    if (this.items.length > 0 && lastCost !== undefined && lastItem !== undefined) {\n      this.costs[0] = lastCost;\n      this.items[0] = lastItem;\n      let parent = 0;\n      for (;;) {\n        const left = parent * 2 + 1;\n        const right = left + 1;\n        let smallest = parent;\n        if (left < this.items.length && (this.costs[left] ?? 0) < (this.costs[smallest] ?? 0)) {\n          smallest = left;\n        }\n        if (right < this.items.length && (this.costs[right] ?? 0) < (this.costs[smallest] ?? 0)) {\n          smallest = right;\n        }\n        if (smallest === parent) break;\n        this.swap(parent, smallest);\n        parent = smallest;\n      }\n    }\n    return { cost, item };\n  }\n\n  private swap(a: number, b: number): void {\n    const cost = this.costs[a] ?? 0;\n    const item = this.items[a] ?? 0;\n    this.costs[a] = this.costs[b] ?? 0;\n    this.items[a] = this.items[b] ?? 0;\n    this.costs[b] = cost;\n    this.items[b] = item;\n  }\n}\n\n/**\n * The cheapest edit sequence turning the rule list into the section list.\n *\n * Costs are packed into one integer so the lattice can be a typed array:\n * `((primary * radix) + wildcards) * radix + brokenRuns`, compared as one\n * number, which is lexicographic because no component can reach the radix.\n *\n * The lattice is filled backwards, from the end of the document to the start,\n * and the path is then walked forwards. That order is what makes tie-break 3\n * expressible: with the cost of every remaining suffix already known, the walk\n * can take the lowest-ranked optimal edit at each step, which is exactly\n * \"earliest rule, then the smallest edit sequence\".\n */\nfunction align(sections: SectionNode[], nfa: Automaton): Step[] {\n  const n = sections.length;\n  const states = nfa.states;\n  const radix = 2 * (n + states) + 2;\n  const weigh = (primary: number, wildcards: number, brokenRuns: number): number =>\n    (primary * radix + wildcards) * radix + brokenRuns;\n\n  const SKIP_SECTION = weigh(ALIGNMENT_COSTS.skipSection, 0, 0);\n  const SKIP_SECTION_IN_RUN = weigh(ALIGNMENT_COSTS.skipSection, 0, 1);\n  const MATCH = weigh(ALIGNMENT_COSTS.match, 0, 0);\n  const MATCH_WILDCARD = weigh(ALIGNMENT_COSTS.match, 1, 0);\n  const COERCE = weigh(ALIGNMENT_COSTS.coerce, 0, 0);\n\n  /** What a state's consuming edge costs against one section, or null. */\n  const consumeCost = (\n    state: number,\n    index: number,\n  ): { cost: number; rank: number; to: number; occ: Occurrence } | null => {\n    const occ = nfa.consume[state];\n    const section = sections[index];\n    const to = nfa.consumeTo[state];\n    if (!occ || !section || to === undefined || to < 0) return null;\n    if (headingMatches(occ.rule.heading, titleOf(section))) {\n      const cost = occ.wildcard ? MATCH_WILDCARD : MATCH;\n      return { cost, rank: RANK.match, to, occ };\n    }\n    if (occ.coercible) return { cost: COERCE, rank: RANK.coerce, to, occ };\n    return null;\n  };\n\n  const skipSectionCost = (state: number): number =>\n    nfa.inRepeat[state] === true ? SKIP_SECTION_IN_RUN : SKIP_SECTION;\n\n  // dist[i * states + s]: cheapest way from (section i, state s) to the end.\n  const dist = new Float64Array((n + 1) * states).fill(Infinity);\n  const distAt = (slot: number): number => dist[slot] ?? Infinity;\n\n  for (let index = n; index >= 0; index--) {\n    const base = index * states;\n    const next = base + states;\n    const heap = new Heap();\n\n    for (let state = 0; state < states; state++) {\n      let best = Infinity;\n      if (index === n) {\n        if (state === nfa.accept) best = 0;\n      } else {\n        const step = consumeCost(state, index);\n        if (step) best = step.cost + distAt(next + step.to);\n        const skipped = skipSectionCost(state) + distAt(next + state);\n        if (skipped < best) best = skipped;\n      }\n      dist[base + state] = best;\n      if (best < Infinity) heap.push(best, state);\n    }\n\n    // Close the column under epsilon edges. They can form zero-consuming\n    // cycles - a `repeat` with `min: 0` and no `max` - so this is Dijkstra on\n    // the reversed epsilon graph rather than a sweep in state order.\n    const done = new Uint8Array(states);\n    while (heap.size > 0) {\n      const { cost, item } = heap.pop();\n      if (done[item] === 1 || cost > distAt(base + item)) continue;\n      done[item] = 1;\n      for (const edge of nfa.epsIn[item] ?? NO_EPS) {\n        const candidate = cost + edge.cost;\n        if (candidate < distAt(base + edge.from)) {\n          dist[base + edge.from] = candidate;\n          heap.push(candidate, edge.from);\n        }\n      }\n    }\n  }\n\n  if (distAt(nfa.start) === Infinity) {\n    // Every state has a skip-section edge and every occurrence a skip edge, so\n    // the accept state is always reachable. Reaching this would be a\n    // construction bug, not a template the user can fix.\n    throw new LintError(\"internal: no alignment exists for this rule list.\");\n  }\n\n  const steps: Step[] = [];\n  let index = 0;\n  let state = nfa.start;\n  let seen = new Set<number>([state]);\n\n  while (!(index === n && state === nfa.accept)) {\n    const moves: Move[] = [];\n\n    const offer = (\n      cost: number,\n      rank: number,\n      to: number,\n      column: number,\n      kind: StepKind,\n      occ: Occurrence | null,\n    ): void => {\n      const total = cost + distAt(column * states + to);\n      if (total === Infinity) return;\n      moves.push({ kind, to, column, occ, total, rank });\n    };\n\n    if (index < n) {\n      const step = consumeCost(state, index);\n      if (step) {\n        offer(\n          step.cost,\n          step.rank,\n          step.to,\n          index + 1,\n          step.rank === RANK.coerce ? \"coerce\" : \"match\",\n          step.occ,\n        );\n      }\n      offer(skipSectionCost(state), RANK.skipSection, state, index + 1, \"skip-section\", null);\n    }\n    for (const edge of nfa.epsOut[state] ?? NO_EPS) {\n      if (seen.has(edge.to)) continue;\n      offer(edge.cost, edge.rank, edge.to, index, \"skip-rule\", edge.occ);\n    }\n\n    // Cheapest first; then the lowest-ranked edit, which is tie-break 3; then\n    // the earliest state, so the walk is reproducible to the edge.\n    let move: Move | undefined;\n    for (const candidate of moves) {\n      if (\n        move === undefined ||\n        candidate.total < move.total ||\n        (candidate.total === move.total && candidate.rank < move.rank) ||\n        (candidate.total === move.total &&\n          candidate.rank === move.rank &&\n          candidate.to < move.to)\n      ) {\n        move = candidate;\n      }\n    }\n    if (move === undefined) {\n      throw new LintError(\"internal: the alignment could not be reconstructed.\");\n    }\n\n    if (move.kind !== \"skip-rule\" || move.occ !== null) {\n      steps.push({ kind: move.kind, index, occ: move.occ });\n    }\n    if (move.column !== index) {\n      index = move.column;\n      seen = new Set<number>();\n    }\n    state = move.to;\n    seen.add(state);\n  }\n\n  return steps;\n}\n\n/* -------------------------------------------------------------------------- *\n * Findings\n * -------------------------------------------------------------------------- */\n\nfunction collapse(point: Position[\"end\"]): Position {\n  return { start: { ...point }, end: { ...point } };\n}\n\n/**\n * Where a finding about the cursor position lands.\n *\n * A gap in the middle of a document anchors on the section standing where the\n * missing one should be. A gap at the *end* has no such section, and anchoring\n * on the parent - which is what the previous matcher did - spans the parent's\n * whole subtree, so the finding starts at the parent's heading and sorts to the\n * top of a report about the bottom of the file. It anchors at the parent's end\n * instead, which is where the section would have gone.\n */\nfunction anchor(\n  index: number,\n  sections: SectionNode[],\n  parent: SectionNode | null,\n): { heading: string | null; position: Position } {\n  const section = sections[index];\n  if (section) {\n    return { heading: section.title || null, position: section.position };\n  }\n  if (parent) {\n    return { heading: parent.title || null, position: collapse(parent.position.end) };\n  }\n  const last = sections[sections.length - 1];\n  if (last) return { heading: null, position: collapse(last.position.end) };\n  return { heading: null, position: collapse({ line: 1, column: 1, offset: 0 }) };\n}\n\n/** How a rule's heading reads inside a longer sentence. */\nfunction describeHeading(rule: Rule): string {\n  const heading = rule.heading;\n  if (typeof heading === \"string\") return `\"${heading}\"`;\n  if (Array.isArray(heading)) return heading.map((text) => `\"${text}\"`).join(\", \");\n  if (heading === false) return \"a section with no heading\";\n  if (heading !== undefined) return `/${heading.pattern}/`;\n  return rule.id === undefined ? \"any section\" : `\"${rule.id}\"`;\n}\n\n/**\n * What an absent occurrence is called.\n *\n * A rule names itself by its heading where it has one, because that is the text\n * the reader will type into the document. A wildcard has only its `id`, which\n * is why one is worth writing.\n */\nfunction missingMessage(rule: Rule): string {\n  const heading = rule.heading;\n  if (typeof heading === \"string\") return `Missing section \"${heading}\"`;\n  if (Array.isArray(heading)) {\n    return `Missing one of ${heading.map((text) => `\"${text}\"`).join(\", \")}`;\n  }\n  if (heading === false) return \"Missing section without a heading\";\n  if (heading !== undefined) return `Missing section matching /${heading.pattern}/`;\n  return rule.id === undefined ? \"Missing section\" : `Missing section \"${rule.id}\"`;\n}\n\nfunction missingGroupMessage(copy: GroupCopy): string {\n  const members = (copy.rule.repeat ?? []).map(describeHeading).join(\" followed by \");\n  const name = copy.rule.id === undefined ? \"\" : ` \"${copy.rule.id}\"`;\n  return `Missing group${name}: expected ${members}`;\n}\n\nfunction unexpectedMessage(section: SectionNode): string {\n  const what =\n    section.titlePosition === null\n      ? \"Unexpected section without a heading\"\n      : `Unexpected section \"${section.title}\"`;\n  return `${what}. Add a trailing rule with min: 0 to allow sections the template does not describe.`;\n}\n\n/* -------------------------------------------------------------------------- *\n * The entry point\n * -------------------------------------------------------------------------- */\n\n/**\n * Align `sections` against `rules` and say what is missing, what is extra, and\n * which rule describes which section.\n *\n * `rules` being absent means the template says nothing about this level, which\n * is silence rather than \"no sections allowed\". An empty list is the other\n * thing: a rule list that describes no sections, so every section is\n * unexpected.\n */\nexport function matchSections(\n  sections: SectionNode[],\n  rules: Rule[] | undefined,\n  options: MatchOptions = {},\n): MatchResult {\n  const matches: Match[] = [];\n  const findings: Finding[] = [];\n  if (!rules) return { matches, findings };\n\n  const parent = options.parent ?? null;\n  const nfa = automatonFor(rules, options);\n  const steps = align(sections, nfa);\n\n  const taken = new Set<Occurrence>();\n  for (const step of steps) {\n    if ((step.kind === \"match\" || step.kind === \"coerce\") && step.occ) {\n      taken.add(step.occ);\n    }\n  }\n\n  /** The outermost enclosing `repeat` copy that is absent whole, if any. */\n  const absentGroup = (occ: Occurrence): GroupCopy | null => {\n    for (const group of occ.groups) {\n      if (group.members.every((member) => !taken.has(member))) return group;\n    }\n    return null;\n  };\n\n  const reported = new Set<GroupCopy>();\n\n  for (const step of steps) {\n    const section = sections[step.index];\n    if ((step.kind === \"match\" || step.kind === \"coerce\") && step.occ && section) {\n      matches.push({\n        rule: step.occ.rule,\n        section,\n        coerced: step.kind === \"coerce\",\n      });\n      continue;\n    }\n\n    if (step.kind === \"skip-section\" && section) {\n      findings.push({\n        type: \"unexpected_section\",\n        heading: section.title || null,\n        message: unexpectedMessage(section),\n        position: section.position,\n        severity: \"error\",\n      });\n      continue;\n    }\n\n    if (step.kind !== \"skip-rule\" || !step.occ || !step.occ.required) continue;\n\n    const where = anchor(step.index, sections, parent);\n    const group = absentGroup(step.occ);\n    if (group) {\n      if (reported.has(group)) continue;\n      reported.add(group);\n      findings.push({\n        type: \"missing_group\",\n        heading: where.heading,\n        message: missingGroupMessage(group),\n        position: where.position,\n        severity: \"error\",\n      });\n      continue;\n    }\n\n    findings.push({\n      type: \"missing_section\",\n      heading: where.heading,\n      message: missingMessage(step.occ.rule),\n      position: where.position,\n      severity: \"error\",\n    });\n  }\n\n  return { matches, findings };\n}\n"],"mappings":";;;;;;AAiCO,SAAS,kBACd,SACA,MACA,KACW;AACX,MAAI,CAAC,KAAM,QAAO,CAAC;AAEnB,QAAM,aAAa,aAAa,OAAO;AACvC,QAAM,WAAW;AAAA,IACf,WAAW;AAAA,IACX;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAEA,QAAM,UAAU,KAAK;AACrB,MAAI,SAAS;AACX,UAAM,QAAQ,eAAe,OAAO;AACpC,eAAW,QAAQ,CAAC,WAAW,UAAU;AACvC,UAAI,CAAC,MAAM,KAAK,UAAU,IAAI,GAAG;AAC/B,iBAAS,KAAK;AAAA,UACZ,MAAM;AAAA,UACN,SAAS,IAAI;AAAA,UACb,SAAS,aAAa,QAAQ,CAAC,oBAAoB,OAAO;AAAA,UAC1D,UAAU,UAAU;AAAA,UACpB,UAAU;AAAA,QACZ,CAAC;AAAA,MACH;AAAA,IACF,CAAC;AAAA,EACH;AAEA,SAAO;AACT;;;ACjCO,SAAS,kBACd,SACA,MACA,KACW;AACX,MAAI,CAAC,KAAM,QAAO,CAAC;AAEnB,QAAM,aAAa,aAAa,OAAO;AACvC,QAAM,UAAU,KAAK,YACjB,WAAW,OAAO,CAAC,UAAU,iBAAiB,OAAO,KAAK,SAAmB,CAAC,IAC9E;AAEJ,QAAM,WAAW;AAAA,IACf,QAAQ;AAAA,IACR;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAEA,MAAI,KAAK,UAAU;AACjB,aAAS,KAAK,GAAG,eAAe,YAAY,KAAK,UAAU,GAAG,CAAC;AAAA,EACjE;AAEA,SAAO;AACT;AAEA,SAAS,iBAAiB,OAAiB,SAA0B;AACnE,SAAO,eAAe,OAAO,EAAE,KAAK,MAAM,aAAa,EAAE;AAC3D;AAGA,SAAS,eACP,YACA,UACA,KACW;AACX,QAAM,YAAY,MAAM,QAAQ,QAAQ,IAAI,WAAW,CAAC,QAAQ;AAChE,QAAM,OAAO,UAAU,CAAC;AACxB,MAAI,UAAU,WAAW,KAAK,SAAS,OAAW,QAAO,CAAC;AAE1D,QAAM,QACJ,UAAU,WAAW,IACjB,IAAI,IAAI,MACR,UAAU,UAAU,IAAI,CAAC,SAAS,IAAI,IAAI,GAAG,EAAE,KAAK,IAAI,CAAC;AAE/D,QAAM,WAAsB,CAAC;AAC7B,aAAW,QAAQ,CAAC,OAAO,UAAU;AACnC,QAAI,MAAM,aAAa,UAAa,UAAU,SAAS,MAAM,QAAQ,EAAG;AAExE,UAAM,QAAQ,MAAM,WAAW,cAAc,MAAM,QAAQ,MAAM;AACjE,aAAS,KAAK;AAAA,MACZ,MAAM;AAAA,MACN,SAAS,IAAI;AAAA,MACb,SAAS,uBAAuB,QAAQ,CAAC,eAAe,KAAK,KAAK,KAAK;AAAA,MACvE,UAAU,MAAM;AAAA,MAChB,UAAU;AAAA,IACZ,CAAC;AAAA,EACH,CAAC;AAED,SAAO;AACT;;;ACjEO,SAAS,cACd,SACA,MACA,KACW;AACX,MAAI,CAAC,KAAM,QAAO,CAAC;AAEnB,QAAM,SAAS,SAAS,OAAO;AAC/B,QAAM,WAAW,WAAW,OAAO,QAAQ,MAAM,SAAS,sBAAsB,GAAG;AAEnF,MAAI,KAAK,SAAS;AAChB,eAAW,SAAS,QAAQ;AAC1B,YAAM,SAAS,YAAY,KAAK;AAChC,UAAI,CAAC,YAAY,QAAQ,KAAK,OAAO,GAAG;AACtC,iBAAS,KAAK;AAAA,UACZ,MAAM;AAAA,UACN,SAAS,IAAI;AAAA,UACb,SAAS,0BAA0B,UAAU,KAAK,OAAO,CAAC,eAAe,UAAU,MAAM,CAAC;AAAA,UAC1F,UAAU,MAAM;AAAA,UAChB,UAAU;AAAA,QACZ,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AAEA,SAAS,YAAY,OAA4B;AAC/C,QAAM,SAAS,MAAM,SAAS,KAAK,CAAC,QAAQ,IAAI,MAAM;AACtD,SAAO,SAAS,OAAO,SAAS,IAAI,CAAC,SAAS,KAAK,IAAI,IAAI,CAAC;AAC9D;AAEA,SAAS,YAAY,QAAkB,UAA6B;AAClE,SAAO,OAAO,WAAW,SAAS,UAAU,OAAO,MAAM,CAAC,MAAM,UAAU,SAAS,SAAS,KAAK,CAAC;AACpG;;;ACrCO,SAAS,mBACd,SACA,MACA,KACW;AACX,MAAI,CAAC,KAAM,QAAO,CAAC;AAEnB,QAAM,cAAc,cAAc,OAAO;AACzC,QAAM,WAAW;AAAA,IACf,YAAY;AAAA,IACZ;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAEA,MAAI,KAAK,SAAS;AAChB,aAAS,KAAK,GAAG,aAAa,aAAa,KAAK,SAAS,GAAG,CAAC;AAAA,EAC/D;AAEA,SAAO;AACT;AAEA,SAAS,aACP,aACA,SACA,KACW;AACX,QAAM,WAAsB,CAAC;AAC7B,aAAW,cAAc,aAAa;AACpC,QAAI,WAAW,YAAY,SAAS;AAKlC,YAAM,QAAQ,WAAW,UACrB,eAAe,WAAW,OAAO,KACjC;AACJ,eAAS,KAAK;AAAA,QACZ,MAAM;AAAA,QACN,SAAS,IAAI;AAAA,QACb,SAAS,cAAc,OAAO,gBAAgB,KAAK;AAAA,QACnD,UAAU,WAAW;AAAA,QACrB,UAAU;AAAA,MACZ,CAAC;AAAA,IACH;AAAA,EACF;AACA,SAAO;AACT;;;AC7CO,SAAS,cACd,SACA,MACA,KACW;AACX,MAAI,CAAC,KAAM,QAAO,CAAC;AAEnB,QAAM,WAAW,SAAS,OAAO,EAAE,OAAO,CAAC,UAAU,QAAQ,OAAO,IAAI,CAAC;AACzE,SAAO,WAAW,SAAS,QAAQ,MAAM,SAAS,sBAAsB,GAAG;AAC7E;AAEA,SAAS,QAAQ,OAAkB,MAA2B;AAC5D,MAAI,KAAK,QAAQ,UAAa,MAAM,QAAQ,KAAK,IAAK,QAAO;AAC7D,MAAI,KAAK,QAAQ,UAAa,MAAM,QAAQ,KAAK,IAAK,QAAO;AAC7D,MAAI,KAAK,cAAc,OAAO,KAAK,KAAK,UAAU,EAAE,SAAS,EAAG,QAAO;AACvE,SAAO;AACT;;;AChCO,SAAS,mBACd,SACA,MACA,KACW;AACX,MAAI,CAAC,KAAM,QAAO,CAAC;AACnB,SAAO,WAAW,cAAc,OAAO,EAAE,QAAQ,MAAM,cAAc,2BAA2B,GAAG;AACrG;;;ACDO,SAAS,uBACd,SACA,MACA,KACW;AACX,MAAI,CAAC,KAAM,QAAO,CAAC;AACnB,SAAO;AAAA,IACL,kBAAkB,OAAO,EAAE;AAAA,IAC3B;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;;;ACAO,SAAS,UAAU,SAAsC;AAC9D,QAAM,OAAqB,CAAC;AAE5B,aAAW,QAAQ,SAAS;AAC1B,UAAM,UAAU,KAAK,KAAK,SAAS,CAAC;AACpC,QAAI,WAAW,QAAQ,SAAS,KAAK,MAAM;AACzC,cAAQ,MAAM,KAAK,IAAI;AACvB,cAAQ,WAAW;AAAA,QACjB,OAAO,QAAQ,SAAS;AAAA,QACxB,KAAK,KAAK,SAAS;AAAA,MACrB;AAAA,IACF,OAAO;AACL,WAAK,KAAK;AAAA,QACR,MAAM,KAAK;AAAA,QACX,OAAO,CAAC,IAAI;AAAA,QACZ,UAAU,EAAE,OAAO,KAAK,SAAS,OAAO,KAAK,KAAK,SAAS,IAAI;AAAA,MACjE,CAAC;AAAA,IACH;AAAA,EACF;AAEA,SAAO;AACT;AAGA,IAAM,gBAAgD;AAAA,EACpD,YAAY;AAAA,EACZ,YAAY;AAAA,EACZ,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,aAAa;AAAA,EACb,QAAQ;AAAA,EACR,aAAa;AAAA,EACb,iBAAiB;AAAA,EACjB,UAAU;AACZ;AAGA,SAAS,cAAc,MAA2B;AAChD,UAAQ,MAAM;AAAA,IACZ,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT;AAGE,aAAO;AAAA,EACX;AACF;AAGA,SAAS,MAAM,OAAoC;AACjD,aAAW,QAAQ,aAAa;AAC9B,QAAI,MAAM,IAAI,MAAM,OAAW,QAAO;AAAA,EACxC;AACA,SAAO;AACT;AAGO,SAAS,cACd,SACA,MACW;AACX,SAAO,gBAAgB,QAAQ,UAAU,MAAM,eAAe,OAAO,CAAC;AACxE;AAOO,SAAS,gBACd,SACA,MACA,KACW;AACX,MAAI,CAAC,KAAM,QAAO,CAAC;AAEnB,QAAM,OAAO,UAAU,OAAO;AAC9B,QAAM,gBAAgB,KAAK,IAAI,CAAC,UAAU;AACxC,UAAM,MAAM,MAAM,KAAK;AACvB,WAAO,MAAM,cAAc,GAAG,IAAI;AAAA,EACpC,CAAC;AACD,QAAM,cAAc,KAAK,IAAI,CAAC,QAAQ,IAAI,IAAI;AAE9C,QAAMA,WACJ,cAAc,WAAW,YAAY,UACrC,cAAc,MAAM,CAAC,MAAM,UAAU,SAAS,YAAY,KAAK,CAAC;AAElE,MAAI,CAACA,UAAS;AACZ,UAAM,WAAW,cAAc,IAAI,CAAC,SAAU,OAAO,cAAc,IAAI,IAAI,GAAI;AAC/E,UAAM,QAAQ,YAAY,SAAS,IAAI,YAAY,IAAI,aAAa,IAAI,CAAC,SAAS;AAClF,WAAO;AAAA,MACL;AAAA,QACE,MAAM;AAAA,QACN,SAAS,IAAI;AAAA,QACb,SAAS,YAAY,SAAS,KAAK,QAAQ,CAAC,eAAe,MAAM,KAAK,QAAQ,CAAC;AAAA,QAC/E,UAAU,IAAI;AAAA,QACd,UAAU;AAAA,MACZ;AAAA,IACF;AAAA,EACF;AAEA,QAAM,WAAsB,CAAC;AAC7B,OAAK,QAAQ,CAAC,KAAK,UAAU;AAC3B,UAAM,QAAQ,KAAK,KAAK;AACxB,QAAI,CAAC,MAAO;AACZ,UAAM,SAAsB,EAAE,SAAS,IAAI,SAAS,UAAU,IAAI,SAAS;AAI3E,aAAS,KAAK,GAAG,gBAAgB,IAAI,OAAO,OAAO,MAAM,CAAC;AAAA,EAC5D,CAAC;AAED,SAAO;AACT;;;AChIO,SAAS,gBACd,SACA,MACA,KACW;AACX,MAAI,CAAC,KAAM,QAAO,CAAC;AAEnB,QAAM,OAAO,KAAK,QAAQ,SAAY,SAAY,MAAM,QAAQ,KAAK,GAAG,IAAI,KAAK,MAAM,CAAC,KAAK,GAAG;AAChG,QAAM,WAAW,OAAO,WAAW,OAAO,EAAE,OAAO,CAAC,YAAY,KAAK,SAAS,QAAQ,IAAI,CAAC,IAAI,WAAW,OAAO;AAKjH,QAAM,OAAO,OACT,GAAG,KAAK,IAAI,CAAC,QAAQ,IAAI,GAAG,GAAG,EAAE,KAAK,MAAM,CAAC,aAC7C;AACJ,QAAM,WAAW,WAAW,SAAS,QAAQ,MAAM,MAAM,wBAAwB,GAAG;AAEpF,MAAI,KAAK,YAAY;AACnB,eAAW,WAAW,UAAU;AAC9B,eAAS,KAAK,GAAG,gBAAgB,SAAS,KAAK,YAAY,GAAG,CAAC;AAAA,IACjE;AAAA,EACF;AAOA,MAAI,KAAK,YAAY,KAAK,UAAU;AAClC,eAAW,WAAW,UAAU;AAC9B,YAAM,aAA0B,EAAE,SAAS,IAAI,SAAS,UAAU,QAAQ,SAAS;AACnF,eAAS,KAAK,GAAG,gBAAgB,QAAQ,UAAU,KAAK,UAAU,UAAU,CAAC;AAC7E,eAAS,KAAK,GAAG,gBAAgB,QAAQ,UAAU,KAAK,UAAU,UAAU,CAAC;AAAA,IAC/E;AAAA,EACF;AAEA,SAAO;AACT;AASA,SAAS,gBACP,SACA,MACA,KACW;AACX,QAAM,WAAsB,CAAC;AAC7B,aAAW,CAAC,KAAK,QAAQ,KAAK,OAAO,QAAQ,IAAI,GAAG;AAClD,UAAM,UAAU,SAAS,SAAS,KAAK,UAAU,GAAG;AACpD,QAAI,QAAS,UAAS,KAAK,OAAO;AAAA,EACpC;AACA,SAAO;AACT;AAEA,SAAS,SACP,SACA,KACA,UACA,KACgB;AAChB,QAAM,aAAa,QAAQ,cAAc,CAAC;AAC1C,QAAM,UAAU,OAAO;AACvB,QAAM,SAAS,WAAW,GAAG;AAE7B,QAAM,OAAO,CAAC,MAAc,YAA6B;AAAA,IACvD,MAAM;AAAA,IACN,SAAS,IAAI;AAAA,IACb,SAAS,iBAAiB,QAAQ,IAAI,aAAa,IAAI,SAAS,MAAM;AAAA,IACtE,UAAU,QAAQ;AAAA,IAClB,UAAU;AAAA,EACZ;AAEA,MAAI,aAAa,OAAO;AACtB,QAAI,CAAC,QAAS,QAAO;AACrB,UAAM,QAAQ,WAAW,OAAO,kBAAkB,GAAG,GAAG,KAAK,OAAO,MAAM,CAAC;AAC3E,WAAO,KAAK,gBAAgB,GAAG,IAAI,SAAS,KAAK,EAAE;AAAA,EACrD;AAEA,MAAI,CAAC,QAAS,QAAO,KAAK,cAAc,KAAK,QAAQ,GAAG,iBAAiB,GAAG,EAAE;AAC9E,MAAI,aAAa,KAAM,QAAO;AAC9B,MAAI,WAAW,KAAM,QAAO,KAAK,cAAc,KAAK,QAAQ,GAAG,OAAO,GAAG,mBAAmB;AAC5F,MAAI,WAAW,SAAU,QAAO,KAAK,cAAc,KAAK,QAAQ,GAAG,SAAS,GAAG,KAAK,OAAO,MAAM,CAAC,GAAG;AACrG,SAAO;AACT;AAEA,SAAS,cAAc,KAAa,UAAiC;AACnE,SAAO,aAAa,OAAO,YAAY,GAAG,KAAK,YAAY,GAAG,KAAK,QAAQ;AAC7E;;;AC7GO,SAAS,cACd,SACA,MACW;AACX,SAAO,gBAAgB,QAAQ,UAAU,MAAM,eAAe,OAAO,CAAC;AACxE;AAUO,SAAS,gBACd,SACA,MACA,KACW;AACX,MAAI,CAAC,KAAM,QAAO,CAAC;AAEnB,QAAM,WAAsB,CAAC;AAC7B,aAAW,QAAQ,aAAa;AAC9B,YAAQ,MAAM;AAAA,MACZ,KAAK;AACH,iBAAS,KAAK,GAAG,kBAAkB,SAAS,KAAK,YAAY,GAAG,CAAC;AACjE;AAAA,MACF,KAAK;AACH,iBAAS,KAAK,GAAG,kBAAkB,SAAS,KAAK,YAAY,GAAG,CAAC;AACjE;AAAA,MACF,KAAK;AACH,iBAAS,KAAK,GAAG,aAAa,SAAS,KAAK,OAAO,GAAG,CAAC;AACvD;AAAA,MACF,KAAK;AACH,iBAAS,KAAK,GAAG,cAAc,SAAS,KAAK,QAAQ,GAAG,CAAC;AACzD;AAAA,MACF,KAAK;AACH,iBAAS,KAAK,GAAG,mBAAmB,SAAS,KAAK,aAAa,GAAG,CAAC;AACnE;AAAA,MACF,KAAK;AACH,iBAAS,KAAK,GAAG,cAAc,SAAS,KAAK,QAAQ,GAAG,CAAC;AACzD;AAAA,MACF,KAAK;AACH,iBAAS,KAAK,GAAG,mBAAmB,SAAS,KAAK,aAAa,GAAG,CAAC;AACnE;AAAA,MACF,KAAK;AACH,iBAAS,KAAK,GAAG,uBAAuB,SAAS,KAAK,iBAAiB,GAAG,CAAC;AAC3E;AAAA,MACF,KAAK;AACH,iBAAS,KAAK,GAAG,gBAAgB,SAAS,KAAK,UAAU,GAAG,CAAC;AAC7D;AAAA,IACJ;AAAA,EACF;AACA,SAAO;AACT;;;ACrCO,SAAS,aACd,SACA,MACA,KACW;AACX,MAAI,CAAC,KAAM,QAAO,CAAC;AAEnB,QAAM,QAAQ,QAAQ,OAAO;AAC7B,QAAM,WAAW,WAAW,MAAM,QAAQ,MAAM,QAAQ,qBAAqB,GAAG;AAEhF,MAAI,KAAK,YAAY,QAAW;AAC9B,aAAS,KAAK,GAAG,aAAa,OAAO,KAAK,SAAS,GAAG,CAAC;AAAA,EACzD;AAEA,QAAM,QAAQ,KAAK;AACnB,MAAI,CAAC,MAAO,QAAO;AAEnB,WAAS,KAAK,GAAG,gBAAgB,OAAO,OAAO,GAAG,CAAC;AAEnD,MAAI,CAAC,MAAM,YAAY,CAAC,MAAM,SAAU,QAAO;AAE/C,aAAW,QAAQ,OAAO;AACxB,eAAW,QAAQ,KAAK,OAAO;AAC7B,YAAM,UAAuB,EAAE,SAAS,IAAI,SAAS,UAAU,KAAK,SAAS;AAC7E,UAAI,MAAM,UAAU;AAClB,iBAAS,KAAK,GAAG,gBAAgB,KAAK,UAAU,MAAM,UAAU,OAAO,CAAC;AAAA,MAC1E,WAAW,MAAM,UAAU;AACzB,iBAAS,KAAK,GAAG,gBAAgB,KAAK,UAAU,MAAM,UAAU,OAAO,CAAC;AAAA,MAC1E;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AAEA,SAAS,aAAa,OAAmB,SAAkB,KAA6B;AACtF,QAAM,WAAsB,CAAC;AAC7B,aAAW,QAAQ,OAAO;AACxB,QAAI,KAAK,YAAY,SAAS;AAC5B,eAAS,KAAK;AAAA,QACZ,MAAM;AAAA,QACN,SAAS,IAAI;AAAA,QACb,SAAS,UACL,wDACA;AAAA,QACJ,UAAU,KAAK;AAAA,QACf,UAAU;AAAA,MACZ,CAAC;AAAA,IACH;AAAA,EACF;AACA,SAAO;AACT;AAQA,SAAS,gBACP,OACA,OACA,KACW;AACX,QAAM,WAAsB,CAAC;AAC7B,QAAM,MAAM,MAAM,QAAQ,MAAM,QAAQ,IAAI,IAAI;AAChD,QAAM,MAAM,MAAM,OAAO;AAEzB,MAAI,QAAQ,MAAM;AAChB,UAAM,WAAW,MAAM,KAAK,CAAC,SAAS,KAAK,MAAM,SAAS,GAAG;AAC7D,QAAI,UAAU;AACZ,eAAS,KAAK;AAAA,QACZ,MAAM;AAAA,QACN,SAAS,IAAI;AAAA,QACb,SAAS,oBAAoB,GAAG,+BAA+B,SAAS,MAAM,MAAM;AAAA,QACpF,UAAU,SAAS;AAAA,QACnB,UAAU;AAAA,MACZ,CAAC;AAAA,IACH;AAAA,EACF;AAEA,MAAI,MAAM,GAAG;AACX,UAAM,WAAW,MAAM,KAAK,CAAC,SAAS,KAAK,MAAM,SAAS,GAAG;AAC7D,QAAI,UAAU;AACZ,eAAS,KAAK;AAAA,QACZ,MAAM;AAAA,QACN,SAAS,IAAI;AAAA,QACb,SAAS,qBAAqB,GAAG,+BAA+B,SAAS,MAAM,MAAM;AAAA,QACrF,UAAU,SAAS;AAAA,QACnB,UAAU;AAAA,MACZ,CAAC;AAAA,IACH;AAAA,EACF;AAEA,SAAO;AACT;;;ACyBO,IAAM,cAAoC;AAAA,EAC/C;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AA0BO,SAAS,eAAe,SAAmC;AAChE,SAAO,EAAE,SAAS,QAAQ,SAAS,MAAM,UAAU,QAAQ,SAAS;AACtE;AASO,SAAS,aAAa,SAAyC;AACpE,SAAO,QAAQ,OAAO,CAAC,SAAgC,KAAK,SAAS,WAAW;AAClF;AAEO,SAAS,aAAa,SAAoC;AAC/D,SAAO,QAAQ,OAAO,CAAC,SAA2B,KAAK,SAAS,WAAW;AAC7E;AAEO,SAAS,QAAQ,SAAoC;AAC1D,SAAO,QAAQ,OAAO,CAAC,SAA2B,KAAK,SAAS,MAAM;AACxE;AAEO,SAAS,SAAS,SAAqC;AAC5D,SAAO,QAAQ,OAAO,CAAC,SAA4B,KAAK,SAAS,OAAO;AAC1E;AAEO,SAAS,cAAc,SAA0C;AACtE,SAAO,QAAQ,OAAO,CAAC,SAAiC,KAAK,SAAS,YAAY;AACpF;AAEO,SAAS,SAAS,SAAqC;AAC5D,SAAO,QAAQ,OAAO,CAAC,SAA4B,KAAK,SAAS,OAAO;AAC1E;AAEO,SAAS,cAAc,SAA0C;AACtE,SAAO,QAAQ,OAAO,CAAC,SAAiC,KAAK,SAAS,YAAY;AACpF;AAEO,SAAS,kBAAkB,SAA8C;AAC9E,SAAO,QAAQ,OAAO,CAAC,SAAqC,KAAK,SAAS,gBAAgB;AAC5F;AAEO,SAAS,WAAW,SAAuC;AAChE,SAAO,QAAQ,OAAO,CAAC,SAA8B,KAAK,SAAS,SAAS;AAC9E;AAOA,SAAS,OAAO,MAAc,OAAuB;AACnD,SAAO,UAAU,IAAI,OAAO,GAAG,IAAI;AACrC;AAGO,SAAS,UAAU,OAAyB;AACjD,SAAO,MAAM,IAAI,CAAC,SAAS,IAAI,IAAI,GAAG,EAAE,KAAK,IAAI;AACnD;AAeO,SAAS,WACd,OACA,MACA,MACA,MACA,KACW;AACX,QAAM,WAAsB,CAAC;AAC7B,QAAM,MAAM,KAAK,QAAQ,KAAK,QAAQ,IAAI,IAAI;AAC9C,QAAM,MAAM,KAAK,OAAO;AAExB,MAAI,QAAQ,KAAK;AACf,aAAS,KAAK;AAAA,MACZ;AAAA,MACA,SAAS,IAAI;AAAA,MACb,SAAS,qBAAqB,GAAG,IAAI,OAAO,MAAM,GAAG,CAAC,eAAe,KAAK;AAAA,MAC1E,UAAU,IAAI;AAAA,MACd,UAAU;AAAA,IACZ,CAAC;AAAA,EACH;AAEA,MAAI,QAAQ,QAAQ,QAAQ,KAAK;AAC/B,aAAS,KAAK;AAAA,MACZ;AAAA,MACA,SAAS,IAAI;AAAA,MACb,SAAS,oBAAoB,GAAG,IAAI,OAAO,MAAM,GAAG,CAAC,eAAe,KAAK;AAAA,MACzE,UAAU,IAAI;AAAA,MACd,UAAU;AAAA,IACZ,CAAC;AAAA,EACH;AAEA,SAAO;AACT;AAgDA,IAAM,WAAW,oBAAI,IAAoB;AAElC,SAAS,eAAe,SAAyB;AAQtD,QAAM,MAAM,SAAS,IAAI,OAAO;AAChC,MAAI,IAAK,QAAO;AAChB,MAAI;AACF,UAAM,QAAQ,IAAI,OAAO,OAAO;AAChC,aAAS,IAAI,SAAS,KAAK;AAC3B,WAAO;AAAA,EACT,SAAS,OAAO;AACd,UAAM,SAAS,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AACpE,UAAM,IAAI,UAAU,oBAAoB,OAAO,MAAM,MAAM,EAAE;AAAA,EAC/D;AACF;AAGO,SAAS,oBAA0B;AACxC,WAAS,MAAM;AACjB;;;AC7VA,SAAS,SAAS,SAAqC;AACrD,SAAO,QAAQ,kBAAkB,OAAO,OAAO,QAAQ;AACzD;AAGO,SAAS,aACd,SACA,MACW;AACX,MAAI,SAAS,OAAW,QAAO,CAAC;AAIhC,QAAM,WAAW,QAAQ,iBAAiB,QAAQ;AAClD,QAAM,QAAQ,SAAS,OAAO;AAC9B,QAAM,QAAQ,UAAU,OAAO,eAAe,IAAI,KAAK;AAEvD,QAAM,OAAO,CAAC,YAA+B;AAAA,IAC3C;AAAA,MACE,MAAM;AAAA;AAAA;AAAA;AAAA;AAAA,MAKN,SAAS,QAAQ,SAAS;AAAA,MAC1B;AAAA,MACA;AAAA,MACA,UAAU;AAAA,IACZ;AAAA,EACF;AAEA,MAAI,SAAS,OAAO;AAClB,WAAO,UAAU,OAAO,CAAC,IAAI,KAAK,6CAA6C,KAAK,EAAE;AAAA,EACxF;AAEA,MAAI,OAAO,SAAS,UAAU;AAC5B,WAAO,UAAU,OAAO,CAAC,IAAI,KAAK,mBAAmB,IAAI,gBAAgB,KAAK,EAAE;AAAA,EAClF;AAEA,MAAI,MAAM,QAAQ,IAAI,GAAG;AACvB,QAAI,UAAU,QAAQ,KAAK,SAAS,KAAK,EAAG,QAAO,CAAC;AACpD,WAAO,KAAK,mBAAmB,KAAK,IAAI,CAAC,WAAW,IAAI,MAAM,GAAG,EAAE,KAAK,IAAI,CAAC,eAAe,KAAK,EAAE;AAAA,EACrG;AAGA,MAAI,UAAU,QAAQ,eAAe,KAAK,OAAO,EAAE,KAAK,KAAK,EAAG,QAAO,CAAC;AACxE,SAAO,KAAK,4BAA4B,KAAK,OAAO,gBAAgB,KAAK,EAAE;AAC7E;;;ACmDO,IAAMC,eAAoC;AAAA,EAC/C;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAcO,IAAM,kBAAkD;AAAA,EAC7D,YAAY;AAAA,EACZ,YAAY;AAAA,EACZ,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,aAAa;AAAA,EACb,QAAQ;AAAA,EACR,aAAa;AAAA,EACb,iBAAiB;AAAA,EACjB,UAAU;AACZ;AA6CO,SAAS,WAAW,MAAqB;AAC9C,SAAO,KAAK,YAAY;AAC1B;AAkBO,SAAS,gBAAgB,MAG9B;AACA,SAAO,EAAE,KAAK,KAAK,QAAQ,KAAK,QAAQ,IAAI,IAAI,IAAI,KAAK,KAAK,OAAO,KAAK;AAC5E;AAGO,SAAS,eACd,SACA,OACS;AACT,MAAI,YAAY,OAAW,QAAO;AAClC,MAAI,YAAY,MAAO,QAAO,UAAU;AACxC,MAAI,UAAU,KAAM,QAAO;AAC3B,MAAI,OAAO,YAAY,SAAU,QAAO,UAAU;AAClD,MAAI,MAAM,QAAQ,OAAO,EAAG,QAAO,QAAQ,SAAS,KAAK;AACzD,SAAO,eAAe,QAAQ,OAAO,EAAE,KAAK,KAAK;AACnD;;;AC/KO,IAAM,kBAAkB;AAAA,EAC7B,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,UAAU;AAAA,EACV,aAAa;AACf;AAsBO,IAAM,cAAc;AA6F3B,IAAM,OAAO;AAAA,EACX,OAAO;AAAA,EACP,WAAW;AAAA,EACX,QAAQ;AAAA,EACR,UAAU;AAAA,EACV,aAAa;AACf;AAEA,IAAM,SAAgB,CAAC;AASvB,SAAS,eAAe,OAAuB;AAC7C,MAAI,QAAQ;AACZ,aAAW,QAAQ,MAAO,UAAS,WAAW,IAAI;AAClD,SAAO;AACT;AAEA,SAAS,WAAW,MAAoB;AACtC,MAAI,OAAO;AACX,MAAI,KAAK,QAAQ;AACf,WAAO;AACP,eAAW,UAAU,KAAK,OAAQ,SAAQ,WAAW,MAAM;AAAA,EAC7D;AACA,QAAM,EAAE,KAAK,IAAI,IAAI,gBAAgB,IAAI;AACzC,MAAI,QAAQ,KAAM,QAAO,QAAQ,KAAK,IAAI,KAAK,CAAC,IAAI,KAAK;AACzD,SAAO,OAAO,KAAK,IAAI,GAAG,GAAG;AAC/B;AAEA,SAAS,OAAU,OAAc,OAAoB;AACnD,QAAM,OAAO,MAAM,KAAK;AACxB,MAAI,KAAM,QAAO;AACjB,QAAM,UAAe,CAAC;AACtB,QAAM,KAAK,IAAI;AACf,SAAO;AACT;AAUA,SAAS,QAAQ,OAA0B;AACzC,QAAM,UAAiC,CAAC;AACxC,QAAM,YAAsB,CAAC;AAC7B,QAAM,SAAkB,CAAC;AACzB,QAAM,QAAiB,CAAC;AACxB,QAAM,WAAsB,CAAC;AAE7B,QAAM,WAAW,MAAc;AAC7B,YAAQ,KAAK,IAAI;AACjB,cAAU,KAAK,EAAE;AACjB,WAAO,KAAK,CAAC,CAAC;AACd,UAAM,KAAK,CAAC,CAAC;AACb,aAAS,KAAK,KAAK;AACnB,WAAO,QAAQ,SAAS;AAAA,EAC1B;AAEA,QAAM,MAAM,CACV,MACA,IACA,MACA,MACA,QACS;AACT,UAAM,OAAY,EAAE,MAAM,IAAI,MAAM,MAAM,IAAI;AAC9C,WAAO,QAAQ,IAAI,EAAE,KAAK,IAAI;AAC9B,WAAO,OAAO,EAAE,EAAE,KAAK,IAAI;AAAA,EAC7B;AAEA,QAAM,OAAO,CAAC,MAAc,QAA4B;AACtD,UAAM,KAAK,SAAS;AACpB,YAAQ,IAAI,IAAI;AAChB,cAAU,IAAI,IAAI;AAElB,QAAI,MAAM,IAAI,IAAI,WAAW,gBAAgB,WAAW,GAAG,KAAK,UAAU,GAAG;AAC7E,WAAO;AAAA,EACT;AAGA,QAAM,YAAY,CAChB,MACA,MACA,QACA,aACW;AACX,QAAI,KAAK,QAAQ;AACf,YAAM,OAAkB,EAAE,MAAM,SAAS,CAAC,EAAE;AAC5C,YAAM,SAAS,CAAC,GAAG,QAAQ,IAAI;AAC/B,UAAIC,UAAS;AACb,iBAAW,UAAU,KAAK,QAAQ;AAChC,QAAAA,UAAS,UAAU,QAAQA,SAAQ,QAAQ,QAAQ;AAAA,MACrD;AACA,aAAOA;AAAA,IACT;AACA,UAAM,EAAE,IAAI,IAAI,gBAAgB,IAAI;AACpC,UAAM,MAAkB;AAAA,MACtB;AAAA,MACA;AAAA,MACA,WAAW,YAAY,QAAQ;AAAA,MAC/B,UAAU,WAAW,IAAI;AAAA,MACzB;AAAA,IACF;AACA,eAAW,SAAS,OAAQ,OAAM,QAAQ,KAAK,GAAG;AAClD,WAAO,KAAK,MAAM,GAAG;AAAA,EACvB;AAEA,WAAS,UACP,MACA,MACA,QACA,SACQ;AACR,UAAM,EAAE,KAAK,IAAI,IAAI,gBAAgB,IAAI;AAGzC,UAAM,QAAQ,QAAQ,OAAO,KAAK,IAAI,KAAK,CAAC,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,CAAC,GAAG,GAAG;AAC9E,UAAM,SAAS,QAAQ,OAAO,QAAQ,KAAK,IAAI,GAAG,GAAG;AACrD,UAAM,QAAQ,QAAQ;AAEtB,QAAIA,UAAS;AACb,aAAS,OAAO,GAAG,OAAO,QAAQ,QAAQ;AACxC,MAAAA,UAAS,UAAU,MAAMA,SAAQ,QAAQ,WAAW,OAAO,KAAK;AAAA,IAClE;AAEA,QAAI,MAAMA;AACV,QAAI,QAAQ,MAAM;AAChB,YAAM,OAAO,SAAS;AACtB,UAAIA,SAAQ,MAAM,GAAG,KAAK,WAAW,IAAI;AACzC,YAAM,OAAO,UAAU,MAAM,MAAM,QAAQ,KAAK;AAChD,UAAI,MAAM,MAAM,GAAG,KAAK,WAAW,IAAI;AACvC,YAAM,SAAS;AACf,UAAI,MAAM,KAAK,GAAG,KAAK,WAAW,IAAI;AAAA,IACxC;AAMA,QAAI,SAAS,KAAK,QAAQ,MAAM;AAC9B,eAAS,QAAQ,OAAO,QAAQ,QAAQ,QAAQ,SAAS;AACvD,YAAI,UAAU,IAAK,UAAS,KAAK,IAAI;AAAA,MACvC;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAEA,QAAM,QAAQ,SAAS;AACvB,MAAI,SAAS;AACb,aAAW,QAAQ,MAAO,UAAS,UAAU,MAAM,QAAQ,CAAC,GAAG,IAAI;AAEnE,SAAO;AAAA,IACL,QAAQ,QAAQ;AAAA,IAChB;AAAA,IACA,QAAQ;AAAA,IACR;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AASA,IAAMC,YAAW,oBAAI,QAA2B;AAEhD,SAAS,aAAa,OAAe,SAAkC;AACrE,QAAM,MAAMA,UAAS,IAAI,KAAK;AAC9B,MAAI,IAAK,QAAO;AAEhB,QAAM,SAAS,eAAe,KAAK;AACnC,MAAI,SAAS,aAAa;AACxB,UAAM,SAAS,QAAQ,UAAU;AAMjC,UAAM,QACJ,QAAQ,YAAY,OAAO,GAAG,MAAM,IAAI,QAAQ,QAAQ,KAAK,GAAG,MAAM;AACxE,UAAM,IAAI;AAAA,MACR,GAAG,KAAK,eAAe,MAAM,yBAAyB,WAAW;AAAA,IAEnE;AAAA,EACF;AAEA,QAAM,QAAQ,QAAQ,KAAK;AAC3B,EAAAA,UAAS,IAAI,OAAO,KAAK;AACzB,SAAO;AACT;AA6BA,SAAS,QAAQ,SAAqC;AACpD,SAAO,QAAQ,kBAAkB,OAAO,OAAO,QAAQ;AACzD;AAGA,IAAM,OAAN,MAAW;AAAA,EACQ,QAAkB,CAAC;AAAA,EACnB,QAAkB,CAAC;AAAA,EAEpC,IAAI,OAAe;AACjB,WAAO,KAAK,MAAM;AAAA,EACpB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAeA,KAAK,MAAc,MAAoB;AACrC,SAAK,MAAM,KAAK,IAAI;AACpB,SAAK,MAAM,KAAK,IAAI;AACpB,QAAI,QAAQ,KAAK,MAAM,SAAS;AAChC,WAAO,QAAQ,GAAG;AAChB,YAAM,SAAU,QAAQ,KAAM;AAC9B,WAAK,KAAK,MAAM,MAAM,KAAK,OAAO,KAAK,MAAM,KAAK,KAAK,GAAI;AAC3D,WAAK,KAAK,QAAQ,KAAK;AACvB,cAAQ;AAAA,IACV;AAAA,EACF;AAAA,EAEA,MAAsC;AACpC,UAAM,OAAO,KAAK,MAAM,CAAC,KAAK;AAC9B,UAAM,OAAO,KAAK,MAAM,CAAC,KAAK;AAC9B,UAAM,WAAW,KAAK,MAAM,IAAI;AAChC,UAAM,WAAW,KAAK,MAAM,IAAI;AAChC,QAAI,KAAK,MAAM,SAAS,KAAK,aAAa,UAAa,aAAa,QAAW;AAC7E,WAAK,MAAM,CAAC,IAAI;AAChB,WAAK,MAAM,CAAC,IAAI;AAChB,UAAI,SAAS;AACb,iBAAS;AACP,cAAM,OAAO,SAAS,IAAI;AAC1B,cAAM,QAAQ,OAAO;AACrB,YAAI,WAAW;AACf,YAAI,OAAO,KAAK,MAAM,WAAW,KAAK,MAAM,IAAI,KAAK,MAAM,KAAK,MAAM,QAAQ,KAAK,IAAI;AACrF,qBAAW;AAAA,QACb;AACA,YAAI,QAAQ,KAAK,MAAM,WAAW,KAAK,MAAM,KAAK,KAAK,MAAM,KAAK,MAAM,QAAQ,KAAK,IAAI;AACvF,qBAAW;AAAA,QACb;AACA,YAAI,aAAa,OAAQ;AACzB,aAAK,KAAK,QAAQ,QAAQ;AAC1B,iBAAS;AAAA,MACX;AAAA,IACF;AACA,WAAO,EAAE,MAAM,KAAK;AAAA,EACtB;AAAA,EAEQ,KAAK,GAAW,GAAiB;AACvC,UAAM,OAAO,KAAK,MAAM,CAAC,KAAK;AAC9B,UAAM,OAAO,KAAK,MAAM,CAAC,KAAK;AAC9B,SAAK,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC,KAAK;AACjC,SAAK,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC,KAAK;AACjC,SAAK,MAAM,CAAC,IAAI;AAChB,SAAK,MAAM,CAAC,IAAI;AAAA,EAClB;AACF;AAeA,SAAS,MAAM,UAAyB,KAAwB;AAC9D,QAAM,IAAI,SAAS;AACnB,QAAM,SAAS,IAAI;AACnB,QAAM,QAAQ,KAAK,IAAI,UAAU;AACjC,QAAM,QAAQ,CAAC,SAAiB,WAAmB,gBAChD,UAAU,QAAQ,aAAa,QAAQ;AAE1C,QAAM,eAAe,MAAM,gBAAgB,aAAa,GAAG,CAAC;AAC5D,QAAM,sBAAsB,MAAM,gBAAgB,aAAa,GAAG,CAAC;AACnE,QAAM,QAAQ,MAAM,gBAAgB,OAAO,GAAG,CAAC;AAC/C,QAAM,iBAAiB,MAAM,gBAAgB,OAAO,GAAG,CAAC;AACxD,QAAM,SAAS,MAAM,gBAAgB,QAAQ,GAAG,CAAC;AAGjD,QAAM,cAAc,CAClBC,QACAC,WACuE;AACvE,UAAM,MAAM,IAAI,QAAQD,MAAK;AAC7B,UAAM,UAAU,SAASC,MAAK;AAC9B,UAAM,KAAK,IAAI,UAAUD,MAAK;AAC9B,QAAI,CAAC,OAAO,CAAC,WAAW,OAAO,UAAa,KAAK,EAAG,QAAO;AAC3D,QAAI,eAAe,IAAI,KAAK,SAAS,QAAQ,OAAO,CAAC,GAAG;AACtD,YAAM,OAAO,IAAI,WAAW,iBAAiB;AAC7C,aAAO,EAAE,MAAM,MAAM,KAAK,OAAO,IAAI,IAAI;AAAA,IAC3C;AACA,QAAI,IAAI,UAAW,QAAO,EAAE,MAAM,QAAQ,MAAM,KAAK,QAAQ,IAAI,IAAI;AACrE,WAAO;AAAA,EACT;AAEA,QAAM,kBAAkB,CAACA,WACvB,IAAI,SAASA,MAAK,MAAM,OAAO,sBAAsB;AAGvD,QAAM,OAAO,IAAI,cAAc,IAAI,KAAK,MAAM,EAAE,KAAK,QAAQ;AAC7D,QAAM,SAAS,CAAC,SAAyB,KAAK,IAAI,KAAK;AAEvD,WAASC,SAAQ,GAAGA,UAAS,GAAGA,UAAS;AACvC,UAAM,OAAOA,SAAQ;AACrB,UAAM,OAAO,OAAO;AACpB,UAAM,OAAO,IAAI,KAAK;AAEtB,aAASD,SAAQ,GAAGA,SAAQ,QAAQA,UAAS;AAC3C,UAAI,OAAO;AACX,UAAIC,WAAU,GAAG;AACf,YAAID,WAAU,IAAI,OAAQ,QAAO;AAAA,MACnC,OAAO;AACL,cAAM,OAAO,YAAYA,QAAOC,MAAK;AACrC,YAAI,KAAM,QAAO,KAAK,OAAO,OAAO,OAAO,KAAK,EAAE;AAClD,cAAM,UAAU,gBAAgBD,MAAK,IAAI,OAAO,OAAOA,MAAK;AAC5D,YAAI,UAAU,KAAM,QAAO;AAAA,MAC7B;AACA,WAAK,OAAOA,MAAK,IAAI;AACrB,UAAI,OAAO,SAAU,MAAK,KAAK,MAAMA,MAAK;AAAA,IAC5C;AAKA,UAAM,OAAO,IAAI,WAAW,MAAM;AAClC,WAAO,KAAK,OAAO,GAAG;AACpB,YAAM,EAAE,MAAM,KAAK,IAAI,KAAK,IAAI;AAChC,UAAI,KAAK,IAAI,MAAM,KAAK,OAAO,OAAO,OAAO,IAAI,EAAG;AACpD,WAAK,IAAI,IAAI;AACb,iBAAW,QAAQ,IAAI,MAAM,IAAI,KAAK,QAAQ;AAC5C,cAAM,YAAY,OAAO,KAAK;AAC9B,YAAI,YAAY,OAAO,OAAO,KAAK,IAAI,GAAG;AACxC,eAAK,OAAO,KAAK,IAAI,IAAI;AACzB,eAAK,KAAK,WAAW,KAAK,IAAI;AAAA,QAChC;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,MAAI,OAAO,IAAI,KAAK,MAAM,UAAU;AAIlC,UAAM,IAAI,UAAU,mDAAmD;AAAA,EACzE;AAEA,QAAM,QAAgB,CAAC;AACvB,MAAI,QAAQ;AACZ,MAAI,QAAQ,IAAI;AAChB,MAAI,OAAO,oBAAI,IAAY,CAAC,KAAK,CAAC;AAElC,SAAO,EAAE,UAAU,KAAK,UAAU,IAAI,SAAS;AAC7C,UAAM,QAAgB,CAAC;AAEvB,UAAM,QAAQ,CACZ,MACA,MACA,IACA,QACA,MACA,QACS;AACT,YAAM,QAAQ,OAAO,OAAO,SAAS,SAAS,EAAE;AAChD,UAAI,UAAU,SAAU;AACxB,YAAM,KAAK,EAAE,MAAM,IAAI,QAAQ,KAAK,OAAO,KAAK,CAAC;AAAA,IACnD;AAEA,QAAI,QAAQ,GAAG;AACb,YAAM,OAAO,YAAY,OAAO,KAAK;AACrC,UAAI,MAAM;AACR;AAAA,UACE,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,QAAQ;AAAA,UACR,KAAK,SAAS,KAAK,SAAS,WAAW;AAAA,UACvC,KAAK;AAAA,QACP;AAAA,MACF;AACA,YAAM,gBAAgB,KAAK,GAAG,KAAK,aAAa,OAAO,QAAQ,GAAG,gBAAgB,IAAI;AAAA,IACxF;AACA,eAAW,QAAQ,IAAI,OAAO,KAAK,KAAK,QAAQ;AAC9C,UAAI,KAAK,IAAI,KAAK,EAAE,EAAG;AACvB,YAAM,KAAK,MAAM,KAAK,MAAM,KAAK,IAAI,OAAO,aAAa,KAAK,GAAG;AAAA,IACnE;AAIA,QAAI;AACJ,eAAW,aAAa,OAAO;AAC7B,UACE,SAAS,UACT,UAAU,QAAQ,KAAK,SACtB,UAAU,UAAU,KAAK,SAAS,UAAU,OAAO,KAAK,QACxD,UAAU,UAAU,KAAK,SACxB,UAAU,SAAS,KAAK,QACxB,UAAU,KAAK,KAAK,IACtB;AACA,eAAO;AAAA,MACT;AAAA,IACF;AACA,QAAI,SAAS,QAAW;AACtB,YAAM,IAAI,UAAU,qDAAqD;AAAA,IAC3E;AAEA,QAAI,KAAK,SAAS,eAAe,KAAK,QAAQ,MAAM;AAClD,YAAM,KAAK,EAAE,MAAM,KAAK,MAAM,OAAO,KAAK,KAAK,IAAI,CAAC;AAAA,IACtD;AACA,QAAI,KAAK,WAAW,OAAO;AACzB,cAAQ,KAAK;AACb,aAAO,oBAAI,IAAY;AAAA,IACzB;AACA,YAAQ,KAAK;AACb,SAAK,IAAI,KAAK;AAAA,EAChB;AAEA,SAAO;AACT;AAMA,SAAS,SAAS,OAAkC;AAClD,SAAO,EAAE,OAAO,EAAE,GAAG,MAAM,GAAG,KAAK,EAAE,GAAG,MAAM,EAAE;AAClD;AAYA,SAAS,OACP,OACA,UACA,QACgD;AAChD,QAAM,UAAU,SAAS,KAAK;AAC9B,MAAI,SAAS;AACX,WAAO,EAAE,SAAS,QAAQ,SAAS,MAAM,UAAU,QAAQ,SAAS;AAAA,EACtE;AACA,MAAI,QAAQ;AACV,WAAO,EAAE,SAAS,OAAO,SAAS,MAAM,UAAU,SAAS,OAAO,SAAS,GAAG,EAAE;AAAA,EAClF;AACA,QAAM,OAAO,SAAS,SAAS,SAAS,CAAC;AACzC,MAAI,KAAM,QAAO,EAAE,SAAS,MAAM,UAAU,SAAS,KAAK,SAAS,GAAG,EAAE;AACxE,SAAO,EAAE,SAAS,MAAM,UAAU,SAAS,EAAE,MAAM,GAAG,QAAQ,GAAG,QAAQ,EAAE,CAAC,EAAE;AAChF;AAGA,SAAS,gBAAgB,MAAoB;AAC3C,QAAM,UAAU,KAAK;AACrB,MAAI,OAAO,YAAY,SAAU,QAAO,IAAI,OAAO;AACnD,MAAI,MAAM,QAAQ,OAAO,EAAG,QAAO,QAAQ,IAAI,CAAC,SAAS,IAAI,IAAI,GAAG,EAAE,KAAK,IAAI;AAC/E,MAAI,YAAY,MAAO,QAAO;AAC9B,MAAI,YAAY,OAAW,QAAO,IAAI,QAAQ,OAAO;AACrD,SAAO,KAAK,OAAO,SAAY,gBAAgB,IAAI,KAAK,EAAE;AAC5D;AASA,SAAS,eAAe,MAAoB;AAC1C,QAAM,UAAU,KAAK;AACrB,MAAI,OAAO,YAAY,SAAU,QAAO,oBAAoB,OAAO;AACnE,MAAI,MAAM,QAAQ,OAAO,GAAG;AAC1B,WAAO,kBAAkB,QAAQ,IAAI,CAAC,SAAS,IAAI,IAAI,GAAG,EAAE,KAAK,IAAI,CAAC;AAAA,EACxE;AACA,MAAI,YAAY,MAAO,QAAO;AAC9B,MAAI,YAAY,OAAW,QAAO,6BAA6B,QAAQ,OAAO;AAC9E,SAAO,KAAK,OAAO,SAAY,oBAAoB,oBAAoB,KAAK,EAAE;AAChF;AAEA,SAAS,oBAAoB,MAAyB;AACpD,QAAM,WAAW,KAAK,KAAK,UAAU,CAAC,GAAG,IAAI,eAAe,EAAE,KAAK,eAAe;AAClF,QAAM,OAAO,KAAK,KAAK,OAAO,SAAY,KAAK,KAAK,KAAK,KAAK,EAAE;AAChE,SAAO,gBAAgB,IAAI,cAAc,OAAO;AAClD;AAEA,SAAS,kBAAkB,SAA8B;AACvD,QAAM,OACJ,QAAQ,kBAAkB,OACtB,yCACA,uBAAuB,QAAQ,KAAK;AAC1C,SAAO,GAAG,IAAI;AAChB;AAeO,SAAS,cACd,UACA,OACA,UAAwB,CAAC,GACZ;AACb,QAAME,WAAmB,CAAC;AAC1B,QAAM,WAAsB,CAAC;AAC7B,MAAI,CAAC,MAAO,QAAO,EAAE,SAAAA,UAAS,SAAS;AAEvC,QAAM,SAAS,QAAQ,UAAU;AACjC,QAAM,MAAM,aAAa,OAAO,OAAO;AACvC,QAAM,QAAQ,MAAM,UAAU,GAAG;AAEjC,QAAM,QAAQ,oBAAI,IAAgB;AAClC,aAAW,QAAQ,OAAO;AACxB,SAAK,KAAK,SAAS,WAAW,KAAK,SAAS,aAAa,KAAK,KAAK;AACjE,YAAM,IAAI,KAAK,GAAG;AAAA,IACpB;AAAA,EACF;AAGA,QAAM,cAAc,CAAC,QAAsC;AACzD,eAAW,SAAS,IAAI,QAAQ;AAC9B,UAAI,MAAM,QAAQ,MAAM,CAAC,WAAW,CAAC,MAAM,IAAI,MAAM,CAAC,EAAG,QAAO;AAAA,IAClE;AACA,WAAO;AAAA,EACT;AAEA,QAAM,WAAW,oBAAI,IAAe;AAEpC,aAAW,QAAQ,OAAO;AACxB,UAAM,UAAU,SAAS,KAAK,KAAK;AACnC,SAAK,KAAK,SAAS,WAAW,KAAK,SAAS,aAAa,KAAK,OAAO,SAAS;AAC5E,MAAAA,SAAQ,KAAK;AAAA,QACX,MAAM,KAAK,IAAI;AAAA,QACf;AAAA,QACA,SAAS,KAAK,SAAS;AAAA,MACzB,CAAC;AACD;AAAA,IACF;AAEA,QAAI,KAAK,SAAS,kBAAkB,SAAS;AAC3C,eAAS,KAAK;AAAA,QACZ,MAAM;AAAA,QACN,SAAS,QAAQ,SAAS;AAAA,QAC1B,SAAS,kBAAkB,OAAO;AAAA,QAClC,UAAU,QAAQ;AAAA,QAClB,UAAU;AAAA,MACZ,CAAC;AACD;AAAA,IACF;AAEA,QAAI,KAAK,SAAS,eAAe,CAAC,KAAK,OAAO,CAAC,KAAK,IAAI,SAAU;AAElE,UAAM,QAAQ,OAAO,KAAK,OAAO,UAAU,MAAM;AACjD,UAAM,QAAQ,YAAY,KAAK,GAAG;AAClC,QAAI,OAAO;AACT,UAAI,SAAS,IAAI,KAAK,EAAG;AACzB,eAAS,IAAI,KAAK;AAClB,eAAS,KAAK;AAAA,QACZ,MAAM;AAAA,QACN,SAAS,MAAM;AAAA,QACf,SAAS,oBAAoB,KAAK;AAAA,QAClC,UAAU,MAAM;AAAA,QAChB,UAAU;AAAA,MACZ,CAAC;AACD;AAAA,IACF;AAEA,aAAS,KAAK;AAAA,MACZ,MAAM;AAAA,MACN,SAAS,MAAM;AAAA,MACf,SAAS,eAAe,KAAK,IAAI,IAAI;AAAA,MACrC,UAAU,MAAM;AAAA,MAChB,UAAU;AAAA,IACZ,CAAC;AAAA,EACH;AAEA,SAAO,EAAE,SAAAA,UAAS,SAAS;AAC7B;","names":["matches","BLOCK_KINDS","cursor","compiled","state","index","matches"]}

package/dist/chunk-TH4JVQPF.js

@@ -0,0 +1,133 @@
+#!/usr/bin/env node
+import {
+  palette
+} from "./chunk-RNVYGWIC.js";
+
+// src/tracevals/rules/local.ts
+import {
+  ensureModel,
+  fits,
+  modelState,
+  nodeLlamaCppStatus
+} from "@hawkeyexl/inference";
+function libraryLocalModels(connections) {
+  const modelsDir = connections["llama-cpp"]?.modelsDir;
+  const options = modelsDir === void 0 ? {} : { modelsDirectory: modelsDir };
+  return {
+    runtimePresent: async () => (await nodeLlamaCppStatus()).state === "present",
+    state: (model) => modelState(model, options),
+    fits: (model) => fits(model, options),
+    ensure: (model) => ensureModel(model, options)
+  };
+}
+var GB = 1024 ** 3;
+
+// src/tracevals/reporters/conformance.ts
+var count = (n, one, many) => `${String(n)} ${n === 1 ? one : many}`;
+function renderCheck(report, opts = {}) {
+  const pc = palette(opts.color === true);
+  const lines = [];
+  for (const source of report.sources) {
+    const findings = report.findings.filter((f) => f.source === source.path);
+    if (findings.length === 0) continue;
+    lines.push(source.path);
+    for (const f of findings) {
+      const mark = f.outcome === "fail" ? pc.red("\u2716") : pc.yellow("?");
+      lines.push(`  ${mark} ${f.rule}  ${f.text}`);
+      lines.push(`      ${pc.dim(`${f.observed} (${f.confidence.toFixed(2)})`)}`);
+    }
+  }
+  lines.push(...sessionSoFar(report));
+  for (const warning of report.warnings) lines.push(`${pc.yellow("!")} ${warning}`);
+  if (lines.length > 0) lines.push("");
+  lines.push(closing(report));
+  return lines.join("\n");
+}
+function sessionSoFar(report) {
+  const rules = report.session?.rules ?? [];
+  if (rules.length === 0) return [];
+  const flagged = rules.filter((r) => r.broken > 0 || r.needsReview > 0);
+  const lines = flagged.map((r) => {
+    const counts = [
+      ["broken", r.broken],
+      ["repaired", r.repaired],
+      ["needs review", r.needsReview],
+      ["followed", r.followed]
+    ];
+    const said = counts.filter(([, n]) => n > 0).map(([word, n]) => `${word} ${String(n)}`);
+    return `  ${r.source}#${r.rule}  ${said.join(", ")}`;
+  });
+  const held = rules.length - flagged.length;
+  if (held > 0) {
+    lines.push(`  ${count(held, "rule", "rules")} held every turn ${held === 1 ? "it" : "they"} applied to.`);
+  }
+  return ["Session so far", ...lines];
+}
+function closing(report) {
+  const head = `Last turn of ${report.sessionId.slice(0, 8)}:`;
+  const { summary } = report;
+  const scope = `${count(summary.rules, "rule", "rules")} from ${count(summary.sources, "source", "sources")}`;
+  switch (report.skipped) {
+    case "empty-turn":
+      return `${head} nothing happened after the last prompt.`;
+    case "no-sources":
+      return `${head} no rule sources governed it.`;
+    case "not-applicable":
+      return `${head} ${scope}, none apply to this turn.`;
+    case null: {
+      const broken = summary.fail > 0 ? `${String(summary.fail)} broken` : "None broken";
+      const review = summary.needsReview > 0 ? `, ${String(summary.needsReview)} needs review` : "";
+      return `${head} ${scope}. ${broken}${review}.`;
+    }
+  }
+}
+var NOT_SET_UP = "tracevals conformance is not set up; nothing to prepare.";
+function renderPrepare(report) {
+  const lines = [];
+  const said = /* @__PURE__ */ new Set();
+  for (const m of report.models) {
+    if (m.state === "hosted" || said.has(m.model)) continue;
+    said.add(m.model);
+    const name = `${m.model} (${m.provider})`;
+    lines.push(
+      m.state === "downloaded" ? `${name} downloaded, ${((m.bytes ?? 0) / GB).toFixed(2)} GB.` : `${name} is ${m.state}.`
+    );
+  }
+  const ex = report.extraction;
+  if (ex !== null) {
+    const files = (n) => `${count(n, "file", "files")} that ${n === 1 ? "applies" : "apply"} to every session`;
+    if (ex.extracted > 0) {
+      lines.push(
+        `Extracted ${count(ex.rules, "rule", "rules")} from ${files(ex.extracted)}.` + (ex.cached > 0 ? ` ${String(ex.cached)} more ${ex.cached === 1 ? "was" : "were"} cached.` : "")
+      );
+    } else if (ex.cached > 0) {
+      lines.push(`${files(ex.cached)} ${ex.cached === 1 ? "is" : "are"} cached. Nothing to extract.`);
+    } else {
+      lines.push("No file applies to every session. Nothing to extract.");
+    }
+  }
+  for (const warning of report.warnings) lines.push(warning);
+  return lines.join("\n");
+}
+var NO_HOST = "No model host is running.";
+function renderRelease(report) {
+  if (!report.hostStopped && report.released.length === 0 && report.unloaded.length === 0) {
+    return NO_HOST;
+  }
+  const unloaded = report.unloaded.length > 0 ? `Unloaded ${report.unloaded.join(", ")}` : "";
+  const stopped = report.hostStopped ? "stopped the model host" : "";
+  const action = [unloaded, stopped].filter((s) => s !== "").join(" and ");
+  const held = count(report.released.length, "session", "sessions");
+  return `${action === "" ? "Released the lease" : action}. ${held} held it.`;
+}
+
+export {
+  libraryLocalModels,
+  GB,
+  renderCheck,
+  NOT_SET_UP,
+  renderPrepare,
+  NO_HOST,
+  renderRelease
+};
+//# sourceMappingURL=chunk-TH4JVQPF.js.map

package/dist/chunk-TH4JVQPF.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/tracevals/rules/local.ts","../src/tracevals/reporters/conformance.ts"],"sourcesContent":["/**\n * What tracevals asks of a local model without loading it (proposal 0079,\n * gates 5, 8 and 9, and `prepare`). The inference library owns every answer;\n * this is the one seam, so a test can say \"downloading\" without a runtime.\n */\nimport {\n  ensureModel,\n  fits,\n  modelState,\n  nodeLlamaCppStatus,\n  type EnsureModelResult,\n  type FitsResult,\n  type LlamaModelState,\n} from \"@hawkeyexl/inference\";\nimport type { ProviderConnections } from \"../../shared/providers.js\";\n\nexport interface LocalModels {\n  /** Whether the llama.cpp binding is importable now, installing nothing. */\n  runtimePresent(): Promise<boolean>;\n  /** `ready`, `downloading` or `missing`, read without loading or fetching. */\n  state(model: string): Promise<LlamaModelState>;\n  /** The memory probe `auto` tiering uses. */\n  fits(model: string): Promise<FitsResult>;\n  /** Fetch the runtime and the weights, without loading either. */\n  ensure(model: string): Promise<EnsureModelResult>;\n}\n\n/** The library's lifecycle calls, pointed at the family's models directory. */\nexport function libraryLocalModels(connections: ProviderConnections): LocalModels {\n  const modelsDir = connections[\"llama-cpp\"]?.modelsDir;\n  const options = modelsDir === undefined ? {} : { modelsDirectory: modelsDir };\n  return {\n    runtimePresent: async () => (await nodeLlamaCppStatus()).state === \"present\",\n    state: (model) => modelState(model, options),\n    fits: (model) => fits(model, options),\n    ensure: (model) => ensureModel(model, options),\n  };\n}\n\n/** Bytes in a gigabyte as the messages count them. */\nexport const GB = 1024 ** 3;\n","/**\n * Pretty output for `check`, `prepare` and `release` (proposal 0079). JSON is\n * each report as it stands, so only prose lives here. Colour is the caller's\n * decision, made once by `colorFor`.\n */\nimport { palette } from \"../../shared/color.js\";\nimport type { CheckReport } from \"../commands/check.js\";\nimport type { PrepareReport } from \"../commands/prepare.js\";\nimport type { ReleaseReport } from \"../commands/release.js\";\nimport { GB } from \"../rules/local.js\";\n\nconst count = (n: number, one: string, many: string): string =>\n  `${String(n)} ${n === 1 ? one : many}`;\n\n/** Findings grouped under their source, then the closing line. */\nexport function renderCheck(report: CheckReport, opts: { color?: boolean } = {}): string {\n  const pc = palette(opts.color === true);\n  const lines: string[] = [];\n  for (const source of report.sources) {\n    const findings = report.findings.filter((f) => f.source === source.path);\n    if (findings.length === 0) continue;\n    lines.push(source.path);\n    for (const f of findings) {\n      const mark = f.outcome === \"fail\" ? pc.red(\"✖\") : pc.yellow(\"?\");\n      lines.push(`  ${mark} ${f.rule}  ${f.text}`);\n      lines.push(`      ${pc.dim(`${f.observed} (${f.confidence.toFixed(2)})`)}`);\n    }\n  }\n  lines.push(...sessionSoFar(report));\n  for (const warning of report.warnings) lines.push(`${pc.yellow(\"!\")} ${warning}`);\n  if (lines.length > 0) lines.push(\"\");\n  lines.push(closing(report));\n  return lines.join(\"\\n\");\n}\n\n/** The ledger's rules that were ever broken or sent to review, and a count of the rest. */\nfunction sessionSoFar(report: CheckReport): string[] {\n  const rules = report.session?.rules ?? [];\n  if (rules.length === 0) return [];\n  const flagged = rules.filter((r) => r.broken > 0 || r.needsReview > 0);\n  const lines = flagged.map((r) => {\n    const counts = [\n      [\"broken\", r.broken],\n      [\"repaired\", r.repaired],\n      [\"needs review\", r.needsReview],\n      [\"followed\", r.followed],\n    ] as const;\n    const said = counts.filter(([, n]) => n > 0).map(([word, n]) => `${word} ${String(n)}`);\n    return `  ${r.source}#${r.rule}  ${said.join(\", \")}`;\n  });\n  const held = rules.length - flagged.length;\n  if (held > 0) {\n    lines.push(`  ${count(held, \"rule\", \"rules\")} held every turn ${held === 1 ? \"it\" : \"they\"} applied to.`);\n  }\n  return [\"Session so far\", ...lines];\n}\n\nfunction closing(report: CheckReport): string {\n  const head = `Last turn of ${report.sessionId.slice(0, 8)}:`;\n  const { summary } = report;\n  // \"sources\", because a typed prompt is not a file (proposal 0080).\n  const scope = `${count(summary.rules, \"rule\", \"rules\")} from ${count(summary.sources, \"source\", \"sources\")}`;\n  switch (report.skipped) {\n    case \"empty-turn\":\n      return `${head} nothing happened after the last prompt.`;\n    case \"no-sources\":\n      return `${head} no rule sources governed it.`;\n    case \"not-applicable\":\n      return `${head} ${scope}, none apply to this turn.`;\n    case null: {\n      const broken = summary.fail > 0 ? `${String(summary.fail)} broken` : \"None broken\";\n      const review = summary.needsReview > 0 ? `, ${String(summary.needsReview)} needs review` : \"\";\n      return `${head} ${scope}. ${broken}${review}.`;\n    }\n  }\n}\n\nexport const NOT_SET_UP = \"tracevals conformance is not set up; nothing to prepare.\";\n\nexport function renderPrepare(report: PrepareReport): string {\n  const lines: string[] = [];\n  const said = new Set<string>();\n  for (const m of report.models) {\n    if (m.state === \"hosted\" || said.has(m.model)) continue;\n    said.add(m.model);\n    const name = `${m.model} (${m.provider})`;\n    lines.push(\n      m.state === \"downloaded\"\n        ? `${name} downloaded, ${((m.bytes ?? 0) / GB).toFixed(2)} GB.`\n        : `${name} is ${m.state}.`,\n    );\n  }\n  const ex = report.extraction;\n  if (ex !== null) {\n    const files = (n: number): string =>\n      `${count(n, \"file\", \"files\")} that ${n === 1 ? \"applies\" : \"apply\"} to every session`;\n    if (ex.extracted > 0) {\n      lines.push(\n        `Extracted ${count(ex.rules, \"rule\", \"rules\")} from ${files(ex.extracted)}.` +\n          (ex.cached > 0 ? ` ${String(ex.cached)} more ${ex.cached === 1 ? \"was\" : \"were\"} cached.` : \"\"),\n      );\n    } else if (ex.cached > 0) {\n      lines.push(`${files(ex.cached)} ${ex.cached === 1 ? \"is\" : \"are\"} cached. Nothing to extract.`);\n    } else {\n      lines.push(\"No file applies to every session. Nothing to extract.\");\n    }\n  }\n  for (const warning of report.warnings) lines.push(warning);\n  return lines.join(\"\\n\");\n}\n\nexport const NO_HOST = \"No model host is running.\";\n\nexport function renderRelease(report: ReleaseReport): string {\n  if (!report.hostStopped && report.released.length === 0 && report.unloaded.length === 0) {\n    return NO_HOST;\n  }\n  const unloaded = report.unloaded.length > 0 ? `Unloaded ${report.unloaded.join(\", \")}` : \"\";\n  const stopped = report.hostStopped ? \"stopped the model host\" : \"\";\n  const action = [unloaded, stopped].filter((s) => s !== \"\").join(\" and \");\n  const held = count(report.released.length, \"session\", \"sessions\");\n  return `${action === \"\" ? \"Released the lease\" : action}. ${held} held it.`;\n}\n"],"mappings":";;;;;;AAKA;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,OAIK;AAeA,SAAS,mBAAmB,aAA+C;AAChF,QAAM,YAAY,YAAY,WAAW,GAAG;AAC5C,QAAM,UAAU,cAAc,SAAY,CAAC,IAAI,EAAE,iBAAiB,UAAU;AAC5E,SAAO;AAAA,IACL,gBAAgB,aAAa,MAAM,mBAAmB,GAAG,UAAU;AAAA,IACnE,OAAO,CAAC,UAAU,WAAW,OAAO,OAAO;AAAA,IAC3C,MAAM,CAAC,UAAU,KAAK,OAAO,OAAO;AAAA,IACpC,QAAQ,CAAC,UAAU,YAAY,OAAO,OAAO;AAAA,EAC/C;AACF;AAGO,IAAM,KAAK,QAAQ;;;AC7B1B,IAAM,QAAQ,CAAC,GAAW,KAAa,SACrC,GAAG,OAAO,CAAC,CAAC,IAAI,MAAM,IAAI,MAAM,IAAI;AAG/B,SAAS,YAAY,QAAqB,OAA4B,CAAC,GAAW;AACvF,QAAM,KAAK,QAAQ,KAAK,UAAU,IAAI;AACtC,QAAM,QAAkB,CAAC;AACzB,aAAW,UAAU,OAAO,SAAS;AACnC,UAAM,WAAW,OAAO,SAAS,OAAO,CAAC,MAAM,EAAE,WAAW,OAAO,IAAI;AACvE,QAAI,SAAS,WAAW,EAAG;AAC3B,UAAM,KAAK,OAAO,IAAI;AACtB,eAAW,KAAK,UAAU;AACxB,YAAM,OAAO,EAAE,YAAY,SAAS,GAAG,IAAI,QAAG,IAAI,GAAG,OAAO,GAAG;AAC/D,YAAM,KAAK,KAAK,IAAI,IAAI,EAAE,IAAI,KAAK,EAAE,IAAI,EAAE;AAC3C,YAAM,KAAK,SAAS,GAAG,IAAI,GAAG,EAAE,QAAQ,KAAK,EAAE,WAAW,QAAQ,CAAC,CAAC,GAAG,CAAC,EAAE;AAAA,IAC5E;AAAA,EACF;AACA,QAAM,KAAK,GAAG,aAAa,MAAM,CAAC;AAClC,aAAW,WAAW,OAAO,SAAU,OAAM,KAAK,GAAG,GAAG,OAAO,GAAG,CAAC,IAAI,OAAO,EAAE;AAChF,MAAI,MAAM,SAAS,EAAG,OAAM,KAAK,EAAE;AACnC,QAAM,KAAK,QAAQ,MAAM,CAAC;AAC1B,SAAO,MAAM,KAAK,IAAI;AACxB;AAGA,SAAS,aAAa,QAA+B;AACnD,QAAM,QAAQ,OAAO,SAAS,SAAS,CAAC;AACxC,MAAI,MAAM,WAAW,EAAG,QAAO,CAAC;AAChC,QAAM,UAAU,MAAM,OAAO,CAAC,MAAM,EAAE,SAAS,KAAK,EAAE,cAAc,CAAC;AACrE,QAAM,QAAQ,QAAQ,IAAI,CAAC,MAAM;AAC/B,UAAM,SAAS;AAAA,MACb,CAAC,UAAU,EAAE,MAAM;AAAA,MACnB,CAAC,YAAY,EAAE,QAAQ;AAAA,MACvB,CAAC,gBAAgB,EAAE,WAAW;AAAA,MAC9B,CAAC,YAAY,EAAE,QAAQ;AAAA,IACzB;AACA,UAAM,OAAO,OAAO,OAAO,CAAC,CAAC,EAAE,CAAC,MAAM,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,MAAM,CAAC,MAAM,GAAG,IAAI,IAAI,OAAO,CAAC,CAAC,EAAE;AACtF,WAAO,KAAK,EAAE,MAAM,IAAI,EAAE,IAAI,KAAK,KAAK,KAAK,IAAI,CAAC;AAAA,EACpD,CAAC;AACD,QAAM,OAAO,MAAM,SAAS,QAAQ;AACpC,MAAI,OAAO,GAAG;AACZ,UAAM,KAAK,KAAK,MAAM,MAAM,QAAQ,OAAO,CAAC,oBAAoB,SAAS,IAAI,OAAO,MAAM,cAAc;AAAA,EAC1G;AACA,SAAO,CAAC,kBAAkB,GAAG,KAAK;AACpC;AAEA,SAAS,QAAQ,QAA6B;AAC5C,QAAM,OAAO,gBAAgB,OAAO,UAAU,MAAM,GAAG,CAAC,CAAC;AACzD,QAAM,EAAE,QAAQ,IAAI;AAEpB,QAAM,QAAQ,GAAG,MAAM,QAAQ,OAAO,QAAQ,OAAO,CAAC,SAAS,MAAM,QAAQ,SAAS,UAAU,SAAS,CAAC;AAC1G,UAAQ,OAAO,SAAS;AAAA,IACtB,KAAK;AACH,aAAO,GAAG,IAAI;AAAA,IAChB,KAAK;AACH,aAAO,GAAG,IAAI;AAAA,IAChB,KAAK;AACH,aAAO,GAAG,IAAI,IAAI,KAAK;AAAA,IACzB,KAAK,MAAM;AACT,YAAM,SAAS,QAAQ,OAAO,IAAI,GAAG,OAAO,QAAQ,IAAI,CAAC,YAAY;AACrE,YAAM,SAAS,QAAQ,cAAc,IAAI,KAAK,OAAO,QAAQ,WAAW,CAAC,kBAAkB;AAC3F,aAAO,GAAG,IAAI,IAAI,KAAK,KAAK,MAAM,GAAG,MAAM;AAAA,IAC7C;AAAA,EACF;AACF;AAEO,IAAM,aAAa;AAEnB,SAAS,cAAc,QAA+B;AAC3D,QAAM,QAAkB,CAAC;AACzB,QAAM,OAAO,oBAAI,IAAY;AAC7B,aAAW,KAAK,OAAO,QAAQ;AAC7B,QAAI,EAAE,UAAU,YAAY,KAAK,IAAI,EAAE,KAAK,EAAG;AAC/C,SAAK,IAAI,EAAE,KAAK;AAChB,UAAM,OAAO,GAAG,EAAE,KAAK,KAAK,EAAE,QAAQ;AACtC,UAAM;AAAA,MACJ,EAAE,UAAU,eACR,GAAG,IAAI,kBAAkB,EAAE,SAAS,KAAK,IAAI,QAAQ,CAAC,CAAC,SACvD,GAAG,IAAI,OAAO,EAAE,KAAK;AAAA,IAC3B;AAAA,EACF;AACA,QAAM,KAAK,OAAO;AAClB,MAAI,OAAO,MAAM;AACf,UAAM,QAAQ,CAAC,MACb,GAAG,MAAM,GAAG,QAAQ,OAAO,CAAC,SAAS,MAAM,IAAI,YAAY,OAAO;AACpE,QAAI,GAAG,YAAY,GAAG;AACpB,YAAM;AAAA,QACJ,aAAa,MAAM,GAAG,OAAO,QAAQ,OAAO,CAAC,SAAS,MAAM,GAAG,SAAS,CAAC,OACtE,GAAG,SAAS,IAAI,IAAI,OAAO,GAAG,MAAM,CAAC,SAAS,GAAG,WAAW,IAAI,QAAQ,MAAM,aAAa;AAAA,MAChG;AAAA,IACF,WAAW,GAAG,SAAS,GAAG;AACxB,YAAM,KAAK,GAAG,MAAM,GAAG,MAAM,CAAC,IAAI,GAAG,WAAW,IAAI,OAAO,KAAK,8BAA8B;AAAA,IAChG,OAAO;AACL,YAAM,KAAK,uDAAuD;AAAA,IACpE;AAAA,EACF;AACA,aAAW,WAAW,OAAO,SAAU,OAAM,KAAK,OAAO;AACzD,SAAO,MAAM,KAAK,IAAI;AACxB;AAEO,IAAM,UAAU;AAEhB,SAAS,cAAc,QAA+B;AAC3D,MAAI,CAAC,OAAO,eAAe,OAAO,SAAS,WAAW,KAAK,OAAO,SAAS,WAAW,GAAG;AACvF,WAAO;AAAA,EACT;AACA,QAAM,WAAW,OAAO,SAAS,SAAS,IAAI,YAAY,OAAO,SAAS,KAAK,IAAI,CAAC,KAAK;AACzF,QAAM,UAAU,OAAO,cAAc,2BAA2B;AAChE,QAAM,SAAS,CAAC,UAAU,OAAO,EAAE,OAAO,CAAC,MAAM,MAAM,EAAE,EAAE,KAAK,OAAO;AACvE,QAAM,OAAO,MAAM,OAAO,SAAS,QAAQ,WAAW,UAAU;AAChE,SAAO,GAAG,WAAW,KAAK,uBAAuB,MAAM,KAAK,IAAI;AAClE;","names":[]}

package/dist/{chunk-QRWGPQKO.js → chunk-TLXE7LYK.js}

@@ -10,7 +10,7 @@ import {
   pageMarks,
   pageSchemaSet,
   withValueAt
-} from "./chunk-M3W7J6MU.js";
+} from "./chunk-TUAAR3MM.js";
 import {
   DocmetaError,
   escapePointerSegment,
@@ -20,12 +20,12 @@ import {
   rebaseConfigSchemaRefs,
   schemaTrustRoot,
   supportedExtensions
-} from "./chunk-57NEQRVO.js";
+} from "./chunk-KCOFEWV5.js";
 import {
   decryptValue,
   encryptValue,
   isEncryptedValue
-} from "./chunk-Q35YIDBV.js";
+} from "./chunk-XKBEHKWO.js";
 import {
   errorMessage
 } from "./chunk-G3T47CFV.js";
@@ -195,4 +195,4 @@ export {
   metaPageView,
   declaredAt
 };
-//# sourceMappingURL=chunk-QRWGPQKO.js.map
+//# sourceMappingURL=chunk-TLXE7LYK.js.map