@intlayer/engine 9.1.3 → 9.3.0

package/dist/cjs/docReview/alignBlocks.cjs

@@ -2,12 +2,54 @@ Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });
 const require_docReview_computeSimilarity = require('./computeSimilarity.cjs');
 
 //#region src/docReview/alignBlocks.ts
+/** Cost of leaving a block unaligned (an insertion or a deletion). */
+const GAP_PENALTY = -2;
+/**
+* Score of a pair that structural evidence rules out.
+*
+* Strictly below the cost of two gaps (`2 * GAP_PENALTY`) so the aligner always
+* prefers reporting an insertion plus a deletion over such a pair. Every other
+* score is positive, which means that without an explicit veto the aligner would
+* rather pair two unrelated blocks than leave them unaligned — and a bogus pair
+* is planned as `reuse`, which keeps the stale translation verbatim *and*
+* inserts the freshly translated base block next to it, producing the duplicated
+* headings this penalty exists to prevent.
+*/
+const STRUCTURAL_MISMATCH_PENALTY = GAP_PENALTY * 2 - 1;
+/** Reward for two blocks opened by a heading of the very same depth. */
+const HEADING_DEPTH_MATCH_BONUS = 3;
+/** Minimum length ratio for the (small) "comparable size" reward. */
+const COMPARABLE_LENGTH_RATIO = .75;
+/**
+* Body length from which a section is considered to carry content of its own.
+*
+* Kept above a single sentence so a translator's short lead-in paragraph is not
+* mistaken for a whole section body.
+*/
+const SUBSTANTIAL_BODY_LENGTH = 80;
+/**
+* Length of the body a block carries below its opening heading.
+*
+* A section that only holds its heading (because subsections carry all of its
+* content) is structurally different from one that holds a full body, and that
+* difference survives translation.
+*
+* @param block - The block to measure.
+* @returns The trimmed length of everything below the opening heading line.
+*/
+const measureBodyLength = (block) => {
+	if (block.headingDepth === null) return block.content.trim().length;
+	const [, ...bodyLines] = block.content.split("\n");
+	return bodyLines.join("\n").trim().length;
+};
 /**
 * Align the blocks of a base document with the blocks of its translation using a
-* Needleman–Wunsch global alignment over anchor similarity and block type.
+* Needleman–Wunsch global alignment over heading depth, anchor similarity and
+* block type.
 *
 * Because prose differs across languages, the score is weighted toward the
-* structural anchor (digits and symbols) rather than the words themselves.
+* structural signals — heading depth first, then the anchor (digits and symbols)
+* — rather than the words themselves.
 *
 * @param baseBlocks - Blocks of the base (source) document.
 * @param targetBlocks - Blocks of the target (translated) document.
@@ -18,26 +60,33 @@ const alignBaseAndTargetBlocks = (baseBlocks, targetBlocks) => {
 	const targetLength = targetBlocks.length;
 	const scoreMatrix = Array.from({ length: baseLength + 1 }, () => Array.from({ length: targetLength + 1 }, () => 0));
 	const traceMatrix = Array.from({ length: baseLength + 1 }, () => Array.from({ length: targetLength + 1 }, () => "diagonal"));
-	const gapPenalty = -2;
 	const computeMatchScore = (baseIndex, targetIndex) => {
 		const baseBlock = baseBlocks[baseIndex];
 		const targetBlock = targetBlocks[targetIndex];
+		const hasComparableHeadingDepths = baseBlock.headingDepth !== null && targetBlock.headingDepth !== null;
+		if (hasComparableHeadingDepths && baseBlock.headingDepth !== targetBlock.headingDepth) return STRUCTURAL_MISMATCH_PENALTY;
+		const baseBodyLength = measureBodyLength(baseBlock);
+		const targetBodyLength = measureBodyLength(targetBlock);
+		if (baseBodyLength === 0 && targetBodyLength >= SUBSTANTIAL_BODY_LENGTH || targetBodyLength === 0 && baseBodyLength >= SUBSTANTIAL_BODY_LENGTH) return STRUCTURAL_MISMATCH_PENALTY;
+		const lengthRatio = Math.min(baseBlock.content.length, targetBlock.content.length) / Math.max(baseBlock.content.length, targetBlock.content.length);
+		const headingDepthBonus = hasComparableHeadingDepths ? HEADING_DEPTH_MATCH_BONUS : 0;
 		const typeBonus = baseBlock.type === targetBlock.type ? 2 : 0;
 		const anchorSimilarity = require_docReview_computeSimilarity.computeJaccardSimilarity(baseBlock.anchorText, targetBlock.anchorText, 3);
-		return typeBonus + (Math.min(baseBlock.content.length, targetBlock.content.length) / Math.max(baseBlock.content.length, targetBlock.content.length) > .75 ? 1 : 0) + anchorSimilarity * 8;
+		const lengthBonus = lengthRatio > COMPARABLE_LENGTH_RATIO ? 1 : 0;
+		return headingDepthBonus + typeBonus + lengthBonus + anchorSimilarity * 8;
 	};
 	for (let i = 1; i <= baseLength; i += 1) {
-		scoreMatrix[i][0] = scoreMatrix[i - 1][0] + gapPenalty;
+		scoreMatrix[i][0] = scoreMatrix[i - 1][0] + GAP_PENALTY;
 		traceMatrix[i][0] = "up";
 	}
 	for (let j = 1; j <= targetLength; j += 1) {
-		scoreMatrix[0][j] = scoreMatrix[0][j - 1] + gapPenalty;
+		scoreMatrix[0][j] = scoreMatrix[0][j - 1] + GAP_PENALTY;
 		traceMatrix[0][j] = "left";
 	}
 	for (let i = 1; i <= baseLength; i += 1) for (let j = 1; j <= targetLength; j += 1) {
 		const match = scoreMatrix[i - 1][j - 1] + computeMatchScore(i - 1, j - 1);
-		const deleteGap = scoreMatrix[i - 1][j] + gapPenalty;
-		const insertGap = scoreMatrix[i][j - 1] + gapPenalty;
+		const deleteGap = scoreMatrix[i - 1][j] + GAP_PENALTY;
+		const insertGap = scoreMatrix[i][j - 1] + GAP_PENALTY;
 		const best = Math.max(match, deleteGap, insertGap);
 		scoreMatrix[i][j] = best;
 		traceMatrix[i][j] = best === match ? "diagonal" : best === deleteGap ? "up" : "left";

package/dist/cjs/docReview/alignBlocks.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"alignBlocks.cjs","names":["computeJaccardSimilarity"],"sources":["../../../src/docReview/alignBlocks.ts"],"sourcesContent":["import { computeJaccardSimilarity } from './computeSimilarity';\nimport type { AlignmentPair, FingerprintedBlock } from './types';\n\n/**\n * Align the blocks of a base document with the blocks of its translation using a\n * Needleman–Wunsch global alignment over anchor similarity and block type.\n *\n * Because prose differs across languages, the score is weighted toward the\n * structural anchor (digits and symbols) rather than the words themselves.\n *\n * @param baseBlocks - Blocks of the base (source) document.\n * @param targetBlocks - Blocks of the target (translated) document.\n * @returns The ordered list of alignment pairs, including insertions and deletions.\n */\nexport const alignBaseAndTargetBlocks = (\n  baseBlocks: FingerprintedBlock[],\n  targetBlocks: FingerprintedBlock[]\n): AlignmentPair[] => {\n  const baseLength = baseBlocks.length;\n  const targetLength = targetBlocks.length;\n\n  const scoreMatrix: number[][] = Array.from({ length: baseLength + 1 }, () =>\n    Array.from({ length: targetLength + 1 }, () => 0)\n  );\n  const traceMatrix: ('diagonal' | 'up' | 'left')[][] = Array.from(\n    { length: baseLength + 1 },\n    () => Array.from({ length: targetLength + 1 }, () => 'diagonal')\n  );\n\n  const gapPenalty = -2;\n\n  const computeMatchScore = (\n    baseIndex: number,\n    targetIndex: number\n  ): number => {\n    const baseBlock = baseBlocks[baseIndex];\n    const targetBlock = targetBlocks[targetIndex];\n    const typeBonus = baseBlock.type === targetBlock.type ? 2 : 0;\n    const anchorSimilarity = computeJaccardSimilarity(\n      baseBlock.anchorText,\n      targetBlock.anchorText,\n      3\n    );\n    const lengthRatio =\n      Math.min(baseBlock.content.length, targetBlock.content.length) /\n      Math.max(baseBlock.content.length, targetBlock.content.length);\n    const lengthBonus = lengthRatio > 0.75 ? 1 : 0;\n    return typeBonus + lengthBonus + anchorSimilarity * 8; // weighted toward anchor similarity\n  };\n\n  // initialize first row and column\n  for (let i = 1; i <= baseLength; i += 1) {\n    scoreMatrix[i][0] = scoreMatrix[i - 1][0] + gapPenalty;\n    traceMatrix[i][0] = 'up';\n  }\n  for (let j = 1; j <= targetLength; j += 1) {\n    scoreMatrix[0][j] = scoreMatrix[0][j - 1] + gapPenalty;\n    traceMatrix[0][j] = 'left';\n  }\n\n  // fill\n  for (let i = 1; i <= baseLength; i += 1) {\n    for (let j = 1; j <= targetLength; j += 1) {\n      const match = scoreMatrix[i - 1][j - 1] + computeMatchScore(i - 1, j - 1);\n      const deleteGap = scoreMatrix[i - 1][j] + gapPenalty;\n      const insertGap = scoreMatrix[i][j - 1] + gapPenalty;\n\n      const best = Math.max(match, deleteGap, insertGap);\n      scoreMatrix[i][j] = best;\n      traceMatrix[i][j] =\n        best === match ? 'diagonal' : best === deleteGap ? 'up' : 'left';\n    }\n  }\n\n  // traceback\n  const result: AlignmentPair[] = [];\n  let i = baseLength;\n  let j = targetLength;\n  while (i > 0 || j > 0) {\n    if (i > 0 && j > 0 && traceMatrix[i][j] === 'diagonal') {\n      const baseIndex = i - 1;\n      const targetIndex = j - 1;\n      const similarityScore = computeJaccardSimilarity(\n        baseBlocks[baseIndex].anchorText,\n        targetBlocks[targetIndex].anchorText,\n        3\n      );\n      result.unshift({ baseIndex, targetIndex, similarityScore });\n      i -= 1;\n      j -= 1;\n    } else if (i > 0 && (j === 0 || traceMatrix[i][j] === 'up')) {\n      result.unshift({\n        baseIndex: i - 1,\n        targetIndex: null,\n        similarityScore: 0,\n      });\n      i -= 1;\n    } else if (j > 0 && (i === 0 || traceMatrix[i][j] === 'left')) {\n      // target block has no corresponding base block (deleted)\n      result.unshift({\n        baseIndex: -1,\n        targetIndex: j - 1,\n        similarityScore: 0,\n      });\n      j -= 1;\n    }\n  }\n  return result;\n};\n"],"mappings":";;;;;;;;;;;;;;;AAcA,MAAa,4BACX,YACA,iBACoB;CACpB,MAAM,aAAa,WAAW;CAC9B,MAAM,eAAe,aAAa;CAElC,MAAM,cAA0B,MAAM,KAAK,EAAE,QAAQ,aAAa,EAAE,SAClE,MAAM,KAAK,EAAE,QAAQ,eAAe,EAAE,SAAS,CAAC,CAClD;CACA,MAAM,cAAgD,MAAM,KAC1D,EAAE,QAAQ,aAAa,EAAE,SACnB,MAAM,KAAK,EAAE,QAAQ,eAAe,EAAE,SAAS,UAAU,CACjE;CAEA,MAAM,aAAa;CAEnB,MAAM,qBACJ,WACA,gBACW;EACX,MAAM,YAAY,WAAW;EAC7B,MAAM,cAAc,aAAa;EACjC,MAAM,YAAY,UAAU,SAAS,YAAY,OAAO,IAAI;EAC5D,MAAM,mBAAmBA,6DACvB,UAAU,YACV,YAAY,YACZ,CACF;EAKA,OAAO,aAHL,KAAK,IAAI,UAAU,QAAQ,QAAQ,YAAY,QAAQ,MAAM,IAC7D,KAAK,IAAI,UAAU,QAAQ,QAAQ,YAAY,QAAQ,MAAM,IAC7B,MAAO,IAAI,KACZ,mBAAmB;CACtD;CAGA,KAAK,IAAI,IAAI,GAAG,KAAK,YAAY,KAAK,GAAG;EACvC,YAAY,EAAE,CAAC,KAAK,YAAY,IAAI,EAAE,CAAC,KAAK;EAC5C,YAAY,EAAE,CAAC,KAAK;CACtB;CACA,KAAK,IAAI,IAAI,GAAG,KAAK,cAAc,KAAK,GAAG;EACzC,YAAY,EAAE,CAAC,KAAK,YAAY,EAAE,CAAC,IAAI,KAAK;EAC5C,YAAY,EAAE,CAAC,KAAK;CACtB;CAGA,KAAK,IAAI,IAAI,GAAG,KAAK,YAAY,KAAK,GACpC,KAAK,IAAI,IAAI,GAAG,KAAK,cAAc,KAAK,GAAG;EACzC,MAAM,QAAQ,YAAY,IAAI,EAAE,CAAC,IAAI,KAAK,kBAAkB,IAAI,GAAG,IAAI,CAAC;EACxE,MAAM,YAAY,YAAY,IAAI,EAAE,CAAC,KAAK;EAC1C,MAAM,YAAY,YAAY,EAAE,CAAC,IAAI,KAAK;EAE1C,MAAM,OAAO,KAAK,IAAI,OAAO,WAAW,SAAS;EACjD,YAAY,EAAE,CAAC,KAAK;EACpB,YAAY,EAAE,CAAC,KACb,SAAS,QAAQ,aAAa,SAAS,YAAY,OAAO;CAC9D;CAIF,MAAM,SAA0B,CAAC;CACjC,IAAI,IAAI;CACR,IAAI,IAAI;CACR,OAAO,IAAI,KAAK,IAAI,GAClB,IAAI,IAAI,KAAK,IAAI,KAAK,YAAY,EAAE,CAAC,OAAO,YAAY;EACtD,MAAM,YAAY,IAAI;EACtB,MAAM,cAAc,IAAI;EACxB,MAAM,kBAAkBA,6DACtB,WAAW,UAAU,CAAC,YACtB,aAAa,YAAY,CAAC,YAC1B,CACF;EACA,OAAO,QAAQ;GAAE;GAAW;GAAa;EAAgB,CAAC;EAC1D,KAAK;EACL,KAAK;CACP,OAAO,IAAI,IAAI,MAAM,MAAM,KAAK,YAAY,EAAE,CAAC,OAAO,OAAO;EAC3D,OAAO,QAAQ;GACb,WAAW,IAAI;GACf,aAAa;GACb,iBAAiB;EACnB,CAAC;EACD,KAAK;CACP,OAAO,IAAI,IAAI,MAAM,MAAM,KAAK,YAAY,EAAE,CAAC,OAAO,SAAS;EAE7D,OAAO,QAAQ;GACb,WAAW;GACX,aAAa,IAAI;GACjB,iBAAiB;EACnB,CAAC;EACD,KAAK;CACP;CAEF,OAAO;AACT"}
+{"version":3,"file":"alignBlocks.cjs","names":["computeJaccardSimilarity"],"sources":["../../../src/docReview/alignBlocks.ts"],"sourcesContent":["import { computeJaccardSimilarity } from './computeSimilarity';\nimport type { AlignmentPair, FingerprintedBlock } from './types';\n\n/** Cost of leaving a block unaligned (an insertion or a deletion). */\nconst GAP_PENALTY = -2;\n\n/**\n * Score of a pair that structural evidence rules out.\n *\n * Strictly below the cost of two gaps (`2 * GAP_PENALTY`) so the aligner always\n * prefers reporting an insertion plus a deletion over such a pair. Every other\n * score is positive, which means that without an explicit veto the aligner would\n * rather pair two unrelated blocks than leave them unaligned — and a bogus pair\n * is planned as `reuse`, which keeps the stale translation verbatim *and*\n * inserts the freshly translated base block next to it, producing the duplicated\n * headings this penalty exists to prevent.\n */\nconst STRUCTURAL_MISMATCH_PENALTY = GAP_PENALTY * 2 - 1;\n\n/** Reward for two blocks opened by a heading of the very same depth. */\nconst HEADING_DEPTH_MATCH_BONUS = 3;\n\n/** Minimum length ratio for the (small) \"comparable size\" reward. */\nconst COMPARABLE_LENGTH_RATIO = 0.75;\n\n/**\n * Body length from which a section is considered to carry content of its own.\n *\n * Kept above a single sentence so a translator's short lead-in paragraph is not\n * mistaken for a whole section body.\n */\nconst SUBSTANTIAL_BODY_LENGTH = 80;\n\n/**\n * Length of the body a block carries below its opening heading.\n *\n * A section that only holds its heading (because subsections carry all of its\n * content) is structurally different from one that holds a full body, and that\n * difference survives translation.\n *\n * @param block - The block to measure.\n * @returns The trimmed length of everything below the opening heading line.\n */\nconst measureBodyLength = (block: FingerprintedBlock): number => {\n  if (block.headingDepth === null) return block.content.trim().length;\n\n  const [, ...bodyLines] = block.content.split('\\n');\n\n  return bodyLines.join('\\n').trim().length;\n};\n\n/**\n * Align the blocks of a base document with the blocks of its translation using a\n * Needleman–Wunsch global alignment over heading depth, anchor similarity and\n * block type.\n *\n * Because prose differs across languages, the score is weighted toward the\n * structural signals — heading depth first, then the anchor (digits and symbols)\n * — rather than the words themselves.\n *\n * @param baseBlocks - Blocks of the base (source) document.\n * @param targetBlocks - Blocks of the target (translated) document.\n * @returns The ordered list of alignment pairs, including insertions and deletions.\n */\nexport const alignBaseAndTargetBlocks = (\n  baseBlocks: FingerprintedBlock[],\n  targetBlocks: FingerprintedBlock[]\n): AlignmentPair[] => {\n  const baseLength = baseBlocks.length;\n  const targetLength = targetBlocks.length;\n\n  const scoreMatrix: number[][] = Array.from({ length: baseLength + 1 }, () =>\n    Array.from({ length: targetLength + 1 }, () => 0)\n  );\n  const traceMatrix: ('diagonal' | 'up' | 'left')[][] = Array.from(\n    { length: baseLength + 1 },\n    () => Array.from({ length: targetLength + 1 }, () => 'diagonal')\n  );\n\n  const computeMatchScore = (\n    baseIndex: number,\n    targetIndex: number\n  ): number => {\n    const baseBlock = baseBlocks[baseIndex]!;\n    const targetBlock = targetBlocks[targetIndex]!;\n\n    // Translating a document never changes its heading depths, so two headings\n    // of different depths cannot be counterparts, however similar their content.\n    const hasComparableHeadingDepths =\n      baseBlock.headingDepth !== null && targetBlock.headingDepth !== null;\n\n    if (\n      hasComparableHeadingDepths &&\n      baseBlock.headingDepth !== targetBlock.headingDepth\n    ) {\n      return STRUCTURAL_MISMATCH_PENALTY;\n    }\n\n    // A section reduced to its bare heading (its content living in subsections)\n    // is not the translation of a section holding a full body. Pairing them\n    // reuses that whole body while the base heading is translated again right\n    // next to it — which is exactly how a duplicated heading appears.\n    const baseBodyLength = measureBodyLength(baseBlock);\n    const targetBodyLength = measureBodyLength(targetBlock);\n    const isBodyPresenceMismatched =\n      (baseBodyLength === 0 && targetBodyLength >= SUBSTANTIAL_BODY_LENGTH) ||\n      (targetBodyLength === 0 && baseBodyLength >= SUBSTANTIAL_BODY_LENGTH);\n\n    if (isBodyPresenceMismatched) return STRUCTURAL_MISMATCH_PENALTY;\n\n    const lengthRatio =\n      Math.min(baseBlock.content.length, targetBlock.content.length) /\n      Math.max(baseBlock.content.length, targetBlock.content.length);\n\n    const headingDepthBonus = hasComparableHeadingDepths\n      ? HEADING_DEPTH_MATCH_BONUS\n      : 0;\n    const typeBonus = baseBlock.type === targetBlock.type ? 2 : 0;\n    const anchorSimilarity = computeJaccardSimilarity(\n      baseBlock.anchorText,\n      targetBlock.anchorText,\n      3\n    );\n    const lengthBonus = lengthRatio > COMPARABLE_LENGTH_RATIO ? 1 : 0;\n\n    // weighted toward the structural signals (heading depth, then anchor)\n    return headingDepthBonus + typeBonus + lengthBonus + anchorSimilarity * 8;\n  };\n\n  // initialize first row and column\n  for (let i = 1; i <= baseLength; i += 1) {\n    scoreMatrix[i][0] = scoreMatrix[i - 1][0] + GAP_PENALTY;\n    traceMatrix[i][0] = 'up';\n  }\n  for (let j = 1; j <= targetLength; j += 1) {\n    scoreMatrix[0][j] = scoreMatrix[0][j - 1] + GAP_PENALTY;\n    traceMatrix[0][j] = 'left';\n  }\n\n  // fill\n  for (let i = 1; i <= baseLength; i += 1) {\n    for (let j = 1; j <= targetLength; j += 1) {\n      const match = scoreMatrix[i - 1][j - 1] + computeMatchScore(i - 1, j - 1);\n      const deleteGap = scoreMatrix[i - 1][j] + GAP_PENALTY;\n      const insertGap = scoreMatrix[i][j - 1] + GAP_PENALTY;\n\n      const best = Math.max(match, deleteGap, insertGap);\n      scoreMatrix[i][j] = best;\n      traceMatrix[i][j] =\n        best === match ? 'diagonal' : best === deleteGap ? 'up' : 'left';\n    }\n  }\n\n  // traceback\n  const result: AlignmentPair[] = [];\n  let i = baseLength;\n  let j = targetLength;\n  while (i > 0 || j > 0) {\n    if (i > 0 && j > 0 && traceMatrix[i][j] === 'diagonal') {\n      const baseIndex = i - 1;\n      const targetIndex = j - 1;\n      const similarityScore = computeJaccardSimilarity(\n        baseBlocks[baseIndex].anchorText,\n        targetBlocks[targetIndex].anchorText,\n        3\n      );\n      result.unshift({ baseIndex, targetIndex, similarityScore });\n      i -= 1;\n      j -= 1;\n    } else if (i > 0 && (j === 0 || traceMatrix[i][j] === 'up')) {\n      result.unshift({\n        baseIndex: i - 1,\n        targetIndex: null,\n        similarityScore: 0,\n      });\n      i -= 1;\n    } else if (j > 0 && (i === 0 || traceMatrix[i][j] === 'left')) {\n      // target block has no corresponding base block (deleted)\n      result.unshift({\n        baseIndex: -1,\n        targetIndex: j - 1,\n        similarityScore: 0,\n      });\n      j -= 1;\n    }\n  }\n  return result;\n};\n"],"mappings":";;;;;AAIA,MAAM,cAAc;;;;;;;;;;;;AAapB,MAAM,8BAA8B,cAAc,IAAI;;AAGtD,MAAM,4BAA4B;;AAGlC,MAAM,0BAA0B;;;;;;;AAQhC,MAAM,0BAA0B;;;;;;;;;;;AAYhC,MAAM,qBAAqB,UAAsC;CAC/D,IAAI,MAAM,iBAAiB,MAAM,OAAO,MAAM,QAAQ,KAAK,CAAC,CAAC;CAE7D,MAAM,GAAG,GAAG,aAAa,MAAM,QAAQ,MAAM,IAAI;CAEjD,OAAO,UAAU,KAAK,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC;AACrC;;;;;;;;;;;;;;AAeA,MAAa,4BACX,YACA,iBACoB;CACpB,MAAM,aAAa,WAAW;CAC9B,MAAM,eAAe,aAAa;CAElC,MAAM,cAA0B,MAAM,KAAK,EAAE,QAAQ,aAAa,EAAE,SAClE,MAAM,KAAK,EAAE,QAAQ,eAAe,EAAE,SAAS,CAAC,CAClD;CACA,MAAM,cAAgD,MAAM,KAC1D,EAAE,QAAQ,aAAa,EAAE,SACnB,MAAM,KAAK,EAAE,QAAQ,eAAe,EAAE,SAAS,UAAU,CACjE;CAEA,MAAM,qBACJ,WACA,gBACW;EACX,MAAM,YAAY,WAAW;EAC7B,MAAM,cAAc,aAAa;EAIjC,MAAM,6BACJ,UAAU,iBAAiB,QAAQ,YAAY,iBAAiB;EAElE,IACE,8BACA,UAAU,iBAAiB,YAAY,cAEvC,OAAO;EAOT,MAAM,iBAAiB,kBAAkB,SAAS;EAClD,MAAM,mBAAmB,kBAAkB,WAAW;EAKtD,IAHG,mBAAmB,KAAK,oBAAoB,2BAC5C,qBAAqB,KAAK,kBAAkB,yBAEjB,OAAO;EAErC,MAAM,cACJ,KAAK,IAAI,UAAU,QAAQ,QAAQ,YAAY,QAAQ,MAAM,IAC7D,KAAK,IAAI,UAAU,QAAQ,QAAQ,YAAY,QAAQ,MAAM;EAE/D,MAAM,oBAAoB,6BACtB,4BACA;EACJ,MAAM,YAAY,UAAU,SAAS,YAAY,OAAO,IAAI;EAC5D,MAAM,mBAAmBA,6DACvB,UAAU,YACV,YAAY,YACZ,CACF;EACA,MAAM,cAAc,cAAc,0BAA0B,IAAI;EAGhE,OAAO,oBAAoB,YAAY,cAAc,mBAAmB;CAC1E;CAGA,KAAK,IAAI,IAAI,GAAG,KAAK,YAAY,KAAK,GAAG;EACvC,YAAY,EAAE,CAAC,KAAK,YAAY,IAAI,EAAE,CAAC,KAAK;EAC5C,YAAY,EAAE,CAAC,KAAK;CACtB;CACA,KAAK,IAAI,IAAI,GAAG,KAAK,cAAc,KAAK,GAAG;EACzC,YAAY,EAAE,CAAC,KAAK,YAAY,EAAE,CAAC,IAAI,KAAK;EAC5C,YAAY,EAAE,CAAC,KAAK;CACtB;CAGA,KAAK,IAAI,IAAI,GAAG,KAAK,YAAY,KAAK,GACpC,KAAK,IAAI,IAAI,GAAG,KAAK,cAAc,KAAK,GAAG;EACzC,MAAM,QAAQ,YAAY,IAAI,EAAE,CAAC,IAAI,KAAK,kBAAkB,IAAI,GAAG,IAAI,CAAC;EACxE,MAAM,YAAY,YAAY,IAAI,EAAE,CAAC,KAAK;EAC1C,MAAM,YAAY,YAAY,EAAE,CAAC,IAAI,KAAK;EAE1C,MAAM,OAAO,KAAK,IAAI,OAAO,WAAW,SAAS;EACjD,YAAY,EAAE,CAAC,KAAK;EACpB,YAAY,EAAE,CAAC,KACb,SAAS,QAAQ,aAAa,SAAS,YAAY,OAAO;CAC9D;CAIF,MAAM,SAA0B,CAAC;CACjC,IAAI,IAAI;CACR,IAAI,IAAI;CACR,OAAO,IAAI,KAAK,IAAI,GAClB,IAAI,IAAI,KAAK,IAAI,KAAK,YAAY,EAAE,CAAC,OAAO,YAAY;EACtD,MAAM,YAAY,IAAI;EACtB,MAAM,cAAc,IAAI;EACxB,MAAM,kBAAkBA,6DACtB,WAAW,UAAU,CAAC,YACtB,aAAa,YAAY,CAAC,YAC1B,CACF;EACA,OAAO,QAAQ;GAAE;GAAW;GAAa;EAAgB,CAAC;EAC1D,KAAK;EACL,KAAK;CACP,OAAO,IAAI,IAAI,MAAM,MAAM,KAAK,YAAY,EAAE,CAAC,OAAO,OAAO;EAC3D,OAAO,QAAQ;GACb,WAAW,IAAI;GACf,aAAa;GACb,iBAAiB;EACnB,CAAC;EACD,KAAK;CACP,OAAO,IAAI,IAAI,MAAM,MAAM,KAAK,YAAY,EAAE,CAAC,OAAO,SAAS;EAE7D,OAAO,QAAQ;GACb,WAAW;GACX,aAAa,IAAI;GACjB,iBAAiB;EACnB,CAAC;EACD,KAAK;CACP;CAEF,OAAO;AACT"}

package/dist/cjs/docReview/rebuildDocument.cjs

@@ -31,6 +31,18 @@ const identifySegmentsToReview = ({ baseBlocks, targetBlocks, plan }) => {
 	});
 	return { segmentsToReview };
 };
