@intlayer/chokidar 8.4.4 → 8.4.5

package/dist/esm/utils/buildFilesList.mjs

@@ -1,2 +1,80 @@
-import{isAbsolute as e,normalize as t,relative as n,resolve as r}from"node:path";import i from"fast-glob";const a=e=>Array.isArray(e)?e:[e],o=t=>{let i=Array.from(new Set(t.map(e=>r(e))));return i.sort((e,t)=>e.length-t.length),i.reduce((t,r)=>(t.some(t=>{let i=n(t,r);return!i.startsWith(`..`)&&!e(i)&&i!==``})||t.push(r),t),[])},s=e=>{let{transformPattern:n,excludePattern:r=[],baseDir:s,dot:c=!1}=e,l=a(n).filter(e=>typeof e==`string`&&!e.startsWith(`!`)).map(t),u=[...a(r),...a(n).filter(e=>typeof e==`string`&&e.startsWith(`!`)).map(e=>e.slice(1))].filter(e=>typeof e==`string`).map(t),d=o(a(s));return Array.from(new Set(d.flatMap(e=>i.sync(l,{cwd:e,ignore:u,absolute:!0,dot:c}))))},c=e=>{let{build:{traversePattern:t},system:{baseDir:n},content:{codeDir:r,fileExtensions:i},compiler:{excludePattern:a}}=e;return s({transformPattern:t,excludePattern:[...i.map(e=>`**/*${e}`),...Array.isArray(a)?a:[a]].filter(e=>typeof e==`string`),baseDir:[n,...r],dot:!0})};export{s as buildComponentFilesList,c as buildComponentFilesListFromConfig};
+import { isAbsolute, normalize, relative, resolve } from "node:path";
+import fg from "fast-glob";
+
+//#region src/utils/buildFilesList.ts
+/**
+* Normalizes a pattern value to an array
+*/
+const normalizeToArray = (value) => Array.isArray(value) ? value : [value];
+/**
+* Remove directories that are subdirectories of others in the list so files
+* are never scanned twice.
+* Example: ['/root', '/root/src'] → ['/root']
+*/
+const getDistinctRootDirs = (dirs) => {
+	const uniqueDirs = Array.from(new Set(dirs.map((dir) => resolve(dir))));
+	uniqueDirs.sort((a, b) => a.length - b.length);
+	return uniqueDirs.reduce((acc, dir) => {
+		if (!acc.some((parent) => {
+			const rel = relative(parent, dir);
+			return !rel.startsWith("..") && !isAbsolute(rel) && rel !== "";
+		})) acc.push(dir);
+		return acc;
+	}, []);
+};
+/**
+* Builds a deduplicated list of absolute file paths matching the given patterns.
+*
+* Handles multiple root directories (deduplicates overlapping roots), exclude
+* patterns, negation patterns embedded in `transformPattern`, and optional
+* dot-file inclusion.
+*
+* @example
+* // Single root with excludes
+* const files = buildComponentFilesList({
+*   transformPattern: 'src/**\/*.{ts,tsx}',
+*   excludePattern: ['**\/node_modules\/**'],
+*   baseDir: '/path/to/project',
+* });
+*
+* @example
+* // Multiple roots (e.g. baseDir + codeDir), dot files included
+* const files = buildComponentFilesList({
+*   transformPattern: config.build.traversePattern,
+*   baseDir: [config.system.baseDir, ...config.content.codeDir],
+*   dot: true,
+* });
+*/
+const buildComponentFilesList = (config) => {
+	const { transformPattern, excludePattern = [], baseDir, dot = false } = config;
+	const patterns = normalizeToArray(transformPattern).filter((pattern) => typeof pattern === "string" && !pattern.startsWith("!")).map(normalize);
+	const excludePatterns = [...normalizeToArray(excludePattern), ...normalizeToArray(transformPattern).filter((pattern) => typeof pattern === "string" && pattern.startsWith("!")).map((pattern) => pattern.slice(1))].filter((pattern) => typeof pattern === "string").map(normalize);
+	const roots = getDistinctRootDirs(normalizeToArray(baseDir));
+	return Array.from(new Set(roots.flatMap((root) => fg.sync(patterns, {
+		cwd: root,
+		ignore: excludePatterns,
+		absolute: true,
+		dot
+	}))));
+};
+/**
+* Convenience wrapper that derives all file-list options directly from an
+* `IntlayerConfig` object.
+*
+* Scans `[baseDir, ...codeDir]` using `build.traversePattern`, excludes
+* content declaration file extensions and any `compiler.excludePattern`
+* entries defined in the configuration, and includes dot files.
+*/
+const buildComponentFilesListFromConfig = (intlayerConfig) => {
+	const { build: { traversePattern }, system: { baseDir }, content: { codeDir, fileExtensions }, compiler: { excludePattern } } = intlayerConfig;
+	return buildComponentFilesList({
+		transformPattern: traversePattern,
+		excludePattern: [...fileExtensions.map((ext) => `**/*${ext}`), ...Array.isArray(excludePattern) ? excludePattern : [excludePattern]].filter((p) => typeof p === "string"),
+		baseDir: [baseDir, ...codeDir],
+		dot: true
+	});
+};
+
+//#endregion
+export { buildComponentFilesList, buildComponentFilesListFromConfig };
 //# sourceMappingURL=buildFilesList.mjs.map

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

@@ -1 +1 @@
-{"version":3,"file":"buildFilesList.mjs","names":[],"sources":["../../../src/utils/buildFilesList.ts"],"sourcesContent":["import { isAbsolute, normalize, relative, resolve } from 'node:path';\nimport type { IntlayerConfig } from '@intlayer/types/config';\nimport fg from 'fast-glob';\n\n/**\n * Options for building the files list\n */\nexport type BuildComponentFilesListOptions = {\n  /**\n   * Glob patterns to match files\n   */\n  transformPattern: string | string[];\n  /**\n   * Glob patterns to exclude files\n   */\n  excludePattern?: string | string[];\n  /**\n   * Base directory (or directories) for file resolution.\n   * When multiple directories are provided, subdirectories of others are\n   * automatically deduplicated so files are never scanned twice.\n   */\n  baseDir: string | string[];\n  /**\n   * Whether to include dot-prefixed files and directories (default: false)\n   */\n  dot?: boolean;\n};\n\n/**\n * Normalizes a pattern value to an array\n */\nconst normalizeToArray = <T>(value: T | T[]): T[] =>\n  Array.isArray(value) ? value : [value];\n\n/**\n * Remove directories that are subdirectories of others in the list so files\n * are never scanned twice.\n * Example: ['/root', '/root/src'] → ['/root']\n */\nconst getDistinctRootDirs = (dirs: string[]): string[] => {\n  const uniqueDirs = Array.from(new Set(dirs.map((dir) => resolve(dir))));\n  uniqueDirs.sort((a, b) => a.length - b.length);\n\n  return uniqueDirs.reduce((acc: string[], dir) => {\n    const isNested = acc.some((parent) => {\n      const rel = relative(parent, dir);\n      return !rel.startsWith('..') && !isAbsolute(rel) && rel !== '';\n    });\n    if (!isNested) acc.push(dir);\n    return acc;\n  }, []);\n};\n\n/**\n * Builds a deduplicated list of absolute file paths matching the given patterns.\n *\n * Handles multiple root directories (deduplicates overlapping roots), exclude\n * patterns, negation patterns embedded in `transformPattern`, and optional\n * dot-file inclusion.\n *\n * @example\n * // Single root with excludes\n * const files = buildComponentFilesList({\n *   transformPattern: 'src/**\\/*.{ts,tsx}',\n *   excludePattern: ['**\\/node_modules\\/**'],\n *   baseDir: '/path/to/project',\n * });\n *\n * @example\n * // Multiple roots (e.g. baseDir + codeDir), dot files included\n * const files = buildComponentFilesList({\n *   transformPattern: config.build.traversePattern,\n *   baseDir: [config.system.baseDir, ...config.content.codeDir],\n *   dot: true,\n * });\n */\nexport const buildComponentFilesList = (\n  config: BuildComponentFilesListOptions\n): string[] => {\n  const {\n    transformPattern,\n    excludePattern = [],\n    baseDir,\n    dot = false,\n  } = config;\n\n  const patterns = normalizeToArray(transformPattern)\n    .filter(\n      (pattern): pattern is string =>\n        typeof pattern === 'string' && !pattern.startsWith('!')\n    )\n    .map(normalize); // Ensure it works with Windows\n\n  const excludePatterns = [\n    ...normalizeToArray(excludePattern),\n    // Treat negation entries in transformPattern as additional excludes\n    ...normalizeToArray(transformPattern)\n      .filter(\n        (pattern): pattern is string =>\n          typeof pattern === 'string' && pattern.startsWith('!')\n      )\n      .map((pattern) => pattern.slice(1)),\n  ]\n    .filter((pattern): pattern is string => typeof pattern === 'string')\n    .map(normalize); // Ensure it works with Windows\n\n  const roots = getDistinctRootDirs(normalizeToArray(baseDir));\n\n  return Array.from(\n    new Set(\n      roots.flatMap((root) =>\n        fg.sync(patterns, {\n          cwd: root,\n          ignore: excludePatterns,\n          absolute: true,\n          dot,\n        })\n      )\n    )\n  );\n};\n\n/**\n * Convenience wrapper that derives all file-list options directly from an\n * `IntlayerConfig` object.\n *\n * Scans `[baseDir, ...codeDir]` using `build.traversePattern`, excludes\n * content declaration file extensions and any `compiler.excludePattern`\n * entries defined in the configuration, and includes dot files.\n */\nexport const buildComponentFilesListFromConfig = (\n  intlayerConfig: IntlayerConfig\n): string[] => {\n  const {\n    build: { traversePattern },\n    system: { baseDir },\n    content: { codeDir, fileExtensions },\n    compiler: { excludePattern },\n  } = intlayerConfig;\n\n  const excludePatterns = [\n    // Exclude content declaration files (e.g. **/*.content.ts)\n    ...fileExtensions.map((ext) => `**/*${ext}`),\n    ...(Array.isArray(excludePattern) ? excludePattern : [excludePattern]),\n  ].filter((p): p is string => typeof p === 'string');\n\n  return buildComponentFilesList({\n    transformPattern: traversePattern,\n    excludePattern: excludePatterns,\n    baseDir: [baseDir, ...codeDir],\n    dot: true,\n  });\n};\n"],"mappings":"0GA+BA,MAAM,EAAuB,GAC3B,MAAM,QAAQ,EAAM,CAAG,EAAQ,CAAC,EAAM,CAOlC,EAAuB,GAA6B,CACxD,IAAM,EAAa,MAAM,KAAK,IAAI,IAAI,EAAK,IAAK,GAAQ,EAAQ,EAAI,CAAC,CAAC,CAAC,CAGvE,OAFA,EAAW,MAAM,EAAG,IAAM,EAAE,OAAS,EAAE,OAAO,CAEvC,EAAW,QAAQ,EAAe,KACtB,EAAI,KAAM,GAAW,CACpC,IAAM,EAAM,EAAS,EAAQ,EAAI,CACjC,MAAO,CAAC,EAAI,WAAW,KAAK,EAAI,CAAC,EAAW,EAAI,EAAI,IAAQ,IAC5D,EACa,EAAI,KAAK,EAAI,CACrB,GACN,EAAE,CAAC,EA0BK,EACX,GACa,CACb,GAAM,CACJ,mBACA,iBAAiB,EAAE,CACnB,UACA,MAAM,IACJ,EAEE,EAAW,EAAiB,EAAiB,CAChD,OACE,GACC,OAAO,GAAY,UAAY,CAAC,EAAQ,WAAW,IAAI,CAC1D,CACA,IAAI,EAAU,CAEX,EAAkB,CACtB,GAAG,EAAiB,EAAe,CAEnC,GAAG,EAAiB,EAAiB,CAClC,OACE,GACC,OAAO,GAAY,UAAY,EAAQ,WAAW,IAAI,CACzD,CACA,IAAK,GAAY,EAAQ,MAAM,EAAE,CAAC,CACtC,CACE,OAAQ,GAA+B,OAAO,GAAY,SAAS,CACnE,IAAI,EAAU,CAEX,EAAQ,EAAoB,EAAiB,EAAQ,CAAC,CAE5D,OAAO,MAAM,KACX,IAAI,IACF,EAAM,QAAS,GACb,EAAG,KAAK,EAAU,CAChB,IAAK,EACL,OAAQ,EACR,SAAU,GACV,MACD,CAAC,CACH,CACF,CACF,EAWU,EACX,GACa,CACb,GAAM,CACJ,MAAO,CAAE,mBACT,OAAQ,CAAE,WACV,QAAS,CAAE,UAAS,kBACpB,SAAU,CAAE,mBACV,EAQJ,OAAO,EAAwB,CAC7B,iBAAkB,EAClB,eARsB,CAEtB,GAAG,EAAe,IAAK,GAAQ,OAAO,IAAM,CAC5C,GAAI,MAAM,QAAQ,EAAe,CAAG,EAAiB,CAAC,EAAe,CACtE,CAAC,OAAQ,GAAmB,OAAO,GAAM,SAAS,CAKjD,QAAS,CAAC,EAAS,GAAG,EAAQ,CAC9B,IAAK,GACN,CAAC"}
+{"version":3,"file":"buildFilesList.mjs","names":[],"sources":["../../../src/utils/buildFilesList.ts"],"sourcesContent":["import { isAbsolute, normalize, relative, resolve } from 'node:path';\nimport type { IntlayerConfig } from '@intlayer/types/config';\nimport fg from 'fast-glob';\n\n/**\n * Options for building the files list\n */\nexport type BuildComponentFilesListOptions = {\n  /**\n   * Glob patterns to match files\n   */\n  transformPattern: string | string[];\n  /**\n   * Glob patterns to exclude files\n   */\n  excludePattern?: string | string[];\n  /**\n   * Base directory (or directories) for file resolution.\n   * When multiple directories are provided, subdirectories of others are\n   * automatically deduplicated so files are never scanned twice.\n   */\n  baseDir: string | string[];\n  /**\n   * Whether to include dot-prefixed files and directories (default: false)\n   */\n  dot?: boolean;\n};\n\n/**\n * Normalizes a pattern value to an array\n */\nconst normalizeToArray = <T>(value: T | T[]): T[] =>\n  Array.isArray(value) ? value : [value];\n\n/**\n * Remove directories that are subdirectories of others in the list so files\n * are never scanned twice.\n * Example: ['/root', '/root/src'] → ['/root']\n */\nconst getDistinctRootDirs = (dirs: string[]): string[] => {\n  const uniqueDirs = Array.from(new Set(dirs.map((dir) => resolve(dir))));\n  uniqueDirs.sort((a, b) => a.length - b.length);\n\n  return uniqueDirs.reduce((acc: string[], dir) => {\n    const isNested = acc.some((parent) => {\n      const rel = relative(parent, dir);\n      return !rel.startsWith('..') && !isAbsolute(rel) && rel !== '';\n    });\n    if (!isNested) acc.push(dir);\n    return acc;\n  }, []);\n};\n\n/**\n * Builds a deduplicated list of absolute file paths matching the given patterns.\n *\n * Handles multiple root directories (deduplicates overlapping roots), exclude\n * patterns, negation patterns embedded in `transformPattern`, and optional\n * dot-file inclusion.\n *\n * @example\n * // Single root with excludes\n * const files = buildComponentFilesList({\n *   transformPattern: 'src/**\\/*.{ts,tsx}',\n *   excludePattern: ['**\\/node_modules\\/**'],\n *   baseDir: '/path/to/project',\n * });\n *\n * @example\n * // Multiple roots (e.g. baseDir + codeDir), dot files included\n * const files = buildComponentFilesList({\n *   transformPattern: config.build.traversePattern,\n *   baseDir: [config.system.baseDir, ...config.content.codeDir],\n *   dot: true,\n * });\n */\nexport const buildComponentFilesList = (\n  config: BuildComponentFilesListOptions\n): string[] => {\n  const {\n    transformPattern,\n    excludePattern = [],\n    baseDir,\n    dot = false,\n  } = config;\n\n  const patterns = normalizeToArray(transformPattern)\n    .filter(\n      (pattern): pattern is string =>\n        typeof pattern === 'string' && !pattern.startsWith('!')\n    )\n    .map(normalize); // Ensure it works with Windows\n\n  const excludePatterns = [\n    ...normalizeToArray(excludePattern),\n    // Treat negation entries in transformPattern as additional excludes\n    ...normalizeToArray(transformPattern)\n      .filter(\n        (pattern): pattern is string =>\n          typeof pattern === 'string' && pattern.startsWith('!')\n      )\n      .map((pattern) => pattern.slice(1)),\n  ]\n    .filter((pattern): pattern is string => typeof pattern === 'string')\n    .map(normalize); // Ensure it works with Windows\n\n  const roots = getDistinctRootDirs(normalizeToArray(baseDir));\n\n  return Array.from(\n    new Set(\n      roots.flatMap((root) =>\n        fg.sync(patterns, {\n          cwd: root,\n          ignore: excludePatterns,\n          absolute: true,\n          dot,\n        })\n      )\n    )\n  );\n};\n\n/**\n * Convenience wrapper that derives all file-list options directly from an\n * `IntlayerConfig` object.\n *\n * Scans `[baseDir, ...codeDir]` using `build.traversePattern`, excludes\n * content declaration file extensions and any `compiler.excludePattern`\n * entries defined in the configuration, and includes dot files.\n */\nexport const buildComponentFilesListFromConfig = (\n  intlayerConfig: IntlayerConfig\n): string[] => {\n  const {\n    build: { traversePattern },\n    system: { baseDir },\n    content: { codeDir, fileExtensions },\n    compiler: { excludePattern },\n  } = intlayerConfig;\n\n  const excludePatterns = [\n    // Exclude content declaration files (e.g. **/*.content.ts)\n    ...fileExtensions.map((ext) => `**/*${ext}`),\n    ...(Array.isArray(excludePattern) ? excludePattern : [excludePattern]),\n  ].filter((p): p is string => typeof p === 'string');\n\n  return buildComponentFilesList({\n    transformPattern: traversePattern,\n    excludePattern: excludePatterns,\n    baseDir: [baseDir, ...codeDir],\n    dot: true,\n  });\n};\n"],"mappings":";;;;;;;AA+BA,MAAM,oBAAuB,UAC3B,MAAM,QAAQ,MAAM,GAAG,QAAQ,CAAC,MAAM;;;;;;AAOxC,MAAM,uBAAuB,SAA6B;CACxD,MAAM,aAAa,MAAM,KAAK,IAAI,IAAI,KAAK,KAAK,QAAQ,QAAQ,IAAI,CAAC,CAAC,CAAC;AACvE,YAAW,MAAM,GAAG,MAAM,EAAE,SAAS,EAAE,OAAO;AAE9C,QAAO,WAAW,QAAQ,KAAe,QAAQ;AAK/C,MAAI,CAJa,IAAI,MAAM,WAAW;GACpC,MAAM,MAAM,SAAS,QAAQ,IAAI;AACjC,UAAO,CAAC,IAAI,WAAW,KAAK,IAAI,CAAC,WAAW,IAAI,IAAI,QAAQ;IAC5D,CACa,KAAI,KAAK,IAAI;AAC5B,SAAO;IACN,EAAE,CAAC;;;;;;;;;;;;;;;;;;;;;;;;;AA0BR,MAAa,2BACX,WACa;CACb,MAAM,EACJ,kBACA,iBAAiB,EAAE,EACnB,SACA,MAAM,UACJ;CAEJ,MAAM,WAAW,iBAAiB,iBAAiB,CAChD,QACE,YACC,OAAO,YAAY,YAAY,CAAC,QAAQ,WAAW,IAAI,CAC1D,CACA,IAAI,UAAU;CAEjB,MAAM,kBAAkB,CACtB,GAAG,iBAAiB,eAAe,EAEnC,GAAG,iBAAiB,iBAAiB,CAClC,QACE,YACC,OAAO,YAAY,YAAY,QAAQ,WAAW,IAAI,CACzD,CACA,KAAK,YAAY,QAAQ,MAAM,EAAE,CAAC,CACtC,CACE,QAAQ,YAA+B,OAAO,YAAY,SAAS,CACnE,IAAI,UAAU;CAEjB,MAAM,QAAQ,oBAAoB,iBAAiB,QAAQ,CAAC;AAE5D,QAAO,MAAM,KACX,IAAI,IACF,MAAM,SAAS,SACb,GAAG,KAAK,UAAU;EAChB,KAAK;EACL,QAAQ;EACR,UAAU;EACV;EACD,CAAC,CACH,CACF,CACF;;;;;;;;;;AAWH,MAAa,qCACX,mBACa;CACb,MAAM,EACJ,OAAO,EAAE,mBACT,QAAQ,EAAE,WACV,SAAS,EAAE,SAAS,kBACpB,UAAU,EAAE,qBACV;AAQJ,QAAO,wBAAwB;EAC7B,kBAAkB;EAClB,gBARsB,CAEtB,GAAG,eAAe,KAAK,QAAQ,OAAO,MAAM,EAC5C,GAAI,MAAM,QAAQ,eAAe,GAAG,iBAAiB,CAAC,eAAe,CACtE,CAAC,QAAQ,MAAmB,OAAO,MAAM,SAAS;EAKjD,SAAS,CAAC,SAAS,GAAG,QAAQ;EAC9B,KAAK;EACN,CAAC"}

