@intlayer/cli 8.4.4 → 8.4.5

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

@@ -1 +1 @@
-{"version":3,"file":"getIsFileUpdatedRecently.mjs","names":[],"sources":["../../../src/utils/getIsFileUpdatedRecently.ts"],"sourcesContent":["import { statSync } from 'node:fs';\n\nconst SKIP_RANGE_OF_LAST_UPDATE_TIME: number = 0; //2 * 60 * 60 * 1000; // 2 hours\n\n/**\n * Check if file was updated recently, to skip re-translation\n */\nexport const getIsFileUpdatedRecently = (localeFilePath: string): boolean => {\n  const stats = statSync(localeFilePath);\n  const lastModified = new Date(stats.mtime);\n  const threshold = new Date(Date.now() - SKIP_RANGE_OF_LAST_UPDATE_TIME);\n\n  return lastModified > threshold;\n};\n"],"mappings":"mCAEA,MAKa,EAA4B,GAAoC,CAC3E,IAAM,EAAQ,EAAS,EAAe,CAItC,OAHqB,IAAI,KAAK,EAAM,MAAM,CACxB,IAAI,KAAK,KAAK,KAAK,CAAG,EAA+B"}
+{"version":3,"file":"getIsFileUpdatedRecently.mjs","names":[],"sources":["../../../src/utils/getIsFileUpdatedRecently.ts"],"sourcesContent":["import { statSync } from 'node:fs';\n\nconst SKIP_RANGE_OF_LAST_UPDATE_TIME: number = 0; //2 * 60 * 60 * 1000; // 2 hours\n\n/**\n * Check if file was updated recently, to skip re-translation\n */\nexport const getIsFileUpdatedRecently = (localeFilePath: string): boolean => {\n  const stats = statSync(localeFilePath);\n  const lastModified = new Date(stats.mtime);\n  const threshold = new Date(Date.now() - SKIP_RANGE_OF_LAST_UPDATE_TIME);\n\n  return lastModified > threshold;\n};\n"],"mappings":";;;AAEA,MAAM,iCAAyC;;;;AAK/C,MAAa,4BAA4B,mBAAoC;CAC3E,MAAM,QAAQ,SAAS,eAAe;AAItC,QAHqB,IAAI,KAAK,MAAM,MAAM,GACxB,IAAI,KAAK,KAAK,KAAK,GAAG,+BAA+B"}

package/dist/esm/utils/getOutputFilePath.mjs

@@ -1,2 +1,73 @@
-const e=(e,t,n)=>{if(!e||!t||!n)throw Error(`filePath, locale, and baseLocale are required`);let r=e,i=[{pattern:/\{\{baseLocale\}\}/g,replacement:`{{locale}}`},{pattern:/\{\{baseLocaleName\}\}/g,replacement:`{{localeName}}`},{pattern:RegExp(`/${n}/`,`g`),replacement:`/${t}/`},{pattern:RegExp(`\\\\${n}\\\\`,`g`),replacement:`\\${t}\\`},{pattern:RegExp(`_${n}\\.`,`g`),replacement:`_${t}.`},{pattern:RegExp(`/${n}_`,`g`),replacement:`/${t}_`},{pattern:RegExp(`(^|[\\/])${n}_`,`g`),replacement:`$1${t}_`},{pattern:RegExp(`\\.${n}\\.`,`g`),replacement:`.${t}.`}];for(let{pattern:e,replacement:t}of i)r=r.replace(e,t);if(r===e){let n=e.lastIndexOf(`.`);return n>0?`${e.slice(0,n)}.${t}${e.slice(n)}`:`${e}.${t}`}return r};export{e as getOutputFilePath};
+//#region src/utils/getOutputFilePath.ts
+/**
+* Get the output file path by replacing the base locale with the target locale
+*
+* This function handles two types of replacements:
+* 1. Actual locale values (e.g., `/en/` → `/fr/`)
+* 2. Template placeholders (e.g., `{{baseLocale}}` → `{{locale}}`, `{{baseLocaleName}}` → `{{localeName}}`)
+*
+* Replacement patterns:
+* - `/baseLocale/` → `/locale/`
+* - `\baseLocale\` → `\locale\`
+* - `_baseLocale.` → `_locale.`
+* - `baseLocale_` → `locale_`
+* - `.baseLocaleName.` → `.localeName.`
+* - `{{baseLocale}}` → `{{locale}}`
+* - `{{baseLocaleName}}` → `{{localeName}}`
+*
+* If no patterns match, appends `.locale` to the file extension.
+*
+* @param filePath - The input file path
+* @param locale - The target locale
+* @param baseLocale - The base locale to replace
+* @returns The output file path with locale replacements
+*/
+const getOutputFilePath = (filePath, locale, baseLocale) => {
+	if (!filePath || !locale || !baseLocale) throw new Error("filePath, locale, and baseLocale are required");
+	let outputFilePath = filePath;
+	const replacements = [
+		{
+			pattern: /\{\{baseLocale\}\}/g,
+			replacement: "{{locale}}"
+		},
+		{
+			pattern: /\{\{baseLocaleName\}\}/g,
+			replacement: "{{localeName}}"
+		},
+		{
+			pattern: new RegExp(`/${baseLocale}/`, "g"),
+			replacement: `/${locale}/`
+		},
+		{
+			pattern: new RegExp(`\\\\${baseLocale}\\\\`, "g"),
+			replacement: `\\${locale}\\`
+		},
+		{
+			pattern: new RegExp(`_${baseLocale}\\.`, "g"),
+			replacement: `_${locale}.`
+		},
+		{
+			pattern: new RegExp(`/${baseLocale}_`, "g"),
+			replacement: `/${locale}_`
+		},
+		{
+			pattern: new RegExp(`(^|[\\/])${baseLocale}_`, "g"),
+			replacement: `$1${locale}_`
+		},
+		{
+			pattern: new RegExp(`\\.${baseLocale}\\.`, "g"),
+			replacement: `.${locale}.`
+		}
+	];
+	for (const { pattern, replacement } of replacements) outputFilePath = outputFilePath.replace(pattern, replacement);
+	if (outputFilePath === filePath) {
+		const lastDotIndex = filePath.lastIndexOf(".");
+		if (lastDotIndex > 0) return `${filePath.slice(0, lastDotIndex)}.${locale}${filePath.slice(lastDotIndex)}`;
+		else return `${filePath}.${locale}`;
+	}
+	return outputFilePath;
+};
+
+//#endregion
+export { getOutputFilePath };
 //# sourceMappingURL=getOutputFilePath.mjs.map

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

