polytypo 1.0.1 → 1.1.0

package/dist/{chunk-47XAYIKV.js → chunk-3XRMEZDM.js}

@@ -3835,131 +3835,8 @@ function isMarker(value) {
   return value === MARKER || value === LINE_MARKER;
 }
 
-// src/rules/quote-ambiguity.ts
-var SQ = 39;
-var MIN_ENCLOSED = 1;
-var MAX_ENCLOSED = 3;
-var NARROW = /* @__PURE__ */ new Set([
-  39,
-  8216,
-  8217,
-  8218,
-  8219,
-  8249,
-  8250
-]);
-var INLINE_SPACE = /* @__PURE__ */ new Set([
-  32,
-  9,
-  160,
-  8239,
-  8199,
-  8201,
-  8202
-]);
-function at(cp, i) {
-  const value = cp[i];
-  return value === void 0 ? NONE : value;
-}
-function asciiLower(cp) {
-  return cp >= 65 && cp <= 90 ? cp + 32 : cp;
-}
-function isAlnum(cp) {
-  const DIGIT_ZERO9 = 48;
-  const DIGIT_NINE8 = 57;
-  return cp >= DIGIT_ZERO9 && cp <= DIGIT_NINE8 || isLetter(cp);
-}
-function wordEndsAt(arr, end, word) {
-  const start = end - word.length;
-  if (start < 0) return false;
-  for (let k = 0; k < word.length; k += 1) {
-    const c = at(arr, start + k);
-    const matches = k === 0 ? asciiLower(c) === asciiLower(word[k]) : c === word[k];
-    if (!matches) return false;
-  }
-  const before = start > 0 ? at(arr, start - 1) : NONE;
-  return before === NONE || !isAlnum(before);
-}
-function wordStartsAt(arr, start, word) {
-  const n = arr.length;
-  for (let k = 0; k < word.length; k += 1) {
-    const c = at(arr, start + k);
-    const matches = k === 0 ? asciiLower(c) === asciiLower(word[k]) : c === word[k];
-    if (!matches) return false;
-  }
-  const after = start + word.length < n ? at(arr, start + word.length) : NONE;
-  return after === NONE || !isAlnum(after);
-}
-function computeIdiomMatchedIndices(arr, idioms) {
-  const vetoed = /* @__PURE__ */ new Set();
-  if (idioms.length === 0) return vetoed;
-  const n = arr.length;
-  const compiled = idioms.map((idiom) => ({
-    left: toCodePoints(idiom.left),
-    elided: toCodePoints(idiom.elided),
-    right: toCodePoints(idiom.right)
-  }));
-  for (let i = 0; i < n; i += 1) {
-    const g = at(arr, i);
-    if (!NARROW.has(g)) continue;
-    const lLit = i > 0 ? at(arr, i - 1) : NONE;
-    if (lLit === NONE || !INLINE_SPACE.has(lLit)) continue;
-    for (const idiom of compiled) {
-      const k = idiom.elided.length;
-      const j = i + 1 + k;
-      if (j >= n) continue;
-      let elidedMatches = true;
-      for (let w = 0; w < k; w += 1) {
-        if (at(arr, i + 1 + w) !== idiom.elided[w]) {
-          elidedMatches = false;
-          break;
-        }
-      }
-      if (!elidedMatches) continue;
-      if (!NARROW.has(at(arr, j))) continue;
-      const rLit = j + 1 < n ? at(arr, j + 1) : NONE;
-      if (rLit === NONE || !INLINE_SPACE.has(rLit)) continue;
-      if (!wordEndsAt(arr, i - 1, idiom.left)) continue;
-      if (!wordStartsAt(arr, j + 2, idiom.right)) continue;
-      vetoed.add(i);
-      vetoed.add(j);
-    }
-  }
-  return vetoed;
-}
-function computeAmbiguousShapeIndices(cp) {
-  const ambiguous = /* @__PURE__ */ new Set();
-  const n = cp.length;
-  for (let i = 0; i < n; i += 1) {
-    if (at(cp, i) !== SQ) continue;
-    const lLit = i > 0 ? at(cp, i - 1) : NONE;
-    if (lLit === NONE || !INLINE_SPACE.has(lLit)) continue;
-    let k = 0;
-    while (k < MAX_ENCLOSED && isLetter(at(cp, i + 1 + k))) k += 1;
-    if (k < MIN_ENCLOSED) continue;
-    const j = i + 1 + k;
-    if (at(cp, j) !== SQ) continue;
-    const rLit = j + 1 < n ? at(cp, j + 1) : NONE;
-    if (rLit === NONE || !INLINE_SPACE.has(rLit)) continue;
-    ambiguous.add(i);
-    ambiguous.add(j);
-  }
-  return ambiguous;
-}
-function computePreserveIndices(cp, idioms) {
-  const ambiguous = computeAmbiguousShapeIndices(cp);
-  if (ambiguous.size === 0) return ambiguous;
-  const idiomMatched = computeIdiomMatchedIndices(cp, idioms);
-  if (idiomMatched.size === 0) return ambiguous;
-  const preserve = /* @__PURE__ */ new Set();
-  for (const index of ambiguous) {
-    if (!idiomMatched.has(index)) preserve.add(index);
-  }
-  return preserve;
-}
-
 // src/rules/apostrophe.ts