package/dist/esm/utils/chunkJSON.mjs

@@ -1,2 +1,334 @@
-import{getChunk as e}from"./getChunk.mjs";const t=e=>typeof e==`object`&&!!e&&!Array.isArray(e),n=e=>{let t=5381;for(let n=0;n<e.length;n++)t=(t<<5)+t^e.charCodeAt(n);return(t>>>0).toString(16).padStart(8,`0`)},r=(e,n,r)=>{let i=e;for(let e=0;e<n.length-1;e++){let r=n[e],a=typeof n[e+1]==`number`;if(typeof r==`number`){if(!Array.isArray(i))throw Error(`Expected array at path segment ${e}`);i[r]===void 0&&(i[r]=a?[]:{}),i=i[r]}else{if(!t(i))throw Error(`Expected object at path segment ${e}`);r in i||(i[r]=a?[]:{}),i=i[r]}}let a=n[n.length-1];if(typeof a==`number`){if(!Array.isArray(i))throw Error(`Expected array at final segment`);i[a]=r}else{if(!t(i))throw Error(`Expected object at final segment`);i[a]=r}},i=e=>JSON.stringify(e),a=(t,n)=>{if(n<=0)throw Error(`maxChars must be > 0`);let r=[],i=0;for(;i<t.length;){let a=e(t,{charStart:i,charLength:n});if(!a)break;r.push(a),i+=a.length}return r},o=(e,t,n=[],r=new WeakSet)=>{let i=Math.max(1,Math.floor((t-400)*.8)),o=[],s=(e,n)=>{if(typeof e==`string`){let r={op:`set`,path:n,value:e};if(JSON.stringify(r).length+150<=t){o.push(r);return}let s=a(e,i);o.push({op:`set`,path:[...n,`__splittedType`],value:`string`}),o.push({op:`set`,path:[...n,`__total`],value:s.length});for(let e=0;e<s.length;e++)o.push({op:`set`,path:[...n,String(e+1)],value:s[e]});return}if(typeof e!=`object`||!e){o.push({op:`set`,path:n,value:e});return}if(r.has(e))throw Error(`Cannot serialize circular structures to JSON.`);if(r.add(e),Array.isArray(e))for(let t=0;t<e.length;t++)s(e[t],[...n,t]);else for(let t of Object.keys(e))s(e[t],[...n,t]);r.delete(e)};return s(e,n),o},s=(e,r)=>{if(!t(e)&&!Array.isArray(e))throw Error(`Root must be an object or array.`);if(r<500)throw Error(`maxChars is too small. Use at least 500 characters.`);let i=Array.isArray(e)?`array`:`object`,a;try{a=JSON.stringify(e)}catch{throw Error(`Cannot serialize circular structures to JSON.`)}let s=n(a),c=o(e,r),l=[],u={schemaVersion:1,index:0,total:0,rootType:i,checksum:s,entries:[]},d=JSON.stringify({...u,entries:[]}).length,f=()=>{u.entries.length>0&&(l.push(u),u={schemaVersion:1,index:0,total:0,rootType:i,checksum:s,entries:[]})};for(let e of c)if(d+JSON.stringify(u.entries).length+(u.entries.length?1:0)+JSON.stringify(e).length<=r)u.entries.push(e);else{if(u.entries.length>0&&f(),d+JSON.stringify([e]).length>r)throw Error(`A single entry exceeds maxChars and cannot be split. Reduce entry size or increase maxChars.`);u.entries.push(e)}f(),l.length===0&&l.push({schemaVersion:1,index:0,total:0,rootType:i,checksum:s,entries:[]});let p=l.length;return l.forEach((e,t)=>{e.index=t,e.total=p}),l},c=e=>{let t=e.rootType===`array`?[]:{};for(let n of e.entries)n.op===`set`&&r(t,n.path,n.value);let n=e=>{if(typeof e!=`object`||!e)return e;if(Array.isArray(e)){for(let t=0;t<e.length;t++)e[t]=n(e[t]);return e}if(e.__splittedType===`string`){let t=e.__total;if(typeof t!=`number`||t<=0)return e;let n=[],r=!0;for(let i=1;i<=t;i++){let t=e[String(i)];if(typeof t!=`string`){r=!1;break}n.push(t)}return r?n.join(``):e}if(e.__splittedType===`array`){let t=e.__total;if(typeof t!=`number`||t<0)return e;let r=[],i=!0;for(let a=1;a<=t;a++){let t=e[String(a)];if(!Array.isArray(t)){i=!1;break}for(let e=0;e<t.length;e++)r.push(n(t[e]))}return i?r:e}for(let t of Object.keys(e))e[t]=n(e[t]);return e};return n(t)},l=e=>{if(!e||e.length===0)throw Error(`No chunks provided.`);let t=[...e].sort((e,t)=>e.index-t.index),{checksum:n,rootType:a}=t[0];for(let e=0;e<t.length;e++){let r=t[e];if(r.schemaVersion!==1)throw console.error(`Unsupported schemaVersion.`,{cause:r,schemaVersion:1}),Error(`Unsupported schemaVersion.`);if(r.rootType!==a)throw console.error(`Chunks rootType mismatch.`,{cause:r,rootType:a}),Error(`Chunks rootType mismatch.`);if(r.checksum!==n)throw console.error(`Chunks checksum mismatch (different source objects?).`,{cause:r,checksum:n}),Error(`Chunks checksum mismatch (different source objects?).`);if(r.index!==e)throw console.error(`Chunk indices are not contiguous or sorted.`,{cause:r,index:r.index,i:e}),Error(`Chunk indices are not contiguous or sorted.`)}let o=a===`array`?[]:{},s=new Map,c=e=>r(o,e.path,e.value);for(let e of t)for(let t of e.entries)if(t.op===`set`)c(t);else{let e=i(t.path),n=s.get(e)??{path:t.path,total:t.total,received:[]};if(n.total!==t.total)throw Error(`Inconsistent string part totals for a path.`);n.received.push(t),s.set(e,n)}for(let{path:e,total:t,received:n}of s.values()){if(n.length!==t)throw Error(`Missing string parts for a path; incomplete chunk set.`);n.sort((e,t)=>e.index-t.index),r(o,e,n.map(e=>e.value).join(``))}let l=e=>{if(typeof e!=`object`||!e)return e;if(Array.isArray(e)){for(let t=0;t<e.length;t++)e[t]=l(e[t]);return e}if(e.__splittedType===`string`){let t=e.__total;if(typeof t!=`number`||t<=0)throw Error(`Invalid split-node total for a path.`);let n=[];for(let r=1;r<=t;r++){let t=e[String(r)];if(typeof t!=`string`)throw Error(`Missing string parts for a path; incomplete chunk set.`);n.push(t)}return n.join(``)}if(e.__splittedType===`array`){let t=e.__total;if(typeof t!=`number`||t<0)throw Error(`Invalid split-node total for a path.`);let n=[];for(let r=1;r<=t;r++){let t=e[String(r)];if(!Array.isArray(t))throw Error(`Missing string parts for a path; incomplete chunk set.`);for(let e=0;e<t.length;e++)n.push(l(t[e]))}return n}for(let t of Object.keys(e))e[t]=l(e[t]);return e},u=l(o);for(let e=0;e<t.length;e++){let n=t[e];if(n.total!==t.length)throw Error(`Chunk total does not match provided count. Expected ${t.length}, but chunk ${e} has total=${n.total}`)}return u};export{l as assembleJSON,s as chunkJSON,c as reconstructFromSingleChunk};
+import { getChunk } from "./getChunk.mjs";
+
+//#region src/utils/chunkJSON.ts
+/**
+* Split & reassemble JSON by character budget.
+* - Measures serialized size using JSON.stringify(..).length (characters).
+* - Ensures each chunk is itself valid JSON.
+* - Very large strings are split into safe pieces using getChunk and re-concatenated on assemble.
+* - Protects against circular structures (JSON can't serialize those anyway).
+*/
+const isObject = (val) => {
+	return typeof val === "object" && val !== null && !Array.isArray(val);
+};
+const computeDjb2 = (str) => {
+	let hash = 5381;
+	for (let i = 0; i < str.length; i++) hash = (hash << 5) + hash ^ str.charCodeAt(i);
+	return (hash >>> 0).toString(16).padStart(8, "0");
+};
+const setAtPath = (root, path, value) => {
+	let current = root;
+	for (let i = 0; i < path.length - 1; i++) {
+		const key = path[i];
+		const isNextIndex = typeof path[i + 1] === "number";
+		if (typeof key === "number") {
+			if (!Array.isArray(current)) throw new Error(`Expected array at path segment ${i}`);
+			if (current[key] === void 0) current[key] = isNextIndex ? [] : {};
+			current = current[key];
+		} else {
+			if (!isObject(current)) throw new Error(`Expected object at path segment ${i}`);
+			if (!(key in current)) current[key] = isNextIndex ? [] : {};
+			current = current[key];
+		}
+	}
+	const last = path[path.length - 1];
+	if (typeof last === "number") {
+		if (!Array.isArray(current)) throw new Error(`Expected array at final segment`);
+		current[last] = value;
+	} else {
+		if (!isObject(current)) throw new Error(`Expected object at final segment`);
+		current[last] = value;
+	}
+};
+const pathKey = (path) => {
+	return JSON.stringify(path);
+};
+/**
+* Split a string into parts using getChunk with a charLength budget per part.
+*/
+const splitStringByBudget = (str, maxCharsPerPart) => {
+	if (maxCharsPerPart <= 0) throw new Error("maxChars must be > 0");
+	const output = [];
+	let offset = 0;
+	while (offset < str.length) {
+		const part = getChunk(str, {
+			charStart: offset,
+			charLength: maxCharsPerPart
+		});
+		if (!part) break;
+		output.push(part);
+		offset += part.length;
+	}
+	return output;
+};
+/**
+* Flatten JSON into patches (leaf writes). Strings too large to fit in a single
+* chunk are yielded as multiple str-append patches.
+*/
+const flattenToPatches = (value, maxCharsPerChunk, path = [], seen = /* @__PURE__ */ new WeakSet()) => {
+	const maxStringPiece = Math.max(1, Math.floor((maxCharsPerChunk - 400) * .8));
+	const patches = [];
+	const walk = (currentValue, currentPath) => {
+		if (typeof currentValue === "string") {
+			const testPatch = {
+				op: "set",
+				path: currentPath,
+				value: currentValue
+			};
+			if (JSON.stringify(testPatch).length + 150 <= maxCharsPerChunk) {
+				patches.push(testPatch);
+				return;
+			}
+			const parts = splitStringByBudget(currentValue, maxStringPiece);
+			patches.push({
+				op: "set",
+				path: [...currentPath, "__splittedType"],
+				value: "string"
+			});
+			patches.push({
+				op: "set",
+				path: [...currentPath, "__total"],
+				value: parts.length
+			});
+			for (let i = 0; i < parts.length; i++) patches.push({
+				op: "set",
+				path: [...currentPath, String(i + 1)],
+				value: parts[i]
+			});
+			return;
+		}
+		if (currentValue === null || typeof currentValue !== "object") {
+			patches.push({
+				op: "set",
+				path: currentPath,
+				value: currentValue
+			});
+			return;
+		}
+		if (seen.has(currentValue)) throw new Error("Cannot serialize circular structures to JSON.");
+		seen.add(currentValue);
+		if (Array.isArray(currentValue)) for (let i = 0; i < currentValue.length; i++) walk(currentValue[i], [...currentPath, i]);
+		else for (const key of Object.keys(currentValue)) walk(currentValue[key], [...currentPath, key]);
+		seen.delete(currentValue);
+	};
+	walk(value, path);
+	return patches;
+};
+/**
+* Split JSON into chunks constrained by character count of serialized chunk.
+*/
+const chunkJSON = (value, maxChars) => {
+	if (!isObject(value) && !Array.isArray(value)) throw new Error("Root must be an object or array.");
+	if (maxChars < 500) throw new Error("maxChars is too small. Use at least 500 characters.");
+	const rootType = Array.isArray(value) ? "array" : "object";
+	let sourceString;
+	try {
+		sourceString = JSON.stringify(value);
+	} catch {
+		throw new Error("Cannot serialize circular structures to JSON.");
+	}
+	const checksum = computeDjb2(sourceString);
+	const allPatches = flattenToPatches(value, maxChars);
+	const chunks = [];
+	let currentChunk = {
+		schemaVersion: 1,
+		index: 0,
+		total: 0,
+		rootType,
+		checksum,
+		entries: []
+	};
+	const emptyEnvelopeSize = JSON.stringify({
+		...currentChunk,
+		entries: []
+	}).length;
+	const tryFlush = () => {
+		if (currentChunk.entries.length > 0) {
+			chunks.push(currentChunk);
+			currentChunk = {
+				schemaVersion: 1,
+				index: 0,
+				total: 0,
+				rootType,
+				checksum,
+				entries: []
+			};
+		}
+	};
+	for (const patch of allPatches) if (emptyEnvelopeSize + JSON.stringify(currentChunk.entries).length + (currentChunk.entries.length ? 1 : 0) + JSON.stringify(patch).length <= maxChars) currentChunk.entries.push(patch);
+	else {
+		if (currentChunk.entries.length > 0) tryFlush();
+		if (emptyEnvelopeSize + JSON.stringify([patch]).length > maxChars) throw new Error("A single entry exceeds maxChars and cannot be split. Reduce entry size or increase maxChars.");
+		currentChunk.entries.push(patch);
+	}
+	tryFlush();
+	if (chunks.length === 0) chunks.push({
+		schemaVersion: 1,
+		index: 0,
+		total: 0,
+		rootType,
+		checksum,
+		entries: []
+	});
+	const totalChunks = chunks.length;
+	chunks.forEach((chunk, index) => {
+		chunk.index = index;
+		chunk.total = totalChunks;
+	});
+	return chunks;
+};
+/**
+* Reassemble JSON from chunks.
+* - Validates checksums and indices.
+* - Applies 'set' patches and merges string pieces from 'str-append'.
+*/
+/**
+* Reconstruct content from a single chunk without validation.
+* Useful for processing individual chunks in a pipeline where you don't have all chunks yet.
+* Note: This will only reconstruct the partial content contained in this chunk.
+*/
+const reconstructFromSingleChunk = (chunk) => {
+	const root = chunk.rootType === "array" ? [] : {};
+	for (const entry of chunk.entries) if (entry.op === "set") setAtPath(root, entry.path, entry.value);
+	const reconcileSplitNodes = (node) => {
+		if (node === null || typeof node !== "object") return node;
+		if (Array.isArray(node)) {
+			for (let i = 0; i < node.length; i++) node[i] = reconcileSplitNodes(node[i]);
+			return node;
+		}
+		if (node["__splittedType"] === "string") {
+			const total = node["__total"];
+			if (typeof total !== "number" || total <= 0) return node;
+			const parts = [];
+			let hasAllParts = true;
+			for (let i = 1; i <= total; i++) {
+				const piece = node[String(i)];
+				if (typeof piece !== "string") {
+					hasAllParts = false;
+					break;
+				}
+				parts.push(piece);
+			}
+			if (hasAllParts) return parts.join("");
+			return node;
+		}
+		if (node["__splittedType"] === "array") {
+			const total = node["__total"];
+			if (typeof total !== "number" || total < 0) return node;
+			const output = [];
+			let hasAllParts = true;
+			for (let i = 1; i <= total; i++) {
+				const slice = node[String(i)];
+				if (!Array.isArray(slice)) {
+					hasAllParts = false;
+					break;
+				}
+				for (let j = 0; j < slice.length; j++) output.push(reconcileSplitNodes(slice[j]));
+			}
+			if (hasAllParts) return output;
+			return node;
+		}
+		for (const key of Object.keys(node)) node[key] = reconcileSplitNodes(node[key]);
+		return node;
+	};
+	return reconcileSplitNodes(root);
+};
+const assembleJSON = (chunks) => {
+	if (!chunks || chunks.length === 0) throw new Error("No chunks provided.");
+	const sorted = [...chunks].sort((a, b) => a.index - b.index);
+	const { checksum, rootType } = sorted[0];
+	const schemaVersion = 1;
+	for (let i = 0; i < sorted.length; i++) {
+		const chunk = sorted[i];
+		if (chunk.schemaVersion !== schemaVersion) {
+			console.error("Unsupported schemaVersion.", {
+				cause: chunk,
+				schemaVersion
+			});
+			throw new Error("Unsupported schemaVersion.");
+		}
+		if (chunk.rootType !== rootType) {
+			console.error("Chunks rootType mismatch.", {
+				cause: chunk,
+				rootType
+			});
+			throw new Error("Chunks rootType mismatch.");
+		}
+		if (chunk.checksum !== checksum) {
+			console.error("Chunks checksum mismatch (different source objects?).", {
+				cause: chunk,
+				checksum
+			});
+			throw new Error("Chunks checksum mismatch (different source objects?).");
+		}
+		if (chunk.index !== i) {
+			console.error("Chunk indices are not contiguous or sorted.", {
+				cause: chunk,
+				index: chunk.index,
+				i
+			});
+			throw new Error("Chunk indices are not contiguous or sorted.");
+		}
+	}
+	const root = rootType === "array" ? [] : {};
+	const stringParts = /* @__PURE__ */ new Map();
+	const applySet = (patch) => setAtPath(root, patch.path, patch.value);
+	for (const chunk of sorted) for (const entry of chunk.entries) if (entry.op === "set") applySet(entry);
+	else {
+		const key = pathKey(entry.path);
+		const record = stringParts.get(key) ?? {
+			path: entry.path,
+			total: entry.total,
+			received: []
+		};
+		if (record.total !== entry.total) throw new Error("Inconsistent string part totals for a path.");
+		record.received.push(entry);
+		stringParts.set(key, record);
+	}
+	for (const { path, total, received } of stringParts.values()) {
+		if (received.length !== total) throw new Error("Missing string parts for a path; incomplete chunk set.");
+		received.sort((a, b) => a.index - b.index);
+		setAtPath(root, path, received.map((part) => part.value).join(""));
+	}
+	const reconcileSplitNodes = (node) => {
+		if (node === null || typeof node !== "object") return node;
+		if (Array.isArray(node)) {
+			for (let i = 0; i < node.length; i++) node[i] = reconcileSplitNodes(node[i]);
+			return node;
+		}
+		if (node["__splittedType"] === "string") {
+			const total = node["__total"];
+			if (typeof total !== "number" || total <= 0) throw new Error("Invalid split-node total for a path.");
+			const parts = [];
+			for (let i = 1; i <= total; i++) {
+				const piece = node[String(i)];
+				if (typeof piece !== "string") throw new Error("Missing string parts for a path; incomplete chunk set.");
+				parts.push(piece);
+			}
+			return parts.join("");
+		}
+		if (node["__splittedType"] === "array") {
+			const total = node["__total"];
+			if (typeof total !== "number" || total < 0) throw new Error("Invalid split-node total for a path.");
+			const output = [];
+			for (let i = 1; i <= total; i++) {
+				const slice = node[String(i)];
+				if (!Array.isArray(slice)) throw new Error("Missing string parts for a path; incomplete chunk set.");
+				for (let j = 0; j < slice.length; j++) output.push(reconcileSplitNodes(slice[j]));
+			}
+			return output;
+		}
+		for (const key of Object.keys(node)) node[key] = reconcileSplitNodes(node[key]);
+		return node;
+	};
+	const reconciled = reconcileSplitNodes(root);
+	for (let i = 0; i < sorted.length; i++) {
+		const chunk = sorted[i];
+		if (chunk.total !== sorted.length) throw new Error(`Chunk total does not match provided count. Expected ${sorted.length}, but chunk ${i} has total=${chunk.total}`);
+	}
+	return reconciled;
+};
+
+//#endregion
+export { assembleJSON, chunkJSON, reconstructFromSingleChunk };
 //# sourceMappingURL=chunkJSON.mjs.map

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