+/** Markdown separates two blocks with a blank line. */
+const endsWithBlockBoundary = (text) => /\n[ \t]*\n$/.test(text);
+/**
+* The newlines missing at the end of `text` for it to close a markdown block.
+*
+* @param text - The document built so far.
+* @returns `''`, `'\n'` or `'\n\n'` depending on how the text already ends.
+*/
+const buildBlockSeparator = (text) => {
+	if (text.length === 0 || endsWithBlockBoundary(text)) return "";
+	return text.endsWith("\n") ? "\n" : "\n\n";
+};
 /**
 * Merge reviewed translations back into the final document following the
 * alignment plan, reusing untouched target blocks as-is.
@@ -41,22 +53,38 @@ const identifySegmentsToReview = ({ baseBlocks, targetBlocks, plan }) => {
 * @returns The rebuilt target document.
 */
 const mergeReviewedSegments = (plan, targetBlocks, reviewedSegments) => {
-	const outputParts = [];
+	let mergedText = "";
+	let previousPartWasGenerated = false;
+	/**
+	* Append one part, keeping a blank line around the content this run produced.
+	*
+	* Blocks own the blank lines that trail them, so two verbatim blocks already
+	* separate themselves and are appended untouched — a document with nothing to
+	* change merges back byte for byte. Generated content is the exception: the
+	* block it lands after may be the one that used to end the document, which
+	* carries no trailing blank line, and the two would be glued into a single
+	* markdown block (a heading swallowed by the paragraph above it).
+	*/
+	const appendPart = (content, isGenerated) => {
+		if (content.length === 0) return;
+		if (isGenerated || previousPartWasGenerated) mergedText += buildBlockSeparator(mergedText);
+		mergedText += content;
+		previousPartWasGenerated = isGenerated;
+	};
 	plan.actions.forEach((action, actionIndex) => {
-		if (action.kind === "reuse") outputParts.push(targetBlocks[action.targetIndex].content);
+		if (action.kind === "reuse") appendPart(targetBlocks[action.targetIndex].content, false);
 		else if (action.kind === "review" || action.kind === "insert_new") {
 			const reviewedContent = reviewedSegments.get(actionIndex);
-			if (reviewedContent !== void 0) outputParts.push(reviewedContent);
-			else if (action.kind === "review" && action.targetIndex !== null) outputParts.push(targetBlocks[action.targetIndex].content);
-			else outputParts.push("\n");
+			if (reviewedContent !== void 0) appendPart(reviewedContent, true);
+			else if (action.kind === "review" && action.targetIndex !== null) appendPart(targetBlocks[action.targetIndex].content, false);
+			else appendPart("\n", false);
 		} else if (action.kind === "delete") {
 			const reviewedContent = reviewedSegments.get(actionIndex);
-			if (reviewedContent !== void 0) {
-				if (reviewedContent) outputParts.push(reviewedContent);
-			} else outputParts.push(targetBlocks[action.targetIndex].content);
+			if (reviewedContent !== void 0) appendPart(reviewedContent, true);
+			else appendPart(targetBlocks[action.targetIndex].content, false);
 		}
 	});
-	return outputParts.join("");
+	return mergedText;
 };
 
 //#endregion

