@intlayer/cli 5.5.10 → 5.5.11

package/dist/esm/utils/calculateChunks.mjs

@@ -0,0 +1,96 @@
+import { splitTextByLines } from "./splitTextByLine.mjs";
+const DEFAULT_MAX_CHARS_PER_CHUNK = 800;
+const DEFAULT_OVERLAP_CHARS = 0;
+const chunkText = (text, maxCharsPerChunk = DEFAULT_MAX_CHARS_PER_CHUNK, overlapChars = DEFAULT_OVERLAP_CHARS) => {
+  if (maxCharsPerChunk <= 0) {
+    throw new Error("maxCharsPerChunk must be greater than 0");
+  }
+  const splittedText = splitTextByLines(text);
+  const lines = [];
+  let charStartAcc = 0;
+  splittedText.forEach((line, index) => {
+    lines.push({
+      content: line,
+      lineStart: index,
+      lineLength: 1,
+      charStart: charStartAcc,
+      charLength: line.length
+    });
+    charStartAcc += line.length;
+  });
+  const groupedLines = lines.reduce(
+    (acc, line) => {
+      if (line.content.length > maxCharsPerChunk) {
+        acc.push(line);
+        return acc;
+      }
+      if (acc.length === 0) {
+        acc.push(line);
+        return acc;
+      }
+      const lastChunk = acc[acc.length - 1];
+      const combinedLength = lastChunk.content.length + line.content.length;
+      if (combinedLength > maxCharsPerChunk) {
+        acc.push(line);
+        return acc;
+      }
+      const combinedContent = lastChunk.content + line.content;
+      const updatedChunk = {
+        content: combinedContent,
+        lineStart: lastChunk.lineStart,
+        lineLength: lastChunk.lineLength + line.lineLength,
+        charStart: lastChunk.charStart,
+        charLength: combinedContent.length
+      };
+      acc[acc.length - 1] = updatedChunk;
+      return acc;
+    },
+    []
+  );
+  const splittedLines = groupedLines.flatMap((line) => {
+    const chunk = [];
+    if (line.content.length <= maxCharsPerChunk) {
+      chunk.push(line);
+      return chunk;
+    }
+    for (let i = 0; i < line.content.length; i += maxCharsPerChunk) {
+      const slicedContent = line.content.slice(i, i + maxCharsPerChunk);
+      chunk.push({
+        content: slicedContent,
+        lineStart: line.lineStart,
+        lineLength: 1,
+        charStart: line.charStart + i,
+        charLength: slicedContent.length
+      });
+    }
+    return chunk;
+  });
+  if (overlapChars === 0) return splittedLines;
+  const overlapChunks = splittedLines.length > 0 ? [splittedLines[0]] : [];
+  for (let i = 1; i < splittedLines.length; i++) {
+    const previousChunk = splittedLines[i - 1];
+    const chunk = splittedLines[i];
+    const overlapContent = previousChunk.content.slice(-overlapChars);
+    const overlapLineNb = splitTextByLines(overlapContent).length;
+    const overlapContentWithoutPartialLine = overlapContent.slice(
+      overlapLineNb > 1 ? overlapContent.indexOf("\n") + 1 : 0,
+      overlapContent.length
+    );
+    const newContent = overlapContentWithoutPartialLine + chunk.content;
+    const newLineLength = splitTextByLines(newContent).length;
+    const lineDiff = chunk.lineLength - newLineLength;
+    const overlappedChunk = {
+      content: newContent,
+      lineStart: chunk.lineStart + lineDiff,
+      lineLength: chunk.lineLength - lineDiff,
+      charStart: chunk.charStart - overlapContentWithoutPartialLine.length,
+      charLength: newContent.length
+    };
+    overlapChunks.push(overlappedChunk);
+  }
+  return overlapChunks;
+};
+export {
+  chunkText
+};
+//# sourceMappingURL=calculateChunks.mjs.map