@@ -1 +1 @@
-{"version":3,"file":"chunkJSON.mjs","names":[],"sources":["../../../src/utils/chunkJSON.ts"],"sourcesContent":["/**\n * Split & reassemble JSON by character budget.\n * - Measures serialized size using JSON.stringify(..).length (characters).\n * - Ensures each chunk is itself valid JSON.\n * - Very large strings are split into safe pieces using getChunk and re-concatenated on assemble.\n * - Protects against circular structures (JSON can't serialize those anyway).\n */\n\nimport { getChunk } from './getChunk';\n\ntype JSONPrimitive = string | number | boolean | null;\ntype JSONValue = JSONPrimitive | JSONObject | JSONArray;\n\nexport type JSONObject = {\n  [k: string]: JSONValue;\n};\n\ntype JSONArray = JSONValue[];\n\ntype Path = Array<string | number>;\n\ntype SetPatch = { op: 'set'; path: Path; value: JSONValue };\ntype StrAppendPatch = {\n  op: 'str-append';\n  path: Path;\n  value: string; // part of a longer string\n  index: number;\n  total: number;\n};\ntype Patch = SetPatch | StrAppendPatch;\n\ntype RootType = 'object' | 'array';\n\nexport type JsonChunk = {\n  schemaVersion: 1;\n  index: number;\n  total: number;\n  rootType: RootType;\n  checksum: string; // hash of the full original JSON string\n  entries: Patch[];\n};\n\nconst isObject = (val: unknown): val is Record<string, unknown> => {\n  return typeof val === 'object' && val !== null && !Array.isArray(val);\n};\n\nconst computeDjb2 = (str: string): string => {\n  // Simple 32-bit hash; deterministic & fast\n  let hash = 5381;\n\n  for (let i = 0; i < str.length; i++) {\n    hash = ((hash << 5) + hash) ^ str.charCodeAt(i);\n  }\n\n  // convert to unsigned hex\n  return (hash >>> 0).toString(16).padStart(8, '0');\n};\n\nconst setAtPath = (root: any, path: Path, value: JSONValue) => {\n  let current = root;\n\n  for (let i = 0; i < path.length - 1; i++) {\n    const key = path[i];\n    const nextKey = path[i + 1];\n    const isNextIndex = typeof nextKey === 'number';\n\n    if (typeof key === 'number') {\n      if (!Array.isArray(current)) {\n        throw new Error(`Expected array at path segment ${i}`);\n      }\n\n      if (current[key] === undefined) {\n        current[key] = isNextIndex ? [] : {};\n      }\n\n      current = current[key];\n    } else {\n      if (!isObject(current)) {\n        throw new Error(`Expected object at path segment ${i}`);\n      }\n\n      if (!(key in current)) {\n        (current as any)[key] = isNextIndex ? [] : {};\n      }\n\n      current = (current as any)[key];\n    }\n  }\n\n  const last = path[path.length - 1];\n\n  if (typeof last === 'number') {\n    if (!Array.isArray(current)) {\n      throw new Error(`Expected array at final segment`);\n    }\n\n    current[last] = value as any;\n  } else {\n    if (!isObject(current)) {\n      throw new Error(`Expected object at final segment`);\n    }\n\n    (current as any)[last] = value as any;\n  }\n};\n\nconst pathKey = (path: Path): string => {\n  // stable key for grouping string parts\n  return JSON.stringify(path);\n};\n\n/**\n * Split a string into parts using getChunk with a charLength budget per part.\n */\nconst splitStringByBudget = (\n  str: string,\n  maxCharsPerPart: number\n): string[] => {\n  if (maxCharsPerPart <= 0) {\n    throw new Error('maxChars must be > 0');\n  }\n\n  const output: string[] = [];\n  let offset = 0;\n\n  while (offset < str.length) {\n    const part = getChunk(str, {\n      charStart: offset,\n      charLength: maxCharsPerPart,\n    });\n\n    if (!part) break;\n\n    output.push(part);\n    offset += part.length;\n  }\n\n  return output;\n};\n\n/**\n * Flatten JSON into patches (leaf writes). Strings too large to fit in a single\n * chunk are yielded as multiple str-append patches.\n */\nconst flattenToPatches = (\n  value: JSONValue,\n  maxCharsPerChunk: number,\n  path: Path = [],\n  seen = new WeakSet<object>()\n): Patch[] => {\n  // Conservative per-entry cap so a single entry fits into an empty chunk with envelope overhead.\n  // (Envelope ~ a few hundred chars; we keep a comfortable margin.)\n  const maxStringPiece = Math.max(\n    1,\n    Math.floor((maxCharsPerChunk - 400) * 0.8)\n  );\n\n  const patches: Patch[] = [];\n\n  const walk = (currentValue: JSONValue, currentPath: Path) => {\n    if (typeof currentValue === 'string') {\n      // If the serialized patch wouldn't fit, split the string into multiple parts\n      // and encode as a split-node sentinel with numbered keys.\n      const testPatch: SetPatch = {\n        op: 'set',\n        path: currentPath,\n        value: currentValue,\n      };\n      const testLen = JSON.stringify(testPatch).length + 150; // margin\n\n      if (testLen <= maxCharsPerChunk) {\n        patches.push(testPatch);\n        return;\n      }\n\n      // Use getChunk-based splitting to produce stable parts\n      const parts = splitStringByBudget(currentValue, maxStringPiece);\n\n      // Emit split-node metadata and parts as individual leaf writes\n      patches.push({\n        op: 'set',\n        path: [...currentPath, '__splittedType'],\n        value: 'string',\n      });\n      patches.push({\n        op: 'set',\n        path: [...currentPath, '__total'],\n        value: parts.length,\n      });\n\n      for (let i = 0; i < parts.length; i++) {\n        patches.push({\n          op: 'set',\n          path: [...currentPath, String(i + 1)],\n          value: parts[i],\n        });\n      }\n\n      return;\n    }\n\n    if (currentValue === null || typeof currentValue !== 'object') {\n      patches.push({ op: 'set', path: currentPath, value: currentValue });\n      return;\n    }\n\n    if (seen.has(currentValue as object)) {\n      throw new Error('Cannot serialize circular structures to JSON.');\n    }\n\n    seen.add(currentValue as object);\n\n    if (Array.isArray(currentValue)) {\n      for (let i = 0; i < currentValue.length; i++) {\n        walk(currentValue[i] as JSONValue, [...currentPath, i]);\n      }\n    } else {\n      for (const key of Object.keys(currentValue)) {\n        walk((currentValue as JSONObject)[key], [...currentPath, key]);\n      }\n    }\n\n    seen.delete(currentValue as object);\n  };\n\n  walk(value, path);\n  return patches;\n};\n\n/**\n * Split JSON into chunks constrained by character count of serialized chunk.\n */\nexport const chunkJSON = (\n  value: JSONObject | JSONArray,\n  maxChars: number\n): JsonChunk[] => {\n  if (!isObject(value) && !Array.isArray(value)) {\n    throw new Error('Root must be an object or array.');\n  }\n\n  if (maxChars < 500) {\n    // You can lower this if you truly need; recommended to keep some envelope headroom.\n    throw new Error('maxChars is too small. Use at least 500 characters.');\n  }\n\n  const rootType: RootType = Array.isArray(value) ? 'array' : 'object';\n  let sourceString: string;\n\n  try {\n    sourceString = JSON.stringify(value);\n  } catch {\n    // Provide a deterministic error message for circular refs\n    throw new Error('Cannot serialize circular structures to JSON.');\n  }\n\n  const checksum = computeDjb2(sourceString);\n  const allPatches = flattenToPatches(value as JSONValue, maxChars);\n\n  const chunks: JsonChunk[] = [];\n  let currentChunk: JsonChunk = {\n    schemaVersion: 1,\n    index: 0, // provisional\n    total: 0, // provisional\n    rootType,\n    checksum,\n    entries: [],\n  };\n\n  const emptyEnvelopeSize = JSON.stringify({\n    ...currentChunk,\n    entries: [],\n  }).length;\n\n  const tryFlush = () => {\n    if (currentChunk.entries.length > 0) {\n      chunks.push(currentChunk);\n      currentChunk = {\n        schemaVersion: 1,\n        index: 0,\n        total: 0,\n        rootType,\n        checksum,\n        entries: [],\n      };\n    }\n  };\n\n  for (const patch of allPatches) {\n    // Would adding this patch exceed maxChars?\n    const withPatchSize =\n      emptyEnvelopeSize +\n      JSON.stringify(currentChunk.entries).length + // current entries array\n      (currentChunk.entries.length ? 1 : 0) + // possible comma\n      JSON.stringify(patch).length;\n\n    if (withPatchSize <= maxChars) {\n      currentChunk.entries.push(patch);\n    } else {\n      // Start a new chunk if current has items\n      if (currentChunk.entries.length > 0) {\n        tryFlush();\n      }\n\n      // Ensure single patch fits into an empty chunk\n      const singleSize = emptyEnvelopeSize + JSON.stringify([patch]).length;\n\n      if (singleSize > maxChars) {\n        // This should only happen for massive strings, which we pre-split;\n        // if it happens for a non-string, we cannot split further.\n        throw new Error(\n          'A single entry exceeds maxChars and cannot be split. Reduce entry size or increase maxChars.'\n        );\n      }\n\n      currentChunk.entries.push(patch);\n    }\n  }\n\n  tryFlush();\n\n  // Ensure at least one chunk exists (even for empty root)\n  if (chunks.length === 0) {\n    chunks.push({\n      schemaVersion: 1,\n      index: 0,\n      total: 0, // provisional\n      rootType,\n      checksum,\n      entries: [],\n    });\n  }\n\n  // Finalize indices & totals\n  const totalChunks = chunks.length;\n\n  chunks.forEach((chunk, index) => {\n    chunk.index = index;\n    chunk.total = totalChunks;\n  });\n\n  return chunks;\n};\n\n/**\n * Reassemble JSON from chunks.\n * - Validates checksums and indices.\n * - Applies 'set' patches and merges string pieces from 'str-append'.\n */\n/**\n * Reconstruct content from a single chunk without validation.\n * Useful for processing individual chunks in a pipeline where you don't have all chunks yet.\n * Note: This will only reconstruct the partial content contained in this chunk.\n */\nexport const reconstructFromSingleChunk = (\n  chunk: JsonChunk\n): JSONObject | JSONArray => {\n  const root: any = chunk.rootType === 'array' ? [] : {};\n\n  // Apply all 'set' patches from this chunk\n  for (const entry of chunk.entries) {\n    if (entry.op === 'set') {\n      setAtPath(root, entry.path, entry.value);\n    }\n  }\n\n  // Reconcile split-node sentinels for strings/arrays\n  // When reconstructing from a single chunk, we may have incomplete split nodes\n  const reconcileSplitNodes = (node: any): any => {\n    if (node === null || typeof node !== 'object') return node;\n\n    if (Array.isArray(node)) {\n      for (let i = 0; i < node.length; i++) {\n        node[i] = reconcileSplitNodes(node[i]);\n      }\n      return node;\n    }\n\n    // string split-node\n    if ((node as any)['__splittedType'] === 'string') {\n      const total = (node as any)['__total'];\n\n      if (typeof total !== 'number' || total <= 0) {\n        // Invalid split node, return as-is\n        return node;\n      }\n\n      const parts: string[] = [];\n      let hasAllParts = true;\n\n      for (let i = 1; i <= total; i++) {\n        const piece = (node as any)[String(i)];\n\n        if (typeof piece !== 'string') {\n          hasAllParts = false;\n          break;\n        }\n\n        parts.push(piece);\n      }\n\n      // Only reconstruct if we have all parts, otherwise return the node as-is\n      if (hasAllParts) {\n        return parts.join('');\n      }\n\n      return node;\n    }\n\n    // array split-node (optional support)\n    if ((node as any)['__splittedType'] === 'array') {\n      const total = (node as any)['__total'];\n\n      if (typeof total !== 'number' || total < 0) {\n        // Invalid split node, return as-is\n        return node;\n      }\n\n      const output: any[] = [];\n      let hasAllParts = true;\n\n      for (let i = 1; i <= total; i++) {\n        const slice = (node as any)[String(i)];\n\n        if (!Array.isArray(slice)) {\n          hasAllParts = false;\n          break;\n        }\n\n        for (let j = 0; j < slice.length; j++) {\n          output.push(reconcileSplitNodes(slice[j]));\n        }\n      }\n\n      // Only reconstruct if we have all parts\n      if (hasAllParts) {\n        return output;\n      }\n\n      return node;\n    }\n\n    // walk normal object\n    for (const key of Object.keys(node)) {\n      node[key] = reconcileSplitNodes(node[key]);\n    }\n\n    return node;\n  };\n\n  return reconcileSplitNodes(root);\n};\n\nexport const assembleJSON = (chunks: JsonChunk[]): JSONObject | JSONArray => {\n  if (!chunks || chunks.length === 0) {\n    throw new Error('No chunks provided.');\n  }\n\n  // Basic validation & sort\n  const sorted = [...chunks].sort((a, b) => a.index - b.index);\n  const { checksum, rootType } = sorted[0];\n  const schemaVersion = 1;\n\n  for (let i = 0; i < sorted.length; i++) {\n    const chunk = sorted[i];\n\n    if (chunk.schemaVersion !== schemaVersion) {\n      console.error('Unsupported schemaVersion.', {\n        cause: chunk,\n        schemaVersion,\n      });\n      throw new Error('Unsupported schemaVersion.');\n    }\n\n    if (chunk.rootType !== rootType) {\n      console.error('Chunks rootType mismatch.', {\n        cause: chunk,\n        rootType,\n      });\n      throw new Error('Chunks rootType mismatch.');\n    }\n\n    if (chunk.checksum !== checksum) {\n      console.error('Chunks checksum mismatch (different source objects?).', {\n        cause: chunk,\n        checksum,\n      });\n      throw new Error('Chunks checksum mismatch (different source objects?).');\n    }\n\n    if (chunk.index !== i) {\n      console.error('Chunk indices are not contiguous or sorted.', {\n        cause: chunk,\n        index: chunk.index,\n        i,\n      });\n      throw new Error('Chunk indices are not contiguous or sorted.');\n    }\n\n    // Defer total check until after reconstruction to prefer more specific errors\n  }\n\n  const root: any = rootType === 'array' ? [] : {};\n\n  // Collect string parts by path\n  const stringParts = new Map<\n    string,\n    { path: Path; total: number; received: StrAppendPatch[] }\n  >();\n\n  const applySet = (patch: SetPatch) =>\n    setAtPath(root, patch.path, patch.value);\n\n  for (const chunk of sorted) {\n    for (const entry of chunk.entries) {\n      if (entry.op === 'set') {\n        applySet(entry);\n      } else {\n        const key = pathKey(entry.path);\n        const record = stringParts.get(key) ?? {\n          path: entry.path,\n          total: entry.total,\n          received: [],\n        };\n\n        if (record.total !== entry.total) {\n          throw new Error('Inconsistent string part totals for a path.');\n        }\n\n        record.received.push(entry);\n        stringParts.set(key, record);\n      }\n    }\n  }\n\n  // Stitch strings\n  for (const { path, total, received } of stringParts.values()) {\n    if (received.length !== total) {\n      throw new Error('Missing string parts for a path; incomplete chunk set.');\n    }\n\n    received.sort((a, b) => a.index - b.index);\n    const fullString = received.map((part) => part.value).join('');\n    setAtPath(root, path, fullString);\n  }\n\n  // Reconcile split-node sentinels for strings/arrays after all patches applied\n  const reconcileSplitNodes = (node: any): any => {\n    if (node === null || typeof node !== 'object') return node;\n\n    if (Array.isArray(node)) {\n      for (let i = 0; i < node.length; i++) {\n        node[i] = reconcileSplitNodes(node[i]);\n      }\n      return node;\n    }\n\n    // string split-node\n    if ((node as any)['__splittedType'] === 'string') {\n      const total = (node as any)['__total'];\n\n      if (typeof total !== 'number' || total <= 0) {\n        throw new Error('Invalid split-node total for a path.');\n      }\n\n      const parts: string[] = [];\n\n      for (let i = 1; i <= total; i++) {\n        const piece = (node as any)[String(i)];\n\n        if (typeof piece !== 'string') {\n          throw new Error(\n            'Missing string parts for a path; incomplete chunk set.'\n          );\n        }\n\n        parts.push(piece);\n      }\n\n      return parts.join('');\n    }\n\n    // array split-node (optional support)\n    if ((node as any)['__splittedType'] === 'array') {\n      const total = (node as any)['__total'];\n\n      if (typeof total !== 'number' || total < 0) {\n        throw new Error('Invalid split-node total for a path.');\n      }\n\n      const output: any[] = [];\n\n      for (let i = 1; i <= total; i++) {\n        const slice = (node as any)[String(i)];\n\n        if (!Array.isArray(slice)) {\n          throw new Error(\n            'Missing string parts for a path; incomplete chunk set.'\n          );\n        }\n\n        for (let j = 0; j < slice.length; j++) {\n          output.push(reconcileSplitNodes(slice[j]));\n        }\n      }\n\n      return output;\n    }\n\n    // walk normal object\n    for (const key of Object.keys(node)) {\n      node[key] = reconcileSplitNodes(node[key]);\n    }\n\n    return node;\n  };\n\n  const reconciled = reconcileSplitNodes(root);\n\n  // Now validate totals match provided count\n  for (let i = 0; i < sorted.length; i++) {\n    const chunk = sorted[i];\n\n    if (chunk.total !== sorted.length) {\n      throw new Error(\n        `Chunk total does not match provided count. Expected ${sorted.length}, but chunk ${i} has total=${chunk.total}`\n      );\n    }\n  }\n\n  return reconciled;\n};\n\n/* -------------------------------------------\n * Example usage\n * -------------------------------------------\nconst big: JSONObject = {\n  title: \"Document\",\n  content: \"…a very very long text…\",\n  items: Array.from({ length: 2000 }, (_, i) => ({ id: i, label: `Item ${i}` }))\n};\n\n// Split to ~16k-char chunks\nconst chunks = chunkJSON(big, 16_000);\n\n// Send each `chunks[i]` as JSON to your backend.\n// Later, reassemble:\nconst restored = assembleJSON(chunks);\nconsole.log(JSON.stringify(restored) === JSON.stringify(big)); // true\n*/\n"],"mappings":"0CA0CA,MAAM,EAAY,GACT,OAAO,GAAQ,YAAY,GAAgB,CAAC,MAAM,QAAQ,EAAI,CAGjE,EAAe,GAAwB,CAE3C,IAAI,EAAO,KAEX,IAAK,IAAI,EAAI,EAAG,EAAI,EAAI,OAAQ,IAC9B,GAAS,GAAQ,GAAK,EAAQ,EAAI,WAAW,EAAE,CAIjD,OAAQ,IAAS,GAAG,SAAS,GAAG,CAAC,SAAS,EAAG,IAAI,EAG7C,GAAa,EAAW,EAAY,IAAqB,CAC7D,IAAI,EAAU,EAEd,IAAK,IAAI,EAAI,EAAG,EAAI,EAAK,OAAS,EAAG,IAAK,CACxC,IAAM,EAAM,EAAK,GAEX,EAAc,OADJ,EAAK,EAAI,IACc,SAEvC,GAAI,OAAO,GAAQ,SAAU,CAC3B,GAAI,CAAC,MAAM,QAAQ,EAAQ,CACzB,MAAU,MAAM,kCAAkC,IAAI,CAGpD,EAAQ,KAAS,IAAA,KACnB,EAAQ,GAAO,EAAc,EAAE,CAAG,EAAE,EAGtC,EAAU,EAAQ,OACb,CACL,GAAI,CAAC,EAAS,EAAQ,CACpB,MAAU,MAAM,mCAAmC,IAAI,CAGnD,KAAO,IACV,EAAgB,GAAO,EAAc,EAAE,CAAG,EAAE,EAG/C,EAAW,EAAgB,IAI/B,IAAM,EAAO,EAAK,EAAK,OAAS,GAEhC,GAAI,OAAO,GAAS,SAAU,CAC5B,GAAI,CAAC,MAAM,QAAQ,EAAQ,CACzB,MAAU,MAAM,kCAAkC,CAGpD,EAAQ,GAAQ,MACX,CACL,GAAI,CAAC,EAAS,EAAQ,CACpB,MAAU,MAAM,mCAAmC,CAGpD,EAAgB,GAAQ,IAIvB,EAAW,GAER,KAAK,UAAU,EAAK,CAMvB,GACJ,EACA,IACa,CACb,GAAI,GAAmB,EACrB,MAAU,MAAM,uBAAuB,CAGzC,IAAM,EAAmB,EAAE,CACvB,EAAS,EAEb,KAAO,EAAS,EAAI,QAAQ,CAC1B,IAAM,EAAO,EAAS,EAAK,CACzB,UAAW,EACX,WAAY,EACb,CAAC,CAEF,GAAI,CAAC,EAAM,MAEX,EAAO,KAAK,EAAK,CACjB,GAAU,EAAK,OAGjB,OAAO,GAOH,GACJ,EACA,EACA,EAAa,EAAE,CACf,EAAO,IAAI,UACC,CAGZ,IAAM,EAAiB,KAAK,IAC1B,EACA,KAAK,OAAO,EAAmB,KAAO,GAAI,CAC3C,CAEK,EAAmB,EAAE,CAErB,GAAQ,EAAyB,IAAsB,CAC3D,GAAI,OAAO,GAAiB,SAAU,CAGpC,IAAM,EAAsB,CAC1B,GAAI,MACJ,KAAM,EACN,MAAO,EACR,CAGD,GAFgB,KAAK,UAAU,EAAU,CAAC,OAAS,KAEpC,EAAkB,CAC/B,EAAQ,KAAK,EAAU,CACvB,OAIF,IAAM,EAAQ,EAAoB,EAAc,EAAe,CAG/D,EAAQ,KAAK,CACX,GAAI,MACJ,KAAM,CAAC,GAAG,EAAa,iBAAiB,CACxC,MAAO,SACR,CAAC,CACF,EAAQ,KAAK,CACX,GAAI,MACJ,KAAM,CAAC,GAAG,EAAa,UAAU,CACjC,MAAO,EAAM,OACd,CAAC,CAEF,IAAK,IAAI,EAAI,EAAG,EAAI,EAAM,OAAQ,IAChC,EAAQ,KAAK,CACX,GAAI,MACJ,KAAM,CAAC,GAAG,EAAa,OAAO,EAAI,EAAE,CAAC,CACrC,MAAO,EAAM,GACd,CAAC,CAGJ,OAGF,GAA6B,OAAO,GAAiB,WAAjD,EAA2D,CAC7D,EAAQ,KAAK,CAAE,GAAI,MAAO,KAAM,EAAa,MAAO,EAAc,CAAC,CACnE,OAGF,GAAI,EAAK,IAAI,EAAuB,CAClC,MAAU,MAAM,gDAAgD,CAKlE,GAFA,EAAK,IAAI,EAAuB,CAE5B,MAAM,QAAQ,EAAa,CAC7B,IAAK,IAAI,EAAI,EAAG,EAAI,EAAa,OAAQ,IACvC,EAAK,EAAa,GAAiB,CAAC,GAAG,EAAa,EAAE,CAAC,MAGzD,IAAK,IAAM,KAAO,OAAO,KAAK,EAAa,CACzC,EAAM,EAA4B,GAAM,CAAC,GAAG,EAAa,EAAI,CAAC,CAIlE,EAAK,OAAO,EAAuB,EAIrC,OADA,EAAK,EAAO,EAAK,CACV,GAMI,GACX,EACA,IACgB,CAChB,GAAI,CAAC,EAAS,EAAM,EAAI,CAAC,MAAM,QAAQ,EAAM,CAC3C,MAAU,MAAM,mCAAmC,CAGrD,GAAI,EAAW,IAEb,MAAU,MAAM,sDAAsD,CAGxE,IAAM,EAAqB,MAAM,QAAQ,EAAM,CAAG,QAAU,SACxD,EAEJ,GAAI,CACF,EAAe,KAAK,UAAU,EAAM,MAC9B,CAEN,MAAU,MAAM,gDAAgD,CAGlE,IAAM,EAAW,EAAY,EAAa,CACpC,EAAa,EAAiB,EAAoB,EAAS,CAE3D,EAAsB,EAAE,CAC1B,EAA0B,CAC5B,cAAe,EACf,MAAO,EACP,MAAO,EACP,WACA,WACA,QAAS,EAAE,CACZ,CAEK,EAAoB,KAAK,UAAU,CACvC,GAAG,EACH,QAAS,EAAE,CACZ,CAAC,CAAC,OAEG,MAAiB,CACjB,EAAa,QAAQ,OAAS,IAChC,EAAO,KAAK,EAAa,CACzB,EAAe,CACb,cAAe,EACf,MAAO,EACP,MAAO,EACP,WACA,WACA,QAAS,EAAE,CACZ,GAIL,IAAK,IAAM,KAAS,EAQlB,GALE,EACA,KAAK,UAAU,EAAa,QAAQ,CAAC,QACpC,EAAa,QAAQ,OAAS,EAAI,GACnC,KAAK,UAAU,EAAM,CAAC,QAEH,EACnB,EAAa,QAAQ,KAAK,EAAM,KAC3B,CASL,GAPI,EAAa,QAAQ,OAAS,GAChC,GAAU,CAIO,EAAoB,KAAK,UAAU,CAAC,EAAM,CAAC,CAAC,OAE9C,EAGf,MAAU,MACR,+FACD,CAGH,EAAa,QAAQ,KAAK,EAAM,CAIpC,GAAU,CAGN,EAAO,SAAW,GACpB,EAAO,KAAK,CACV,cAAe,EACf,MAAO,EACP,MAAO,EACP,WACA,WACA,QAAS,EAAE,CACZ,CAAC,CAIJ,IAAM,EAAc,EAAO,OAO3B,OALA,EAAO,SAAS,EAAO,IAAU,CAC/B,EAAM,MAAQ,EACd,EAAM,MAAQ,GACd,CAEK,GAaI,EACX,GAC2B,CAC3B,IAAM,EAAY,EAAM,WAAa,QAAU,EAAE,CAAG,EAAE,CAGtD,IAAK,IAAM,KAAS,EAAM,QACpB,EAAM,KAAO,OACf,EAAU,EAAM,EAAM,KAAM,EAAM,MAAM,CAM5C,IAAM,EAAuB,GAAmB,CAC9C,GAAqB,OAAO,GAAS,WAAjC,EAA2C,OAAO,EAEtD,GAAI,MAAM,QAAQ,EAAK,CAAE,CACvB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAK,OAAQ,IAC/B,EAAK,GAAK,EAAoB,EAAK,GAAG,CAExC,OAAO,EAIT,GAAK,EAAa,iBAAsB,SAAU,CAChD,IAAM,EAAS,EAAa,QAE5B,GAAI,OAAO,GAAU,UAAY,GAAS,EAExC,OAAO,EAGT,IAAM,EAAkB,EAAE,CACtB,EAAc,GAElB,IAAK,IAAI,EAAI,EAAG,GAAK,EAAO,IAAK,CAC/B,IAAM,EAAS,EAAa,OAAO,EAAE,EAErC,GAAI,OAAO,GAAU,SAAU,CAC7B,EAAc,GACd,MAGF,EAAM,KAAK,EAAM,CAQnB,OAJI,EACK,EAAM,KAAK,GAAG,CAGhB,EAIT,GAAK,EAAa,iBAAsB,QAAS,CAC/C,IAAM,EAAS,EAAa,QAE5B,GAAI,OAAO,GAAU,UAAY,EAAQ,EAEvC,OAAO,EAGT,IAAM,EAAgB,EAAE,CACpB,EAAc,GAElB,IAAK,IAAI,EAAI,EAAG,GAAK,EAAO,IAAK,CAC/B,IAAM,EAAS,EAAa,OAAO,EAAE,EAErC,GAAI,CAAC,MAAM,QAAQ,EAAM,CAAE,CACzB,EAAc,GACd,MAGF,IAAK,IAAI,EAAI,EAAG,EAAI,EAAM,OAAQ,IAChC,EAAO,KAAK,EAAoB,EAAM,GAAG,CAAC,CAS9C,OAJI,EACK,EAGF,EAIT,IAAK,IAAM,KAAO,OAAO,KAAK,EAAK,CACjC,EAAK,GAAO,EAAoB,EAAK,GAAK,CAG5C,OAAO,GAGT,OAAO,EAAoB,EAAK,EAGrB,EAAgB,GAAgD,CAC3E,GAAI,CAAC,GAAU,EAAO,SAAW,EAC/B,MAAU,MAAM,sBAAsB,CAIxC,IAAM,EAAS,CAAC,GAAG,EAAO,CAAC,MAAM,EAAG,IAAM,EAAE,MAAQ,EAAE,MAAM,CACtD,CAAE,WAAU,YAAa,EAAO,GAGtC,IAAK,IAAI,EAAI,EAAG,EAAI,EAAO,OAAQ,IAAK,CACtC,IAAM,EAAQ,EAAO,GAErB,GAAI,EAAM,gBAAkB,EAK1B,MAJA,QAAQ,MAAM,6BAA8B,CAC1C,MAAO,EACP,gBACD,CAAC,CACQ,MAAM,6BAA6B,CAG/C,GAAI,EAAM,WAAa,EAKrB,MAJA,QAAQ,MAAM,4BAA6B,CACzC,MAAO,EACP,WACD,CAAC,CACQ,MAAM,4BAA4B,CAG9C,GAAI,EAAM,WAAa,EAKrB,MAJA,QAAQ,MAAM,wDAAyD,CACrE,MAAO,EACP,WACD,CAAC,CACQ,MAAM,wDAAwD,CAG1E,GAAI,EAAM,QAAU,EAMlB,MALA,QAAQ,MAAM,8CAA+C,CAC3D,MAAO,EACP,MAAO,EAAM,MACb,IACD,CAAC,CACQ,MAAM,8CAA8C,CAMlE,IAAM,EAAY,IAAa,QAAU,EAAE,CAAG,EAAE,CAG1C,EAAc,IAAI,IAKlB,EAAY,GAChB,EAAU,EAAM,EAAM,KAAM,EAAM,MAAM,CAE1C,IAAK,IAAM,KAAS,EAClB,IAAK,IAAM,KAAS,EAAM,QACxB,GAAI,EAAM,KAAO,MACf,EAAS,EAAM,KACV,CACL,IAAM,EAAM,EAAQ,EAAM,KAAK,CACzB,EAAS,EAAY,IAAI,EAAI,EAAI,CACrC,KAAM,EAAM,KACZ,MAAO,EAAM,MACb,SAAU,EAAE,CACb,CAED,GAAI,EAAO,QAAU,EAAM,MACzB,MAAU,MAAM,8CAA8C,CAGhE,EAAO,SAAS,KAAK,EAAM,CAC3B,EAAY,IAAI,EAAK,EAAO,CAMlC,IAAK,GAAM,CAAE,OAAM,QAAO,cAAc,EAAY,QAAQ,CAAE,CAC5D,GAAI,EAAS,SAAW,EACtB,MAAU,MAAM,yDAAyD,CAG3E,EAAS,MAAM,EAAG,IAAM,EAAE,MAAQ,EAAE,MAAM,CAE1C,EAAU,EAAM,EADG,EAAS,IAAK,GAAS,EAAK,MAAM,CAAC,KAAK,GAAG,CAC7B,CAInC,IAAM,EAAuB,GAAmB,CAC9C,GAAqB,OAAO,GAAS,WAAjC,EAA2C,OAAO,EAEtD,GAAI,MAAM,QAAQ,EAAK,CAAE,CACvB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAK,OAAQ,IAC/B,EAAK,GAAK,EAAoB,EAAK,GAAG,CAExC,OAAO,EAIT,GAAK,EAAa,iBAAsB,SAAU,CAChD,IAAM,EAAS,EAAa,QAE5B,GAAI,OAAO,GAAU,UAAY,GAAS,EACxC,MAAU,MAAM,uCAAuC,CAGzD,IAAM,EAAkB,EAAE,CAE1B,IAAK,IAAI,EAAI,EAAG,GAAK,EAAO,IAAK,CAC/B,IAAM,EAAS,EAAa,OAAO,EAAE,EAErC,GAAI,OAAO,GAAU,SACnB,MAAU,MACR,yDACD,CAGH,EAAM,KAAK,EAAM,CAGnB,OAAO,EAAM,KAAK,GAAG,CAIvB,GAAK,EAAa,iBAAsB,QAAS,CAC/C,IAAM,EAAS,EAAa,QAE5B,GAAI,OAAO,GAAU,UAAY,EAAQ,EACvC,MAAU,MAAM,uCAAuC,CAGzD,IAAM,EAAgB,EAAE,CAExB,IAAK,IAAI,EAAI,EAAG,GAAK,EAAO,IAAK,CAC/B,IAAM,EAAS,EAAa,OAAO,EAAE,EAErC,GAAI,CAAC,MAAM,QAAQ,EAAM,CACvB,MAAU,MACR,yDACD,CAGH,IAAK,IAAI,EAAI,EAAG,EAAI,EAAM,OAAQ,IAChC,EAAO,KAAK,EAAoB,EAAM,GAAG,CAAC,CAI9C,OAAO,EAIT,IAAK,IAAM,KAAO,OAAO,KAAK,EAAK,CACjC,EAAK,GAAO,EAAoB,EAAK,GAAK,CAG5C,OAAO,GAGH,EAAa,EAAoB,EAAK,CAG5C,IAAK,IAAI,EAAI,EAAG,EAAI,EAAO,OAAQ,IAAK,CACtC,IAAM,EAAQ,EAAO,GAErB,GAAI,EAAM,QAAU,EAAO,OACzB,MAAU,MACR,uDAAuD,EAAO,OAAO,cAAc,EAAE,aAAa,EAAM,QACzG,CAIL,OAAO"}
+{"version":3,"file":"chunkJSON.mjs","names":[],"sources":["../../../src/utils/chunkJSON.ts"],"sourcesContent":["/**\n * Split & reassemble JSON by character budget.\n * - Measures serialized size using JSON.stringify(..).length (characters).\n * - Ensures each chunk is itself valid JSON.\n * - Very large strings are split into safe pieces using getChunk and re-concatenated on assemble.\n * - Protects against circular structures (JSON can't serialize those anyway).\n */\n\nimport { getChunk } from './getChunk';\n\ntype JSONPrimitive = string | number | boolean | null;\ntype JSONValue = JSONPrimitive | JSONObject | JSONArray;\n\nexport type JSONObject = {\n  [k: string]: JSONValue;\n};\n\ntype JSONArray = JSONValue[];\n\ntype Path = Array<string | number>;\n\ntype SetPatch = { op: 'set'; path: Path; value: JSONValue };\ntype StrAppendPatch = {\n  op: 'str-append';\n  path: Path;\n  value: string; // part of a longer string\n  index: number;\n  total: number;\n};\ntype Patch = SetPatch | StrAppendPatch;\n\ntype RootType = 'object' | 'array';\n\nexport type JsonChunk = {\n  schemaVersion: 1;\n  index: number;\n  total: number;\n  rootType: RootType;\n  checksum: string; // hash of the full original JSON string\n  entries: Patch[];\n};\n\nconst isObject = (val: unknown): val is Record<string, unknown> => {\n  return typeof val === 'object' && val !== null && !Array.isArray(val);\n};\n\nconst computeDjb2 = (str: string): string => {\n  // Simple 32-bit hash; deterministic & fast\n  let hash = 5381;\n\n  for (let i = 0; i < str.length; i++) {\n    hash = ((hash << 5) + hash) ^ str.charCodeAt(i);\n  }\n\n  // convert to unsigned hex\n  return (hash >>> 0).toString(16).padStart(8, '0');\n};\n\nconst setAtPath = (root: any, path: Path, value: JSONValue) => {\n  let current = root;\n\n  for (let i = 0; i < path.length - 1; i++) {\n    const key = path[i];\n    const nextKey = path[i + 1];\n    const isNextIndex = typeof nextKey === 'number';\n\n    if (typeof key === 'number') {\n      if (!Array.isArray(current)) {\n        throw new Error(`Expected array at path segment ${i}`);\n      }\n\n      if (current[key] === undefined) {\n        current[key] = isNextIndex ? [] : {};\n      }\n\n      current = current[key];\n    } else {\n      if (!isObject(current)) {\n        throw new Error(`Expected object at path segment ${i}`);\n      }\n\n      if (!(key in current)) {\n        (current as any)[key] = isNextIndex ? [] : {};\n      }\n\n      current = (current as any)[key];\n    }\n  }\n\n  const last = path[path.length - 1];\n\n  if (typeof last === 'number') {\n    if (!Array.isArray(current)) {\n      throw new Error(`Expected array at final segment`);\n    }\n\n    current[last] = value as any;\n  } else {\n    if (!isObject(current)) {\n      throw new Error(`Expected object at final segment`);\n    }\n\n    (current as any)[last] = value as any;\n  }\n};\n\nconst pathKey = (path: Path): string => {\n  // stable key for grouping string parts\n  return JSON.stringify(path);\n};\n\n/**\n * Split a string into parts using getChunk with a charLength budget per part.\n */\nconst splitStringByBudget = (\n  str: string,\n  maxCharsPerPart: number\n): string[] => {\n  if (maxCharsPerPart <= 0) {\n    throw new Error('maxChars must be > 0');\n  }\n\n  const output: string[] = [];\n  let offset = 0;\n\n  while (offset < str.length) {\n    const part = getChunk(str, {\n      charStart: offset,\n      charLength: maxCharsPerPart,\n    });\n\n    if (!part) break;\n\n    output.push(part);\n    offset += part.length;\n  }\n\n  return output;\n};\n\n/**\n * Flatten JSON into patches (leaf writes). Strings too large to fit in a single\n * chunk are yielded as multiple str-append patches.\n */\nconst flattenToPatches = (\n  value: JSONValue,\n  maxCharsPerChunk: number,\n  path: Path = [],\n  seen = new WeakSet<object>()\n): Patch[] => {\n  // Conservative per-entry cap so a single entry fits into an empty chunk with envelope overhead.\n  // (Envelope ~ a few hundred chars; we keep a comfortable margin.)\n  const maxStringPiece = Math.max(\n    1,\n    Math.floor((maxCharsPerChunk - 400) * 0.8)\n  );\n\n  const patches: Patch[] = [];\n\n  const walk = (currentValue: JSONValue, currentPath: Path) => {\n    if (typeof currentValue === 'string') {\n      // If the serialized patch wouldn't fit, split the string into multiple parts\n      // and encode as a split-node sentinel with numbered keys.\n      const testPatch: SetPatch = {\n        op: 'set',\n        path: currentPath,\n        value: currentValue,\n      };\n      const testLen = JSON.stringify(testPatch).length + 150; // margin\n\n      if (testLen <= maxCharsPerChunk) {\n        patches.push(testPatch);\n        return;\n      }\n\n      // Use getChunk-based splitting to produce stable parts\n      const parts = splitStringByBudget(currentValue, maxStringPiece);\n\n      // Emit split-node metadata and parts as individual leaf writes\n      patches.push({\n        op: 'set',\n        path: [...currentPath, '__splittedType'],\n        value: 'string',\n      });\n      patches.push({\n        op: 'set',\n        path: [...currentPath, '__total'],\n        value: parts.length,\n      });\n\n      for (let i = 0; i < parts.length; i++) {\n        patches.push({\n          op: 'set',\n          path: [...currentPath, String(i + 1)],\n          value: parts[i],\n        });\n      }\n\n      return;\n    }\n\n    if (currentValue === null || typeof currentValue !== 'object') {\n      patches.push({ op: 'set', path: currentPath, value: currentValue });\n      return;\n    }\n\n    if (seen.has(currentValue as object)) {\n      throw new Error('Cannot serialize circular structures to JSON.');\n    }\n\n    seen.add(currentValue as object);\n\n    if (Array.isArray(currentValue)) {\n      for (let i = 0; i < currentValue.length; i++) {\n        walk(currentValue[i] as JSONValue, [...currentPath, i]);\n      }\n    } else {\n      for (const key of Object.keys(currentValue)) {\n        walk((currentValue as JSONObject)[key], [...currentPath, key]);\n      }\n    }\n\n    seen.delete(currentValue as object);\n  };\n\n  walk(value, path);\n  return patches;\n};\n\n/**\n * Split JSON into chunks constrained by character count of serialized chunk.\n */\nexport const chunkJSON = (\n  value: JSONObject | JSONArray,\n  maxChars: number\n): JsonChunk[] => {\n  if (!isObject(value) && !Array.isArray(value)) {\n    throw new Error('Root must be an object or array.');\n  }\n\n  if (maxChars < 500) {\n    // You can lower this if you truly need; recommended to keep some envelope headroom.\n    throw new Error('maxChars is too small. Use at least 500 characters.');\n  }\n\n  const rootType: RootType = Array.isArray(value) ? 'array' : 'object';\n  let sourceString: string;\n\n  try {\n    sourceString = JSON.stringify(value);\n  } catch {\n    // Provide a deterministic error message for circular refs\n    throw new Error('Cannot serialize circular structures to JSON.');\n  }\n\n  const checksum = computeDjb2(sourceString);\n  const allPatches = flattenToPatches(value as JSONValue, maxChars);\n\n  const chunks: JsonChunk[] = [];\n  let currentChunk: JsonChunk = {\n    schemaVersion: 1,\n    index: 0, // provisional\n    total: 0, // provisional\n    rootType,\n    checksum,\n    entries: [],\n  };\n\n  const emptyEnvelopeSize = JSON.stringify({\n    ...currentChunk,\n    entries: [],\n  }).length;\n\n  const tryFlush = () => {\n    if (currentChunk.entries.length > 0) {\n      chunks.push(currentChunk);\n      currentChunk = {\n        schemaVersion: 1,\n        index: 0,\n        total: 0,\n        rootType,\n        checksum,\n        entries: [],\n      };\n    }\n  };\n\n  for (const patch of allPatches) {\n    // Would adding this patch exceed maxChars?\n    const withPatchSize =\n      emptyEnvelopeSize +\n      JSON.stringify(currentChunk.entries).length + // current entries array\n      (currentChunk.entries.length ? 1 : 0) + // possible comma\n      JSON.stringify(patch).length;\n\n    if (withPatchSize <= maxChars) {\n      currentChunk.entries.push(patch);\n    } else {\n      // Start a new chunk if current has items\n      if (currentChunk.entries.length > 0) {\n        tryFlush();\n      }\n\n      // Ensure single patch fits into an empty chunk\n      const singleSize = emptyEnvelopeSize + JSON.stringify([patch]).length;\n\n      if (singleSize > maxChars) {\n        // This should only happen for massive strings, which we pre-split;\n        // if it happens for a non-string, we cannot split further.\n        throw new Error(\n          'A single entry exceeds maxChars and cannot be split. Reduce entry size or increase maxChars.'\n        );\n      }\n\n      currentChunk.entries.push(patch);\n    }\n  }\n\n  tryFlush();\n\n  // Ensure at least one chunk exists (even for empty root)\n  if (chunks.length === 0) {\n    chunks.push({\n      schemaVersion: 1,\n      index: 0,\n      total: 0, // provisional\n      rootType,\n      checksum,\n      entries: [],\n    });\n  }\n\n  // Finalize indices & totals\n  const totalChunks = chunks.length;\n\n  chunks.forEach((chunk, index) => {\n    chunk.index = index;\n    chunk.total = totalChunks;\n  });\n\n  return chunks;\n};\n\n/**\n * Reassemble JSON from chunks.\n * - Validates checksums and indices.\n * - Applies 'set' patches and merges string pieces from 'str-append'.\n */\n/**\n * Reconstruct content from a single chunk without validation.\n * Useful for processing individual chunks in a pipeline where you don't have all chunks yet.\n * Note: This will only reconstruct the partial content contained in this chunk.\n */\nexport const reconstructFromSingleChunk = (\n  chunk: JsonChunk\n): JSONObject | JSONArray => {\n  const root: any = chunk.rootType === 'array' ? [] : {};\n\n  // Apply all 'set' patches from this chunk\n  for (const entry of chunk.entries) {\n    if (entry.op === 'set') {\n      setAtPath(root, entry.path, entry.value);\n    }\n  }\n\n  // Reconcile split-node sentinels for strings/arrays\n  // When reconstructing from a single chunk, we may have incomplete split nodes\n  const reconcileSplitNodes = (node: any): any => {\n    if (node === null || typeof node !== 'object') return node;\n\n    if (Array.isArray(node)) {\n      for (let i = 0; i < node.length; i++) {\n        node[i] = reconcileSplitNodes(node[i]);\n      }\n      return node;\n    }\n\n    // string split-node\n    if ((node as any)['__splittedType'] === 'string') {\n      const total = (node as any)['__total'];\n\n      if (typeof total !== 'number' || total <= 0) {\n        // Invalid split node, return as-is\n        return node;\n      }\n\n      const parts: string[] = [];\n      let hasAllParts = true;\n\n      for (let i = 1; i <= total; i++) {\n        const piece = (node as any)[String(i)];\n\n        if (typeof piece !== 'string') {\n          hasAllParts = false;\n          break;\n        }\n\n        parts.push(piece);\n      }\n\n      // Only reconstruct if we have all parts, otherwise return the node as-is\n      if (hasAllParts) {\n        return parts.join('');\n      }\n\n      return node;\n    }\n\n    // array split-node (optional support)\n    if ((node as any)['__splittedType'] === 'array') {\n      const total = (node as any)['__total'];\n\n      if (typeof total !== 'number' || total < 0) {\n        // Invalid split node, return as-is\n        return node;\n      }\n\n      const output: any[] = [];\n      let hasAllParts = true;\n\n      for (let i = 1; i <= total; i++) {\n        const slice = (node as any)[String(i)];\n\n        if (!Array.isArray(slice)) {\n          hasAllParts = false;\n          break;\n        }\n\n        for (let j = 0; j < slice.length; j++) {\n          output.push(reconcileSplitNodes(slice[j]));\n        }\n      }\n\n      // Only reconstruct if we have all parts\n      if (hasAllParts) {\n        return output;\n      }\n\n      return node;\n    }\n\n    // walk normal object\n    for (const key of Object.keys(node)) {\n      node[key] = reconcileSplitNodes(node[key]);\n    }\n\n    return node;\n  };\n\n  return reconcileSplitNodes(root);\n};\n\nexport const assembleJSON = (chunks: JsonChunk[]): JSONObject | JSONArray => {\n  if (!chunks || chunks.length === 0) {\n    throw new Error('No chunks provided.');\n  }\n\n  // Basic validation & sort\n  const sorted = [...chunks].sort((a, b) => a.index - b.index);\n  const { checksum, rootType } = sorted[0];\n  const schemaVersion = 1;\n\n  for (let i = 0; i < sorted.length; i++) {\n    const chunk = sorted[i];\n\n    if (chunk.schemaVersion !== schemaVersion) {\n      console.error('Unsupported schemaVersion.', {\n        cause: chunk,\n        schemaVersion,\n      });\n      throw new Error('Unsupported schemaVersion.');\n    }\n\n    if (chunk.rootType !== rootType) {\n      console.error('Chunks rootType mismatch.', {\n        cause: chunk,\n        rootType,\n      });\n      throw new Error('Chunks rootType mismatch.');\n    }\n\n    if (chunk.checksum !== checksum) {\n      console.error('Chunks checksum mismatch (different source objects?).', {\n        cause: chunk,\n        checksum,\n      });\n      throw new Error('Chunks checksum mismatch (different source objects?).');\n    }\n\n    if (chunk.index !== i) {\n      console.error('Chunk indices are not contiguous or sorted.', {\n        cause: chunk,\n        index: chunk.index,\n        i,\n      });\n      throw new Error('Chunk indices are not contiguous or sorted.');\n    }\n\n    // Defer total check until after reconstruction to prefer more specific errors\n  }\n\n  const root: any = rootType === 'array' ? [] : {};\n\n  // Collect string parts by path\n  const stringParts = new Map<\n    string,\n    { path: Path; total: number; received: StrAppendPatch[] }\n  >();\n\n  const applySet = (patch: SetPatch) =>\n    setAtPath(root, patch.path, patch.value);\n\n  for (const chunk of sorted) {\n    for (const entry of chunk.entries) {\n      if (entry.op === 'set') {\n        applySet(entry);\n      } else {\n        const key = pathKey(entry.path);\n        const record = stringParts.get(key) ?? {\n          path: entry.path,\n          total: entry.total,\n          received: [],\n        };\n\n        if (record.total !== entry.total) {\n          throw new Error('Inconsistent string part totals for a path.');\n        }\n\n        record.received.push(entry);\n        stringParts.set(key, record);\n      }\n    }\n  }\n\n  // Stitch strings\n  for (const { path, total, received } of stringParts.values()) {\n    if (received.length !== total) {\n      throw new Error('Missing string parts for a path; incomplete chunk set.');\n    }\n\n    received.sort((a, b) => a.index - b.index);\n    const fullString = received.map((part) => part.value).join('');\n    setAtPath(root, path, fullString);\n  }\n\n  // Reconcile split-node sentinels for strings/arrays after all patches applied\n  const reconcileSplitNodes = (node: any): any => {\n    if (node === null || typeof node !== 'object') return node;\n\n    if (Array.isArray(node)) {\n      for (let i = 0; i < node.length; i++) {\n        node[i] = reconcileSplitNodes(node[i]);\n      }\n      return node;\n    }\n\n    // string split-node\n    if ((node as any)['__splittedType'] === 'string') {\n      const total = (node as any)['__total'];\n\n      if (typeof total !== 'number' || total <= 0) {\n        throw new Error('Invalid split-node total for a path.');\n      }\n\n      const parts: string[] = [];\n\n      for (let i = 1; i <= total; i++) {\n        const piece = (node as any)[String(i)];\n\n        if (typeof piece !== 'string') {\n          throw new Error(\n            'Missing string parts for a path; incomplete chunk set.'\n          );\n        }\n\n        parts.push(piece);\n      }\n\n      return parts.join('');\n    }\n\n    // array split-node (optional support)\n    if ((node as any)['__splittedType'] === 'array') {\n      const total = (node as any)['__total'];\n\n      if (typeof total !== 'number' || total < 0) {\n        throw new Error('Invalid split-node total for a path.');\n      }\n\n      const output: any[] = [];\n\n      for (let i = 1; i <= total; i++) {\n        const slice = (node as any)[String(i)];\n\n        if (!Array.isArray(slice)) {\n          throw new Error(\n            'Missing string parts for a path; incomplete chunk set.'\n          );\n        }\n\n        for (let j = 0; j < slice.length; j++) {\n          output.push(reconcileSplitNodes(slice[j]));\n        }\n      }\n\n      return output;\n    }\n\n    // walk normal object\n    for (const key of Object.keys(node)) {\n      node[key] = reconcileSplitNodes(node[key]);\n    }\n\n    return node;\n  };\n\n  const reconciled = reconcileSplitNodes(root);\n\n  // Now validate totals match provided count\n  for (let i = 0; i < sorted.length; i++) {\n    const chunk = sorted[i];\n\n    if (chunk.total !== sorted.length) {\n      throw new Error(\n        `Chunk total does not match provided count. Expected ${sorted.length}, but chunk ${i} has total=${chunk.total}`\n      );\n    }\n  }\n\n  return reconciled;\n};\n\n/* -------------------------------------------\n * Example usage\n * -------------------------------------------\nconst big: JSONObject = {\n  title: \"Document\",\n  content: \"…a very very long text…\",\n  items: Array.from({ length: 2000 }, (_, i) => ({ id: i, label: `Item ${i}` }))\n};\n\n// Split to ~16k-char chunks\nconst chunks = chunkJSON(big, 16_000);\n\n// Send each `chunks[i]` as JSON to your backend.\n// Later, reassemble:\nconst restored = assembleJSON(chunks);\nconsole.log(JSON.stringify(restored) === JSON.stringify(big)); // true\n*/\n"],"mappings":";;;;;;;;;;AA0CA,MAAM,YAAY,QAAiD;AACjE,QAAO,OAAO,QAAQ,YAAY,QAAQ,QAAQ,CAAC,MAAM,QAAQ,IAAI;;AAGvE,MAAM,eAAe,QAAwB;CAE3C,IAAI,OAAO;AAEX,MAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,IAC9B,SAAS,QAAQ,KAAK,OAAQ,IAAI,WAAW,EAAE;AAIjD,SAAQ,SAAS,GAAG,SAAS,GAAG,CAAC,SAAS,GAAG,IAAI;;AAGnD,MAAM,aAAa,MAAW,MAAY,UAAqB;CAC7D,IAAI,UAAU;AAEd,MAAK,IAAI,IAAI,GAAG,IAAI,KAAK,SAAS,GAAG,KAAK;EACxC,MAAM,MAAM,KAAK;EAEjB,MAAM,cAAc,OADJ,KAAK,IAAI,OACc;AAEvC,MAAI,OAAO,QAAQ,UAAU;AAC3B,OAAI,CAAC,MAAM,QAAQ,QAAQ,CACzB,OAAM,IAAI,MAAM,kCAAkC,IAAI;AAGxD,OAAI,QAAQ,SAAS,OACnB,SAAQ,OAAO,cAAc,EAAE,GAAG,EAAE;AAGtC,aAAU,QAAQ;SACb;AACL,OAAI,CAAC,SAAS,QAAQ,CACpB,OAAM,IAAI,MAAM,mCAAmC,IAAI;AAGzD,OAAI,EAAE,OAAO,SACX,CAAC,QAAgB,OAAO,cAAc,EAAE,GAAG,EAAE;AAG/C,aAAW,QAAgB;;;CAI/B,MAAM,OAAO,KAAK,KAAK,SAAS;AAEhC,KAAI,OAAO,SAAS,UAAU;AAC5B,MAAI,CAAC,MAAM,QAAQ,QAAQ,CACzB,OAAM,IAAI,MAAM,kCAAkC;AAGpD,UAAQ,QAAQ;QACX;AACL,MAAI,CAAC,SAAS,QAAQ,CACpB,OAAM,IAAI,MAAM,mCAAmC;AAGrD,EAAC,QAAgB,QAAQ;;;AAI7B,MAAM,WAAW,SAAuB;AAEtC,QAAO,KAAK,UAAU,KAAK;;;;;AAM7B,MAAM,uBACJ,KACA,oBACa;AACb,KAAI,mBAAmB,EACrB,OAAM,IAAI,MAAM,uBAAuB;CAGzC,MAAM,SAAmB,EAAE;CAC3B,IAAI,SAAS;AAEb,QAAO,SAAS,IAAI,QAAQ;EAC1B,MAAM,OAAO,SAAS,KAAK;GACzB,WAAW;GACX,YAAY;GACb,CAAC;AAEF,MAAI,CAAC,KAAM;AAEX,SAAO,KAAK,KAAK;AACjB,YAAU,KAAK;;AAGjB,QAAO;;;;;;AAOT,MAAM,oBACJ,OACA,kBACA,OAAa,EAAE,EACf,uBAAO,IAAI,SAAiB,KAChB;CAGZ,MAAM,iBAAiB,KAAK,IAC1B,GACA,KAAK,OAAO,mBAAmB,OAAO,GAAI,CAC3C;CAED,MAAM,UAAmB,EAAE;CAE3B,MAAM,QAAQ,cAAyB,gBAAsB;AAC3D,MAAI,OAAO,iBAAiB,UAAU;GAGpC,MAAM,YAAsB;IAC1B,IAAI;IACJ,MAAM;IACN,OAAO;IACR;AAGD,OAFgB,KAAK,UAAU,UAAU,CAAC,SAAS,OAEpC,kBAAkB;AAC/B,YAAQ,KAAK,UAAU;AACvB;;GAIF,MAAM,QAAQ,oBAAoB,cAAc,eAAe;AAG/D,WAAQ,KAAK;IACX,IAAI;IACJ,MAAM,CAAC,GAAG,aAAa,iBAAiB;IACxC,OAAO;IACR,CAAC;AACF,WAAQ,KAAK;IACX,IAAI;IACJ,MAAM,CAAC,GAAG,aAAa,UAAU;IACjC,OAAO,MAAM;IACd,CAAC;AAEF,QAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,IAChC,SAAQ,KAAK;IACX,IAAI;IACJ,MAAM,CAAC,GAAG,aAAa,OAAO,IAAI,EAAE,CAAC;IACrC,OAAO,MAAM;IACd,CAAC;AAGJ;;AAGF,MAAI,iBAAiB,QAAQ,OAAO,iBAAiB,UAAU;AAC7D,WAAQ,KAAK;IAAE,IAAI;IAAO,MAAM;IAAa,OAAO;IAAc,CAAC;AACnE;;AAGF,MAAI,KAAK,IAAI,aAAuB,CAClC,OAAM,IAAI,MAAM,gDAAgD;AAGlE,OAAK,IAAI,aAAuB;AAEhC,MAAI,MAAM,QAAQ,aAAa,CAC7B,MAAK,IAAI,IAAI,GAAG,IAAI,aAAa,QAAQ,IACvC,MAAK,aAAa,IAAiB,CAAC,GAAG,aAAa,EAAE,CAAC;MAGzD,MAAK,MAAM,OAAO,OAAO,KAAK,aAAa,CACzC,MAAM,aAA4B,MAAM,CAAC,GAAG,aAAa,IAAI,CAAC;AAIlE,OAAK,OAAO,aAAuB;;AAGrC,MAAK,OAAO,KAAK;AACjB,QAAO;;;;;AAMT,MAAa,aACX,OACA,aACgB;AAChB,KAAI,CAAC,SAAS,MAAM,IAAI,CAAC,MAAM,QAAQ,MAAM,CAC3C,OAAM,IAAI,MAAM,mCAAmC;AAGrD,KAAI,WAAW,IAEb,OAAM,IAAI,MAAM,sDAAsD;CAGxE,MAAM,WAAqB,MAAM,QAAQ,MAAM,GAAG,UAAU;CAC5D,IAAI;AAEJ,KAAI;AACF,iBAAe,KAAK,UAAU,MAAM;SAC9B;AAEN,QAAM,IAAI,MAAM,gDAAgD;;CAGlE,MAAM,WAAW,YAAY,aAAa;CAC1C,MAAM,aAAa,iBAAiB,OAAoB,SAAS;CAEjE,MAAM,SAAsB,EAAE;CAC9B,IAAI,eAA0B;EAC5B,eAAe;EACf,OAAO;EACP,OAAO;EACP;EACA;EACA,SAAS,EAAE;EACZ;CAED,MAAM,oBAAoB,KAAK,UAAU;EACvC,GAAG;EACH,SAAS,EAAE;EACZ,CAAC,CAAC;CAEH,MAAM,iBAAiB;AACrB,MAAI,aAAa,QAAQ,SAAS,GAAG;AACnC,UAAO,KAAK,aAAa;AACzB,kBAAe;IACb,eAAe;IACf,OAAO;IACP,OAAO;IACP;IACA;IACA,SAAS,EAAE;IACZ;;;AAIL,MAAK,MAAM,SAAS,WAQlB,KALE,oBACA,KAAK,UAAU,aAAa,QAAQ,CAAC,UACpC,aAAa,QAAQ,SAAS,IAAI,KACnC,KAAK,UAAU,MAAM,CAAC,UAEH,SACnB,cAAa,QAAQ,KAAK,MAAM;MAC3B;AAEL,MAAI,aAAa,QAAQ,SAAS,EAChC,WAAU;AAMZ,MAFmB,oBAAoB,KAAK,UAAU,CAAC,MAAM,CAAC,CAAC,SAE9C,SAGf,OAAM,IAAI,MACR,+FACD;AAGH,eAAa,QAAQ,KAAK,MAAM;;AAIpC,WAAU;AAGV,KAAI,OAAO,WAAW,EACpB,QAAO,KAAK;EACV,eAAe;EACf,OAAO;EACP,OAAO;EACP;EACA;EACA,SAAS,EAAE;EACZ,CAAC;CAIJ,MAAM,cAAc,OAAO;AAE3B,QAAO,SAAS,OAAO,UAAU;AAC/B,QAAM,QAAQ;AACd,QAAM,QAAQ;GACd;AAEF,QAAO;;;;;;;;;;;;AAaT,MAAa,8BACX,UAC2B;CAC3B,MAAM,OAAY,MAAM,aAAa,UAAU,EAAE,GAAG,EAAE;AAGtD,MAAK,MAAM,SAAS,MAAM,QACxB,KAAI,MAAM,OAAO,MACf,WAAU,MAAM,MAAM,MAAM,MAAM,MAAM;CAM5C,MAAM,uBAAuB,SAAmB;AAC9C,MAAI,SAAS,QAAQ,OAAO,SAAS,SAAU,QAAO;AAEtD,MAAI,MAAM,QAAQ,KAAK,EAAE;AACvB,QAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,IAC/B,MAAK,KAAK,oBAAoB,KAAK,GAAG;AAExC,UAAO;;AAIT,MAAK,KAAa,sBAAsB,UAAU;GAChD,MAAM,QAAS,KAAa;AAE5B,OAAI,OAAO,UAAU,YAAY,SAAS,EAExC,QAAO;GAGT,MAAM,QAAkB,EAAE;GAC1B,IAAI,cAAc;AAElB,QAAK,IAAI,IAAI,GAAG,KAAK,OAAO,KAAK;IAC/B,MAAM,QAAS,KAAa,OAAO,EAAE;AAErC,QAAI,OAAO,UAAU,UAAU;AAC7B,mBAAc;AACd;;AAGF,UAAM,KAAK,MAAM;;AAInB,OAAI,YACF,QAAO,MAAM,KAAK,GAAG;AAGvB,UAAO;;AAIT,MAAK,KAAa,sBAAsB,SAAS;GAC/C,MAAM,QAAS,KAAa;AAE5B,OAAI,OAAO,UAAU,YAAY,QAAQ,EAEvC,QAAO;GAGT,MAAM,SAAgB,EAAE;GACxB,IAAI,cAAc;AAElB,QAAK,IAAI,IAAI,GAAG,KAAK,OAAO,KAAK;IAC/B,MAAM,QAAS,KAAa,OAAO,EAAE;AAErC,QAAI,CAAC,MAAM,QAAQ,MAAM,EAAE;AACzB,mBAAc;AACd;;AAGF,SAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,IAChC,QAAO,KAAK,oBAAoB,MAAM,GAAG,CAAC;;AAK9C,OAAI,YACF,QAAO;AAGT,UAAO;;AAIT,OAAK,MAAM,OAAO,OAAO,KAAK,KAAK,CACjC,MAAK,OAAO,oBAAoB,KAAK,KAAK;AAG5C,SAAO;;AAGT,QAAO,oBAAoB,KAAK;;AAGlC,MAAa,gBAAgB,WAAgD;AAC3E,KAAI,CAAC,UAAU,OAAO,WAAW,EAC/B,OAAM,IAAI,MAAM,sBAAsB;CAIxC,MAAM,SAAS,CAAC,GAAG,OAAO,CAAC,MAAM,GAAG,MAAM,EAAE,QAAQ,EAAE,MAAM;CAC5D,MAAM,EAAE,UAAU,aAAa,OAAO;CACtC,MAAM,gBAAgB;AAEtB,MAAK,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;EACtC,MAAM,QAAQ,OAAO;AAErB,MAAI,MAAM,kBAAkB,eAAe;AACzC,WAAQ,MAAM,8BAA8B;IAC1C,OAAO;IACP;IACD,CAAC;AACF,SAAM,IAAI,MAAM,6BAA6B;;AAG/C,MAAI,MAAM,aAAa,UAAU;AAC/B,WAAQ,MAAM,6BAA6B;IACzC,OAAO;IACP;IACD,CAAC;AACF,SAAM,IAAI,MAAM,4BAA4B;;AAG9C,MAAI,MAAM,aAAa,UAAU;AAC/B,WAAQ,MAAM,yDAAyD;IACrE,OAAO;IACP;IACD,CAAC;AACF,SAAM,IAAI,MAAM,wDAAwD;;AAG1E,MAAI,MAAM,UAAU,GAAG;AACrB,WAAQ,MAAM,+CAA+C;IAC3D,OAAO;IACP,OAAO,MAAM;IACb;IACD,CAAC;AACF,SAAM,IAAI,MAAM,8CAA8C;;;CAMlE,MAAM,OAAY,aAAa,UAAU,EAAE,GAAG,EAAE;CAGhD,MAAM,8BAAc,IAAI,KAGrB;CAEH,MAAM,YAAY,UAChB,UAAU,MAAM,MAAM,MAAM,MAAM,MAAM;AAE1C,MAAK,MAAM,SAAS,OAClB,MAAK,MAAM,SAAS,MAAM,QACxB,KAAI,MAAM,OAAO,MACf,UAAS,MAAM;MACV;EACL,MAAM,MAAM,QAAQ,MAAM,KAAK;EAC/B,MAAM,SAAS,YAAY,IAAI,IAAI,IAAI;GACrC,MAAM,MAAM;GACZ,OAAO,MAAM;GACb,UAAU,EAAE;GACb;AAED,MAAI,OAAO,UAAU,MAAM,MACzB,OAAM,IAAI,MAAM,8CAA8C;AAGhE,SAAO,SAAS,KAAK,MAAM;AAC3B,cAAY,IAAI,KAAK,OAAO;;AAMlC,MAAK,MAAM,EAAE,MAAM,OAAO,cAAc,YAAY,QAAQ,EAAE;AAC5D,MAAI,SAAS,WAAW,MACtB,OAAM,IAAI,MAAM,yDAAyD;AAG3E,WAAS,MAAM,GAAG,MAAM,EAAE,QAAQ,EAAE,MAAM;AAE1C,YAAU,MAAM,MADG,SAAS,KAAK,SAAS,KAAK,MAAM,CAAC,KAAK,GAAG,CAC7B;;CAInC,MAAM,uBAAuB,SAAmB;AAC9C,MAAI,SAAS,QAAQ,OAAO,SAAS,SAAU,QAAO;AAEtD,MAAI,MAAM,QAAQ,KAAK,EAAE;AACvB,QAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,IAC/B,MAAK,KAAK,oBAAoB,KAAK,GAAG;AAExC,UAAO;;AAIT,MAAK,KAAa,sBAAsB,UAAU;GAChD,MAAM,QAAS,KAAa;AAE5B,OAAI,OAAO,UAAU,YAAY,SAAS,EACxC,OAAM,IAAI,MAAM,uCAAuC;GAGzD,MAAM,QAAkB,EAAE;AAE1B,QAAK,IAAI,IAAI,GAAG,KAAK,OAAO,KAAK;IAC/B,MAAM,QAAS,KAAa,OAAO,EAAE;AAErC,QAAI,OAAO,UAAU,SACnB,OAAM,IAAI,MACR,yDACD;AAGH,UAAM,KAAK,MAAM;;AAGnB,UAAO,MAAM,KAAK,GAAG;;AAIvB,MAAK,KAAa,sBAAsB,SAAS;GAC/C,MAAM,QAAS,KAAa;AAE5B,OAAI,OAAO,UAAU,YAAY,QAAQ,EACvC,OAAM,IAAI,MAAM,uCAAuC;GAGzD,MAAM,SAAgB,EAAE;AAExB,QAAK,IAAI,IAAI,GAAG,KAAK,OAAO,KAAK;IAC/B,MAAM,QAAS,KAAa,OAAO,EAAE;AAErC,QAAI,CAAC,MAAM,QAAQ,MAAM,CACvB,OAAM,IAAI,MACR,yDACD;AAGH,SAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,IAChC,QAAO,KAAK,oBAAoB,MAAM,GAAG,CAAC;;AAI9C,UAAO;;AAIT,OAAK,MAAM,OAAO,OAAO,KAAK,KAAK,CACjC,MAAK,OAAO,oBAAoB,KAAK,KAAK;AAG5C,SAAO;;CAGT,MAAM,aAAa,oBAAoB,KAAK;AAG5C,MAAK,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;EACtC,MAAM,QAAQ,OAAO;AAErB,MAAI,MAAM,UAAU,OAAO,OACzB,OAAM,IAAI,MACR,uDAAuD,OAAO,OAAO,cAAc,EAAE,aAAa,MAAM,QACzG;;AAIL,QAAO"}

