polytypo 1.9.0 → 1.10.0

package/dist/{chunk-777UZMD2.cjs.map → chunk-KSW5EOAP.cjs.map}

@@ -1 +1 @@
-{"version":3,"sources":["/home/runner/work/polytypo-js/polytypo-js/dist/chunk-777UZMD2.cjs","../src/engine/yaml-pipeline.ts"],"names":[],"mappings":"AAAA;AACE;AACA;AACF,wDAA6B;AAC7B;AACE;AACA;AACF,wDAA6B;AAC7B;AACE;AACA;AACA;AACF,wDAA6B;AAC7B;AACA;ACEO,SAAS,eAAA,CAAgB,KAAA,EAAe,OAAA,EAAmC;AAChF,EAAA,MAAM,aAAA,EAAe,mDAAA,OAAoB,CAAQ,UAAU,CAAA;AAC3D,EAAA,MAAM,QAAA,EAAU,yCAAA,OAAU,CAAQ,KAAK,CAAA;AACvC,EAAA,MAAM,OAAA,EAAS,6CAAA,OAAc,CAAQ,MAAM,CAAA;AAC3C,EAAA,MAAM,KAAA,EAAO,+CAAA,OAAgB,CAAQ,IAAI,CAAA;AACzC,EAAA,OAAO,4CAAA,KAAa,EAAO,yCAAA,KAAU,EAAO,IAAI,CAAA,EAAG,OAAA,EAAS,MAAA,EAAQ,MAAA,EAAQ,YAAY,CAAA;AAC1F;AAGO,SAAS,mBAAA,CAAoB,KAAA,EAAe,OAAA,EAAqC;AACtF,EAAA,MAAM,aAAA,EAAe,mDAAA,OAAoB,CAAQ,UAAU,CAAA;AAC3D,EAAA,MAAM,QAAA,EAAU,yCAAA,OAAU,CAAQ,KAAK,CAAA;AACvC,EAAA,MAAM,OAAA,EAAS,6CAAA,OAAc,CAAQ,MAAM,CAAA;AAC3C,EAAA,MAAM,KAAA,EAAO,+CAAA,OAAgB,CAAQ,IAAI,CAAA;AACzC,EAAA,OAAO,gDAAA,KAAiB,EAAO,yCAAA,KAAU,EAAO,IAAI,CAAA,EAAG,OAAA,EAAS,MAAA,EAAQ,MAAA,EAAQ,YAAY,CAAA;AAC9F;ADFA;AACA;AACE;AACA;AACF,6FAAC","file":"/home/runner/work/polytypo-js/polytypo-js/dist/chunk-777UZMD2.cjs","sourcesContent":[null,"import { yamlSpans } from \"../modes/yaml.js\";\nimport type { Options } from \"../types.js\";\nimport { getLocaleData } from \"./locale.js\";\nimport { resolveNarrowTarget } from \"./narrow-target.js\";\nimport { resolveYamlKeys } from \"./yaml-keys.js\";\nimport { planRules } from \"./rule-runner.js\";\nimport { analyzeOverSpans, runOverSpans } from \"./span-runner.js\";\nimport type { Change } from \"./origin.js\";\n\n/**\n * `yaml` mode only, and the only mode pipeline with **no parser dependency at all** — span\n * selection is the specified scan of modes.md 3.8, not a library. There is likewise no\n * `POLYTYPO_MALFORMED_INPUT` counterpart here: with no declared grammar to violate, a file that\n * is not YAML yields few spans or none and comes back byte for byte (modes.md 3.8.3). The only\n * throw this mode adds is `keys`, which is about the call and not the input.\n */\nexport function runYamlPipeline(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 keys = resolveYamlKeys(options.keys);\n  return runOverSpans(input, yamlSpans(input, keys), planned, locale, \"yaml\", narrowTarget);\n}\n\n/** analyze.md §1, `yaml` mode: offsets are into the document, not into a span (analyze.md §6). */\nexport function analyzeYamlPipeline(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 keys = resolveYamlKeys(options.keys);\n  return analyzeOverSpans(input, yamlSpans(input, keys), planned, locale, \"yaml\", narrowTarget);\n}\n"]}
+{"version":3,"sources":["/home/runner/work/polytypo-js/polytypo-js/dist/chunk-KSW5EOAP.cjs","../src/engine/yaml-pipeline.ts"],"names":[],"mappings":"AAAA;AACE;AACA;AACF,wDAA6B;AAC7B;AACE;AACA;AACF,wDAA6B;AAC7B;AACE;AACA;AACA;AACF,wDAA6B;AAC7B;AACA;ACEO,SAAS,eAAA,CAAgB,KAAA,EAAe,OAAA,EAAmC;AAChF,EAAA,MAAM,aAAA,EAAe,mDAAA,OAAoB,CAAQ,UAAU,CAAA;AAC3D,EAAA,MAAM,QAAA,EAAU,yCAAA,OAAU,CAAQ,KAAK,CAAA;AACvC,EAAA,MAAM,OAAA,EAAS,6CAAA,OAAc,CAAQ,MAAM,CAAA;AAC3C,EAAA,MAAM,KAAA,EAAO,+CAAA,OAAgB,CAAQ,IAAI,CAAA;AACzC,EAAA,OAAO,4CAAA,KAAa,EAAO,yCAAA,KAAU,EAAO,IAAI,CAAA,EAAG,OAAA,EAAS,MAAA,EAAQ,MAAA,EAAQ,YAAY,CAAA;AAC1F;AAGO,SAAS,mBAAA,CAAoB,KAAA,EAAe,OAAA,EAAqC;AACtF,EAAA,MAAM,aAAA,EAAe,mDAAA,OAAoB,CAAQ,UAAU,CAAA;AAC3D,EAAA,MAAM,QAAA,EAAU,yCAAA,OAAU,CAAQ,KAAK,CAAA;AACvC,EAAA,MAAM,OAAA,EAAS,6CAAA,OAAc,CAAQ,MAAM,CAAA;AAC3C,EAAA,MAAM,KAAA,EAAO,+CAAA,OAAgB,CAAQ,IAAI,CAAA;AACzC,EAAA,OAAO,gDAAA,KAAiB,EAAO,yCAAA,KAAU,EAAO,IAAI,CAAA,EAAG,OAAA,EAAS,MAAA,EAAQ,MAAA,EAAQ,YAAY,CAAA;AAC9F;ADFA;AACA;AACE;AACA;AACF,6FAAC","file":"/home/runner/work/polytypo-js/polytypo-js/dist/chunk-KSW5EOAP.cjs","sourcesContent":[null,"import { yamlSpans } from \"../modes/yaml.js\";\nimport type { Options } from \"../types.js\";\nimport { getLocaleData } from \"./locale.js\";\nimport { resolveNarrowTarget } from \"./narrow-target.js\";\nimport { resolveYamlKeys } from \"./yaml-keys.js\";\nimport { planRules } from \"./rule-runner.js\";\nimport { analyzeOverSpans, runOverSpans } from \"./span-runner.js\";\nimport type { Change } from \"./origin.js\";\n\n/**\n * `yaml` mode only, and the only mode pipeline with **no parser dependency at all** — span\n * selection is the specified scan of modes.md 3.8, not a library. There is likewise no\n * `POLYTYPO_MALFORMED_INPUT` counterpart here: with no declared grammar to violate, a file that\n * is not YAML yields few spans or none and comes back byte for byte (modes.md 3.8.3). The only\n * throw this mode adds is `keys`, which is about the call and not the input.\n */\nexport function runYamlPipeline(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 keys = resolveYamlKeys(options.keys);\n  return runOverSpans(input, yamlSpans(input, keys), planned, locale, \"yaml\", narrowTarget);\n}\n\n/** analyze.md §1, `yaml` mode: offsets are into the document, not into a span (analyze.md §6). */\nexport function analyzeYamlPipeline(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 keys = resolveYamlKeys(options.keys);\n  return analyzeOverSpans(input, yamlSpans(input, keys), planned, locale, \"yaml\", narrowTarget);\n}\n"]}

