polytypo 1.2.0 → 1.3.1

package/README.md

@@ -57,6 +57,7 @@ the parsers that mode needs:
 | `polytypo/text`     | none                                                          |
 | `polytypo/html`     | parse5                                                        |
 | `polytypo/markdown` | parse5, micromark and its GFM, frontmatter and MDX extensions |
+| `polytypo/yaml`     | none                                                          |
 | `polytypo`          | all of the above                                              |
 
 HTML and Markdown are first-class modes, not an afterthought — tags, attributes and fenced code
@@ -69,6 +70,53 @@ transform(`<a title="test... wait">Wait... she said "go on."</a>`, { locale: "en
 // <a title="test... wait">Wait… she said “go on.”</a>
 ```
 
+`yaml` mode is the one that asks something of you, and it asks for a reason. YAML is a data format
+with prose in some of it, so you name the keys whose values are prose; there is no default and no
+guess:
+
+```ts
+import { transform } from "polytypo/yaml";
+
+transform("summary: Rates -- all of them...\nrun: git diff -- a--b\n", {
+  locale: "en-US",
+  keys: ["summary"],
+});
+// summary: Rates—all of them…
+// run: git diff -- a--b
+```
+
+Nothing in YAML's syntax separates a sentence from a shell script: `description` holds one and
+`run` holds the other, spelled identically. Without `keys` the same document comes back with
+`if !` rewritten as `if!`. Quoting, indentation, anchors and a block scalar's chomping indicator
+are never decoded and rewritten — the file is located, not re-emitted — so the trailing newlines
+of a `|+` block come back exactly as you wrote them.
+
+In `markdown` mode the skipped regions are the dialect's own structural ones, not whatever looks
+like code. CommonMark counts an indented block as code at **four** spaces; at two it is an ordinary
+paragraph, so a JSON sample indented by two comes back with curly quotes — valid JSON in, invalid
+JSON out, and nothing in the return value says so. MDX has no indented code blocks at all, so there
+even four spaces is prose and a brace in it is a JSX expression: the same sample throws
+`POLYTYPO_MALFORMED_INPUT` instead. A fence or a code span is the one marker that means _code_ in
+both dialects.
+
+`analyze()` runs the same pipeline and reports what it would do instead of doing it — one record
+per edit, each with the rule that made it and code-point offsets into the input you passed (into
+the **document**, in `html`, `markdown` and `yaml` mode, not into a span):
+
+```ts
+import { analyze } from "polytypo";
+
+analyze(`Wait... "really"?`, { locale: "en-US" });
+// [ { ruleId: "ellipsis", start: 4, end: 7, before: "...", after: "…" },
+//   { ruleId: "quotes",   start: 8, end: 9, before: `"`,   after: "“" }, … ]
+```
+
+It is a report, not a patch. The list is empty exactly when `transform` would return the input
+unchanged, and every `ruleId` is a rule that was enabled for that call — but two rules may touch
+the same original range (French `spaces` deletes the space before `:` and `nbsp` puts a no-break
+one back), so replaying the list is not guaranteed to reproduce the output. Call `transform` for
+the text. Full contract: `spec/rules/analyze.md`.
+
 The aggregate `polytypo` entry defaults `mode` to `"text"` and is the one to use when the mode is
 chosen at runtime. `locale` has no default anywhere and must always be passed explicitly — there is
 no silent fallback to English.

package/dist/{chunk-KAO74OJ6.js → chunk-4GYU4TXA.js}

@@ -1,6 +1,6 @@
 import {
   PolytypoError
-} from "./chunk-OHF7OFWY.js";
+} from "./chunk-VKJVMMCI.js";
 
 // src/engine/assert-fixed-mode.ts
 function assertFixedMode(mode, fixed, entryPoint) {
@@ -14,4 +14,4 @@ function assertFixedMode(mode, fixed, entryPoint) {
 export {
   assertFixedMode
 };
-//# sourceMappingURL=chunk-KAO74OJ6.js.map
+//# sourceMappingURL=chunk-4GYU4TXA.js.map

package/dist/{chunk-6NTDU63P.js → chunk-5NCJ3Y65.js}

@@ -1,14 +1,18 @@
 import {
   htmlFragmentSpans,
   isSkippedElement,
-  runOverSpans,
   wrapParserErrors
-} from "./chunk-VARU43JT.js";
+} from "./chunk-DXWMSR26.js";
+import {
+  analyzeOverSpans,
+  runOverSpans
+} from "./chunk-5U3DRTV7.js";
 import {
   PolytypoError,
   getLocaleData,
-  planRules
-} from "./chunk-OHF7OFWY.js";
+  planRules,
+  resolveNarrowTarget
+} from "./chunk-VKJVMMCI.js";
 
 // src/modes/markdown.ts
 import { parse, postprocess, preprocess } from "micromark";
@@ -35,9 +39,11 @@ var SKIPPED_TOKEN_TYPES = /* @__PURE__ */ new Set([
   "mdxFlowExpression",
   "mdxTextExpression",
   "mdxjsEsm",
-  // Not in modes.md 3.7, and it has to be: without it the second `---` of a YAML block reads as
-  // a setext underline, `title: Une note` becomes a paragraph, and `fr` puts a narrow no-break
-  // space in front of the colon of a machine-read metadata field. Reported as a spec gap.
+  // modes.md 3.7.3, and it matters: without it the second `---` of a YAML block reads as a setext
+  // underline, `title: Une note` becomes a paragraph, and `fr` puts a narrow no-break space in
+  // front of the colon of a machine-read metadata field. Covered by conformance fixtures
+  // en-us-markdown-{commonmark,mdx}-frontmatter, fr-markdown-{commonmark,mdx}-frontmatter-nbsp,
+  // en-us-markdown-commonmark-frontmatter-toml and -frontmatter-unterminated.
   "frontmatter"
 ]);
 var RAW_TAG_TOKEN_TYPES = /* @__PURE__ */ new Set([
@@ -104,8 +110,10 @@ function resolveDialect(dialect) {
     `Unknown dialect "${String(dialect)}". Expected "commonmark" or "mdx".`
   );
 }
+var FRONTMATTER_MATTERS = ["yaml", "toml"];
 function extensionsFor(dialect) {
-  return dialect === "mdx" ? [frontmatter(), gfm(), mdxjs()] : [frontmatter(), gfm()];
+  const fm = frontmatter([...FRONTMATTER_MATTERS]);
+  return dialect === "mdx" ? [fm, gfm(), mdxjs()] : [fm, gfm()];
 }
 function markdownSpans(source, dialect) {
   const events = wrapParserErrors(dialect, () => tokenize(source, extensionsFor(dialect)));
@@ -150,14 +158,30 @@ function markdownSpans(source, dialect) {
 
 // src/engine/markdown-pipeline.ts
 function runMarkdownPipeline(input, options) {
+  const narrowTarget = resolveNarrowTarget(options.narrowNbsp);
   const planned = planRules(options.rules);
   const locale = getLocaleData(options.locale);
   const dialect = resolveDialect(options.dialect);
   const spans = markdownSpans(input, dialect);
-  return runOverSpans(input, spans, planned, locale, "markdown");
+  return runOverSpans(input, spans, planned, locale, "markdown", narrowTarget);
+}
+function analyzeMarkdownPipeline(input, options) {
+  const narrowTarget = resolveNarrowTarget(options.narrowNbsp);
+  const planned = planRules(options.rules);
+  const locale = getLocaleData(options.locale);
+  const dialect = resolveDialect(options.dialect);
+  return analyzeOverSpans(
+    input,
+    markdownSpans(input, dialect),
+    planned,
+    locale,
+    "markdown",
+    narrowTarget
+  );
 }
 
 export {
-  runMarkdownPipeline
+  runMarkdownPipeline,
+  analyzeMarkdownPipeline
 };
-//# sourceMappingURL=chunk-6NTDU63P.js.map
+//# sourceMappingURL=chunk-5NCJ3Y65.js.map

package/dist/chunk-5NCJ3Y65.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/modes/markdown.ts","../src/engine/markdown-pipeline.ts"],"sourcesContent":["import { parse, postprocess, preprocess } from \"micromark\";\nimport { frontmatter } from \"micromark-extension-frontmatter\";\nimport { gfm } from \"micromark-extension-gfm\";\nimport { mdxjs } from \"micromark-extension-mdxjs\";\nimport type { Event, Extension } from \"micromark-util-types\";\nimport { PolytypoError } from \"../errors.js\";\nimport type { Dialect } from \"../types.js\";\nimport { htmlFragmentSpans, isSkippedElement } from \"./html.js\";\nimport { wrapParserErrors } from \"./parse-error.js\";\nimport type { Span } from \"./spans.js\";\n\n/**\n * spec/rules/modes.md 3.7. Each entry is skipped **whole**, including anything that looks\n * processable inside it. The complement is not enumerated: a span is emitted only for a\n * micromark `data` token, which is the tokenizer's own name for \"literal content\", so list\n * markers, emphasis delimiters, heading sequences, table padding, line endings, hard-break\n * spaces, character escapes and character references are outside every span by construction\n * rather than by a second list that could drift from the first.\n */\nconst SKIPPED_TOKEN_TYPES: ReadonlySet<string> = new Set([\n  // fenced code blocks (including the info string and the fences) and indented code blocks\n  \"codeFenced\",\n  \"codeIndented\",\n  // inline code spans, including the backticks\n  \"codeText\",\n  // autolinks `<https://…>`, and GFM's bare-URL form\n  \"autolink\",\n  \"literalAutolink\",\n  // link and image destinations and titles; the definition line of a reference link. The link\n  // *text* is a `labelText`, which is not skipped.\n  \"resource\",\n  \"reference\",\n  \"definition\",\n  // MDX: expression containers in full, and every JSX attribute — the whole tag is skipped, so\n  // attributes never surface. JSX element *children* sit outside the tag tokens and are\n  // processable.\n  \"mdxFlowExpression\",\n  \"mdxTextExpression\",\n  \"mdxjsEsm\",\n  // modes.md 3.7.3, and it matters: without it the second `---` of a YAML block reads as a setext\n  // underline, `title: Une note` becomes a paragraph, and `fr` puts a narrow no-break space in\n  // front of the colon of a machine-read metadata field. Covered by conformance fixtures\n  // en-us-markdown-{commonmark,mdx}-frontmatter, fr-markdown-{commonmark,mdx}-frontmatter-nbsp,\n  // en-us-markdown-commonmark-frontmatter-toml and -frontmatter-unterminated.\n  \"frontmatter\",\n]);\n\n/** Token types whose enter/exit also maintains the skipped-element stack. */\nconst RAW_TAG_TOKEN_TYPES: ReadonlySet<string> = new Set([\n  \"htmlText\",\n  \"mdxJsxTextTag\",\n  \"mdxJsxFlowTag\",\n]);\n\nconst LESS_THAN = 0x3c;\nconst GREATER_THAN = 0x3e;\nconst SLASH = 0x2f;\nconst EXCLAMATION = 0x21;\nconst QUESTION = 0x3f;\n\nfunction isAsciiLetter(unit: number): boolean {\n  return (unit >= 0x61 && unit <= 0x7a) || (unit >= 0x41 && unit <= 0x5a);\n}\n\nfunction isTagNameUnit(unit: number): boolean {\n  // Deliberately permissive: anything that is not a delimiter belongs to the name. Custom\n  // elements (`my-callout`) and member expressions (`Foo.Bar`) must come out whole so that they\n  // fail the skip-list membership test rather than being truncated into something that passes.\n  return (\n    unit !== GREATER_THAN &&\n    unit !== SLASH &&\n    unit !== 0x20 &&\n    unit !== 0x09 &&\n    unit !== 0x0a &&\n    unit !== 0x0d\n  );\n}\n\n/** ASCII-only, because HTML tag names are ASCII case-insensitive and `toLowerCase()` is not. */\nfunction asciiLower(value: string): string {\n  let out = \"\";\n  for (let i = 0; i < value.length; i += 1) {\n    const unit = value.charCodeAt(i);\n    out += unit >= 0x41 && unit <= 0x5a ? String.fromCharCode(unit + 0x20) : value[i];\n  }\n  return out;\n}\n\ninterface RawTag {\n  readonly name: string;\n  readonly closing: boolean;\n  readonly selfClosing: boolean;\n}\n\nfunction readTag(tag: string): RawTag | null {\n  if (tag.charCodeAt(0) !== LESS_THAN) return null;\n  let i = 1;\n  const closing = tag.charCodeAt(i) === SLASH;\n  if (closing) i += 1;\n  // Comments, declarations and processing instructions carry no element name.\n  if (tag.charCodeAt(i) === EXCLAMATION || tag.charCodeAt(i) === QUESTION) return null;\n  if (!isAsciiLetter(tag.charCodeAt(i))) return null;\n  const nameAt = i;\n  while (i < tag.length && isTagNameUnit(tag.charCodeAt(i))) i += 1;\n  const selfClosing = tag.charCodeAt(tag.length - 2) === SLASH;\n  return { name: tag.slice(nameAt, i), closing, selfClosing };\n}\n\n/**\n * modes.md 3.7: raw HTML is \"handed to the html skip list of 3.6\". Inline raw HTML reaches the\n * tokenizer as isolated tags with ordinary markdown content between them, so honouring the\n * subtree rule means tracking which skipped element is currently open. JSX names are compared\n * case-sensitively (`<Code>` is a component, `<code>` is an element); HTML names are not.\n */\nfunction updateElementStack(stack: string[], tag: string, caseSensitive: boolean): void {\n  const parsed = readTag(tag);\n  if (parsed === null) return;\n  const name = caseSensitive ? parsed.name : asciiLower(parsed.name);\n  if (parsed.closing) {\n    if (stack[stack.length - 1] === name) stack.pop();\n    return;\n  }\n  if (!parsed.selfClosing && isSkippedElement(name)) stack.push(name);\n}\n\nfunction tokenize(source: string, extensions: readonly Extension[]): Event[] {\n  return postprocess(\n    parse({ extensions: [...extensions] })\n      .document()\n      .write(preprocess()(source, null, true)),\n  );\n}\n\n/**\n * modes.md 3.7.1. The dialect is the caller's, never detected: `\"commonmark\"` is CommonMark 0.31\n * plus GFM, `\"mdx\"` is the same minus indented code blocks and `<…>` autolinks, plus JSX and\n * `{…}` expression containers. Both enable frontmatter and GFM, which 3.7.2 makes normative —\n * §4's promise that table alignment rows survive is empty unless tables are recognised at all.\n */\nexport function resolveDialect(dialect: Dialect | undefined): Dialect {\n  if (dialect === \"commonmark\" || dialect === \"mdx\") return dialect;\n  if (dialect === undefined) {\n    throw new PolytypoError(\n      \"POLYTYPO_INVALID_DIALECT\",\n      'Mode \"markdown\" requires a dialect. Expected \"commonmark\" or \"mdx\"; there is no default.',\n    );\n  }\n  throw new PolytypoError(\n    \"POLYTYPO_INVALID_DIALECT\",\n    `Unknown dialect \"${String(dialect)}\". Expected \"commonmark\" or \"mdx\".`,\n  );\n}\n\n// modes.md 3.7.3 names both frontmatter delimiters, `---` (YAML) and `+++` (TOML), and skips\n// either whole. micromark's default matter is YAML alone, so both must be asked for by name: with\n// the default, a `+++` block parses as prose and the machine-read fields inside it get typeset.\nconst FRONTMATTER_MATTERS = [\"yaml\", \"toml\"] as const;\n\nfunction extensionsFor(dialect: Dialect): Extension[] {\n  const fm = frontmatter([...FRONTMATTER_MATTERS]);\n  return dialect === \"mdx\" ? [fm, gfm(), mdxjs()] : [fm, gfm()];\n}\n\nexport function markdownSpans(source: string, dialect: Dialect): Span[] {\n  const events = wrapParserErrors(dialect, () => tokenize(source, extensionsFor(dialect)));\n  const spans: Span[] = [];\n  const elementStack: string[] = [];\n  let skipDepth = 0;\n\n  for (const [kind, token] of events) {\n    const type = token.type;\n\n    if (SKIPPED_TOKEN_TYPES.has(type)) {\n      skipDepth += kind === \"enter\" ? 1 : -1;\n      continue;\n    }\n\n    if (RAW_TAG_TOKEN_TYPES.has(type)) {\n      if (kind === \"enter\") {\n        updateElementStack(\n          elementStack,\n          source.slice(token.start.offset, token.end.offset),\n          type !== \"htmlText\",\n        );\n      }\n      skipDepth += kind === \"enter\" ? 1 : -1;\n      continue;\n    }\n\n    // An HTML block is handed to the `html` extractor rather than skipped whole, so that the\n    // prose inside `<div>…</div>` is typeset while the markup is not.\n    if (type === \"htmlFlow\") {\n      if (kind === \"enter\" && skipDepth === 0 && elementStack.length === 0) {\n        for (const span of htmlFragmentSpans(\n          source.slice(token.start.offset, token.end.offset),\n          token.start.offset,\n        )) {\n          spans.push(span);\n        }\n      }\n      skipDepth += kind === \"enter\" ? 1 : -1;\n      continue;\n    }\n\n    if (kind === \"enter\" && type === \"data\" && skipDepth === 0 && elementStack.length === 0) {\n      spans.push({ start: token.start.offset, end: token.end.offset });\n    }\n  }\n\n  return spans;\n}\n","import { markdownSpans, resolveDialect } from \"../modes/markdown.js\";\nimport type { Options } from \"../types.js\";\nimport { getLocaleData } from \"./locale.js\";\nimport { resolveNarrowTarget } from \"./narrow-target.js\";\nimport { planRules } from \"./rule-runner.js\";\nimport { analyzeOverSpans, runOverSpans } from \"./span-runner.js\";\nimport type { Change } from \"./origin.js\";\n\n/**\n * `markdown` mode only. Imports the Micromark/MDX stack and `parse5` (via `../modes/markdown.js`\n * importing `../modes/html.js` for normative embedded-HTML handling, modes.md 3.7) — both are\n * legitimately reachable from `polytypo/markdown` (AUDIT_REMEDIATION_AND_RELEASE_PLAN.md 5.1).\n *\n * Validation order — `planRules`, then `getLocaleData`, then `resolveDialect`/parsing — mirrors\n * the pre-Stage-5 aggregate `runPipeline` exactly: an unknown-rule error wins over an\n * unknown-locale error, which wins over a missing/invalid dialect, which wins over a parse\n * failure. All four are public, tested behaviour this refactor was not authorised to change.\n */\nexport function runMarkdownPipeline(input: string, options: Partial<Options>): string {\n  const narrowTarget = resolveNarrowTarget(options.narrowNbsp);\n  const planned = planRules(options.rules);\n  const locale = getLocaleData(options.locale);\n  const dialect = resolveDialect(options.dialect);\n  const spans = markdownSpans(input, dialect);\n  return runOverSpans(input, spans, planned, locale, \"markdown\", narrowTarget);\n}\n\n/** analyze.md §1, `markdown` mode. Dialect validation happens here exactly as it does for\n * `runMarkdownPipeline`, so an absent dialect throws POLYTYPO_INVALID_DIALECT from `analyze`\n * too (analyze.md §4 A1). */\nexport function analyzeMarkdownPipeline(input: string, options: Partial<Options>): Change[] {\n  const narrowTarget = resolveNarrowTarget(options.narrowNbsp);\n  const planned = planRules(options.rules);\n  const locale = getLocaleData(options.locale);\n  const dialect = resolveDialect(options.dialect);\n  return analyzeOverSpans(\n    input,\n    markdownSpans(input, dialect),\n    planned,\n    locale,\n    \"markdown\",\n    narrowTarget,\n  );\n}\n"],"mappings":";;;;;;;;;;;;;;;;;AAAA,SAAS,OAAO,aAAa,kBAAkB;AAC/C,SAAS,mBAAmB;AAC5B,SAAS,WAAW;AACpB,SAAS,aAAa;AAgBtB,IAAM,sBAA2C,oBAAI,IAAI;AAAA;AAAA,EAEvD;AAAA,EACA;AAAA;AAAA,EAEA;AAAA;AAAA,EAEA;AAAA,EACA;AAAA;AAAA;AAAA,EAGA;AAAA,EACA;AAAA,EACA;AAAA;AAAA;AAAA;AAAA,EAIA;AAAA,EACA;AAAA,EACA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA;AACF,CAAC;AAGD,IAAM,sBAA2C,oBAAI,IAAI;AAAA,EACvD;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAED,IAAM,YAAY;AAClB,IAAM,eAAe;AACrB,IAAM,QAAQ;AACd,IAAM,cAAc;AACpB,IAAM,WAAW;AAEjB,SAAS,cAAc,MAAuB;AAC5C,SAAQ,QAAQ,MAAQ,QAAQ,OAAU,QAAQ,MAAQ,QAAQ;AACpE;AAEA,SAAS,cAAc,MAAuB;AAI5C,SACE,SAAS,gBACT,SAAS,SACT,SAAS,MACT,SAAS,KACT,SAAS,MACT,SAAS;AAEb;AAGA,SAAS,WAAW,OAAuB;AACzC,MAAI,MAAM;AACV,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,GAAG;AACxC,UAAM,OAAO,MAAM,WAAW,CAAC;AAC/B,WAAO,QAAQ,MAAQ,QAAQ,KAAO,OAAO,aAAa,OAAO,EAAI,IAAI,MAAM,CAAC;AAAA,EAClF;AACA,SAAO;AACT;AAQA,SAAS,QAAQ,KAA4B;AAC3C,MAAI,IAAI,WAAW,CAAC,MAAM,UAAW,QAAO;AAC5C,MAAI,IAAI;AACR,QAAM,UAAU,IAAI,WAAW,CAAC,MAAM;AACtC,MAAI,QAAS,MAAK;AAElB,MAAI,IAAI,WAAW,CAAC,MAAM,eAAe,IAAI,WAAW,CAAC,MAAM,SAAU,QAAO;AAChF,MAAI,CAAC,cAAc,IAAI,WAAW,CAAC,CAAC,EAAG,QAAO;AAC9C,QAAM,SAAS;AACf,SAAO,IAAI,IAAI,UAAU,cAAc,IAAI,WAAW,CAAC,CAAC,EAAG,MAAK;AAChE,QAAM,cAAc,IAAI,WAAW,IAAI,SAAS,CAAC,MAAM;AACvD,SAAO,EAAE,MAAM,IAAI,MAAM,QAAQ,CAAC,GAAG,SAAS,YAAY;AAC5D;AAQA,SAAS,mBAAmB,OAAiB,KAAa,eAA8B;AACtF,QAAM,SAAS,QAAQ,GAAG;AAC1B,MAAI,WAAW,KAAM;AACrB,QAAM,OAAO,gBAAgB,OAAO,OAAO,WAAW,OAAO,IAAI;AACjE,MAAI,OAAO,SAAS;AAClB,QAAI,MAAM,MAAM,SAAS,CAAC,MAAM,KAAM,OAAM,IAAI;AAChD;AAAA,EACF;AACA,MAAI,CAAC,OAAO,eAAe,iBAAiB,IAAI,EAAG,OAAM,KAAK,IAAI;AACpE;AAEA,SAAS,SAAS,QAAgB,YAA2C;AAC3E,SAAO;AAAA,IACL,MAAM,EAAE,YAAY,CAAC,GAAG,UAAU,EAAE,CAAC,EAClC,SAAS,EACT,MAAM,WAAW,EAAE,QAAQ,MAAM,IAAI,CAAC;AAAA,EAC3C;AACF;AAQO,SAAS,eAAe,SAAuC;AACpE,MAAI,YAAY,gBAAgB,YAAY,MAAO,QAAO;AAC1D,MAAI,YAAY,QAAW;AACzB,UAAM,IAAI;AAAA,MACR;AAAA,MACA;AAAA,IACF;AAAA,EACF;AACA,QAAM,IAAI;AAAA,IACR;AAAA,IACA,oBAAoB,OAAO,OAAO,CAAC;AAAA,EACrC;AACF;AAKA,IAAM,sBAAsB,CAAC,QAAQ,MAAM;AAE3C,SAAS,cAAc,SAA+B;AACpD,QAAM,KAAK,YAAY,CAAC,GAAG,mBAAmB,CAAC;AAC/C,SAAO,YAAY,QAAQ,CAAC,IAAI,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC;AAC9D;AAEO,SAAS,cAAc,QAAgB,SAA0B;AACtE,QAAM,SAAS,iBAAiB,SAAS,MAAM,SAAS,QAAQ,cAAc,OAAO,CAAC,CAAC;AACvF,QAAM,QAAgB,CAAC;AACvB,QAAM,eAAyB,CAAC;AAChC,MAAI,YAAY;AAEhB,aAAW,CAAC,MAAM,KAAK,KAAK,QAAQ;AAClC,UAAM,OAAO,MAAM;AAEnB,QAAI,oBAAoB,IAAI,IAAI,GAAG;AACjC,mBAAa,SAAS,UAAU,IAAI;AACpC;AAAA,IACF;AAEA,QAAI,oBAAoB,IAAI,IAAI,GAAG;AACjC,UAAI,SAAS,SAAS;AACpB;AAAA,UACE;AAAA,UACA,OAAO,MAAM,MAAM,MAAM,QAAQ,MAAM,IAAI,MAAM;AAAA,UACjD,SAAS;AAAA,QACX;AAAA,MACF;AACA,mBAAa,SAAS,UAAU,IAAI;AACpC;AAAA,IACF;AAIA,QAAI,SAAS,YAAY;AACvB,UAAI,SAAS,WAAW,cAAc,KAAK,aAAa,WAAW,GAAG;AACpE,mBAAW,QAAQ;AAAA,UACjB,OAAO,MAAM,MAAM,MAAM,QAAQ,MAAM,IAAI,MAAM;AAAA,UACjD,MAAM,MAAM;AAAA,QACd,GAAG;AACD,gBAAM,KAAK,IAAI;AAAA,QACjB;AAAA,MACF;AACA,mBAAa,SAAS,UAAU,IAAI;AACpC;AAAA,IACF;AAEA,QAAI,SAAS,WAAW,SAAS,UAAU,cAAc,KAAK,aAAa,WAAW,GAAG;AACvF,YAAM,KAAK,EAAE,OAAO,MAAM,MAAM,QAAQ,KAAK,MAAM,IAAI,OAAO,CAAC;AAAA,IACjE;AAAA,EACF;AAEA,SAAO;AACT;;;AChMO,SAAS,oBAAoB,OAAe,SAAmC;AACpF,QAAM,eAAe,oBAAoB,QAAQ,UAAU;AAC3D,QAAM,UAAU,UAAU,QAAQ,KAAK;AACvC,QAAM,SAAS,cAAc,QAAQ,MAAM;AAC3C,QAAM,UAAU,eAAe,QAAQ,OAAO;AAC9C,QAAM,QAAQ,cAAc,OAAO,OAAO;AAC1C,SAAO,aAAa,OAAO,OAAO,SAAS,QAAQ,YAAY,YAAY;AAC7E;AAKO,SAAS,wBAAwB,OAAe,SAAqC;AAC1F,QAAM,eAAe,oBAAoB,QAAQ,UAAU;AAC3D,QAAM,UAAU,UAAU,QAAQ,KAAK;AACvC,QAAM,SAAS,cAAc,QAAQ,MAAM;AAC3C,QAAM,UAAU,eAAe,QAAQ,OAAO;AAC9C,SAAO;AAAA,IACL;AAAA,IACA,cAAc,OAAO,OAAO;AAAA,IAC5B;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;","names":[]}

package/dist/chunk-5U3DRTV7.js

@@ -0,0 +1,205 @@
+import {
+  LINE_MARKER,
+  MARKER,
+  NO_ORIGIN,
+  PolytypoError,
+  RULES,
+  applyEdits,
+  fromCodePoints,
+  isMarker,
+  runRulesRecording,
+  toCodePoints
+} from "./chunk-VKJVMMCI.js";
+
+// src/modes/spans.ts
+var SPACE = 32;
+var LINE_TERMINATORS = /* @__PURE__ */ new Set([
+  10,
+  13,
+  11,
+  12,
+  133,
+  8232,
+  8233
+]);
+function gapIsLineBoundary(source, from, to) {
+  for (let i = from; i < to; i += 1) {
+    if (LINE_TERMINATORS.has(source.charCodeAt(i))) return true;
+  }
+  return false;
+}
+function normalizeSpans(spans) {
+  const sorted = spans.filter((s) => s.end > s.start).sort((a, b) => a.start - b.start);
+  const out = [];
+  for (const span of sorted) {
+    const last = out[out.length - 1];
+    if (last === void 0) {
+      out.push(span);
+      continue;
+    }
+    if (span.start < last.end) {
+      throw new PolytypoError(
+        "POLYTYPO_RULE_CONTRACT",
+        `mode extractor produced overlapping spans (${last.start}, ${last.end}) and (${span.start}, ${span.end})`
+      );
+    }
+    if (span.start === last.end) {
+      out[out.length - 1] = { start: last.start, end: span.end };
+      continue;
+    }
+    out.push(span);
+  }
+  return out;
+}
+function concatenateSpans(source, spans) {
+  const cp = [];
+  let previous;
+  for (const span of spans) {
+    if (previous !== void 0) {
+      cp.push(gapIsLineBoundary(source, previous.end, span.start) ? LINE_MARKER : MARKER);
+    }
+    for (const value of toCodePoints(source.slice(span.start, span.end))) cp.push(value);
+    previous = span;
+  }
+  return cp;
+}
+function spanRangesOf(cp) {
+  const ranges = [];
+  let first = 0;
+  for (let i = 0; i < cp.length; i += 1) {
+    if (isMarker(cp[i])) {
+      ranges.push({ first, last: i - 1 });
+      first = i + 1;
+    }
+  }
+  ranges.push({ first, last: cp.length - 1 });
+  return ranges;
+}
+function spanContaining(ranges, p) {
+  for (const range of ranges) {
+    if (p >= range.first && p <= range.last + 1) return range;
+  }
+  return void 0;
+}
+function filterBoundaryEdits(cp, edits, ranges) {
+  const out = [];
+  for (const edit of edits) {
+    let containsMarker = false;
+    for (let i = edit.start; i < edit.end; i += 1) {
+      if (isMarker(cp[i])) {
+        containsMarker = true;
+        break;
+      }
+    }
+    if (containsMarker) continue;
+    const p = edit.start;
+    const q = edit.end - 1;
+    const d = edit.end - edit.start;
+    const r = edit.replacement.length;
+    const span = spanContaining(ranges, p);
+    if (span !== void 0 && (p === span.first || q === span.last)) {
+      if (r > d) continue;
+      const first = edit.replacement[0];
+      const last = edit.replacement[r - 1];
+      if (r > 0 && p === span.first && first === SPACE && cp[p] !== SPACE) continue;
+      if (r > 0 && q === span.last && last === SPACE && cp[q] !== SPACE) continue;
+    }
+    out.push(edit);
+  }
+  return out;
+}
+function splitOnMarker(cp, expected) {
+  const pieces = [[]];
+  for (const value of cp) {
+    if (isMarker(value)) {
+      pieces.push([]);
+      continue;
+    }
+    pieces[pieces.length - 1].push(value);
+  }
+  if (pieces.length !== expected) {
+    throw new PolytypoError(
+      "POLYTYPO_RULE_CONTRACT",
+      `boundary markers did not survive the pipeline: expected ${expected} spans, found ${pieces.length}`
+    );
+  }
+  return pieces;
+}
+function originOfSpans(source, spans) {
+  const codePointIndexOf = new Array(source.length + 1);
+  let cpIndex = 0;
+  for (let i = 0; i < source.length; ) {
+    codePointIndexOf[i] = cpIndex;
+    const code = source.codePointAt(i);
+    const width = code > 65535 ? 2 : 1;
+    if (width === 2) codePointIndexOf[i + 1] = cpIndex;
+    i += width;
+    cpIndex += 1;
+  }
+  codePointIndexOf[source.length] = cpIndex;
+  const origin = [];
+  let previous;
+  for (const span of spans) {
+    if (previous !== void 0) origin.push(NO_ORIGIN);
+    const base = codePointIndexOf[span.start];
+    const length = toCodePoints(source.slice(span.start, span.end)).length;
+    for (let k = 0; k < length; k += 1) origin.push(base + k);
+    previous = span;
+  }
+  return origin;
+}
+
+// src/engine/span-runner.ts
+function runRulesOverSpans(cp, planned, locale, mode, narrowTarget) {
+  let current = cp;
+  for (const id of planned) {
+    const rule = RULES[id];
+    if (rule === void 0) continue;
+    const edits = rule.apply({ cp: current, locale, mode, narrowTarget });
+    current = applyEdits(current, filterBoundaryEdits(current, edits, spanRangesOf(current)), id);
+  }
+  return current;
+}
+function runOverSpans(source, spans, planned, locale, mode, narrowTarget) {
+  const normalized = normalizeSpans(spans);
+  if (normalized.length === 0) return source;
+  const transformed = runRulesOverSpans(
+    concatenateSpans(source, normalized),
+    planned,
+    locale,
+    mode,
+    narrowTarget
+  );
+  const pieces = splitOnMarker(transformed, normalized.length);
+  let out = "";
+  let cursor = 0;
+  for (let i = 0; i < normalized.length; i += 1) {
+    const span = normalized[i];
+    const replacement = fromCodePoints(pieces[i]);
+    const original = source.slice(span.start, span.end);
+    out += source.slice(cursor, span.start);
+    out += replacement === original ? original : replacement;
+    cursor = span.end;
+  }
+  return out + source.slice(cursor);
+}
+function analyzeOverSpans(source, spans, planned, locale, mode, narrowTarget) {
+  const normalized = normalizeSpans(spans);
+  if (normalized.length === 0) return [];
+  return runRulesRecording(
+    concatenateSpans(source, normalized),
+    planned,
+    locale,
+    mode,
+    narrowTarget,
+    originOfSpans(source, normalized),
+    toCodePoints(source).length,
+    (current, edits) => filterBoundaryEdits(current, edits, spanRangesOf(current))
+  );
+}
+
+export {
+  runOverSpans,
+  analyzeOverSpans
+};
+//# sourceMappingURL=chunk-5U3DRTV7.js.map

package/dist/chunk-5U3DRTV7.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/modes/spans.ts","../src/engine/span-runner.ts"],"sourcesContent":["import { toCodePoints } from \"../engine/codepoints.js\";\nimport { isMarker, LINE_MARKER, MARKER } from \"../engine/sentinels.js\";\nimport { PolytypoError } from \"../errors.js\";\nimport type { Edit } from \"../types.js\";\nimport { NO_ORIGIN } from \"../engine/origin.js\";\n\n/**\n * The boundary markers are defined in the engine (src/engine/sentinels.ts), which is where all\n * three non-code-point sentinels live and where their disjointness is maintained. They are\n * re-exported here because the mode layer is what writes them into the array.\n *\n * Which marker separates two spans is decided by the **raw source bytes of the gap between\n * them**, so it is decidable without asking the parser anything and is identical in five\n * runtimes: a gap containing a line terminator gives `LINE_MARKER`, anything else `MARKER`.\n */\nexport { LINE_MARKER, MARKER, isMarker } from \"../engine/sentinels.js\";\n\n/** `BREAK` as the rules define it (`spaces.md` 3.1), tested against the gap's raw source. */\n/** U+0020, the one emitted code point whose meaning is positional (modes.md 3.4, 5 item 2). */\nconst SPACE = 0x20;\n\nconst LINE_TERMINATORS: ReadonlySet<number> = new Set([\n  0x0a, 0x0d, 0x0b, 0x0c, 0x85, 0x2028, 0x2029,\n]);\n\nfunction gapIsLineBoundary(source: string, from: number, to: number): boolean {\n  for (let i = from; i < to; i += 1) {\n    if (LINE_TERMINATORS.has(source.charCodeAt(i))) return true;\n  }\n  return false;\n}\n\n/**\n * A processable span, identified by its offsets in the **original source**. Offsets are UTF-16\n * indices into the JS source string, which is what every JS parser reports; they are an\n * implementation detail of this runtime and never reach the rules, which index code points.\n */\nexport interface Span {\n  readonly start: number;\n  readonly end: number;\n}\n\n/** A span's extent in the concatenated code-point array: `s₀` and `s₁` of modes.md 3.4. */\nexport interface SpanRange {\n  readonly first: number;\n  readonly last: number;\n}\n\n/**\n * Sort, drop empties, and coalesce spans separated by nothing in the source (modes.md 7.5:\n * a parser that reports one text run as two adjacent nodes must not manufacture a boundary).\n * Overlapping spans are an extractor bug and are rejected rather than silently merged.\n */\nexport function normalizeSpans(spans: readonly Span[]): Span[] {\n  const sorted = spans.filter((s) => s.end > s.start).sort((a, b) => a.start - b.start);\n  const out: Span[] = [];\n  for (const span of sorted) {\n    const last = out[out.length - 1];\n    if (last === undefined) {\n      out.push(span);\n      continue;\n    }\n    if (span.start < last.end) {\n      throw new PolytypoError(\n        \"POLYTYPO_RULE_CONTRACT\",\n        `mode extractor produced overlapping spans (${last.start}, ${last.end}) and (${span.start}, ${span.end})`,\n      );\n    }\n    if (span.start === last.end) {\n      out[out.length - 1] = { start: last.start, end: span.end };\n      continue;\n    }\n    out.push(span);\n  }\n  return out;\n}\n\n/** `S₁ ⌢ [marker] ⌢ S₂ ⌢ … ⌢ Sₘ` (modes.md 3.5 step 2). */\nexport function concatenateSpans(source: string, spans: readonly Span[]): number[] {\n  const cp: number[] = [];\n  let previous: Span | undefined;\n  for (const span of spans) {\n    if (previous !== undefined) {\n      cp.push(gapIsLineBoundary(source, previous.end, span.start) ? LINE_MARKER : MARKER);\n    }\n    for (const value of toCodePoints(source.slice(span.start, span.end))) cp.push(value);\n    previous = span;\n  }\n  return cp;\n}\n\n/**\n * The span extents of the array as it stands. Recomputed after every rule, because applying\n * edits shifts every index after the first one — the markers themselves are guaranteed to\n * survive, since no edit may contain one.\n */\nexport function spanRangesOf(cp: readonly number[]): SpanRange[] {\n  const ranges: SpanRange[] = [];\n  let first = 0;\n  for (let i = 0; i < cp.length; i += 1) {\n    if (isMarker(cp[i] as number)) {\n      ranges.push({ first, last: i - 1 });\n      first = i + 1;\n    }\n  }\n  ranges.push({ first, last: cp.length - 1 });\n  return ranges;\n}\n\nfunction spanContaining(ranges: readonly SpanRange[], p: number): SpanRange | undefined {\n  for (const range of ranges) {\n    if (p >= range.first && p <= range.last + 1) return range;\n  }\n  return undefined;\n}\n\n/**\n * modes.md 3.4, two safety nets, both pure functions of `(p, q, r, s₀, s₁)` — so the verdict is\n * identical on every run, which is what makes redistribution deterministic (modes.md 5, point 3).\n *\n * 1. **No edit may contain a marker.** No rule can produce one; one that does is a bug, and the\n *    edit is discarded rather than treated as a redistribution question.\n * 2. **The edge-growth rule.** An edit is discarded if it would place code points at an\n *    extremity of its span that were not there before: with `d = q - p + 1` the replaced length\n *    and `r` the replacement length, discard when `p = s₀ and r > d`, or `q = s₁ and r > d`.\n *\n * The length test is the whole rule and needs no knowledge of Markdown or HTML syntax. It\n * separates exactly the cases that matter: `\"` → `“` at an edge is 1 → 1 and applies; `--` →\n * `␣–␣` at an edge is 2 → 3 and is discarded, while the same edit interior to a span applies;\n * `(c)` → `©` is 3 → 1 and applies, because shrinking is always safe. An insertion has `d = 0`,\n * so it is discarded exactly when its position coincides with a span edge — the rule this one\n * generalises.\n *\n * **Deletion at an edge is not restricted here**, and must not be: `r > d` is false for a\n * deletion, so this filter never sees one. Deletion at an edge is governed by modes.md 3.3's\n * *Edge tests* clause instead — where a rule asks \"am I at the edge of the text I am allowed to\n * modify\" rather than \"what character is here\", the marker behaves as `NONE`. That clause is the\n * one place a rule may treat a span edge as the end of the text, it exists because `spaces` is\n * the only rule that deletes, and 3.3 states the division: **a rule that deletes must treat a\n * span edge as the end of the text; a rule that replaces or inserts must not, and is governed by\n * this filter.** The single test that claims the clause is `spaces.md` 3.2 step 4.\n */\nexport function filterBoundaryEdits(\n  cp: readonly number[],\n  edits: readonly Edit[],\n  ranges: readonly SpanRange[],\n): Edit[] {\n  const out: Edit[] = [];\n  for (const edit of edits) {\n    let containsMarker = false;\n    for (let i = edit.start; i < edit.end; i += 1) {\n      if (isMarker(cp[i] as number)) {\n        containsMarker = true;\n        break;\n      }\n    }\n    if (containsMarker) continue;\n\n    // `[start, end)` in the engine's half-open form is `cp[p … q]` with p = start, q = end - 1;\n    // an insertion is `q = p - 1`, which falls out of the same expression.\n    const p = edit.start;\n    const q = edit.end - 1;\n    const d = edit.end - edit.start;\n    const r = edit.replacement.length;\n    const span = spanContaining(ranges, p);\n    if (span !== undefined && (p === span.first || q === span.last)) {\n      if (r > d) continue;\n      // The character clause. `r > d` is not the rule, only a formalisation of it that misses\n      // `r === d`: `dashes` P3 admits a run of THREE dashes, so `---` -> `␣–␣` is 3 -> 3 and the\n      // length test sees nothing while U+0020 lands on both extremities anyway. Testing the\n      // character catches it, and only U+0020 needs testing — it is the one code point any rule\n      // emits whose meaning comes from its position rather than from itself (modes.md 5 item 2).\n      const first = edit.replacement[0];\n      const last = edit.replacement[r - 1];\n      if (r > 0 && p === span.first && first === SPACE && cp[p] !== SPACE) continue;\n      if (r > 0 && q === span.last && last === SPACE && cp[q] !== SPACE) continue;\n    }\n\n    out.push(edit);\n  }\n  return out;\n}\n\n/** Redistribute the transformed array back to one piece per span (modes.md 3.5 step 4). */\nexport function splitOnMarker(cp: readonly number[], expected: number): number[][] {\n  const pieces: number[][] = [[]];\n  for (const value of cp) {\n    if (isMarker(value)) {\n      pieces.push([]);\n      continue;\n    }\n    (pieces[pieces.length - 1] as number[]).push(value);\n  }\n  if (pieces.length !== expected) {\n    throw new PolytypoError(\n      \"POLYTYPO_RULE_CONTRACT\",\n      `boundary markers did not survive the pipeline: expected ${expected} spans, found ${pieces.length}`,\n    );\n  }\n  return pieces;\n}\n\n/**\n * The origin map for `concatenateSpans` (analyze.md §2): for every code point of the joined\n * array, the code-point offset of the character it came from IN THE DOCUMENT, and NO_ORIGIN for\n * the markers, which came from nowhere. `Span` bounds are native string indices, so the\n * conversion to code-point offsets happens here and not in the caller — this is the one place\n * that knows both coordinate systems.\n */\nexport function originOfSpans(source: string, spans: readonly Span[]): number[] {\n  const codePointIndexOf = new Array<number>(source.length + 1);\n  let cpIndex = 0;\n  for (let i = 0; i < source.length;) {\n    codePointIndexOf[i] = cpIndex;\n    const code = source.codePointAt(i) as number;\n    const width = code > 0xffff ? 2 : 1;\n    if (width === 2) codePointIndexOf[i + 1] = cpIndex;\n    i += width;\n    cpIndex += 1;\n  }\n  codePointIndexOf[source.length] = cpIndex;\n\n  const origin: number[] = [];\n  let previous: Span | undefined;\n  for (const span of spans) {\n    if (previous !== undefined) origin.push(NO_ORIGIN);\n    const base = codePointIndexOf[span.start] as number;\n    const length = toCodePoints(source.slice(span.start, span.end)).length;\n    for (let k = 0; k < length; k += 1) origin.push(base + k);\n    previous = span;\n  }\n  return origin;\n}\n","import {\n  concatenateSpans,\n  filterBoundaryEdits,\n  normalizeSpans,\n  originOfSpans,\n  spanRangesOf,\n  splitOnMarker,\n  type Span,\n} from \"../modes/spans.js\";\nimport { RULES } from \"../rules/registry.js\";\nimport type { LocaleData, Mode, RuleId } from \"../types.js\";\nimport { applyEdits } from \"./edits.js\";\nimport { fromCodePoints, toCodePoints } from \"./codepoints.js\";\nimport type { Change } from \"./origin.js\";\nimport { runRulesRecording } from \"./rule-runner.js\";\n\n/**\n * The same sequence as `runRules` (`./rule-runner.js`), with the two boundary filters of\n * modes.md 3.4 interposed. The span extents are recomputed after every rule, because applying\n * an edit shifts every index after it; the markers themselves always survive, since no edit may\n * contain one.\n */\nfunction runRulesOverSpans(\n  cp: readonly number[],\n  planned: readonly RuleId[],\n  locale: LocaleData,\n  mode: Mode,\n  narrowTarget: number,\n): readonly number[] {\n  let current = cp;\n  for (const id of planned) {\n    const rule = RULES[id];\n    if (rule === undefined) continue;\n    const edits = rule.apply({ cp: current, locale, mode, narrowTarget });\n    current = applyEdits(current, filterBoundaryEdits(current, edits, spanRangesOf(current)), id);\n  }\n  return current;\n}\n\n/**\n * modes.md 3.5. The pipeline runs **once**, over the marker-separated concatenation of every\n * processable span — not per span, which would pair quotation marks in isolation, and not over a\n * naive concatenation, which would manufacture adjacencies the document does not have.\n *\n * The output is the input with a set of disjoint substring replacements applied and nothing else\n * (modes.md 4). A span whose content the rules did not change contributes no replacement, so a\n * document needing no changes comes back byte-identical; the parser located the spans and was\n * then discarded, and the document is never serialised.\n */\nexport function runOverSpans(\n  source: string,\n  spans: readonly Span[],\n  planned: readonly RuleId[],\n  locale: LocaleData,\n  mode: Mode,\n  narrowTarget: number,\n): string {\n  const normalized = normalizeSpans(spans);\n  if (normalized.length === 0) return source;\n\n  const transformed = runRulesOverSpans(\n    concatenateSpans(source, normalized),\n    planned,\n    locale,\n    mode,\n    narrowTarget,\n  );\n  const pieces = splitOnMarker(transformed, normalized.length);\n\n  let out = \"\";\n  let cursor = 0;\n  for (let i = 0; i < normalized.length; i += 1) {\n    const span = normalized[i] as Span;\n    const replacement = fromCodePoints(pieces[i] as number[]);\n    const original = source.slice(span.start, span.end);\n    out += source.slice(cursor, span.start);\n    out += replacement === original ? original : replacement;\n    cursor = span.end;\n  }\n  return out + source.slice(cursor);\n}\n\n/**\n * `runOverSpans`, reporting instead of applying (analyze.md §1). The span table supplies the\n * origin map, so every change comes back in DOCUMENT coordinates — analyze.md §6 names a\n * runtime that reports span-local offsets here as the mistake that passes every text-mode test.\n */\nexport function analyzeOverSpans(\n  source: string,\n  spans: readonly Span[],\n  planned: readonly RuleId[],\n  locale: LocaleData,\n  mode: Mode,\n  narrowTarget: number,\n): Change[] {\n  const normalized = normalizeSpans(spans);\n  if (normalized.length === 0) return [];\n  return runRulesRecording(\n    concatenateSpans(source, normalized),\n    planned,\n    locale,\n    mode,\n    narrowTarget,\n    originOfSpans(source, normalized),\n    toCodePoints(source).length,\n    (current, edits) => filterBoundaryEdits(current, edits, spanRangesOf(current)),\n  );\n}\n"],"mappings":";;;;;;;;;;;;;;AAmBA,IAAM,QAAQ;AAEd,IAAM,mBAAwC,oBAAI,IAAI;AAAA,EACpD;AAAA,EAAM;AAAA,EAAM;AAAA,EAAM;AAAA,EAAM;AAAA,EAAM;AAAA,EAAQ;AACxC,CAAC;AAED,SAAS,kBAAkB,QAAgB,MAAc,IAAqB;AAC5E,WAAS,IAAI,MAAM,IAAI,IAAI,KAAK,GAAG;AACjC,QAAI,iBAAiB,IAAI,OAAO,WAAW,CAAC,CAAC,EAAG,QAAO;AAAA,EACzD;AACA,SAAO;AACT;AAuBO,SAAS,eAAe,OAAgC;AAC7D,QAAM,SAAS,MAAM,OAAO,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AACpF,QAAM,MAAc,CAAC;AACrB,aAAW,QAAQ,QAAQ;AACzB,UAAM,OAAO,IAAI,IAAI,SAAS,CAAC;AAC/B,QAAI,SAAS,QAAW;AACtB,UAAI,KAAK,IAAI;AACb;AAAA,IACF;AACA,QAAI,KAAK,QAAQ,KAAK,KAAK;AACzB,YAAM,IAAI;AAAA,QACR;AAAA,QACA,8CAA8C,KAAK,KAAK,KAAK,KAAK,GAAG,UAAU,KAAK,KAAK,KAAK,KAAK,GAAG;AAAA,MACxG;AAAA,IACF;AACA,QAAI,KAAK,UAAU,KAAK,KAAK;AAC3B,UAAI,IAAI,SAAS,CAAC,IAAI,EAAE,OAAO,KAAK,OAAO,KAAK,KAAK,IAAI;AACzD;AAAA,IACF;AACA,QAAI,KAAK,IAAI;AAAA,EACf;AACA,SAAO;AACT;AAGO,SAAS,iBAAiB,QAAgB,OAAkC;AACjF,QAAM,KAAe,CAAC;AACtB,MAAI;AACJ,aAAW,QAAQ,OAAO;AACxB,QAAI,aAAa,QAAW;AAC1B,SAAG,KAAK,kBAAkB,QAAQ,SAAS,KAAK,KAAK,KAAK,IAAI,cAAc,MAAM;AAAA,IACpF;AACA,eAAW,SAAS,aAAa,OAAO,MAAM,KAAK,OAAO,KAAK,GAAG,CAAC,EAAG,IAAG,KAAK,KAAK;AACnF,eAAW;AAAA,EACb;AACA,SAAO;AACT;AAOO,SAAS,aAAa,IAAoC;AAC/D,QAAM,SAAsB,CAAC;AAC7B,MAAI,QAAQ;AACZ,WAAS,IAAI,GAAG,IAAI,GAAG,QAAQ,KAAK,GAAG;AACrC,QAAI,SAAS,GAAG,CAAC,CAAW,GAAG;AAC7B,aAAO,KAAK,EAAE,OAAO,MAAM,IAAI,EAAE,CAAC;AAClC,cAAQ,IAAI;AAAA,IACd;AAAA,EACF;AACA,SAAO,KAAK,EAAE,OAAO,MAAM,GAAG,SAAS,EAAE,CAAC;AAC1C,SAAO;AACT;AAEA,SAAS,eAAe,QAA8B,GAAkC;AACtF,aAAW,SAAS,QAAQ;AAC1B,QAAI,KAAK,MAAM,SAAS,KAAK,MAAM,OAAO,EAAG,QAAO;AAAA,EACtD;AACA,SAAO;AACT;AA4BO,SAAS,oBACd,IACA,OACA,QACQ;AACR,QAAM,MAAc,CAAC;AACrB,aAAW,QAAQ,OAAO;AACxB,QAAI,iBAAiB;AACrB,aAAS,IAAI,KAAK,OAAO,IAAI,KAAK,KAAK,KAAK,GAAG;AAC7C,UAAI,SAAS,GAAG,CAAC,CAAW,GAAG;AAC7B,yBAAiB;AACjB;AAAA,MACF;AAAA,IACF;AACA,QAAI,eAAgB;AAIpB,UAAM,IAAI,KAAK;AACf,UAAM,IAAI,KAAK,MAAM;AACrB,UAAM,IAAI,KAAK,MAAM,KAAK;AAC1B,UAAM,IAAI,KAAK,YAAY;AAC3B,UAAM,OAAO,eAAe,QAAQ,CAAC;AACrC,QAAI,SAAS,WAAc,MAAM,KAAK,SAAS,MAAM,KAAK,OAAO;AAC/D,UAAI,IAAI,EAAG;AAMX,YAAM,QAAQ,KAAK,YAAY,CAAC;AAChC,YAAM,OAAO,KAAK,YAAY,IAAI,CAAC;AACnC,UAAI,IAAI,KAAK,MAAM,KAAK,SAAS,UAAU,SAAS,GAAG,CAAC,MAAM,MAAO;AACrE,UAAI,IAAI,KAAK,MAAM,KAAK,QAAQ,SAAS,SAAS,GAAG,CAAC,MAAM,MAAO;AAAA,IACrE;AAEA,QAAI,KAAK,IAAI;AAAA,EACf;AACA,SAAO;AACT;AAGO,SAAS,cAAc,IAAuB,UAA8B;AACjF,QAAM,SAAqB,CAAC,CAAC,CAAC;AAC9B,aAAW,SAAS,IAAI;AACtB,QAAI,SAAS,KAAK,GAAG;AACnB,aAAO,KAAK,CAAC,CAAC;AACd;AAAA,IACF;AACA,IAAC,OAAO,OAAO,SAAS,CAAC,EAAe,KAAK,KAAK;AAAA,EACpD;AACA,MAAI,OAAO,WAAW,UAAU;AAC9B,UAAM,IAAI;AAAA,MACR;AAAA,MACA,2DAA2D,QAAQ,iBAAiB,OAAO,MAAM;AAAA,IACnG;AAAA,EACF;AACA,SAAO;AACT;AASO,SAAS,cAAc,QAAgB,OAAkC;AAC9E,QAAM,mBAAmB,IAAI,MAAc,OAAO,SAAS,CAAC;AAC5D,MAAI,UAAU;AACd,WAAS,IAAI,GAAG,IAAI,OAAO,UAAS;AAClC,qBAAiB,CAAC,IAAI;AACtB,UAAM,OAAO,OAAO,YAAY,CAAC;AACjC,UAAM,QAAQ,OAAO,QAAS,IAAI;AAClC,QAAI,UAAU,EAAG,kBAAiB,IAAI,CAAC,IAAI;AAC3C,SAAK;AACL,eAAW;AAAA,EACb;AACA,mBAAiB,OAAO,MAAM,IAAI;AAElC,QAAM,SAAmB,CAAC;AAC1B,MAAI;AACJ,aAAW,QAAQ,OAAO;AACxB,QAAI,aAAa,OAAW,QAAO,KAAK,SAAS;AACjD,UAAM,OAAO,iBAAiB,KAAK,KAAK;AACxC,UAAM,SAAS,aAAa,OAAO,MAAM,KAAK,OAAO,KAAK,GAAG,CAAC,EAAE;AAChE,aAAS,IAAI,GAAG,IAAI,QAAQ,KAAK,EAAG,QAAO,KAAK,OAAO,CAAC;AACxD,eAAW;AAAA,EACb;AACA,SAAO;AACT;;;AClNA,SAAS,kBACP,IACA,SACA,QACA,MACA,cACmB;AACnB,MAAI,UAAU;AACd,aAAW,MAAM,SAAS;AACxB,UAAM,OAAO,MAAM,EAAE;AACrB,QAAI,SAAS,OAAW;AACxB,UAAM,QAAQ,KAAK,MAAM,EAAE,IAAI,SAAS,QAAQ,MAAM,aAAa,CAAC;AACpE,cAAU,WAAW,SAAS,oBAAoB,SAAS,OAAO,aAAa,OAAO,CAAC,GAAG,EAAE;AAAA,EAC9F;AACA,SAAO;AACT;AAYO,SAAS,aACd,QACA,OACA,SACA,QACA,MACA,cACQ;AACR,QAAM,aAAa,eAAe,KAAK;AACvC,MAAI,WAAW,WAAW,EAAG,QAAO;AAEpC,QAAM,cAAc;AAAA,IAClB,iBAAiB,QAAQ,UAAU;AAAA,IACnC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACA,QAAM,SAAS,cAAc,aAAa,WAAW,MAAM;AAE3D,MAAI,MAAM;AACV,MAAI,SAAS;AACb,WAAS,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK,GAAG;AAC7C,UAAM,OAAO,WAAW,CAAC;AACzB,UAAM,cAAc,eAAe,OAAO,CAAC,CAAa;AACxD,UAAM,WAAW,OAAO,MAAM,KAAK,OAAO,KAAK,GAAG;AAClD,WAAO,OAAO,MAAM,QAAQ,KAAK,KAAK;AACtC,WAAO,gBAAgB,WAAW,WAAW;AAC7C,aAAS,KAAK;AAAA,EAChB;AACA,SAAO,MAAM,OAAO,MAAM,MAAM;AAClC;AAOO,SAAS,iBACd,QACA,OACA,SACA,QACA,MACA,cACU;AACV,QAAM,aAAa,eAAe,KAAK;AACvC,MAAI,WAAW,WAAW,EAAG,QAAO,CAAC;AACrC,SAAO;AAAA,IACL,iBAAiB,QAAQ,UAAU;AAAA,IACnC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,cAAc,QAAQ,UAAU;AAAA,IAChC,aAAa,MAAM,EAAE;AAAA,IACrB,CAAC,SAAS,UAAU,oBAAoB,SAAS,OAAO,aAAa,OAAO,CAAC;AAAA,EAC/E;AACF;","names":[]}