package/dist/cjs/docReview/rebuildDocument.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"rebuildDocument.cjs","names":[],"sources":["../../../src/docReview/rebuildDocument.ts"],"sourcesContent":["import type { AlignmentPlan, FingerprintedBlock } from './types';\n\n/**\n * A block that needs to be translated or re-translated by an external consumer\n * (an AI client, a human, or an agent).\n */\nexport type SegmentToReview = {\n  /** The base block to translate. */\n  baseBlock: FingerprintedBlock;\n  /** Existing target translation, or `null` when the block is new. */\n  targetBlockText: string | null;\n  /** Index of the originating action within {@link AlignmentPlan.actions}. */\n  actionIndex: number;\n};\n\nexport type RebuildInput = {\n  baseBlocks: FingerprintedBlock[];\n  targetBlocks: FingerprintedBlock[];\n  plan: AlignmentPlan;\n};\n\nexport type RebuildResult = {\n  segmentsToReview: SegmentToReview[];\n};\n\n/**\n * Analyze the alignment plan and return only the segments that need\n * review/translation. Does not generate output text - that is done by\n * {@link mergeReviewedSegments} once the translations are available.\n *\n * @param input - The base/target blocks and the alignment plan.\n * @returns The list of segments that require translation.\n */\nexport const identifySegmentsToReview = ({\n  baseBlocks,\n  targetBlocks,\n  plan,\n}: RebuildInput): RebuildResult => {\n  const segmentsToReview: SegmentToReview[] = [];\n\n  plan.actions.forEach((action, actionIndex) => {\n    if (action.kind === 'review') {\n      const baseBlock = baseBlocks[action.baseIndex];\n      const targetBlockText =\n        action.targetIndex !== null\n          ? targetBlocks[action.targetIndex].content\n          : null;\n\n      segmentsToReview.push({ baseBlock, targetBlockText, actionIndex });\n    } else if (action.kind === 'insert_new') {\n      const baseBlock = baseBlocks[action.baseIndex];\n\n      segmentsToReview.push({\n        baseBlock,\n        targetBlockText: null,\n        actionIndex,\n      });\n    }\n  });\n\n  return { segmentsToReview };\n};\n\n/**\n * Merge reviewed translations back into the final document following the\n * alignment plan, reusing untouched target blocks as-is.\n *\n * @param plan - The alignment plan.\n * @param targetBlocks - Blocks of the existing target document.\n * @param reviewedSegments - Map of action index to its reviewed translation.\n * @returns The rebuilt target document.\n */\nexport const mergeReviewedSegments = (\n  plan: AlignmentPlan,\n  targetBlocks: FingerprintedBlock[],\n  reviewedSegments: Map<number, string>\n): string => {\n  const outputParts: string[] = [];\n\n  plan.actions.forEach((action, actionIndex) => {\n    if (action.kind === 'reuse') {\n      outputParts.push(targetBlocks[action.targetIndex].content);\n    } else if (action.kind === 'review' || action.kind === 'insert_new') {\n      const reviewedContent = reviewedSegments.get(actionIndex);\n\n      if (reviewedContent !== undefined) {\n        outputParts.push(reviewedContent);\n      } else {\n        // Fallback: if review failed, use existing or blank\n        if (action.kind === 'review' && action.targetIndex !== null) {\n          outputParts.push(targetBlocks[action.targetIndex].content);\n        } else {\n          outputParts.push('\\n');\n        }\n      }\n    } else if (action.kind === 'delete') {\n      const reviewedContent = reviewedSegments.get(actionIndex);\n      if (reviewedContent !== undefined) {\n        // Caller explicitly resolved this block: empty string = actually delete,\n        // non-empty string = replacement content.\n        if (reviewedContent) outputParts.push(reviewedContent);\n      } else {\n        // Default: keep verbatim. A target block with no base counterpart may\n        // just be a section the aligner could not follow (reordering, split\n        // prose) — keeping it prevents accidental data loss in log/read-only mode.\n        outputParts.push(targetBlocks[action.targetIndex].content);\n      }\n    }\n  });\n\n  return outputParts.join('');\n};\n"],"mappings":";;;;;;;;;;;AAiCA,MAAa,4BAA4B,EACvC,YACA,cACA,WACiC;CACjC,MAAM,mBAAsC,CAAC;CAE7C,KAAK,QAAQ,SAAS,QAAQ,gBAAgB;EAC5C,IAAI,OAAO,SAAS,UAAU;GAC5B,MAAM,YAAY,WAAW,OAAO;GACpC,MAAM,kBACJ,OAAO,gBAAgB,OACnB,aAAa,OAAO,YAAY,CAAC,UACjC;GAEN,iBAAiB,KAAK;IAAE;IAAW;IAAiB;GAAY,CAAC;EACnE,OAAO,IAAI,OAAO,SAAS,cAAc;GACvC,MAAM,YAAY,WAAW,OAAO;GAEpC,iBAAiB,KAAK;IACpB;IACA,iBAAiB;IACjB;GACF,CAAC;EACH;CACF,CAAC;CAED,OAAO,EAAE,iBAAiB;AAC5B;;;;;;;;;;AAWA,MAAa,yBACX,MACA,cACA,qBACW;CACX,MAAM,cAAwB,CAAC;CAE/B,KAAK,QAAQ,SAAS,QAAQ,gBAAgB;EAC5C,IAAI,OAAO,SAAS,SAClB,YAAY,KAAK,aAAa,OAAO,YAAY,CAAC,OAAO;OACpD,IAAI,OAAO,SAAS,YAAY,OAAO,SAAS,cAAc;GACnE,MAAM,kBAAkB,iBAAiB,IAAI,WAAW;GAExD,IAAI,oBAAoB,QACtB,YAAY,KAAK,eAAe;QAGhC,IAAI,OAAO,SAAS,YAAY,OAAO,gBAAgB,MACrD,YAAY,KAAK,aAAa,OAAO,YAAY,CAAC,OAAO;QAEzD,YAAY,KAAK,IAAI;EAG3B,OAAO,IAAI,OAAO,SAAS,UAAU;GACnC,MAAM,kBAAkB,iBAAiB,IAAI,WAAW;GACxD,IAAI,oBAAoB,QAGtB;QAAI,iBAAiB,YAAY,KAAK,eAAe;GAAC,OAKtD,YAAY,KAAK,aAAa,OAAO,YAAY,CAAC,OAAO;EAE7D;CACF,CAAC;CAED,OAAO,YAAY,KAAK,EAAE;AAC5B"}
+{"version":3,"file":"rebuildDocument.cjs","names":[],"sources":["../../../src/docReview/rebuildDocument.ts"],"sourcesContent":["import type { AlignmentPlan, FingerprintedBlock } from './types';\n\n/**\n * A block that needs to be translated or re-translated by an external consumer\n * (an AI client, a human, or an agent).\n */\nexport type SegmentToReview = {\n  /** The base block to translate. */\n  baseBlock: FingerprintedBlock;\n  /** Existing target translation, or `null` when the block is new. */\n  targetBlockText: string | null;\n  /** Index of the originating action within {@link AlignmentPlan.actions}. */\n  actionIndex: number;\n};\n\nexport type RebuildInput = {\n  baseBlocks: FingerprintedBlock[];\n  targetBlocks: FingerprintedBlock[];\n  plan: AlignmentPlan;\n};\n\nexport type RebuildResult = {\n  segmentsToReview: SegmentToReview[];\n};\n\n/**\n * Analyze the alignment plan and return only the segments that need\n * review/translation. Does not generate output text - that is done by\n * {@link mergeReviewedSegments} once the translations are available.\n *\n * @param input - The base/target blocks and the alignment plan.\n * @returns The list of segments that require translation.\n */\nexport const identifySegmentsToReview = ({\n  baseBlocks,\n  targetBlocks,\n  plan,\n}: RebuildInput): RebuildResult => {\n  const segmentsToReview: SegmentToReview[] = [];\n\n  plan.actions.forEach((action, actionIndex) => {\n    if (action.kind === 'review') {\n      const baseBlock = baseBlocks[action.baseIndex];\n      const targetBlockText =\n        action.targetIndex !== null\n          ? targetBlocks[action.targetIndex].content\n          : null;\n\n      segmentsToReview.push({ baseBlock, targetBlockText, actionIndex });\n    } else if (action.kind === 'insert_new') {\n      const baseBlock = baseBlocks[action.baseIndex];\n\n      segmentsToReview.push({\n        baseBlock,\n        targetBlockText: null,\n        actionIndex,\n      });\n    }\n  });\n\n  return { segmentsToReview };\n};\n\n/** Markdown separates two blocks with a blank line. */\nconst endsWithBlockBoundary = (text: string): boolean =>\n  /\\n[ \\t]*\\n$/.test(text);\n\n/**\n * The newlines missing at the end of `text` for it to close a markdown block.\n *\n * @param text - The document built so far.\n * @returns `''`, `'\\n'` or `'\\n\\n'` depending on how the text already ends.\n */\nconst buildBlockSeparator = (text: string): string => {\n  if (text.length === 0 || endsWithBlockBoundary(text)) return '';\n\n  return text.endsWith('\\n') ? '\\n' : '\\n\\n';\n};\n\n/**\n * Merge reviewed translations back into the final document following the\n * alignment plan, reusing untouched target blocks as-is.\n *\n * @param plan - The alignment plan.\n * @param targetBlocks - Blocks of the existing target document.\n * @param reviewedSegments - Map of action index to its reviewed translation.\n * @returns The rebuilt target document.\n */\nexport const mergeReviewedSegments = (\n  plan: AlignmentPlan,\n  targetBlocks: FingerprintedBlock[],\n  reviewedSegments: Map<number, string>\n): string => {\n  let mergedText = '';\n  let previousPartWasGenerated = false;\n\n  /**\n   * Append one part, keeping a blank line around the content this run produced.\n   *\n   * Blocks own the blank lines that trail them, so two verbatim blocks already\n   * separate themselves and are appended untouched — a document with nothing to\n   * change merges back byte for byte. Generated content is the exception: the\n   * block it lands after may be the one that used to end the document, which\n   * carries no trailing blank line, and the two would be glued into a single\n   * markdown block (a heading swallowed by the paragraph above it).\n   */\n  const appendPart = (content: string, isGenerated: boolean): void => {\n    if (content.length === 0) return;\n\n    if (isGenerated || previousPartWasGenerated) {\n      mergedText += buildBlockSeparator(mergedText);\n    }\n\n    mergedText += content;\n    previousPartWasGenerated = isGenerated;\n  };\n\n  plan.actions.forEach((action, actionIndex) => {\n    if (action.kind === 'reuse') {\n      appendPart(targetBlocks[action.targetIndex]!.content, false);\n    } else if (action.kind === 'review' || action.kind === 'insert_new') {\n      const reviewedContent = reviewedSegments.get(actionIndex);\n\n      if (reviewedContent !== undefined) {\n        appendPart(reviewedContent, true);\n      } else {\n        // Fallback: if review failed, use existing or blank\n        if (action.kind === 'review' && action.targetIndex !== null) {\n          appendPart(targetBlocks[action.targetIndex]!.content, false);\n        } else {\n          appendPart('\\n', false);\n        }\n      }\n    } else if (action.kind === 'delete') {\n      const reviewedContent = reviewedSegments.get(actionIndex);\n      if (reviewedContent !== undefined) {\n        // Caller explicitly resolved this block: empty string = actually delete,\n        // non-empty string = replacement content.\n        appendPart(reviewedContent, true);\n      } else {\n        // Default: keep verbatim. A target block with no base counterpart may\n        // just be a section the aligner could not follow (reordering, split\n        // prose) — keeping it prevents accidental data loss in log/read-only mode.\n        appendPart(targetBlocks[action.targetIndex]!.content, false);\n      }\n    }\n  });\n\n  return mergedText;\n};\n"],"mappings":";;;;;;;;;;;AAiCA,MAAa,4BAA4B,EACvC,YACA,cACA,WACiC;CACjC,MAAM,mBAAsC,CAAC;CAE7C,KAAK,QAAQ,SAAS,QAAQ,gBAAgB;EAC5C,IAAI,OAAO,SAAS,UAAU;GAC5B,MAAM,YAAY,WAAW,OAAO;GACpC,MAAM,kBACJ,OAAO,gBAAgB,OACnB,aAAa,OAAO,YAAY,CAAC,UACjC;GAEN,iBAAiB,KAAK;IAAE;IAAW;IAAiB;GAAY,CAAC;EACnE,OAAO,IAAI,OAAO,SAAS,cAAc;GACvC,MAAM,YAAY,WAAW,OAAO;GAEpC,iBAAiB,KAAK;IACpB;IACA,iBAAiB;IACjB;GACF,CAAC;EACH;CACF,CAAC;CAED,OAAO,EAAE,iBAAiB;AAC5B;;AAGA,MAAM,yBAAyB,SAC7B,cAAc,KAAK,IAAI;;;;;;;AAQzB,MAAM,uBAAuB,SAAyB;CACpD,IAAI,KAAK,WAAW,KAAK,sBAAsB,IAAI,GAAG,OAAO;CAE7D,OAAO,KAAK,SAAS,IAAI,IAAI,OAAO;AACtC;;;;;;;;;;AAWA,MAAa,yBACX,MACA,cACA,qBACW;CACX,IAAI,aAAa;CACjB,IAAI,2BAA2B;;;;;;;;;;;CAY/B,MAAM,cAAc,SAAiB,gBAA+B;EAClE,IAAI,QAAQ,WAAW,GAAG;EAE1B,IAAI,eAAe,0BACjB,cAAc,oBAAoB,UAAU;EAG9C,cAAc;EACd,2BAA2B;CAC7B;CAEA,KAAK,QAAQ,SAAS,QAAQ,gBAAgB;EAC5C,IAAI,OAAO,SAAS,SAClB,WAAW,aAAa,OAAO,YAAY,CAAE,SAAS,KAAK;OACtD,IAAI,OAAO,SAAS,YAAY,OAAO,SAAS,cAAc;GACnE,MAAM,kBAAkB,iBAAiB,IAAI,WAAW;GAExD,IAAI,oBAAoB,QACtB,WAAW,iBAAiB,IAAI;QAGhC,IAAI,OAAO,SAAS,YAAY,OAAO,gBAAgB,MACrD,WAAW,aAAa,OAAO,YAAY,CAAE,SAAS,KAAK;QAE3D,WAAW,MAAM,KAAK;EAG5B,OAAO,IAAI,OAAO,SAAS,UAAU;GACnC,MAAM,kBAAkB,iBAAiB,IAAI,WAAW;GACxD,IAAI,oBAAoB,QAGtB,WAAW,iBAAiB,IAAI;QAKhC,WAAW,aAAa,OAAO,YAAY,CAAE,SAAS,KAAK;EAE/D;CACF,CAAC;CAED,OAAO;AACT"}

package/dist/cjs/docReview/segmentDocument.cjs

@@ -1,9 +1,19 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });
 
 //#region src/docReview/segmentDocument.ts