package/dist/{chunk-56X7JKY3.js → chunk-NSVC7XZG.js}

@@ -1,15 +1,15 @@
 import {
   htmlSpans
-} from "./chunk-XPVOE23B.js";
+} from "./chunk-EROJVHMJ.js";
 import {
   analyzeOverSpans,
   runOverSpans
-} from "./chunk-UV3Y2RCW.js";
+} from "./chunk-X3RDLKUA.js";
 import {
   getLocaleData,
   planRules,
   resolveNarrowTarget
-} from "./chunk-P27DD76M.js";
+} from "./chunk-TRUHKCDB.js";
 
 // src/engine/html-pipeline.ts
 function runHtmlPipeline(input, options) {
@@ -30,4 +30,4 @@ export {
   runHtmlPipeline,
   analyzeHtmlPipeline
 };
-//# sourceMappingURL=chunk-56X7JKY3.js.map
+//# sourceMappingURL=chunk-NSVC7XZG.js.map

package/dist/{chunk-OR7GGYEA.cjs → chunk-QPIQMX2S.cjs}

@@ -9,7 +9,7 @@
 
 
 
-var _chunkRRGKEG6Ecjs = require('./chunk-RRGKEG6E.cjs');
+var _chunkFFIR7BWQcjs = require('./chunk-FFIR7BWQ.cjs');
 
 // src/modes/spans.ts
 var SPACE = 32;
@@ -38,7 +38,7 @@ function normalizeSpans(spans) {
       continue;
     }
     if (span.start < last.end) {
-      throw new (0, _chunkRRGKEG6Ecjs.PolytypoError)(
+      throw new (0, _chunkFFIR7BWQcjs.PolytypoError)(
         "POLYTYPO_RULE_CONTRACT",
         `mode extractor produced overlapping spans (${last.start}, ${last.end}) and (${span.start}, ${span.end})`
       );
@@ -56,9 +56,9 @@ function concatenateSpans(source, spans) {
   let previous;
   for (const span of spans) {
     if (previous !== void 0) {
-      cp.push(gapIsLineBoundary(source, previous.end, span.start) ? _chunkRRGKEG6Ecjs.LINE_MARKER : _chunkRRGKEG6Ecjs.MARKER);
+      cp.push(gapIsLineBoundary(source, previous.end, span.start) ? _chunkFFIR7BWQcjs.LINE_MARKER : _chunkFFIR7BWQcjs.MARKER);
     }
-    for (const value of _chunkRRGKEG6Ecjs.toCodePoints.call(void 0, source.slice(span.start, span.end))) cp.push(value);
+    for (const value of _chunkFFIR7BWQcjs.toCodePoints.call(void 0, source.slice(span.start, span.end))) cp.push(value);
     previous = span;
   }
   return cp;
@@ -67,7 +67,7 @@ function spanRangesOf(cp) {
   const ranges = [];
   let first = 0;
   for (let i = 0; i < cp.length; i += 1) {
-    if (_chunkRRGKEG6Ecjs.isMarker.call(void 0, cp[i])) {
+    if (_chunkFFIR7BWQcjs.isMarker.call(void 0, cp[i])) {
       ranges.push({ first, last: i - 1 });
       first = i + 1;
     }
@@ -86,7 +86,7 @@ function filterBoundaryEdits(cp, edits, ranges) {
   for (const edit of edits) {
     let containsMarker = false;
     for (let i = edit.start; i < edit.end; i += 1) {
-      if (_chunkRRGKEG6Ecjs.isMarker.call(void 0, cp[i])) {
+      if (_chunkFFIR7BWQcjs.isMarker.call(void 0, cp[i])) {
         containsMarker = true;
         break;
       }
@@ -111,14 +111,14 @@ function filterBoundaryEdits(cp, edits, ranges) {
 function splitOnMarker(cp, expected) {
   const pieces = [[]];
   for (const value of cp) {
-    if (_chunkRRGKEG6Ecjs.isMarker.call(void 0, value)) {
+    if (_chunkFFIR7BWQcjs.isMarker.call(void 0, value)) {
       pieces.push([]);
       continue;
     }
     pieces[pieces.length - 1].push(value);
   }
   if (pieces.length !== expected) {
-    throw new (0, _chunkRRGKEG6Ecjs.PolytypoError)(
+    throw new (0, _chunkFFIR7BWQcjs.PolytypoError)(
       "POLYTYPO_RULE_CONTRACT",
       `boundary markers did not survive the pipeline: expected ${expected} spans, found ${pieces.length}`
     );
@@ -140,9 +140,9 @@ function originOfSpans(source, spans) {
   const origin = [];
   let previous;
   for (const span of spans) {
-    if (previous !== void 0) origin.push(_chunkRRGKEG6Ecjs.NO_ORIGIN);
+    if (previous !== void 0) origin.push(_chunkFFIR7BWQcjs.NO_ORIGIN);
     const base = codePointIndexOf[span.start];
-    const length = _chunkRRGKEG6Ecjs.toCodePoints.call(void 0, source.slice(span.start, span.end)).length;
+    const length = _chunkFFIR7BWQcjs.toCodePoints.call(void 0, source.slice(span.start, span.end)).length;
     for (let k = 0; k < length; k += 1) origin.push(base + k);
     previous = span;
   }
@@ -153,10 +153,10 @@ function originOfSpans(source, spans) {
 function runRulesOverSpans(cp, planned, locale, mode, narrowTarget) {
   let current = cp;
   for (const id of planned) {
-    const rule = _chunkRRGKEG6Ecjs.RULES[id];
+    const rule = _chunkFFIR7BWQcjs.RULES[id];
     if (rule === void 0) continue;
     const edits = rule.apply({ cp: current, locale, mode, narrowTarget });
-    current = _chunkRRGKEG6Ecjs.applyEdits.call(void 0, current, filterBoundaryEdits(current, edits, spanRangesOf(current)), id);
+    current = _chunkFFIR7BWQcjs.applyEdits.call(void 0, current, filterBoundaryEdits(current, edits, spanRangesOf(current)), id);
   }
   return current;
 }
@@ -171,7 +171,7 @@ function replacementsOfUnit(source, spans, planned, locale, mode, narrowTarget)
     narrowTarget
   );
   const pieces = splitOnMarker(transformed, normalized.length);
-  return normalized.map((span, i) => ({ span, text: _chunkRRGKEG6Ecjs.fromCodePoints.call(void 0, pieces[i]) }));
+  return normalized.map((span, i) => ({ span, text: _chunkFFIR7BWQcjs.fromCodePoints.call(void 0, pieces[i]) }));
 }
 function emit(source, replacements) {
   let out = "";
@@ -197,14 +197,14 @@ function analyzeOverUnits(source, units, planned, locale, mode, narrowTarget) {
 function analyzeOverSpans(source, spans, planned, locale, mode, narrowTarget) {
   const normalized = normalizeSpans(spans);
   if (normalized.length === 0) return [];
-  return _chunkRRGKEG6Ecjs.runRulesRecording.call(void 0, 
+  return _chunkFFIR7BWQcjs.runRulesRecording.call(void 0, 
     concatenateSpans(source, normalized),
     planned,
     locale,
     mode,
     narrowTarget,
     originOfSpans(source, normalized),
-    _chunkRRGKEG6Ecjs.toCodePoints.call(void 0, source).length,
+    _chunkFFIR7BWQcjs.toCodePoints.call(void 0, source).length,
     (current, edits) => filterBoundaryEdits(current, edits, spanRangesOf(current))
   );
 }
@@ -215,4 +215,4 @@ function analyzeOverSpans(source, spans, planned, locale, mode, narrowTarget) {
 
 
 exports.runOverSpans = runOverSpans; exports.runOverUnits = runOverUnits; exports.analyzeOverUnits = analyzeOverUnits; exports.analyzeOverSpans = analyzeOverSpans;
-//# sourceMappingURL=chunk-OR7GGYEA.cjs.map
+//# sourceMappingURL=chunk-QPIQMX2S.cjs.map

package/dist/{chunk-OR7GGYEA.cjs.map → chunk-QPIQMX2S.cjs.map}

@@ -1 +1 @@
-{"version":3,"sources":["/home/runner/work/polytypo-js/polytypo-js/dist/chunk-OR7GGYEA.cjs","../src/modes/spans.ts","../src/engine/span-runner.ts"],"names":[],"mappings":"AAAA;AACE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACF,wDAA6B;AAC7B;AACA;ACMA,IAAM,MAAA,EAAQ,EAAA;AAEd,IAAM,iBAAA,kBAAwC,IAAI,GAAA,CAAI;AAAA,EACpD,EAAA;AAAA,EAAM,EAAA;AAAA,EAAM,EAAA;AAAA,EAAM,EAAA;AAAA,EAAM,GAAA;AAAA,EAAM,IAAA;AAAA,EAAQ;AACxC,CAAC,CAAA;AAED,SAAS,iBAAA,CAAkB,MAAA,EAAgB,IAAA,EAAc,EAAA,EAAqB;AAC5E,EAAA,IAAA,CAAA,IAAS,EAAA,EAAI,IAAA,EAAM,EAAA,EAAI,EAAA,EAAI,EAAA,GAAK,CAAA,EAAG;AACjC,IAAA,GAAA,CAAI,gBAAA,CAAiB,GAAA,CAAI,MAAA,CAAO,UAAA,CAAW,CAAC,CAAC,CAAA,EAAG,OAAO,IAAA;AAAA,EACzD;AACA,EAAA,OAAO,KAAA;AACT;AAuBO,SAAS,cAAA,CAAe,KAAA,EAAgC;AAC7D,EAAA,MAAM,OAAA,EAAS,KAAA,CAAM,MAAA,CAAO,CAAC,CAAA,EAAA,GAAM,CAAA,CAAE,IAAA,EAAM,CAAA,CAAE,KAAK,CAAA,CAAE,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,EAAA,GAAM,CAAA,CAAE,MAAA,EAAQ,CAAA,CAAE,KAAK,CAAA;AACpF,EAAA,MAAM,IAAA,EAAc,CAAC,CAAA;AACrB,EAAA,IAAA,CAAA,MAAW,KAAA,GAAQ,MAAA,EAAQ;AACzB,IAAA,MAAM,KAAA,EAAO,GAAA,CAAI,GAAA,CAAI,OAAA,EAAS,CAAC,CAAA;AAC/B,IAAA,GAAA,CAAI,KAAA,IAAS,KAAA,CAAA,EAAW;AACtB,MAAA,GAAA,CAAI,IAAA,CAAK,IAAI,CAAA;AACb,MAAA,QAAA;AAAA,IACF;AACA,IAAA,GAAA,CAAI,IAAA,CAAK,MAAA,EAAQ,IAAA,CAAK,GAAA,EAAK;AACzB,MAAA,MAAM,IAAI,oCAAA;AAAA,QACR,wBAAA;AAAA,QACA,CAAA,2CAAA,EAA8C,IAAA,CAAK,KAAK,CAAA,EAAA,EAAK,IAAA,CAAK,GAAG,CAAA,OAAA,EAAU,IAAA,CAAK,KAAK,CAAA,EAAA,EAAK,IAAA,CAAK,GAAG,CAAA,CAAA;AAAA,MACxG,CAAA;AAAA,IACF;AACA,IAAA,GAAA,CAAI,IAAA,CAAK,MAAA,IAAU,IAAA,CAAK,GAAA,EAAK;AAC3B,MAAA,GAAA,CAAI,GAAA,CAAI,OAAA,EAAS,CAAC,EAAA,EAAI,EAAE,KAAA,EAAO,IAAA,CAAK,KAAA,EAAO,GAAA,EAAK,IAAA,CAAK,IAAI,CAAA;AACzD,MAAA,QAAA;AAAA,IACF;AACA,IAAA,GAAA,CAAI,IAAA,CAAK,IAAI,CAAA;AAAA,EACf;AACA,EAAA,OAAO,GAAA;AACT;AAGO,SAAS,gBAAA,CAAiB,MAAA,EAAgB,KAAA,EAAkC;AACjF,EAAA,MAAM,GAAA,EAAe,CAAC,CAAA;AACtB,EAAA,IAAI,QAAA;AACJ,EAAA,IAAA,CAAA,MAAW,KAAA,GAAQ,KAAA,EAAO;AACxB,IAAA,GAAA,CAAI,SAAA,IAAa,KAAA,CAAA,EAAW;AAC1B,MAAA,EAAA,CAAG,IAAA,CAAK,iBAAA,CAAkB,MAAA,EAAQ,QAAA,CAAS,GAAA,EAAK,IAAA,CAAK,KAAK,EAAA,EAAI,8BAAA,EAAc,wBAAM,CAAA;AAAA,IACpF;AACA,IAAA,IAAA,CAAA,MAAW,MAAA,GAAS,4CAAA,MAAa,CAAO,KAAA,CAAM,IAAA,CAAK,KAAA,EAAO,IAAA,CAAK,GAAG,CAAC,CAAA,EAAG,EAAA,CAAG,IAAA,CAAK,KAAK,CAAA;AACnF,IAAA,SAAA,EAAW,IAAA;AAAA,EACb;AACA,EAAA,OAAO,EAAA;AACT;AAOO,SAAS,YAAA,CAAa,EAAA,EAAoC;AAC/D,EAAA,MAAM,OAAA,EAAsB,CAAC,CAAA;AAC7B,EAAA,IAAI,MAAA,EAAQ,CAAA;AACZ,EAAA,IAAA,CAAA,IAAS,EAAA,EAAI,CAAA,EAAG,EAAA,EAAI,EAAA,CAAG,MAAA,EAAQ,EAAA,GAAK,CAAA,EAAG;AACrC,IAAA,GAAA,CAAI,wCAAA,EAAS,CAAG,CAAC,CAAW,CAAA,EAAG;AAC7B,MAAA,MAAA,CAAO,IAAA,CAAK,EAAE,KAAA,EAAO,IAAA,EAAM,EAAA,EAAI,EAAE,CAAC,CAAA;AAClC,MAAA,MAAA,EAAQ,EAAA,EAAI,CAAA;AAAA,IACd;AAAA,EACF;AACA,EAAA,MAAA,CAAO,IAAA,CAAK,EAAE,KAAA,EAAO,IAAA,EAAM,EAAA,CAAG,OAAA,EAAS,EAAE,CAAC,CAAA;AAC1C,EAAA,OAAO,MAAA;AACT;AAEA,SAAS,cAAA,CAAe,MAAA,EAA8B,CAAA,EAAkC;AACtF,EAAA,IAAA,CAAA,MAAW,MAAA,GAAS,MAAA,EAAQ;AAC1B,IAAA,GAAA,CAAI,EAAA,GAAK,KAAA,CAAM,MAAA,GAAS,EAAA,GAAK,KAAA,CAAM,KAAA,EAAO,CAAA,EAAG,OAAO,KAAA;AAAA,EACtD;AACA,EAAA,OAAO,KAAA,CAAA;AACT;AA4BO,SAAS,mBAAA,CACd,EAAA,EACA,KAAA,EACA,MAAA,EACQ;AACR,EAAA,MAAM,IAAA,EAAc,CAAC,CAAA;AACrB,EAAA,IAAA,CAAA,MAAW,KAAA,GAAQ,KAAA,EAAO;AACxB,IAAA,IAAI,eAAA,EAAiB,KAAA;AACrB,IAAA,IAAA,CAAA,IAAS,EAAA,EAAI,IAAA,CAAK,KAAA,EAAO,EAAA,EAAI,IAAA,CAAK,GAAA,EAAK,EAAA,GAAK,CAAA,EAAG;AAC7C,MAAA,GAAA,CAAI,wCAAA,EAAS,CAAG,CAAC,CAAW,CAAA,EAAG;AAC7B,QAAA,eAAA,EAAiB,IAAA;AACjB,QAAA,KAAA;AAAA,MACF;AAAA,IACF;AACA,IAAA,GAAA,CAAI,cAAA,EAAgB,QAAA;AAIpB,IAAA,MAAM,EAAA,EAAI,IAAA,CAAK,KAAA;AACf,IAAA,MAAM,EAAA,EAAI,IAAA,CAAK,IAAA,EAAM,CAAA;AACrB,IAAA,MAAM,EAAA,EAAI,IAAA,CAAK,IAAA,EAAM,IAAA,CAAK,KAAA;AAC1B,IAAA,MAAM,EAAA,EAAI,IAAA,CAAK,WAAA,CAAY,MAAA;AAC3B,IAAA,MAAM,KAAA,EAAO,cAAA,CAAe,MAAA,EAAQ,CAAC,CAAA;AACrC,IAAA,GAAA,CAAI,KAAA,IAAS,KAAA,EAAA,GAAA,CAAc,EAAA,IAAM,IAAA,CAAK,MAAA,GAAS,EAAA,IAAM,IAAA,CAAK,IAAA,CAAA,EAAO;AAC/D,MAAA,GAAA,CAAI,EAAA,EAAI,CAAA,EAAG,QAAA;AAMX,MAAA,MAAM,MAAA,EAAQ,IAAA,CAAK,WAAA,CAAY,CAAC,CAAA;AAChC,MAAA,MAAM,KAAA,EAAO,IAAA,CAAK,WAAA,CAAY,EAAA,EAAI,CAAC,CAAA;AACnC,MAAA,GAAA,CAAI,EAAA,EAAI,EAAA,GAAK,EAAA,IAAM,IAAA,CAAK,MAAA,GAAS,MAAA,IAAU,MAAA,GAAS,EAAA,CAAG,CAAC,EAAA,IAAM,KAAA,EAAO,QAAA;AACrE,MAAA,GAAA,CAAI,EAAA,EAAI,EAAA,GAAK,EAAA,IAAM,IAAA,CAAK,KAAA,GAAQ,KAAA,IAAS,MAAA,GAAS,EAAA,CAAG,CAAC,EAAA,IAAM,KAAA,EAAO,QAAA;AAAA,IACrE;AAEA,IAAA,GAAA,CAAI,IAAA,CAAK,IAAI,CAAA;AAAA,EACf;AACA,EAAA,OAAO,GAAA;AACT;AAGO,SAAS,aAAA,CAAc,EAAA,EAAuB,QAAA,EAA8B;AACjF,EAAA,MAAM,OAAA,EAAqB,CAAC,CAAC,CAAC,CAAA;AAC9B,EAAA,IAAA,CAAA,MAAW,MAAA,GAAS,EAAA,EAAI;AACtB,IAAA,GAAA,CAAI,wCAAA,KAAc,CAAA,EAAG;AACnB,MAAA,MAAA,CAAO,IAAA,CAAK,CAAC,CAAC,CAAA;AACd,MAAA,QAAA;AAAA,IACF;AACA,IAAC,MAAA,CAAO,MAAA,CAAO,OAAA,EAAS,CAAC,CAAA,CAAe,IAAA,CAAK,KAAK,CAAA;AAAA,EACpD;AACA,EAAA,GAAA,CAAI,MAAA,CAAO,OAAA,IAAW,QAAA,EAAU;AAC9B,IAAA,MAAM,IAAI,oCAAA;AAAA,MACR,wBAAA;AAAA,MACA,CAAA,wDAAA,EAA2D,QAAQ,CAAA,cAAA,EAAiB,MAAA,CAAO,MAAM,CAAA;AAAA,IAAA;AACnG,EAAA;AAEF,EAAA;AACF;AASO;AACL,EAAA;AACA,EAAA;AACA,EAAA;AACE,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AAAW,EAAA;AAEb,EAAA;AAEA,EAAA;AACA,EAAA;AACA,EAAA;AACE,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AAAW,EAAA;AAEb,EAAA;AACF;ADlFA;AACA;AEjIA;AAOE,EAAA;AACA,EAAA;AACE,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AAA4F,EAAA;AAE9F,EAAA;AACF;AAkBA;AAQE,EAAA;AACA,EAAA;AACA,EAAA;AAAoB,IAAA;AACiB,IAAA;AACnC,IAAA;AACA,IAAA;AACA,IAAA;AACA,EAAA;AAEF,EAAA;AACA,EAAA;AACF;AAGA;AACE,EAAA;AACA,EAAA;AACA,EAAA;AACE,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AAAc,EAAA;AAEhB,EAAA;AACF;AAEO;AAQL,EAAA;AACF;AAWO;AAQL,EAAA;AAGA,EAAA;AACF;AAQO;AAQL,EAAA;AAGF;AAEO;AAQL,EAAA;AACA,EAAA;AACA,EAAA;AAAO,IAAA;AAC8B,IAAA;AACnC,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACgC,IAAA;AACX,IAAA;AACwD,EAAA;AAEjF;AFgDA;AACA;AACA;AACA;AACA;AACA;AACA","file":"/home/runner/work/polytypo-js/polytypo-js/dist/chunk-OR7GGYEA.cjs","sourcesContent":[null,"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 */\ninterface Replacement {\n  readonly span: Span;\n  readonly text: string;\n}\n\n/** One text unit: the marker-separated concatenation, the pipeline, and the pieces it produced. */\nfunction replacementsOfUnit(\n  source: string,\n  spans: readonly Span[],\n  planned: readonly RuleId[],\n  locale: LocaleData,\n  mode: Mode,\n  narrowTarget: number,\n): Replacement[] {\n  const normalized = normalizeSpans(spans);\n  if (normalized.length === 0) return [];\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  return normalized.map((span, i) => ({ span, text: fromCodePoints(pieces[i] as number[]) }));\n}\n\n/** modes.md 4: the source with disjoint replacements applied at recorded offsets, nothing else. */\nfunction emit(source: string, replacements: readonly Replacement[]): string {\n  let out = \"\";\n  let cursor = 0;\n  for (const { span, text } of replacements) {\n    const original = source.slice(span.start, span.end);\n    out += source.slice(cursor, span.start);\n    out += text === original ? original : text;\n    cursor = span.end;\n  }\n  return out + source.slice(cursor);\n}\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  return emit(source, replacementsOfUnit(source, spans, planned, locale, mode, narrowTarget));\n}\n\n/**\n * modes.md 3.1 and 3.5 step 3 (spec 1.7.0). A document has one text unit, except in `markdown`\n * with `frontmatterKeys`, where the frontmatter block's spans form a unit of their own. The\n * pipeline runs once per unit, and the two edit sets are disjoint because no span of one unit lies\n * inside the other — which is exactly what `markdownSpans` skipping the block guarantees.\n *\n * Only step 5 is shared: the source is emitted once, with every unit's replacements in document\n * order.\n */\nexport function runOverUnits(\n  source: string,\n  units: readonly (readonly Span[])[],\n  planned: readonly RuleId[],\n  locale: LocaleData,\n  mode: Mode,\n  narrowTarget: number,\n): string {\n  const replacements = units\n    .flatMap((spans) => replacementsOfUnit(source, spans, planned, locale, mode, narrowTarget))\n    .sort((a, b) => a.span.start - b.span.start);\n  return emit(source, replacements);\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 */\n/** `analyzeOverSpans` per text unit (modes.md 3.1), reported in document order. */\nexport function analyzeOverUnits(\n  source: string,\n  units: readonly (readonly Span[])[],\n  planned: readonly RuleId[],\n  locale: LocaleData,\n  mode: Mode,\n  narrowTarget: number,\n): Change[] {\n  return units\n    .flatMap((spans) => analyzeOverSpans(source, spans, planned, locale, mode, narrowTarget))\n    .sort((a, b) => a.start - b.start);\n}\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"]}
+{"version":3,"sources":["/home/runner/work/polytypo-js/polytypo-js/dist/chunk-QPIQMX2S.cjs","../src/modes/spans.ts","../src/engine/span-runner.ts"],"names":[],"mappings":"AAAA;AACE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACF,wDAA6B;AAC7B;AACA;ACMA,IAAM,MAAA,EAAQ,EAAA;AAEd,IAAM,iBAAA,kBAAwC,IAAI,GAAA,CAAI;AAAA,EACpD,EAAA;AAAA,EAAM,EAAA;AAAA,EAAM,EAAA;AAAA,EAAM,EAAA;AAAA,EAAM,GAAA;AAAA,EAAM,IAAA;AAAA,EAAQ;AACxC,CAAC,CAAA;AAED,SAAS,iBAAA,CAAkB,MAAA,EAAgB,IAAA,EAAc,EAAA,EAAqB;AAC5E,EAAA,IAAA,CAAA,IAAS,EAAA,EAAI,IAAA,EAAM,EAAA,EAAI,EAAA,EAAI,EAAA,GAAK,CAAA,EAAG;AACjC,IAAA,GAAA,CAAI,gBAAA,CAAiB,GAAA,CAAI,MAAA,CAAO,UAAA,CAAW,CAAC,CAAC,CAAA,EAAG,OAAO,IAAA;AAAA,EACzD;AACA,EAAA,OAAO,KAAA;AACT;AAuBO,SAAS,cAAA,CAAe,KAAA,EAAgC;AAC7D,EAAA,MAAM,OAAA,EAAS,KAAA,CAAM,MAAA,CAAO,CAAC,CAAA,EAAA,GAAM,CAAA,CAAE,IAAA,EAAM,CAAA,CAAE,KAAK,CAAA,CAAE,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,EAAA,GAAM,CAAA,CAAE,MAAA,EAAQ,CAAA,CAAE,KAAK,CAAA;AACpF,EAAA,MAAM,IAAA,EAAc,CAAC,CAAA;AACrB,EAAA,IAAA,CAAA,MAAW,KAAA,GAAQ,MAAA,EAAQ;AACzB,IAAA,MAAM,KAAA,EAAO,GAAA,CAAI,GAAA,CAAI,OAAA,EAAS,CAAC,CAAA;AAC/B,IAAA,GAAA,CAAI,KAAA,IAAS,KAAA,CAAA,EAAW;AACtB,MAAA,GAAA,CAAI,IAAA,CAAK,IAAI,CAAA;AACb,MAAA,QAAA;AAAA,IACF;AACA,IAAA,GAAA,CAAI,IAAA,CAAK,MAAA,EAAQ,IAAA,CAAK,GAAA,EAAK;AACzB,MAAA,MAAM,IAAI,oCAAA;AAAA,QACR,wBAAA;AAAA,QACA,CAAA,2CAAA,EAA8C,IAAA,CAAK,KAAK,CAAA,EAAA,EAAK,IAAA,CAAK,GAAG,CAAA,OAAA,EAAU,IAAA,CAAK,KAAK,CAAA,EAAA,EAAK,IAAA,CAAK,GAAG,CAAA,CAAA;AAAA,MACxG,CAAA;AAAA,IACF;AACA,IAAA,GAAA,CAAI,IAAA,CAAK,MAAA,IAAU,IAAA,CAAK,GAAA,EAAK;AAC3B,MAAA,GAAA,CAAI,GAAA,CAAI,OAAA,EAAS,CAAC,EAAA,EAAI,EAAE,KAAA,EAAO,IAAA,CAAK,KAAA,EAAO,GAAA,EAAK,IAAA,CAAK,IAAI,CAAA;AACzD,MAAA,QAAA;AAAA,IACF;AACA,IAAA,GAAA,CAAI,IAAA,CAAK,IAAI,CAAA;AAAA,EACf;AACA,EAAA,OAAO,GAAA;AACT;AAGO,SAAS,gBAAA,CAAiB,MAAA,EAAgB,KAAA,EAAkC;AACjF,EAAA,MAAM,GAAA,EAAe,CAAC,CAAA;AACtB,EAAA,IAAI,QAAA;AACJ,EAAA,IAAA,CAAA,MAAW,KAAA,GAAQ,KAAA,EAAO;AACxB,IAAA,GAAA,CAAI,SAAA,IAAa,KAAA,CAAA,EAAW;AAC1B,MAAA,EAAA,CAAG,IAAA,CAAK,iBAAA,CAAkB,MAAA,EAAQ,QAAA,CAAS,GAAA,EAAK,IAAA,CAAK,KAAK,EAAA,EAAI,8BAAA,EAAc,wBAAM,CAAA;AAAA,IACpF;AACA,IAAA,IAAA,CAAA,MAAW,MAAA,GAAS,4CAAA,MAAa,CAAO,KAAA,CAAM,IAAA,CAAK,KAAA,EAAO,IAAA,CAAK,GAAG,CAAC,CAAA,EAAG,EAAA,CAAG,IAAA,CAAK,KAAK,CAAA;AACnF,IAAA,SAAA,EAAW,IAAA;AAAA,EACb;AACA,EAAA,OAAO,EAAA;AACT;AAOO,SAAS,YAAA,CAAa,EAAA,EAAoC;AAC/D,EAAA,MAAM,OAAA,EAAsB,CAAC,CAAA;AAC7B,EAAA,IAAI,MAAA,EAAQ,CAAA;AACZ,EAAA,IAAA,CAAA,IAAS,EAAA,EAAI,CAAA,EAAG,EAAA,EAAI,EAAA,CAAG,MAAA,EAAQ,EAAA,GAAK,CAAA,EAAG;AACrC,IAAA,GAAA,CAAI,wCAAA,EAAS,CAAG,CAAC,CAAW,CAAA,EAAG;AAC7B,MAAA,MAAA,CAAO,IAAA,CAAK,EAAE,KAAA,EAAO,IAAA,EAAM,EAAA,EAAI,EAAE,CAAC,CAAA;AAClC,MAAA,MAAA,EAAQ,EAAA,EAAI,CAAA;AAAA,IACd;AAAA,EACF;AACA,EAAA,MAAA,CAAO,IAAA,CAAK,EAAE,KAAA,EAAO,IAAA,EAAM,EAAA,CAAG,OAAA,EAAS,EAAE,CAAC,CAAA;AAC1C,EAAA,OAAO,MAAA;AACT;AAEA,SAAS,cAAA,CAAe,MAAA,EAA8B,CAAA,EAAkC;AACtF,EAAA,IAAA,CAAA,MAAW,MAAA,GAAS,MAAA,EAAQ;AAC1B,IAAA,GAAA,CAAI,EAAA,GAAK,KAAA,CAAM,MAAA,GAAS,EAAA,GAAK,KAAA,CAAM,KAAA,EAAO,CAAA,EAAG,OAAO,KAAA;AAAA,EACtD;AACA,EAAA,OAAO,KAAA,CAAA;AACT;AA4BO,SAAS,mBAAA,CACd,EAAA,EACA,KAAA,EACA,MAAA,EACQ;AACR,EAAA,MAAM,IAAA,EAAc,CAAC,CAAA;AACrB,EAAA,IAAA,CAAA,MAAW,KAAA,GAAQ,KAAA,EAAO;AACxB,IAAA,IAAI,eAAA,EAAiB,KAAA;AACrB,IAAA,IAAA,CAAA,IAAS,EAAA,EAAI,IAAA,CAAK,KAAA,EAAO,EAAA,EAAI,IAAA,CAAK,GAAA,EAAK,EAAA,GAAK,CAAA,EAAG;AAC7C,MAAA,GAAA,CAAI,wCAAA,EAAS,CAAG,CAAC,CAAW,CAAA,EAAG;AAC7B,QAAA,eAAA,EAAiB,IAAA;AACjB,QAAA,KAAA;AAAA,MACF;AAAA,IACF;AACA,IAAA,GAAA,CAAI,cAAA,EAAgB,QAAA;AAIpB,IAAA,MAAM,EAAA,EAAI,IAAA,CAAK,KAAA;AACf,IAAA,MAAM,EAAA,EAAI,IAAA,CAAK,IAAA,EAAM,CAAA;AACrB,IAAA,MAAM,EAAA,EAAI,IAAA,CAAK,IAAA,EAAM,IAAA,CAAK,KAAA;AAC1B,IAAA,MAAM,EAAA,EAAI,IAAA,CAAK,WAAA,CAAY,MAAA;AAC3B,IAAA,MAAM,KAAA,EAAO,cAAA,CAAe,MAAA,EAAQ,CAAC,CAAA;AACrC,IAAA,GAAA,CAAI,KAAA,IAAS,KAAA,EAAA,GAAA,CAAc,EAAA,IAAM,IAAA,CAAK,MAAA,GAAS,EAAA,IAAM,IAAA,CAAK,IAAA,CAAA,EAAO;AAC/D,MAAA,GAAA,CAAI,EAAA,EAAI,CAAA,EAAG,QAAA;AAMX,MAAA,MAAM,MAAA,EAAQ,IAAA,CAAK,WAAA,CAAY,CAAC,CAAA;AAChC,MAAA,MAAM,KAAA,EAAO,IAAA,CAAK,WAAA,CAAY,EAAA,EAAI,CAAC,CAAA;AACnC,MAAA,GAAA,CAAI,EAAA,EAAI,EAAA,GAAK,EAAA,IAAM,IAAA,CAAK,MAAA,GAAS,MAAA,IAAU,MAAA,GAAS,EAAA,CAAG,CAAC,EAAA,IAAM,KAAA,EAAO,QAAA;AACrE,MAAA,GAAA,CAAI,EAAA,EAAI,EAAA,GAAK,EAAA,IAAM,IAAA,CAAK,KAAA,GAAQ,KAAA,IAAS,MAAA,GAAS,EAAA,CAAG,CAAC,EAAA,IAAM,KAAA,EAAO,QAAA;AAAA,IACrE;AAEA,IAAA,GAAA,CAAI,IAAA,CAAK,IAAI,CAAA;AAAA,EACf;AACA,EAAA,OAAO,GAAA;AACT;AAGO,SAAS,aAAA,CAAc,EAAA,EAAuB,QAAA,EAA8B;AACjF,EAAA,MAAM,OAAA,EAAqB,CAAC,CAAC,CAAC,CAAA;AAC9B,EAAA,IAAA,CAAA,MAAW,MAAA,GAAS,EAAA,EAAI;AACtB,IAAA,GAAA,CAAI,wCAAA,KAAc,CAAA,EAAG;AACnB,MAAA,MAAA,CAAO,IAAA,CAAK,CAAC,CAAC,CAAA;AACd,MAAA,QAAA;AAAA,IACF;AACA,IAAC,MAAA,CAAO,MAAA,CAAO,OAAA,EAAS,CAAC,CAAA,CAAe,IAAA,CAAK,KAAK,CAAA;AAAA,EACpD;AACA,EAAA,GAAA,CAAI,MAAA,CAAO,OAAA,IAAW,QAAA,EAAU;AAC9B,IAAA,MAAM,IAAI,oCAAA;AAAA,MACR,wBAAA;AAAA,MACA,CAAA,wDAAA,EAA2D,QAAQ,CAAA,cAAA,EAAiB,MAAA,CAAO,MAAM,CAAA;AAAA,IAAA;AACnG,EAAA;AAEF,EAAA;AACF;AASO;AACL,EAAA;AACA,EAAA;AACA,EAAA;AACE,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AAAW,EAAA;AAEb,EAAA;AAEA,EAAA;AACA,EAAA;AACA,EAAA;AACE,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AAAW,EAAA;AAEb,EAAA;AACF;ADlFA;AACA;AEjIA;AAOE,EAAA;AACA,EAAA;AACE,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AAA4F,EAAA;AAE9F,EAAA;AACF;AAkBA;AAQE,EAAA;AACA,EAAA;AACA,EAAA;AAAoB,IAAA;AACiB,IAAA;AACnC,IAAA;AACA,IAAA;AACA,IAAA;AACA,EAAA;AAEF,EAAA;AACA,EAAA;AACF;AAGA;AACE,EAAA;AACA,EAAA;AACA,EAAA;AACE,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AAAc,EAAA;AAEhB,EAAA;AACF;AAEO;AAQL,EAAA;AACF;AAWO;AAQL,EAAA;AAGA,EAAA;AACF;AAQO;AAQL,EAAA;AAGF;AAEO;AAQL,EAAA;AACA,EAAA;AACA,EAAA;AAAO,IAAA;AAC8B,IAAA;AACnC,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACgC,IAAA;AACX,IAAA;AACwD,EAAA;AAEjF;AFgDA;AACA;AACA;AACA;AACA;AACA;AACA","file":"/home/runner/work/polytypo-js/polytypo-js/dist/chunk-QPIQMX2S.cjs","sourcesContent":[null,"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 */\ninterface Replacement {\n  readonly span: Span;\n  readonly text: string;\n}\n\n/** One text unit: the marker-separated concatenation, the pipeline, and the pieces it produced. */\nfunction replacementsOfUnit(\n  source: string,\n  spans: readonly Span[],\n  planned: readonly RuleId[],\n  locale: LocaleData,\n  mode: Mode,\n  narrowTarget: number,\n): Replacement[] {\n  const normalized = normalizeSpans(spans);\n  if (normalized.length === 0) return [];\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  return normalized.map((span, i) => ({ span, text: fromCodePoints(pieces[i] as number[]) }));\n}\n\n/** modes.md 4: the source with disjoint replacements applied at recorded offsets, nothing else. */\nfunction emit(source: string, replacements: readonly Replacement[]): string {\n  let out = \"\";\n  let cursor = 0;\n  for (const { span, text } of replacements) {\n    const original = source.slice(span.start, span.end);\n    out += source.slice(cursor, span.start);\n    out += text === original ? original : text;\n    cursor = span.end;\n  }\n  return out + source.slice(cursor);\n}\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  return emit(source, replacementsOfUnit(source, spans, planned, locale, mode, narrowTarget));\n}\n\n/**\n * modes.md 3.1 and 3.5 step 3 (spec 1.7.0). A document has one text unit, except in `markdown`\n * with `frontmatterKeys`, where the frontmatter block's spans form a unit of their own. The\n * pipeline runs once per unit, and the two edit sets are disjoint because no span of one unit lies\n * inside the other — which is exactly what `markdownSpans` skipping the block guarantees.\n *\n * Only step 5 is shared: the source is emitted once, with every unit's replacements in document\n * order.\n */\nexport function runOverUnits(\n  source: string,\n  units: readonly (readonly Span[])[],\n  planned: readonly RuleId[],\n  locale: LocaleData,\n  mode: Mode,\n  narrowTarget: number,\n): string {\n  const replacements = units\n    .flatMap((spans) => replacementsOfUnit(source, spans, planned, locale, mode, narrowTarget))\n    .sort((a, b) => a.span.start - b.span.start);\n  return emit(source, replacements);\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 */\n/** `analyzeOverSpans` per text unit (modes.md 3.1), reported in document order. */\nexport function analyzeOverUnits(\n  source: string,\n  units: readonly (readonly Span[])[],\n  planned: readonly RuleId[],\n  locale: LocaleData,\n  mode: Mode,\n  narrowTarget: number,\n): Change[] {\n  return units\n    .flatMap((spans) => analyzeOverSpans(source, spans, planned, locale, mode, narrowTarget))\n    .sort((a, b) => a.start - b.start);\n}\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"]}

package/dist/{chunk-P27DD76M.js → chunk-TRUHKCDB.js}

@@ -5837,4 +5837,4 @@ export {
   runRules,
   runRulesRecording
 };
-//# sourceMappingURL=chunk-P27DD76M.js.map
+//# sourceMappingURL=chunk-TRUHKCDB.js.map