@@ -1 +1 @@
-{"version":3,"file":"getOutputFilePath.mjs","names":[],"sources":["../../../src/utils/getOutputFilePath.ts"],"sourcesContent":["import type { LocalesValues } from '@intlayer/types/module_augmentation';\n\n/**\n * Get the output file path by replacing the base locale with the target locale\n *\n * This function handles two types of replacements:\n * 1. Actual locale values (e.g., `/en/` → `/fr/`)\n * 2. Template placeholders (e.g., `{{baseLocale}}` → `{{locale}}`, `{{baseLocaleName}}` → `{{localeName}}`)\n *\n * Replacement patterns:\n * - `/baseLocale/` → `/locale/`\n * - `\\baseLocale\\` → `\\locale\\`\n * - `_baseLocale.` → `_locale.`\n * - `baseLocale_` → `locale_`\n * - `.baseLocaleName.` → `.localeName.`\n * - `{{baseLocale}}` → `{{locale}}`\n * - `{{baseLocaleName}}` → `{{localeName}}`\n *\n * If no patterns match, appends `.locale` to the file extension.\n *\n * @param filePath - The input file path\n * @param locale - The target locale\n * @param baseLocale - The base locale to replace\n * @returns The output file path with locale replacements\n */\nexport const getOutputFilePath = (\n  filePath: string,\n  locale: LocalesValues,\n  baseLocale: LocalesValues\n): string => {\n  if (!filePath || !locale || !baseLocale) {\n    throw new Error('filePath, locale, and baseLocale are required');\n  }\n\n  let outputFilePath = filePath;\n\n  // Define replacement patterns with global flag to replace all occurrences\n  const replacements = [\n    // Template placeholders (processed first)\n    {\n      pattern: /\\{\\{baseLocale\\}\\}/g,\n      replacement: '{{locale}}',\n    },\n    {\n      pattern: /\\{\\{baseLocaleName\\}\\}/g,\n      replacement: '{{localeName}}',\n    },\n\n    // Path separators (most specific first)\n    {\n      // Unix path separators\n      pattern: new RegExp(`/${baseLocale}/`, 'g'),\n      replacement: `/${locale}/`,\n    },\n    {\n      // Windows path separators\n      pattern: new RegExp(`\\\\\\\\${baseLocale}\\\\\\\\`, 'g'),\n      replacement: `\\\\${locale}\\\\`,\n    },\n\n    // File naming patterns\n    {\n      // file_en.md → file_fr.md\n      pattern: new RegExp(`_${baseLocale}\\\\.`, 'g'),\n      replacement: `_${locale}.`,\n    },\n    {\n      // /file_en.md → /file_fr.md\n      pattern: new RegExp(`/${baseLocale}_`, 'g'),\n      replacement: `/${locale}_`,\n    },\n    {\n      // Start of filename pattern en_guide.md → fr_guide.md (or after path separator)\n      pattern: new RegExp(`(^|[\\\\/])${baseLocale}_`, 'g'),\n      replacement: `$1${locale}_`,\n    },\n    {\n      // Dot delimited pattern guide.en.md → guide.fr.md\n      pattern: new RegExp(`\\\\.${baseLocale}\\\\.`, 'g'),\n      replacement: `.${locale}.`,\n    },\n  ];\n\n  // Apply all replacements\n  for (const { pattern, replacement } of replacements) {\n    outputFilePath = outputFilePath.replace(pattern, replacement);\n  }\n\n  // If no changes were made, append locale as extension\n  if (outputFilePath === filePath) {\n    const lastDotIndex = filePath.lastIndexOf('.');\n    if (lastDotIndex > 0) {\n      // Insert locale before the file extension\n      return `${filePath.slice(0, lastDotIndex)}.${locale}${filePath.slice(lastDotIndex)}`;\n    } else {\n      // No extension found, just append\n      return `${filePath}.${locale}`;\n    }\n  }\n\n  return outputFilePath;\n};\n"],"mappings":"AAyBA,MAAa,GACX,EACA,EACA,IACW,CACX,GAAI,CAAC,GAAY,CAAC,GAAU,CAAC,EAC3B,MAAU,MAAM,gDAAgD,CAGlE,IAAI,EAAiB,EAGf,EAAe,CAEnB,CACE,QAAS,sBACT,YAAa,aACd,CACD,CACE,QAAS,0BACT,YAAa,iBACd,CAGD,CAEE,QAAa,OAAO,IAAI,EAAW,GAAI,IAAI,CAC3C,YAAa,IAAI,EAAO,GACzB,CACD,CAEE,QAAa,OAAO,OAAO,EAAW,MAAO,IAAI,CACjD,YAAa,KAAK,EAAO,IAC1B,CAGD,CAEE,QAAa,OAAO,IAAI,EAAW,KAAM,IAAI,CAC7C,YAAa,IAAI,EAAO,GACzB,CACD,CAEE,QAAa,OAAO,IAAI,EAAW,GAAI,IAAI,CAC3C,YAAa,IAAI,EAAO,GACzB,CACD,CAEE,QAAa,OAAO,YAAY,EAAW,GAAI,IAAI,CACnD,YAAa,KAAK,EAAO,GAC1B,CACD,CAEE,QAAa,OAAO,MAAM,EAAW,KAAM,IAAI,CAC/C,YAAa,IAAI,EAAO,GACzB,CACF,CAGD,IAAK,GAAM,CAAE,UAAS,iBAAiB,EACrC,EAAiB,EAAe,QAAQ,EAAS,EAAY,CAI/D,GAAI,IAAmB,EAAU,CAC/B,IAAM,EAAe,EAAS,YAAY,IAAI,CAM5C,OALE,EAAe,EAEV,GAAG,EAAS,MAAM,EAAG,EAAa,CAAC,GAAG,IAAS,EAAS,MAAM,EAAa,GAG3E,GAAG,EAAS,GAAG,IAI1B,OAAO"}
+{"version":3,"file":"getOutputFilePath.mjs","names":[],"sources":["../../../src/utils/getOutputFilePath.ts"],"sourcesContent":["import type { LocalesValues } from '@intlayer/types/module_augmentation';\n\n/**\n * Get the output file path by replacing the base locale with the target locale\n *\n * This function handles two types of replacements:\n * 1. Actual locale values (e.g., `/en/` → `/fr/`)\n * 2. Template placeholders (e.g., `{{baseLocale}}` → `{{locale}}`, `{{baseLocaleName}}` → `{{localeName}}`)\n *\n * Replacement patterns:\n * - `/baseLocale/` → `/locale/`\n * - `\\baseLocale\\` → `\\locale\\`\n * - `_baseLocale.` → `_locale.`\n * - `baseLocale_` → `locale_`\n * - `.baseLocaleName.` → `.localeName.`\n * - `{{baseLocale}}` → `{{locale}}`\n * - `{{baseLocaleName}}` → `{{localeName}}`\n *\n * If no patterns match, appends `.locale` to the file extension.\n *\n * @param filePath - The input file path\n * @param locale - The target locale\n * @param baseLocale - The base locale to replace\n * @returns The output file path with locale replacements\n */\nexport const getOutputFilePath = (\n  filePath: string,\n  locale: LocalesValues,\n  baseLocale: LocalesValues\n): string => {\n  if (!filePath || !locale || !baseLocale) {\n    throw new Error('filePath, locale, and baseLocale are required');\n  }\n\n  let outputFilePath = filePath;\n\n  // Define replacement patterns with global flag to replace all occurrences\n  const replacements = [\n    // Template placeholders (processed first)\n    {\n      pattern: /\\{\\{baseLocale\\}\\}/g,\n      replacement: '{{locale}}',\n    },\n    {\n      pattern: /\\{\\{baseLocaleName\\}\\}/g,\n      replacement: '{{localeName}}',\n    },\n\n    // Path separators (most specific first)\n    {\n      // Unix path separators\n      pattern: new RegExp(`/${baseLocale}/`, 'g'),\n      replacement: `/${locale}/`,\n    },\n    {\n      // Windows path separators\n      pattern: new RegExp(`\\\\\\\\${baseLocale}\\\\\\\\`, 'g'),\n      replacement: `\\\\${locale}\\\\`,\n    },\n\n    // File naming patterns\n    {\n      // file_en.md → file_fr.md\n      pattern: new RegExp(`_${baseLocale}\\\\.`, 'g'),\n      replacement: `_${locale}.`,\n    },\n    {\n      // /file_en.md → /file_fr.md\n      pattern: new RegExp(`/${baseLocale}_`, 'g'),\n      replacement: `/${locale}_`,\n    },\n    {\n      // Start of filename pattern en_guide.md → fr_guide.md (or after path separator)\n      pattern: new RegExp(`(^|[\\\\/])${baseLocale}_`, 'g'),\n      replacement: `$1${locale}_`,\n    },\n    {\n      // Dot delimited pattern guide.en.md → guide.fr.md\n      pattern: new RegExp(`\\\\.${baseLocale}\\\\.`, 'g'),\n      replacement: `.${locale}.`,\n    },\n  ];\n\n  // Apply all replacements\n  for (const { pattern, replacement } of replacements) {\n    outputFilePath = outputFilePath.replace(pattern, replacement);\n  }\n\n  // If no changes were made, append locale as extension\n  if (outputFilePath === filePath) {\n    const lastDotIndex = filePath.lastIndexOf('.');\n    if (lastDotIndex > 0) {\n      // Insert locale before the file extension\n      return `${filePath.slice(0, lastDotIndex)}.${locale}${filePath.slice(lastDotIndex)}`;\n    } else {\n      // No extension found, just append\n      return `${filePath}.${locale}`;\n    }\n  }\n\n  return outputFilePath;\n};\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;AAyBA,MAAa,qBACX,UACA,QACA,eACW;AACX,KAAI,CAAC,YAAY,CAAC,UAAU,CAAC,WAC3B,OAAM,IAAI,MAAM,gDAAgD;CAGlE,IAAI,iBAAiB;CAGrB,MAAM,eAAe;EAEnB;GACE,SAAS;GACT,aAAa;GACd;EACD;GACE,SAAS;GACT,aAAa;GACd;EAGD;GAEE,SAAS,IAAI,OAAO,IAAI,WAAW,IAAI,IAAI;GAC3C,aAAa,IAAI,OAAO;GACzB;EACD;GAEE,SAAS,IAAI,OAAO,OAAO,WAAW,OAAO,IAAI;GACjD,aAAa,KAAK,OAAO;GAC1B;EAGD;GAEE,SAAS,IAAI,OAAO,IAAI,WAAW,MAAM,IAAI;GAC7C,aAAa,IAAI,OAAO;GACzB;EACD;GAEE,SAAS,IAAI,OAAO,IAAI,WAAW,IAAI,IAAI;GAC3C,aAAa,IAAI,OAAO;GACzB;EACD;GAEE,SAAS,IAAI,OAAO,YAAY,WAAW,IAAI,IAAI;GACnD,aAAa,KAAK,OAAO;GAC1B;EACD;GAEE,SAAS,IAAI,OAAO,MAAM,WAAW,MAAM,IAAI;GAC/C,aAAa,IAAI,OAAO;GACzB;EACF;AAGD,MAAK,MAAM,EAAE,SAAS,iBAAiB,aACrC,kBAAiB,eAAe,QAAQ,SAAS,YAAY;AAI/D,KAAI,mBAAmB,UAAU;EAC/B,MAAM,eAAe,SAAS,YAAY,IAAI;AAC9C,MAAI,eAAe,EAEjB,QAAO,GAAG,SAAS,MAAM,GAAG,aAAa,CAAC,GAAG,SAAS,SAAS,MAAM,aAAa;MAGlF,QAAO,GAAG,SAAS,GAAG;;AAI1B,QAAO"}

package/dist/esm/utils/getParentPackageJSON.mjs

@@ -1,2 +1,19 @@
-import{existsSync as e,readFileSync as t}from"node:fs";import{dirname as n,resolve as r}from"node:path";const i=i=>{let a=i;for(;a!==n(a);){let i=r(a,`package.json`);if(e(i))return JSON.parse(t(i,`utf8`));a=n(a)}let o=r(a,`package.json`);if(e(o))return JSON.parse(t(o,`utf8`));throw Error(`No package.json found in any parent directory of ${i}`)};export{i as getParentPackageJSON};
+import { existsSync, readFileSync } from "node:fs";
+import { dirname, resolve } from "node:path";
+
+//#region src/utils/getParentPackageJSON.ts
+const getParentPackageJSON = (startDir) => {
+	let currentDir = startDir;
+	while (currentDir !== dirname(currentDir)) {
+		const packageJsonPath = resolve(currentDir, "package.json");
+		if (existsSync(packageJsonPath)) return JSON.parse(readFileSync(packageJsonPath, "utf8"));
+		currentDir = dirname(currentDir);
+	}
+	const rootPackageJsonPath = resolve(currentDir, "package.json");
+	if (existsSync(rootPackageJsonPath)) return JSON.parse(readFileSync(rootPackageJsonPath, "utf8"));
+	throw new Error(`No package.json found in any parent directory of ${startDir}`);
+};
+
+//#endregion
+export { getParentPackageJSON };
 //# sourceMappingURL=getParentPackageJSON.mjs.map

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

@@ -1 +1 @@
-{"version":3,"file":"getParentPackageJSON.mjs","names":[],"sources":["../../../src/utils/getParentPackageJSON.ts"],"sourcesContent":["import { existsSync, readFileSync } from 'node:fs';\nimport { dirname, resolve } from 'node:path';\n\ntype PackageJSON = {\n  name?: string;\n  version?: string;\n  private: boolean;\n  description?: string;\n  homepage?: string;\n  bugs: {\n    url?: string;\n  };\n  repository: {\n    type?: string;\n    url?: string;\n  };\n  license?: string;\n  author: {\n    name?: string;\n    url?: string;\n  };\n  contributors?: {\n    name?: string;\n    email?: string;\n    url?: string;\n  }[];\n  type?: string;\n  scripts: Record<string, string>;\n  devDependencies: Record<string, string>;\n  packageManager?: string;\n  engines: Record<string, string>;\n};\n\nexport const getParentPackageJSON = (startDir: string): PackageJSON => {\n  let currentDir = startDir;\n\n  while (currentDir !== dirname(currentDir)) {\n    // Stop when we reach the root\n    const packageJsonPath = resolve(currentDir, 'package.json');\n\n    if (existsSync(packageJsonPath)) {\n      return JSON.parse(readFileSync(packageJsonPath, 'utf8'));\n    }\n\n    // Move up one directory level\n    currentDir = dirname(currentDir);\n  }\n\n  // Check the root directory as well\n  const rootPackageJsonPath = resolve(currentDir, 'package.json');\n  if (existsSync(rootPackageJsonPath)) {\n    return JSON.parse(readFileSync(rootPackageJsonPath, 'utf8'));\n  }\n\n  // If no package.json is found in any parent directory\n  throw new Error(\n    `No package.json found in any parent directory of ${startDir}`\n  );\n};\n"],"mappings":"wGAiCA,MAAa,EAAwB,GAAkC,CACrE,IAAI,EAAa,EAEjB,KAAO,IAAe,EAAQ,EAAW,EAAE,CAEzC,IAAM,EAAkB,EAAQ,EAAY,eAAe,CAE3D,GAAI,EAAW,EAAgB,CAC7B,OAAO,KAAK,MAAM,EAAa,EAAiB,OAAO,CAAC,CAI1D,EAAa,EAAQ,EAAW,CAIlC,IAAM,EAAsB,EAAQ,EAAY,eAAe,CAC/D,GAAI,EAAW,EAAoB,CACjC,OAAO,KAAK,MAAM,EAAa,EAAqB,OAAO,CAAC,CAI9D,MAAU,MACR,oDAAoD,IACrD"}
+{"version":3,"file":"getParentPackageJSON.mjs","names":[],"sources":["../../../src/utils/getParentPackageJSON.ts"],"sourcesContent":["import { existsSync, readFileSync } from 'node:fs';\nimport { dirname, resolve } from 'node:path';\n\ntype PackageJSON = {\n  name?: string;\n  version?: string;\n  private: boolean;\n  description?: string;\n  homepage?: string;\n  bugs: {\n    url?: string;\n  };\n  repository: {\n    type?: string;\n    url?: string;\n  };\n  license?: string;\n  author: {\n    name?: string;\n    url?: string;\n  };\n  contributors?: {\n    name?: string;\n    email?: string;\n    url?: string;\n  }[];\n  type?: string;\n  scripts: Record<string, string>;\n  devDependencies: Record<string, string>;\n  packageManager?: string;\n  engines: Record<string, string>;\n};\n\nexport const getParentPackageJSON = (startDir: string): PackageJSON => {\n  let currentDir = startDir;\n\n  while (currentDir !== dirname(currentDir)) {\n    // Stop when we reach the root\n    const packageJsonPath = resolve(currentDir, 'package.json');\n\n    if (existsSync(packageJsonPath)) {\n      return JSON.parse(readFileSync(packageJsonPath, 'utf8'));\n    }\n\n    // Move up one directory level\n    currentDir = dirname(currentDir);\n  }\n\n  // Check the root directory as well\n  const rootPackageJsonPath = resolve(currentDir, 'package.json');\n  if (existsSync(rootPackageJsonPath)) {\n    return JSON.parse(readFileSync(rootPackageJsonPath, 'utf8'));\n  }\n\n  // If no package.json is found in any parent directory\n  throw new Error(\n    `No package.json found in any parent directory of ${startDir}`\n  );\n};\n"],"mappings":";;;;AAiCA,MAAa,wBAAwB,aAAkC;CACrE,IAAI,aAAa;AAEjB,QAAO,eAAe,QAAQ,WAAW,EAAE;EAEzC,MAAM,kBAAkB,QAAQ,YAAY,eAAe;AAE3D,MAAI,WAAW,gBAAgB,CAC7B,QAAO,KAAK,MAAM,aAAa,iBAAiB,OAAO,CAAC;AAI1D,eAAa,QAAQ,WAAW;;CAIlC,MAAM,sBAAsB,QAAQ,YAAY,eAAe;AAC/D,KAAI,WAAW,oBAAoB,CACjC,QAAO,KAAK,MAAM,aAAa,qBAAqB,OAAO,CAAC;AAI9D,OAAM,IAAI,MACR,oDAAoD,WACrD"}

package/dist/esm/utils/listSpecialChars.mjs

@@ -1,3 +1,53 @@
-const e=[`  `,`\\`,`|`,`(`,`)`,`{`,`}`,`[`,`]`,`<`,`>`,`"`,`=`,`+`,`*`,`&`,`#`,`%`,`$`,`!`,`?`,`:`,`;`,`~`],t=t=>{let n=[],r=0;for(let i=0;i<t.length;i++){let a=t[i];if(a===`
-`){n.push({char:`\\`,lineStart:r,charStart:i}),r++;continue}e.includes(a)&&n.push({char:a,lineStart:r,charStart:i})}return n};export{t as listSpecialChars};
+//#region src/utils/listSpecialChars.ts
+const SPECIAL_CHARS = [
+	"  ",
+	"\\",
+	"|",
+	"(",
+	")",
+	"{",
+	"}",
+	"[",
+	"]",
+	"<",
+	">",
+	"\"",
+	"=",
+	"+",
+	"*",
+	"&",
+	"#",
+	"%",
+	"$",
+	"!",
+	"?",
+	":",
+	";",
+	"~"
+];
+const listSpecialChars = (text) => {
+	const results = [];
+	let lineIndex = 0;
+	for (let i = 0; i < text.length; i++) {
+		const currentChar = text[i];
+		if (currentChar === "\n") {
+			results.push({
+				char: "\\",
+				lineStart: lineIndex,
+				charStart: i
+			});
+			lineIndex++;
+			continue;
+		}
+		if (SPECIAL_CHARS.includes(currentChar)) results.push({
+			char: currentChar,
+			lineStart: lineIndex,
+			charStart: i
+		});
+	}
+	return results;
+};
+
+//#endregion
+export { listSpecialChars };
 //# sourceMappingURL=listSpecialChars.mjs.map

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

@@ -1 +1 @@
-{"version":3,"file":"listSpecialChars.mjs","names":[],"sources":["../../../src/utils/listSpecialChars.ts"],"sourcesContent":["type ListCharResult = {\n  char: string;\n  /** First line index contained in this chunk (0-based)             */\n  lineStart: number;\n  /** Start character index in the original text (0-based, inclusive)*/\n  charStart: number;\n}[];\n\nconst SPECIAL_CHARS = [\n  '  ',\n  '\\\\',\n  '|',\n  '(',\n  ')',\n  '{',\n  '}',\n  '[',\n  ']',\n  '<',\n  '>',\n  '\"',\n  '=',\n  '+',\n  '*',\n  '&',\n  '#',\n  '%',\n  '$',\n  '!',\n  '?',\n  ':',\n  ';',\n  '~',\n];\n\nexport const listSpecialChars = (text: string): ListCharResult => {\n  const results: ListCharResult = [];\n\n  let lineIndex = 0;\n\n  for (let i = 0; i < text.length; i++) {\n    const currentChar = text[i];\n\n    // Handle newline characters (\"\\n\"): treat them as a \"\\\\\" special char\n    if (currentChar === '\\n') {\n      results.push({\n        char: '\\\\',\n        lineStart: lineIndex,\n        charStart: i,\n      });\n\n      // Move to the next line after recording the special char\n      lineIndex++;\n      continue;\n    }\n\n    // Check if the current character is one of the special characters\n    if (SPECIAL_CHARS.includes(currentChar)) {\n      results.push({\n        char: currentChar,\n        lineStart: lineIndex,\n        charStart: i,\n      });\n    }\n  }\n\n  return results;\n};\n"],"mappings":"AAQA,MAAM,EAAgB,CACpB,KACA,KACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACD,CAEY,EAAoB,GAAiC,CAChE,IAAM,EAA0B,EAAE,CAE9B,EAAY,EAEhB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAK,OAAQ,IAAK,CACpC,IAAM,EAAc,EAAK,GAGzB,GAAI,IAAgB;EAAM,CACxB,EAAQ,KAAK,CACX,KAAM,KACN,UAAW,EACX,UAAW,EACZ,CAAC,CAGF,IACA,SAIE,EAAc,SAAS,EAAY,EACrC,EAAQ,KAAK,CACX,KAAM,EACN,UAAW,EACX,UAAW,EACZ,CAAC,CAIN,OAAO"}
+{"version":3,"file":"listSpecialChars.mjs","names":[],"sources":["../../../src/utils/listSpecialChars.ts"],"sourcesContent":["type ListCharResult = {\n  char: string;\n  /** First line index contained in this chunk (0-based)             */\n  lineStart: number;\n  /** Start character index in the original text (0-based, inclusive)*/\n  charStart: number;\n}[];\n\nconst SPECIAL_CHARS = [\n  '  ',\n  '\\\\',\n  '|',\n  '(',\n  ')',\n  '{',\n  '}',\n  '[',\n  ']',\n  '<',\n  '>',\n  '\"',\n  '=',\n  '+',\n  '*',\n  '&',\n  '#',\n  '%',\n  '$',\n  '!',\n  '?',\n  ':',\n  ';',\n  '~',\n];\n\nexport const listSpecialChars = (text: string): ListCharResult => {\n  const results: ListCharResult = [];\n\n  let lineIndex = 0;\n\n  for (let i = 0; i < text.length; i++) {\n    const currentChar = text[i];\n\n    // Handle newline characters (\"\\n\"): treat them as a \"\\\\\" special char\n    if (currentChar === '\\n') {\n      results.push({\n        char: '\\\\',\n        lineStart: lineIndex,\n        charStart: i,\n      });\n\n      // Move to the next line after recording the special char\n      lineIndex++;\n      continue;\n    }\n\n    // Check if the current character is one of the special characters\n    if (SPECIAL_CHARS.includes(currentChar)) {\n      results.push({\n        char: currentChar,\n        lineStart: lineIndex,\n        charStart: i,\n      });\n    }\n  }\n\n  return results;\n};\n"],"mappings":";AAQA,MAAM,gBAAgB;CACpB;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACD;AAED,MAAa,oBAAoB,SAAiC;CAChE,MAAM,UAA0B,EAAE;CAElC,IAAI,YAAY;AAEhB,MAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;EACpC,MAAM,cAAc,KAAK;AAGzB,MAAI,gBAAgB,MAAM;AACxB,WAAQ,KAAK;IACX,MAAM;IACN,WAAW;IACX,WAAW;IACZ,CAAC;AAGF;AACA;;AAIF,MAAI,cAAc,SAAS,YAAY,CACrC,SAAQ,KAAK;GACX,MAAM;GACN,WAAW;GACX,WAAW;GACZ,CAAC;;AAIN,QAAO"}

package/dist/esm/utils/mapChunksBetweenFiles.mjs

@@ -1,2 +1,101 @@
-import{chunkText as e}from"./calculateChunks.mjs";import{splitTextByLines as t}from"@intlayer/chokidar/utils";const n=(n,c,l=800,u)=>{let d=e(n,l,0),f=t(n),p=t(c),m=r(f,p);return d.map(e=>{let t=i(e.lineStart,e.lineLength,m);if(!t)return{baseChunk:e,updatedChunk:null,hasChanges:!0};let n={lineStart:t.start,lineLength:t.length,charStart:0,charLength:0,content:a(p,t.start,t.length)};return n.charStart=o(c,n.lineStart),n.charLength=n.content.length,{baseChunk:e,updatedChunk:n,hasChanges:s(e,n,u)}})},r=(e,t)=>{let n=new Map,r=Array(e.length+1).fill(null).map(()=>Array(t.length+1).fill(0));for(let n=1;n<=e.length;n++)for(let i=1;i<=t.length;i++)e[n-1]===t[i-1]?r[n][i]=r[n-1][i-1]+1:r[n][i]=Math.max(r[n-1][i],r[n][i-1]);let i=e.length,a=t.length;for(;i>0||a>0;)i>0&&a>0&&e[i-1]===t[a-1]?(n.set(i-1,a-1),i--,a--):i>0&&(a===0||r[i-1][a]>=r[i][a-1])?(n.set(i-1,null),i--):a--;return n},i=(e,t,n)=>{let r=[];for(let i=e;i<e+t;i++){let e=n.get(i);e!=null&&r.push(e)}if(r.length===0)return null;r.sort((e,t)=>e-t);let i=r[0];return{start:i,length:r[r.length-1]-i+1}},a=(e,t,n)=>{let r=Math.min(t+n,e.length);return e.slice(t,r).join(``)},o=(e,n)=>{let r=t(e),i=0;for(let e=0;e<Math.min(n,r.length);e++)i+=r[e].length;return i},s=(e,t,n)=>n&&n.length>0?n.some(e=>e>=t.lineStart&&e<t.lineStart+t.lineLength):e.content!==t.content;export{n as mapChunksBetweenFiles};
+import { chunkText } from "./calculateChunks.mjs";
+import { splitTextByLines } from "@intlayer/chokidar/utils";
+
+//#region src/utils/mapChunksBetweenFiles.ts
+/**
+* Maps chunks from base file to corresponding chunks in updated file,
+* handling insertions, deletions, and modifications properly.
+*/
+const mapChunksBetweenFiles = (baseFileContent, updatedFileContent, maxCharsPerChunk = 800, changedLines) => {
+	const baseChunks = chunkText(baseFileContent, maxCharsPerChunk, 0);
+	const baseLines = splitTextByLines(baseFileContent);
+	const updatedLines = splitTextByLines(updatedFileContent);
+	const lineMapping = createLineMapping(baseLines, updatedLines);
+	return baseChunks.map((baseChunk) => {
+		const mappedRange = mapLineRange(baseChunk.lineStart, baseChunk.lineLength, lineMapping);
+		if (!mappedRange) return {
+			baseChunk,
+			updatedChunk: null,
+			hasChanges: true
+		};
+		const updatedChunk = {
+			lineStart: mappedRange.start,
+			lineLength: mappedRange.length,
+			charStart: 0,
+			charLength: 0,
+			content: extractLinesFromRange(updatedLines, mappedRange.start, mappedRange.length)
+		};
+		updatedChunk.charStart = getCharStartForLine(updatedFileContent, updatedChunk.lineStart);
+		updatedChunk.charLength = updatedChunk.content.length;
+		return {
+			baseChunk,
+			updatedChunk,
+			hasChanges: determineIfChunkHasChanges(baseChunk, updatedChunk, changedLines)
+		};
+	});
+};
+/**
+* Creates a mapping between line numbers in base file and updated file
+* Returns a map where key = base line number, value = updated line number (or null if deleted)
+*/
+const createLineMapping = (baseLines, updatedLines) => {
+	const mapping = /* @__PURE__ */ new Map();
+	const dp = Array(baseLines.length + 1).fill(null).map(() => Array(updatedLines.length + 1).fill(0));
+	for (let i = 1; i <= baseLines.length; i++) for (let j = 1; j <= updatedLines.length; j++) if (baseLines[i - 1] === updatedLines[j - 1]) dp[i][j] = dp[i - 1][j - 1] + 1;
+	else dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1]);
+	let i = baseLines.length;
+	let j = updatedLines.length;
+	while (i > 0 || j > 0) if (i > 0 && j > 0 && baseLines[i - 1] === updatedLines[j - 1]) {
+		mapping.set(i - 1, j - 1);
+		i--;
+		j--;
+	} else if (i > 0 && (j === 0 || dp[i - 1][j] >= dp[i][j - 1])) {
+		mapping.set(i - 1, null);
+		i--;
+	} else j--;
+	return mapping;
+};
+/**
+* Maps a line range from base file to updated file using the line mapping
+*/
+const mapLineRange = (baseStart, baseLength, lineMapping) => {
+	const mappedLines = [];
+	for (let i = baseStart; i < baseStart + baseLength; i++) {
+		const mappedLine = lineMapping.get(i);
+		if (mappedLine !== null && mappedLine !== void 0) mappedLines.push(mappedLine);
+	}
+	if (mappedLines.length === 0) return null;
+	mappedLines.sort((a, b) => a - b);
+	const start = mappedLines[0];
+	return {
+		start,
+		length: mappedLines[mappedLines.length - 1] - start + 1
+	};
+};
+/**
+* Extracts lines from a range in the lines array
+*/
+const extractLinesFromRange = (lines, start, length) => {
+	const endIndex = Math.min(start + length, lines.length);
+	return lines.slice(start, endIndex).join("");
+};
+/**
+* Gets the character position where a line starts in the text
+*/
+const getCharStartForLine = (text, lineNumber) => {
+	const lines = splitTextByLines(text);
+	let charStart = 0;
+	for (let i = 0; i < Math.min(lineNumber, lines.length); i++) charStart += lines[i].length;
+	return charStart;
+};
+/**
+* Determines if a chunk has changes based on git changed lines or content comparison
+*/
+const determineIfChunkHasChanges = (baseChunk, updatedChunk, changedLines) => {
+	if (changedLines && changedLines.length > 0) return changedLines.some((line) => line >= updatedChunk.lineStart && line < updatedChunk.lineStart + updatedChunk.lineLength);
+	return baseChunk.content !== updatedChunk.content;
+};
+
+//#endregion
+export { mapChunksBetweenFiles };
 //# sourceMappingURL=mapChunksBetweenFiles.mjs.map

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