+const HEADING_PATTERN = /^\s*(#{1,6})\s+/;
 const isBlankLine = (line) => line.trim().length === 0;
 const isFencedCodeDelimiter = (line) => /^\s*```/.test(line);
-const isHeading = (line) => /^\s*#{1,6}\s+/.test(line);
+/**
+* Read the depth of an ATX markdown heading (`#` → 1, `######` → 6).
+*
+* @param line - The line to inspect.
+* @returns The heading depth, or `null` when the line is not a heading.
+*/
+const parseHeadingDepth = (line) => {
+	return HEADING_PATTERN.exec(line)?.[1]?.length ?? null;
+};
+const isHeading = (line) => parseHeadingDepth(line) !== null;
 const isFrontmatterDelimiter = (line) => /^\s*---\s*$/.test(line);
 /**
 * Split a markdown document into fine-grained blocks.
@@ -37,6 +47,7 @@ const segmentDocument = (text) => {
 			if (index < lineCount) index += 1;
 			units.push({
 				type: "unknown",
+				headingDepth: null,
 				startIndex,
 				endIndex: index - 1
 			});
@@ -49,14 +60,17 @@ const segmentDocument = (text) => {
 			if (index < lineCount) index += 1;
 			units.push({
 				type: "code_block",
+				headingDepth: null,
 				startIndex,
 				endIndex: index - 1
 			});
 			continue;
 		}
-		if (isHeading(currentLine)) {
+		const headingDepth = parseHeadingDepth(currentLine);
+		if (headingDepth !== null) {
 			units.push({
 				type: "heading",
+				headingDepth,
 				startIndex: index,
 				endIndex: index
 			});
@@ -67,6 +81,7 @@ const segmentDocument = (text) => {
 		while (index < lineCount && !isBlankLine(lines[index]) && !isHeading(lines[index]) && !isFencedCodeDelimiter(lines[index])) index += 1;
 		units.push({
 			type: "paragraph",
+			headingDepth: null,
 			startIndex,
 			endIndex: index - 1
 		});
@@ -80,6 +95,7 @@ const segmentDocument = (text) => {
 		return {
 			type: unit.type,
 			content,
+			headingDepth: unit.headingDepth,
 			lineStart: blockStartIndex + 1,
 			lineEnd: blockEndIndex + 1
 		};
@@ -114,6 +130,7 @@ const segmentSections = (text) => {
 		sections.push({
 			type: firstBlock.type,
 			content: currentBlocks.map((block) => block.content).join(""),
+			headingDepth: firstBlock.headingDepth,
 			lineStart: firstBlock.lineStart,
 			lineEnd: lastBlock.lineEnd
 		});

package/dist/cjs/docReview/segmentDocument.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"segmentDocument.cjs","names":[],"sources":["../../../src/docReview/segmentDocument.ts"],"sourcesContent":["import type { Block, BlockType } from './types';\n\nconst isBlankLine = (line: string): boolean => line.trim().length === 0;\nconst isFencedCodeDelimiter = (line: string): boolean => /^\\s*```/.test(line);\nconst isHeading = (line: string): boolean => /^\\s*#{1,6}\\s+/.test(line);\nconst isFrontmatterDelimiter = (line: string): boolean =>\n  /^\\s*---\\s*$/.test(line);\n\n/**\n * A content unit (heading, paragraph, code block or frontmatter) spanning a\n * 0-based, inclusive line range. Blank-line runs are not units of their own;\n * they are folded into the preceding unit as trailing separators (see\n * {@link segmentDocument}) so that the concatenation of every block's content\n * reproduces the document byte-for-byte.\n */\ntype ContentUnit = {\n  type: BlockType;\n  startIndex: number;\n  endIndex: number;\n};\n\n/**\n * Split a markdown document into fine-grained blocks.\n *\n * Boundaries are drawn at headings, blank lines (paragraph breaks) and fenced\n * code blocks, while frontmatter and the inside of code fences are kept intact.\n * Each blank-line run is appended to the block that precedes it, so the blocks\n * form an exact partition of the document: concatenating every `content` (in\n * order) yields the original text unchanged. This is what lets the block-aware\n * review re-translate only the paragraphs/snippets that actually changed instead\n * of the whole heading section.\n *\n * @param text - The full markdown document.\n * @returns The ordered list of blocks with their 1-based line ranges.\n */\nexport const segmentDocument = (text: string): Block[] => {\n  const lines = text.split('\\n');\n  const lineCount = lines.length;\n\n  // 1. Tokenize into content units, skipping blank-line runs (folded in below).\n  const units: ContentUnit[] = [];\n  let index = 0;\n\n  while (index < lineCount) {\n    const currentLine = lines[index];\n\n    if (isBlankLine(currentLine)) {\n      index += 1;\n      continue;\n    }\n\n    // Frontmatter: only when it opens the document.\n    if (units.length === 0 && isFrontmatterDelimiter(currentLine)) {\n      const startIndex = index;\n      index += 1;\n      while (index < lineCount && !isFrontmatterDelimiter(lines[index])) {\n        index += 1;\n      }\n      // Include the closing delimiter when present.\n      if (index < lineCount) index += 1;\n      units.push({ type: 'unknown', startIndex, endIndex: index - 1 });\n      continue;\n    }\n\n    // Fenced code block: consumed whole so inner blank lines and `#` lines are\n    // never treated as boundaries.\n    if (isFencedCodeDelimiter(currentLine)) {\n      const startIndex = index;\n      index += 1;\n      while (index < lineCount && !isFencedCodeDelimiter(lines[index])) {\n        index += 1;\n      }\n      // Include the closing fence when present.\n      if (index < lineCount) index += 1;\n      units.push({ type: 'code_block', startIndex, endIndex: index - 1 });\n      continue;\n    }\n\n    // Heading: a single self-contained line.\n    if (isHeading(currentLine)) {\n      units.push({ type: 'heading', startIndex: index, endIndex: index });\n      index += 1;\n      continue;\n    }\n\n    // Paragraph: a run of consecutive lines until a blank line, a heading or a\n    // code fence. Tables and tight lists stay together (no blank line between\n    // their rows/items).\n    const startIndex = index;\n    while (\n      index < lineCount &&\n      !isBlankLine(lines[index]) &&\n      !isHeading(lines[index]) &&\n      !isFencedCodeDelimiter(lines[index])\n    ) {\n      index += 1;\n    }\n    units.push({ type: 'paragraph', startIndex, endIndex: index - 1 });\n  }\n\n  if (units.length === 0) return [];\n\n  // 2. Turn each unit into a block whose line range extends to just before the\n  //    next unit, so the trailing blank-line run is owned by it. The first block\n  //    also absorbs any leading blank lines, and the last block runs to EOF.\n  return units.map((unit, unitIndex): Block => {\n    const blockStartIndex = unitIndex === 0 ? 0 : unit.startIndex;\n    const blockEndIndex =\n      unitIndex === units.length - 1\n        ? lineCount - 1\n        : units[unitIndex + 1].startIndex - 1;\n\n    const blockLines = lines.slice(blockStartIndex, blockEndIndex + 1);\n    // Re-append the boundary newline dropped by `split` for every block but the\n    // one ending at EOF, so concatenating all blocks rebuilds the document.\n    const content =\n      blockEndIndex < lineCount - 1\n        ? `${blockLines.join('\\n')}\\n`\n        : blockLines.join('\\n');\n\n    return {\n      type: unit.type,\n      content,\n      lineStart: blockStartIndex + 1,\n      lineEnd: blockEndIndex + 1,\n    };\n  });\n};\n\n/**\n * Split a markdown document into coarse, heading-anchored sections.\n *\n * Built by grouping the fine blocks of {@link segmentDocument}: frontmatter and\n * each heading open a new section, and the following non-heading blocks are\n * folded into it. Because it only concatenates adjacent fine blocks, the result\n * is still an exact partition of the document (sections concatenate back to the\n * source unchanged).\n *\n * Sections are the robust alignment unit between a base document and its\n * translation — both share the same heading structure, so they align almost\n * perfectly and a translation that splits its prose into a different number of\n * paragraphs never causes a section to be dropped. Fine-grained review happens\n * within a section once it is known to have changed.\n *\n * @param text - The full markdown document.\n * @returns The ordered list of sections with their 1-based line ranges.\n */\nexport const segmentSections = (text: string): Block[] => {\n  const fineBlocks = segmentDocument(text);\n  const sections: Block[] = [];\n  let currentBlocks: Block[] = [];\n\n  const flushSection = (): void => {\n    if (currentBlocks.length === 0) return;\n\n    const [firstBlock] = currentBlocks;\n    const lastBlock = currentBlocks[currentBlocks.length - 1];\n\n    sections.push({\n      type: firstBlock.type,\n      content: currentBlocks.map((block) => block.content).join(''),\n      lineStart: firstBlock.lineStart,\n      lineEnd: lastBlock.lineEnd,\n    });\n    currentBlocks = [];\n  };\n\n  for (const block of fineBlocks) {\n    // Frontmatter (a leading `unknown` block) and every heading open a section.\n    const opensSection =\n      block.type === 'heading' ||\n      (block.type === 'unknown' && sections.length === 0);\n\n    if (opensSection) flushSection();\n    currentBlocks.push(block);\n    if (block.type === 'unknown' && sections.length === 0) flushSection();\n  }\n\n  flushSection();\n\n  return sections;\n};\n"],"mappings":";;;AAEA,MAAM,eAAe,SAA0B,KAAK,KAAK,CAAC,CAAC,WAAW;AACtE,MAAM,yBAAyB,SAA0B,UAAU,KAAK,IAAI;AAC5E,MAAM,aAAa,SAA0B,gBAAgB,KAAK,IAAI;AACtE,MAAM,0BAA0B,SAC9B,cAAc,KAAK,IAAI;;;;;;;;;;;;;;;AA6BzB,MAAa,mBAAmB,SAA0B;CACxD,MAAM,QAAQ,KAAK,MAAM,IAAI;CAC7B,MAAM,YAAY,MAAM;CAGxB,MAAM,QAAuB,CAAC;CAC9B,IAAI,QAAQ;CAEZ,OAAO,QAAQ,WAAW;EACxB,MAAM,cAAc,MAAM;EAE1B,IAAI,YAAY,WAAW,GAAG;GAC5B,SAAS;GACT;EACF;EAGA,IAAI,MAAM,WAAW,KAAK,uBAAuB,WAAW,GAAG;GAC7D,MAAM,aAAa;GACnB,SAAS;GACT,OAAO,QAAQ,aAAa,CAAC,uBAAuB,MAAM,MAAM,GAC9D,SAAS;GAGX,IAAI,QAAQ,WAAW,SAAS;GAChC,MAAM,KAAK;IAAE,MAAM;IAAW;IAAY,UAAU,QAAQ;GAAE,CAAC;GAC/D;EACF;EAIA,IAAI,sBAAsB,WAAW,GAAG;GACtC,MAAM,aAAa;GACnB,SAAS;GACT,OAAO,QAAQ,aAAa,CAAC,sBAAsB,MAAM,MAAM,GAC7D,SAAS;GAGX,IAAI,QAAQ,WAAW,SAAS;GAChC,MAAM,KAAK;IAAE,MAAM;IAAc;IAAY,UAAU,QAAQ;GAAE,CAAC;GAClE;EACF;EAGA,IAAI,UAAU,WAAW,GAAG;GAC1B,MAAM,KAAK;IAAE,MAAM;IAAW,YAAY;IAAO,UAAU;GAAM,CAAC;GAClE,SAAS;GACT;EACF;EAKA,MAAM,aAAa;EACnB,OACE,QAAQ,aACR,CAAC,YAAY,MAAM,MAAM,KACzB,CAAC,UAAU,MAAM,MAAM,KACvB,CAAC,sBAAsB,MAAM,MAAM,GAEnC,SAAS;EAEX,MAAM,KAAK;GAAE,MAAM;GAAa;GAAY,UAAU,QAAQ;EAAE,CAAC;CACnE;CAEA,IAAI,MAAM,WAAW,GAAG,OAAO,CAAC;CAKhC,OAAO,MAAM,KAAK,MAAM,cAAqB;EAC3C,MAAM,kBAAkB,cAAc,IAAI,IAAI,KAAK;EACnD,MAAM,gBACJ,cAAc,MAAM,SAAS,IACzB,YAAY,IACZ,MAAM,YAAY,EAAE,CAAC,aAAa;EAExC,MAAM,aAAa,MAAM,MAAM,iBAAiB,gBAAgB,CAAC;EAGjE,MAAM,UACJ,gBAAgB,YAAY,IACxB,GAAG,WAAW,KAAK,IAAI,EAAE,MACzB,WAAW,KAAK,IAAI;EAE1B,OAAO;GACL,MAAM,KAAK;GACX;GACA,WAAW,kBAAkB;GAC7B,SAAS,gBAAgB;EAC3B;CACF,CAAC;AACH;;;;;;;;;;;;;;;;;;;AAoBA,MAAa,mBAAmB,SAA0B;CACxD,MAAM,aAAa,gBAAgB,IAAI;CACvC,MAAM,WAAoB,CAAC;CAC3B,IAAI,gBAAyB,CAAC;CAE9B,MAAM,qBAA2B;EAC/B,IAAI,cAAc,WAAW,GAAG;EAEhC,MAAM,CAAC,cAAc;EACrB,MAAM,YAAY,cAAc,cAAc,SAAS;EAEvD,SAAS,KAAK;GACZ,MAAM,WAAW;GACjB,SAAS,cAAc,KAAK,UAAU,MAAM,OAAO,CAAC,CAAC,KAAK,EAAE;GAC5D,WAAW,WAAW;GACtB,SAAS,UAAU;EACrB,CAAC;EACD,gBAAgB,CAAC;CACnB;CAEA,KAAK,MAAM,SAAS,YAAY;EAM9B,IAHE,MAAM,SAAS,aACd,MAAM,SAAS,aAAa,SAAS,WAAW,GAEjC,aAAa;EAC/B,cAAc,KAAK,KAAK;EACxB,IAAI,MAAM,SAAS,aAAa,SAAS,WAAW,GAAG,aAAa;CACtE;CAEA,aAAa;CAEb,OAAO;AACT"}
+{"version":3,"file":"segmentDocument.cjs","names":[],"sources":["../../../src/docReview/segmentDocument.ts"],"sourcesContent":["import type { Block, BlockType } from './types';\n\nconst HEADING_PATTERN = /^\\s*(#{1,6})\\s+/;\n\nconst isBlankLine = (line: string): boolean => line.trim().length === 0;\nconst isFencedCodeDelimiter = (line: string): boolean => /^\\s*```/.test(line);\n\n/**\n * Read the depth of an ATX markdown heading (`#` → 1, `######` → 6).\n *\n * @param line - The line to inspect.\n * @returns The heading depth, or `null` when the line is not a heading.\n */\nconst parseHeadingDepth = (line: string): number | null => {\n  const match = HEADING_PATTERN.exec(line);\n\n  return match?.[1]?.length ?? null;\n};\n\nconst isHeading = (line: string): boolean => parseHeadingDepth(line) !== null;\nconst isFrontmatterDelimiter = (line: string): boolean =>\n  /^\\s*---\\s*$/.test(line);\n\n/**\n * A content unit (heading, paragraph, code block or frontmatter) spanning a\n * 0-based, inclusive line range. Blank-line runs are not units of their own;\n * they are folded into the preceding unit as trailing separators (see\n * {@link segmentDocument}) so that the concatenation of every block's content\n * reproduces the document byte-for-byte.\n */\ntype ContentUnit = {\n  type: BlockType;\n  /** Depth of the ATX heading opening the unit, `null` when it is not a heading. */\n  headingDepth: number | null;\n  startIndex: number;\n  endIndex: number;\n};\n\n/**\n * Split a markdown document into fine-grained blocks.\n *\n * Boundaries are drawn at headings, blank lines (paragraph breaks) and fenced\n * code blocks, while frontmatter and the inside of code fences are kept intact.\n * Each blank-line run is appended to the block that precedes it, so the blocks\n * form an exact partition of the document: concatenating every `content` (in\n * order) yields the original text unchanged. This is what lets the block-aware\n * review re-translate only the paragraphs/snippets that actually changed instead\n * of the whole heading section.\n *\n * @param text - The full markdown document.\n * @returns The ordered list of blocks with their 1-based line ranges.\n */\nexport const segmentDocument = (text: string): Block[] => {\n  const lines = text.split('\\n');\n  const lineCount = lines.length;\n\n  // 1. Tokenize into content units, skipping blank-line runs (folded in below).\n  const units: ContentUnit[] = [];\n  let index = 0;\n\n  while (index < lineCount) {\n    const currentLine = lines[index];\n\n    if (isBlankLine(currentLine)) {\n      index += 1;\n      continue;\n    }\n\n    // Frontmatter: only when it opens the document.\n    if (units.length === 0 && isFrontmatterDelimiter(currentLine)) {\n      const startIndex = index;\n      index += 1;\n      while (index < lineCount && !isFrontmatterDelimiter(lines[index])) {\n        index += 1;\n      }\n      // Include the closing delimiter when present.\n      if (index < lineCount) index += 1;\n      units.push({\n        type: 'unknown',\n        headingDepth: null,\n        startIndex,\n        endIndex: index - 1,\n      });\n      continue;\n    }\n\n    // Fenced code block: consumed whole so inner blank lines and `#` lines are\n    // never treated as boundaries.\n    if (isFencedCodeDelimiter(currentLine)) {\n      const startIndex = index;\n      index += 1;\n      while (index < lineCount && !isFencedCodeDelimiter(lines[index])) {\n        index += 1;\n      }\n      // Include the closing fence when present.\n      if (index < lineCount) index += 1;\n      units.push({\n        type: 'code_block',\n        headingDepth: null,\n        startIndex,\n        endIndex: index - 1,\n      });\n      continue;\n    }\n\n    // Heading: a single self-contained line.\n    const headingDepth = parseHeadingDepth(currentLine);\n\n    if (headingDepth !== null) {\n      units.push({\n        type: 'heading',\n        headingDepth,\n        startIndex: index,\n        endIndex: index,\n      });\n      index += 1;\n      continue;\n    }\n\n    // Paragraph: a run of consecutive lines until a blank line, a heading or a\n    // code fence. Tables and tight lists stay together (no blank line between\n    // their rows/items).\n    const startIndex = index;\n    while (\n      index < lineCount &&\n      !isBlankLine(lines[index]) &&\n      !isHeading(lines[index]) &&\n      !isFencedCodeDelimiter(lines[index])\n    ) {\n      index += 1;\n    }\n    units.push({\n      type: 'paragraph',\n      headingDepth: null,\n      startIndex,\n      endIndex: index - 1,\n    });\n  }\n\n  if (units.length === 0) return [];\n\n  // 2. Turn each unit into a block whose line range extends to just before the\n  //    next unit, so the trailing blank-line run is owned by it. The first block\n  //    also absorbs any leading blank lines, and the last block runs to EOF.\n  return units.map((unit, unitIndex): Block => {\n    const blockStartIndex = unitIndex === 0 ? 0 : unit.startIndex;\n    const blockEndIndex =\n      unitIndex === units.length - 1\n        ? lineCount - 1\n        : units[unitIndex + 1].startIndex - 1;\n\n    const blockLines = lines.slice(blockStartIndex, blockEndIndex + 1);\n    // Re-append the boundary newline dropped by `split` for every block but the\n    // one ending at EOF, so concatenating all blocks rebuilds the document.\n    const content =\n      blockEndIndex < lineCount - 1\n        ? `${blockLines.join('\\n')}\\n`\n        : blockLines.join('\\n');\n\n    return {\n      type: unit.type,\n      content,\n      headingDepth: unit.headingDepth,\n      lineStart: blockStartIndex + 1,\n      lineEnd: blockEndIndex + 1,\n    };\n  });\n};\n\n/**\n * Split a markdown document into coarse, heading-anchored sections.\n *\n * Built by grouping the fine blocks of {@link segmentDocument}: frontmatter and\n * each heading open a new section, and the following non-heading blocks are\n * folded into it. Because it only concatenates adjacent fine blocks, the result\n * is still an exact partition of the document (sections concatenate back to the\n * source unchanged).\n *\n * Sections are the robust alignment unit between a base document and its\n * translation — both share the same heading structure, so they align almost\n * perfectly and a translation that splits its prose into a different number of\n * paragraphs never causes a section to be dropped. Fine-grained review happens\n * within a section once it is known to have changed.\n *\n * @param text - The full markdown document.\n * @returns The ordered list of sections with their 1-based line ranges.\n */\nexport const segmentSections = (text: string): Block[] => {\n  const fineBlocks = segmentDocument(text);\n  const sections: Block[] = [];\n  let currentBlocks: Block[] = [];\n\n  const flushSection = (): void => {\n    if (currentBlocks.length === 0) return;\n\n    const [firstBlock] = currentBlocks;\n    const lastBlock = currentBlocks[currentBlocks.length - 1];\n\n    sections.push({\n      type: firstBlock.type,\n      content: currentBlocks.map((block) => block.content).join(''),\n      // A section is identified by the heading that opens it, so it inherits its\n      // depth — this is what keeps a `##` section from aligning with a `###` one.\n      headingDepth: firstBlock.headingDepth,\n      lineStart: firstBlock.lineStart,\n      lineEnd: lastBlock.lineEnd,\n    });\n    currentBlocks = [];\n  };\n\n  for (const block of fineBlocks) {\n    // Frontmatter (a leading `unknown` block) and every heading open a section.\n    const opensSection =\n      block.type === 'heading' ||\n      (block.type === 'unknown' && sections.length === 0);\n\n    if (opensSection) flushSection();\n    currentBlocks.push(block);\n    if (block.type === 'unknown' && sections.length === 0) flushSection();\n  }\n\n  flushSection();\n\n  return sections;\n};\n"],"mappings":";;;AAEA,MAAM,kBAAkB;AAExB,MAAM,eAAe,SAA0B,KAAK,KAAK,CAAC,CAAC,WAAW;AACtE,MAAM,yBAAyB,SAA0B,UAAU,KAAK,IAAI;;;;;;;AAQ5E,MAAM,qBAAqB,SAAgC;CAGzD,OAFc,gBAAgB,KAAK,IAExB,CAAC,GAAG,EAAE,EAAE,UAAU;AAC/B;AAEA,MAAM,aAAa,SAA0B,kBAAkB,IAAI,MAAM;AACzE,MAAM,0BAA0B,SAC9B,cAAc,KAAK,IAAI;;;;;;;;;;;;;;;AA+BzB,MAAa,mBAAmB,SAA0B;CACxD,MAAM,QAAQ,KAAK,MAAM,IAAI;CAC7B,MAAM,YAAY,MAAM;CAGxB,MAAM,QAAuB,CAAC;CAC9B,IAAI,QAAQ;CAEZ,OAAO,QAAQ,WAAW;EACxB,MAAM,cAAc,MAAM;EAE1B,IAAI,YAAY,WAAW,GAAG;GAC5B,SAAS;GACT;EACF;EAGA,IAAI,MAAM,WAAW,KAAK,uBAAuB,WAAW,GAAG;GAC7D,MAAM,aAAa;GACnB,SAAS;GACT,OAAO,QAAQ,aAAa,CAAC,uBAAuB,MAAM,MAAM,GAC9D,SAAS;GAGX,IAAI,QAAQ,WAAW,SAAS;GAChC,MAAM,KAAK;IACT,MAAM;IACN,cAAc;IACd;IACA,UAAU,QAAQ;GACpB,CAAC;GACD;EACF;EAIA,IAAI,sBAAsB,WAAW,GAAG;GACtC,MAAM,aAAa;GACnB,SAAS;GACT,OAAO,QAAQ,aAAa,CAAC,sBAAsB,MAAM,MAAM,GAC7D,SAAS;GAGX,IAAI,QAAQ,WAAW,SAAS;GAChC,MAAM,KAAK;IACT,MAAM;IACN,cAAc;IACd;IACA,UAAU,QAAQ;GACpB,CAAC;GACD;EACF;EAGA,MAAM,eAAe,kBAAkB,WAAW;EAElD,IAAI,iBAAiB,MAAM;GACzB,MAAM,KAAK;IACT,MAAM;IACN;IACA,YAAY;IACZ,UAAU;GACZ,CAAC;GACD,SAAS;GACT;EACF;EAKA,MAAM,aAAa;EACnB,OACE,QAAQ,aACR,CAAC,YAAY,MAAM,MAAM,KACzB,CAAC,UAAU,MAAM,MAAM,KACvB,CAAC,sBAAsB,MAAM,MAAM,GAEnC,SAAS;EAEX,MAAM,KAAK;GACT,MAAM;GACN,cAAc;GACd;GACA,UAAU,QAAQ;EACpB,CAAC;CACH;CAEA,IAAI,MAAM,WAAW,GAAG,OAAO,CAAC;CAKhC,OAAO,MAAM,KAAK,MAAM,cAAqB;EAC3C,MAAM,kBAAkB,cAAc,IAAI,IAAI,KAAK;EACnD,MAAM,gBACJ,cAAc,MAAM,SAAS,IACzB,YAAY,IACZ,MAAM,YAAY,EAAE,CAAC,aAAa;EAExC,MAAM,aAAa,MAAM,MAAM,iBAAiB,gBAAgB,CAAC;EAGjE,MAAM,UACJ,gBAAgB,YAAY,IACxB,GAAG,WAAW,KAAK,IAAI,EAAE,MACzB,WAAW,KAAK,IAAI;EAE1B,OAAO;GACL,MAAM,KAAK;GACX;GACA,cAAc,KAAK;GACnB,WAAW,kBAAkB;GAC7B,SAAS,gBAAgB;EAC3B;CACF,CAAC;AACH;;;;;;;;;;;;;;;;;;;AAoBA,MAAa,mBAAmB,SAA0B;CACxD,MAAM,aAAa,gBAAgB,IAAI;CACvC,MAAM,WAAoB,CAAC;CAC3B,IAAI,gBAAyB,CAAC;CAE9B,MAAM,qBAA2B;EAC/B,IAAI,cAAc,WAAW,GAAG;EAEhC,MAAM,CAAC,cAAc;EACrB,MAAM,YAAY,cAAc,cAAc,SAAS;EAEvD,SAAS,KAAK;GACZ,MAAM,WAAW;GACjB,SAAS,cAAc,KAAK,UAAU,MAAM,OAAO,CAAC,CAAC,KAAK,EAAE;GAG5D,cAAc,WAAW;GACzB,WAAW,WAAW;GACtB,SAAS,UAAU;EACrB,CAAC;EACD,gBAAgB,CAAC;CACnB;CAEA,KAAK,MAAM,SAAS,YAAY;EAM9B,IAHE,MAAM,SAAS,aACd,MAAM,SAAS,aAAa,SAAS,WAAW,GAEjC,aAAa;EAC/B,cAAc,KAAK,KAAK;EACxB,IAAI,MAAM,SAAS,aAAa,SAAS,WAAW,GAAG,aAAa;CACtE;CAEA,aAAa;CAEb,OAAO;AACT"}

package/dist/cjs/fetchDistantDictionaries.cjs

@@ -1,46 +1,140 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });
 const require_utils_parallelize = require('./utils/parallelize.cjs');