package/dist/esm/utils/calculateChunks.mjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../src/utils/calculateChunks.ts"],"sourcesContent":["import { splitTextByLines } from './splitTextByLine';\n\nexport type ChunkLineResult = {\n  lineStart: number;\n  lineLength: number;\n  charStart: number;\n  charLength: number;\n  content: string;\n};\n\nconst DEFAULT_MAX_CHARS_PER_CHUNK = 800;\nconst DEFAULT_OVERLAP_CHARS = 0;\n\nexport const chunkText = (\n  text: string,\n  maxCharsPerChunk: number = DEFAULT_MAX_CHARS_PER_CHUNK,\n  overlapChars: number = DEFAULT_OVERLAP_CHARS\n): ChunkLineResult[] => {\n  if (maxCharsPerChunk <= 0) {\n    throw new Error('maxCharsPerChunk must be greater than 0');\n  }\n\n  const splittedText = splitTextByLines(text);\n\n  // Split text into lines to faciliate the translation\n  const lines: ChunkLineResult[] = [];\n  let charStartAcc = 0;\n\n  splittedText.forEach((line, index) => {\n    lines.push({\n      content: line,\n      lineStart: index,\n      lineLength: 1,\n      charStart: charStartAcc,\n      charLength: line.length,\n    });\n    charStartAcc += line.length;\n  });\n\n  // Group lines\n  // as long as the chunk length is less than maxCharsPerChunk\n  // if a line longer than maxCharsPerChunk, keep it alone\n  // if a line is not longer than maxCharsPerChunk, it is grouped\n  const groupedLines: ChunkLineResult[] = lines.reduce(\n    (acc: ChunkLineResult[], line) => {\n      // If this line alone exceeds maxCharsPerChunk, keep it separate\n      if (line.content.length > maxCharsPerChunk) {\n        acc.push(line);\n        return acc;\n      }\n\n      // If we have no chunks yet, start with this line\n      if (acc.length === 0) {\n        acc.push(line);\n        return acc;\n      }\n\n      // Get the last chunk\n      const lastChunk = acc[acc.length - 1];\n\n      // Calculate what the combined length would be (including newline character)\n      const combinedLength = lastChunk.content.length + line.content.length;\n\n      // If combining would exceed the limit, start a new chunk\n      if (combinedLength > maxCharsPerChunk) {\n        acc.push(line);\n        return acc;\n      }\n\n      // Otherwise, combine with the last chunk\n      const combinedContent = lastChunk.content + line.content;\n      const updatedChunk = {\n        content: combinedContent,\n        lineStart: lastChunk.lineStart,\n        lineLength: lastChunk.lineLength + line.lineLength,\n        charStart: lastChunk.charStart,\n        charLength: combinedContent.length,\n      };\n\n      acc[acc.length - 1] = updatedChunk;\n      return acc;\n    },\n    []\n  );\n\n  // If one line is longer than maxCharsPerChunk, split it into multiple chunks\n  const splittedLines: ChunkLineResult[] = groupedLines.flatMap((line) => {\n    const chunk: ChunkLineResult[] = [];\n\n    if (line.content.length <= maxCharsPerChunk) {\n      chunk.push(line);\n      return chunk;\n    }\n\n    for (let i = 0; i < line.content.length; i += maxCharsPerChunk) {\n      const slicedContent = line.content.slice(i, i + maxCharsPerChunk);\n      chunk.push({\n        content: slicedContent,\n        lineStart: line.lineStart,\n        lineLength: 1,\n        charStart: line.charStart + i,\n        charLength: slicedContent.length,\n      });\n    }\n    return chunk;\n  });\n\n  if (overlapChars === 0) return splittedLines;\n\n  const overlapChunks: ChunkLineResult[] =\n    splittedLines.length > 0 ? [splittedLines[0]] : [];\n\n  for (let i = 1; i < splittedLines.length; i++) {\n    const previousChunk = splittedLines[i - 1];\n    const chunk = splittedLines[i];\n\n    const overlapContent = previousChunk.content.slice(-overlapChars);\n    const overlapLineNb = splitTextByLines(overlapContent).length;\n\n    const overlapContentWithoutPartialLine = overlapContent.slice(\n      overlapLineNb > 1 ? overlapContent.indexOf('\\n') + 1 : 0,\n      overlapContent.length\n    );\n\n    const newContent = overlapContentWithoutPartialLine + chunk.content;\n    const newLineLength = splitTextByLines(newContent).length;\n    const lineDiff = chunk.lineLength - newLineLength;\n\n    const overlappedChunk = {\n      content: newContent,\n      lineStart: chunk.lineStart + lineDiff,\n      lineLength: chunk.lineLength - lineDiff,\n      charStart: chunk.charStart - overlapContentWithoutPartialLine.length,\n      charLength: newContent.length,\n    };\n\n    overlapChunks.push(overlappedChunk);\n  }\n\n  return overlapChunks;\n};\n"],"mappings":"AAAA,SAAS,wBAAwB;AAUjC,MAAM,8BAA8B;AACpC,MAAM,wBAAwB;AAEvB,MAAM,YAAY,CACvB,MACA,mBAA2B,6BAC3B,eAAuB,0BACD;AACtB,MAAI,oBAAoB,GAAG;AACzB,UAAM,IAAI,MAAM,yCAAyC;AAAA,EAC3D;AAEA,QAAM,eAAe,iBAAiB,IAAI;AAG1C,QAAM,QAA2B,CAAC;AAClC,MAAI,eAAe;AAEnB,eAAa,QAAQ,CAAC,MAAM,UAAU;AACpC,UAAM,KAAK;AAAA,MACT,SAAS;AAAA,MACT,WAAW;AAAA,MACX,YAAY;AAAA,MACZ,WAAW;AAAA,MACX,YAAY,KAAK;AAAA,IACnB,CAAC;AACD,oBAAgB,KAAK;AAAA,EACvB,CAAC;AAMD,QAAM,eAAkC,MAAM;AAAA,IAC5C,CAAC,KAAwB,SAAS;AAEhC,UAAI,KAAK,QAAQ,SAAS,kBAAkB;AAC1C,YAAI,KAAK,IAAI;AACb,eAAO;AAAA,MACT;AAGA,UAAI,IAAI,WAAW,GAAG;AACpB,YAAI,KAAK,IAAI;AACb,eAAO;AAAA,MACT;AAGA,YAAM,YAAY,IAAI,IAAI,SAAS,CAAC;AAGpC,YAAM,iBAAiB,UAAU,QAAQ,SAAS,KAAK,QAAQ;AAG/D,UAAI,iBAAiB,kBAAkB;AACrC,YAAI,KAAK,IAAI;AACb,eAAO;AAAA,MACT;AAGA,YAAM,kBAAkB,UAAU,UAAU,KAAK;AACjD,YAAM,eAAe;AAAA,QACnB,SAAS;AAAA,QACT,WAAW,UAAU;AAAA,QACrB,YAAY,UAAU,aAAa,KAAK;AAAA,QACxC,WAAW,UAAU;AAAA,QACrB,YAAY,gBAAgB;AAAA,MAC9B;AAEA,UAAI,IAAI,SAAS,CAAC,IAAI;AACtB,aAAO;AAAA,IACT;AAAA,IACA,CAAC;AAAA,EACH;AAGA,QAAM,gBAAmC,aAAa,QAAQ,CAAC,SAAS;AACtE,UAAM,QAA2B,CAAC;AAElC,QAAI,KAAK,QAAQ,UAAU,kBAAkB;AAC3C,YAAM,KAAK,IAAI;AACf,aAAO;AAAA,IACT;AAEA,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,QAAQ,KAAK,kBAAkB;AAC9D,YAAM,gBAAgB,KAAK,QAAQ,MAAM,GAAG,IAAI,gBAAgB;AAChE,YAAM,KAAK;AAAA,QACT,SAAS;AAAA,QACT,WAAW,KAAK;AAAA,QAChB,YAAY;AAAA,QACZ,WAAW,KAAK,YAAY;AAAA,QAC5B,YAAY,cAAc;AAAA,MAC5B,CAAC;AAAA,IACH;AACA,WAAO;AAAA,EACT,CAAC;AAED,MAAI,iBAAiB,EAAG,QAAO;AAE/B,QAAM,gBACJ,cAAc,SAAS,IAAI,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC;AAEnD,WAAS,IAAI,GAAG,IAAI,cAAc,QAAQ,KAAK;AAC7C,UAAM,gBAAgB,cAAc,IAAI,CAAC;AACzC,UAAM,QAAQ,cAAc,CAAC;AAE7B,UAAM,iBAAiB,cAAc,QAAQ,MAAM,CAAC,YAAY;AAChE,UAAM,gBAAgB,iBAAiB,cAAc,EAAE;AAEvD,UAAM,mCAAmC,eAAe;AAAA,MACtD,gBAAgB,IAAI,eAAe,QAAQ,IAAI,IAAI,IAAI;AAAA,MACvD,eAAe;AAAA,IACjB;AAEA,UAAM,aAAa,mCAAmC,MAAM;AAC5D,UAAM,gBAAgB,iBAAiB,UAAU,EAAE;AACnD,UAAM,WAAW,MAAM,aAAa;AAEpC,UAAM,kBAAkB;AAAA,MACtB,SAAS;AAAA,MACT,WAAW,MAAM,YAAY;AAAA,MAC7B,YAAY,MAAM,aAAa;AAAA,MAC/B,WAAW,MAAM,YAAY,iCAAiC;AAAA,MAC9D,YAAY,WAAW;AAAA,IACzB;AAEA,kBAAc,KAAK,eAAe;AAAA,EACpC;AAEA,SAAO;AACT;","names":[]}

package/dist/esm/utils/calculateChunks.test.mjs

@@ -0,0 +1,103 @@
+import { readFileSync } from "fs";
+import { join } from "path";
+import { describe, expect, it } from "vitest";
+import { chunkText } from "./calculateChunks.mjs";
+import { getChunk } from "./getChunk.mjs";
+const sampleText = [
+  "Line 0: The quick brown fox jumps over the lazy dog.",
+  "Line 1: Pack my box with five dozen liquor jugs.",
+  "Line 2: How razorback-jumping frogs can level six piqued gymnasts!",
+  "Line 3: 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 19. 20. 21. 22. 23. 24. 25. 26. 27. 28. 29. 30. 31. 32. 33. 34. 35. 36. 37. 38. 39. 40. 41. 42. 43. 44. 45. 46. 47. 48. 49. 50. 51. 52. 53. 54. 55. 56. 57. 58. 59. 60. ",
+  "Line 4: A mad boxer shot a quick, gloved jab to the jaw of his dizzy opponent."
+].join("\n");
+describe("calculateChunks", () => {
+  it.skip("creates chunks with custom parameters", () => {
+    const chunks = chunkText(sampleText, 200);
+    expect(chunks).toStrictEqual([
+      {
+        content: "Line 0: The quick brown fox jumps over the lazy dog.\nLine 1: Pack my box with five dozen liquor jugs.\nLine 2: How razorback-jumping frogs can level six piqued gymnasts!",
+        lineStart: 0,
+        lineEnd: 2,
+        charStart: 0,
+        charEnd: 167
+      },
+      {
+        content: "Line 3: 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 19. 20. 21. 22. 23. 24. 25. 26. 27. 28. 29. 30. 31. 32. 33. 34. 35. 36. 37. 38. 39. 40. 41. 42. 43. 44. 45. 46. 47. 48. 49. 50. 5",
+        lineStart: 3,
+        lineEnd: 3,
+        charStart: 0,
+        charEnd: 199
+      },
+      {
+        content: "1. 52. 53. 54. 55. 56. 57. 58. 59. 60. ",
+        lineStart: 3,
+        lineEnd: 3,
+        charStart: 200,
+        charEnd: 238
+      },
+      {
+        content: "Line 4: A mad boxer shot a quick, gloved jab to the jaw of his dizzy opponent.",
+        lineStart: 4,
+        lineEnd: 4,
+        charStart: 0,
+        charEnd: 77
+      }
+    ]);
+  });
+  it("creates chunks with overlap", () => {
+    const chunks = chunkText(sampleText, 200, 100);
+    expect(chunks).toStrictEqual([
+      {
+        content: "Line 0: The quick brown fox jumps over the lazy dog.\nLine 1: Pack my box with five dozen liquor jugs.\nLine 2: How razorback-jumping frogs can level six piqued gymnasts!\n",
+        lineStart: 0,
+        lineLength: 3,
+        charStart: 0,
+        charLength: 169
+      },
+      {
+        content: "Line 2: How razorback-jumping frogs can level six piqued gymnasts!\nLine 3: 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 19. 20. 21. 22. 23. 24. 25. 26. 27. 28. 29. 30. 31. 32. 33. 34. 35. 36. 37. 38. 39. 40. 41. 42. 43. 44. 45. 46. 47. 48. 49. 50. 5",
+        lineStart: 2,
+        lineLength: 2,
+        charStart: 102,
+        charLength: 267
+      },
+      {
+        content: "6. 27. 28. 29. 30. 31. 32. 33. 34. 35. 36. 37. 38. 39. 40. 41. 42. 43. 44. 45. 46. 47. 48. 49. 50. 51. 52. 53. 54. 55. 56. 57. 58. 59. 60. \n",
+        lineStart: 3,
+        lineLength: 1,
+        charStart: 269,
+        charLength: 140
+      },
+      {
+        content: "1. 52. 53. 54. 55. 56. 57. 58. 59. 60. \nLine 4: A mad boxer shot a quick, gloved jab to the jaw of his dizzy opponent.",
+        lineStart: 3,
+        lineLength: 2,
+        charStart: 369,
+        charLength: 118
+      }
+    ]);
+  });
+  it("Line and char stats correspond", () => {
+    const chunks = chunkText(sampleText, 200, 100);
+    const firstChunk = chunks[0];
+    const thirdChunk = chunks[2];
+    const retrievedFirstChunk = getChunk(sampleText, firstChunk);
+    const retrievedThirdChunk = getChunk(sampleText, thirdChunk);
+    expect(retrievedFirstChunk).toBe(firstChunk.content);
+    expect(retrievedThirdChunk).toBe(thirdChunk.content);
+  });
+  it("Validates chunking with real file content", () => {
+    const fileContent = readFileSync(
+      join(__dirname, "./calculrateChunkTest.md"),
+      "utf-8"
+    );
+    const chunks = chunkText(fileContent, 200, 100);
+    const firstChunk = chunks[8];
+    const thirdChunk = chunks[25];
+    const retrievedFirstChunk = getChunk(fileContent, firstChunk);
+    const retrievedThirdChunk = getChunk(fileContent, thirdChunk);
+    expect(retrievedFirstChunk).toBe(firstChunk.content);
+    expect(retrievedThirdChunk).toBe(thirdChunk.content);
+  });
+});
+//# sourceMappingURL=calculateChunks.test.mjs.map

package/dist/esm/utils/calculateChunks.test.mjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../src/utils/calculateChunks.test.ts"],"sourcesContent":["import { readFileSync } from 'fs';\nimport { join } from 'path';\nimport { describe, expect, it } from 'vitest';\nimport { chunkText } from './calculateChunks';\nimport { getChunk } from './getChunk';\n\n// Sample multiline string reused across test cases\nconst sampleText = [\n  'Line 0: The quick brown fox jumps over the lazy dog.',\n  'Line 1: Pack my box with five dozen liquor jugs.',\n  'Line 2: How razorback-jumping frogs can level six piqued gymnasts!',\n  'Line 3: 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 19. 20. 21. 22. 23. 24. 25. 26. 27. 28. 29. 30. 31. 32. 33. 34. 35. 36. 37. 38. 39. 40. 41. 42. 43. 44. 45. 46. 47. 48. 49. 50. 51. 52. 53. 54. 55. 56. 57. 58. 59. 60. ',\n  'Line 4: A mad boxer shot a quick, gloved jab to the jaw of his dizzy opponent.',\n].join('\\n');\n\ndescribe('calculateChunks', () => {\n  it.skip('creates chunks with custom parameters', () => {\n    const chunks = chunkText(sampleText, 200);\n\n    expect(chunks).toStrictEqual([\n      {\n        content:\n          'Line 0: The quick brown fox jumps over the lazy dog.\\n' +\n          'Line 1: Pack my box with five dozen liquor jugs.\\n' +\n          'Line 2: How razorback-jumping frogs can level six piqued gymnasts!',\n        lineStart: 0,\n        lineEnd: 2,\n        charStart: 0,\n        charEnd: 167,\n      },\n      {\n        content:\n          'Line 3: 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 19. 20. 21. 22. 23. 24. 25. 26. 27. 28. 29. 30. 31. 32. 33. 34. 35. 36. 37. 38. 39. 40. 41. 42. 43. 44. 45. 46. 47. 48. 49. 50. 5',\n        lineStart: 3,\n        lineEnd: 3,\n        charStart: 0,\n        charEnd: 199,\n      },\n      {\n        content: '1. 52. 53. 54. 55. 56. 57. 58. 59. 60. ',\n        lineStart: 3,\n        lineEnd: 3,\n        charStart: 200,\n        charEnd: 238,\n      },\n      {\n        content:\n          'Line 4: A mad boxer shot a quick, gloved jab to the jaw of his dizzy opponent.',\n        lineStart: 4,\n        lineEnd: 4,\n        charStart: 0,\n        charEnd: 77,\n      },\n    ]);\n  });\n\n  it('creates chunks with overlap', () => {\n    const chunks = chunkText(sampleText, 200, 100);\n\n    expect(chunks).toStrictEqual([\n      {\n        content:\n          'Line 0: The quick brown fox jumps over the lazy dog.\\n' +\n          'Line 1: Pack my box with five dozen liquor jugs.\\n' +\n          'Line 2: How razorback-jumping frogs can level six piqued gymnasts!\\n',\n        lineStart: 0,\n        lineLength: 3,\n        charStart: 0,\n        charLength: 169,\n      },\n      {\n        content:\n          'Line 2: How razorback-jumping frogs can level six piqued gymnasts!\\n' +\n          'Line 3: 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 19. 20. 21. 22. 23. 24. 25. 26. 27. 28. 29. 30. 31. 32. 33. 34. 35. 36. 37. 38. 39. 40. 41. 42. 43. 44. 45. 46. 47. 48. 49. 50. 5',\n        lineStart: 2,\n        lineLength: 2,\n        charStart: 102,\n        charLength: 267,\n      },\n      {\n        content:\n          '6. 27. 28. 29. 30. 31. 32. 33. 34. 35. 36. 37. 38. 39. 40. 41. 42. 43. 44. 45. 46. 47. 48. 49. 50. 51. 52. 53. 54. 55. 56. 57. 58. 59. 60. \\n',\n        lineStart: 3,\n        lineLength: 1,\n        charStart: 269,\n        charLength: 140,\n      },\n      {\n        content:\n          '1. 52. 53. 54. 55. 56. 57. 58. 59. 60. \\n' +\n          'Line 4: A mad boxer shot a quick, gloved jab to the jaw of his dizzy opponent.',\n        lineStart: 3,\n        lineLength: 2,\n        charStart: 369,\n        charLength: 118,\n      },\n    ]);\n  });\n\n  it('Line and char stats correspond', () => {\n    const chunks = chunkText(sampleText, 200, 100);\n\n    const firstChunk = chunks[0];\n    const thirdChunk = chunks[2];\n\n    const retrievedFirstChunk = getChunk(sampleText, firstChunk);\n    const retrievedThirdChunk = getChunk(sampleText, thirdChunk);\n\n    expect(retrievedFirstChunk).toBe(firstChunk.content);\n    expect(retrievedThirdChunk).toBe(thirdChunk.content);\n  });\n\n  it('Validates chunking with real file content', () => {\n    const fileContent = readFileSync(\n      join(__dirname, './calculrateChunkTest.md'),\n      'utf-8'\n    );\n\n    const chunks = chunkText(fileContent, 200, 100);\n\n    const firstChunk = chunks[8];\n    const thirdChunk = chunks[25];\n\n    const retrievedFirstChunk = getChunk(fileContent, firstChunk);\n    const retrievedThirdChunk = getChunk(fileContent, thirdChunk);\n\n    expect(retrievedFirstChunk).toBe(firstChunk.content);\n    expect(retrievedThirdChunk).toBe(thirdChunk.content);\n  });\n});\n"],"mappings":"AAAA,SAAS,oBAAoB;AAC7B,SAAS,YAAY;AACrB,SAAS,UAAU,QAAQ,UAAU;AACrC,SAAS,iBAAiB;AAC1B,SAAS,gBAAgB;AAGzB,MAAM,aAAa;AAAA,EACjB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,EAAE,KAAK,IAAI;AAEX,SAAS,mBAAmB,MAAM;AAChC,KAAG,KAAK,yCAAyC,MAAM;AACrD,UAAM,SAAS,UAAU,YAAY,GAAG;AAExC,WAAO,MAAM,EAAE,cAAc;AAAA,MAC3B;AAAA,QACE,SACE;AAAA,QAGF,WAAW;AAAA,QACX,SAAS;AAAA,QACT,WAAW;AAAA,QACX,SAAS;AAAA,MACX;AAAA,MACA;AAAA,QACE,SACE;AAAA,QACF,WAAW;AAAA,QACX,SAAS;AAAA,QACT,WAAW;AAAA,QACX,SAAS;AAAA,MACX;AAAA,MACA;AAAA,QACE,SAAS;AAAA,QACT,WAAW;AAAA,QACX,SAAS;AAAA,QACT,WAAW;AAAA,QACX,SAAS;AAAA,MACX;AAAA,MACA;AAAA,QACE,SACE;AAAA,QACF,WAAW;AAAA,QACX,SAAS;AAAA,QACT,WAAW;AAAA,QACX,SAAS;AAAA,MACX;AAAA,IACF,CAAC;AAAA,EACH,CAAC;AAED,KAAG,+BAA+B,MAAM;AACtC,UAAM,SAAS,UAAU,YAAY,KAAK,GAAG;AAE7C,WAAO,MAAM,EAAE,cAAc;AAAA,MAC3B;AAAA,QACE,SACE;AAAA,QAGF,WAAW;AAAA,QACX,YAAY;AAAA,QACZ,WAAW;AAAA,QACX,YAAY;AAAA,MACd;AAAA,MACA;AAAA,QACE,SACE;AAAA,QAEF,WAAW;AAAA,QACX,YAAY;AAAA,QACZ,WAAW;AAAA,QACX,YAAY;AAAA,MACd;AAAA,MACA;AAAA,QACE,SACE;AAAA,QACF,WAAW;AAAA,QACX,YAAY;AAAA,QACZ,WAAW;AAAA,QACX,YAAY;AAAA,MACd;AAAA,MACA;AAAA,QACE,SACE;AAAA,QAEF,WAAW;AAAA,QACX,YAAY;AAAA,QACZ,WAAW;AAAA,QACX,YAAY;AAAA,MACd;AAAA,IACF,CAAC;AAAA,EACH,CAAC;AAED,KAAG,kCAAkC,MAAM;AACzC,UAAM,SAAS,UAAU,YAAY,KAAK,GAAG;AAE7C,UAAM,aAAa,OAAO,CAAC;AAC3B,UAAM,aAAa,OAAO,CAAC;AAE3B,UAAM,sBAAsB,SAAS,YAAY,UAAU;AAC3D,UAAM,sBAAsB,SAAS,YAAY,UAAU;AAE3D,WAAO,mBAAmB,EAAE,KAAK,WAAW,OAAO;AACnD,WAAO,mBAAmB,EAAE,KAAK,WAAW,OAAO;AAAA,EACrD,CAAC;AAED,KAAG,6CAA6C,MAAM;AACpD,UAAM,cAAc;AAAA,MAClB,KAAK,WAAW,0BAA0B;AAAA,MAC1C;AAAA,IACF;AAEA,UAAM,SAAS,UAAU,aAAa,KAAK,GAAG;AAE9C,UAAM,aAAa,OAAO,CAAC;AAC3B,UAAM,aAAa,OAAO,EAAE;AAE5B,UAAM,sBAAsB,SAAS,aAAa,UAAU;AAC5D,UAAM,sBAAsB,SAAS,aAAa,UAAU;AAE5D,WAAO,mBAAmB,EAAE,KAAK,WAAW,OAAO;AACnD,WAAO,mBAAmB,EAAE,KAAK,WAAW,OAAO;AAAA,EACrD,CAAC;AACH,CAAC;","names":[]}

package/dist/esm/utils/calculrateChunkTest.md

@@ -0,0 +1,9 @@
+Lorem ipsum dolor sit amet consectetur adipiscing elit. Blandit quis suspendisse aliquet nisi sodales consequat magna. Sem placerat in id cursus mi pretium tellus. Finibus facilisis dapibus etiam interdum tortor ligula congue. Sed diam urna tempor pulvinar vivamus fringilla lacus. Porta elementum a enim euismod quam justo lectus. Nisl malesuada lacinia integer nunc posuere ut hendrerit. Imperdiet mollis nullam volutpat porttitor ullamcorper rutrum gravida. Ad litora torquent per conubia nostra inceptos himenaeos. Ornare sagittis vehicula praesent dui felis venenatis ultrices. Dis parturient montes nascetur ridiculus mus donec rhoncus. Potenti ultricies habitant morbi senectus netus suscipit auctor. Maximus eget fermentum odio phasellus non purus est. Platea dictumst lorem ipsum dolor sit amet consectetur. Dictum risus blandit quis suspendisse aliquet nisi sodales. Vitae pellentesque sem placerat in id cursus mi. Luctus nibh finibus facilisis dapibus etiam interdum tortor. Eu aenean sed diam urna tempor pulvinar vivamus. Tincidunt nam porta elementum a enim euismod quam. Iaculis massa nisl malesuada lacinia integer nunc posuere. Velit aliquam imperdiet mollis nullam volutpat porttitor ullamcorper. Taciti sociosqu ad litora torquent per conubia nostra.
+
+Primis vulputate ornare sagittis vehicula praesent dui felis. Et magnis dis parturient montes nascetur ridiculus mus. Accumsan maecenas potenti ultricies habitant morbi senectus netus. Mattis scelerisque maximus eget fermentum odio phasellus non. Hac habitasse platea dictumst lorem ipsum dolor sit. Vestibulum fusce dictum risus blandit quis suspendisse aliquet. Ex sapien vitae pellentesque sem placerat in id. Neque at luctus nibh finibus facilisis dapibus etiam. Tempus leo eu aenean sed diam urna tempor. Viverra ac tincidunt nam porta elementum a enim. Bibendum egestas iaculis massa nisl malesuada lacinia integer. Arcu dignissim velit aliquam imperdiet mollis nullam volutpat. Class aptent taciti sociosqu ad litora torquent per. Turpis fames primis vulputate ornare sagittis vehicula praesent. Natoque penatibus et magnis dis parturient montes nascetur. Feugiat tristique accumsan maecenas potenti ultricies habitant morbi. Nulla molestie mattis scelerisque maximus eget fermentum odio. Cubilia curae hac habitasse platea dictumst lorem ipsum. Mauris pharetra vestibulum fusce dictum risus blandit quis. Quisque faucibus ex sapien vitae pellentesque sem placerat. Ante condimentum neque at luctus nibh finibus facilisis. Duis convallis tempus leo eu aenean sed diam. Sollicitudin erat viverra ac tincidunt nam porta elementum. Nec metus bibendum egestas iaculis massa nisl malesuada.
+
+Commodo augue arcu dignissim velit aliquam imperdiet mollis. Semper vel class aptent taciti sociosqu ad litora. Cras eleifend turpis fames primis vulputate ornare sagittis. Orci varius natoque penatibus et magnis dis parturient. Proin libero feugiat tristique accumsan maecenas potenti ultricies. Eros lobortis nulla molestie mattis scelerisque maximus eget. Curabitur facilisi cubilia curae hac habitasse platea dictumst. Efficitur laoreet mauris pharetra vestibulum fusce dictum risus. Adipiscing elit quisque faucibus ex sapien vitae pellentesque. Consequat magna ante condimentum neque at luctus nibh. Pretium tellus duis convallis tempus leo eu aenean. Ligula congue sollicitudin erat viverra ac tincidunt nam. Fringilla lacus nec metus bibendum egestas iaculis massa. Justo lectus commodo augue arcu dignissim velit aliquam. Ut hendrerit semper vel class aptent taciti sociosqu. Rutrum gravida cras eleifend turpis fames primis vulputate. Inceptos himenaeos orci varius natoque penatibus et magnis. Venenatis ultrices proin libero feugiat tristique accumsan maecenas. Donec rhoncus eros lobortis nulla molestie mattis scelerisque. Suscipit auctor curabitur facilisi cubilia curae hac habitasse. Purus est efficitur laoreet mauris pharetra vestibulum fusce. Amet consectetur adipiscing elit quisque faucibus ex sapien. Nisi sodales consequat magna ante condimentum neque at. Cursus mi pretium tellus duis convallis tempus leo. Interdum tortor ligula congue sollicitudin erat viverra ac.
+
+Pulvinar vivamus fringilla lacus nec metus bibendum egestas. Euismod quam justo lectus commodo augue arcu dignissim. Nunc posuere ut hendrerit semper vel class aptent. Porttitor ullamcorper rutrum gravida cras eleifend turpis fames. Conubia nostra inceptos himenaeos orci varius natoque penatibus. Dui felis venenatis ultrices proin libero feugiat tristique. Ridiculus mus donec rhoncus eros lobortis nulla molestie. Senectus netus suscipit auctor curabitur facilisi cubilia curae. Phasellus non purus est efficitur laoreet mauris pharetra. Dolor sit amet consectetur adipiscing elit quisque faucibus. Suspendisse aliquet nisi sodales consequat magna ante condimentum. In id cursus mi pretium tellus duis convallis.
+
+Dapibus etiam interdum tortor ligula congue sollicitudin erat. Urna tempor pulvinar vivamus fringilla lacus nec metus. Aenim euismod quam justo lectus commodo augue. Lacinia integer nunc posuere ut hendrerit semper vel. Nullam volutpat porttitor ullamcorper rutrum gravida cras eleifend. Torquent per conubia nostra inceptos himenaeos orci varius. Vehicula praesent dui felis venenatis ultrices proin libero. Montes nascetur ridiculus mus donec rhoncus eros lobortis. Habitant morbi senectus netus suscipit auctor curabitur facilisi. Fermentum odio phasellus non purus est efficitur laoreet. Lorem ipsum dolor sit amet consectetur adipiscing elit. Blandit quis suspendisse aliquet nisi sodales consequat magna. Sem placerat in id cursus mi pretium tellus. Finibus facilisis dapibus etiam interdum tortor ligula congue. Sed diam urna tempor pulvinar vivamus fringilla lacus. Porta elementum a enim euismod quam justo lectus. Nisl malesuada lacinia integer nunc posuere ut hendrerit.

package/dist/esm/utils/checkAIAccess.mjs

@@ -0,0 +1,16 @@
+import { getAppLogger } from "@intlayer/config";
+const checkAIAccess = (configuration, aiOptions) => {
+  const appLogger = getAppLogger(configuration);
+  if (!configuration.editor.clientId && !configuration.editor.clientSecret && !configuration.ai?.apiKey && !aiOptions?.apiKey) {
+    appLogger("AI options or API key not provided. Skipping AI translation.", {
+      level: "error"
+    });
+    throw new Error(
+      "AI options or API key not provided. Skipping AI translation."
+    );
+  }
+};
+export {
+  checkAIAccess
+};
+//# sourceMappingURL=checkAIAccess.mjs.map

package/dist/esm/utils/checkAIAccess.mjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../src/utils/checkAIAccess.ts"],"sourcesContent":["import type { AIOptions } from '@intlayer/api';\nimport { getAppLogger, type IntlayerConfig } from '@intlayer/config';\n\nexport const checkAIAccess = (\n  configuration: IntlayerConfig,\n  aiOptions?: AIOptions\n) => {\n  const appLogger = getAppLogger(configuration);\n\n  if (\n    !configuration.editor.clientId &&\n    !configuration.editor.clientSecret &&\n    !configuration.ai?.apiKey &&\n    !aiOptions?.apiKey\n  ) {\n    appLogger('AI options or API key not provided. Skipping AI translation.', {\n      level: 'error',\n    });\n    // Potentially handle this case differently, e.g., by using a different translation method or stopping.\n\n    throw new Error(\n      'AI options or API key not provided. Skipping AI translation.'\n    );\n  }\n};\n"],"mappings":"AACA,SAAS,oBAAyC;AAE3C,MAAM,gBAAgB,CAC3B,eACA,cACG;AACH,QAAM,YAAY,aAAa,aAAa;AAE5C,MACE,CAAC,cAAc,OAAO,YACtB,CAAC,cAAc,OAAO,gBACtB,CAAC,cAAc,IAAI,UACnB,CAAC,WAAW,QACZ;AACA,cAAU,gEAAgE;AAAA,MACxE,OAAO;AAAA,IACT,CAAC;AAGD,UAAM,IAAI;AAAA,MACR;AAAA,IACF;AAAA,EACF;AACF;","names":[]}

package/dist/esm/utils/checkFileModifiedRange.mjs

@@ -0,0 +1,73 @@
+import { checkLastUpdateTime } from "./checkLastUpdateTime.mjs";
+import { formatTimeDiff } from "./formatTimeDiff.mjs";
+const TIMESTAMP_THRESHOLD_MS = 50 * 365 * 24 * 60 * 60 * 1e3;
+const normaliseInputDate = (date, now = /* @__PURE__ */ new Date()) => {
+  if (date instanceof Date) {
+    return {
+      absoluteTime: date,
+      relativeTime: new Date(now.getTime() - date.getTime())
+    };
+  }
+  if (typeof date === "number") {
+    if (date > TIMESTAMP_THRESHOLD_MS) {
+      const absoluteTime = new Date(date);
+      return {
+        absoluteTime,
+        relativeTime: new Date(now.getTime() - absoluteTime.getTime())
+      };
+    }
+    const relativeMs = date;
+    return {
+      // Relative duration expressed as a Date object starting at the epoch
+      relativeTime: new Date(relativeMs),
+      // The concrete date obtained by subtracting the duration from *now*
+      absoluteTime: new Date(now.getTime() - relativeMs)
+    };
+  }
+  if (typeof date === "string") {
+    const absoluteTime = new Date(date);
+    if (Number.isNaN(absoluteTime.getTime())) {
+      throw new Error(`Invalid date string provided: ${date}`);
+    }
+    return {
+      absoluteTime,
+      relativeTime: new Date(now.getTime() - absoluteTime.getTime())
+    };
+  }
+  throw new Error(`Unsupported date format: ${date}`);
+};
+const checkFileModifiedRange = (filePath, options) => {
+  const fileLastUpdateTime = checkLastUpdateTime(filePath);
+  const { skipIfModifiedBefore, skipIfModifiedAfter } = options;
+  const now = /* @__PURE__ */ new Date();
+  const minDate = skipIfModifiedBefore ? normaliseInputDate(skipIfModifiedBefore, now).absoluteTime : void 0;
+  const maxDate = skipIfModifiedAfter ? normaliseInputDate(skipIfModifiedAfter, now).absoluteTime : void 0;
+  let shouldSkip = false;
+  if (minDate instanceof Date && maxDate instanceof Date) {
+    shouldSkip = fileLastUpdateTime >= minDate && fileLastUpdateTime <= maxDate;
+  } else if (minDate instanceof Date) {
+    shouldSkip = fileLastUpdateTime >= minDate;
+  } else if (maxDate) {
+    shouldSkip = fileLastUpdateTime >= maxDate;
+  }
+  if (shouldSkip) {
+    const referenceDate = minDate && maxDate ? (
+      // When both bounds are present, the *range* caused the skip so we use
+      // the distance between the two bounds as the relative duration.
+      new Date(Math.abs(maxDate.getTime() - minDate.getTime()))
+    ) : minDate ?? maxDate;
+    const relativeTime = new Date(now.getTime() - referenceDate.getTime());
+    return {
+      isSkipped: true,
+      message: `Skipping file because it has been modified within the last ${formatTimeDiff(relativeTime)} - ${filePath}`
+    };
+  }
+  return {
+    isSkipped: false,
+    message: `File ${filePath} can be processed - ${filePath}`
+  };
+};
+export {
+  checkFileModifiedRange
+};
+//# sourceMappingURL=checkFileModifiedRange.mjs.map

package/dist/esm/utils/checkFileModifiedRange.mjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../src/utils/checkFileModifiedRange.ts"],"sourcesContent":["import { checkLastUpdateTime } from './checkLastUpdateTime';\nimport { formatTimeDiff } from './formatTimeDiff';\n\ntype GetTimeRangeResult = {\n  relativeTime: Date;\n  absoluteTime: Date;\n};\n\n/**\n * Threshold that helps us differentiate between a numeric *timestamp* (ms from epoch)\n * and a numeric *duration* (ms ago).\n * 50 years expressed in milliseconds is far greater than any reasonable\n * \"relative\" duration we expect the helper to receive (e.g. a couple of years).\n */\nconst TIMESTAMP_THRESHOLD_MS = 50 * 365 * 24 * 60 * 60 * 1000; // 50 years\n\n/**\n * Normalises the input date representation into a pair:\n *   1. `relativeTime` – a Date instance whose epoch-time equals the duration\n *      between `now` and the absolute date.\n *   2. `absoluteTime` – the concrete point in time represented as a Date.\n *\n * Rules for interpreting the input:\n *   • Date  => treated as an absolute time.\n *   • string => parsed via the Date constructor => absolute time.\n *   • number:\n *       – if the value is larger than the TIMESTAMP_THRESHOLD_MS we assume it\n *         is a unix timestamp (absolute time).\n *       – otherwise we treat it as a *relative* duration expressed in\n *         milliseconds.\n */\nconst normaliseInputDate = (\n  date: Date | number | string,\n  now: Date = new Date()\n): GetTimeRangeResult => {\n  // Case 1: Already a Date instance\n  if (date instanceof Date) {\n    return {\n      absoluteTime: date,\n      relativeTime: new Date(now.getTime() - date.getTime()),\n    };\n  }\n\n  // Case 2: Numeric value – decide between timestamp vs relative ms.\n  if (typeof date === 'number') {\n    if (date > TIMESTAMP_THRESHOLD_MS) {\n      // Treat as *unix timestamp* (absolute)\n      const absoluteTime = new Date(date);\n      return {\n        absoluteTime,\n        relativeTime: new Date(now.getTime() - absoluteTime.getTime()),\n      };\n    }\n\n    // Treat as a *relative* duration (milliseconds in the past)\n    const relativeMs = date;\n    return {\n      // Relative duration expressed as a Date object starting at the epoch\n      relativeTime: new Date(relativeMs),\n      // The concrete date obtained by subtracting the duration from *now*\n      absoluteTime: new Date(now.getTime() - relativeMs),\n    };\n  }\n\n  // Case 3: String representation – let Date parse it.\n  if (typeof date === 'string') {\n    const absoluteTime = new Date(date);\n    if (Number.isNaN(absoluteTime.getTime())) {\n      throw new Error(`Invalid date string provided: ${date}`);\n    }\n\n    return {\n      absoluteTime,\n      relativeTime: new Date(now.getTime() - absoluteTime.getTime()),\n    };\n  }\n\n  throw new Error(`Unsupported date format: ${date}`);\n};\n\ntype CheckFileModifiedRangeResult = {\n  isSkipped: boolean;\n  message: string;\n};\n\ntype CheckFileModifiedRangeOptions = {\n  skipIfModifiedBefore?: Date | number | string;\n  skipIfModifiedAfter?: Date | number | string;\n};\n\nexport const checkFileModifiedRange = (\n  filePath: string,\n  options: CheckFileModifiedRangeOptions\n): CheckFileModifiedRangeResult => {\n  const fileLastUpdateTime = checkLastUpdateTime(filePath);\n  const { skipIfModifiedBefore, skipIfModifiedAfter } = options;\n\n  // Normalise the provided thresholds to concrete dates.\n  const now = new Date();\n  const minDate = skipIfModifiedBefore\n    ? normaliseInputDate(skipIfModifiedBefore, now).absoluteTime\n    : undefined;\n  const maxDate = skipIfModifiedAfter\n    ? normaliseInputDate(skipIfModifiedAfter, now).absoluteTime\n    : undefined;\n\n  // Determine if the file should be skipped.\n  let shouldSkip = false;\n\n  if (minDate instanceof Date && maxDate instanceof Date) {\n    // Skip when the modification time falls *within* the range [minDate, maxDate]\n    shouldSkip = fileLastUpdateTime >= minDate && fileLastUpdateTime <= maxDate;\n  } else if (minDate instanceof Date) {\n    // Only lower bound – skip when the file was modified *after* minDate\n    shouldSkip = fileLastUpdateTime >= minDate;\n  } else if (maxDate) {\n    // Only upper bound – skip when the file was modified *after* maxDate\n    shouldSkip = fileLastUpdateTime >= maxDate;\n  }\n\n  if (shouldSkip) {\n    // For the sake of the message we compute the relative time to *now* using\n    // whichever bound was responsible for the skip logic.\n    const referenceDate = (\n      minDate && maxDate\n        ? // When both bounds are present, the *range* caused the skip so we use\n          // the distance between the two bounds as the relative duration.\n          new Date(Math.abs(maxDate.getTime() - minDate.getTime()))\n        : (minDate ?? maxDate)\n    )!;\n\n    const relativeTime = new Date(now.getTime() - referenceDate.getTime());\n\n    return {\n      isSkipped: true,\n      message: `Skipping file because it has been modified within the last ${formatTimeDiff(relativeTime)} - ${filePath}`,\n    };\n  }\n\n  return {\n    isSkipped: false,\n    message: `File ${filePath} can be processed - ${filePath}`,\n  };\n};\n"],"mappings":"AAAA,SAAS,2BAA2B;AACpC,SAAS,sBAAsB;AAa/B,MAAM,yBAAyB,KAAK,MAAM,KAAK,KAAK,KAAK;AAiBzD,MAAM,qBAAqB,CACzB,MACA,MAAY,oBAAI,KAAK,MACE;AAEvB,MAAI,gBAAgB,MAAM;AACxB,WAAO;AAAA,MACL,cAAc;AAAA,MACd,cAAc,IAAI,KAAK,IAAI,QAAQ,IAAI,KAAK,QAAQ,CAAC;AAAA,IACvD;AAAA,EACF;AAGA,MAAI,OAAO,SAAS,UAAU;AAC5B,QAAI,OAAO,wBAAwB;AAEjC,YAAM,eAAe,IAAI,KAAK,IAAI;AAClC,aAAO;AAAA,QACL;AAAA,QACA,cAAc,IAAI,KAAK,IAAI,QAAQ,IAAI,aAAa,QAAQ,CAAC;AAAA,MAC/D;AAAA,IACF;AAGA,UAAM,aAAa;AACnB,WAAO;AAAA;AAAA,MAEL,cAAc,IAAI,KAAK,UAAU;AAAA;AAAA,MAEjC,cAAc,IAAI,KAAK,IAAI,QAAQ,IAAI,UAAU;AAAA,IACnD;AAAA,EACF;AAGA,MAAI,OAAO,SAAS,UAAU;AAC5B,UAAM,eAAe,IAAI,KAAK,IAAI;AAClC,QAAI,OAAO,MAAM,aAAa,QAAQ,CAAC,GAAG;AACxC,YAAM,IAAI,MAAM,iCAAiC,IAAI,EAAE;AAAA,IACzD;AAEA,WAAO;AAAA,MACL;AAAA,MACA,cAAc,IAAI,KAAK,IAAI,QAAQ,IAAI,aAAa,QAAQ,CAAC;AAAA,IAC/D;AAAA,EACF;AAEA,QAAM,IAAI,MAAM,4BAA4B,IAAI,EAAE;AACpD;AAYO,MAAM,yBAAyB,CACpC,UACA,YACiC;AACjC,QAAM,qBAAqB,oBAAoB,QAAQ;AACvD,QAAM,EAAE,sBAAsB,oBAAoB,IAAI;AAGtD,QAAM,MAAM,oBAAI,KAAK;AACrB,QAAM,UAAU,uBACZ,mBAAmB,sBAAsB,GAAG,EAAE,eAC9C;AACJ,QAAM,UAAU,sBACZ,mBAAmB,qBAAqB,GAAG,EAAE,eAC7C;AAGJ,MAAI,aAAa;AAEjB,MAAI,mBAAmB,QAAQ,mBAAmB,MAAM;AAEtD,iBAAa,sBAAsB,WAAW,sBAAsB;AAAA,EACtE,WAAW,mBAAmB,MAAM;AAElC,iBAAa,sBAAsB;AAAA,EACrC,WAAW,SAAS;AAElB,iBAAa,sBAAsB;AAAA,EACrC;AAEA,MAAI,YAAY;AAGd,UAAM,gBACJ,WAAW;AAAA;AAAA;AAAA,MAGP,IAAI,KAAK,KAAK,IAAI,QAAQ,QAAQ,IAAI,QAAQ,QAAQ,CAAC,CAAC;AAAA,QACvD,WAAW;AAGlB,UAAM,eAAe,IAAI,KAAK,IAAI,QAAQ,IAAI,cAAc,QAAQ,CAAC;AAErE,WAAO;AAAA,MACL,WAAW;AAAA,MACX,SAAS,8DAA8D,eAAe,YAAY,CAAC,MAAM,QAAQ;AAAA,IACnH;AAAA,EACF;AAEA,SAAO;AAAA,IACL,WAAW;AAAA,IACX,SAAS,QAAQ,QAAQ,uBAAuB,QAAQ;AAAA,EAC1D;AACF;","names":[]}

package/dist/esm/utils/checkFileModifiedRange.test.mjs

@@ -0,0 +1,181 @@
+import {
+  afterEach,
+  beforeEach,
+  describe,
+  expect,
+  it,
+  vi
+} from "vitest";
+vi.mock("./checkLastUpdateTime", () => {
+  return {
+    checkLastUpdateTime: vi.fn(() => /* @__PURE__ */ new Date())
+    // pretend the file was just modified
+  };
+});
+import { checkFileModifiedRange } from "./checkFileModifiedRange.mjs";
+import { checkLastUpdateTime } from "./checkLastUpdateTime.mjs";
+describe("checkFileModifiedRange", () => {
+  beforeEach(() => {
+    vi.useFakeTimers();
+    vi.setSystemTime(/* @__PURE__ */ new Date("2025-01-01"));
+  });
+  afterEach(() => {
+    vi.useRealTimers();
+    vi.clearAllMocks();
+  });
+  const testList = [
+    {
+      // |---a---|
+      fileModifiedTime: /* @__PURE__ */ new Date("2025-01-01"),
+      // a
+      isSkipped: false
+      // No constraints
+    },
+    {
+      // |-min-a-max-|
+      skipIfModifiedBefore: "2024-01-01",
+      // min
+      skipIfModifiedAfter: "2026-01-01",
+      // max
+      fileModifiedTime: /* @__PURE__ */ new Date("2025-01-01"),
+      // a
+      isSkipped: true
+      // During the range
+    },
+    {
+      // |-min-max-a-|
+      skipIfModifiedBefore: "2024-01-01",
+      // min
+      skipIfModifiedAfter: "2026-01-01",
+      // max
+      fileModifiedTime: /* @__PURE__ */ new Date("2027-01-01"),
+      // a
+      isSkipped: false
+      // After the range
+    },
+    {
+      // |-a-min-max-|
+      skipIfModifiedBefore: "2024-01-01",
+      // min
+      skipIfModifiedAfter: "2026-01-01",
+      // max
+      fileModifiedTime: /* @__PURE__ */ new Date("2023-01-01"),
+      // a
+      isSkipped: false
+      // Before the range
+    },
+    {
+      // |-a-min-|
+      skipIfModifiedBefore: "2024-01-01",
+      // min
+      fileModifiedTime: /* @__PURE__ */ new Date("2023-01-01"),
+      // a
+      isSkipped: false
+      // Before the skipIfModifiedBefore
+    },
+    {
+      // |-min-a-|
+      skipIfModifiedBefore: "2024-01-01",
+      // min
+      fileModifiedTime: /* @__PURE__ */ new Date("2025-01-01"),
+      // a
+      isSkipped: true
+      // After the skipIfModifiedBefore
+    },
+    {
+      // |-a-max-|
+      skipIfModifiedAfter: "2026-01-01",
+      // max
+      fileModifiedTime: /* @__PURE__ */ new Date("2027-01-01"),
+      // a
+      isSkipped: true
+      // Before the skipIfModifiedAfter
+    },
+    {
+      // |-max-a-|
+      skipIfModifiedAfter: "2026-01-01",
+      // max
+      fileModifiedTime: /* @__PURE__ */ new Date("2027-01-01"),
+      // a
+      isSkipped: true
+      // After the skipIfModifiedAfter
+    },
+    {
+      // |-min-max-a-|
+      skipIfModifiedBefore: 3 * 365 * 24 * 60 * 60 * 1e3,
+      // min // 3 year ago
+      skipIfModifiedAfter: 1 * 365 * 24 * 60 * 60 * 1e3,
+      // max // 1 year
+      fileModifiedTime: /* @__PURE__ */ new Date("2025-01-01"),
+      // a
+      isSkipped: false
+      // Before the range
+    },
+    {
+      // |-a-max-|
+      skipIfModifiedAfter: 0,
+      // max // now
+      fileModifiedTime: /* @__PURE__ */ new Date("2024-01-01"),
+      // a
+      isSkipped: false
+      // Before the skipIfModifiedAfter
+    },
+    {
+      // |-min-a-|
+      skipIfModifiedAfter: 1 * 365 * 24 * 60 * 60 * 1e3,
+      // max // 1 year
+      fileModifiedTime: /* @__PURE__ */ new Date("2025-01-01"),
+      // a
+      isSkipped: true
+      // Before the skipIfModifiedAfter
+    },
+    {
+      // |-min-a-max-|
+      skipIfModifiedBefore: 3 * 365 * 24 * 60 * 60 * 1e3,
+      // min // 3 year ago
+      skipIfModifiedAfter: 1 * 365 * 24 * 60 * 60 * 1e3,
+      // max // 1 year
+      fileModifiedTime: /* @__PURE__ */ new Date("2023-01-01"),
+      // a
+      isSkipped: true
+      // After the range
+    },
+    {
+      // |-a-min-max-|
+      skipIfModifiedBefore: 3 * 365 * 24 * 60 * 60 * 1e3,
+      // min // 3 year ago
+      skipIfModifiedAfter: 1 * 365 * 24 * 60 * 60 * 1e3,
+      // max // 1 year
+      fileModifiedTime: /* @__PURE__ */ new Date("2020-01-01"),
+      // a
+      isSkipped: false
+      // Before the range
+    },
+    {
+      // |-min-max-a-|
+      skipIfModifiedBefore: "2024-01-01T00:00:00Z",
+      // min
+      skipIfModifiedAfter: "2026-01-01T00:00:00Z",
+      // max
+      fileModifiedTime: /* @__PURE__ */ new Date("2027-01-01"),
+      // a
+      isSkipped: false
+      // After the range
+    }
+  ];
+  testList.forEach((test) => {
+    it(`should correctly handle string date inputs (absolute time) outside of the range`, () => {
+      const filePath = "test/file.txt";
+      checkLastUpdateTime.mockReturnValue(
+        // If a specific mocked modification time is provided, use it. Otherwise, fall back to "now".
+        test.fileModifiedTime ?? /* @__PURE__ */ new Date()
+      );
+      const { isSkipped } = checkFileModifiedRange(filePath, {
+        skipIfModifiedBefore: test.skipIfModifiedBefore,
+        skipIfModifiedAfter: test.skipIfModifiedAfter
+      });
+      expect(isSkipped).toBe(test.isSkipped);
+    });
+  });
+});
+//# sourceMappingURL=checkFileModifiedRange.test.mjs.map

package/dist/esm/utils/checkFileModifiedRange.test.mjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../src/utils/checkFileModifiedRange.test.ts"],"sourcesContent":["import {\n  afterEach,\n  beforeEach,\n  describe,\n  expect,\n  it,\n  vi,\n  type Mock,\n} from 'vitest';\n\n// We are testing the public helper. The helper itself internally relies on\n// `checkLastUpdateTime`, which hits the file-system. To keep the test\n// deterministic (and independent from the real FS) we mock this dependency so\n// that we can control the last modification date that the helper receives.\n\n// NOTE: `vi.mock` must be called *before* the module under test is imported.\nvi.mock('./checkLastUpdateTime', () => {\n  return {\n    checkLastUpdateTime: vi.fn(() => new Date()), // pretend the file was just modified\n  };\n});\n\nimport { checkFileModifiedRange } from './checkFileModifiedRange';\nimport { checkLastUpdateTime } from './checkLastUpdateTime';\n\ndescribe('checkFileModifiedRange', () => {\n  beforeEach(() => {\n    // Use fake timers so Date.now() is deterministic.\n    vi.useFakeTimers();\n    // Pin the system time to an arbitrary date for reproducibility\n    vi.setSystemTime(new Date('2025-01-01'));\n  });\n\n  afterEach(() => {\n    vi.useRealTimers();\n    vi.clearAllMocks();\n  });\n\n  const testList = [\n    {\n      // |---a---|\n      fileModifiedTime: new Date('2025-01-01'), // a\n      isSkipped: false, // No constraints\n    },\n    {\n      // |-min-a-max-|\n      skipIfModifiedBefore: '2024-01-01', // min\n      skipIfModifiedAfter: '2026-01-01', // max\n      fileModifiedTime: new Date('2025-01-01'), // a\n      isSkipped: true, // During the range\n    },\n    {\n      // |-min-max-a-|\n      skipIfModifiedBefore: '2024-01-01', // min\n      skipIfModifiedAfter: '2026-01-01', // max\n      fileModifiedTime: new Date('2027-01-01'), // a\n      isSkipped: false, // After the range\n    },\n    {\n      // |-a-min-max-|\n      skipIfModifiedBefore: '2024-01-01', // min\n      skipIfModifiedAfter: '2026-01-01', // max\n      fileModifiedTime: new Date('2023-01-01'), // a\n      isSkipped: false, // Before the range\n    },\n    {\n      // |-a-min-|\n      skipIfModifiedBefore: '2024-01-01', // min\n      fileModifiedTime: new Date('2023-01-01'), // a\n      isSkipped: false, // Before the skipIfModifiedBefore\n    },\n    {\n      // |-min-a-|\n      skipIfModifiedBefore: '2024-01-01', // min\n      fileModifiedTime: new Date('2025-01-01'), // a\n      isSkipped: true, // After the skipIfModifiedBefore\n    },\n    {\n      // |-a-max-|\n      skipIfModifiedAfter: '2026-01-01', // max\n      fileModifiedTime: new Date('2027-01-01'), // a\n      isSkipped: true, // Before the skipIfModifiedAfter\n    },\n    {\n      // |-max-a-|\n      skipIfModifiedAfter: '2026-01-01', // max\n      fileModifiedTime: new Date('2027-01-01'), // a\n      isSkipped: true, // After the skipIfModifiedAfter\n    },\n    {\n      // |-min-max-a-|\n      skipIfModifiedBefore: 3 * 365 * 24 * 60 * 60 * 1000, // min // 3 year ago\n      skipIfModifiedAfter: 1 * 365 * 24 * 60 * 60 * 1000, // max // 1 year\n      fileModifiedTime: new Date('2025-01-01'), // a\n      isSkipped: false, // Before the range\n    },\n    {\n      // |-a-max-|\n      skipIfModifiedAfter: 0, // max // now\n      fileModifiedTime: new Date('2024-01-01'), // a\n      isSkipped: false, // Before the skipIfModifiedAfter\n    },\n    {\n      // |-min-a-|\n      skipIfModifiedAfter: 1 * 365 * 24 * 60 * 60 * 1000, // max // 1 year\n      fileModifiedTime: new Date('2025-01-01'), // a\n      isSkipped: true, // Before the skipIfModifiedAfter\n    },\n    {\n      // |-min-a-max-|\n      skipIfModifiedBefore: 3 * 365 * 24 * 60 * 60 * 1000, // min // 3 year ago\n      skipIfModifiedAfter: 1 * 365 * 24 * 60 * 60 * 1000, // max // 1 year\n      fileModifiedTime: new Date('2023-01-01'), // a\n      isSkipped: true, // After the range\n    },\n    {\n      // |-a-min-max-|\n      skipIfModifiedBefore: 3 * 365 * 24 * 60 * 60 * 1000, // min // 3 year ago\n      skipIfModifiedAfter: 1 * 365 * 24 * 60 * 60 * 1000, // max // 1 year\n      fileModifiedTime: new Date('2020-01-01'), // a\n      isSkipped: false, // Before the range\n    },\n    {\n      // |-min-max-a-|\n      skipIfModifiedBefore: '2024-01-01T00:00:00Z', // min\n      skipIfModifiedAfter: '2026-01-01T00:00:00Z', // max\n      fileModifiedTime: new Date('2027-01-01'), // a\n      isSkipped: false, // After the range\n    },\n  ];\n\n  testList.forEach((test) => {\n    it(`should correctly handle string date inputs (absolute time) outside of the range`, () => {\n      const filePath = 'test/file.txt';\n\n      // Simulate the file's last modification time for this test case\n      (checkLastUpdateTime as unknown as Mock).mockReturnValue(\n        // If a specific mocked modification time is provided, use it. Otherwise, fall back to \"now\".\n        test.fileModifiedTime ?? new Date()\n      );\n\n      const { isSkipped } = checkFileModifiedRange(filePath, {\n        skipIfModifiedBefore: test.skipIfModifiedBefore,\n        skipIfModifiedAfter: test.skipIfModifiedAfter,\n      });\n\n      expect(isSkipped).toBe(test.isSkipped);\n    });\n  });\n});\n"],"mappings":"AAAA;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,OAEK;AAQP,GAAG,KAAK,yBAAyB,MAAM;AACrC,SAAO;AAAA,IACL,qBAAqB,GAAG,GAAG,MAAM,oBAAI,KAAK,CAAC;AAAA;AAAA,EAC7C;AACF,CAAC;AAED,SAAS,8BAA8B;AACvC,SAAS,2BAA2B;AAEpC,SAAS,0BAA0B,MAAM;AACvC,aAAW,MAAM;AAEf,OAAG,cAAc;AAEjB,OAAG,cAAc,oBAAI,KAAK,YAAY,CAAC;AAAA,EACzC,CAAC;AAED,YAAU,MAAM;AACd,OAAG,cAAc;AACjB,OAAG,cAAc;AAAA,EACnB,CAAC;AAED,QAAM,WAAW;AAAA,IACf;AAAA;AAAA,MAEE,kBAAkB,oBAAI,KAAK,YAAY;AAAA;AAAA,MACvC,WAAW;AAAA;AAAA,IACb;AAAA,IACA;AAAA;AAAA,MAEE,sBAAsB;AAAA;AAAA,MACtB,qBAAqB;AAAA;AAAA,MACrB,kBAAkB,oBAAI,KAAK,YAAY;AAAA;AAAA,MACvC,WAAW;AAAA;AAAA,IACb;AAAA,IACA;AAAA;AAAA,MAEE,sBAAsB;AAAA;AAAA,MACtB,qBAAqB;AAAA;AAAA,MACrB,kBAAkB,oBAAI,KAAK,YAAY;AAAA;AAAA,MACvC,WAAW;AAAA;AAAA,IACb;AAAA,IACA;AAAA;AAAA,MAEE,sBAAsB;AAAA;AAAA,MACtB,qBAAqB;AAAA;AAAA,MACrB,kBAAkB,oBAAI,KAAK,YAAY;AAAA;AAAA,MACvC,WAAW;AAAA;AAAA,IACb;AAAA,IACA;AAAA;AAAA,MAEE,sBAAsB;AAAA;AAAA,MACtB,kBAAkB,oBAAI,KAAK,YAAY;AAAA;AAAA,MACvC,WAAW;AAAA;AAAA,IACb;AAAA,IACA;AAAA;AAAA,MAEE,sBAAsB;AAAA;AAAA,MACtB,kBAAkB,oBAAI,KAAK,YAAY;AAAA;AAAA,MACvC,WAAW;AAAA;AAAA,IACb;AAAA,IACA;AAAA;AAAA,MAEE,qBAAqB;AAAA;AAAA,MACrB,kBAAkB,oBAAI,KAAK,YAAY;AAAA;AAAA,MACvC,WAAW;AAAA;AAAA,IACb;AAAA,IACA;AAAA;AAAA,MAEE,qBAAqB;AAAA;AAAA,MACrB,kBAAkB,oBAAI,KAAK,YAAY;AAAA;AAAA,MACvC,WAAW;AAAA;AAAA,IACb;AAAA,IACA;AAAA;AAAA,MAEE,sBAAsB,IAAI,MAAM,KAAK,KAAK,KAAK;AAAA;AAAA,MAC/C,qBAAqB,IAAI,MAAM,KAAK,KAAK,KAAK;AAAA;AAAA,MAC9C,kBAAkB,oBAAI,KAAK,YAAY;AAAA;AAAA,MACvC,WAAW;AAAA;AAAA,IACb;AAAA,IACA;AAAA;AAAA,MAEE,qBAAqB;AAAA;AAAA,MACrB,kBAAkB,oBAAI,KAAK,YAAY;AAAA;AAAA,MACvC,WAAW;AAAA;AAAA,IACb;AAAA,IACA;AAAA;AAAA,MAEE,qBAAqB,IAAI,MAAM,KAAK,KAAK,KAAK;AAAA;AAAA,MAC9C,kBAAkB,oBAAI,KAAK,YAAY;AAAA;AAAA,MACvC,WAAW;AAAA;AAAA,IACb;AAAA,IACA;AAAA;AAAA,MAEE,sBAAsB,IAAI,MAAM,KAAK,KAAK,KAAK;AAAA;AAAA,MAC/C,qBAAqB,IAAI,MAAM,KAAK,KAAK,KAAK;AAAA;AAAA,MAC9C,kBAAkB,oBAAI,KAAK,YAAY;AAAA;AAAA,MACvC,WAAW;AAAA;AAAA,IACb;AAAA,IACA;AAAA;AAAA,MAEE,sBAAsB,IAAI,MAAM,KAAK,KAAK,KAAK;AAAA;AAAA,MAC/C,qBAAqB,IAAI,MAAM,KAAK,KAAK,KAAK;AAAA;AAAA,MAC9C,kBAAkB,oBAAI,KAAK,YAAY;AAAA;AAAA,MACvC,WAAW;AAAA;AAAA,IACb;AAAA,IACA;AAAA;AAAA,MAEE,sBAAsB;AAAA;AAAA,MACtB,qBAAqB;AAAA;AAAA,MACrB,kBAAkB,oBAAI,KAAK,YAAY;AAAA;AAAA,MACvC,WAAW;AAAA;AAAA,IACb;AAAA,EACF;AAEA,WAAS,QAAQ,CAAC,SAAS;AACzB,OAAG,mFAAmF,MAAM;AAC1F,YAAM,WAAW;AAGjB,MAAC,oBAAwC;AAAA;AAAA,QAEvC,KAAK,oBAAoB,oBAAI,KAAK;AAAA,MACpC;AAEA,YAAM,EAAE,UAAU,IAAI,uBAAuB,UAAU;AAAA,QACrD,sBAAsB,KAAK;AAAA,QAC3B,qBAAqB,KAAK;AAAA,MAC5B,CAAC;AAED,aAAO,SAAS,EAAE,KAAK,KAAK,SAAS;AAAA,IACvC,CAAC;AAAA,EACH,CAAC;AACH,CAAC;","names":[]}

package/dist/esm/utils/checkLastUpdateTime.mjs

@@ -0,0 +1,9 @@
+import { statSync } from "fs";
+const checkLastUpdateTime = (filePath) => {
+  const stats = statSync(filePath);
+  return new Date(stats.mtime);
+};
+export {
+  checkLastUpdateTime
+};
+//# sourceMappingURL=checkLastUpdateTime.mjs.map

package/dist/esm/utils/checkLastUpdateTime.mjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../src/utils/checkLastUpdateTime.ts"],"sourcesContent":["import { statSync } from 'fs';\n\n/**\n * Returns the last modification date of a file.\n *\n * @param filePath - Absolute or relative path to the file to inspect.\n * @returns Date instance representing the file's last modified time (mtime).\n * @throws Will propagate any error thrown by fs.statSync (e.g., file not found).\n */\nexport const checkLastUpdateTime = (filePath: string): Date => {\n  const stats = statSync(filePath);\n  return new Date(stats.mtime);\n};\n"],"mappings":"AAAA,SAAS,gBAAgB;AASlB,MAAM,sBAAsB,CAAC,aAA2B;AAC7D,QAAM,QAAQ,SAAS,QAAQ;AAC/B,SAAO,IAAI,KAAK,MAAM,KAAK;AAC7B;","names":[]}

package/dist/esm/utils/chunkInference.mjs

@@ -0,0 +1,34 @@
+import { getAiAPI } from "@intlayer/api";
+import { retryManager } from "@intlayer/config";
+const chunkInference = async (messages, aiOptions, oAuth2AccessToken) => {
+  let lastResult;
+  await retryManager(async () => {
+    const response = await getAiAPI().customQuery(
+      {
+        aiOptions,
+        messages
+      },
+      {
+        ...oAuth2AccessToken && {
+          headers: {
+            Authorization: `Bearer ${oAuth2AccessToken}`
+          }
+        }
+      }
+    );
+    if (!response.data) {
+      throw new Error("No response from AI API");
+    }
+    const { fileContent, tokenUsed } = response.data;
+    const newContent = fileContent.replaceAll("///chunksStart///", "").replaceAll("///chunkStart///", "").replaceAll("///chunksEnd///", "").replaceAll("///chunkEnd///", "");
+    lastResult = {
+      fileContent: newContent,
+      tokenUsed
+    };
+  })();
+  return lastResult;
+};
+export {
+  chunkInference
+};
+//# sourceMappingURL=chunkInference.mjs.map

package/dist/esm/utils/chunkInference.mjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../src/utils/chunkInference.ts"],"sourcesContent":["import { type AIOptions, type Messages, getAiAPI } from '@intlayer/api';\nimport { retryManager } from '@intlayer/config';\n\ntype ChunkInferenceResult = {\n  fileContent: string;\n  tokenUsed: number;\n};\n\n/**\n * Translates a single chunk via the OpenAI API.\n * Includes retry logic if the call fails.\n */\nexport const chunkInference = async (\n  messages: Messages,\n  aiOptions?: AIOptions,\n  oAuth2AccessToken?: string\n): Promise<ChunkInferenceResult> => {\n  let lastResult: ChunkInferenceResult;\n\n  await retryManager(async () => {\n    const response = await getAiAPI().customQuery(\n      {\n        aiOptions,\n        messages,\n      },\n      {\n        ...(oAuth2AccessToken && {\n          headers: {\n            Authorization: `Bearer ${oAuth2AccessToken}`,\n          },\n        }),\n      }\n    );\n\n    if (!response.data) {\n      throw new Error('No response from AI API');\n    }\n\n    const { fileContent, tokenUsed } = response.data;\n\n    const newContent = fileContent\n      .replaceAll('///chunksStart///', '')\n      .replaceAll('///chunkStart///', '')\n      .replaceAll('///chunksEnd///', '')\n      .replaceAll('///chunkEnd///', '');\n\n    lastResult = {\n      fileContent: newContent,\n      tokenUsed,\n    };\n  })();\n\n  return lastResult!;\n};\n"],"mappings":"AAAA,SAAwC,gBAAgB;AACxD,SAAS,oBAAoB;AAWtB,MAAM,iBAAiB,OAC5B,UACA,WACA,sBACkC;AAClC,MAAI;AAEJ,QAAM,aAAa,YAAY;AAC7B,UAAM,WAAW,MAAM,SAAS,EAAE;AAAA,MAChC;AAAA,QACE;AAAA,QACA;AAAA,MACF;AAAA,MACA;AAAA,QACE,GAAI,qBAAqB;AAAA,UACvB,SAAS;AAAA,YACP,eAAe,UAAU,iBAAiB;AAAA,UAC5C;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,QAAI,CAAC,SAAS,MAAM;AAClB,YAAM,IAAI,MAAM,yBAAyB;AAAA,IAC3C;AAEA,UAAM,EAAE,aAAa,UAAU,IAAI,SAAS;AAE5C,UAAM,aAAa,YAChB,WAAW,qBAAqB,EAAE,EAClC,WAAW,oBAAoB,EAAE,EACjC,WAAW,mBAAmB,EAAE,EAChC,WAAW,kBAAkB,EAAE;AAElC,iBAAa;AAAA,MACX,aAAa;AAAA,MACb;AAAA,IACF;AAAA,EACF,CAAC,EAAE;AAEH,SAAO;AACT;","names":[]}

package/dist/esm/utils/fixChunkStartEndChars.mjs

@@ -0,0 +1,23 @@
+const CHAR_TO_CHECK_FORMATTING = ["```", "\n\n", "\n", "---", "{{", "}}"];
+const escapeForRegExp = (str) => str.replace(/[.*+?^${}()|[\]\\]/g, "\\$&").replace(/\n/g, "\\n");
+const FORMATTING_REGEX_SOURCE = `(?:${CHAR_TO_CHECK_FORMATTING.map(escapeForRegExp).join("|")})+`;
+const LEADING_FORMATTING_REGEX = new RegExp(`^${FORMATTING_REGEX_SOURCE}`);
+const TRAILING_FORMATTING_REGEX = new RegExp(`${FORMATTING_REGEX_SOURCE}$`);
+const fixChunkStartEndChars = (reviewedChunkResult, baseChunkContext) => {
+  let result = reviewedChunkResult;
+  const baseLeading = baseChunkContext.match(LEADING_FORMATTING_REGEX)?.[0] ?? "";
+  const baseTrailing = baseChunkContext.match(TRAILING_FORMATTING_REGEX)?.[0] ?? "";
+  const resultLeading = result.match(LEADING_FORMATTING_REGEX)?.[0] ?? "";
+  const resultTrailing = result.match(TRAILING_FORMATTING_REGEX)?.[0] ?? "";
+  if (baseLeading !== resultLeading) {
+    result = baseLeading + result.slice(resultLeading.length);
+  }
+  if (baseTrailing !== resultTrailing) {
+    result = result.slice(0, result.length - resultTrailing.length) + baseTrailing;
+  }
+  return result;
+};
+export {
+  fixChunkStartEndChars
+};
+//# sourceMappingURL=fixChunkStartEndChars.mjs.map