@@ -1 +1 @@
-{"version":3,"file":"mapChunksBetweenFiles.mjs","names":[],"sources":["../../../src/utils/mapChunksBetweenFiles.ts"],"sourcesContent":["import { splitTextByLines } from '@intlayer/chokidar/utils';\nimport { type ChunkLineResult, chunkText } from './calculateChunks';\n\nexport interface ChunkMapping {\n  baseChunk: ChunkLineResult;\n  updatedChunk: ChunkLineResult | null; // null if the chunk was deleted\n  hasChanges: boolean;\n}\n\n/**\n * Maps chunks from base file to corresponding chunks in updated file,\n * handling insertions, deletions, and modifications properly.\n */\nexport const mapChunksBetweenFiles = (\n  baseFileContent: string,\n  updatedFileContent: string,\n  maxCharsPerChunk: number = 800,\n  changedLines?: number[]\n): ChunkMapping[] => {\n  const baseChunks = chunkText(baseFileContent, maxCharsPerChunk, 0);\n  const baseLines = splitTextByLines(baseFileContent);\n  const updatedLines = splitTextByLines(updatedFileContent);\n\n  // Create a simple line mapping using LCS (Longest Common Subsequence) approach\n  const lineMapping = createLineMapping(baseLines, updatedLines);\n\n  return baseChunks.map((baseChunk): ChunkMapping => {\n    // Map the base chunk's line range to the updated file\n    const mappedRange = mapLineRange(\n      baseChunk.lineStart,\n      baseChunk.lineLength,\n      lineMapping\n    );\n\n    if (!mappedRange) {\n      // This chunk was completely deleted\n      return {\n        baseChunk,\n        updatedChunk: null,\n        hasChanges: true,\n      };\n    }\n\n    // Create the corresponding chunk in the updated file\n    const updatedChunk: ChunkLineResult = {\n      lineStart: mappedRange.start,\n      lineLength: mappedRange.length,\n      charStart: 0, // Will be calculated when needed\n      charLength: 0, // Will be calculated when needed\n      content: extractLinesFromRange(\n        updatedLines,\n        mappedRange.start,\n        mappedRange.length\n      ),\n    };\n\n    // Calculate character positions\n    updatedChunk.charStart = getCharStartForLine(\n      updatedFileContent,\n      updatedChunk.lineStart\n    );\n    updatedChunk.charLength = updatedChunk.content.length;\n\n    // Determine if this chunk has changes\n    const hasChanges = determineIfChunkHasChanges(\n      baseChunk,\n      updatedChunk,\n      changedLines\n    );\n\n    return {\n      baseChunk,\n      updatedChunk,\n      hasChanges,\n    };\n  });\n};\n\n/**\n * Creates a mapping between line numbers in base file and updated file\n * Returns a map where key = base line number, value = updated line number (or null if deleted)\n */\nconst createLineMapping = (\n  baseLines: string[],\n  updatedLines: string[]\n): Map<number, number | null> => {\n  const mapping = new Map<number, number | null>();\n\n  // Use a simple diff algorithm (similar to Myers algorithm but simplified)\n  const dp: number[][] = Array(baseLines.length + 1)\n    .fill(null)\n    .map(() => Array(updatedLines.length + 1).fill(0));\n\n  // Fill the DP table\n  for (let i = 1; i <= baseLines.length; i++) {\n    for (let j = 1; j <= updatedLines.length; j++) {\n      if (baseLines[i - 1] === updatedLines[j - 1]) {\n        dp[i][j] = dp[i - 1][j - 1] + 1;\n      } else {\n        dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1]);\n      }\n    }\n  }\n\n  // Backtrack to create the mapping\n  let i = baseLines.length;\n  let j = updatedLines.length;\n\n  while (i > 0 || j > 0) {\n    if (i > 0 && j > 0 && baseLines[i - 1] === updatedLines[j - 1]) {\n      // Lines match\n      mapping.set(i - 1, j - 1);\n      i--;\n      j--;\n    } else if (i > 0 && (j === 0 || dp[i - 1][j] >= dp[i][j - 1])) {\n      // Line was deleted from base\n      mapping.set(i - 1, null);\n      i--;\n    } else {\n      // Line was added to updated (no mapping needed for base)\n      j--;\n    }\n  }\n\n  return mapping;\n};\n\n/**\n * Maps a line range from base file to updated file using the line mapping\n */\nconst mapLineRange = (\n  baseStart: number,\n  baseLength: number,\n  lineMapping: Map<number, number | null>\n): { start: number; length: number } | null => {\n  const mappedLines: number[] = [];\n\n  for (let i = baseStart; i < baseStart + baseLength; i++) {\n    const mappedLine = lineMapping.get(i);\n    if (mappedLine !== null && mappedLine !== undefined) {\n      mappedLines.push(mappedLine);\n    }\n  }\n\n  if (mappedLines.length === 0) {\n    return null; // All lines were deleted\n  }\n\n  // Find the continuous range in the mapped lines\n  mappedLines.sort((a, b) => a - b);\n  const start = mappedLines[0];\n  const end = mappedLines[mappedLines.length - 1];\n\n  return {\n    start,\n    length: end - start + 1,\n  };\n};\n\n/**\n * Extracts lines from a range in the lines array\n */\nconst extractLinesFromRange = (\n  lines: string[],\n  start: number,\n  length: number\n): string => {\n  const endIndex = Math.min(start + length, lines.length);\n  return lines.slice(start, endIndex).join('');\n};\n\n/**\n * Gets the character position where a line starts in the text\n */\nconst getCharStartForLine = (text: string, lineNumber: number): number => {\n  const lines = splitTextByLines(text);\n  let charStart = 0;\n\n  for (let i = 0; i < Math.min(lineNumber, lines.length); i++) {\n    charStart += lines[i].length;\n  }\n\n  return charStart;\n};\n\n/**\n * Determines if a chunk has changes based on git changed lines or content comparison\n */\nconst determineIfChunkHasChanges = (\n  baseChunk: ChunkLineResult,\n  updatedChunk: ChunkLineResult,\n  changedLines?: number[]\n): boolean => {\n  // If we have git changed lines, use them for precise detection\n  if (changedLines && changedLines.length > 0) {\n    return changedLines.some(\n      (line) =>\n        line >= updatedChunk.lineStart &&\n        line < updatedChunk.lineStart + updatedChunk.lineLength\n    );\n  }\n\n  // Fallback to content comparison\n  return baseChunk.content !== updatedChunk.content;\n};\n"],"mappings":"8GAaA,MAAa,GACX,EACA,EACA,EAA2B,IAC3B,IACmB,CACnB,IAAM,EAAa,EAAU,EAAiB,EAAkB,EAAE,CAC5D,EAAY,EAAiB,EAAgB,CAC7C,EAAe,EAAiB,EAAmB,CAGnD,EAAc,EAAkB,EAAW,EAAa,CAE9D,OAAO,EAAW,IAAK,GAA4B,CAEjD,IAAM,EAAc,EAClB,EAAU,UACV,EAAU,WACV,EACD,CAED,GAAI,CAAC,EAEH,MAAO,CACL,YACA,aAAc,KACd,WAAY,GACb,CAIH,IAAM,EAAgC,CACpC,UAAW,EAAY,MACvB,WAAY,EAAY,OACxB,UAAW,EACX,WAAY,EACZ,QAAS,EACP,EACA,EAAY,MACZ,EAAY,OACb,CACF,CAgBD,MAbA,GAAa,UAAY,EACvB,EACA,EAAa,UACd,CACD,EAAa,WAAa,EAAa,QAAQ,OASxC,CACL,YACA,eACA,WATiB,EACjB,EACA,EACA,EACD,CAMA,EACD,EAOE,GACJ,EACA,IAC+B,CAC/B,IAAM,EAAU,IAAI,IAGd,EAAiB,MAAM,EAAU,OAAS,EAAE,CAC/C,KAAK,KAAK,CACV,QAAU,MAAM,EAAa,OAAS,EAAE,CAAC,KAAK,EAAE,CAAC,CAGpD,IAAK,IAAI,EAAI,EAAG,GAAK,EAAU,OAAQ,IACrC,IAAK,IAAI,EAAI,EAAG,GAAK,EAAa,OAAQ,IACpC,EAAU,EAAI,KAAO,EAAa,EAAI,GACxC,EAAG,GAAG,GAAK,EAAG,EAAI,GAAG,EAAI,GAAK,EAE9B,EAAG,GAAG,GAAK,KAAK,IAAI,EAAG,EAAI,GAAG,GAAI,EAAG,GAAG,EAAI,GAAG,CAMrD,IAAI,EAAI,EAAU,OACd,EAAI,EAAa,OAErB,KAAO,EAAI,GAAK,EAAI,GACd,EAAI,GAAK,EAAI,GAAK,EAAU,EAAI,KAAO,EAAa,EAAI,IAE1D,EAAQ,IAAI,EAAI,EAAG,EAAI,EAAE,CACzB,IACA,KACS,EAAI,IAAM,IAAM,GAAK,EAAG,EAAI,GAAG,IAAM,EAAG,GAAG,EAAI,KAExD,EAAQ,IAAI,EAAI,EAAG,KAAK,CACxB,KAGA,IAIJ,OAAO,GAMH,GACJ,EACA,EACA,IAC6C,CAC7C,IAAM,EAAwB,EAAE,CAEhC,IAAK,IAAI,EAAI,EAAW,EAAI,EAAY,EAAY,IAAK,CACvD,IAAM,EAAa,EAAY,IAAI,EAAE,CACjC,GAAe,MACjB,EAAY,KAAK,EAAW,CAIhC,GAAI,EAAY,SAAW,EACzB,OAAO,KAIT,EAAY,MAAM,EAAG,IAAM,EAAI,EAAE,CACjC,IAAM,EAAQ,EAAY,GAG1B,MAAO,CACL,QACA,OAJU,EAAY,EAAY,OAAS,GAI7B,EAAQ,EACvB,EAMG,GACJ,EACA,EACA,IACW,CACX,IAAM,EAAW,KAAK,IAAI,EAAQ,EAAQ,EAAM,OAAO,CACvD,OAAO,EAAM,MAAM,EAAO,EAAS,CAAC,KAAK,GAAG,EAMxC,GAAuB,EAAc,IAA+B,CACxE,IAAM,EAAQ,EAAiB,EAAK,CAChC,EAAY,EAEhB,IAAK,IAAI,EAAI,EAAG,EAAI,KAAK,IAAI,EAAY,EAAM,OAAO,CAAE,IACtD,GAAa,EAAM,GAAG,OAGxB,OAAO,GAMH,GACJ,EACA,EACA,IAGI,GAAgB,EAAa,OAAS,EACjC,EAAa,KACjB,GACC,GAAQ,EAAa,WACrB,EAAO,EAAa,UAAY,EAAa,WAChD,CAII,EAAU,UAAY,EAAa"}
+{"version":3,"file":"mapChunksBetweenFiles.mjs","names":[],"sources":["../../../src/utils/mapChunksBetweenFiles.ts"],"sourcesContent":["import { splitTextByLines } from '@intlayer/chokidar/utils';\nimport { type ChunkLineResult, chunkText } from './calculateChunks';\n\nexport interface ChunkMapping {\n  baseChunk: ChunkLineResult;\n  updatedChunk: ChunkLineResult | null; // null if the chunk was deleted\n  hasChanges: boolean;\n}\n\n/**\n * Maps chunks from base file to corresponding chunks in updated file,\n * handling insertions, deletions, and modifications properly.\n */\nexport const mapChunksBetweenFiles = (\n  baseFileContent: string,\n  updatedFileContent: string,\n  maxCharsPerChunk: number = 800,\n  changedLines?: number[]\n): ChunkMapping[] => {\n  const baseChunks = chunkText(baseFileContent, maxCharsPerChunk, 0);\n  const baseLines = splitTextByLines(baseFileContent);\n  const updatedLines = splitTextByLines(updatedFileContent);\n\n  // Create a simple line mapping using LCS (Longest Common Subsequence) approach\n  const lineMapping = createLineMapping(baseLines, updatedLines);\n\n  return baseChunks.map((baseChunk): ChunkMapping => {\n    // Map the base chunk's line range to the updated file\n    const mappedRange = mapLineRange(\n      baseChunk.lineStart,\n      baseChunk.lineLength,\n      lineMapping\n    );\n\n    if (!mappedRange) {\n      // This chunk was completely deleted\n      return {\n        baseChunk,\n        updatedChunk: null,\n        hasChanges: true,\n      };\n    }\n\n    // Create the corresponding chunk in the updated file\n    const updatedChunk: ChunkLineResult = {\n      lineStart: mappedRange.start,\n      lineLength: mappedRange.length,\n      charStart: 0, // Will be calculated when needed\n      charLength: 0, // Will be calculated when needed\n      content: extractLinesFromRange(\n        updatedLines,\n        mappedRange.start,\n        mappedRange.length\n      ),\n    };\n\n    // Calculate character positions\n    updatedChunk.charStart = getCharStartForLine(\n      updatedFileContent,\n      updatedChunk.lineStart\n    );\n    updatedChunk.charLength = updatedChunk.content.length;\n\n    // Determine if this chunk has changes\n    const hasChanges = determineIfChunkHasChanges(\n      baseChunk,\n      updatedChunk,\n      changedLines\n    );\n\n    return {\n      baseChunk,\n      updatedChunk,\n      hasChanges,\n    };\n  });\n};\n\n/**\n * Creates a mapping between line numbers in base file and updated file\n * Returns a map where key = base line number, value = updated line number (or null if deleted)\n */\nconst createLineMapping = (\n  baseLines: string[],\n  updatedLines: string[]\n): Map<number, number | null> => {\n  const mapping = new Map<number, number | null>();\n\n  // Use a simple diff algorithm (similar to Myers algorithm but simplified)\n  const dp: number[][] = Array(baseLines.length + 1)\n    .fill(null)\n    .map(() => Array(updatedLines.length + 1).fill(0));\n\n  // Fill the DP table\n  for (let i = 1; i <= baseLines.length; i++) {\n    for (let j = 1; j <= updatedLines.length; j++) {\n      if (baseLines[i - 1] === updatedLines[j - 1]) {\n        dp[i][j] = dp[i - 1][j - 1] + 1;\n      } else {\n        dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1]);\n      }\n    }\n  }\n\n  // Backtrack to create the mapping\n  let i = baseLines.length;\n  let j = updatedLines.length;\n\n  while (i > 0 || j > 0) {\n    if (i > 0 && j > 0 && baseLines[i - 1] === updatedLines[j - 1]) {\n      // Lines match\n      mapping.set(i - 1, j - 1);\n      i--;\n      j--;\n    } else if (i > 0 && (j === 0 || dp[i - 1][j] >= dp[i][j - 1])) {\n      // Line was deleted from base\n      mapping.set(i - 1, null);\n      i--;\n    } else {\n      // Line was added to updated (no mapping needed for base)\n      j--;\n    }\n  }\n\n  return mapping;\n};\n\n/**\n * Maps a line range from base file to updated file using the line mapping\n */\nconst mapLineRange = (\n  baseStart: number,\n  baseLength: number,\n  lineMapping: Map<number, number | null>\n): { start: number; length: number } | null => {\n  const mappedLines: number[] = [];\n\n  for (let i = baseStart; i < baseStart + baseLength; i++) {\n    const mappedLine = lineMapping.get(i);\n    if (mappedLine !== null && mappedLine !== undefined) {\n      mappedLines.push(mappedLine);\n    }\n  }\n\n  if (mappedLines.length === 0) {\n    return null; // All lines were deleted\n  }\n\n  // Find the continuous range in the mapped lines\n  mappedLines.sort((a, b) => a - b);\n  const start = mappedLines[0];\n  const end = mappedLines[mappedLines.length - 1];\n\n  return {\n    start,\n    length: end - start + 1,\n  };\n};\n\n/**\n * Extracts lines from a range in the lines array\n */\nconst extractLinesFromRange = (\n  lines: string[],\n  start: number,\n  length: number\n): string => {\n  const endIndex = Math.min(start + length, lines.length);\n  return lines.slice(start, endIndex).join('');\n};\n\n/**\n * Gets the character position where a line starts in the text\n */\nconst getCharStartForLine = (text: string, lineNumber: number): number => {\n  const lines = splitTextByLines(text);\n  let charStart = 0;\n\n  for (let i = 0; i < Math.min(lineNumber, lines.length); i++) {\n    charStart += lines[i].length;\n  }\n\n  return charStart;\n};\n\n/**\n * Determines if a chunk has changes based on git changed lines or content comparison\n */\nconst determineIfChunkHasChanges = (\n  baseChunk: ChunkLineResult,\n  updatedChunk: ChunkLineResult,\n  changedLines?: number[]\n): boolean => {\n  // If we have git changed lines, use them for precise detection\n  if (changedLines && changedLines.length > 0) {\n    return changedLines.some(\n      (line) =>\n        line >= updatedChunk.lineStart &&\n        line < updatedChunk.lineStart + updatedChunk.lineLength\n    );\n  }\n\n  // Fallback to content comparison\n  return baseChunk.content !== updatedChunk.content;\n};\n"],"mappings":";;;;;;;;AAaA,MAAa,yBACX,iBACA,oBACA,mBAA2B,KAC3B,iBACmB;CACnB,MAAM,aAAa,UAAU,iBAAiB,kBAAkB,EAAE;CAClE,MAAM,YAAY,iBAAiB,gBAAgB;CACnD,MAAM,eAAe,iBAAiB,mBAAmB;CAGzD,MAAM,cAAc,kBAAkB,WAAW,aAAa;AAE9D,QAAO,WAAW,KAAK,cAA4B;EAEjD,MAAM,cAAc,aAClB,UAAU,WACV,UAAU,YACV,YACD;AAED,MAAI,CAAC,YAEH,QAAO;GACL;GACA,cAAc;GACd,YAAY;GACb;EAIH,MAAM,eAAgC;GACpC,WAAW,YAAY;GACvB,YAAY,YAAY;GACxB,WAAW;GACX,YAAY;GACZ,SAAS,sBACP,cACA,YAAY,OACZ,YAAY,OACb;GACF;AAGD,eAAa,YAAY,oBACvB,oBACA,aAAa,UACd;AACD,eAAa,aAAa,aAAa,QAAQ;AAS/C,SAAO;GACL;GACA;GACA,YATiB,2BACjB,WACA,cACA,aACD;GAMA;GACD;;;;;;AAOJ,MAAM,qBACJ,WACA,iBAC+B;CAC/B,MAAM,0BAAU,IAAI,KAA4B;CAGhD,MAAM,KAAiB,MAAM,UAAU,SAAS,EAAE,CAC/C,KAAK,KAAK,CACV,UAAU,MAAM,aAAa,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC;AAGpD,MAAK,IAAI,IAAI,GAAG,KAAK,UAAU,QAAQ,IACrC,MAAK,IAAI,IAAI,GAAG,KAAK,aAAa,QAAQ,IACxC,KAAI,UAAU,IAAI,OAAO,aAAa,IAAI,GACxC,IAAG,GAAG,KAAK,GAAG,IAAI,GAAG,IAAI,KAAK;KAE9B,IAAG,GAAG,KAAK,KAAK,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,GAAG,IAAI,GAAG;CAMrD,IAAI,IAAI,UAAU;CAClB,IAAI,IAAI,aAAa;AAErB,QAAO,IAAI,KAAK,IAAI,EAClB,KAAI,IAAI,KAAK,IAAI,KAAK,UAAU,IAAI,OAAO,aAAa,IAAI,IAAI;AAE9D,UAAQ,IAAI,IAAI,GAAG,IAAI,EAAE;AACzB;AACA;YACS,IAAI,MAAM,MAAM,KAAK,GAAG,IAAI,GAAG,MAAM,GAAG,GAAG,IAAI,KAAK;AAE7D,UAAQ,IAAI,IAAI,GAAG,KAAK;AACxB;OAGA;AAIJ,QAAO;;;;;AAMT,MAAM,gBACJ,WACA,YACA,gBAC6C;CAC7C,MAAM,cAAwB,EAAE;AAEhC,MAAK,IAAI,IAAI,WAAW,IAAI,YAAY,YAAY,KAAK;EACvD,MAAM,aAAa,YAAY,IAAI,EAAE;AACrC,MAAI,eAAe,QAAQ,eAAe,OACxC,aAAY,KAAK,WAAW;;AAIhC,KAAI,YAAY,WAAW,EACzB,QAAO;AAIT,aAAY,MAAM,GAAG,MAAM,IAAI,EAAE;CACjC,MAAM,QAAQ,YAAY;AAG1B,QAAO;EACL;EACA,QAJU,YAAY,YAAY,SAAS,KAI7B,QAAQ;EACvB;;;;;AAMH,MAAM,yBACJ,OACA,OACA,WACW;CACX,MAAM,WAAW,KAAK,IAAI,QAAQ,QAAQ,MAAM,OAAO;AACvD,QAAO,MAAM,MAAM,OAAO,SAAS,CAAC,KAAK,GAAG;;;;;AAM9C,MAAM,uBAAuB,MAAc,eAA+B;CACxE,MAAM,QAAQ,iBAAiB,KAAK;CACpC,IAAI,YAAY;AAEhB,MAAK,IAAI,IAAI,GAAG,IAAI,KAAK,IAAI,YAAY,MAAM,OAAO,EAAE,IACtD,cAAa,MAAM,GAAG;AAGxB,QAAO;;;;;AAMT,MAAM,8BACJ,WACA,cACA,iBACY;AAEZ,KAAI,gBAAgB,aAAa,SAAS,EACxC,QAAO,aAAa,MACjB,SACC,QAAQ,aAAa,aACrB,OAAO,aAAa,YAAY,aAAa,WAChD;AAIH,QAAO,UAAU,YAAY,aAAa"}