+const require_utils_chunkArray = require('./utils/chunkArray.cjs');
 let _intlayer_config_logger = require("@intlayer/config/logger");
 let _intlayer_config_node = require("@intlayer/config/node");
+let _intlayer_config_utils = require("@intlayer/config/utils");
 let _intlayer_api = require("@intlayer/api");
 let _intlayer_api_dictionary = require("@intlayer/api/dictionary");
 
 //#region src/fetchDistantDictionaries.ts
 /**
+* Number of dictionaries requested per HTTP call. Must stay under the batch
+* limit enforced by the backend (`MAX_DICTIONARY_KEYS_PER_REQUEST`).
+*/
+const DEFAULT_DICTIONARIES_PER_REQUEST = 3;
+/** Number of batch requests kept in flight at the same time. */
+const DEFAULT_PARALLEL_REQUESTS = 5;
+/** Number of retries performed on a failing batch request. */
+const DEFAULT_MAX_RETRY = 2;
+/** Delay between two attempts of a failing batch request, in milliseconds. */
+const DEFAULT_RETRY_DELAY = 250;
+/** HTTP statuses worth another attempt despite being client errors. */
+const RETRYABLE_CLIENT_ERROR_STATUSES = /* @__PURE__ */ new Set([
+	408,
+	425,
+	429
+]);
+/**
+* A request is worth retrying when it failed for a reason another attempt could
+* fix: a network error (no status at all) or a server-side / throttling status.
+* Replaying a `404` or a `401` only multiplies the noise.
+*/
+const isRetryableError = (error) => {
+	const status = error?.status;
+	if (typeof status !== "number") return true;
+	if (status >= 500) return true;
+	return RETRYABLE_CLIENT_ERROR_STATUSES.has(status);
+};
+/**
+* A backend that predates the batch endpoint routes `/dictionary/by-keys` to
+* its `/dictionary/:dictionaryKey` handler, which answers `404` - either as an
+* unknown dictionary or as an unknown route. Both mean the same thing here:
+* this backend cannot serve batches, so fall back to one request per key.
+*/
+const isBatchEndpointUnsupported = (error) => error?.status === 404;
+/**
 * Fetch distant dictionaries and update the logger with their statuses.
+*
+* Keys are grouped into batches fetched by a single request each, and those
+* requests are kept in flight together — by default 5 concurrent requests of 3
+* dictionaries, so 15 dictionaries travel at any given time. A slot is refilled
+* as soon as its request settles, so no batch waits for the whole wave.
+* Failing requests are retried before their keys are reported as errors.
 */
 const fetchDistantDictionaries = async (options, onStatusUpdate) => {
 	const config = (0, _intlayer_config_node.getConfiguration)();
 	const appLogger = (0, _intlayer_config_logger.getAppLogger)(config);
 	try {
 		const dictionary = (0, _intlayer_api_dictionary.dictionaryEndpoint)((0, _intlayer_api.createIntlayerCMS)(config));
-		const distantDictionariesKeys = options.dictionaryKeys;
-		const processDictionary = async (dictionaryKey) => {
-			onStatusUpdate?.([{
+		const { dictionariesPerRequest = DEFAULT_DICTIONARIES_PER_REQUEST, parallelRequests = DEFAULT_PARALLEL_REQUESTS, maxRetry = DEFAULT_MAX_RETRY, retryDelay = DEFAULT_RETRY_DELAY } = options;
+		const distantDictionariesKeys = [...new Set(options.dictionaryKeys)];
+		if (distantDictionariesKeys.length === 0) return [];
+		const batches = require_utils_chunkArray.chunkArray(distantDictionariesKeys, dictionariesPerRequest);
+		let isBatchEndpointSupported = true;
+		let hasLoggedBatchFallback = false;
+		/**
+		* Fetch each key of a batch with its own request. Used against backends
+		* without the batch endpoint. A key missing on the remote only discards
+		* itself, never its neighbours.
+		*/
+		const requestDictionariesOneByOne = async (batchKeys) => {
+			return (await require_utils_parallelize.parallelize(batchKeys, async (dictionaryKey) => {
+				try {
+					return (await dictionary.getDictionary(dictionaryKey)).data;
+				} catch (_error) {
+					return;
+				}
+			}, batchKeys.length)).filter((distantDictionary) => distantDictionary !== void 0);
+		};
+		/**
+		* Request one batch of dictionaries, retrying the whole request when it
+		* fails for a transient reason - a batch carries several dictionaries, so
+		* a network hiccup would otherwise discard all of them at once.
+		*/
+		const requestBatch = (0, _intlayer_config_utils.retryManager)(async (batchKeys) => {
+			if (isBatchEndpointSupported) try {
+				return (await dictionary.getDictionariesByKeys(batchKeys)).data ?? [];
+			} catch (error) {
+				if (!isBatchEndpointUnsupported(error)) throw error;
+				isBatchEndpointSupported = false;
+				if (!hasLoggedBatchFallback) {
+					hasLoggedBatchFallback = true;
+					appLogger("This backend does not provide the batch dictionary endpoint - falling back to one request per dictionary.", { level: "warn" });
+				}
+			}
+			return await requestDictionariesOneByOne(batchKeys);
+		}, {
+			maxRetry,
+			delay: retryDelay,
+			shouldRetry: isRetryableError,
+			onError: ({ error, attempt }) => appLogger(`Retrying distant dictionaries request (attempt ${attempt + 1}/${maxRetry}): ${error}`, { level: "warn" })
+		});
+		/**
+		* Fetch one batch of dictionaries within a single request, and report the
+		* resulting status of every key it contains.
+		*/
+		const processBatch = async (batchKeys) => {
+			onStatusUpdate?.(batchKeys.map((dictionaryKey) => ({
 				dictionaryKey,
 				type: "remote",
 				status: "fetching"
-			}]);
+			})));
 			try {
-				const distantDictionary = (await dictionary.getDictionary(dictionaryKey)).data;
-				if (!distantDictionary) throw new Error(`Dictionary ${dictionaryKey} not found on remote`);
-				onStatusUpdate?.([{
+				const distantDictionaries = await requestBatch(batchKeys);
+				const fetchedKeys = new Set(distantDictionaries.map((distantDictionary) => distantDictionary.key));
+				onStatusUpdate?.(batchKeys.map((dictionaryKey) => fetchedKeys.has(dictionaryKey) ? {
 					dictionaryKey,
 					type: "remote",
 					status: "fetched"
-				}]);
-				return distantDictionary;
+				} : {
+					dictionaryKey,
+					type: "remote",
+					status: "error",
+					error: `Dictionary ${dictionaryKey} not found on remote`
+				}));
+				return distantDictionaries;
 			} catch (error) {
-				onStatusUpdate?.([{
+				onStatusUpdate?.(batchKeys.map((dictionaryKey) => ({
 					dictionaryKey,
 					type: "remote",
 					status: "error",
 					error: `Error fetching dictionary ${dictionaryKey}: ${error}`
-				}]);
-				return;
+				})));
+				return [];
 			}
 		};
-		return (await require_utils_parallelize.parallelize(distantDictionariesKeys, async (dictionaryKey) => await processDictionary(dictionaryKey))).filter((dict) => dict !== void 0);
+		return (await require_utils_parallelize.parallelize(batches, processBatch, parallelRequests)).flat();
 	} catch (_error) {
 		appLogger(`${_intlayer_config_logger.x} Failed to fetch distant dictionaries`, { level: "error" });
 		return [];

package/dist/cjs/fetchDistantDictionaries.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"fetchDistantDictionaries.cjs","names":["parallelize","x"],"sources":["../../src/fetchDistantDictionaries.ts"],"sourcesContent":["import { createIntlayerCMS } from '@intlayer/api';\nimport { dictionaryEndpoint } from '@intlayer/api/dictionary';\n// @ts-ignore @intlayer/backend is not build yet\nimport type { DictionaryAPI } from '@intlayer/backend';\nimport { getAppLogger, x } from '@intlayer/config/logger';\nimport { getConfiguration } from '@intlayer/config/node';\nimport type { DictionariesStatus } from './loadDictionaries';\nimport { parallelize } from './utils/parallelize';\n\ntype FetchDistantDictionariesOptions = {\n  dictionaryKeys: string[];\n  newDictionariesPath?: string;\n  logPrefix?: string;\n};\n\n/**\n * Fetch distant dictionaries and update the logger with their statuses.\n */\nexport const fetchDistantDictionaries = async (\n  options: FetchDistantDictionariesOptions,\n  onStatusUpdate?: (status: DictionariesStatus[]) => void\n): Promise<DictionaryAPI[]> => {\n  const config = getConfiguration();\n  const appLogger = getAppLogger(config);\n  try {\n    const dictionary = dictionaryEndpoint(createIntlayerCMS(config));\n\n    const distantDictionariesKeys = options.dictionaryKeys;\n    // Process dictionaries in parallel with a concurrency limit\n    const processDictionary = async (\n      dictionaryKey: string\n    ): Promise<DictionaryAPI | undefined> => {\n      onStatusUpdate?.([\n        {\n          dictionaryKey,\n          type: 'remote',\n          status: 'fetching',\n        },\n      ]);\n\n      try {\n        // Fetch the dictionary\n        const getDictionaryResult =\n          await dictionary.getDictionary(dictionaryKey);\n\n        const distantDictionary = getDictionaryResult.data;\n\n        if (!distantDictionary) {\n          throw new Error(`Dictionary ${dictionaryKey} not found on remote`);\n        }\n\n        onStatusUpdate?.([\n          { dictionaryKey, type: 'remote', status: 'fetched' },\n        ]);\n\n        return distantDictionary;\n      } catch (error) {\n        onStatusUpdate?.([\n          {\n            dictionaryKey,\n            type: 'remote',\n            status: 'error',\n            error: `Error fetching dictionary ${dictionaryKey}: ${error}`,\n          },\n        ]);\n        return undefined;\n      }\n    };\n\n    const result = await parallelize(\n      distantDictionariesKeys,\n      async (dictionaryKey) => await processDictionary(dictionaryKey)\n    );\n\n    // Remove undefined values\n    const filteredResult = result.filter(\n      (dict: DictionaryAPI | undefined): dict is DictionaryAPI =>\n        dict !== undefined\n    );\n\n    return filteredResult;\n  } catch (_error) {\n    appLogger(`${x} Failed to fetch distant dictionaries`, { level: 'error' });\n    return [];\n  }\n};\n"],"mappings":";;;;;;;;;;;AAkBA,MAAa,2BAA2B,OACtC,SACA,mBAC6B;CAC7B,MAAM,qDAA0B;CAChC,MAAM,sDAAyB,MAAM;CACrC,IAAI;EACF,MAAM,mGAAkD,MAAM,CAAC;EAE/D,MAAM,0BAA0B,QAAQ;EAExC,MAAM,oBAAoB,OACxB,kBACuC;GACvC,iBAAiB,CACf;IACE;IACA,MAAM;IACN,QAAQ;GACV,CACF,CAAC;GAED,IAAI;IAKF,MAAM,qBAAoB,MAFlB,WAAW,cAAc,aAAa,EAED,CAAC;IAE9C,IAAI,CAAC,mBACH,MAAM,IAAI,MAAM,cAAc,cAAc,qBAAqB;IAGnE,iBAAiB,CACf;KAAE;KAAe,MAAM;KAAU,QAAQ;IAAU,CACrD,CAAC;IAED,OAAO;GACT,SAAS,OAAO;IACd,iBAAiB,CACf;KACE;KACA,MAAM;KACN,QAAQ;KACR,OAAO,6BAA6B,cAAc,IAAI;IACxD,CACF,CAAC;IACD;GACF;EACF;EAaA,QALuB,MANFA,sCACnB,yBACA,OAAO,kBAAkB,MAAM,kBAAkB,aAAa,CAChE,EAG6B,CAAC,QAC3B,SACC,SAAS,MAGO;CACtB,SAAS,QAAQ;EACf,UAAU,GAAGC,0BAAE,wCAAwC,EAAE,OAAO,QAAQ,CAAC;EACzE,OAAO,CAAC;CACV;AACF"}
+{"version":3,"file":"fetchDistantDictionaries.cjs","names":["chunkArray","parallelize","x"],"sources":["../../src/fetchDistantDictionaries.ts"],"sourcesContent":["import { createIntlayerCMS } from '@intlayer/api';\nimport { dictionaryEndpoint } from '@intlayer/api/dictionary';\n// @ts-ignore @intlayer/backend is not build yet\nimport type { DictionaryAPI } from '@intlayer/backend';\nimport { getAppLogger, x } from '@intlayer/config/logger';\nimport { getConfiguration } from '@intlayer/config/node';\nimport { retryManager } from '@intlayer/config/utils';\nimport type { DictionariesStatus } from './loadDictionaries';\nimport { chunkArray } from './utils/chunkArray';\nimport { parallelize } from './utils/parallelize';\n\n/**\n * Number of dictionaries requested per HTTP call. Must stay under the batch\n * limit enforced by the backend (`MAX_DICTIONARY_KEYS_PER_REQUEST`).\n */\nconst DEFAULT_DICTIONARIES_PER_REQUEST = 3;\n\n/** Number of batch requests kept in flight at the same time. */\nconst DEFAULT_PARALLEL_REQUESTS = 5;\n\n/** Number of retries performed on a failing batch request. */\nconst DEFAULT_MAX_RETRY = 2;\n\n/** Delay between two attempts of a failing batch request, in milliseconds. */\nconst DEFAULT_RETRY_DELAY = 250;\n\n/** HTTP statuses worth another attempt despite being client errors. */\nconst RETRYABLE_CLIENT_ERROR_STATUSES = new Set([408, 425, 429]);\n\n/**\n * A request is worth retrying when it failed for a reason another attempt could\n * fix: a network error (no status at all) or a server-side / throttling status.\n * Replaying a `404` or a `401` only multiplies the noise.\n */\nconst isRetryableError = (error: unknown): boolean => {\n  const status = (error as { status?: number })?.status;\n\n  if (typeof status !== 'number') return true;\n\n  if (status >= 500) return true;\n\n  return RETRYABLE_CLIENT_ERROR_STATUSES.has(status);\n};\n\n/**\n * A backend that predates the batch endpoint routes `/dictionary/by-keys` to\n * its `/dictionary/:dictionaryKey` handler, which answers `404` - either as an\n * unknown dictionary or as an unknown route. Both mean the same thing here:\n * this backend cannot serve batches, so fall back to one request per key.\n */\nconst isBatchEndpointUnsupported = (error: unknown): boolean =>\n  (error as { status?: number })?.status === 404;\n\ntype FetchDistantDictionariesOptions = {\n  dictionaryKeys: string[];\n  newDictionariesPath?: string;\n  logPrefix?: string;\n  /**\n   * Number of dictionaries fetched by a single request.\n   * @default 3\n   */\n  dictionariesPerRequest?: number;\n  /**\n   * Number of requests kept in flight at the same time.\n   * @default 5\n   */\n  parallelRequests?: number;\n  /**\n   * Number of retries performed when a batch request fails.\n   * @default 2\n   */\n  maxRetry?: number;\n  /**\n   * Delay between two attempts of a failing batch request, in milliseconds.\n   * @default 250\n   */\n  retryDelay?: number;\n};\n\n/**\n * Fetch distant dictionaries and update the logger with their statuses.\n *\n * Keys are grouped into batches fetched by a single request each, and those\n * requests are kept in flight together — by default 5 concurrent requests of 3\n * dictionaries, so 15 dictionaries travel at any given time. A slot is refilled\n * as soon as its request settles, so no batch waits for the whole wave.\n * Failing requests are retried before their keys are reported as errors.\n */\nexport const fetchDistantDictionaries = async (\n  options: FetchDistantDictionariesOptions,\n  onStatusUpdate?: (status: DictionariesStatus[]) => void\n): Promise<DictionaryAPI[]> => {\n  const config = getConfiguration();\n  const appLogger = getAppLogger(config);\n  try {\n    const dictionary = dictionaryEndpoint(createIntlayerCMS(config));\n\n    const {\n      dictionariesPerRequest = DEFAULT_DICTIONARIES_PER_REQUEST,\n      parallelRequests = DEFAULT_PARALLEL_REQUESTS,\n      maxRetry = DEFAULT_MAX_RETRY,\n      retryDelay = DEFAULT_RETRY_DELAY,\n    } = options;\n\n    // A same key can be listed twice when several qualified dictionaries share\n    // it - one request per key is enough to retrieve all of its siblings.\n    const distantDictionariesKeys = [...new Set(options.dictionaryKeys)];\n\n    if (distantDictionariesKeys.length === 0) return [];\n\n    const batches = chunkArray(distantDictionariesKeys, dictionariesPerRequest);\n\n    // Flipped once for the whole run as soon as a backend proves unable to\n    // serve batches, so the remaining batches skip the doomed request.\n    let isBatchEndpointSupported = true;\n    let hasLoggedBatchFallback = false;\n\n    /**\n     * Fetch each key of a batch with its own request. Used against backends\n     * without the batch endpoint. A key missing on the remote only discards\n     * itself, never its neighbours.\n     */\n    const requestDictionariesOneByOne = async (\n      batchKeys: string[]\n    ): Promise<DictionaryAPI[]> => {\n      const results = await parallelize(\n        batchKeys,\n        async (dictionaryKey) => {\n          try {\n            const getDictionaryResult =\n              await dictionary.getDictionary(dictionaryKey);\n\n            return getDictionaryResult.data;\n          } catch (_error) {\n            return undefined;\n          }\n        },\n        batchKeys.length\n      );\n\n      return results.filter(\n        (distantDictionary): distantDictionary is DictionaryAPI =>\n          distantDictionary !== undefined\n      );\n    };\n\n    /**\n     * Request one batch of dictionaries, retrying the whole request when it\n     * fails for a transient reason - a batch carries several dictionaries, so\n     * a network hiccup would otherwise discard all of them at once.\n     */\n    const requestBatch = retryManager(\n      async (batchKeys: string[]): Promise<DictionaryAPI[]> => {\n        if (isBatchEndpointSupported) {\n          try {\n            const getDictionariesResult =\n              await dictionary.getDictionariesByKeys(batchKeys);\n\n            return getDictionariesResult.data ?? [];\n          } catch (error) {\n            if (!isBatchEndpointUnsupported(error)) throw error;\n\n            isBatchEndpointSupported = false;\n\n            if (!hasLoggedBatchFallback) {\n              hasLoggedBatchFallback = true;\n              appLogger(\n                'This backend does not provide the batch dictionary endpoint - falling back to one request per dictionary.',\n                { level: 'warn' }\n              );\n            }\n          }\n        }\n\n        return await requestDictionariesOneByOne(batchKeys);\n      },\n      {\n        maxRetry,\n        delay: retryDelay,\n        shouldRetry: isRetryableError,\n        onError: ({ error, attempt }) =>\n          appLogger(\n            `Retrying distant dictionaries request (attempt ${attempt + 1}/${maxRetry}): ${error}`,\n            { level: 'warn' }\n          ),\n      }\n    );\n\n    /**\n     * Fetch one batch of dictionaries within a single request, and report the\n     * resulting status of every key it contains.\n     */\n    const processBatch = async (\n      batchKeys: string[]\n    ): Promise<DictionaryAPI[]> => {\n      onStatusUpdate?.(\n        batchKeys.map((dictionaryKey) => ({\n          dictionaryKey,\n          type: 'remote',\n          status: 'fetching',\n        }))\n      );\n\n      try {\n        const distantDictionaries = await requestBatch(batchKeys);\n\n        const fetchedKeys = new Set(\n          distantDictionaries.map(\n            (distantDictionary: DictionaryAPI) => distantDictionary.key\n          )\n        );\n\n        onStatusUpdate?.(\n          batchKeys.map(\n            (dictionaryKey): DictionariesStatus =>\n              fetchedKeys.has(dictionaryKey)\n                ? {\n                    dictionaryKey,\n                    type: 'remote',\n                    status: 'fetched',\n                  }\n                : {\n                    dictionaryKey,\n                    type: 'remote',\n                    status: 'error',\n                    error: `Dictionary ${dictionaryKey} not found on remote`,\n                  }\n          )\n        );\n\n        return distantDictionaries;\n      } catch (error) {\n        onStatusUpdate?.(\n          batchKeys.map((dictionaryKey) => ({\n            dictionaryKey,\n            type: 'remote',\n            status: 'error',\n            error: `Error fetching dictionary ${dictionaryKey}: ${error}`,\n          }))\n        );\n        return [];\n      }\n    };\n\n    const batchResults = await parallelize(\n      batches,\n      processBatch,\n      parallelRequests\n    );\n\n    return batchResults.flat();\n  } catch (_error) {\n    appLogger(`${x} Failed to fetch distant dictionaries`, { level: 'error' });\n    return [];\n  }\n};\n"],"mappings":";;;;;;;;;;;;;;AAeA,MAAM,mCAAmC;;AAGzC,MAAM,4BAA4B;;AAGlC,MAAM,oBAAoB;;AAG1B,MAAM,sBAAsB;;AAG5B,MAAM,kDAAkC,IAAI,IAAI;CAAC;CAAK;CAAK;AAAG,CAAC;;;;;;AAO/D,MAAM,oBAAoB,UAA4B;CACpD,MAAM,SAAU,OAA+B;CAE/C,IAAI,OAAO,WAAW,UAAU,OAAO;CAEvC,IAAI,UAAU,KAAK,OAAO;CAE1B,OAAO,gCAAgC,IAAI,MAAM;AACnD;;;;;;;AAQA,MAAM,8BAA8B,UACjC,OAA+B,WAAW;;;;;;;;;;AAqC7C,MAAa,2BAA2B,OACtC,SACA,mBAC6B;CAC7B,MAAM,qDAA0B;CAChC,MAAM,sDAAyB,MAAM;CACrC,IAAI;EACF,MAAM,mGAAkD,MAAM,CAAC;EAE/D,MAAM,EACJ,yBAAyB,kCACzB,mBAAmB,2BACnB,WAAW,mBACX,aAAa,wBACX;EAIJ,MAAM,0BAA0B,CAAC,GAAG,IAAI,IAAI,QAAQ,cAAc,CAAC;EAEnE,IAAI,wBAAwB,WAAW,GAAG,OAAO,CAAC;EAElD,MAAM,UAAUA,oCAAW,yBAAyB,sBAAsB;EAI1E,IAAI,2BAA2B;EAC/B,IAAI,yBAAyB;;;;;;EAO7B,MAAM,8BAA8B,OAClC,cAC6B;GAgB7B,QAAO,MAfeC,sCACpB,WACA,OAAO,kBAAkB;IACvB,IAAI;KAIF,QAAO,MAFC,WAAW,cAAc,aAAa,EAEpB,CAAC;IAC7B,SAAS,QAAQ;KACf;IACF;GACF,GACA,UAAU,MACZ,EAEc,CAAC,QACZ,sBACC,sBAAsB,MAC1B;EACF;;;;;;EAOA,MAAM,wDACJ,OAAO,cAAkD;GACvD,IAAI,0BACF,IAAI;IAIF,QAAO,MAFC,WAAW,sBAAsB,SAAS,EAEtB,CAAC,QAAQ,CAAC;GACxC,SAAS,OAAO;IACd,IAAI,CAAC,2BAA2B,KAAK,GAAG,MAAM;IAE9C,2BAA2B;IAE3B,IAAI,CAAC,wBAAwB;KAC3B,yBAAyB;KACzB,UACE,6GACA,EAAE,OAAO,OAAO,CAClB;IACF;GACF;GAGF,OAAO,MAAM,4BAA4B,SAAS;EACpD,GACA;GACE;GACA,OAAO;GACP,aAAa;GACb,UAAU,EAAE,OAAO,cACjB,UACE,kDAAkD,UAAU,EAAE,GAAG,SAAS,KAAK,SAC/E,EAAE,OAAO,OAAO,CAClB;EACJ,CACF;;;;;EAMA,MAAM,eAAe,OACnB,cAC6B;GAC7B,iBACE,UAAU,KAAK,mBAAmB;IAChC;IACA,MAAM;IACN,QAAQ;GACV,EAAE,CACJ;GAEA,IAAI;IACF,MAAM,sBAAsB,MAAM,aAAa,SAAS;IAExD,MAAM,cAAc,IAAI,IACtB,oBAAoB,KACjB,sBAAqC,kBAAkB,GAC1D,CACF;IAEA,iBACE,UAAU,KACP,kBACC,YAAY,IAAI,aAAa,IACzB;KACE;KACA,MAAM;KACN,QAAQ;IACV,IACA;KACE;KACA,MAAM;KACN,QAAQ;KACR,OAAO,cAAc,cAAc;IACrC,CACR,CACF;IAEA,OAAO;GACT,SAAS,OAAO;IACd,iBACE,UAAU,KAAK,mBAAmB;KAChC;KACA,MAAM;KACN,QAAQ;KACR,OAAO,6BAA6B,cAAc,IAAI;IACxD,EAAE,CACJ;IACA,OAAO,CAAC;GACV;EACF;EAQA,QAAO,MANoBA,sCACzB,SACA,cACA,gBACF,EAEmB,CAAC,KAAK;CAC3B,SAAS,QAAQ;EACf,UAAU,GAAGC,0BAAE,wCAAwC,EAAE,OAAO,QAAQ,CAAC;EACzE,OAAO,CAAC;CACV;AACF"}

package/dist/cjs/init/frameworkSetup/tanstackStart/transforms.cjs

@@ -83,7 +83,7 @@ const setHtmlLangAndDir = (ast) => {
 		const upsertAttribute = (name, value) => {
 			const existing = node.attributes?.find((attr) => attr.type === "JSXAttribute" && attr.name?.name === name);
 			if (existing) existing.value = value;
-			else node.attributes.push(b.jsxAttribute(b.jsxIdentifier(name), value));
+			else node.attributes?.push(b.jsxAttribute(b.jsxIdentifier(name), value));
 		};
 		upsertAttribute("lang", b.jsxExpressionContainer(b.identifier("locale")));
 		upsertAttribute("dir", b.jsxExpressionContainer(b.callExpression(b.identifier("getHTMLTextDir"), [b.identifier("locale")])));

package/dist/cjs/init/frameworkSetup/tanstackStart/transforms.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"transforms.cjs","names":["babelTsParser"],"sources":["../../../../../src/init/frameworkSetup/tanstackStart/transforms.ts"],"sourcesContent":["import * as recast from 'recast';\nimport { babelTsParser } from '../../../utils/babelParser';\nimport { ensureNamedImport } from '../../utils/astImports';\n\nconst { builders: b, namedTypes: n } = recast.types;\n\n/** babel-ts parser handles TypeScript *and* JSX. */\nconst parseTsx = (code: string): any =>\n  recast.parse(code, { parser: babelTsParser });\n\n/** Result of a source transform. `code` is unchanged for any non-`wrapped` status. */\nexport type TransformResult = {\n  code: string;\n  status: 'wrapped' | 'already' | 'skipped';\n};\n\n/**\n * Finds the single function that returns the `<html>` document element. Returns\n * `null` when there is no such function, or more than one (ambiguous).\n */\nconst findHtmlDocumentFunction = (ast: any): any => {\n  const found = new Set<any>();\n\n  recast.visit(ast, {\n    visitJSXOpeningElement(path) {\n      const node = path.node;\n      if (node.name?.type === 'JSXIdentifier' && node.name.name === 'html') {\n        // Walk up to the nearest enclosing function node.\n        let current = path.parentPath;\n        while (current) {\n          const value = current.value;\n          if (\n            value &&\n            (n.FunctionDeclaration.check(value) ||\n              n.FunctionExpression.check(value) ||\n              n.ArrowFunctionExpression.check(value))\n          ) {\n            found.add(value);\n            break;\n          }\n          current = current.parentPath;\n        }\n      }\n      this.traverse(path);\n    },\n  });\n\n  return found.size === 1 ? [...found][0] : null;\n};\n\n/**\n * Whether the binding pattern `node` introduces a variable named `name`.\n * Recurses through destructuring patterns so all of `const locale`,\n * `const { locale } = …`, `const { locale = fallback } = …`,\n * `const { foo: locale } = …`, `const [locale] = …` and `...locale` are\n * detected — not just a bare identifier.\n */\nconst patternBindsName = (node: any, name: string): boolean => {\n  if (!node) return false;\n  switch (node.type) {\n    case 'Identifier':\n      return node.name === name;\n    case 'AssignmentPattern':\n      // `locale = fallback`\n      return patternBindsName(node.left, name);\n    case 'RestElement':\n      // `...locale`\n      return patternBindsName(node.argument, name);\n    case 'ArrayPattern':\n      return node.elements.some((element: any) =>\n        patternBindsName(element, name)\n      );\n    case 'ObjectPattern':\n      return node.properties.some((property: any) =>\n        property.type === 'RestElement'\n          ? patternBindsName(property.argument, name)\n          : // The *value* is the binding target (`{ foo: locale }` binds `locale`).\n            patternBindsName(property.value, name)\n      );\n    default:\n      return false;\n  }\n};\n\n/**\n * Inserts `const locale = …` once, at the top of the function body. A single\n * self-contained statement is used (rather than an intermediate `params` const)\n * so it can never collide with a `params` variable the document already\n * declares. Expression-bodied arrow functions are first converted to a block so\n * the declaration has somewhere to live.\n *\n * No-ops when `locale` is already bound in the function — whether as a simple\n * identifier, through a destructuring pattern (e.g.\n * `const { locale = defaultLocale } = useLoaderData()`), or as a function\n * parameter — so the injected declaration never collides with one the document\n * already provides (which would produce an\n * `Identifier 'locale' has already been declared` parse error).\n */\nconst ensureLocaleFromParams = (funcNode: any): void => {\n  if (funcNode.body?.type !== 'BlockStatement') {\n    funcNode.body = b.blockStatement([b.returnStatement(funcNode.body)]);\n  }\n\n  const declaredInBody = funcNode.body.body.some(\n    (stmt: any) =>\n      stmt.type === 'VariableDeclaration' &&\n      stmt.declarations.some((d: any) => patternBindsName(d.id, 'locale'))\n  );\n  const declaredInParams = (funcNode.params ?? []).some((param: any) =>\n    patternBindsName(param, 'locale')\n  );\n  if (declaredInBody || declaredInParams) return;\n\n  const statement = parseTsx(\n    'const locale = useParams({ strict: false }).locale ?? defaultLocale;'\n  ).program.body[0];\n  funcNode.body.body.unshift(statement);\n};\n\n/** Sets `lang={locale}` and `dir={getHTMLTextDir(locale)}` on the first `<html>` element. */\nconst setHtmlLangAndDir = (ast: any): void => {\n  recast.visit(ast, {\n    visitJSXOpeningElement(path) {\n      const node = path.node;\n      if (node.name?.type !== 'JSXIdentifier' || node.name.name !== 'html') {\n        this.traverse(path);\n        return;\n      }\n\n      const upsertAttribute = (name: string, value: any): void => {\n        const existing = node.attributes?.find(\n          (attr: any) =>\n            attr.type === 'JSXAttribute' && attr.name?.name === name\n        ) as any;\n        if (existing) {\n          existing.value = value;\n        } else {\n          node.attributes.push(b.jsxAttribute(b.jsxIdentifier(name), value));\n        }\n      };\n\n      upsertAttribute('lang', b.jsxExpressionContainer(b.identifier('locale')));\n      upsertAttribute(\n        'dir',\n        b.jsxExpressionContainer(\n          b.callExpression(b.identifier('getHTMLTextDir'), [\n            b.identifier('locale'),\n          ])\n        )\n      );\n      return false;\n    },\n  });\n};\n\n/**\n * Wraps the `{children}` of a TanStack Start root document with\n * `IntlayerProvider`, deriving the locale from the `{-$locale}` route param.\n * Safe and idempotent: bails (returns the original code) when the provider is\n * already present, when no `<html>` document function is found, or when there is\n * no `{children}` placeholder to wrap.\n */\nexport const wrapRootWithProvider = (code: string): TransformResult => {\n  const ast = parseTsx(code);\n\n  if (code.includes('IntlayerProvider')) return { code, status: 'already' };\n\n  const funcNode = findHtmlDocumentFunction(ast);\n  if (!funcNode) return { code, status: 'skipped' };\n\n  let wrapped = false;\n  recast.visit(funcNode, {\n    visitJSXExpressionContainer(path) {\n      if (wrapped) return false;\n      const expression = path.node.expression;\n      if (expression?.type === 'Identifier' && expression.name === 'children') {\n        const template = parseTsx(\n          'const __wrap = <IntlayerProvider locale={locale}>{__child__}</IntlayerProvider>;'\n        );\n        const providerElement = template.program.body[0].declarations[0].init;\n        providerElement.children = [path.node];\n        path.replace(providerElement);\n        wrapped = true;\n        return false;\n      }\n      this.traverse(path);\n    },\n  });\n\n  if (!wrapped) return { code, status: 'skipped' };\n\n  ensureNamedImport(ast, 'IntlayerProvider', 'react-intlayer');\n  ensureNamedImport(ast, 'useParams', '@tanstack/react-router');\n  ensureNamedImport(ast, 'defaultLocale', 'intlayer');\n  ensureNamedImport(ast, 'getHTMLTextDir', 'intlayer');\n  ensureLocaleFromParams(funcNode);\n  setHtmlLangAndDir(ast);\n\n  return { code: recast.print(ast).code, status: 'wrapped' };\n};\n"],"mappings":";;;;;;;;AAIA,MAAM,EAAE,UAAU,GAAG,YAAY,MAAM,OAAO;;AAG9C,MAAM,YAAY,SAChB,OAAO,MAAM,MAAM,EAAE,QAAQA,wCAAc,CAAC;;;;;AAY9C,MAAM,4BAA4B,QAAkB;CAClD,MAAM,wBAAQ,IAAI,IAAS;CAE3B,OAAO,MAAM,KAAK,EAChB,uBAAuB,MAAM;EAC3B,MAAM,OAAO,KAAK;EAClB,IAAI,KAAK,MAAM,SAAS,mBAAmB,KAAK,KAAK,SAAS,QAAQ;GAEpE,IAAI,UAAU,KAAK;GACnB,OAAO,SAAS;IACd,MAAM,QAAQ,QAAQ;IACtB,IACE,UACC,EAAE,oBAAoB,MAAM,KAAK,KAChC,EAAE,mBAAmB,MAAM,KAAK,KAChC,EAAE,wBAAwB,MAAM,KAAK,IACvC;KACA,MAAM,IAAI,KAAK;KACf;IACF;IACA,UAAU,QAAQ;GACpB;EACF;EACA,KAAK,SAAS,IAAI;CACpB,EACF,CAAC;CAED,OAAO,MAAM,SAAS,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC,KAAK;AAC5C;;;;;;;;AASA,MAAM,oBAAoB,MAAW,SAA0B;CAC7D,IAAI,CAAC,MAAM,OAAO;CAClB,QAAQ,KAAK,MAAb;EACE,KAAK,cACH,OAAO,KAAK,SAAS;EACvB,KAAK,qBAEH,OAAO,iBAAiB,KAAK,MAAM,IAAI;EACzC,KAAK,eAEH,OAAO,iBAAiB,KAAK,UAAU,IAAI;EAC7C,KAAK,gBACH,OAAO,KAAK,SAAS,MAAM,YACzB,iBAAiB,SAAS,IAAI,CAChC;EACF,KAAK,iBACH,OAAO,KAAK,WAAW,MAAM,aAC3B,SAAS,SAAS,gBACd,iBAAiB,SAAS,UAAU,IAAI,IAExC,iBAAiB,SAAS,OAAO,IAAI,CAC3C;EACF,SACE,OAAO;CACX;AACF;;;;;;;;;;;;;;;AAgBA,MAAM,0BAA0B,aAAwB;CACtD,IAAI,SAAS,MAAM,SAAS,kBAC1B,SAAS,OAAO,EAAE,eAAe,CAAC,EAAE,gBAAgB,SAAS,IAAI,CAAC,CAAC;CAGrE,MAAM,iBAAiB,SAAS,KAAK,KAAK,MACvC,SACC,KAAK,SAAS,yBACd,KAAK,aAAa,MAAM,MAAW,iBAAiB,EAAE,IAAI,QAAQ,CAAC,CACvE;CACA,MAAM,oBAAoB,SAAS,UAAU,CAAC,EAAC,CAAE,MAAM,UACrD,iBAAiB,OAAO,QAAQ,CAClC;CACA,IAAI,kBAAkB,kBAAkB;CAExC,MAAM,YAAY,SAChB,sEACF,CAAC,CAAC,QAAQ,KAAK;CACf,SAAS,KAAK,KAAK,QAAQ,SAAS;AACtC;;AAGA,MAAM,qBAAqB,QAAmB;CAC5C,OAAO,MAAM,KAAK,EAChB,uBAAuB,MAAM;EAC3B,MAAM,OAAO,KAAK;EAClB,IAAI,KAAK,MAAM,SAAS,mBAAmB,KAAK,KAAK,SAAS,QAAQ;GACpE,KAAK,SAAS,IAAI;GAClB;EACF;EAEA,MAAM,mBAAmB,MAAc,UAAqB;GAC1D,MAAM,WAAW,KAAK,YAAY,MAC/B,SACC,KAAK,SAAS,kBAAkB,KAAK,MAAM,SAAS,IACxD;GACA,IAAI,UACF,SAAS,QAAQ;QAEjB,KAAK,WAAW,KAAK,EAAE,aAAa,EAAE,cAAc,IAAI,GAAG,KAAK,CAAC;EAErE;EAEA,gBAAgB,QAAQ,EAAE,uBAAuB,EAAE,WAAW,QAAQ,CAAC,CAAC;EACxE,gBACE,OACA,EAAE,uBACA,EAAE,eAAe,EAAE,WAAW,gBAAgB,GAAG,CAC/C,EAAE,WAAW,QAAQ,CACvB,CAAC,CACH,CACF;EACA,OAAO;CACT,EACF,CAAC;AACH;;;;;;;;AASA,MAAa,wBAAwB,SAAkC;CACrE,MAAM,MAAM,SAAS,IAAI;CAEzB,IAAI,KAAK,SAAS,kBAAkB,GAAG,OAAO;EAAE;EAAM,QAAQ;CAAU;CAExE,MAAM,WAAW,yBAAyB,GAAG;CAC7C,IAAI,CAAC,UAAU,OAAO;EAAE;EAAM,QAAQ;CAAU;CAEhD,IAAI,UAAU;CACd,OAAO,MAAM,UAAU,EACrB,4BAA4B,MAAM;EAChC,IAAI,SAAS,OAAO;EACpB,MAAM,aAAa,KAAK,KAAK;EAC7B,IAAI,YAAY,SAAS,gBAAgB,WAAW,SAAS,YAAY;GAIvE,MAAM,kBAHW,SACf,kFAE6B,CAAC,CAAC,QAAQ,KAAK,EAAE,CAAC,aAAa,EAAE,CAAC;GACjE,gBAAgB,WAAW,CAAC,KAAK,IAAI;GACrC,KAAK,QAAQ,eAAe;GAC5B,UAAU;GACV,OAAO;EACT;EACA,KAAK,SAAS,IAAI;CACpB,EACF,CAAC;CAED,IAAI,CAAC,SAAS,OAAO;EAAE;EAAM,QAAQ;CAAU;CAE/C,gDAAkB,KAAK,oBAAoB,gBAAgB;CAC3D,gDAAkB,KAAK,aAAa,wBAAwB;CAC5D,gDAAkB,KAAK,iBAAiB,UAAU;CAClD,gDAAkB,KAAK,kBAAkB,UAAU;CACnD,uBAAuB,QAAQ;CAC/B,kBAAkB,GAAG;CAErB,OAAO;EAAE,MAAM,OAAO,MAAM,GAAG,CAAC,CAAC;EAAM,QAAQ;CAAU;AAC3D"}
+{"version":3,"file":"transforms.cjs","names":["babelTsParser"],"sources":["../../../../../src/init/frameworkSetup/tanstackStart/transforms.ts"],"sourcesContent":["import * as recast from 'recast';\nimport { babelTsParser } from '../../../utils/babelParser';\nimport { ensureNamedImport } from '../../utils/astImports';\n\nconst { builders: b, namedTypes: n } = recast.types;\n\n/** babel-ts parser handles TypeScript *and* JSX. */\nconst parseTsx = (code: string): any =>\n  recast.parse(code, { parser: babelTsParser });\n\n/** Result of a source transform. `code` is unchanged for any non-`wrapped` status. */\nexport type TransformResult = {\n  code: string;\n  status: 'wrapped' | 'already' | 'skipped';\n};\n\n/**\n * Finds the single function that returns the `<html>` document element. Returns\n * `null` when there is no such function, or more than one (ambiguous).\n */\nconst findHtmlDocumentFunction = (ast: any): any => {\n  const found = new Set<any>();\n\n  recast.visit(ast, {\n    visitJSXOpeningElement(path) {\n      const node = path.node;\n      if (node.name?.type === 'JSXIdentifier' && node.name.name === 'html') {\n        // Walk up to the nearest enclosing function node.\n        let current = path.parentPath;\n        while (current) {\n          const value = current.value;\n          if (\n            value &&\n            (n.FunctionDeclaration.check(value) ||\n              n.FunctionExpression.check(value) ||\n              n.ArrowFunctionExpression.check(value))\n          ) {\n            found.add(value);\n            break;\n          }\n          current = current.parentPath;\n        }\n      }\n      this.traverse(path);\n    },\n  });\n\n  return found.size === 1 ? [...found][0] : null;\n};\n\n/**\n * Whether the binding pattern `node` introduces a variable named `name`.\n * Recurses through destructuring patterns so all of `const locale`,\n * `const { locale } = …`, `const { locale = fallback } = …`,\n * `const { foo: locale } = …`, `const [locale] = …` and `...locale` are\n * detected — not just a bare identifier.\n */\nconst patternBindsName = (node: any, name: string): boolean => {\n  if (!node) return false;\n  switch (node.type) {\n    case 'Identifier':\n      return node.name === name;\n    case 'AssignmentPattern':\n      // `locale = fallback`\n      return patternBindsName(node.left, name);\n    case 'RestElement':\n      // `...locale`\n      return patternBindsName(node.argument, name);\n    case 'ArrayPattern':\n      return node.elements.some((element: any) =>\n        patternBindsName(element, name)\n      );\n    case 'ObjectPattern':\n      return node.properties.some((property: any) =>\n        property.type === 'RestElement'\n          ? patternBindsName(property.argument, name)\n          : // The *value* is the binding target (`{ foo: locale }` binds `locale`).\n            patternBindsName(property.value, name)\n      );\n    default:\n      return false;\n  }\n};\n\n/**\n * Inserts `const locale = …` once, at the top of the function body. A single\n * self-contained statement is used (rather than an intermediate `params` const)\n * so it can never collide with a `params` variable the document already\n * declares. Expression-bodied arrow functions are first converted to a block so\n * the declaration has somewhere to live.\n *\n * No-ops when `locale` is already bound in the function — whether as a simple\n * identifier, through a destructuring pattern (e.g.\n * `const { locale = defaultLocale } = useLoaderData()`), or as a function\n * parameter — so the injected declaration never collides with one the document\n * already provides (which would produce an\n * `Identifier 'locale' has already been declared` parse error).\n */\nconst ensureLocaleFromParams = (funcNode: any): void => {\n  if (funcNode.body?.type !== 'BlockStatement') {\n    funcNode.body = b.blockStatement([b.returnStatement(funcNode.body)]);\n  }\n\n  const declaredInBody = funcNode.body.body.some(\n    (stmt: any) =>\n      stmt.type === 'VariableDeclaration' &&\n      stmt.declarations.some((d: any) => patternBindsName(d.id, 'locale'))\n  );\n  const declaredInParams = (funcNode.params ?? []).some((param: any) =>\n    patternBindsName(param, 'locale')\n  );\n  if (declaredInBody || declaredInParams) return;\n\n  const statement = parseTsx(\n    'const locale = useParams({ strict: false }).locale ?? defaultLocale;'\n  ).program.body[0];\n  funcNode.body.body.unshift(statement);\n};\n\n/** Sets `lang={locale}` and `dir={getHTMLTextDir(locale)}` on the first `<html>` element. */\nconst setHtmlLangAndDir = (ast: any): void => {\n  recast.visit(ast, {\n    visitJSXOpeningElement(path) {\n      const node = path.node;\n      if (node.name?.type !== 'JSXIdentifier' || node.name.name !== 'html') {\n        this.traverse(path);\n        return;\n      }\n\n      const upsertAttribute = (name: string, value: any): void => {\n        const existing = node.attributes?.find(\n          (attr: any) =>\n            attr.type === 'JSXAttribute' && attr.name?.name === name\n        ) as any;\n        if (existing) {\n          existing.value = value;\n        } else {\n          node.attributes?.push(b.jsxAttribute(b.jsxIdentifier(name), value));\n        }\n      };\n\n      upsertAttribute('lang', b.jsxExpressionContainer(b.identifier('locale')));\n      upsertAttribute(\n        'dir',\n        b.jsxExpressionContainer(\n          b.callExpression(b.identifier('getHTMLTextDir'), [\n            b.identifier('locale'),\n          ])\n        )\n      );\n      return false;\n    },\n  });\n};\n\n/**\n * Wraps the `{children}` of a TanStack Start root document with\n * `IntlayerProvider`, deriving the locale from the `{-$locale}` route param.\n * Safe and idempotent: bails (returns the original code) when the provider is\n * already present, when no `<html>` document function is found, or when there is\n * no `{children}` placeholder to wrap.\n */\nexport const wrapRootWithProvider = (code: string): TransformResult => {\n  const ast = parseTsx(code);\n\n  if (code.includes('IntlayerProvider')) return { code, status: 'already' };\n\n  const funcNode = findHtmlDocumentFunction(ast);\n  if (!funcNode) return { code, status: 'skipped' };\n\n  let wrapped = false;\n  recast.visit(funcNode, {\n    visitJSXExpressionContainer(path) {\n      if (wrapped) return false;\n      const expression = path.node.expression;\n      if (expression?.type === 'Identifier' && expression.name === 'children') {\n        const template = parseTsx(\n          'const __wrap = <IntlayerProvider locale={locale}>{__child__}</IntlayerProvider>;'\n        );\n        const providerElement = template.program.body[0].declarations[0].init;\n        providerElement.children = [path.node];\n        path.replace(providerElement);\n        wrapped = true;\n        return false;\n      }\n      this.traverse(path);\n    },\n  });\n\n  if (!wrapped) return { code, status: 'skipped' };\n\n  ensureNamedImport(ast, 'IntlayerProvider', 'react-intlayer');\n  ensureNamedImport(ast, 'useParams', '@tanstack/react-router');\n  ensureNamedImport(ast, 'defaultLocale', 'intlayer');\n  ensureNamedImport(ast, 'getHTMLTextDir', 'intlayer');\n  ensureLocaleFromParams(funcNode);\n  setHtmlLangAndDir(ast);\n\n  return { code: recast.print(ast).code, status: 'wrapped' };\n};\n"],"mappings":";;;;;;;;AAIA,MAAM,EAAE,UAAU,GAAG,YAAY,MAAM,OAAO;;AAG9C,MAAM,YAAY,SAChB,OAAO,MAAM,MAAM,EAAE,QAAQA,wCAAc,CAAC;;;;;AAY9C,MAAM,4BAA4B,QAAkB;CAClD,MAAM,wBAAQ,IAAI,IAAS;CAE3B,OAAO,MAAM,KAAK,EAChB,uBAAuB,MAAM;EAC3B,MAAM,OAAO,KAAK;EAClB,IAAI,KAAK,MAAM,SAAS,mBAAmB,KAAK,KAAK,SAAS,QAAQ;GAEpE,IAAI,UAAU,KAAK;GACnB,OAAO,SAAS;IACd,MAAM,QAAQ,QAAQ;IACtB,IACE,UACC,EAAE,oBAAoB,MAAM,KAAK,KAChC,EAAE,mBAAmB,MAAM,KAAK,KAChC,EAAE,wBAAwB,MAAM,KAAK,IACvC;KACA,MAAM,IAAI,KAAK;KACf;IACF;IACA,UAAU,QAAQ;GACpB;EACF;EACA,KAAK,SAAS,IAAI;CACpB,EACF,CAAC;CAED,OAAO,MAAM,SAAS,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC,KAAK;AAC5C;;;;;;;;AASA,MAAM,oBAAoB,MAAW,SAA0B;CAC7D,IAAI,CAAC,MAAM,OAAO;CAClB,QAAQ,KAAK,MAAb;EACE,KAAK,cACH,OAAO,KAAK,SAAS;EACvB,KAAK,qBAEH,OAAO,iBAAiB,KAAK,MAAM,IAAI;EACzC,KAAK,eAEH,OAAO,iBAAiB,KAAK,UAAU,IAAI;EAC7C,KAAK,gBACH,OAAO,KAAK,SAAS,MAAM,YACzB,iBAAiB,SAAS,IAAI,CAChC;EACF,KAAK,iBACH,OAAO,KAAK,WAAW,MAAM,aAC3B,SAAS,SAAS,gBACd,iBAAiB,SAAS,UAAU,IAAI,IAExC,iBAAiB,SAAS,OAAO,IAAI,CAC3C;EACF,SACE,OAAO;CACX;AACF;;;;;;;;;;;;;;;AAgBA,MAAM,0BAA0B,aAAwB;CACtD,IAAI,SAAS,MAAM,SAAS,kBAC1B,SAAS,OAAO,EAAE,eAAe,CAAC,EAAE,gBAAgB,SAAS,IAAI,CAAC,CAAC;CAGrE,MAAM,iBAAiB,SAAS,KAAK,KAAK,MACvC,SACC,KAAK,SAAS,yBACd,KAAK,aAAa,MAAM,MAAW,iBAAiB,EAAE,IAAI,QAAQ,CAAC,CACvE;CACA,MAAM,oBAAoB,SAAS,UAAU,CAAC,EAAC,CAAE,MAAM,UACrD,iBAAiB,OAAO,QAAQ,CAClC;CACA,IAAI,kBAAkB,kBAAkB;CAExC,MAAM,YAAY,SAChB,sEACF,CAAC,CAAC,QAAQ,KAAK;CACf,SAAS,KAAK,KAAK,QAAQ,SAAS;AACtC;;AAGA,MAAM,qBAAqB,QAAmB;CAC5C,OAAO,MAAM,KAAK,EAChB,uBAAuB,MAAM;EAC3B,MAAM,OAAO,KAAK;EAClB,IAAI,KAAK,MAAM,SAAS,mBAAmB,KAAK,KAAK,SAAS,QAAQ;GACpE,KAAK,SAAS,IAAI;GAClB;EACF;EAEA,MAAM,mBAAmB,MAAc,UAAqB;GAC1D,MAAM,WAAW,KAAK,YAAY,MAC/B,SACC,KAAK,SAAS,kBAAkB,KAAK,MAAM,SAAS,IACxD;GACA,IAAI,UACF,SAAS,QAAQ;QAEjB,KAAK,YAAY,KAAK,EAAE,aAAa,EAAE,cAAc,IAAI,GAAG,KAAK,CAAC;EAEtE;EAEA,gBAAgB,QAAQ,EAAE,uBAAuB,EAAE,WAAW,QAAQ,CAAC,CAAC;EACxE,gBACE,OACA,EAAE,uBACA,EAAE,eAAe,EAAE,WAAW,gBAAgB,GAAG,CAC/C,EAAE,WAAW,QAAQ,CACvB,CAAC,CACH,CACF;EACA,OAAO;CACT,EACF,CAAC;AACH;;;;;;;;AASA,MAAa,wBAAwB,SAAkC;CACrE,MAAM,MAAM,SAAS,IAAI;CAEzB,IAAI,KAAK,SAAS,kBAAkB,GAAG,OAAO;EAAE;EAAM,QAAQ;CAAU;CAExE,MAAM,WAAW,yBAAyB,GAAG;CAC7C,IAAI,CAAC,UAAU,OAAO;EAAE;EAAM,QAAQ;CAAU;CAEhD,IAAI,UAAU;CACd,OAAO,MAAM,UAAU,EACrB,4BAA4B,MAAM;EAChC,IAAI,SAAS,OAAO;EACpB,MAAM,aAAa,KAAK,KAAK;EAC7B,IAAI,YAAY,SAAS,gBAAgB,WAAW,SAAS,YAAY;GAIvE,MAAM,kBAHW,SACf,kFAE6B,CAAC,CAAC,QAAQ,KAAK,EAAE,CAAC,aAAa,EAAE,CAAC;GACjE,gBAAgB,WAAW,CAAC,KAAK,IAAI;GACrC,KAAK,QAAQ,eAAe;GAC5B,UAAU;GACV,OAAO;EACT;EACA,KAAK,SAAS,IAAI;CACpB,EACF,CAAC;CAED,IAAI,CAAC,SAAS,OAAO;EAAE;EAAM,QAAQ;CAAU;CAE/C,gDAAkB,KAAK,oBAAoB,gBAAgB;CAC3D,gDAAkB,KAAK,aAAa,wBAAwB;CAC5D,gDAAkB,KAAK,iBAAiB,UAAU;CAClD,gDAAkB,KAAK,kBAAkB,UAAU;CACnD,uBAAuB,QAAQ;CAC/B,kBAAkB,GAAG;CAErB,OAAO;EAAE,MAAM,OAAO,MAAM,GAAG,CAAC,CAAC;EAAM,QAAQ;CAAU;AAC3D"}