package/dist/esm/utils/formatter.mjs

@@ -1,2 +1,14 @@
-import{relative as e}from"node:path";import{colorize as t,colorizePath as n}from"@intlayer/config/logger";import*as r from"@intlayer/config/colors";import i from"@intlayer/config/built";import{getLocaleName as a}from"@intlayer/core/localization";import{ENGLISH as o}from"@intlayer/types/locales";const s=(t,r)=>[t].flat().map(t=>t.startsWith(`/`)?e(i.system.baseDir,t):t).map(e=>r===!1?e:n(e,r)).join(`, `),c=(e,n=r.GREEN)=>[e].flat().map(e=>`${a(e,o)} (${e})`).map(e=>n===!1?e:t(e,n)).join(`, `);export{c as formatLocale,s as formatPath};
+import { relative } from "node:path";
+import { colorize, colorizePath } from "@intlayer/config/logger";
+import * as ANSIColors from "@intlayer/config/colors";
+import configuration from "@intlayer/config/built";
+import { getLocaleName } from "@intlayer/core/localization";
+import { ENGLISH } from "@intlayer/types/locales";
+
+//#region src/utils/formatter.ts
+const formatPath = (path, color) => [path].flat().map((path) => path.startsWith("/") ? relative(configuration.system.baseDir, path) : path).map((relativePath) => color === false ? relativePath : colorizePath(relativePath, color)).join(`, `);
+const formatLocale = (locale, color = ANSIColors.GREEN) => [locale].flat().map((locale) => `${getLocaleName(locale, ENGLISH)} (${locale})`).map((text) => color === false ? text : colorize(text, color)).join(`, `);
+
+//#endregion
+export { formatLocale, formatPath };
 //# sourceMappingURL=formatter.mjs.map

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