package/dist/esm/utils/openBrowser.mjs

@@ -1,2 +1,18 @@
-import{exec as e}from"node:child_process";import{platform as t}from"node:os";const n=n=>{let r=t(),i=``;i=r===`darwin`?`open "${n}"`:r===`win32`?`start "${n}"`:`xdg-open "${n}"`,e(i,e=>{e&&console.error(`Failed to open browser: ${e.message}`)})};export{n as openBrowser};
+import { exec } from "node:child_process";
+import { platform } from "node:os";
+
+//#region src/utils/openBrowser.ts
+const openBrowser = (url) => {
+	const osPlatform = platform();
+	let command = "";
+	if (osPlatform === "darwin") command = `open "${url}"`;
+	else if (osPlatform === "win32") command = `start "${url}"`;
+	else command = `xdg-open "${url}"`;
+	exec(command, (error) => {
+		if (error) console.error(`Failed to open browser: ${error.message}`);
+	});
+};
+
+//#endregion
+export { openBrowser };
 //# sourceMappingURL=openBrowser.mjs.map

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

@@ -1 +1 @@
-{"version":3,"file":"openBrowser.mjs","names":[],"sources":["../../../src/utils/openBrowser.ts"],"sourcesContent":["import { exec } from 'node:child_process';\nimport { platform } from 'node:os';\n\nexport const openBrowser = (url: string) => {\n  const osPlatform = platform();\n  let command = '';\n\n  if (osPlatform === 'darwin') {\n    command = `open \"${url}\"`;\n  } else if (osPlatform === 'win32') {\n    command = `start \"${url}\"`;\n  } else {\n    command = `xdg-open \"${url}\"`;\n  }\n\n  exec(command, (error) => {\n    if (error) {\n      console.error(`Failed to open browser: ${error.message}`);\n    }\n  });\n};\n"],"mappings":"6EAGA,MAAa,EAAe,GAAgB,CAC1C,IAAM,EAAa,GAAU,CACzB,EAAU,GAEd,AAKE,EALE,IAAe,SACP,SAAS,EAAI,GACd,IAAe,QACd,UAAU,EAAI,GAEd,aAAa,EAAI,GAG7B,EAAK,EAAU,GAAU,CACnB,GACF,QAAQ,MAAM,2BAA2B,EAAM,UAAU,EAE3D"}
+{"version":3,"file":"openBrowser.mjs","names":[],"sources":["../../../src/utils/openBrowser.ts"],"sourcesContent":["import { exec } from 'node:child_process';\nimport { platform } from 'node:os';\n\nexport const openBrowser = (url: string) => {\n  const osPlatform = platform();\n  let command = '';\n\n  if (osPlatform === 'darwin') {\n    command = `open \"${url}\"`;\n  } else if (osPlatform === 'win32') {\n    command = `start \"${url}\"`;\n  } else {\n    command = `xdg-open \"${url}\"`;\n  }\n\n  exec(command, (error) => {\n    if (error) {\n      console.error(`Failed to open browser: ${error.message}`);\n    }\n  });\n};\n"],"mappings":";;;;AAGA,MAAa,eAAe,QAAgB;CAC1C,MAAM,aAAa,UAAU;CAC7B,IAAI,UAAU;AAEd,KAAI,eAAe,SACjB,WAAU,SAAS,IAAI;UACd,eAAe,QACxB,WAAU,UAAU,IAAI;KAExB,WAAU,aAAa,IAAI;AAG7B,MAAK,UAAU,UAAU;AACvB,MAAI,MACF,SAAQ,MAAM,2BAA2B,MAAM,UAAU;GAE3D"}