-var SQ2 = 39;
+var SQ = 39;
 var RIGHT_SINGLE = 8217;
 var DIGIT_ZERO = 48;
 var DIGIT_NINE = 57;
@@ -4020,22 +3897,22 @@ var CLOSEISH = /* @__PURE__ */ new Set([
   8211,
   8212
 ]);
-function at2(cp, i) {
+function at(cp, i) {
   const value = cp[i];
   return value === void 0 ? NONE : value;
 }
 function isDigit(cp) {
   return cp >= DIGIT_ZERO && cp <= DIGIT_NINE;
 }
-function isAlnum2(cp) {
+function isAlnum(cp) {
   return isDigit(cp) || isLetter(cp);
 }
 function isApostrophe(left, right) {
   if (isDigit(left) && !isLetter(right)) return false;
-  if (isAlnum2(left) && isAlnum2(right)) return true;
+  if (isAlnum(left) && isAlnum(right)) return true;
   if (isLetter(left) && (right === NONE || SPACELIKE.has(right) || CLOSEISH.has(right)))
     return true;
-  if ((left === NONE || SPACELIKE.has(left) || OPENISH.has(left)) && isAlnum2(right)) return true;
+  if ((left === NONE || SPACELIKE.has(left) || OPENISH.has(left)) && isAlnum(right)) return true;
   return false;
 }
 var apostropheRule = {
@@ -4044,12 +3921,10 @@ var apostropheRule = {
     const cp = ctx.cp;
     const n = cp.length;
     const edits = [];
-    const preserve = computePreserveIndices(cp, ctx.locale.quotes.elisionIdioms);
     for (let i = 0; i < n; i += 1) {
-      if (at2(cp, i) !== SQ2) continue;
-      if (preserve.has(i)) continue;
-      const left = i > 0 ? at2(cp, i - 1) : NONE;
-      const right = i + 1 < n ? at2(cp, i + 1) : NONE;
+      if (at(cp, i) !== SQ) continue;
+      const left = i > 0 ? at(cp, i - 1) : NONE;
+      const right = i + 1 < n ? at(cp, i + 1) : NONE;
       if (isApostrophe(left, right)) {
         edits.push({ start: i, end: i + 1, replacement: [RIGHT_SINGLE], ruleId: "apostrophe" });
       }
@@ -4284,7 +4159,7 @@ var DOT = 46;
 var ELL = 8230;
 var EXCLAMATION = 33;
 var QUESTION = 63;
-function at3(cp, i) {
+function at2(cp, i) {
   const value = cp[i];
   return value === void 0 ? NONE : value;
 }
@@ -4297,7 +4172,7 @@ function isTerminal(cp) {
 function isSameRun(cp, s, e, target) {
   if (e - s !== target.length) return false;
   for (let j = 0; j < target.length; j += 1) {
-    if (at3(cp, s + j) !== target[j]) return false;
+    if (at2(cp, s + j) !== target[j]) return false;
   }
   return true;
 }
@@ -4310,19 +4185,19 @@ var ellipsisRule = {
     const edits = [];
     let i = 0;
     while (i < n) {
-      if (!isDotlike(at3(cp, i))) {
+      if (!isDotlike(at2(cp, i))) {
         i += 1;
         continue;
       }
       const s = i;
       let e = s;
       let q = 0;
-      while (e < n && isDotlike(at3(cp, e))) {
-        if (at3(cp, e) === ELL) q += 1;
+      while (e < n && isDotlike(at2(cp, e))) {
+        if (at2(cp, e) === ELL) q += 1;
         e += 1;
       }
       const k = e - s;
-      const left = at3(cp, s - 1);
+      const left = at2(cp, s - 1);
       const target = runTarget(k, q, left, abbreviated);
       if (target !== null && !isSameRun(cp, s, e, target)) {
         edits.push({ start: s, end: e, replacement: target, ruleId: "ellipsis" });
@@ -4348,7 +4223,7 @@ var HYPHEN_MINUS2 = 45;
 var NON_BREAKING_HYPHEN = 8209;
 var DIGIT_ZERO3 = 48;
 var DIGIT_NINE3 = 57;
-function at4(cp, i) {
+function at3(cp, i) {
   const value = cp[i];
   return value === void 0 ? NONE : value;
 }
@@ -4399,19 +4274,19 @@ function bind(index) {
   return { start: index, end: index + 1, replacement: [NON_BREAKING_HYPHEN], ruleId: "hyphen" };
 }
 function guardCompound(cp, a, k) {
-  const before = at4(cp, a - 1);
+  const before = at3(cp, a - 1);
   if (before !== NONE && isWordish(before)) return false;
-  const after = at4(cp, a + k);
+  const after = at3(cp, a + k);
   return after === NONE || !isWordish(after);
 }
 function guardPrefix(cp, a, k) {
-  const before = at4(cp, a - 1);
+  const before = at3(cp, a - 1);
   if (before !== NONE && isWordish(before)) return false;
-  return isLetter(at4(cp, a + k));
+  return isLetter(at3(cp, a + k));
 }
 function guardSuffix(cp, a, k) {
-  if (!isLetter(at4(cp, a - 1))) return false;
-  const after = at4(cp, a + k);
+  if (!isLetter(at3(cp, a - 1))) return false;
+  const after = at3(cp, a + k);
   return after === NONE || !isWordish(after);
 }
 function scan2(ctx) {
@@ -4489,14 +4364,14 @@ var BRACE_CLOSE = 125;
 var EN_DASH2 = 8211;
 var EM_DASH2 = 8212;
 var ELLIPSIS = 8230;
-function at5(cp, i) {
+function at4(cp, i) {
   const value = cp[i];
   return value === void 0 ? NONE : value;
 }
 function isDigit4(cp) {
   return cp >= DIGIT_ZERO4 && cp <= DIGIT_NINE4;
 }
-function isAlnum3(cp) {
+function isAlnum2(cp) {
   return isDigit4(cp) || isLetter(cp);
 }
 function isBreak2(cp) {
@@ -4646,14 +4521,14 @@ function punctuationSubRule(cp, prep, claims, marks, target, other) {
   if (marks.length === 0) return;
   for (let i = 0; i < cp.length; i += 1) {
     if (!contains(marks, cp[i])) continue;
-    const left = at5(cp, i - 1);
+    const left = at4(cp, i - 1);
     if (left !== NONE && isMark(prep, left)) continue;
-    const after = at5(cp, i + 1);
+    const after = at4(cp, i + 1);
     if (after !== NONE && !isSpaceLike(after) && !isCloseish(prep, after) && after !== ELLIPSIS && !isMark(prep, after)) {
       continue;
     }
     if (isOpenish(prep, left)) continue;
-    if (left !== NONE && isSpaceLike(left) && isOpenish(prep, at5(cp, i - 2))) continue;
+    if (left !== NONE && isSpaceLike(left) && isOpenish(prep, at4(cp, i - 2))) continue;
     if (left === target) continue;
     if (left === SPACE2 || left === other) {
       claimConversion(claims, i - 1, target);
@@ -4670,15 +4545,15 @@ function shortWordsSubRule(cp, prep, claims) {
     const w = longestMatch(prep.shortWords, cp, a, matchFirstCharLenient);
     if (w === void 0) continue;
     const k = w.length;
-    const before = at5(cp, a - 1);
+    const before = at4(cp, a - 1);
     if (!(before === NONE || isSpaceLike(before) || isOpenish(prep, before) || isSentenceDash(before))) {
       continue;
     }
-    const separator = at5(cp, a + k);
+    const separator = at4(cp, a + k);
     if (separator === NBSP) continue;
     if (separator !== SPACE2) continue;
-    const next = at5(cp, a + k + 1);
-    if (!isAlnum3(next) && !isOpenish(prep, next)) continue;
+    const next = at4(cp, a + k + 1);
+    if (!isAlnum2(next) && !isOpenish(prep, next)) continue;
     claimConversion(claims, a + k, NBSP);
   }
 }
@@ -4688,8 +4563,8 @@ function abbreviationsSubRule(cp, prep, claims) {
     const w = longestMatch(prep.abbreviations, cp, a, matchSpaceLenient);
     if (w === void 0) continue;
     const k = w.length;
-    if (isAlnum3(at5(cp, a - 1))) continue;
-    if (isAlnum3(at5(cp, a + k))) continue;
+    if (isAlnum2(at4(cp, a - 1))) continue;
+    if (isAlnum2(at4(cp, a + k))) continue;
     for (let j = 0; j < k; j += 1) {
       if (w[j] !== SPACE2) continue;
       if (cp[a + j] === NBSP) continue;
@@ -4703,14 +4578,14 @@ function unitsSubRule(cp, prep, claims) {
     const w = longestMatch(prep.units, cp, a, matchExact);
     if (w === void 0) continue;
     const k = w.length;
-    if (isAlnum3(at5(cp, a + k))) continue;
-    const left = at5(cp, a - 1);
+    if (isAlnum2(at4(cp, a + k))) continue;
+    const left = at4(cp, a - 1);
     if (left === NBSP) continue;
     if (left !== SPACE2) continue;
-    if (!isDigit4(at5(cp, a - 2))) continue;
+    if (!isDigit4(at4(cp, a - 2))) continue;
     let b = a - 2;
     while (b - 1 >= 0 && isDigit4(cp[b - 1])) b -= 1;
-    if (isLetter(at5(cp, b - 1))) continue;
+    if (isLetter(at4(cp, b - 1))) continue;
     claimConversion(claims, a - 1, NBSP);
   }
 }
@@ -4720,31 +4595,31 @@ function symbolsSubRule(cp, prep, claims) {
     const w = longestMatch(prep.symbols, cp, a, matchExact);
     if (w === void 0) continue;
     const k = w.length;
-    if (isAlnum3(at5(cp, a - 1))) continue;
-    const separator = at5(cp, a + k);
+    if (isAlnum2(at4(cp, a - 1))) continue;
+    const separator = at4(cp, a + k);
     if (separator === NBSP) continue;
     if (separator !== SPACE2) continue;
-    if (!isDigit4(at5(cp, a + k + 1))) continue;
+    if (!isDigit4(at4(cp, a + k + 1))) continue;
     claimConversion(claims, a + k, NBSP);
   }
 }
 function isInitialAt(cp, prep, p) {
   if (p < 0) return false;
-  if (!isUpper(at5(cp, p))) return false;
-  if (at5(cp, p + 1) !== FULL_STOP2) return false;
-  const before = at5(cp, p - 1);
+  if (!isUpper(at4(cp, p))) return false;
+  if (at4(cp, p + 1) !== FULL_STOP2) return false;
+  const before = at4(cp, p - 1);
   return before === NONE || isSpaceLike(before) || isOpenish(prep, before);
 }
 function isAbbreviationTail(cp, p) {
-  if (!isSpaceLike(at5(cp, p - 1))) return false;
-  if (at5(cp, p - 2) !== FULL_STOP2) return false;
-  const head = at5(cp, p - 3);
+  if (!isSpaceLike(at4(cp, p - 1))) return false;
+  if (at4(cp, p - 2) !== FULL_STOP2) return false;
+  const head = at4(cp, p - 3);
   return isLetter(head) && !isUpper(head);
 }
 function hasPrecedingInitial(cp, prep, p) {
-  const gap = at5(cp, p - 1);
+  const gap = at4(cp, p - 1);
   if (gap !== SPACE2 && gap !== NBSP) return false;
-  if (at5(cp, p - 2) !== FULL_STOP2) return false;
+  if (at4(cp, p - 2) !== FULL_STOP2) return false;
   return isInitialAt(cp, prep, p - 3);
 }
 function initialsSubRule(cp, prep, claims) {
@@ -4754,10 +4629,10 @@ function initialsSubRule(cp, prep, claims) {
     const here = cp[q];
     if (here !== SPACE2 && here !== NBSP) continue;
     const leftInitialP = q - 2;
-    const c1Shape = at5(cp, q - 1) === FULL_STOP2 && isInitialAt(cp, prep, leftInitialP) && isUpper(at5(cp, q + 1)) && !isAbbreviationTail(cp, leftInitialP);
+    const c1Shape = at4(cp, q - 1) === FULL_STOP2 && isInitialAt(cp, prep, leftInitialP) && isUpper(at4(cp, q + 1)) && !isAbbreviationTail(cp, leftInitialP);
     const c1 = c1Shape && (mode === "single" || isInitialAt(cp, prep, q + 1) || hasPrecedingInitial(cp, prep, leftInitialP));
-    const rightSpace = at5(cp, q + 3);
-    const c2 = isLetter(at5(cp, q - 1)) && isInitialAt(cp, prep, q + 1) && (rightSpace === SPACE2 || rightSpace === NBSP) && isInitialAt(cp, prep, q + 4);
+    const rightSpace = at4(cp, q + 3);
+    const c2 = isLetter(at4(cp, q - 1)) && isInitialAt(cp, prep, q + 1) && (rightSpace === SPACE2 || rightSpace === NBSP) && isInitialAt(cp, prep, q + 4);
     if (!c1 && !c2) continue;
     if (here === NBSP) continue;
     claimConversion(claims, q, NBSP);
@@ -4768,7 +4643,7 @@ function quotesSubRule(cp, prep, claims) {
     for (let i = 0; i < cp.length; i += 1) {
       const here = cp[i];
       if (here === pair.open) {
-        const right = at5(cp, i + 1);
+        const right = at4(cp, i + 1);
         if (right === pair.target) continue;
         if (right === SPACE2 || isNoBreak(right)) {
           claimConversion(claims, i + 1, pair.target);
@@ -4779,7 +4654,7 @@ function quotesSubRule(cp, prep, claims) {
         continue;
       }
       if (here !== pair.close) continue;
-      const left = at5(cp, i - 1);
+      const left = at4(cp, i - 1);
       if (left === pair.target) continue;
       if (left === SPACE2 || isNoBreak(left)) {
         claimConversion(claims, i - 1, pair.target);
@@ -4799,14 +4674,14 @@ function forwardBindingSubRule(cp, prep, claims, patterns, wantsDigit) {
     if (!wantsDigit && prep.initialBinding !== "none" && k === 2 && isUpper(w[0]) && w[1] === FULL_STOP2) {
       continue;
     }
-    const before = at5(cp, a - 1);
+    const before = at4(cp, a - 1);
     if (!(before === NONE || isSpaceLike(before) || isOpenish(prep, before) || isSentenceDash(before))) {
       continue;
     }
-    const separator = at5(cp, a + k);
+    const separator = at4(cp, a + k);
     if (separator === NBSP) continue;
     if (separator !== SPACE2) continue;
-    const next = at5(cp, a + k + 1);
+    const next = at4(cp, a + k + 1);
     if (isSpaceLike(next)) continue;
     if (wantsDigit ? !isDigit4(next) : !isLetter(next)) continue;
     claimConversion(claims, a + k, NBSP);
@@ -4838,13 +4713,123 @@ var nbspRule = {
   apply: scan3
 };
 
+// src/rules/quote-ambiguity.ts
+var LOWER_N = 110;
+var UPPER_N = 78;
+var NARROW = /* @__PURE__ */ new Set([
+  39,
+  8216,
+  8217,
+  8218,
+  8219,
+  8249,
+  8250
+]);
+var INLINE_SPACE = /* @__PURE__ */ new Set([
+  32,
+  9,
+  160,
+  8239,
+  8199,
+  8201,
+  8202
+]);
+function at5(cp, i) {
+  const value = cp[i];
+  return value === void 0 ? NONE : value;
+}
+function asciiLower(cp) {
+  return cp >= 65 && cp <= 90 ? cp + 32 : cp;
+}
+function isAlnum3(cp) {
+  const DIGIT_ZERO9 = 48;
+  const DIGIT_NINE8 = 57;
+  return cp >= DIGIT_ZERO9 && cp <= DIGIT_NINE8 || isLetter(cp);
+}
+function wordEndsAt(arr, end, word) {
+  const start = end - word.length;
+  if (start < 0) return false;
+  for (let k = 0; k < word.length; k += 1) {
+    const c = at5(arr, start + k);
+    const matches = k === 0 ? asciiLower(c) === asciiLower(word[k]) : c === word[k];
+    if (!matches) return false;
+  }
+  const before = start > 0 ? at5(arr, start - 1) : NONE;
+  return before === NONE || !isAlnum3(before);
+}
+function wordStartsAt(arr, start, word) {
+  const n = arr.length;
+  for (let k = 0; k < word.length; k += 1) {
+    const c = at5(arr, start + k);
+    const matches = k === 0 ? asciiLower(c) === asciiLower(word[k]) : c === word[k];
+    if (!matches) return false;
+  }
+  const after = start + word.length < n ? at5(arr, start + word.length) : NONE;
+  return after === NONE || !isAlnum3(after);
+}
+function computeIdiomMatchedIndices(arr, idioms) {
+  const vetoed = /* @__PURE__ */ new Set();
+  if (idioms.length === 0) return vetoed;
+  const n = arr.length;
+  const compiled = idioms.map((idiom) => ({
+    left: toCodePoints(idiom.left),
+    elided: toCodePoints(idiom.elided),
+    right: toCodePoints(idiom.right)
+  }));
+  for (let i = 0; i < n; i += 1) {
+    const g = at5(arr, i);
+    if (!NARROW.has(g)) continue;
+    const lLit = i > 0 ? at5(arr, i - 1) : NONE;
+    if (lLit === NONE || !INLINE_SPACE.has(lLit)) continue;
+    for (const idiom of compiled) {
+      const k = idiom.elided.length;
+      const j = i + 1 + k;
+      if (j >= n) continue;
+      let elidedMatches = true;
+      for (let w = 0; w < k; w += 1) {
+        if (at5(arr, i + 1 + w) !== idiom.elided[w]) {
+          elidedMatches = false;
+          break;
+        }
+      }
+      if (!elidedMatches) continue;
+      if (!NARROW.has(at5(arr, j))) continue;
+      const rLit = j + 1 < n ? at5(arr, j + 1) : NONE;
+      if (rLit === NONE || !INLINE_SPACE.has(rLit)) continue;
+      if (!wordEndsAt(arr, i - 1, idiom.left)) continue;
+      if (!wordStartsAt(arr, j + 2, idiom.right)) continue;
+      vetoed.add(i);
+      vetoed.add(j);
+    }
+  }
+  return vetoed;
+}
+function computeAmbiguousShapeIndices(cp) {
+  const ambiguous = /* @__PURE__ */ new Set();
+  const n = cp.length;
+  for (let i = 0; i < n; i += 1) {
+    if (!NARROW.has(at5(cp, i))) continue;
+    const lLit = i > 0 ? at5(cp, i - 1) : NONE;
+    if (lLit === NONE || !INLINE_SPACE.has(lLit)) continue;
+    const enclosed = at5(cp, i + 1);
+    if (enclosed !== LOWER_N && enclosed !== UPPER_N) continue;
+    const j = i + 2;
+    if (!NARROW.has(at5(cp, j))) continue;
+    const rLit = j + 1 < n ? at5(cp, j + 1) : NONE;
+    if (rLit === NONE || !INLINE_SPACE.has(rLit)) continue;
+    ambiguous.add(i);
+    ambiguous.add(j);
+  }
+  return ambiguous;
+}
+
 // src/rules/quotes.ts
 var DIGIT_ZERO5 = 48;
 var DIGIT_NINE5 = 57;
-var SQ3 = 39;
+var SQ2 = 39;
 var RIGHT_SINGLE_QUOTE = 8217;
 function v1Identity(cp) {
-  return cp === SQ3 ? RIGHT_SINGLE_QUOTE : cp;
+  return cp === SQ2 ? RIGHT_SINGLE_QUOTE : cp;
 }
 var WIDE = /* @__PURE__ */ new Set([
   34,
@@ -5632,4 +5617,4 @@ export {
   planRules,
   runRules
 };
-//# sourceMappingURL=chunk-47XAYIKV.js.map
+//# sourceMappingURL=chunk-3XRMEZDM.js.map