@@ -1 +1 @@
-{"version":3,"file":"formatter.mjs","names":[],"sources":["../../../src/utils/formatter.ts"],"sourcesContent":["import { relative } from 'node:path';\nimport configuration from '@intlayer/config/built';\nimport * as ANSIColors from '@intlayer/config/colors';\nimport { colorize, colorizePath } from '@intlayer/config/logger';\nimport { getLocaleName } from '@intlayer/core/localization';\nimport { ENGLISH } from '@intlayer/types/locales';\nimport type { LocalesValues } from '@intlayer/types/module_augmentation';\n\nexport const formatPath = (\n  path: string | string[],\n  color?: ANSIColors | false\n) =>\n  [path]\n    .flat()\n    .map((path) =>\n      path.startsWith('/') ? relative(configuration.system.baseDir, path) : path\n    )\n    .map((relativePath) =>\n      color === false ? relativePath : colorizePath(relativePath, color)\n    )\n    .join(`, `);\n\nexport const formatLocale = (\n  locale: LocalesValues | LocalesValues[],\n  color: ANSIColors | false = ANSIColors.GREEN\n) =>\n  [locale]\n    .flat()\n    .map((locale) => `${getLocaleName(locale, ENGLISH)} (${locale})`)\n    .map((text) => (color === false ? text : colorize(text, color)))\n    .join(`, `);\n"],"mappings":"wSAQA,MAAa,GACX,EACA,IAEA,CAAC,EAAK,CACH,MAAM,CACN,IAAK,GACJ,EAAK,WAAW,IAAI,CAAG,EAAS,EAAc,OAAO,QAAS,EAAK,CAAG,EACvE,CACA,IAAK,GACJ,IAAU,GAAQ,EAAe,EAAa,EAAc,EAAM,CACnE,CACA,KAAK,KAAK,CAEF,GACX,EACA,EAA4B,EAAW,QAEvC,CAAC,EAAO,CACL,MAAM,CACN,IAAK,GAAW,GAAG,EAAc,EAAQ,EAAQ,CAAC,IAAI,EAAO,GAAG,CAChE,IAAK,GAAU,IAAU,GAAQ,EAAO,EAAS,EAAM,EAAM,CAAE,CAC/D,KAAK,KAAK"}
+{"version":3,"file":"formatter.mjs","names":[],"sources":["../../../src/utils/formatter.ts"],"sourcesContent":["import { relative } from 'node:path';\nimport configuration from '@intlayer/config/built';\nimport * as ANSIColors from '@intlayer/config/colors';\nimport { colorize, colorizePath } from '@intlayer/config/logger';\nimport { getLocaleName } from '@intlayer/core/localization';\nimport { ENGLISH } from '@intlayer/types/locales';\nimport type { LocalesValues } from '@intlayer/types/module_augmentation';\n\nexport const formatPath = (\n  path: string | string[],\n  color?: ANSIColors | false\n) =>\n  [path]\n    .flat()\n    .map((path) =>\n      path.startsWith('/') ? relative(configuration.system.baseDir, path) : path\n    )\n    .map((relativePath) =>\n      color === false ? relativePath : colorizePath(relativePath, color)\n    )\n    .join(`, `);\n\nexport const formatLocale = (\n  locale: LocalesValues | LocalesValues[],\n  color: ANSIColors | false = ANSIColors.GREEN\n) =>\n  [locale]\n    .flat()\n    .map((locale) => `${getLocaleName(locale, ENGLISH)} (${locale})`)\n    .map((text) => (color === false ? text : colorize(text, color)))\n    .join(`, `);\n"],"mappings":";;;;;;;;AAQA,MAAa,cACX,MACA,UAEA,CAAC,KAAK,CACH,MAAM,CACN,KAAK,SACJ,KAAK,WAAW,IAAI,GAAG,SAAS,cAAc,OAAO,SAAS,KAAK,GAAG,KACvE,CACA,KAAK,iBACJ,UAAU,QAAQ,eAAe,aAAa,cAAc,MAAM,CACnE,CACA,KAAK,KAAK;AAEf,MAAa,gBACX,QACA,QAA4B,WAAW,UAEvC,CAAC,OAAO,CACL,MAAM,CACN,KAAK,WAAW,GAAG,cAAc,QAAQ,QAAQ,CAAC,IAAI,OAAO,GAAG,CAChE,KAAK,SAAU,UAAU,QAAQ,OAAO,SAAS,MAAM,MAAM,CAAE,CAC/D,KAAK,KAAK"}