package/dist/esm/utils/reorderParagraphs.mjs

@@ -1,6 +1,93 @@
-import{listSpecialChars as e}from"./listSpecialChars.mjs";const t=e=>{let t=[],n=e.split(/(\n{2,})/);for(let e=0;e<n.length;e++){let r=n[e];if(e%2==0){r&&t.push(r);continue}let i=Math.floor(r.length/2),a=Math.max(0,i-2);for(let e=0;e<a;e++)t.push(`
+import { listSpecialChars } from "./listSpecialChars.mjs";
 
-`)}return t},n=(e,t,n,r)=>{if(e===t)return!0;if(n.length!==r.length)return!1;for(let e=0;e<n.length;e++)if(n[e].char!==r[e].char)return!1;return!0},r=(r,i)=>{let a=t(i),o=t(r),s=a.map(t=>e(t)),c=o.map(t=>e(t)),l=Array(a.length).fill(-1),u=Array(o.length).fill(null);for(let e=0;e<o.length;e++){let t=o[e],r=c[e],i=a.findIndex((e,n)=>l[n]===-1&&t===e);i===-1&&(i=a.findIndex((e,i)=>l[i]===-1&&n(t,e,r,s[i]))),i!==-1&&(l[i]=e,u[e]=i)}let d=Array(o.length).fill(-1),f=-1;for(let e=0;e<o.length;e++){let t=u[e];t===null?d[e]=f:t>f&&(f=t)}let p=[],m={};d.forEach((e,t)=>{e!==-1&&(m[e]=m[e]||[],m[e].push(t))});for(let e=0;e<a.length;e++){let t=l[e];t!==-1&&p.push(o[t]),m[e]&&m[e].forEach(e=>{p.push(o[e])})}let h=[];return d.forEach((e,t)=>{e===-1&&u[t]===null&&h.push(o[t])}),[...h,...p].join(`
+//#region src/utils/reorderParagraphs.ts
+/**
+* Split a text into paragraphs.
+*
+* We consider a paragraph boundary to be a block of at least two consecutive
+* new-lines that is immediately followed by a non-white-space character.  This
+* way, internal blank lines that are part of the same paragraph (e.g. a list
+* item that purposely contains a visual break) are preserved while true
+* paragraph breaks – the ones generated when calling `arr.join("\n\n")` in
+* the tests – are still detected.
+*/
+const splitByParagraph = (text) => {
+	const paragraphs = [];
+	const tokens = text.split(/(\n{2,})/);
+	for (let i = 0; i < tokens.length; i++) {
+		const token = tokens[i];
+		if (i % 2 === 0) {
+			if (token) paragraphs.push(token);
+			continue;
+		}
+		const pairsOfNewlines = Math.floor(token.length / 2);
+		const blankParagraphs = Math.max(0, pairsOfNewlines - 2);
+		for (let j = 0; j < blankParagraphs; j++) paragraphs.push("\n\n");
+	}
+	return paragraphs;
+};
+/**
+* Determine whether two paragraphs match – either exactly, or by sharing the
+* same "special-character signature".
+*/
+const paragraphMatches = (paragraph, baseParagraph, paragraphSignature, baseSignature) => {
+	if (paragraph === baseParagraph) return true;
+	if (paragraphSignature.length !== baseSignature.length) return false;
+	for (let i = 0; i < paragraphSignature.length; i++) if (paragraphSignature[i].char !== baseSignature[i].char) return false;
+	return true;
+};
+/**
+* Re-order `textToReorder` so that its paragraphs follow the ordering found in
+* `baseFileContent`, while preserving any extra paragraphs (those not present
+* in the base file) in a position that is intuitive for a human reader: right
+* after the closest preceding paragraph coming from the base file.
+*/
+const reorderParagraphs = (textToReorder, baseFileContent) => {
+	const baseFileParagraphs = splitByParagraph(baseFileContent);
+	const textToReorderParagraphs = splitByParagraph(textToReorder);
+	const baseSignatures = baseFileParagraphs.map((p) => listSpecialChars(p));
+	const textSignatures = textToReorderParagraphs.map((p) => listSpecialChars(p));
+	const firstMatchIndexForBase = Array(baseFileParagraphs.length).fill(-1);
+	const paragraphMatchedBaseIdx = Array(textToReorderParagraphs.length).fill(null);
+	for (let i = 0; i < textToReorderParagraphs.length; i++) {
+		const paragraph = textToReorderParagraphs[i];
+		const sig = textSignatures[i];
+		let foundIdx = baseFileParagraphs.findIndex((baseParagraph, idx) => firstMatchIndexForBase[idx] === -1 && paragraph === baseParagraph);
+		if (foundIdx === -1) foundIdx = baseFileParagraphs.findIndex((baseParagraph, idx) => firstMatchIndexForBase[idx] === -1 && paragraphMatches(paragraph, baseParagraph, sig, baseSignatures[idx]));
+		if (foundIdx !== -1) {
+			firstMatchIndexForBase[foundIdx] = i;
+			paragraphMatchedBaseIdx[i] = foundIdx;
+		}
+	}
+	const insertAfterBaseIdx = Array(textToReorderParagraphs.length).fill(-1);
+	let maxBaseIdxEncountered = -1;
+	for (let i = 0; i < textToReorderParagraphs.length; i++) {
+		const matchedBase = paragraphMatchedBaseIdx[i];
+		if (matchedBase !== null) {
+			if (matchedBase > maxBaseIdxEncountered) maxBaseIdxEncountered = matchedBase;
+		} else insertAfterBaseIdx[i] = maxBaseIdxEncountered;
+	}
+	const result = [];
+	const extraParagraphsBuckets = {};
+	insertAfterBaseIdx.forEach((afterIdx, paragraphIdx) => {
+		if (afterIdx === -1) return;
+		extraParagraphsBuckets[afterIdx] = extraParagraphsBuckets[afterIdx] || [];
+		extraParagraphsBuckets[afterIdx].push(paragraphIdx);
+	});
+	for (let bIdx = 0; bIdx < baseFileParagraphs.length; bIdx++) {
+		const matchedParagraphIdx = firstMatchIndexForBase[bIdx];
+		if (matchedParagraphIdx !== -1) result.push(textToReorderParagraphs[matchedParagraphIdx]);
+		if (extraParagraphsBuckets[bIdx]) extraParagraphsBuckets[bIdx].forEach((pIdx) => {
+			result.push(textToReorderParagraphs[pIdx]);
+		});
+	}
+	const leadingExtras = [];
+	insertAfterBaseIdx.forEach((afterIdx, pIdx) => {
+		if (afterIdx === -1 && paragraphMatchedBaseIdx[pIdx] === null) leadingExtras.push(textToReorderParagraphs[pIdx]);
+	});
+	return [...leadingExtras, ...result].join("\n\n");
+};
 
-`)};export{r as reorderParagraphs};
+//#endregion
+export { reorderParagraphs };
 //# sourceMappingURL=reorderParagraphs.mjs.map

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

@@ -1 +1 @@
-{"version":3,"file":"reorderParagraphs.mjs","names":[],"sources":["../../../src/utils/reorderParagraphs.ts"],"sourcesContent":["import { listSpecialChars } from './listSpecialChars';\n\n/**\n * Split a text into paragraphs.\n *\n * We consider a paragraph boundary to be a block of at least two consecutive\n * new-lines that is immediately followed by a non-white-space character.  This\n * way, internal blank lines that are part of the same paragraph (e.g. a list\n * item that purposely contains a visual break) are preserved while true\n * paragraph breaks – the ones generated when calling `arr.join(\"\\n\\n\")` in\n * the tests – are still detected.\n */\nconst splitByParagraph = (text: string): string[] => {\n  const paragraphs: string[] = [];\n\n  // Capture the delimiter so that we can inspect how many new-lines it\n  // contains.  We know that the test strings only use LF, so we keep the\n  // regex simple here.\n  const tokens = text.split(/(\\n{2,})/);\n\n  for (let i = 0; i < tokens.length; i++) {\n    const token = tokens[i];\n\n    // Even-indexed tokens are the actual paragraph contents.\n    if (i % 2 === 0) {\n      if (token) paragraphs.push(token);\n      continue;\n    }\n\n    // Odd-indexed tokens are the delimiters (>= two consecutive new-lines).\n    // The first and last pairs represent the natural separators that are\n    // added when paragraphs are later joined with \"\\n\\n\".  Any additional\n    // pairs in between correspond to *explicit* blank paragraphs that were\n    // present in the original text and must therefore be preserved.\n    const pairsOfNewlines = Math.floor(token.length / 2);\n    const blankParagraphs = Math.max(0, pairsOfNewlines - 2);\n\n    for (let j = 0; j < blankParagraphs; j++) {\n      paragraphs.push('\\n\\n');\n    }\n  }\n\n  return paragraphs;\n};\n\n/**\n * Determine whether two paragraphs match – either exactly, or by sharing the\n * same \"special-character signature\".\n */\nconst paragraphMatches = (\n  paragraph: string,\n  baseParagraph: string,\n  paragraphSignature: ReturnType<typeof listSpecialChars>,\n  baseSignature: ReturnType<typeof listSpecialChars>\n): boolean => {\n  if (paragraph === baseParagraph) return true;\n  // fallback to special-character signature comparison\n  if (paragraphSignature.length !== baseSignature.length) return false;\n\n  for (let i = 0; i < paragraphSignature.length; i++) {\n    if (paragraphSignature[i].char !== baseSignature[i].char) {\n      return false;\n    }\n  }\n  return true;\n};\n\n/**\n * Re-order `textToReorder` so that its paragraphs follow the ordering found in\n * `baseFileContent`, while preserving any extra paragraphs (those not present\n * in the base file) in a position that is intuitive for a human reader: right\n * after the closest preceding paragraph coming from the base file.\n */\nexport const reorderParagraphs = (\n  textToReorder: string,\n  baseFileContent: string\n): string => {\n  // 1. Split both texts into paragraphs and pre-compute their signatures.\n  const baseFileParagraphs = splitByParagraph(baseFileContent);\n  const textToReorderParagraphs = splitByParagraph(textToReorder);\n\n  const baseSignatures = baseFileParagraphs.map((p) => listSpecialChars(p));\n  const textSignatures = textToReorderParagraphs.map((p) =>\n    listSpecialChars(p)\n  );\n\n  // 2. For every paragraph in the text to reorder, find the *first* base\n  //    paragraph it matches.  We only allow each base paragraph to be matched\n  //    once.  Any further identical paragraphs will be treated as \"extra\" and\n  //    will be positioned later on, next to their closest neighbour.\n  const firstMatchIndexForBase: number[] = Array(\n    baseFileParagraphs.length\n  ).fill(-1);\n  const paragraphMatchedBaseIdx: (number | null)[] = Array(\n    textToReorderParagraphs.length\n  ).fill(null);\n\n  for (let i = 0; i < textToReorderParagraphs.length; i++) {\n    const paragraph = textToReorderParagraphs[i];\n    const sig = textSignatures[i];\n\n    // exact match pass first for performance\n    let foundIdx = baseFileParagraphs.findIndex(\n      (baseParagraph, idx) =>\n        firstMatchIndexForBase[idx] === -1 && paragraph === baseParagraph\n    );\n\n    if (foundIdx === -1) {\n      // fallback to the signature comparison\n      foundIdx = baseFileParagraphs.findIndex(\n        (baseParagraph, idx) =>\n          firstMatchIndexForBase[idx] === -1 &&\n          paragraphMatches(paragraph, baseParagraph, sig, baseSignatures[idx])\n      );\n    }\n\n    if (foundIdx !== -1) {\n      firstMatchIndexForBase[foundIdx] = i;\n      paragraphMatchedBaseIdx[i] = foundIdx;\n    }\n  }\n\n  // 3. For the paragraphs that *didn't* get matched to a base paragraph, we\n  //    record the highest-numbered base paragraph that was matched *before* it\n  //    in the original text.  The extra paragraph will later be placed right\n  //    after that paragraph in the final ordering.\n  const insertAfterBaseIdx: number[] = Array(\n    textToReorderParagraphs.length\n  ).fill(-1);\n  let maxBaseIdxEncountered = -1;\n\n  for (let i = 0; i < textToReorderParagraphs.length; i++) {\n    const matchedBase = paragraphMatchedBaseIdx[i];\n\n    if (matchedBase !== null) {\n      if (matchedBase > maxBaseIdxEncountered) {\n        maxBaseIdxEncountered = matchedBase;\n      }\n    } else {\n      insertAfterBaseIdx[i] = maxBaseIdxEncountered;\n    }\n  }\n\n  // 4. Build the final, reordered list of paragraphs.\n  const result: string[] = [];\n\n  // Helper: quickly retrieve all indices of paragraphs that should be inserted\n  // after a given base index, while keeping their original order.\n  const extraParagraphsBuckets: Record<number, number[]> = {};\n  insertAfterBaseIdx.forEach((afterIdx, paragraphIdx) => {\n    if (afterIdx === -1) return; // will be handled later (if any)\n    extraParagraphsBuckets[afterIdx] = extraParagraphsBuckets[afterIdx] || [];\n    extraParagraphsBuckets[afterIdx].push(paragraphIdx);\n  });\n\n  for (let bIdx = 0; bIdx < baseFileParagraphs.length; bIdx++) {\n    const matchedParagraphIdx = firstMatchIndexForBase[bIdx];\n\n    if (matchedParagraphIdx !== -1) {\n      result.push(textToReorderParagraphs[matchedParagraphIdx]);\n    }\n\n    if (extraParagraphsBuckets[bIdx]) {\n      extraParagraphsBuckets[bIdx].forEach((pIdx) => {\n        result.push(textToReorderParagraphs[pIdx]);\n      });\n    }\n  }\n\n  // Finally, if there were extra paragraphs appearing *before* any matched\n  // base paragraph (insertAfterBaseIdx === -1), we prepend them to the output\n  // in their original order.\n  const leadingExtras: string[] = [];\n  insertAfterBaseIdx.forEach((afterIdx, pIdx) => {\n    if (afterIdx === -1 && paragraphMatchedBaseIdx[pIdx] === null) {\n      leadingExtras.push(textToReorderParagraphs[pIdx]);\n    }\n  });\n\n  return [...leadingExtras, ...result].join('\\n\\n');\n};\n"],"mappings":"0DAYA,MAAM,EAAoB,GAA2B,CACnD,IAAM,EAAuB,EAAE,CAKzB,EAAS,EAAK,MAAM,WAAW,CAErC,IAAK,IAAI,EAAI,EAAG,EAAI,EAAO,OAAQ,IAAK,CACtC,IAAM,EAAQ,EAAO,GAGrB,GAAI,EAAI,GAAM,EAAG,CACX,GAAO,EAAW,KAAK,EAAM,CACjC,SAQF,IAAM,EAAkB,KAAK,MAAM,EAAM,OAAS,EAAE,CAC9C,EAAkB,KAAK,IAAI,EAAG,EAAkB,EAAE,CAExD,IAAK,IAAI,EAAI,EAAG,EAAI,EAAiB,IACnC,EAAW,KAAK;;EAAO,CAI3B,OAAO,GAOH,GACJ,EACA,EACA,EACA,IACY,CACZ,GAAI,IAAc,EAAe,MAAO,GAExC,GAAI,EAAmB,SAAW,EAAc,OAAQ,MAAO,GAE/D,IAAK,IAAI,EAAI,EAAG,EAAI,EAAmB,OAAQ,IAC7C,GAAI,EAAmB,GAAG,OAAS,EAAc,GAAG,KAClD,MAAO,GAGX,MAAO,IASI,GACX,EACA,IACW,CAEX,IAAM,EAAqB,EAAiB,EAAgB,CACtD,EAA0B,EAAiB,EAAc,CAEzD,EAAiB,EAAmB,IAAK,GAAM,EAAiB,EAAE,CAAC,CACnE,EAAiB,EAAwB,IAAK,GAClD,EAAiB,EAAE,CACpB,CAMK,EAAmC,MACvC,EAAmB,OACpB,CAAC,KAAK,GAAG,CACJ,EAA6C,MACjD,EAAwB,OACzB,CAAC,KAAK,KAAK,CAEZ,IAAK,IAAI,EAAI,EAAG,EAAI,EAAwB,OAAQ,IAAK,CACvD,IAAM,EAAY,EAAwB,GACpC,EAAM,EAAe,GAGvB,EAAW,EAAmB,WAC/B,EAAe,IACd,EAAuB,KAAS,IAAM,IAAc,EACvD,CAEG,IAAa,KAEf,EAAW,EAAmB,WAC3B,EAAe,IACd,EAAuB,KAAS,IAChC,EAAiB,EAAW,EAAe,EAAK,EAAe,GAAK,CACvE,EAGC,IAAa,KACf,EAAuB,GAAY,EACnC,EAAwB,GAAK,GAQjC,IAAM,EAA+B,MACnC,EAAwB,OACzB,CAAC,KAAK,GAAG,CACN,EAAwB,GAE5B,IAAK,IAAI,EAAI,EAAG,EAAI,EAAwB,OAAQ,IAAK,CACvD,IAAM,EAAc,EAAwB,GAExC,IAAgB,KAKlB,EAAmB,GAAK,EAJpB,EAAc,IAChB,EAAwB,GAQ9B,IAAM,EAAmB,EAAE,CAIrB,EAAmD,EAAE,CAC3D,EAAmB,SAAS,EAAU,IAAiB,CACjD,IAAa,KACjB,EAAuB,GAAY,EAAuB,IAAa,EAAE,CACzE,EAAuB,GAAU,KAAK,EAAa,GACnD,CAEF,IAAK,IAAI,EAAO,EAAG,EAAO,EAAmB,OAAQ,IAAQ,CAC3D,IAAM,EAAsB,EAAuB,GAE/C,IAAwB,IAC1B,EAAO,KAAK,EAAwB,GAAqB,CAGvD,EAAuB,IACzB,EAAuB,GAAM,QAAS,GAAS,CAC7C,EAAO,KAAK,EAAwB,GAAM,EAC1C,CAON,IAAM,EAA0B,EAAE,CAOlC,OANA,EAAmB,SAAS,EAAU,IAAS,CACzC,IAAa,IAAM,EAAwB,KAAU,MACvD,EAAc,KAAK,EAAwB,GAAM,EAEnD,CAEK,CAAC,GAAG,EAAe,GAAG,EAAO,CAAC,KAAK;;EAAO"}
+{"version":3,"file":"reorderParagraphs.mjs","names":[],"sources":["../../../src/utils/reorderParagraphs.ts"],"sourcesContent":["import { listSpecialChars } from './listSpecialChars';\n\n/**\n * Split a text into paragraphs.\n *\n * We consider a paragraph boundary to be a block of at least two consecutive\n * new-lines that is immediately followed by a non-white-space character.  This\n * way, internal blank lines that are part of the same paragraph (e.g. a list\n * item that purposely contains a visual break) are preserved while true\n * paragraph breaks – the ones generated when calling `arr.join(\"\\n\\n\")` in\n * the tests – are still detected.\n */\nconst splitByParagraph = (text: string): string[] => {\n  const paragraphs: string[] = [];\n\n  // Capture the delimiter so that we can inspect how many new-lines it\n  // contains.  We know that the test strings only use LF, so we keep the\n  // regex simple here.\n  const tokens = text.split(/(\\n{2,})/);\n\n  for (let i = 0; i < tokens.length; i++) {\n    const token = tokens[i];\n\n    // Even-indexed tokens are the actual paragraph contents.\n    if (i % 2 === 0) {\n      if (token) paragraphs.push(token);\n      continue;\n    }\n\n    // Odd-indexed tokens are the delimiters (>= two consecutive new-lines).\n    // The first and last pairs represent the natural separators that are\n    // added when paragraphs are later joined with \"\\n\\n\".  Any additional\n    // pairs in between correspond to *explicit* blank paragraphs that were\n    // present in the original text and must therefore be preserved.\n    const pairsOfNewlines = Math.floor(token.length / 2);\n    const blankParagraphs = Math.max(0, pairsOfNewlines - 2);\n\n    for (let j = 0; j < blankParagraphs; j++) {\n      paragraphs.push('\\n\\n');\n    }\n  }\n\n  return paragraphs;\n};\n\n/**\n * Determine whether two paragraphs match – either exactly, or by sharing the\n * same \"special-character signature\".\n */\nconst paragraphMatches = (\n  paragraph: string,\n  baseParagraph: string,\n  paragraphSignature: ReturnType<typeof listSpecialChars>,\n  baseSignature: ReturnType<typeof listSpecialChars>\n): boolean => {\n  if (paragraph === baseParagraph) return true;\n  // fallback to special-character signature comparison\n  if (paragraphSignature.length !== baseSignature.length) return false;\n\n  for (let i = 0; i < paragraphSignature.length; i++) {\n    if (paragraphSignature[i].char !== baseSignature[i].char) {\n      return false;\n    }\n  }\n  return true;\n};\n\n/**\n * Re-order `textToReorder` so that its paragraphs follow the ordering found in\n * `baseFileContent`, while preserving any extra paragraphs (those not present\n * in the base file) in a position that is intuitive for a human reader: right\n * after the closest preceding paragraph coming from the base file.\n */\nexport const reorderParagraphs = (\n  textToReorder: string,\n  baseFileContent: string\n): string => {\n  // 1. Split both texts into paragraphs and pre-compute their signatures.\n  const baseFileParagraphs = splitByParagraph(baseFileContent);\n  const textToReorderParagraphs = splitByParagraph(textToReorder);\n\n  const baseSignatures = baseFileParagraphs.map((p) => listSpecialChars(p));\n  const textSignatures = textToReorderParagraphs.map((p) =>\n    listSpecialChars(p)\n  );\n\n  // 2. For every paragraph in the text to reorder, find the *first* base\n  //    paragraph it matches.  We only allow each base paragraph to be matched\n  //    once.  Any further identical paragraphs will be treated as \"extra\" and\n  //    will be positioned later on, next to their closest neighbour.\n  const firstMatchIndexForBase: number[] = Array(\n    baseFileParagraphs.length\n  ).fill(-1);\n  const paragraphMatchedBaseIdx: (number | null)[] = Array(\n    textToReorderParagraphs.length\n  ).fill(null);\n\n  for (let i = 0; i < textToReorderParagraphs.length; i++) {\n    const paragraph = textToReorderParagraphs[i];\n    const sig = textSignatures[i];\n\n    // exact match pass first for performance\n    let foundIdx = baseFileParagraphs.findIndex(\n      (baseParagraph, idx) =>\n        firstMatchIndexForBase[idx] === -1 && paragraph === baseParagraph\n    );\n\n    if (foundIdx === -1) {\n      // fallback to the signature comparison\n      foundIdx = baseFileParagraphs.findIndex(\n        (baseParagraph, idx) =>\n          firstMatchIndexForBase[idx] === -1 &&\n          paragraphMatches(paragraph, baseParagraph, sig, baseSignatures[idx])\n      );\n    }\n\n    if (foundIdx !== -1) {\n      firstMatchIndexForBase[foundIdx] = i;\n      paragraphMatchedBaseIdx[i] = foundIdx;\n    }\n  }\n\n  // 3. For the paragraphs that *didn't* get matched to a base paragraph, we\n  //    record the highest-numbered base paragraph that was matched *before* it\n  //    in the original text.  The extra paragraph will later be placed right\n  //    after that paragraph in the final ordering.\n  const insertAfterBaseIdx: number[] = Array(\n    textToReorderParagraphs.length\n  ).fill(-1);\n  let maxBaseIdxEncountered = -1;\n\n  for (let i = 0; i < textToReorderParagraphs.length; i++) {\n    const matchedBase = paragraphMatchedBaseIdx[i];\n\n    if (matchedBase !== null) {\n      if (matchedBase > maxBaseIdxEncountered) {\n        maxBaseIdxEncountered = matchedBase;\n      }\n    } else {\n      insertAfterBaseIdx[i] = maxBaseIdxEncountered;\n    }\n  }\n\n  // 4. Build the final, reordered list of paragraphs.\n  const result: string[] = [];\n\n  // Helper: quickly retrieve all indices of paragraphs that should be inserted\n  // after a given base index, while keeping their original order.\n  const extraParagraphsBuckets: Record<number, number[]> = {};\n  insertAfterBaseIdx.forEach((afterIdx, paragraphIdx) => {\n    if (afterIdx === -1) return; // will be handled later (if any)\n    extraParagraphsBuckets[afterIdx] = extraParagraphsBuckets[afterIdx] || [];\n    extraParagraphsBuckets[afterIdx].push(paragraphIdx);\n  });\n\n  for (let bIdx = 0; bIdx < baseFileParagraphs.length; bIdx++) {\n    const matchedParagraphIdx = firstMatchIndexForBase[bIdx];\n\n    if (matchedParagraphIdx !== -1) {\n      result.push(textToReorderParagraphs[matchedParagraphIdx]);\n    }\n\n    if (extraParagraphsBuckets[bIdx]) {\n      extraParagraphsBuckets[bIdx].forEach((pIdx) => {\n        result.push(textToReorderParagraphs[pIdx]);\n      });\n    }\n  }\n\n  // Finally, if there were extra paragraphs appearing *before* any matched\n  // base paragraph (insertAfterBaseIdx === -1), we prepend them to the output\n  // in their original order.\n  const leadingExtras: string[] = [];\n  insertAfterBaseIdx.forEach((afterIdx, pIdx) => {\n    if (afterIdx === -1 && paragraphMatchedBaseIdx[pIdx] === null) {\n      leadingExtras.push(textToReorderParagraphs[pIdx]);\n    }\n  });\n\n  return [...leadingExtras, ...result].join('\\n\\n');\n};\n"],"mappings":";;;;;;;;;;;;;AAYA,MAAM,oBAAoB,SAA2B;CACnD,MAAM,aAAuB,EAAE;CAK/B,MAAM,SAAS,KAAK,MAAM,WAAW;AAErC,MAAK,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;EACtC,MAAM,QAAQ,OAAO;AAGrB,MAAI,IAAI,MAAM,GAAG;AACf,OAAI,MAAO,YAAW,KAAK,MAAM;AACjC;;EAQF,MAAM,kBAAkB,KAAK,MAAM,MAAM,SAAS,EAAE;EACpD,MAAM,kBAAkB,KAAK,IAAI,GAAG,kBAAkB,EAAE;AAExD,OAAK,IAAI,IAAI,GAAG,IAAI,iBAAiB,IACnC,YAAW,KAAK,OAAO;;AAI3B,QAAO;;;;;;AAOT,MAAM,oBACJ,WACA,eACA,oBACA,kBACY;AACZ,KAAI,cAAc,cAAe,QAAO;AAExC,KAAI,mBAAmB,WAAW,cAAc,OAAQ,QAAO;AAE/D,MAAK,IAAI,IAAI,GAAG,IAAI,mBAAmB,QAAQ,IAC7C,KAAI,mBAAmB,GAAG,SAAS,cAAc,GAAG,KAClD,QAAO;AAGX,QAAO;;;;;;;;AAST,MAAa,qBACX,eACA,oBACW;CAEX,MAAM,qBAAqB,iBAAiB,gBAAgB;CAC5D,MAAM,0BAA0B,iBAAiB,cAAc;CAE/D,MAAM,iBAAiB,mBAAmB,KAAK,MAAM,iBAAiB,EAAE,CAAC;CACzE,MAAM,iBAAiB,wBAAwB,KAAK,MAClD,iBAAiB,EAAE,CACpB;CAMD,MAAM,yBAAmC,MACvC,mBAAmB,OACpB,CAAC,KAAK,GAAG;CACV,MAAM,0BAA6C,MACjD,wBAAwB,OACzB,CAAC,KAAK,KAAK;AAEZ,MAAK,IAAI,IAAI,GAAG,IAAI,wBAAwB,QAAQ,KAAK;EACvD,MAAM,YAAY,wBAAwB;EAC1C,MAAM,MAAM,eAAe;EAG3B,IAAI,WAAW,mBAAmB,WAC/B,eAAe,QACd,uBAAuB,SAAS,MAAM,cAAc,cACvD;AAED,MAAI,aAAa,GAEf,YAAW,mBAAmB,WAC3B,eAAe,QACd,uBAAuB,SAAS,MAChC,iBAAiB,WAAW,eAAe,KAAK,eAAe,KAAK,CACvE;AAGH,MAAI,aAAa,IAAI;AACnB,0BAAuB,YAAY;AACnC,2BAAwB,KAAK;;;CAQjC,MAAM,qBAA+B,MACnC,wBAAwB,OACzB,CAAC,KAAK,GAAG;CACV,IAAI,wBAAwB;AAE5B,MAAK,IAAI,IAAI,GAAG,IAAI,wBAAwB,QAAQ,KAAK;EACvD,MAAM,cAAc,wBAAwB;AAE5C,MAAI,gBAAgB,MAClB;OAAI,cAAc,sBAChB,yBAAwB;QAG1B,oBAAmB,KAAK;;CAK5B,MAAM,SAAmB,EAAE;CAI3B,MAAM,yBAAmD,EAAE;AAC3D,oBAAmB,SAAS,UAAU,iBAAiB;AACrD,MAAI,aAAa,GAAI;AACrB,yBAAuB,YAAY,uBAAuB,aAAa,EAAE;AACzE,yBAAuB,UAAU,KAAK,aAAa;GACnD;AAEF,MAAK,IAAI,OAAO,GAAG,OAAO,mBAAmB,QAAQ,QAAQ;EAC3D,MAAM,sBAAsB,uBAAuB;AAEnD,MAAI,wBAAwB,GAC1B,QAAO,KAAK,wBAAwB,qBAAqB;AAG3D,MAAI,uBAAuB,MACzB,wBAAuB,MAAM,SAAS,SAAS;AAC7C,UAAO,KAAK,wBAAwB,MAAM;IAC1C;;CAON,MAAM,gBAA0B,EAAE;AAClC,oBAAmB,SAAS,UAAU,SAAS;AAC7C,MAAI,aAAa,MAAM,wBAAwB,UAAU,KACvD,eAAc,KAAK,wBAAwB,MAAM;GAEnD;AAEF,QAAO,CAAC,GAAG,eAAe,GAAG,OAAO,CAAC,KAAK,OAAO"}

package/dist/esm/utils/setupAI.mjs

@@ -1,2 +1,64 @@
-import{checkAIAccess as e}from"./checkAccess.mjs";import*as t from"@intlayer/config/colors";import{colorize as n,getAppLogger as r}from"@intlayer/config/logger";globalThis.AI_SDK_LOG_WARNINGS=!1;const i=(e,r)=>{r([n(`Provider:`,t.GREY_DARK),n(e?.provider??`(default)`,t.BLUE),n(`- Model:`,t.GREY_DARK),n(e?.model??`(default)`,t.BLUE),n(`- API Key:`,t.GREY_DARK),n(e?.apiKey?`✓`:`(not set)`,t.BLUE)])},a=async(a,o)=>{let s=r(a);if(o?.apiKey||o?.provider===`ollama`||a.ai?.apiKey||a.ai?.provider===`ollama`){let r;try{r=await import(`@intlayer/ai`)}catch{s([n(`Using your API key, you can install the`,t.GREY),n(`@intlayer/ai`,t.GREY_LIGHT),n(`package to run the process locally, with no dependency on the Intlayer server`,t.GREY)],{level:`warn`});let r=await e(a,o);return i(o??{},s),{isCustomAI:!1,hasAIAccess:r}}s([n(`@intlayer/ai`,t.GREY_LIGHT),n(`found - Run process locally`,t.GREY_DARK)]);let c=await r.getAIConfig({userOptions:o,accessType:[`public`]});return i(o??{},s),{aiClient:r,aiConfig:c,isCustomAI:!0,hasAIAccess:!0}}let c=await e(a,o);return i(o??{},s),{isCustomAI:!1,hasAIAccess:c}};export{a as setupAI};
+import { checkAIAccess } from "./checkAccess.mjs";
+import * as ANSIColors from "@intlayer/config/colors";
+import { colorize, getAppLogger } from "@intlayer/config/logger";
+
+//#region src/utils/setupAI.ts
+globalThis.AI_SDK_LOG_WARNINGS = false;
+const logAIConfig = (aiOptions, appLogger) => {
+	appLogger([
+		colorize("Provider:", ANSIColors.GREY_DARK),
+		colorize(aiOptions?.provider ?? "(default)", ANSIColors.BLUE),
+		colorize("- Model:", ANSIColors.GREY_DARK),
+		colorize(aiOptions?.model ?? "(default)", ANSIColors.BLUE),
+		colorize("- API Key:", ANSIColors.GREY_DARK),
+		colorize(aiOptions?.apiKey ? "✓" : "(not set)", ANSIColors.BLUE)
+	]);
+};
+/**
+* Checks if the @intlayer/ai package is available and configured when an API key is provided.
+* If API key is present but package is missing, logs a warning.
+* Also checks if the user has access to AI (either via local key or CMS auth).
+*/
+const setupAI = async (configuration, aiOptions) => {
+	const appLogger = getAppLogger(configuration);
+	if (aiOptions?.apiKey || aiOptions?.provider === "ollama" || configuration.ai?.apiKey || configuration.ai?.provider === "ollama") {
+		let aiClient;
+		try {
+			aiClient = await import("@intlayer/ai");
+		} catch {
+			appLogger([
+				colorize("Using your API key, you can install the", ANSIColors.GREY),
+				colorize("@intlayer/ai", ANSIColors.GREY_LIGHT),
+				colorize("package to run the process locally, with no dependency on the Intlayer server", ANSIColors.GREY)
+			], { level: "warn" });
+			const hasAIAccess = await checkAIAccess(configuration, aiOptions);
+			logAIConfig(aiOptions ?? {}, appLogger);
+			return {
+				isCustomAI: false,
+				hasAIAccess
+			};
+		}
+		appLogger([colorize("@intlayer/ai", ANSIColors.GREY_LIGHT), colorize("found - Run process locally", ANSIColors.GREY_DARK)]);
+		const aiConfig = await aiClient.getAIConfig({
+			userOptions: aiOptions,
+			accessType: ["public"]
+		});
+		logAIConfig(aiOptions ?? {}, appLogger);
+		return {
+			aiClient,
+			aiConfig,
+			isCustomAI: true,
+			hasAIAccess: true
+		};
+	}
+	const hasAIAccess = await checkAIAccess(configuration, aiOptions);
+	logAIConfig(aiOptions ?? {}, appLogger);
+	return {
+		isCustomAI: false,
+		hasAIAccess
+	};
+};
+
+//#endregion
+export { setupAI };
 //# sourceMappingURL=setupAI.mjs.map