@intlayer/engine 9.5.12 → 9.7.0

package/dist/esm/listProjects.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"listProjects.mjs","names":[],"sources":["../../src/listProjects.ts"],"sourcesContent":["import { dirname } from 'node:path';\nimport { configurationFilesCandidates } from '@intlayer/config/node';\nimport fg from 'fast-glob';\nimport simpleGit from 'simple-git';\n\nexport type ListProjectsOptions = {\n  /**\n   * Base directory to search from\n   * @default process.cwd()\n   */\n  baseDir?: string;\n  /**\n   * If true, search from the git root directory instead of baseDir\n   * @default false\n   */\n  gitRoot?: boolean;\n};\n\n/**\n * Returns the git repository root directory, or `null` when the given\n * directory is not inside a git repository.\n */\nexport const getGitRootDir = async (cwd?: string): Promise<string | null> => {\n  try {\n    const git = cwd ? simpleGit(cwd) : simpleGit();\n    const rootDir = await git.revparse(['--show-toplevel']);\n    return rootDir.trim();\n  } catch (_error) {\n    return null;\n  }\n};\n\n/**\n * List all Intlayer projects by searching for configuration files\n *\n * @param options - Options for listing projects\n * @returns Array of absolute paths to project directories containing Intlayer config\n */\nexport const listProjects = async (\n  options?: ListProjectsOptions\n): Promise<{ searchDir: string; projectsPath: string[] }> => {\n  let searchDir = options?.baseDir ?? process.cwd();\n\n  // If gitRoot option is enabled, try to get the git root directory\n  if (options?.gitRoot) {\n    const gitRootDir = await getGitRootDir(searchDir);\n    if (gitRootDir) {\n      searchDir = gitRootDir;\n    }\n  }\n\n  // Build glob patterns for all config file candidates\n  const configPatterns = configurationFilesCandidates.map(\n    (fileName) => `**/${fileName}`\n  );\n\n  // Search for all config files\n  const configFiles = await fg(configPatterns, {\n    cwd: searchDir,\n    absolute: true,\n    ignore: ['**/node_modules/**', '**/.git/**'],\n    dot: true, // Include dot files like .intlayerrc\n  });\n\n  // Extract unique directory paths from config files\n  const projectDirs = [...new Set(configFiles.map((file) => dirname(file)))];\n\n  // Sort alphabetically for consistent output\n  return { searchDir, projectsPath: projectDirs.sort() };\n};\n"],"mappings":";;;;;;;;;;AAsBA,MAAa,gBAAgB,OAAO,QAAyC;CAC3E,IAAI;EAGF,QAAO,OAFK,MAAM,UAAU,GAAG,IAAI,UAAU,EACpB,CAAC,SAAS,CAAC,iBAAiB,CAAC,EACxC,CAAC,KAAK;CACtB,SAAS,QAAQ;EACf,OAAO;CACT;AACF;;;;;;;AAQA,MAAa,eAAe,OAC1B,YAC2D;CAC3D,IAAI,YAAY,SAAS,WAAW,QAAQ,IAAI;CAGhD,IAAI,SAAS,SAAS;EACpB,MAAM,aAAa,MAAM,cAAc,SAAS;EAChD,IAAI,YACF,YAAY;CAEhB;CAGA,MAAM,iBAAiB,6BAA6B,KACjD,aAAa,MAAM,UACtB;CAGA,MAAM,cAAc,MAAM,GAAG,gBAAgB;EAC3C,KAAK;EACL,UAAU;EACV,QAAQ,CAAC,sBAAsB,YAAY;EAC3C,KAAK;CACP,CAAC;CAGD,MAAM,cAAc,CAAC,GAAG,IAAI,IAAI,YAAY,KAAK,SAAS,QAAQ,IAAI,CAAC,CAAC,CAAC;CAGzE,OAAO;EAAE;EAAW,cAAc,YAAY,KAAK;CAAE;AACvD"}
+{"version":3,"file":"listProjects.mjs","names":[],"sources":["../../src/listProjects.ts"],"sourcesContent":["import { dirname } from 'node:path';\nimport { configurationFilesCandidates } from '@intlayer/config/node';\nimport fg from 'fast-glob';\nimport { simpleGit } from 'simple-git';\n\nexport type ListProjectsOptions = {\n  /**\n   * Base directory to search from\n   * @default process.cwd()\n   */\n  baseDir?: string;\n  /**\n   * If true, search from the git root directory instead of baseDir\n   * @default false\n   */\n  gitRoot?: boolean;\n};\n\n/**\n * Returns the git repository root directory, or `null` when the given\n * directory is not inside a git repository.\n */\nexport const getGitRootDir = async (cwd?: string): Promise<string | null> => {\n  try {\n    const git = cwd ? simpleGit(cwd) : simpleGit();\n    const rootDir = await git.revparse(['--show-toplevel']);\n    return rootDir.trim();\n  } catch (_error) {\n    return null;\n  }\n};\n\n/**\n * List all Intlayer projects by searching for configuration files\n *\n * @param options - Options for listing projects\n * @returns Array of absolute paths to project directories containing Intlayer config\n */\nexport const listProjects = async (\n  options?: ListProjectsOptions\n): Promise<{ searchDir: string; projectsPath: string[] }> => {\n  let searchDir = options?.baseDir ?? process.cwd();\n\n  // If gitRoot option is enabled, try to get the git root directory\n  if (options?.gitRoot) {\n    const gitRootDir = await getGitRootDir(searchDir);\n    if (gitRootDir) {\n      searchDir = gitRootDir;\n    }\n  }\n\n  // Build glob patterns for all config file candidates\n  const configPatterns = configurationFilesCandidates.map(\n    (fileName) => `**/${fileName}`\n  );\n\n  // Search for all config files\n  const configFiles = await fg(configPatterns, {\n    cwd: searchDir,\n    absolute: true,\n    ignore: ['**/node_modules/**', '**/.git/**'],\n    dot: true, // Include dot files like .intlayerrc\n  });\n\n  // Extract unique directory paths from config files\n  const projectDirs = [...new Set(configFiles.map((file) => dirname(file)))];\n\n  // Sort alphabetically for consistent output\n  return { searchDir, projectsPath: projectDirs.sort() };\n};\n"],"mappings":";;;;;;;;;;AAsBA,MAAa,gBAAgB,OAAO,QAAyC;CAC3E,IAAI;EAGF,QAAO,OAFK,MAAM,UAAU,GAAG,IAAI,UAAU,EACpB,CAAC,SAAS,CAAC,iBAAiB,CAAC,EACxC,CAAC,KAAK;CACtB,SAAS,QAAQ;EACf,OAAO;CACT;AACF;;;;;;;AAQA,MAAa,eAAe,OAC1B,YAC2D;CAC3D,IAAI,YAAY,SAAS,WAAW,QAAQ,IAAI;CAGhD,IAAI,SAAS,SAAS;EACpB,MAAM,aAAa,MAAM,cAAc,SAAS;EAChD,IAAI,YACF,YAAY;CAEhB;CAGA,MAAM,iBAAiB,6BAA6B,KACjD,aAAa,MAAM,UACtB;CAGA,MAAM,cAAc,MAAM,GAAG,gBAAgB;EAC3C,KAAK;EACL,UAAU;EACV,QAAQ,CAAC,sBAAsB,YAAY;EAC3C,KAAK;CACP,CAAC;CAGD,MAAM,cAAc,CAAC,GAAG,IAAI,IAAI,YAAY,KAAK,SAAS,QAAQ,IAAI,CAAC,CAAC,CAAC;CAGzE,OAAO;EAAE;EAAW,cAAc,YAAY,KAAK;CAAE;AACvD"}

package/dist/esm/loadDictionaries/index.mjs

@@ -1,6 +1,6 @@
 import { ensureIntlayerBundle, formatLocalDictionaries, loadContentDeclaration, loadContentDeclarations } from "./loadContentDeclaration.mjs";
+import { loadLocalDictionaries } from "./loadLocalDictionaries.mjs";
 import { formatDistantDictionaries, loadRemoteDictionaries } from "./loadRemoteDictionaries.mjs";
 import { loadDictionaries } from "./loadDictionaries.mjs";
-import { loadLocalDictionaries } from "./loadLocalDictionaries.mjs";
 
 export { ensureIntlayerBundle, formatDistantDictionaries, formatLocalDictionaries, loadContentDeclaration, loadContentDeclarations, loadDictionaries, loadLocalDictionaries, loadRemoteDictionaries };

package/dist/esm/loadDictionaries/loadDictionaries.mjs

@@ -1,6 +1,6 @@
 import { filterInvalidDictionaries } from "../filterInvalidDictionaries.mjs";
-import { formatDictionaries } from "../formatDictionary.mjs";
 import { loadContentDeclarations } from "./loadContentDeclaration.mjs";
+import { formatDictionaries } from "../formatDictionary.mjs";
 import { loadRemoteDictionaries } from "./loadRemoteDictionaries.mjs";
 import { DictionariesLogger } from "./log.mjs";
 import * as ANSIColors from "@intlayer/config/colors";

package/dist/esm/loadDictionaries/loadRemoteDictionaries.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"loadRemoteDictionaries.mjs","names":[],"sources":["../../../src/loadDictionaries/loadRemoteDictionaries.ts"],"sourcesContent":["// @ts-ignore @intlayer/backend is not build yet\nimport type { DictionaryAPI } from '@intlayer/backend';\nimport { getConfiguration } from '@intlayer/config/node';\nimport { getRemoteDictionaries } from '@intlayer/dictionaries-entry/remote';\nimport type {\n  Dictionary,\n  DictionaryId,\n  DictionaryKey,\n} from '@intlayer/types/dictionary';\nimport { sortAlphabetically } from '../utils/sortAlphabetically';\nimport type { DictionariesStatus } from './loadDictionaries';\n\nexport const formatDistantDictionaries = (\n  dictionaries: (DictionaryAPI | Dictionary)[]\n): Dictionary[] =>\n  dictionaries.map((dict) => ({\n    ...dict,\n    localId: `${dict.key}::remote::${dict.id}`,\n    location: 'remote' as const,\n  }));\n\nexport const loadRemoteDictionaries = async (\n  configuration = getConfiguration(),\n  onStatusUpdate?: (status: DictionariesStatus[]) => void,\n  options?: {\n    onStartRemoteCheck?: () => void;\n    onStopRemoteCheck?: () => void;\n    onError?: (error: Error) => void;\n  }\n): Promise<Dictionary[]> => {\n  const { editor } = configuration;\n  const remoteDictionariesRecord = getRemoteDictionaries(configuration);\n\n  const hasRemoteDictionaries = Boolean(editor.clientId && editor.clientSecret);\n\n  if (!hasRemoteDictionaries) return [];\n\n  try {\n    options?.onStartRemoteCheck?.();\n\n    // Lazy: the CMS client is only needed when remote credentials are set\n    const { createRemoteDictionaryClient, fetchDistantDictionaries } =\n      await import('./remoteDictionaryClient');\n\n    const dictionary = createRemoteDictionaryClient(configuration);\n\n    // Get the list of dictionary keys\n    const getDictionariesKeysResult =\n      await dictionary.getDictionariesUpdateTimestamp();\n\n    const distantDictionaryUpdateTimeStamp: Record<\n      DictionaryId,\n      { key: DictionaryKey; updatedAt: number }\n    > | null = getDictionariesKeysResult.data;\n\n    if (!distantDictionaryUpdateTimeStamp) {\n      throw new Error('No distant dictionaries found');\n    }\n\n    const dictionariesIdToFetch = Object.entries(\n      distantDictionaryUpdateTimeStamp\n    ).filter(([dictionaryId, data]) => {\n      // If remote doesn't provide updatedAt, fetch to be safe\n      if (!data.updatedAt) return true;\n\n      // If no local cache exists, fetch\n      const local: Dictionary | undefined = remoteDictionariesRecord[\n        data.key\n      ]?.find((dictionary) => dictionary.id === dictionaryId);\n      if (!local) return true;\n\n      const localUpdatedAtRaw = (local as any)?.updatedAt as\n        | number\n        | string\n        | undefined;\n\n      const localUpdatedAt =\n        typeof localUpdatedAtRaw === 'number'\n          ? localUpdatedAtRaw\n          : localUpdatedAtRaw\n            ? new Date(localUpdatedAtRaw).getTime()\n            : undefined;\n\n      // If local timestamp missing or older than remote, fetch\n      if (typeof localUpdatedAt !== 'number') return true;\n\n      return data.updatedAt > localUpdatedAt;\n    });\n\n    const flatRemoteDictionariesRecord: DictionaryAPI[] = Object.values(\n      remoteDictionariesRecord\n    ).flat();\n\n    const cachedDictionaries: Dictionary[] =\n      flatRemoteDictionariesRecord.filter((dictionary) => {\n        const remoteUpdatedAt = dictionary.id\n          ? distantDictionaryUpdateTimeStamp[dictionary.id]?.updatedAt\n          : undefined;\n\n        const localUpdatedAtRaw = dictionary.updatedAt;\n\n        const localUpdatedAt =\n          typeof localUpdatedAtRaw === 'number'\n            ? localUpdatedAtRaw\n            : localUpdatedAtRaw\n              ? new Date(localUpdatedAtRaw).getTime()\n              : undefined;\n\n        // Consider as cached/imported when local exists and is up-to-date or newer\n        return (\n          typeof localUpdatedAt === 'number' &&\n          typeof remoteUpdatedAt === 'number' &&\n          localUpdatedAt >= remoteUpdatedAt\n        );\n      });\n\n    // Report cached as already imported\n    if (cachedDictionaries.length > 0) {\n      onStatusUpdate?.(\n        cachedDictionaries.map((dictionary) => ({\n          dictionaryKey: dictionary.key,\n          type: 'remote',\n          status: 'imported',\n        }))\n      );\n    }\n\n    // Several qualified dictionaries can share a key, so keys are deduplicated:\n    // one request per key already returns all of its siblings.\n    const orderedDistantDictionaryKeys = [\n      ...new Set(dictionariesIdToFetch.map(([, data]) => data.key)),\n    ].sort(sortAlphabetically);\n\n    // Report pending for keys to be fetched so totals are visible immediately\n    if (orderedDistantDictionaryKeys.length > 0) {\n      onStatusUpdate?.(\n        orderedDistantDictionaryKeys.map((key) => ({\n          dictionaryKey: key,\n          type: 'remote',\n          status: 'pending',\n        }))\n      );\n    }\n\n    const distantDictionariesData = await fetchDistantDictionaries(\n      {\n        dictionaryKeys: orderedDistantDictionaryKeys,\n      },\n      onStatusUpdate\n    );\n\n    const distantDictionaries: Dictionary[] = formatDistantDictionaries(\n      distantDictionariesData\n    );\n\n    // Fetching by key also returns the up-to-date siblings of a stale\n    // dictionary, so drop the cached copies the remote just sent back.\n    const fetchedDictionaryIds = new Set(\n      distantDictionaries.map((dictionary) => dictionary.id)\n    );\n\n    const notRefetchedCachedDictionaries = cachedDictionaries.filter(\n      (dictionary) => !fetchedDictionaryIds.has(dictionary.id)\n    );\n\n    return [...notRefetchedCachedDictionaries, ...distantDictionaries];\n  } catch (error) {\n    options?.onError?.(error as Error);\n    return [];\n  } finally {\n    options?.onStopRemoteCheck?.();\n  }\n};\n"],"mappings":";;;;;AAYA,MAAa,6BACX,iBAEA,aAAa,KAAK,UAAU;CAC1B,GAAG;CACH,SAAS,GAAG,KAAK,IAAI,YAAY,KAAK;CACtC,UAAU;AACZ,EAAE;AAEJ,MAAa,yBAAyB,OACpC,gBAAgB,iBAAiB,GACjC,gBACA,YAK0B;CAC1B,MAAM,EAAE,WAAW;CACnB,MAAM,2BAA2B,sBAAsB,aAAa;CAIpE,IAAI,CAF0B,QAAQ,OAAO,YAAY,OAAO,YAEvC,GAAG,OAAO,CAAC;CAEpC,IAAI;EACF,SAAS,qBAAqB;EAG9B,MAAM,EAAE,8BAA8B,6BACpC,MAAM,OAAO;EAQf,MAAM,oCAGK,MATQ,6BAA6B,aAI/B,CAAC,CAAC,+BAA+B,EAKd,CAAC;EAErC,IAAI,CAAC,kCACH,MAAM,IAAI,MAAM,+BAA+B;EAGjD,MAAM,wBAAwB,OAAO,QACnC,gCACF,CAAC,CAAC,QAAQ,CAAC,cAAc,UAAU;GAEjC,IAAI,CAAC,KAAK,WAAW,OAAO;GAG5B,MAAM,QAAgC,yBACpC,KAAK,IACN,EAAE,MAAM,eAAe,WAAW,OAAO,YAAY;GACtD,IAAI,CAAC,OAAO,OAAO;GAEnB,MAAM,oBAAqB,OAAe;GAK1C,MAAM,iBACJ,OAAO,sBAAsB,WACzB,oBACA,oBACE,IAAI,KAAK,iBAAiB,CAAC,CAAC,QAAQ,IACpC;GAGR,IAAI,OAAO,mBAAmB,UAAU,OAAO;GAE/C,OAAO,KAAK,YAAY;EAC1B,CAAC;EAMD,MAAM,qBAJgD,OAAO,OAC3D,wBACF,CAAC,CAAC,KAG2B,CAAC,CAAC,QAAQ,eAAe;GAClD,MAAM,kBAAkB,WAAW,KAC/B,iCAAiC,WAAW,GAAG,EAAE,YACjD;GAEJ,MAAM,oBAAoB,WAAW;GAErC,MAAM,iBACJ,OAAO,sBAAsB,WACzB,oBACA,oBACE,IAAI,KAAK,iBAAiB,CAAC,CAAC,QAAQ,IACpC;GAGR,OACE,OAAO,mBAAmB,YAC1B,OAAO,oBAAoB,YAC3B,kBAAkB;EAEtB,CAAC;EAGH,IAAI,mBAAmB,SAAS,GAC9B,iBACE,mBAAmB,KAAK,gBAAgB;GACtC,eAAe,WAAW;GAC1B,MAAM;GACN,QAAQ;EACV,EAAE,CACJ;EAKF,MAAM,+BAA+B,CACnC,GAAG,IAAI,IAAI,sBAAsB,KAAK,GAAG,UAAU,KAAK,GAAG,CAAC,CAC9D,CAAC,CAAC,KAAK,kBAAkB;EAGzB,IAAI,6BAA6B,SAAS,GACxC,iBACE,6BAA6B,KAAK,SAAS;GACzC,eAAe;GACf,MAAM;GACN,QAAQ;EACV,EAAE,CACJ;EAGF,MAAM,0BAA0B,MAAM,yBACpC,EACE,gBAAgB,6BAClB,GACA,cACF;EAEA,MAAM,sBAAoC,0BACxC,uBACF;EAIA,MAAM,uBAAuB,IAAI,IAC/B,oBAAoB,KAAK,eAAe,WAAW,EAAE,CACvD;EAMA,OAAO,CAAC,GAJ+B,mBAAmB,QACvD,eAAe,CAAC,qBAAqB,IAAI,WAAW,EAAE,CAGjB,GAAG,GAAG,mBAAmB;CACnE,SAAS,OAAO;EACd,SAAS,UAAU,KAAc;EACjC,OAAO,CAAC;CACV,UAAU;EACR,SAAS,oBAAoB;CAC/B;AACF"}
+{"version":3,"file":"loadRemoteDictionaries.mjs","names":[],"sources":["../../../src/loadDictionaries/loadRemoteDictionaries.ts"],"sourcesContent":["import type { DictionaryAPI } from '@intlayer/api';\nimport { getConfiguration } from '@intlayer/config/node';\nimport { getRemoteDictionaries } from '@intlayer/dictionaries-entry/remote';\nimport type {\n  Dictionary,\n  DictionaryId,\n  DictionaryKey,\n} from '@intlayer/types/dictionary';\nimport { sortAlphabetically } from '../utils/sortAlphabetically';\nimport type { DictionariesStatus } from './loadDictionaries';\n\nexport const formatDistantDictionaries = (\n  dictionaries: (DictionaryAPI | Dictionary)[]\n): Dictionary[] =>\n  dictionaries.map((dict) => ({\n    ...dict,\n    localId: `${dict.key}::remote::${dict.id}`,\n    location: 'remote' as const,\n  }));\n\nexport const loadRemoteDictionaries = async (\n  configuration = getConfiguration(),\n  onStatusUpdate?: (status: DictionariesStatus[]) => void,\n  options?: {\n    onStartRemoteCheck?: () => void;\n    onStopRemoteCheck?: () => void;\n    onError?: (error: Error) => void;\n  }\n): Promise<Dictionary[]> => {\n  const { editor } = configuration;\n  const remoteDictionariesRecord = getRemoteDictionaries(configuration);\n\n  const hasRemoteDictionaries = Boolean(editor.clientId && editor.clientSecret);\n\n  if (!hasRemoteDictionaries) return [];\n\n  try {\n    options?.onStartRemoteCheck?.();\n\n    // Lazy: the CMS client is only needed when remote credentials are set\n    const { createRemoteDictionaryClient, fetchDistantDictionaries } =\n      await import('./remoteDictionaryClient');\n\n    const dictionary = createRemoteDictionaryClient(configuration);\n\n    // Get the list of dictionary keys\n    const getDictionariesKeysResult =\n      await dictionary.getDictionariesUpdateTimestamp();\n\n    const distantDictionaryUpdateTimeStamp: Record<\n      DictionaryId,\n      { key: DictionaryKey; updatedAt: number }\n    > | null = getDictionariesKeysResult.data;\n\n    if (!distantDictionaryUpdateTimeStamp) {\n      throw new Error('No distant dictionaries found');\n    }\n\n    const dictionariesIdToFetch = Object.entries(\n      distantDictionaryUpdateTimeStamp\n    ).filter(([dictionaryId, data]) => {\n      // If remote doesn't provide updatedAt, fetch to be safe\n      if (!data.updatedAt) return true;\n\n      // If no local cache exists, fetch\n      const local: Dictionary | undefined = remoteDictionariesRecord[\n        data.key\n      ]?.find((dictionary) => dictionary.id === dictionaryId);\n      if (!local) return true;\n\n      const localUpdatedAtRaw = (local as any)?.updatedAt as\n        | number\n        | string\n        | undefined;\n\n      const localUpdatedAt =\n        typeof localUpdatedAtRaw === 'number'\n          ? localUpdatedAtRaw\n          : localUpdatedAtRaw\n            ? new Date(localUpdatedAtRaw).getTime()\n            : undefined;\n\n      // If local timestamp missing or older than remote, fetch\n      if (typeof localUpdatedAt !== 'number') return true;\n\n      return data.updatedAt > localUpdatedAt;\n    });\n\n    const flatRemoteDictionariesRecord: DictionaryAPI[] = Object.values(\n      remoteDictionariesRecord\n    ).flat();\n\n    const cachedDictionaries: Dictionary[] =\n      flatRemoteDictionariesRecord.filter((dictionary) => {\n        const remoteUpdatedAt = dictionary.id\n          ? distantDictionaryUpdateTimeStamp[dictionary.id]?.updatedAt\n          : undefined;\n\n        const localUpdatedAtRaw = dictionary.updatedAt;\n\n        const localUpdatedAt =\n          typeof localUpdatedAtRaw === 'number'\n            ? localUpdatedAtRaw\n            : localUpdatedAtRaw\n              ? new Date(localUpdatedAtRaw).getTime()\n              : undefined;\n\n        // Consider as cached/imported when local exists and is up-to-date or newer\n        return (\n          typeof localUpdatedAt === 'number' &&\n          typeof remoteUpdatedAt === 'number' &&\n          localUpdatedAt >= remoteUpdatedAt\n        );\n      });\n\n    // Report cached as already imported\n    if (cachedDictionaries.length > 0) {\n      onStatusUpdate?.(\n        cachedDictionaries.map((dictionary) => ({\n          dictionaryKey: dictionary.key,\n          type: 'remote',\n          status: 'imported',\n        }))\n      );\n    }\n\n    // Several qualified dictionaries can share a key, so keys are deduplicated:\n    // one request per key already returns all of its siblings.\n    const orderedDistantDictionaryKeys = [\n      ...new Set(dictionariesIdToFetch.map(([, data]) => data.key)),\n    ].sort(sortAlphabetically);\n\n    // Report pending for keys to be fetched so totals are visible immediately\n    if (orderedDistantDictionaryKeys.length > 0) {\n      onStatusUpdate?.(\n        orderedDistantDictionaryKeys.map((key) => ({\n          dictionaryKey: key,\n          type: 'remote',\n          status: 'pending',\n        }))\n      );\n    }\n\n    const distantDictionariesData = await fetchDistantDictionaries(\n      {\n        dictionaryKeys: orderedDistantDictionaryKeys,\n      },\n      onStatusUpdate\n    );\n\n    const distantDictionaries: Dictionary[] = formatDistantDictionaries(\n      distantDictionariesData\n    );\n\n    // Fetching by key also returns the up-to-date siblings of a stale\n    // dictionary, so drop the cached copies the remote just sent back.\n    const fetchedDictionaryIds = new Set(\n      distantDictionaries.map((dictionary) => dictionary.id)\n    );\n\n    const notRefetchedCachedDictionaries = cachedDictionaries.filter(\n      (dictionary) => !fetchedDictionaryIds.has(dictionary.id)\n    );\n\n    return [...notRefetchedCachedDictionaries, ...distantDictionaries];\n  } catch (error) {\n    options?.onError?.(error as Error);\n    return [];\n  } finally {\n    options?.onStopRemoteCheck?.();\n  }\n};\n"],"mappings":";;;;;AAWA,MAAa,6BACX,iBAEA,aAAa,KAAK,UAAU;CAC1B,GAAG;CACH,SAAS,GAAG,KAAK,IAAI,YAAY,KAAK;CACtC,UAAU;AACZ,EAAE;AAEJ,MAAa,yBAAyB,OACpC,gBAAgB,iBAAiB,GACjC,gBACA,YAK0B;CAC1B,MAAM,EAAE,WAAW;CACnB,MAAM,2BAA2B,sBAAsB,aAAa;CAIpE,IAAI,CAF0B,QAAQ,OAAO,YAAY,OAAO,YAEvC,GAAG,OAAO,CAAC;CAEpC,IAAI;EACF,SAAS,qBAAqB;EAG9B,MAAM,EAAE,8BAA8B,6BACpC,MAAM,OAAO;EAQf,MAAM,oCAGK,MATQ,6BAA6B,aAI/B,CAAC,CAAC,+BAA+B,EAKd,CAAC;EAErC,IAAI,CAAC,kCACH,MAAM,IAAI,MAAM,+BAA+B;EAGjD,MAAM,wBAAwB,OAAO,QACnC,gCACF,CAAC,CAAC,QAAQ,CAAC,cAAc,UAAU;GAEjC,IAAI,CAAC,KAAK,WAAW,OAAO;GAG5B,MAAM,QAAgC,yBACpC,KAAK,IACN,EAAE,MAAM,eAAe,WAAW,OAAO,YAAY;GACtD,IAAI,CAAC,OAAO,OAAO;GAEnB,MAAM,oBAAqB,OAAe;GAK1C,MAAM,iBACJ,OAAO,sBAAsB,WACzB,oBACA,oBACE,IAAI,KAAK,iBAAiB,CAAC,CAAC,QAAQ,IACpC;GAGR,IAAI,OAAO,mBAAmB,UAAU,OAAO;GAE/C,OAAO,KAAK,YAAY;EAC1B,CAAC;EAMD,MAAM,qBAJgD,OAAO,OAC3D,wBACF,CAAC,CAAC,KAG2B,CAAC,CAAC,QAAQ,eAAe;GAClD,MAAM,kBAAkB,WAAW,KAC/B,iCAAiC,WAAW,GAAG,EAAE,YACjD;GAEJ,MAAM,oBAAoB,WAAW;GAErC,MAAM,iBACJ,OAAO,sBAAsB,WACzB,oBACA,oBACE,IAAI,KAAK,iBAAiB,CAAC,CAAC,QAAQ,IACpC;GAGR,OACE,OAAO,mBAAmB,YAC1B,OAAO,oBAAoB,YAC3B,kBAAkB;EAEtB,CAAC;EAGH,IAAI,mBAAmB,SAAS,GAC9B,iBACE,mBAAmB,KAAK,gBAAgB;GACtC,eAAe,WAAW;GAC1B,MAAM;GACN,QAAQ;EACV,EAAE,CACJ;EAKF,MAAM,+BAA+B,CACnC,GAAG,IAAI,IAAI,sBAAsB,KAAK,GAAG,UAAU,KAAK,GAAG,CAAC,CAC9D,CAAC,CAAC,KAAK,kBAAkB;EAGzB,IAAI,6BAA6B,SAAS,GACxC,iBACE,6BAA6B,KAAK,SAAS;GACzC,eAAe;GACf,MAAM;GACN,QAAQ;EACV,EAAE,CACJ;EAGF,MAAM,0BAA0B,MAAM,yBACpC,EACE,gBAAgB,6BAClB,GACA,cACF;EAEA,MAAM,sBAAoC,0BACxC,uBACF;EAIA,MAAM,uBAAuB,IAAI,IAC/B,oBAAoB,KAAK,eAAe,WAAW,EAAE,CACvD;EAMA,OAAO,CAAC,GAJ+B,mBAAmB,QACvD,eAAe,CAAC,qBAAqB,IAAI,WAAW,EAAE,CAGjB,GAAG,GAAG,mBAAmB;CACnE,SAAS,OAAO;EACd,SAAS,UAAU,KAAc;EACjC,OAAO,CAAC;CACV,UAAU;EACR,SAAS,oBAAoB;CAC/B;AACF"}

package/dist/esm/utils/buildComponentFilesList.mjs

@@ -1,4 +1,5 @@
-import { isAbsolute, relative, resolve, sep } from "node:path";
+import { isDirectoryExcluded } from "./isDirectoryExcluded.mjs";
+import { isAbsolute, relative, resolve } from "node:path";
 import { TRAVERSE_PATTERN } from "@intlayer/config/defaultValues";
 import { normalizePath } from "@intlayer/config/utils";
 import fg from "fast-glob";
@@ -9,27 +10,24 @@ import fg from "fast-glob";
 */
 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']
+* Remove directories nested in others so files are never scanned twice.
+* A nested directory is kept as its own root when the exclude patterns would
+* drop it from its parent's scan (e.g. `<root>/dist` under `**\/dist/**`).
+*
+* Example: ['/root', '/root/src', '/root/dist'] → ['/root', '/root/dist']
 */
-const getDistinctRootDirs = (dirs) => {
+const getDistinctRootDirs = (dirs, excludePatterns) => {
 	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 !== "";
+			const relativePath = relative(parent, dir);
+			return relativePath !== "" && !relativePath.startsWith("..") && !isAbsolute(relativePath) && !isDirectoryExcluded(relativePath, excludePatterns);
 		})) acc.push(dir);
 		return acc;
 	}, []);
 };
 /**
-* Returns true when the resolved path passes through a `node_modules` segment.
-* Works on both POSIX and Windows paths.
-*/
-const isInsideNodeModules = (dir) => resolve(dir).split(sep).includes("node_modules");
-/**
 * Default exclude patterns derived from TRAVERSE_PATTERN.
 * Extracted once so the function body can reference them without re-computing.
 */
@@ -41,18 +39,18 @@ const DEFAULT_EXCLUDE_PATTERNS = TRAVERSE_PATTERN.filter((p) => typeof p === "st
 * patterns, negation patterns embedded in `traversePattern`, and optional
 * dot-file inclusion.
 *
-* Special case: `codeDir` entries that live inside `node_modules` (e.g. a
-* design-system package installed as a workspace dependency) are scanned as
-* their own explicit roots. They are NOT collapsed into the project root so
-* the `*\/node_modules\/**` exclusion does not silently drop them.
+* `codeDir` entries are more precise than the exclude patterns: a `codeDir`
+* inside an excluded directory (e.g. a design-system `dist` or a package in
+* `node_modules`) is scanned as its own root, so the exclusion only applies
+* below it.
 *
 * @example
 * // Single root with excludes
 * const files = buildComponentFilesList(config);
 *
 * @example
-* // Design-system package inside node_modules is still scanned
-* // intlayer.config.ts: { content: { codeDir: ['node_modules/my-ds/src'] } }
+* // Design-system build output is still scanned
+* // intlayer.config.ts: { content: { codeDir: ['node_modules/my-ds/dist'] } }
 * const files = buildComponentFilesList(config);
 */
 const buildComponentFilesList = (config, excludePattern) => {
@@ -67,23 +65,13 @@ const buildComponentFilesList = (config, excludePattern) => {
 		...excludePattern ?? [],
 		...contentDeclarationPattern
 	])).filter((pattern) => typeof pattern === "string").map(normalizePath);
-	const resolvedCodeDirs = (config.content.codeDir ?? []).map((dir) => resolve(dir));
-	const inNodeModulesCodeDirs = resolvedCodeDirs.filter(isInsideNodeModules);
-	const normalCodeDirs = resolvedCodeDirs.filter((dir) => !isInsideNodeModules(dir));
-	const normalFiles = getDistinctRootDirs([config.system.baseDir, ...normalCodeDirs]).flatMap((root) => fg.sync(patterns, {
+	const roots = getDistinctRootDirs([config.system.baseDir, ...config.content.codeDir ?? []], baseExcludePatterns);
+	return Array.from(new Set(roots.flatMap((root) => fg.sync(patterns, {
 		cwd: root,
 		ignore: baseExcludePatterns,
 		absolute: true,
 		dot: true
-	}));
-	const nodeModulesExcludePatterns = baseExcludePatterns.filter((pattern) => !pattern.includes("node_modules"));
-	const nodeModulesFiles = inNodeModulesCodeDirs.flatMap((dir) => fg.sync(patterns, {
-		cwd: dir,
-		ignore: nodeModulesExcludePatterns,
-		absolute: true,
-		dot: false
-	}));
-	return Array.from(/* @__PURE__ */ new Set([...normalFiles, ...nodeModulesFiles]));
+	}))));
 };
 
 //#endregion

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

@@ -1 +1 @@
-{"version":3,"file":"buildComponentFilesList.mjs","names":[],"sources":["../../../src/utils/buildComponentFilesList.ts"],"sourcesContent":["import { isAbsolute, relative, resolve, sep } from 'node:path';\nimport { TRAVERSE_PATTERN } from '@intlayer/config/defaultValues';\nimport { normalizePath } from '@intlayer/config/utils';\nimport type { IntlayerConfig } from '@intlayer/types/config';\nimport fg from 'fast-glob';\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\n      return !rel.startsWith('..') && !isAbsolute(rel) && rel !== '';\n    });\n    if (!isNested) acc.push(dir);\n\n    return acc;\n  }, []);\n};\n\n/**\n * Returns true when the resolved path passes through a `node_modules` segment.\n * Works on both POSIX and Windows paths.\n */\nconst isInsideNodeModules = (dir: string): boolean =>\n  resolve(dir).split(sep).includes('node_modules');\n\n/**\n * Default exclude patterns derived from TRAVERSE_PATTERN.\n * Extracted once so the function body can reference them without re-computing.\n */\nconst DEFAULT_EXCLUDE_PATTERNS: string[] = TRAVERSE_PATTERN.filter(\n  (p): p is string => typeof p === 'string' && p.startsWith('!')\n).map((p) => p.slice(1));\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 `traversePattern`, and optional\n * dot-file inclusion.\n *\n * Special case: `codeDir` entries that live inside `node_modules` (e.g. a\n * design-system package installed as a workspace dependency) are scanned as\n * their own explicit roots. They are NOT collapsed into the project root so\n * the `*\\/node_modules\\/**` exclusion does not silently drop them.\n *\n * @example\n * // Single root with excludes\n * const files = buildComponentFilesList(config);\n *\n * @example\n * // Design-system package inside node_modules is still scanned\n * // intlayer.config.ts: { content: { codeDir: ['node_modules/my-ds/src'] } }\n * const files = buildComponentFilesList(config);\n */\nexport const buildComponentFilesList = (\n  config: IntlayerConfig,\n  excludePattern?: string[]\n): string[] => {\n  const traversePattern = config.build.traversePattern;\n  const compilerTransformPattern = config.compiler.transformPattern;\n  const contentDeclarationPattern = config.content.fileExtensions.map(\n    (ext) => `/**/*${ext}`\n  );\n\n  const patterns = [\n    ...traversePattern,\n    ...normalizeToArray(compilerTransformPattern),\n  ]\n    .filter((pattern) => typeof pattern === 'string')\n    .filter((pattern) => !pattern.startsWith('!'))\n    .map(normalizePath);\n\n  // User-supplied negations from traversePattern\n  const userExcludes = traversePattern\n    .filter(\n      (pattern): pattern is string =>\n        typeof pattern === 'string' && pattern.startsWith('!')\n    )\n    .map((pattern) => pattern.slice(1));\n\n  // Full exclude list: defaults (from TRAVERSE_PATTERN) + user overrides + caller extras + content files.\n  // DEFAULT_EXCLUDE_PATTERNS acts as a safety floor — if the user provides a\n  // partial traversePattern that omits some defaults, they are still applied.\n  const baseExcludePatterns = Array.from(\n    new Set([\n      ...DEFAULT_EXCLUDE_PATTERNS,\n      ...userExcludes,\n      ...(excludePattern ?? []),\n      ...contentDeclarationPattern,\n    ])\n  )\n    .filter((pattern): pattern is string => typeof pattern === 'string')\n    .map(normalizePath);\n\n  // Separate codeDir entries that live inside node_modules.\n  // getDistinctRootDirs would collapse them into the project root, after which\n  // the **/node_modules/** ignore would silently exclude them.\n  const resolvedCodeDirs = (config.content.codeDir ?? []).map((dir) =>\n    resolve(dir)\n  );\n  const inNodeModulesCodeDirs = resolvedCodeDirs.filter(isInsideNodeModules);\n  const normalCodeDirs = resolvedCodeDirs.filter(\n    (dir) => !isInsideNodeModules(dir)\n  );\n\n  // Normal roots: project base + regular codeDir entries, deduplicated.\n  const normalRoots = getDistinctRootDirs([\n    config.system.baseDir,\n    ...normalCodeDirs,\n  ]);\n\n  const normalFiles = normalRoots.flatMap((root) =>\n    fg.sync(patterns, {\n      cwd: root,\n      ignore: baseExcludePatterns,\n      absolute: true,\n      dot: true, // needed for .intlayer and similar\n    })\n  );\n\n  // node_modules codeDir roots: scanned directly from the package root.\n  // **/node_modules/** is removed from the ignore list so it doesn't block\n  // the scan (it is still applied inside the package for nested node_modules).\n  const nodeModulesExcludePatterns = baseExcludePatterns.filter(\n    (pattern) => !pattern.includes('node_modules')\n  );\n\n  const nodeModulesFiles = inNodeModulesCodeDirs.flatMap((dir) =>\n    fg.sync(patterns, {\n      cwd: dir,\n      ignore: nodeModulesExcludePatterns,\n      absolute: true,\n      dot: false,\n    })\n  );\n\n  return Array.from(new Set([...normalFiles, ...nodeModulesFiles]));\n};\n"],"mappings":";;;;;;;;;AASA,MAAM,oBAAuB,UAC3B,MAAM,QAAQ,KAAK,IAAI,QAAQ,CAAC,KAAK;;;;;;AAOvC,MAAM,uBAAuB,SAA6B;CACxD,MAAM,aAAa,MAAM,KAAK,IAAI,IAAI,KAAK,KAAK,QAAQ,QAAQ,GAAG,CAAC,CAAC,CAAC;CACtE,WAAW,MAAM,GAAG,MAAM,EAAE,SAAS,EAAE,MAAM;CAE7C,OAAO,WAAW,QAAQ,KAAe,QAAQ;EAM/C,IAAI,CALa,IAAI,MAAM,WAAW;GACpC,MAAM,MAAM,SAAS,QAAQ,GAAG;GAEhC,OAAO,CAAC,IAAI,WAAW,IAAI,KAAK,CAAC,WAAW,GAAG,KAAK,QAAQ;EAC9D,CACY,GAAG,IAAI,KAAK,GAAG;EAE3B,OAAO;CACT,GAAG,CAAC,CAAC;AACP;;;;;AAMA,MAAM,uBAAuB,QAC3B,QAAQ,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,SAAS,cAAc;;;;;AAMjD,MAAM,2BAAqC,iBAAiB,QACzD,MAAmB,OAAO,MAAM,YAAY,EAAE,WAAW,GAAG,CAC/D,CAAC,CAAC,KAAK,MAAM,EAAE,MAAM,CAAC,CAAC;;;;;;;;;;;;;;;;;;;;;;AAuBvB,MAAa,2BACX,QACA,mBACa;CACb,MAAM,kBAAkB,OAAO,MAAM;CACrC,MAAM,2BAA2B,OAAO,SAAS;CACjD,MAAM,4BAA4B,OAAO,QAAQ,eAAe,KAC7D,QAAQ,QAAQ,KACnB;CAEA,MAAM,WAAW,CACf,GAAG,iBACH,GAAG,iBAAiB,wBAAwB,CAC9C,CAAC,CACE,QAAQ,YAAY,OAAO,YAAY,QAAQ,CAAC,CAChD,QAAQ,YAAY,CAAC,QAAQ,WAAW,GAAG,CAAC,CAAC,CAC7C,IAAI,aAAa;CAGpB,MAAM,eAAe,gBAClB,QACE,YACC,OAAO,YAAY,YAAY,QAAQ,WAAW,GAAG,CACzD,CAAC,CACA,KAAK,YAAY,QAAQ,MAAM,CAAC,CAAC;CAKpC,MAAM,sBAAsB,MAAM,qBAChC,IAAI,IAAI;EACN,GAAG;EACH,GAAG;EACH,GAAI,kBAAkB,CAAC;EACvB,GAAG;CACL,CAAC,CACH,CAAC,CACE,QAAQ,YAA+B,OAAO,YAAY,QAAQ,CAAC,CACnE,IAAI,aAAa;CAKpB,MAAM,oBAAoB,OAAO,QAAQ,WAAW,CAAC,EAAC,CAAE,KAAK,QAC3D,QAAQ,GAAG,CACb;CACA,MAAM,wBAAwB,iBAAiB,OAAO,mBAAmB;CACzE,MAAM,iBAAiB,iBAAiB,QACrC,QAAQ,CAAC,oBAAoB,GAAG,CACnC;CAQA,MAAM,cALc,oBAAoB,CACtC,OAAO,OAAO,SACd,GAAG,cACL,CAE8B,CAAC,CAAC,SAAS,SACvC,GAAG,KAAK,UAAU;EAChB,KAAK;EACL,QAAQ;EACR,UAAU;EACV,KAAK;CACP,CAAC,CACH;CAKA,MAAM,6BAA6B,oBAAoB,QACpD,YAAY,CAAC,QAAQ,SAAS,cAAc,CAC/C;CAEA,MAAM,mBAAmB,sBAAsB,SAAS,QACtD,GAAG,KAAK,UAAU;EAChB,KAAK;EACL,QAAQ;EACR,UAAU;EACV,KAAK;CACP,CAAC,CACH;CAEA,OAAO,MAAM,qBAAK,IAAI,IAAI,CAAC,GAAG,aAAa,GAAG,gBAAgB,CAAC,CAAC;AAClE"}
+{"version":3,"file":"buildComponentFilesList.mjs","names":[],"sources":["../../../src/utils/buildComponentFilesList.ts"],"sourcesContent":["import { isAbsolute, relative, resolve } from 'node:path';\nimport { TRAVERSE_PATTERN } from '@intlayer/config/defaultValues';\nimport { normalizePath } from '@intlayer/config/utils';\nimport type { IntlayerConfig } from '@intlayer/types/config';\nimport fg from 'fast-glob';\nimport { isDirectoryExcluded } from './isDirectoryExcluded';\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 nested in others so files are never scanned twice.\n * A nested directory is kept as its own root when the exclude patterns would\n * drop it from its parent's scan (e.g. `<root>/dist` under `**\\/dist/**`).\n *\n * Example: ['/root', '/root/src', '/root/dist'] → ['/root', '/root/dist']\n */\nconst getDistinctRootDirs = (\n  dirs: string[],\n  excludePatterns: string[]\n): 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 isCoveredByParent = acc.some((parent) => {\n      const relativePath = relative(parent, dir);\n      const isNested =\n        relativePath !== '' &&\n        !relativePath.startsWith('..') &&\n        !isAbsolute(relativePath);\n\n      return isNested && !isDirectoryExcluded(relativePath, excludePatterns);\n    });\n    if (!isCoveredByParent) acc.push(dir);\n\n    return acc;\n  }, []);\n};\n\n/**\n * Default exclude patterns derived from TRAVERSE_PATTERN.\n * Extracted once so the function body can reference them without re-computing.\n */\nconst DEFAULT_EXCLUDE_PATTERNS: string[] = TRAVERSE_PATTERN.filter(\n  (p): p is string => typeof p === 'string' && p.startsWith('!')\n).map((p) => p.slice(1));\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 `traversePattern`, and optional\n * dot-file inclusion.\n *\n * `codeDir` entries are more precise than the exclude patterns: a `codeDir`\n * inside an excluded directory (e.g. a design-system `dist` or a package in\n * `node_modules`) is scanned as its own root, so the exclusion only applies\n * below it.\n *\n * @example\n * // Single root with excludes\n * const files = buildComponentFilesList(config);\n *\n * @example\n * // Design-system build output is still scanned\n * // intlayer.config.ts: { content: { codeDir: ['node_modules/my-ds/dist'] } }\n * const files = buildComponentFilesList(config);\n */\nexport const buildComponentFilesList = (\n  config: IntlayerConfig,\n  excludePattern?: string[]\n): string[] => {\n  const traversePattern = config.build.traversePattern;\n  const compilerTransformPattern = config.compiler.transformPattern;\n  const contentDeclarationPattern = config.content.fileExtensions.map(\n    (ext) => `/**/*${ext}`\n  );\n\n  const patterns = [\n    ...traversePattern,\n    ...normalizeToArray(compilerTransformPattern),\n  ]\n    .filter((pattern) => typeof pattern === 'string')\n    .filter((pattern) => !pattern.startsWith('!'))\n    .map(normalizePath);\n\n  // User-supplied negations from traversePattern\n  const userExcludes = traversePattern\n    .filter(\n      (pattern): pattern is string =>\n        typeof pattern === 'string' && pattern.startsWith('!')\n    )\n    .map((pattern) => pattern.slice(1));\n\n  // Full exclude list: defaults (from TRAVERSE_PATTERN) + user overrides + caller extras + content files.\n  // DEFAULT_EXCLUDE_PATTERNS acts as a safety floor — if the user provides a\n  // partial traversePattern that omits some defaults, they are still applied.\n  const baseExcludePatterns = Array.from(\n    new Set([\n      ...DEFAULT_EXCLUDE_PATTERNS,\n      ...userExcludes,\n      ...(excludePattern ?? []),\n      ...contentDeclarationPattern,\n    ])\n  )\n    .filter((pattern): pattern is string => typeof pattern === 'string')\n    .map(normalizePath);\n\n  const roots = getDistinctRootDirs(\n    [config.system.baseDir, ...(config.content.codeDir ?? [])],\n    baseExcludePatterns\n  );\n\n  return Array.from(\n    new Set(\n      roots.flatMap((root) =>\n        fg.sync(patterns, {\n          cwd: root,\n          ignore: baseExcludePatterns,\n          absolute: true,\n          dot: true, // needed for .intlayer and similar\n        })\n      )\n    )\n  );\n};\n"],"mappings":";;;;;;;;;;AAUA,MAAM,oBAAuB,UAC3B,MAAM,QAAQ,KAAK,IAAI,QAAQ,CAAC,KAAK;;;;;;;;AASvC,MAAM,uBACJ,MACA,oBACa;CACb,MAAM,aAAa,MAAM,KAAK,IAAI,IAAI,KAAK,KAAK,QAAQ,QAAQ,GAAG,CAAC,CAAC,CAAC;CACtE,WAAW,MAAM,GAAG,MAAM,EAAE,SAAS,EAAE,MAAM;CAE7C,OAAO,WAAW,QAAQ,KAAe,QAAQ;EAU/C,IAAI,CATsB,IAAI,MAAM,WAAW;GAC7C,MAAM,eAAe,SAAS,QAAQ,GAAG;GAMzC,OAJE,iBAAiB,MACjB,CAAC,aAAa,WAAW,IAAI,KAC7B,CAAC,WAAW,YAAY,KAEP,CAAC,oBAAoB,cAAc,eAAe;EACvE,CACqB,GAAG,IAAI,KAAK,GAAG;EAEpC,OAAO;CACT,GAAG,CAAC,CAAC;AACP;;;;;AAMA,MAAM,2BAAqC,iBAAiB,QACzD,MAAmB,OAAO,MAAM,YAAY,EAAE,WAAW,GAAG,CAC/D,CAAC,CAAC,KAAK,MAAM,EAAE,MAAM,CAAC,CAAC;;;;;;;;;;;;;;;;;;;;;;AAuBvB,MAAa,2BACX,QACA,mBACa;CACb,MAAM,kBAAkB,OAAO,MAAM;CACrC,MAAM,2BAA2B,OAAO,SAAS;CACjD,MAAM,4BAA4B,OAAO,QAAQ,eAAe,KAC7D,QAAQ,QAAQ,KACnB;CAEA,MAAM,WAAW,CACf,GAAG,iBACH,GAAG,iBAAiB,wBAAwB,CAC9C,CAAC,CACE,QAAQ,YAAY,OAAO,YAAY,QAAQ,CAAC,CAChD,QAAQ,YAAY,CAAC,QAAQ,WAAW,GAAG,CAAC,CAAC,CAC7C,IAAI,aAAa;CAGpB,MAAM,eAAe,gBAClB,QACE,YACC,OAAO,YAAY,YAAY,QAAQ,WAAW,GAAG,CACzD,CAAC,CACA,KAAK,YAAY,QAAQ,MAAM,CAAC,CAAC;CAKpC,MAAM,sBAAsB,MAAM,qBAChC,IAAI,IAAI;EACN,GAAG;EACH,GAAG;EACH,GAAI,kBAAkB,CAAC;EACvB,GAAG;CACL,CAAC,CACH,CAAC,CACE,QAAQ,YAA+B,OAAO,YAAY,QAAQ,CAAC,CACnE,IAAI,aAAa;CAEpB,MAAM,QAAQ,oBACZ,CAAC,OAAO,OAAO,SAAS,GAAI,OAAO,QAAQ,WAAW,CAAC,CAAE,GACzD,mBACF;CAEA,OAAO,MAAM,KACX,IAAI,IACF,MAAM,SAAS,SACb,GAAG,KAAK,UAAU;EAChB,KAAK;EACL,QAAQ;EACR,UAAU;EACV,KAAK;CACP,CAAC,CACH,CACF,CACF;AACF"}

package/dist/esm/utils/chunkJSON.mjs

@@ -21,7 +21,7 @@ const setAtPath = (root, path, value) => {
 	for (let i = 0; i < path.length - 1; i++) {
 		const key = path[i];
 		if (key === void 0) continue;
-		const isNextIndex = typeof nextKey === "number";
+		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 ? [] : {};

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    if (key === undefined) continue;\n\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 Record<string, any>)[key] = isNextIndex ? [] : {};\n      }\n\n      current = (current as Record<string, any>)[key];\n    }\n  }\n\n  const last = path[path.length - 1];\n\n  if (last === undefined) return;\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 Record<string, 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        const part = parts[i];\n\n        if (part !== undefined) {\n          patches.push({\n            op: 'set',\n            path: [...currentPath, String(i + 1)],\n            value: part,\n          });\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        const item = currentValue[i];\n        if (item !== undefined) {\n          walk(item as JSONValue, [...currentPath, i]);\n        }\n      }\n    } else {\n      for (const key of Object.keys(currentValue)) {\n        const childVal = (currentValue as JSONObject)[key];\n\n        if (childVal !== undefined) {\n          walk(childVal, [...currentPath, key]);\n        }\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 firstChunk = sorted[0];\n\n  if (!firstChunk) {\n    throw new Error('No chunks provided.');\n  }\n\n  const { checksum, rootType } = firstChunk;\n  const schemaVersion = 1;\n\n  for (let i = 0; i < sorted.length; i++) {\n    const chunk = sorted[i];\n\n    if (!chunk) continue;\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) continue;\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;CACjE,OAAO,OAAO,QAAQ,YAAY,QAAQ,QAAQ,CAAC,MAAM,QAAQ,GAAG;AACtE;AAEA,MAAM,eAAe,QAAwB;CAE3C,IAAI,OAAO;CAEX,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,KAC9B,QAAS,QAAQ,KAAK,OAAQ,IAAI,WAAW,CAAC;CAIhD,QAAQ,SAAS,EAAC,CAAE,SAAS,EAAE,CAAC,CAAC,SAAS,GAAG,GAAG;AAClD;AAEA,MAAM,aAAa,MAAW,MAAY,UAAqB;CAC7D,IAAI,UAAU;CAEd,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,SAAS,GAAG,KAAK;EACxC,MAAM,MAAM,KAAK;EACjB,IAAI,QAAQ,QAAW;EAEvB,MAAM,cAAc,OAAO,YAAY;EAEvC,IAAI,OAAO,QAAQ,UAAU;GAC3B,IAAI,CAAC,MAAM,QAAQ,OAAO,GACxB,MAAM,IAAI,MAAM,kCAAkC,GAAG;GAGvD,IAAI,QAAQ,SAAS,QACnB,QAAQ,OAAO,cAAc,CAAC,IAAI,CAAC;GAGrC,UAAU,QAAQ;EACpB,OAAO;GACL,IAAI,CAAC,SAAS,OAAO,GACnB,MAAM,IAAI,MAAM,mCAAmC,GAAG;GAGxD,IAAI,EAAE,OAAO,UACX,AAAC,QAAgC,OAAO,cAAc,CAAC,IAAI,CAAC;GAG9D,UAAW,QAAgC;EAC7C;CACF;CAEA,MAAM,OAAO,KAAK,KAAK,SAAS;CAEhC,IAAI,SAAS,QAAW;CAExB,IAAI,OAAO,SAAS,UAAU;EAC5B,IAAI,CAAC,MAAM,QAAQ,OAAO,GACxB,MAAM,IAAI,MAAM,iCAAiC;EAGnD,QAAQ,QAAQ;CAClB,OAAO;EACL,IAAI,CAAC,SAAS,OAAO,GACnB,MAAM,IAAI,MAAM,kCAAkC;EAGpD,AAAC,QAAgC,QAAQ;CAC3C;AACF;AAEA,MAAM,WAAW,SAAuB;CAEtC,OAAO,KAAK,UAAU,IAAI;AAC5B;;;;AAKA,MAAM,uBACJ,KACA,oBACa;CACb,IAAI,mBAAmB,GACrB,MAAM,IAAI,MAAM,sBAAsB;CAGxC,MAAM,SAAmB,CAAC;CAC1B,IAAI,SAAS;CAEb,OAAO,SAAS,IAAI,QAAQ;EAC1B,MAAM,OAAO,SAAS,KAAK;GACzB,WAAW;GACX,YAAY;EACd,CAAC;EAED,IAAI,CAAC,MAAM;EAEX,OAAO,KAAK,IAAI;EAChB,UAAU,KAAK;CACjB;CAEA,OAAO;AACT;;;;;AAMA,MAAM,oBACJ,OACA,kBACA,OAAa,CAAC,GACd,uBAAO,IAAI,QAAgB,MACf;CAGZ,MAAM,iBAAiB,KAAK,IAC1B,GACA,KAAK,OAAO,mBAAmB,OAAO,EAAG,CAC3C;CAEA,MAAM,UAAmB,CAAC;CAE1B,MAAM,QAAQ,cAAyB,gBAAsB;EAC3D,IAAI,OAAO,iBAAiB,UAAU;GAGpC,MAAM,YAAsB;IAC1B,IAAI;IACJ,MAAM;IACN,OAAO;GACT;GAGA,IAFgB,KAAK,UAAU,SAAS,CAAC,CAAC,SAAS,OAEpC,kBAAkB;IAC/B,QAAQ,KAAK,SAAS;IACtB;GACF;GAGA,MAAM,QAAQ,oBAAoB,cAAc,cAAc;GAG9D,QAAQ,KAAK;IACX,IAAI;IACJ,MAAM,CAAC,GAAG,aAAa,gBAAgB;IACvC,OAAO;GACT,CAAC;GACD,QAAQ,KAAK;IACX,IAAI;IACJ,MAAM,CAAC,GAAG,aAAa,SAAS;IAChC,OAAO,MAAM;GACf,CAAC;GAED,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;IACrC,MAAM,OAAO,MAAM;IAEnB,IAAI,SAAS,QACX,QAAQ,KAAK;KACX,IAAI;KACJ,MAAM,CAAC,GAAG,aAAa,OAAO,IAAI,CAAC,CAAC;KACpC,OAAO;IACT,CAAC;GAEL;GAEA;EACF;EAEA,IAAI,iBAAiB,QAAQ,OAAO,iBAAiB,UAAU;GAC7D,QAAQ,KAAK;IAAE,IAAI;IAAO,MAAM;IAAa,OAAO;GAAa,CAAC;GAClE;EACF;EAEA,IAAI,KAAK,IAAI,YAAsB,GACjC,MAAM,IAAI,MAAM,+CAA+C;EAGjE,KAAK,IAAI,YAAsB;EAE/B,IAAI,MAAM,QAAQ,YAAY,GAC5B,KAAK,IAAI,IAAI,GAAG,IAAI,aAAa,QAAQ,KAAK;GAC5C,MAAM,OAAO,aAAa;GAC1B,IAAI,SAAS,QACX,KAAK,MAAmB,CAAC,GAAG,aAAa,CAAC,CAAC;EAE/C;OAEA,KAAK,MAAM,OAAO,OAAO,KAAK,YAAY,GAAG;GAC3C,MAAM,WAAY,aAA4B;GAE9C,IAAI,aAAa,QACf,KAAK,UAAU,CAAC,GAAG,aAAa,GAAG,CAAC;EAExC;EAGF,KAAK,OAAO,YAAsB;CACpC;CAEA,KAAK,OAAO,IAAI;CAChB,OAAO;AACT;;;;AAKA,MAAa,aACX,OACA,aACgB;CAChB,IAAI,CAAC,SAAS,KAAK,KAAK,CAAC,MAAM,QAAQ,KAAK,GAC1C,MAAM,IAAI,MAAM,kCAAkC;CAGpD,IAAI,WAAW,KAEb,MAAM,IAAI,MAAM,qDAAqD;CAGvE,MAAM,WAAqB,MAAM,QAAQ,KAAK,IAAI,UAAU;CAC5D,IAAI;CAEJ,IAAI;EACF,eAAe,KAAK,UAAU,KAAK;CACrC,QAAQ;EAEN,MAAM,IAAI,MAAM,+CAA+C;CACjE;CAEA,MAAM,WAAW,YAAY,YAAY;CACzC,MAAM,aAAa,iBAAiB,OAAoB,QAAQ;CAEhE,MAAM,SAAsB,CAAC;CAC7B,IAAI,eAA0B;EAC5B,eAAe;EACf,OAAO;EACP,OAAO;EACP;EACA;EACA,SAAS,CAAC;CACZ;CAEA,MAAM,oBAAoB,KAAK,UAAU;EACvC,GAAG;EACH,SAAS,CAAC;CACZ,CAAC,CAAC,CAAC;CAEH,MAAM,iBAAiB;EACrB,IAAI,aAAa,QAAQ,SAAS,GAAG;GACnC,OAAO,KAAK,YAAY;GACxB,eAAe;IACb,eAAe;IACf,OAAO;IACP,OAAO;IACP;IACA;IACA,SAAS,CAAC;GACZ;EACF;CACF;CAEA,KAAK,MAAM,SAAS,YAQlB,IALE,oBACA,KAAK,UAAU,aAAa,OAAO,CAAC,CAAC,UACpC,aAAa,QAAQ,SAAS,IAAI,KACnC,KAAK,UAAU,KAAK,CAAC,CAAC,UAEH,UACnB,aAAa,QAAQ,KAAK,KAAK;MAC1B;EAEL,IAAI,aAAa,QAAQ,SAAS,GAChC,SAAS;EAMX,IAFmB,oBAAoB,KAAK,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,SAE9C,UAGf,MAAM,IAAI,MACR,8FACF;EAGF,aAAa,QAAQ,KAAK,KAAK;CACjC;CAGF,SAAS;CAGT,IAAI,OAAO,WAAW,GACpB,OAAO,KAAK;EACV,eAAe;EACf,OAAO;EACP,OAAO;EACP;EACA;EACA,SAAS,CAAC;CACZ,CAAC;CAIH,MAAM,cAAc,OAAO;CAE3B,OAAO,SAAS,OAAO,UAAU;EAC/B,MAAM,QAAQ;EACd,MAAM,QAAQ;CAChB,CAAC;CAED,OAAO;AACT;;;;;;;;;;;AAYA,MAAa,8BACX,UAC2B;CAC3B,MAAM,OAAY,MAAM,aAAa,UAAU,CAAC,IAAI,CAAC;CAGrD,KAAK,MAAM,SAAS,MAAM,SACxB,IAAI,MAAM,OAAO,OACf,UAAU,MAAM,MAAM,MAAM,MAAM,KAAK;CAM3C,MAAM,uBAAuB,SAAmB;EAC9C,IAAI,SAAS,QAAQ,OAAO,SAAS,UAAU,OAAO;EAEtD,IAAI,MAAM,QAAQ,IAAI,GAAG;GACvB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAC/B,KAAK,KAAK,oBAAoB,KAAK,EAAE;GAEvC,OAAO;EACT;EAGA,IAAK,KAAa,sBAAsB,UAAU;GAChD,MAAM,QAAS,KAAa;GAE5B,IAAI,OAAO,UAAU,YAAY,SAAS,GAExC,OAAO;GAGT,MAAM,QAAkB,CAAC;GACzB,IAAI,cAAc;GAElB,KAAK,IAAI,IAAI,GAAG,KAAK,OAAO,KAAK;IAC/B,MAAM,QAAS,KAAa,OAAO,CAAC;IAEpC,IAAI,OAAO,UAAU,UAAU;KAC7B,cAAc;KACd;IACF;IAEA,MAAM,KAAK,KAAK;GAClB;GAGA,IAAI,aACF,OAAO,MAAM,KAAK,EAAE;GAGtB,OAAO;EACT;EAGA,IAAK,KAAa,sBAAsB,SAAS;GAC/C,MAAM,QAAS,KAAa;GAE5B,IAAI,OAAO,UAAU,YAAY,QAAQ,GAEvC,OAAO;GAGT,MAAM,SAAgB,CAAC;GACvB,IAAI,cAAc;GAElB,KAAK,IAAI,IAAI,GAAG,KAAK,OAAO,KAAK;IAC/B,MAAM,QAAS,KAAa,OAAO,CAAC;IAEpC,IAAI,CAAC,MAAM,QAAQ,KAAK,GAAG;KACzB,cAAc;KACd;IACF;IAEA,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAChC,OAAO,KAAK,oBAAoB,MAAM,EAAE,CAAC;GAE7C;GAGA,IAAI,aACF,OAAO;GAGT,OAAO;EACT;EAGA,KAAK,MAAM,OAAO,OAAO,KAAK,IAAI,GAChC,KAAK,OAAO,oBAAoB,KAAK,IAAI;EAG3C,OAAO;CACT;CAEA,OAAO,oBAAoB,IAAI;AACjC;AAEA,MAAa,gBAAgB,WAAgD;CAC3E,IAAI,CAAC,UAAU,OAAO,WAAW,GAC/B,MAAM,IAAI,MAAM,qBAAqB;CAIvC,MAAM,SAAS,CAAC,GAAG,MAAM,CAAC,CAAC,MAAM,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;CAC3D,MAAM,aAAa,OAAO;CAE1B,IAAI,CAAC,YACH,MAAM,IAAI,MAAM,qBAAqB;CAGvC,MAAM,EAAE,UAAU,aAAa;CAC/B,MAAM,gBAAgB;CAEtB,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;EACtC,MAAM,QAAQ,OAAO;EAErB,IAAI,CAAC,OAAO;EAEZ,IAAI,MAAM,kBAAkB,eAAe;GACzC,QAAQ,MAAM,8BAA8B;IAC1C,OAAO;IACP;GACF,CAAC;GACD,MAAM,IAAI,MAAM,4BAA4B;EAC9C;EAEA,IAAI,MAAM,aAAa,UAAU;GAC/B,QAAQ,MAAM,6BAA6B;IACzC,OAAO;IACP;GACF,CAAC;GACD,MAAM,IAAI,MAAM,2BAA2B;EAC7C;EAEA,IAAI,MAAM,aAAa,UAAU;GAC/B,QAAQ,MAAM,yDAAyD;IACrE,OAAO;IACP;GACF,CAAC;GACD,MAAM,IAAI,MAAM,uDAAuD;EACzE;EAEA,IAAI,MAAM,UAAU,GAAG;GACrB,QAAQ,MAAM,+CAA+C;IAC3D,OAAO;IACP,OAAO,MAAM;IACb;GACF,CAAC;GACD,MAAM,IAAI,MAAM,6CAA6C;EAC/D;CAGF;CAEA,MAAM,OAAY,aAAa,UAAU,CAAC,IAAI,CAAC;CAG/C,MAAM,8BAAc,IAAI,IAGtB;CAEF,MAAM,YAAY,UAChB,UAAU,MAAM,MAAM,MAAM,MAAM,KAAK;CAEzC,KAAK,MAAM,SAAS,QAClB,KAAK,MAAM,SAAS,MAAM,SACxB,IAAI,MAAM,OAAO,OACf,SAAS,KAAK;MACT;EACL,MAAM,MAAM,QAAQ,MAAM,IAAI;EAC9B,MAAM,SAAS,YAAY,IAAI,GAAG,KAAK;GACrC,MAAM,MAAM;GACZ,OAAO,MAAM;GACb,UAAU,CAAC;EACb;EAEA,IAAI,OAAO,UAAU,MAAM,OACzB,MAAM,IAAI,MAAM,6CAA6C;EAG/D,OAAO,SAAS,KAAK,KAAK;EAC1B,YAAY,IAAI,KAAK,MAAM;CAC7B;CAKJ,KAAK,MAAM,EAAE,MAAM,OAAO,cAAc,YAAY,OAAO,GAAG;EAC5D,IAAI,SAAS,WAAW,OACtB,MAAM,IAAI,MAAM,wDAAwD;EAG1E,SAAS,MAAM,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;EACzC,MAAM,aAAa,SAAS,KAAK,SAAS,KAAK,KAAK,CAAC,CAAC,KAAK,EAAE;EAC7D,UAAU,MAAM,MAAM,UAAU;CAClC;CAGA,MAAM,uBAAuB,SAAmB;EAC9C,IAAI,SAAS,QAAQ,OAAO,SAAS,UAAU,OAAO;EAEtD,IAAI,MAAM,QAAQ,IAAI,GAAG;GACvB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAC/B,KAAK,KAAK,oBAAoB,KAAK,EAAE;GAEvC,OAAO;EACT;EAGA,IAAK,KAAa,sBAAsB,UAAU;GAChD,MAAM,QAAS,KAAa;GAE5B,IAAI,OAAO,UAAU,YAAY,SAAS,GACxC,MAAM,IAAI,MAAM,sCAAsC;GAGxD,MAAM,QAAkB,CAAC;GAEzB,KAAK,IAAI,IAAI,GAAG,KAAK,OAAO,KAAK;IAC/B,MAAM,QAAS,KAAa,OAAO,CAAC;IAEpC,IAAI,OAAO,UAAU,UACnB,MAAM,IAAI,MACR,wDACF;IAGF,MAAM,KAAK,KAAK;GAClB;GAEA,OAAO,MAAM,KAAK,EAAE;EACtB;EAGA,IAAK,KAAa,sBAAsB,SAAS;GAC/C,MAAM,QAAS,KAAa;GAE5B,IAAI,OAAO,UAAU,YAAY,QAAQ,GACvC,MAAM,IAAI,MAAM,sCAAsC;GAGxD,MAAM,SAAgB,CAAC;GAEvB,KAAK,IAAI,IAAI,GAAG,KAAK,OAAO,KAAK;IAC/B,MAAM,QAAS,KAAa,OAAO,CAAC;IAEpC,IAAI,CAAC,MAAM,QAAQ,KAAK,GACtB,MAAM,IAAI,MACR,wDACF;IAGF,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAChC,OAAO,KAAK,oBAAoB,MAAM,EAAE,CAAC;GAE7C;GAEA,OAAO;EACT;EAGA,KAAK,MAAM,OAAO,OAAO,KAAK,IAAI,GAChC,KAAK,OAAO,oBAAoB,KAAK,IAAI;EAG3C,OAAO;CACT;CAEA,MAAM,aAAa,oBAAoB,IAAI;CAG3C,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;EACtC,MAAM,QAAQ,OAAO;EAErB,IAAI,CAAC,OAAO;EAEZ,IAAI,MAAM,UAAU,OAAO,QACzB,MAAM,IAAI,MACR,uDAAuD,OAAO,OAAO,cAAc,EAAE,aAAa,MAAM,OAC1G;CAEJ;CAEA,OAAO;AACT"}
+{"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    if (key === undefined) continue;\n\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 Record<string, any>)[key] = isNextIndex ? [] : {};\n      }\n\n      current = (current as Record<string, any>)[key];\n    }\n  }\n\n  const last = path[path.length - 1];\n\n  if (last === undefined) return;\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 Record<string, 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        const part = parts[i];\n\n        if (part !== undefined) {\n          patches.push({\n            op: 'set',\n            path: [...currentPath, String(i + 1)],\n            value: part,\n          });\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        const item = currentValue[i];\n        if (item !== undefined) {\n          walk(item as JSONValue, [...currentPath, i]);\n        }\n      }\n    } else {\n      for (const key of Object.keys(currentValue)) {\n        const childVal = (currentValue as JSONObject)[key];\n\n        if (childVal !== undefined) {\n          walk(childVal, [...currentPath, key]);\n        }\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 firstChunk = sorted[0];\n\n  if (!firstChunk) {\n    throw new Error('No chunks provided.');\n  }\n\n  const { checksum, rootType } = firstChunk;\n  const schemaVersion = 1;\n\n  for (let i = 0; i < sorted.length; i++) {\n    const chunk = sorted[i];\n\n    if (!chunk) continue;\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) continue;\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;CACjE,OAAO,OAAO,QAAQ,YAAY,QAAQ,QAAQ,CAAC,MAAM,QAAQ,GAAG;AACtE;AAEA,MAAM,eAAe,QAAwB;CAE3C,IAAI,OAAO;CAEX,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,KAC9B,QAAS,QAAQ,KAAK,OAAQ,IAAI,WAAW,CAAC;CAIhD,QAAQ,SAAS,EAAC,CAAE,SAAS,EAAE,CAAC,CAAC,SAAS,GAAG,GAAG;AAClD;AAEA,MAAM,aAAa,MAAW,MAAY,UAAqB;CAC7D,IAAI,UAAU;CAEd,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,SAAS,GAAG,KAAK;EACxC,MAAM,MAAM,KAAK;EACjB,IAAI,QAAQ,QAAW;EAGvB,MAAM,cAAc,OADJ,KAAK,IAAI,OACc;EAEvC,IAAI,OAAO,QAAQ,UAAU;GAC3B,IAAI,CAAC,MAAM,QAAQ,OAAO,GACxB,MAAM,IAAI,MAAM,kCAAkC,GAAG;GAGvD,IAAI,QAAQ,SAAS,QACnB,QAAQ,OAAO,cAAc,CAAC,IAAI,CAAC;GAGrC,UAAU,QAAQ;EACpB,OAAO;GACL,IAAI,CAAC,SAAS,OAAO,GACnB,MAAM,IAAI,MAAM,mCAAmC,GAAG;GAGxD,IAAI,EAAE,OAAO,UACX,AAAC,QAAgC,OAAO,cAAc,CAAC,IAAI,CAAC;GAG9D,UAAW,QAAgC;EAC7C;CACF;CAEA,MAAM,OAAO,KAAK,KAAK,SAAS;CAEhC,IAAI,SAAS,QAAW;CAExB,IAAI,OAAO,SAAS,UAAU;EAC5B,IAAI,CAAC,MAAM,QAAQ,OAAO,GACxB,MAAM,IAAI,MAAM,iCAAiC;EAGnD,QAAQ,QAAQ;CAClB,OAAO;EACL,IAAI,CAAC,SAAS,OAAO,GACnB,MAAM,IAAI,MAAM,kCAAkC;EAGpD,AAAC,QAAgC,QAAQ;CAC3C;AACF;AAEA,MAAM,WAAW,SAAuB;CAEtC,OAAO,KAAK,UAAU,IAAI;AAC5B;;;;AAKA,MAAM,uBACJ,KACA,oBACa;CACb,IAAI,mBAAmB,GACrB,MAAM,IAAI,MAAM,sBAAsB;CAGxC,MAAM,SAAmB,CAAC;CAC1B,IAAI,SAAS;CAEb,OAAO,SAAS,IAAI,QAAQ;EAC1B,MAAM,OAAO,SAAS,KAAK;GACzB,WAAW;GACX,YAAY;EACd,CAAC;EAED,IAAI,CAAC,MAAM;EAEX,OAAO,KAAK,IAAI;EAChB,UAAU,KAAK;CACjB;CAEA,OAAO;AACT;;;;;AAMA,MAAM,oBACJ,OACA,kBACA,OAAa,CAAC,GACd,uBAAO,IAAI,QAAgB,MACf;CAGZ,MAAM,iBAAiB,KAAK,IAC1B,GACA,KAAK,OAAO,mBAAmB,OAAO,EAAG,CAC3C;CAEA,MAAM,UAAmB,CAAC;CAE1B,MAAM,QAAQ,cAAyB,gBAAsB;EAC3D,IAAI,OAAO,iBAAiB,UAAU;GAGpC,MAAM,YAAsB;IAC1B,IAAI;IACJ,MAAM;IACN,OAAO;GACT;GAGA,IAFgB,KAAK,UAAU,SAAS,CAAC,CAAC,SAAS,OAEpC,kBAAkB;IAC/B,QAAQ,KAAK,SAAS;IACtB;GACF;GAGA,MAAM,QAAQ,oBAAoB,cAAc,cAAc;GAG9D,QAAQ,KAAK;IACX,IAAI;IACJ,MAAM,CAAC,GAAG,aAAa,gBAAgB;IACvC,OAAO;GACT,CAAC;GACD,QAAQ,KAAK;IACX,IAAI;IACJ,MAAM,CAAC,GAAG,aAAa,SAAS;IAChC,OAAO,MAAM;GACf,CAAC;GAED,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;IACrC,MAAM,OAAO,MAAM;IAEnB,IAAI,SAAS,QACX,QAAQ,KAAK;KACX,IAAI;KACJ,MAAM,CAAC,GAAG,aAAa,OAAO,IAAI,CAAC,CAAC;KACpC,OAAO;IACT,CAAC;GAEL;GAEA;EACF;EAEA,IAAI,iBAAiB,QAAQ,OAAO,iBAAiB,UAAU;GAC7D,QAAQ,KAAK;IAAE,IAAI;IAAO,MAAM;IAAa,OAAO;GAAa,CAAC;GAClE;EACF;EAEA,IAAI,KAAK,IAAI,YAAsB,GACjC,MAAM,IAAI,MAAM,+CAA+C;EAGjE,KAAK,IAAI,YAAsB;EAE/B,IAAI,MAAM,QAAQ,YAAY,GAC5B,KAAK,IAAI,IAAI,GAAG,IAAI,aAAa,QAAQ,KAAK;GAC5C,MAAM,OAAO,aAAa;GAC1B,IAAI,SAAS,QACX,KAAK,MAAmB,CAAC,GAAG,aAAa,CAAC,CAAC;EAE/C;OAEA,KAAK,MAAM,OAAO,OAAO,KAAK,YAAY,GAAG;GAC3C,MAAM,WAAY,aAA4B;GAE9C,IAAI,aAAa,QACf,KAAK,UAAU,CAAC,GAAG,aAAa,GAAG,CAAC;EAExC;EAGF,KAAK,OAAO,YAAsB;CACpC;CAEA,KAAK,OAAO,IAAI;CAChB,OAAO;AACT;;;;AAKA,MAAa,aACX,OACA,aACgB;CAChB,IAAI,CAAC,SAAS,KAAK,KAAK,CAAC,MAAM,QAAQ,KAAK,GAC1C,MAAM,IAAI,MAAM,kCAAkC;CAGpD,IAAI,WAAW,KAEb,MAAM,IAAI,MAAM,qDAAqD;CAGvE,MAAM,WAAqB,MAAM,QAAQ,KAAK,IAAI,UAAU;CAC5D,IAAI;CAEJ,IAAI;EACF,eAAe,KAAK,UAAU,KAAK;CACrC,QAAQ;EAEN,MAAM,IAAI,MAAM,+CAA+C;CACjE;CAEA,MAAM,WAAW,YAAY,YAAY;CACzC,MAAM,aAAa,iBAAiB,OAAoB,QAAQ;CAEhE,MAAM,SAAsB,CAAC;CAC7B,IAAI,eAA0B;EAC5B,eAAe;EACf,OAAO;EACP,OAAO;EACP;EACA;EACA,SAAS,CAAC;CACZ;CAEA,MAAM,oBAAoB,KAAK,UAAU;EACvC,GAAG;EACH,SAAS,CAAC;CACZ,CAAC,CAAC,CAAC;CAEH,MAAM,iBAAiB;EACrB,IAAI,aAAa,QAAQ,SAAS,GAAG;GACnC,OAAO,KAAK,YAAY;GACxB,eAAe;IACb,eAAe;IACf,OAAO;IACP,OAAO;IACP;IACA;IACA,SAAS,CAAC;GACZ;EACF;CACF;CAEA,KAAK,MAAM,SAAS,YAQlB,IALE,oBACA,KAAK,UAAU,aAAa,OAAO,CAAC,CAAC,UACpC,aAAa,QAAQ,SAAS,IAAI,KACnC,KAAK,UAAU,KAAK,CAAC,CAAC,UAEH,UACnB,aAAa,QAAQ,KAAK,KAAK;MAC1B;EAEL,IAAI,aAAa,QAAQ,SAAS,GAChC,SAAS;EAMX,IAFmB,oBAAoB,KAAK,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,SAE9C,UAGf,MAAM,IAAI,MACR,8FACF;EAGF,aAAa,QAAQ,KAAK,KAAK;CACjC;CAGF,SAAS;CAGT,IAAI,OAAO,WAAW,GACpB,OAAO,KAAK;EACV,eAAe;EACf,OAAO;EACP,OAAO;EACP;EACA;EACA,SAAS,CAAC;CACZ,CAAC;CAIH,MAAM,cAAc,OAAO;CAE3B,OAAO,SAAS,OAAO,UAAU;EAC/B,MAAM,QAAQ;EACd,MAAM,QAAQ;CAChB,CAAC;CAED,OAAO;AACT;;;;;;;;;;;AAYA,MAAa,8BACX,UAC2B;CAC3B,MAAM,OAAY,MAAM,aAAa,UAAU,CAAC,IAAI,CAAC;CAGrD,KAAK,MAAM,SAAS,MAAM,SACxB,IAAI,MAAM,OAAO,OACf,UAAU,MAAM,MAAM,MAAM,MAAM,KAAK;CAM3C,MAAM,uBAAuB,SAAmB;EAC9C,IAAI,SAAS,QAAQ,OAAO,SAAS,UAAU,OAAO;EAEtD,IAAI,MAAM,QAAQ,IAAI,GAAG;GACvB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAC/B,KAAK,KAAK,oBAAoB,KAAK,EAAE;GAEvC,OAAO;EACT;EAGA,IAAK,KAAa,sBAAsB,UAAU;GAChD,MAAM,QAAS,KAAa;GAE5B,IAAI,OAAO,UAAU,YAAY,SAAS,GAExC,OAAO;GAGT,MAAM,QAAkB,CAAC;GACzB,IAAI,cAAc;GAElB,KAAK,IAAI,IAAI,GAAG,KAAK,OAAO,KAAK;IAC/B,MAAM,QAAS,KAAa,OAAO,CAAC;IAEpC,IAAI,OAAO,UAAU,UAAU;KAC7B,cAAc;KACd;IACF;IAEA,MAAM,KAAK,KAAK;GAClB;GAGA,IAAI,aACF,OAAO,MAAM,KAAK,EAAE;GAGtB,OAAO;EACT;EAGA,IAAK,KAAa,sBAAsB,SAAS;GAC/C,MAAM,QAAS,KAAa;GAE5B,IAAI,OAAO,UAAU,YAAY,QAAQ,GAEvC,OAAO;GAGT,MAAM,SAAgB,CAAC;GACvB,IAAI,cAAc;GAElB,KAAK,IAAI,IAAI,GAAG,KAAK,OAAO,KAAK;IAC/B,MAAM,QAAS,KAAa,OAAO,CAAC;IAEpC,IAAI,CAAC,MAAM,QAAQ,KAAK,GAAG;KACzB,cAAc;KACd;IACF;IAEA,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAChC,OAAO,KAAK,oBAAoB,MAAM,EAAE,CAAC;GAE7C;GAGA,IAAI,aACF,OAAO;GAGT,OAAO;EACT;EAGA,KAAK,MAAM,OAAO,OAAO,KAAK,IAAI,GAChC,KAAK,OAAO,oBAAoB,KAAK,IAAI;EAG3C,OAAO;CACT;CAEA,OAAO,oBAAoB,IAAI;AACjC;AAEA,MAAa,gBAAgB,WAAgD;CAC3E,IAAI,CAAC,UAAU,OAAO,WAAW,GAC/B,MAAM,IAAI,MAAM,qBAAqB;CAIvC,MAAM,SAAS,CAAC,GAAG,MAAM,CAAC,CAAC,MAAM,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;CAC3D,MAAM,aAAa,OAAO;CAE1B,IAAI,CAAC,YACH,MAAM,IAAI,MAAM,qBAAqB;CAGvC,MAAM,EAAE,UAAU,aAAa;CAC/B,MAAM,gBAAgB;CAEtB,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;EACtC,MAAM,QAAQ,OAAO;EAErB,IAAI,CAAC,OAAO;EAEZ,IAAI,MAAM,kBAAkB,eAAe;GACzC,QAAQ,MAAM,8BAA8B;IAC1C,OAAO;IACP;GACF,CAAC;GACD,MAAM,IAAI,MAAM,4BAA4B;EAC9C;EAEA,IAAI,MAAM,aAAa,UAAU;GAC/B,QAAQ,MAAM,6BAA6B;IACzC,OAAO;IACP;GACF,CAAC;GACD,MAAM,IAAI,MAAM,2BAA2B;EAC7C;EAEA,IAAI,MAAM,aAAa,UAAU;GAC/B,QAAQ,MAAM,yDAAyD;IACrE,OAAO;IACP;GACF,CAAC;GACD,MAAM,IAAI,MAAM,uDAAuD;EACzE;EAEA,IAAI,MAAM,UAAU,GAAG;GACrB,QAAQ,MAAM,+CAA+C;IAC3D,OAAO;IACP,OAAO,MAAM;IACb;GACF,CAAC;GACD,MAAM,IAAI,MAAM,6CAA6C;EAC/D;CAGF;CAEA,MAAM,OAAY,aAAa,UAAU,CAAC,IAAI,CAAC;CAG/C,MAAM,8BAAc,IAAI,IAGtB;CAEF,MAAM,YAAY,UAChB,UAAU,MAAM,MAAM,MAAM,MAAM,KAAK;CAEzC,KAAK,MAAM,SAAS,QAClB,KAAK,MAAM,SAAS,MAAM,SACxB,IAAI,MAAM,OAAO,OACf,SAAS,KAAK;MACT;EACL,MAAM,MAAM,QAAQ,MAAM,IAAI;EAC9B,MAAM,SAAS,YAAY,IAAI,GAAG,KAAK;GACrC,MAAM,MAAM;GACZ,OAAO,MAAM;GACb,UAAU,CAAC;EACb;EAEA,IAAI,OAAO,UAAU,MAAM,OACzB,MAAM,IAAI,MAAM,6CAA6C;EAG/D,OAAO,SAAS,KAAK,KAAK;EAC1B,YAAY,IAAI,KAAK,MAAM;CAC7B;CAKJ,KAAK,MAAM,EAAE,MAAM,OAAO,cAAc,YAAY,OAAO,GAAG;EAC5D,IAAI,SAAS,WAAW,OACtB,MAAM,IAAI,MAAM,wDAAwD;EAG1E,SAAS,MAAM,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;EACzC,MAAM,aAAa,SAAS,KAAK,SAAS,KAAK,KAAK,CAAC,CAAC,KAAK,EAAE;EAC7D,UAAU,MAAM,MAAM,UAAU;CAClC;CAGA,MAAM,uBAAuB,SAAmB;EAC9C,IAAI,SAAS,QAAQ,OAAO,SAAS,UAAU,OAAO;EAEtD,IAAI,MAAM,QAAQ,IAAI,GAAG;GACvB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAC/B,KAAK,KAAK,oBAAoB,KAAK,EAAE;GAEvC,OAAO;EACT;EAGA,IAAK,KAAa,sBAAsB,UAAU;GAChD,MAAM,QAAS,KAAa;GAE5B,IAAI,OAAO,UAAU,YAAY,SAAS,GACxC,MAAM,IAAI,MAAM,sCAAsC;GAGxD,MAAM,QAAkB,CAAC;GAEzB,KAAK,IAAI,IAAI,GAAG,KAAK,OAAO,KAAK;IAC/B,MAAM,QAAS,KAAa,OAAO,CAAC;IAEpC,IAAI,OAAO,UAAU,UACnB,MAAM,IAAI,MACR,wDACF;IAGF,MAAM,KAAK,KAAK;GAClB;GAEA,OAAO,MAAM,KAAK,EAAE;EACtB;EAGA,IAAK,KAAa,sBAAsB,SAAS;GAC/C,MAAM,QAAS,KAAa;GAE5B,IAAI,OAAO,UAAU,YAAY,QAAQ,GACvC,MAAM,IAAI,MAAM,sCAAsC;GAGxD,MAAM,SAAgB,CAAC;GAEvB,KAAK,IAAI,IAAI,GAAG,KAAK,OAAO,KAAK;IAC/B,MAAM,QAAS,KAAa,OAAO,CAAC;IAEpC,IAAI,CAAC,MAAM,QAAQ,KAAK,GACtB,MAAM,IAAI,MACR,wDACF;IAGF,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAChC,OAAO,KAAK,oBAAoB,MAAM,EAAE,CAAC;GAE7C;GAEA,OAAO;EACT;EAGA,KAAK,MAAM,OAAO,OAAO,KAAK,IAAI,GAChC,KAAK,OAAO,oBAAoB,KAAK,IAAI;EAG3C,OAAO;CACT;CAEA,MAAM,aAAa,oBAAoB,IAAI;CAG3C,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;EACtC,MAAM,QAAQ,OAAO;EAErB,IAAI,CAAC,OAAO;EAEZ,IAAI,MAAM,UAAU,OAAO,QACzB,MAAM,IAAI,MACR,uDAAuD,OAAO,OAAO,cAAc,EAAE,aAAa,MAAM,OAC1G;CAEJ;CAEA,OAAO;AACT"}

package/dist/esm/utils/index.mjs

@@ -1,4 +1,5 @@
 import { autoDecorateContent } from "./autoDecorateContent.mjs";
+import { isDirectoryExcluded } from "./isDirectoryExcluded.mjs";
 import { buildComponentFilesList } from "./buildComponentFilesList.mjs";
 import { chunkArray } from "./chunkArray.mjs";
 import { splitTextByLines } from "./splitTextByLine.mjs";
@@ -24,4 +25,4 @@ import { startContentWatcher } from "./startContentWatcher.mjs";
 import { verifyIdenticObjectFormat } from "./verifyIdenticObjectFormat.mjs";
 import { withFileLock } from "./withFileLock.mjs";
 
-export { CLI_CONTENT_WATCHER_ENV_VAR, Queue, acquireContentWatcherLock, assembleJSON, autoDecorateContent, buildComponentFilesList, chunkArray, chunkJSON, claimCliContentWatcher, excludeObjectFormat, formatLocale, formatPath, getChunk, getCliContentWatcherLabel, getContentExtension, getContentWatcherLockFilePath, getContentWatcherOwner, getExtensionFromFormat, getFormatFromExtension, getGlobalLimiter, getPathHash, getTaskLimiter, mergeChunks, pLimit, parallelize, parallelizeGlobal, parseContentDeclarationFileName, reconstructFromSingleChunk, reduceObjectFormat, reportRedundantContentWatcher, resolveObjectPromises, resolveRelativePath, runOnce, runParallel, sortAlphabetically, splitTextByLines, startContentWatcher, verifyIdenticObjectFormat, withFileLock };
+export { CLI_CONTENT_WATCHER_ENV_VAR, Queue, acquireContentWatcherLock, assembleJSON, autoDecorateContent, buildComponentFilesList, chunkArray, chunkJSON, claimCliContentWatcher, excludeObjectFormat, formatLocale, formatPath, getChunk, getCliContentWatcherLabel, getContentExtension, getContentWatcherLockFilePath, getContentWatcherOwner, getExtensionFromFormat, getFormatFromExtension, getGlobalLimiter, getPathHash, getTaskLimiter, isDirectoryExcluded, mergeChunks, pLimit, parallelize, parallelizeGlobal, parseContentDeclarationFileName, reconstructFromSingleChunk, reduceObjectFormat, reportRedundantContentWatcher, resolveObjectPromises, resolveRelativePath, runOnce, runParallel, sortAlphabetically, splitTextByLines, startContentWatcher, verifyIdenticObjectFormat, withFileLock };

package/dist/esm/utils/isDirectoryExcluded.mjs

@@ -0,0 +1,35 @@
+import { normalizePath } from "@intlayer/config/utils";
+
+//#region src/utils/isDirectoryExcluded.ts
+/**
+* Extracts the literal directory segments of a directory-shaped exclude
+* pattern (`**\/dist/**` → `dist`, `!**\/.next/**` → `.next`).
+* Returns `undefined` for file-shaped or wildcard patterns (`**\/*.config.*`),
+* which can never exclude a whole directory.
+*/
+const getExcludedDirectorySegments = (excludePattern) => {
+	const segments = normalizePath(excludePattern).replace(/^!/, "").replace(/^(\*\*\/)+/, "").replace(/(\/\*\*)+\/?$/, "");
+	return segments !== "" && !/[*?[\]{}()!]/.test(segments) ? segments : void 0;
+};
+/**
+* Whether a directory path lies inside a directory matched by one of the
+* exclude patterns (e.g. `packages/ds/dist/esm` against `**\/dist/**`).
+*
+* Used to keep explicitly configured directories (`codeDir`, `contentDir`)
+* from being dropped by an exclusion that only matches their ancestors.
+*
+* @example
+* isDirectoryExcluded('ds/dist/esm', ['**\/dist/**']); // true
+* isDirectoryExcluded('src/distance', ['**\/dist/**']); // false
+*/
+const isDirectoryExcluded = (directoryPath, excludePatterns) => {
+	const wrappedPath = `/${normalizePath(directoryPath).replace(/^\/+|\/+$/g, "")}/`;
+	return excludePatterns.some((excludePattern) => {
+		const excludedSegments = getExcludedDirectorySegments(excludePattern);
+		return excludedSegments !== void 0 && wrappedPath.includes(`/${excludedSegments}/`);
+	});
+};
+
+//#endregion
+export { isDirectoryExcluded };
+//# sourceMappingURL=isDirectoryExcluded.mjs.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"isDirectoryExcluded.mjs","names":[],"sources":["../../../src/utils/isDirectoryExcluded.ts"],"sourcesContent":["import { normalizePath } from '@intlayer/config/utils';\n\n/**\n * Extracts the literal directory segments of a directory-shaped exclude\n * pattern (`**\\/dist/**` → `dist`, `!**\\/.next/**` → `.next`).\n * Returns `undefined` for file-shaped or wildcard patterns (`**\\/*.config.*`),\n * which can never exclude a whole directory.\n */\nconst getExcludedDirectorySegments = (\n  excludePattern: string\n): string | undefined => {\n  const segments = normalizePath(excludePattern)\n    .replace(/^!/, '')\n    .replace(/^(\\*\\*\\/)+/, '')\n    .replace(/(\\/\\*\\*)+\\/?$/, '');\n\n  const isLiteral = segments !== '' && !/[*?[\\]{}()!]/.test(segments);\n\n  return isLiteral ? segments : undefined;\n};\n\n/**\n * Whether a directory path lies inside a directory matched by one of the\n * exclude patterns (e.g. `packages/ds/dist/esm` against `**\\/dist/**`).\n *\n * Used to keep explicitly configured directories (`codeDir`, `contentDir`)\n * from being dropped by an exclusion that only matches their ancestors.\n *\n * @example\n * isDirectoryExcluded('ds/dist/esm', ['**\\/dist/**']); // true\n * isDirectoryExcluded('src/distance', ['**\\/dist/**']); // false\n */\nexport const isDirectoryExcluded = (\n  directoryPath: string,\n  excludePatterns: string[]\n): boolean => {\n  const wrappedPath = `/${normalizePath(directoryPath).replace(/^\\/+|\\/+$/g, '')}/`;\n\n  return excludePatterns.some((excludePattern) => {\n    const excludedSegments = getExcludedDirectorySegments(excludePattern);\n\n    return (\n      excludedSegments !== undefined &&\n      wrappedPath.includes(`/${excludedSegments}/`)\n    );\n  });\n};\n"],"mappings":";;;;;;;;;AAQA,MAAM,gCACJ,mBACuB;CACvB,MAAM,WAAW,cAAc,cAAc,CAAC,CAC3C,QAAQ,MAAM,EAAE,CAAC,CACjB,QAAQ,cAAc,EAAE,CAAC,CACzB,QAAQ,iBAAiB,EAAE;CAI9B,OAFkB,aAAa,MAAM,CAAC,eAAe,KAAK,QAAQ,IAE/C,WAAW;AAChC;;;;;;;;;;;;AAaA,MAAa,uBACX,eACA,oBACY;CACZ,MAAM,cAAc,IAAI,cAAc,aAAa,CAAC,CAAC,QAAQ,cAAc,EAAE,EAAE;CAE/E,OAAO,gBAAgB,MAAM,mBAAmB;EAC9C,MAAM,mBAAmB,6BAA6B,cAAc;EAEpE,OACE,qBAAqB,UACrB,YAAY,SAAS,IAAI,iBAAiB,EAAE;CAEhD,CAAC;AACH"}

package/dist/esm/utils/runParallel/pidTree.mjs

@@ -1,6 +1,6 @@
 import { ps } from "./ps.mjs";
 import { wmic } from "./wmic.mjs";
-import * as os$1 from "node:os";
+import * as os from "node:os";
 
 //#region src/utils/runParallel/pidTree.ts
 const platformToMethod = {
@@ -16,7 +16,7 @@ const methodToFn = {
 	ps,
 	wmic
 };
-let platform = os$1.platform();
+let platform = os.platform();
 if (platform.startsWith("win")) platform = "win";
 const method = platformToMethod[platform];
 /**
@@ -24,7 +24,7 @@ const method = platformToMethod[platform];
 */
 const getAll = (callback) => {
 	if (method === void 0) {
-		callback(/* @__PURE__ */ new Error(os$1.platform() + " is not supported yet, please open an issue (https://github.com/simonepri/pidtree)"), void 0);
+		callback(/* @__PURE__ */ new Error(os.platform() + " is not supported yet, please open an issue (https://github.com/simonepri/pidtree)"), void 0);
 		return;
 	}
 	const listFn = methodToFn[method];

package/dist/esm/utils/runParallel/pidTree.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"pidTree.mjs","names":["os"],"sources":["../../../../src/utils/runParallel/pidTree.ts"],"sourcesContent":["import * as os from 'node:os';\nimport { ps } from './ps';\nimport { wmic } from './wmic';\n\ntype Platform =\n  | 'darwin'\n  | 'sunos'\n  | 'freebsd'\n  | 'netbsd'\n  | 'win'\n  | 'linux'\n  | 'aix';\ntype Method = 'ps' | 'wmic';\n\ntype ProcessList = [number, number][]; // [PPID, PID][]\n\ninterface ListOptions {\n  root?: boolean;\n  advanced?: boolean;\n}\n\ntype ProcessInfo = { pid: number; ppid?: number };\ntype ResultType<T extends ListOptions | undefined> = T extends {\n  advanced: true;\n}\n  ? ProcessInfo[]\n  : number[];\n\ntype ProcessListCallback = (err: Error | null, list?: ProcessList) => void;\ntype ListCallback<T extends ListOptions | undefined> = (\n  err: Error | null,\n  list?: ResultType<T>\n) => void;\n\ntype ProcessListFn = (callback: ProcessListCallback) => void;\n\nconst platformToMethod: Record<Platform, Method> = {\n  darwin: 'ps',\n  sunos: 'ps',\n  freebsd: 'ps',\n  netbsd: 'ps',\n  win: 'wmic',\n  linux: 'ps',\n  aix: 'ps',\n};\n\nconst methodToFn: Record<Method, ProcessListFn> = {\n  ps,\n  wmic,\n};\n\nlet platform: string = os.platform();\nif (platform.startsWith('win')) {\n  platform = 'win';\n}\n\nconst method: Method | undefined = platformToMethod[platform as Platform];\n\n/**\n * Gets the list of all the pids of the system.\n */\nconst getAll = (callback: ProcessListCallback): void => {\n  if (method === undefined) {\n    callback(\n      new Error(\n        os.platform() +\n          ' is not supported yet, please open an issue (https://github.com/simonepri/pidtree)'\n      ),\n      undefined\n    );\n    return;\n  }\n\n  const listFn = methodToFn[method];\n  listFn(callback);\n};\n\n/**\n * Get the list of children and grandchildren pids of the given PID.\n * @param PID A PID. If -1 will return all the pids.\n * @param options Optional options object.\n * @param callback Called when the list is ready.\n */\nconst pidtree = <T extends ListOptions | undefined>(\n  PID: number | string,\n  options: T | ListCallback<T> | undefined,\n  callback?: ListCallback<T>\n): void => {\n  let normalizedOptions: ListOptions;\n  let normalizedCallback: ListCallback<T>;\n\n  if (typeof options === 'function') {\n    normalizedCallback = options;\n    normalizedOptions = {};\n  } else {\n    normalizedCallback = callback!;\n    normalizedOptions = typeof options === 'object' ? options : {};\n  }\n\n  const parsedPID = parseInt(String(PID), 10);\n  if (Number.isNaN(parsedPID) || parsedPID < -1) {\n    normalizedCallback(\n      new TypeError('The pid provided is invalid') as Error,\n      undefined\n    );\n    return;\n  }\n\n  getAll((err, processList) => {\n    if (err) {\n      normalizedCallback(err, undefined);\n      return;\n    }\n\n    if (!processList) {\n      normalizedCallback(new Error('Failed to get process list'), undefined);\n      return;\n    }\n\n    // If the user wants the whole list just return it\n    if (parsedPID === -1) {\n      const result = processList.map(([ppid, pid]) =>\n        normalizedOptions.advanced ? { ppid, pid } : pid\n      ) as ResultType<T>;\n\n      normalizedCallback(null, result);\n      return;\n    }\n\n    let root: ProcessInfo | number | undefined;\n    for (let l = 0; l < processList.length; l++) {\n      const proc = processList[l];\n\n      if (!proc) continue;\n      const [ppid, pid] = proc;\n\n      if (pid === parsedPID) {\n        root = normalizedOptions.advanced\n          ? { ppid, pid: parsedPID }\n          : parsedPID;\n        break;\n      }\n\n      if (ppid === parsedPID) {\n        root = normalizedOptions.advanced ? { pid: parsedPID } : parsedPID; // Special pids like 0 on *nix\n      }\n    }\n\n    if (root === undefined) {\n      normalizedCallback(new Error('No matching pid found'), undefined);\n      return;\n    }\n\n    // Build the adjacency Hash Map (pid -> [children of pid])\n    const tree: Record<number, number[]> = {};\n    const listCopy = [...processList];\n    while (listCopy.length > 0) {\n      const element = listCopy.pop();\n\n      if (!element) continue;\n      const ppid = element[0];\n      const pid = element[1];\n      const children = tree[ppid];\n\n      if (children) {\n        children.push(pid);\n      } else {\n        tree[ppid] = [pid];\n      }\n    }\n\n    // Starting by the PID provided by the user, traverse the tree using the\n    // adjacency Hash Map until the whole subtree is visited.\n    // Each pid encountered while visiting is added to the pids array.\n    let idx = 0;\n    const pids: (ProcessInfo | number)[] = [root];\n    while (idx < pids.length) {\n      const curpid = normalizedOptions.advanced\n        ? (pids[idx++] as ProcessInfo).pid\n        : (pids[idx++] as number);\n      const children = tree[curpid];\n\n      if (!children) continue;\n      const length = children.length;\n      for (let j = 0; j < length; j++) {\n        const childPid = children[j];\n\n        if (childPid === undefined) continue;\n\n        pids.push(\n          normalizedOptions.advanced\n            ? { ppid: curpid, pid: childPid }\n            : childPid\n        );\n      }\n\n      delete tree[curpid];\n    }\n\n    if (!normalizedOptions.root) {\n      pids.shift(); // Remove root\n    }\n\n    normalizedCallback(null, pids as ResultType<T>);\n  });\n};\n\nconst pify = <T extends ListOptions | undefined>(\n  fn: typeof pidtree,\n  arg1: number | string,\n  arg2: T | undefined\n): Promise<ResultType<T>> => {\n  return new Promise((resolve, reject) => {\n    fn(arg1, arg2, (err, data) => {\n      if (err) return reject(err);\n      if (data === undefined) {\n        return reject(new Error('No data returned'));\n      }\n      resolve(data);\n    });\n  });\n};\n\n// Node versions prior to 4.0.0 do not define have `startsWith`.\n/* istanbul ignore if */\nif (!String.prototype.startsWith) {\n  String.prototype.startsWith = function (suffix: string): boolean {\n    return this.substring(0, suffix.length) === suffix;\n  };\n}\n\n/**\n * Get the list of children pids of the given pid.\n * @param pid A PID. If -1 will return all the pids.\n * @param options Optional options object.\n * @param callback Called when the list is ready. If not provided a promise is returned instead.\n * @returns Only when the callback is not provided.\n */\nexport const list = <T extends ListOptions | undefined>(\n  pid: number | string,\n  options?: T | ListCallback<T>,\n  callback?: ListCallback<T>\n): Promise<ResultType<T>> | undefined => {\n  if (typeof options === 'function') {\n    pidtree(pid, undefined, options);\n    return;\n  }\n\n  if (typeof callback === 'function') {\n    pidtree(pid, options, callback);\n    return;\n  }\n\n  return pify(pidtree, pid, options);\n};\n"],"mappings":";;;;;AAoCA,MAAM,mBAA6C;CACjD,QAAQ;CACR,OAAO;CACP,SAAS;CACT,QAAQ;CACR,KAAK;CACL,OAAO;CACP,KAAK;AACP;AAEA,MAAM,aAA4C;CAChD;CACA;AACF;AAEA,IAAI,WAAmBA,KAAG,SAAS;AACnC,IAAI,SAAS,WAAW,KAAK,GAC3B,WAAW;AAGb,MAAM,SAA6B,iBAAiB;;;;AAKpD,MAAM,UAAU,aAAwC;CACtD,IAAI,WAAW,QAAW;EACxB,yBACE,IAAI,MACFA,KAAG,SAAS,IACV,oFACJ,GACA,MACF;EACA;CACF;CAEA,MAAM,SAAS,WAAW;CAC1B,OAAO,QAAQ;AACjB;;;;;;;AAQA,MAAM,WACJ,KACA,SACA,aACS;CACT,IAAI;CACJ,IAAI;CAEJ,IAAI,OAAO,YAAY,YAAY;EACjC,qBAAqB;EACrB,oBAAoB,CAAC;CACvB,OAAO;EACL,qBAAqB;EACrB,oBAAoB,OAAO,YAAY,WAAW,UAAU,CAAC;CAC/D;CAEA,MAAM,YAAY,SAAS,OAAO,GAAG,GAAG,EAAE;CAC1C,IAAI,OAAO,MAAM,SAAS,KAAK,YAAY,IAAI;EAC7C,mCACE,IAAI,UAAU,6BAA6B,GAC3C,MACF;EACA;CACF;CAEA,QAAQ,KAAK,gBAAgB;EAC3B,IAAI,KAAK;GACP,mBAAmB,KAAK,MAAS;GACjC;EACF;EAEA,IAAI,CAAC,aAAa;GAChB,mCAAmB,IAAI,MAAM,4BAA4B,GAAG,MAAS;GACrE;EACF;EAGA,IAAI,cAAc,IAAI;GACpB,MAAM,SAAS,YAAY,KAAK,CAAC,MAAM,SACrC,kBAAkB,WAAW;IAAE;IAAM;GAAI,IAAI,GAC/C;GAEA,mBAAmB,MAAM,MAAM;GAC/B;EACF;EAEA,IAAI;EACJ,KAAK,IAAI,IAAI,GAAG,IAAI,YAAY,QAAQ,KAAK;GAC3C,MAAM,OAAO,YAAY;GAEzB,IAAI,CAAC,MAAM;GACX,MAAM,CAAC,MAAM,OAAO;GAEpB,IAAI,QAAQ,WAAW;IACrB,OAAO,kBAAkB,WACrB;KAAE;KAAM,KAAK;IAAU,IACvB;IACJ;GACF;GAEA,IAAI,SAAS,WACX,OAAO,kBAAkB,WAAW,EAAE,KAAK,UAAU,IAAI;EAE7D;EAEA,IAAI,SAAS,QAAW;GACtB,mCAAmB,IAAI,MAAM,uBAAuB,GAAG,MAAS;GAChE;EACF;EAGA,MAAM,OAAiC,CAAC;EACxC,MAAM,WAAW,CAAC,GAAG,WAAW;EAChC,OAAO,SAAS,SAAS,GAAG;GAC1B,MAAM,UAAU,SAAS,IAAI;GAE7B,IAAI,CAAC,SAAS;GACd,MAAM,OAAO,QAAQ;GACrB,MAAM,MAAM,QAAQ;GACpB,MAAM,WAAW,KAAK;GAEtB,IAAI,UACF,SAAS,KAAK,GAAG;QAEjB,KAAK,QAAQ,CAAC,GAAG;EAErB;EAKA,IAAI,MAAM;EACV,MAAM,OAAiC,CAAC,IAAI;EAC5C,OAAO,MAAM,KAAK,QAAQ;GACxB,MAAM,SAAS,kBAAkB,WAC5B,KAAK,MAAM,CAAiB,MAC5B,KAAK;GACV,MAAM,WAAW,KAAK;GAEtB,IAAI,CAAC,UAAU;GACf,MAAM,SAAS,SAAS;GACxB,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAAK;IAC/B,MAAM,WAAW,SAAS;IAE1B,IAAI,aAAa,QAAW;IAE5B,KAAK,KACH,kBAAkB,WACd;KAAE,MAAM;KAAQ,KAAK;IAAS,IAC9B,QACN;GACF;GAEA,OAAO,KAAK;EACd;EAEA,IAAI,CAAC,kBAAkB,MACrB,KAAK,MAAM;EAGb,mBAAmB,MAAM,IAAqB;CAChD,CAAC;AACH;AAEA,MAAM,QACJ,IACA,MACA,SAC2B;CAC3B,OAAO,IAAI,SAAS,SAAS,WAAW;EACtC,GAAG,MAAM,OAAO,KAAK,SAAS;GAC5B,IAAI,KAAK,OAAO,OAAO,GAAG;GAC1B,IAAI,SAAS,QACX,OAAO,uBAAO,IAAI,MAAM,kBAAkB,CAAC;GAE7C,QAAQ,IAAI;EACd,CAAC;CACH,CAAC;AACH;;AAIA,IAAI,CAAC,OAAO,UAAU,YACpB,OAAO,UAAU,aAAa,SAAU,QAAyB;CAC/D,OAAO,KAAK,UAAU,GAAG,OAAO,MAAM,MAAM;AAC9C;;;;;;;;AAUF,MAAa,QACX,KACA,SACA,aACuC;CACvC,IAAI,OAAO,YAAY,YAAY;EACjC,QAAQ,KAAK,QAAW,OAAO;EAC/B;CACF;CAEA,IAAI,OAAO,aAAa,YAAY;EAClC,QAAQ,KAAK,SAAS,QAAQ;EAC9B;CACF;CAEA,OAAO,KAAK,SAAS,KAAK,OAAO;AACnC"}
+{"version":3,"file":"pidTree.mjs","names":[],"sources":["../../../../src/utils/runParallel/pidTree.ts"],"sourcesContent":["import * as os from 'node:os';\nimport { ps } from './ps';\nimport { wmic } from './wmic';\n\ntype Platform =\n  | 'darwin'\n  | 'sunos'\n  | 'freebsd'\n  | 'netbsd'\n  | 'win'\n  | 'linux'\n  | 'aix';\ntype Method = 'ps' | 'wmic';\n\ntype ProcessList = [number, number][]; // [PPID, PID][]\n\ninterface ListOptions {\n  root?: boolean;\n  advanced?: boolean;\n}\n\ntype ProcessInfo = { pid: number; ppid?: number };\ntype ResultType<T extends ListOptions | undefined> = T extends {\n  advanced: true;\n}\n  ? ProcessInfo[]\n  : number[];\n\ntype ProcessListCallback = (err: Error | null, list?: ProcessList) => void;\ntype ListCallback<T extends ListOptions | undefined> = (\n  err: Error | null,\n  list?: ResultType<T>\n) => void;\n\ntype ProcessListFn = (callback: ProcessListCallback) => void;\n\nconst platformToMethod: Record<Platform, Method> = {\n  darwin: 'ps',\n  sunos: 'ps',\n  freebsd: 'ps',\n  netbsd: 'ps',\n  win: 'wmic',\n  linux: 'ps',\n  aix: 'ps',\n};\n\nconst methodToFn: Record<Method, ProcessListFn> = {\n  ps,\n  wmic,\n};\n\nlet platform: string = os.platform();\nif (platform.startsWith('win')) {\n  platform = 'win';\n}\n\nconst method: Method | undefined = platformToMethod[platform as Platform];\n\n/**\n * Gets the list of all the pids of the system.\n */\nconst getAll = (callback: ProcessListCallback): void => {\n  if (method === undefined) {\n    callback(\n      new Error(\n        os.platform() +\n          ' is not supported yet, please open an issue (https://github.com/simonepri/pidtree)'\n      ),\n      undefined\n    );\n    return;\n  }\n\n  const listFn = methodToFn[method];\n  listFn(callback);\n};\n\n/**\n * Get the list of children and grandchildren pids of the given PID.\n * @param PID A PID. If -1 will return all the pids.\n * @param options Optional options object.\n * @param callback Called when the list is ready.\n */\nconst pidtree = <T extends ListOptions | undefined>(\n  PID: number | string,\n  options: T | ListCallback<T> | undefined,\n  callback?: ListCallback<T>\n): void => {\n  let normalizedOptions: ListOptions;\n  let normalizedCallback: ListCallback<T>;\n\n  if (typeof options === 'function') {\n    normalizedCallback = options;\n    normalizedOptions = {};\n  } else {\n    normalizedCallback = callback!;\n    normalizedOptions = typeof options === 'object' ? options : {};\n  }\n\n  const parsedPID = parseInt(String(PID), 10);\n  if (Number.isNaN(parsedPID) || parsedPID < -1) {\n    normalizedCallback(\n      new TypeError('The pid provided is invalid') as Error,\n      undefined\n    );\n    return;\n  }\n\n  getAll((err, processList) => {\n    if (err) {\n      normalizedCallback(err, undefined);\n      return;\n    }\n\n    if (!processList) {\n      normalizedCallback(new Error('Failed to get process list'), undefined);\n      return;\n    }\n\n    // If the user wants the whole list just return it\n    if (parsedPID === -1) {\n      const result = processList.map(([ppid, pid]) =>\n        normalizedOptions.advanced ? { ppid, pid } : pid\n      ) as ResultType<T>;\n\n      normalizedCallback(null, result);\n      return;\n    }\n\n    let root: ProcessInfo | number | undefined;\n    for (let l = 0; l < processList.length; l++) {\n      const proc = processList[l];\n\n      if (!proc) continue;\n      const [ppid, pid] = proc;\n\n      if (pid === parsedPID) {\n        root = normalizedOptions.advanced\n          ? { ppid, pid: parsedPID }\n          : parsedPID;\n        break;\n      }\n\n      if (ppid === parsedPID) {\n        root = normalizedOptions.advanced ? { pid: parsedPID } : parsedPID; // Special pids like 0 on *nix\n      }\n    }\n\n    if (root === undefined) {\n      normalizedCallback(new Error('No matching pid found'), undefined);\n      return;\n    }\n\n    // Build the adjacency Hash Map (pid -> [children of pid])\n    const tree: Record<number, number[]> = {};\n    const listCopy = [...processList];\n    while (listCopy.length > 0) {\n      const element = listCopy.pop();\n\n      if (!element) continue;\n      const ppid = element[0];\n      const pid = element[1];\n      const children = tree[ppid];\n\n      if (children) {\n        children.push(pid);\n      } else {\n        tree[ppid] = [pid];\n      }\n    }\n\n    // Starting by the PID provided by the user, traverse the tree using the\n    // adjacency Hash Map until the whole subtree is visited.\n    // Each pid encountered while visiting is added to the pids array.\n    let idx = 0;\n    const pids: (ProcessInfo | number)[] = [root];\n    while (idx < pids.length) {\n      const curpid = normalizedOptions.advanced\n        ? (pids[idx++] as ProcessInfo).pid\n        : (pids[idx++] as number);\n      const children = tree[curpid];\n\n      if (!children) continue;\n      const length = children.length;\n      for (let j = 0; j < length; j++) {\n        const childPid = children[j];\n\n        if (childPid === undefined) continue;\n\n        pids.push(\n          normalizedOptions.advanced\n            ? { ppid: curpid, pid: childPid }\n            : childPid\n        );\n      }\n\n      delete tree[curpid];\n    }\n\n    if (!normalizedOptions.root) {\n      pids.shift(); // Remove root\n    }\n\n    normalizedCallback(null, pids as ResultType<T>);\n  });\n};\n\nconst pify = <T extends ListOptions | undefined>(\n  fn: typeof pidtree,\n  arg1: number | string,\n  arg2: T | undefined\n): Promise<ResultType<T>> => {\n  return new Promise((resolve, reject) => {\n    fn(arg1, arg2, (err, data) => {\n      if (err) return reject(err);\n      if (data === undefined) {\n        return reject(new Error('No data returned'));\n      }\n      resolve(data);\n    });\n  });\n};\n\n// Node versions prior to 4.0.0 do not define have `startsWith`.\n/* istanbul ignore if */\nif (!String.prototype.startsWith) {\n  String.prototype.startsWith = function (suffix: string): boolean {\n    return this.substring(0, suffix.length) === suffix;\n  };\n}\n\n/**\n * Get the list of children pids of the given pid.\n * @param pid A PID. If -1 will return all the pids.\n * @param options Optional options object.\n * @param callback Called when the list is ready. If not provided a promise is returned instead.\n * @returns Only when the callback is not provided.\n */\nexport const list = <T extends ListOptions | undefined>(\n  pid: number | string,\n  options?: T | ListCallback<T>,\n  callback?: ListCallback<T>\n): Promise<ResultType<T>> | undefined => {\n  if (typeof options === 'function') {\n    pidtree(pid, undefined, options);\n    return;\n  }\n\n  if (typeof callback === 'function') {\n    pidtree(pid, options, callback);\n    return;\n  }\n\n  return pify(pidtree, pid, options);\n};\n"],"mappings":";;;;;AAoCA,MAAM,mBAA6C;CACjD,QAAQ;CACR,OAAO;CACP,SAAS;CACT,QAAQ;CACR,KAAK;CACL,OAAO;CACP,KAAK;AACP;AAEA,MAAM,aAA4C;CAChD;CACA;AACF;AAEA,IAAI,WAAmB,GAAG,SAAS;AACnC,IAAI,SAAS,WAAW,KAAK,GAC3B,WAAW;AAGb,MAAM,SAA6B,iBAAiB;;;;AAKpD,MAAM,UAAU,aAAwC;CACtD,IAAI,WAAW,QAAW;EACxB,yBACE,IAAI,MACF,GAAG,SAAS,IACV,oFACJ,GACA,MACF;EACA;CACF;CAEA,MAAM,SAAS,WAAW;CAC1B,OAAO,QAAQ;AACjB;;;;;;;AAQA,MAAM,WACJ,KACA,SACA,aACS;CACT,IAAI;CACJ,IAAI;CAEJ,IAAI,OAAO,YAAY,YAAY;EACjC,qBAAqB;EACrB,oBAAoB,CAAC;CACvB,OAAO;EACL,qBAAqB;EACrB,oBAAoB,OAAO,YAAY,WAAW,UAAU,CAAC;CAC/D;CAEA,MAAM,YAAY,SAAS,OAAO,GAAG,GAAG,EAAE;CAC1C,IAAI,OAAO,MAAM,SAAS,KAAK,YAAY,IAAI;EAC7C,mCACE,IAAI,UAAU,6BAA6B,GAC3C,MACF;EACA;CACF;CAEA,QAAQ,KAAK,gBAAgB;EAC3B,IAAI,KAAK;GACP,mBAAmB,KAAK,MAAS;GACjC;EACF;EAEA,IAAI,CAAC,aAAa;GAChB,mCAAmB,IAAI,MAAM,4BAA4B,GAAG,MAAS;GACrE;EACF;EAGA,IAAI,cAAc,IAAI;GACpB,MAAM,SAAS,YAAY,KAAK,CAAC,MAAM,SACrC,kBAAkB,WAAW;IAAE;IAAM;GAAI,IAAI,GAC/C;GAEA,mBAAmB,MAAM,MAAM;GAC/B;EACF;EAEA,IAAI;EACJ,KAAK,IAAI,IAAI,GAAG,IAAI,YAAY,QAAQ,KAAK;GAC3C,MAAM,OAAO,YAAY;GAEzB,IAAI,CAAC,MAAM;GACX,MAAM,CAAC,MAAM,OAAO;GAEpB,IAAI,QAAQ,WAAW;IACrB,OAAO,kBAAkB,WACrB;KAAE;KAAM,KAAK;IAAU,IACvB;IACJ;GACF;GAEA,IAAI,SAAS,WACX,OAAO,kBAAkB,WAAW,EAAE,KAAK,UAAU,IAAI;EAE7D;EAEA,IAAI,SAAS,QAAW;GACtB,mCAAmB,IAAI,MAAM,uBAAuB,GAAG,MAAS;GAChE;EACF;EAGA,MAAM,OAAiC,CAAC;EACxC,MAAM,WAAW,CAAC,GAAG,WAAW;EAChC,OAAO,SAAS,SAAS,GAAG;GAC1B,MAAM,UAAU,SAAS,IAAI;GAE7B,IAAI,CAAC,SAAS;GACd,MAAM,OAAO,QAAQ;GACrB,MAAM,MAAM,QAAQ;GACpB,MAAM,WAAW,KAAK;GAEtB,IAAI,UACF,SAAS,KAAK,GAAG;QAEjB,KAAK,QAAQ,CAAC,GAAG;EAErB;EAKA,IAAI,MAAM;EACV,MAAM,OAAiC,CAAC,IAAI;EAC5C,OAAO,MAAM,KAAK,QAAQ;GACxB,MAAM,SAAS,kBAAkB,WAC5B,KAAK,MAAM,CAAiB,MAC5B,KAAK;GACV,MAAM,WAAW,KAAK;GAEtB,IAAI,CAAC,UAAU;GACf,MAAM,SAAS,SAAS;GACxB,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAAK;IAC/B,MAAM,WAAW,SAAS;IAE1B,IAAI,aAAa,QAAW;IAE5B,KAAK,KACH,kBAAkB,WACd;KAAE,MAAM;KAAQ,KAAK;IAAS,IAC9B,QACN;GACF;GAEA,OAAO,KAAK;EACd;EAEA,IAAI,CAAC,kBAAkB,MACrB,KAAK,MAAM;EAGb,mBAAmB,MAAM,IAAqB;CAChD,CAAC;AACH;AAEA,MAAM,QACJ,IACA,MACA,SAC2B;CAC3B,OAAO,IAAI,SAAS,SAAS,WAAW;EACtC,GAAG,MAAM,OAAO,KAAK,SAAS;GAC5B,IAAI,KAAK,OAAO,OAAO,GAAG;GAC1B,IAAI,SAAS,QACX,OAAO,uBAAO,IAAI,MAAM,kBAAkB,CAAC;GAE7C,QAAQ,IAAI;EACd,CAAC;CACH,CAAC;AACH;;AAIA,IAAI,CAAC,OAAO,UAAU,YACpB,OAAO,UAAU,aAAa,SAAU,QAAyB;CAC/D,OAAO,KAAK,UAAU,GAAG,OAAO,MAAM,MAAM;AAC9C;;;;;;;;AAUF,MAAa,QACX,KACA,SACA,aACuC;CACvC,IAAI,OAAO,YAAY,YAAY;EACjC,QAAQ,KAAK,QAAW,OAAO;EAC/B;CACF;CAEA,IAAI,OAAO,aAAa,YAAY;EAClC,QAAQ,KAAK,SAAS,QAAQ;EAC9B;CACF;CAEA,OAAO,KAAK,SAAS,KAAK,OAAO;AACnC"}

package/dist/esm/utils/runParallel/ps.mjs

@@ -1,5 +1,5 @@
 import { run } from "./bin.mjs";
-import * as os$1 from "node:os";
+import * as os from "node:os";
 
 //#region src/utils/runParallel/ps.ts
 /**
@@ -25,7 +25,7 @@ const ps = (callback) => {
 			return;
 		}
 		try {
-			const lines = stdout.split(os$1.EOL);
+			const lines = stdout.split(os.EOL);
 			const list = [];
 			for (let i = 1; i < lines.length; i++) {
 				const line = lines[i];

package/dist/esm/utils/runParallel/ps.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"ps.mjs","names":["os"],"sources":["../../../../src/utils/runParallel/ps.ts"],"sourcesContent":["import * as os from 'node:os';\nimport { run } from './bin';\n\ntype ProcessList = [number, number][]; // [PPID, PID][]\ntype ProcessListCallback = (err: Error | null, list?: ProcessList) => void;\n\n/**\n * Gets the list of all the pids of the system through the ps command.\n * @param callback Callback function with error and process list.\n */\nexport const ps = (callback: ProcessListCallback): void => {\n  const args = ['-A', '-o', 'ppid,pid'];\n\n  run('ps', args, (err, stdout, code) => {\n    if (err) {\n      callback(err);\n      return;\n    }\n    if (code !== 0) {\n      callback(new Error(`pidtree ps command exited with code ${code}`));\n      return;\n    }\n\n    // Example of stdout\n    //\n    // PPID   PID\n    //    1   430\n    //  430   432\n    //    1   727\n    //    1  7166\n\n    if (!stdout) {\n      callback(new Error('No stdout received from ps command'));\n      return;\n    }\n\n    try {\n      const lines = stdout.split(os.EOL);\n\n      const list: ProcessList = [];\n      for (let i = 1; i < lines.length; i++) {\n        const line = lines[i];\n\n        if (!line) continue;\n\n        const trimmed = line.trim();\n\n        if (!trimmed) continue;\n\n        const parts = trimmed.split(/\\s+/);\n        const p0 = parts[0];\n        const p1 = parts[1];\n\n        if (!p0 || !p1) continue;\n\n        const ppid = parseInt(p0, 10); // PPID\n        const pid = parseInt(p1, 10); // PID\n\n        if (!Number.isNaN(ppid) && !Number.isNaN(pid)) {\n          list.push([ppid, pid]);\n        }\n      }\n\n      callback(null, list);\n    } catch (error) {\n      callback(error instanceof Error ? error : new Error(String(error)));\n    }\n  });\n};\n"],"mappings":";;;;;;;;AAUA,MAAa,MAAM,aAAwC;CAGzD,IAAI,MAAM;EAFI;EAAM;EAAM;CAEb,IAAI,KAAK,QAAQ,SAAS;EACrC,IAAI,KAAK;GACP,SAAS,GAAG;GACZ;EACF;EACA,IAAI,SAAS,GAAG;GACd,yBAAS,IAAI,MAAM,uCAAuC,MAAM,CAAC;GACjE;EACF;EAUA,IAAI,CAAC,QAAQ;GACX,yBAAS,IAAI,MAAM,oCAAoC,CAAC;GACxD;EACF;EAEA,IAAI;GACF,MAAM,QAAQ,OAAO,MAAMA,KAAG,GAAG;GAEjC,MAAM,OAAoB,CAAC;GAC3B,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;IACrC,MAAM,OAAO,MAAM;IAEnB,IAAI,CAAC,MAAM;IAEX,MAAM,UAAU,KAAK,KAAK;IAE1B,IAAI,CAAC,SAAS;IAEd,MAAM,QAAQ,QAAQ,MAAM,KAAK;IACjC,MAAM,KAAK,MAAM;IACjB,MAAM,KAAK,MAAM;IAEjB,IAAI,CAAC,MAAM,CAAC,IAAI;IAEhB,MAAM,OAAO,SAAS,IAAI,EAAE;IAC5B,MAAM,MAAM,SAAS,IAAI,EAAE;IAE3B,IAAI,CAAC,OAAO,MAAM,IAAI,KAAK,CAAC,OAAO,MAAM,GAAG,GAC1C,KAAK,KAAK,CAAC,MAAM,GAAG,CAAC;GAEzB;GAEA,SAAS,MAAM,IAAI;EACrB,SAAS,OAAO;GACd,SAAS,iBAAiB,QAAQ,QAAQ,IAAI,MAAM,OAAO,KAAK,CAAC,CAAC;EACpE;CACF,CAAC;AACH"}
+{"version":3,"file":"ps.mjs","names":[],"sources":["../../../../src/utils/runParallel/ps.ts"],"sourcesContent":["import * as os from 'node:os';\nimport { run } from './bin';\n\ntype ProcessList = [number, number][]; // [PPID, PID][]\ntype ProcessListCallback = (err: Error | null, list?: ProcessList) => void;\n\n/**\n * Gets the list of all the pids of the system through the ps command.\n * @param callback Callback function with error and process list.\n */\nexport const ps = (callback: ProcessListCallback): void => {\n  const args = ['-A', '-o', 'ppid,pid'];\n\n  run('ps', args, (err, stdout, code) => {\n    if (err) {\n      callback(err);\n      return;\n    }\n    if (code !== 0) {\n      callback(new Error(`pidtree ps command exited with code ${code}`));\n      return;\n    }\n\n    // Example of stdout\n    //\n    // PPID   PID\n    //    1   430\n    //  430   432\n    //    1   727\n    //    1  7166\n\n    if (!stdout) {\n      callback(new Error('No stdout received from ps command'));\n      return;\n    }\n\n    try {\n      const lines = stdout.split(os.EOL);\n\n      const list: ProcessList = [];\n      for (let i = 1; i < lines.length; i++) {\n        const line = lines[i];\n\n        if (!line) continue;\n\n        const trimmed = line.trim();\n\n        if (!trimmed) continue;\n\n        const parts = trimmed.split(/\\s+/);\n        const p0 = parts[0];\n        const p1 = parts[1];\n\n        if (!p0 || !p1) continue;\n\n        const ppid = parseInt(p0, 10); // PPID\n        const pid = parseInt(p1, 10); // PID\n\n        if (!Number.isNaN(ppid) && !Number.isNaN(pid)) {\n          list.push([ppid, pid]);\n        }\n      }\n\n      callback(null, list);\n    } catch (error) {\n      callback(error instanceof Error ? error : new Error(String(error)));\n    }\n  });\n};\n"],"mappings":";;;;;;;;AAUA,MAAa,MAAM,aAAwC;CAGzD,IAAI,MAAM;EAFI;EAAM;EAAM;CAEb,IAAI,KAAK,QAAQ,SAAS;EACrC,IAAI,KAAK;GACP,SAAS,GAAG;GACZ;EACF;EACA,IAAI,SAAS,GAAG;GACd,yBAAS,IAAI,MAAM,uCAAuC,MAAM,CAAC;GACjE;EACF;EAUA,IAAI,CAAC,QAAQ;GACX,yBAAS,IAAI,MAAM,oCAAoC,CAAC;GACxD;EACF;EAEA,IAAI;GACF,MAAM,QAAQ,OAAO,MAAM,GAAG,GAAG;GAEjC,MAAM,OAAoB,CAAC;GAC3B,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;IACrC,MAAM,OAAO,MAAM;IAEnB,IAAI,CAAC,MAAM;IAEX,MAAM,UAAU,KAAK,KAAK;IAE1B,IAAI,CAAC,SAAS;IAEd,MAAM,QAAQ,QAAQ,MAAM,KAAK;IACjC,MAAM,KAAK,MAAM;IACjB,MAAM,KAAK,MAAM;IAEjB,IAAI,CAAC,MAAM,CAAC,IAAI;IAEhB,MAAM,OAAO,SAAS,IAAI,EAAE;IAC5B,MAAM,MAAM,SAAS,IAAI,EAAE;IAE3B,IAAI,CAAC,OAAO,MAAM,IAAI,KAAK,CAAC,OAAO,MAAM,GAAG,GAC1C,KAAK,KAAK,CAAC,MAAM,GAAG,CAAC;GAEzB;GAEA,SAAS,MAAM,IAAI;EACrB,SAAS,OAAO;GACd,SAAS,iBAAiB,QAAQ,QAAQ,IAAI,MAAM,OAAO,KAAK,CAAC,CAAC;EACpE;CACF,CAAC;AACH"}

package/dist/esm/utils/runParallel/wmic.mjs

@@ -1,5 +1,5 @@
 import { run } from "./bin.mjs";
-import * as os$1 from "node:os";
+import * as os from "node:os";
 
 //#region src/utils/runParallel/wmic.ts
 /**
@@ -28,7 +28,7 @@ const wmic = (callback) => {
 			return;
 		}
 		try {
-			const lines = stdout.split(os$1.EOL);
+			const lines = stdout.split(os.EOL);
 			const list = [];
 			for (let i = 1; i < lines.length; i++) {
 				const line = lines[i];

package/dist/esm/utils/runParallel/wmic.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"wmic.mjs","names":["os"],"sources":["../../../../src/utils/runParallel/wmic.ts"],"sourcesContent":["import type { SpawnOptions } from 'node:child_process';\nimport * as os from 'node:os';\nimport { run } from './bin';\n\ntype ProcessList = [number, number][]; // [PPID, PID][]\ntype ProcessListCallback = (err: Error | null, list?: ProcessList) => void;\n\n/**\n * Gets the list of all the pids of the system through the wmic command.\n * @param callback Callback function with error and process list.\n */\nexport const wmic = (callback: ProcessListCallback): void => {\n  const args = ['PROCESS', 'get', 'ParentProcessId,ProcessId'];\n  const options: SpawnOptions = {\n    windowsHide: true,\n    windowsVerbatimArguments: true,\n  };\n  run('wmic', args, options, (err, stdout, code) => {\n    if (err) {\n      callback(err);\n      return;\n    }\n\n    if (code !== 0) {\n      callback(new Error(`pidtree wmic command exited with code ${code}`));\n      return;\n    }\n\n    // Example of stdout\n    //\n    // ParentProcessId  ProcessId\n    // 0                777\n\n    if (!stdout) {\n      callback(new Error('No stdout received from wmic command'));\n      return;\n    }\n\n    try {\n      const lines = stdout.split(os.EOL);\n\n      const list: ProcessList = [];\n      for (let i = 1; i < lines.length; i++) {\n        const line = lines[i];\n\n        if (!line) continue;\n        const trimmed = line.trim();\n\n        if (!trimmed) continue;\n\n        const parts = trimmed.split(/\\s+/);\n        const p0 = parts[0];\n        const p1 = parts[1];\n\n        if (!p0 || !p1) continue;\n\n        const ppid = parseInt(p0, 10); // PPID\n        const pid = parseInt(p1, 10); // PID\n\n        if (!Number.isNaN(ppid) && !Number.isNaN(pid)) {\n          list.push([ppid, pid]);\n        }\n      }\n\n      callback(null, list);\n    } catch (error) {\n      callback(error instanceof Error ? error : new Error(String(error)));\n    }\n  });\n};\n"],"mappings":";;;;;;;;AAWA,MAAa,QAAQ,aAAwC;CAM3D,IAAI,QAAQ;EALE;EAAW;EAAO;CAKjB,GAAG;EAHhB,aAAa;EACb,0BAA0B;CAEJ,IAAI,KAAK,QAAQ,SAAS;EAChD,IAAI,KAAK;GACP,SAAS,GAAG;GACZ;EACF;EAEA,IAAI,SAAS,GAAG;GACd,yBAAS,IAAI,MAAM,yCAAyC,MAAM,CAAC;GACnE;EACF;EAOA,IAAI,CAAC,QAAQ;GACX,yBAAS,IAAI,MAAM,sCAAsC,CAAC;GAC1D;EACF;EAEA,IAAI;GACF,MAAM,QAAQ,OAAO,MAAMA,KAAG,GAAG;GAEjC,MAAM,OAAoB,CAAC;GAC3B,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;IACrC,MAAM,OAAO,MAAM;IAEnB,IAAI,CAAC,MAAM;IACX,MAAM,UAAU,KAAK,KAAK;IAE1B,IAAI,CAAC,SAAS;IAEd,MAAM,QAAQ,QAAQ,MAAM,KAAK;IACjC,MAAM,KAAK,MAAM;IACjB,MAAM,KAAK,MAAM;IAEjB,IAAI,CAAC,MAAM,CAAC,IAAI;IAEhB,MAAM,OAAO,SAAS,IAAI,EAAE;IAC5B,MAAM,MAAM,SAAS,IAAI,EAAE;IAE3B,IAAI,CAAC,OAAO,MAAM,IAAI,KAAK,CAAC,OAAO,MAAM,GAAG,GAC1C,KAAK,KAAK,CAAC,MAAM,GAAG,CAAC;GAEzB;GAEA,SAAS,MAAM,IAAI;EACrB,SAAS,OAAO;GACd,SAAS,iBAAiB,QAAQ,QAAQ,IAAI,MAAM,OAAO,KAAK,CAAC,CAAC;EACpE;CACF,CAAC;AACH"}
+{"version":3,"file":"wmic.mjs","names":[],"sources":["../../../../src/utils/runParallel/wmic.ts"],"sourcesContent":["import type { SpawnOptions } from 'node:child_process';\nimport * as os from 'node:os';\nimport { run } from './bin';\n\ntype ProcessList = [number, number][]; // [PPID, PID][]\ntype ProcessListCallback = (err: Error | null, list?: ProcessList) => void;\n\n/**\n * Gets the list of all the pids of the system through the wmic command.\n * @param callback Callback function with error and process list.\n */\nexport const wmic = (callback: ProcessListCallback): void => {\n  const args = ['PROCESS', 'get', 'ParentProcessId,ProcessId'];\n  const options: SpawnOptions = {\n    windowsHide: true,\n    windowsVerbatimArguments: true,\n  };\n  run('wmic', args, options, (err, stdout, code) => {\n    if (err) {\n      callback(err);\n      return;\n    }\n\n    if (code !== 0) {\n      callback(new Error(`pidtree wmic command exited with code ${code}`));\n      return;\n    }\n\n    // Example of stdout\n    //\n    // ParentProcessId  ProcessId\n    // 0                777\n\n    if (!stdout) {\n      callback(new Error('No stdout received from wmic command'));\n      return;\n    }\n\n    try {\n      const lines = stdout.split(os.EOL);\n\n      const list: ProcessList = [];\n      for (let i = 1; i < lines.length; i++) {\n        const line = lines[i];\n\n        if (!line) continue;\n        const trimmed = line.trim();\n\n        if (!trimmed) continue;\n\n        const parts = trimmed.split(/\\s+/);\n        const p0 = parts[0];\n        const p1 = parts[1];\n\n        if (!p0 || !p1) continue;\n\n        const ppid = parseInt(p0, 10); // PPID\n        const pid = parseInt(p1, 10); // PID\n\n        if (!Number.isNaN(ppid) && !Number.isNaN(pid)) {\n          list.push([ppid, pid]);\n        }\n      }\n\n      callback(null, list);\n    } catch (error) {\n      callback(error instanceof Error ? error : new Error(String(error)));\n    }\n  });\n};\n"],"mappings":";;;;;;;;AAWA,MAAa,QAAQ,aAAwC;CAM3D,IAAI,QAAQ;EALE;EAAW;EAAO;CAKjB,GAAG;EAHhB,aAAa;EACb,0BAA0B;CAEJ,IAAI,KAAK,QAAQ,SAAS;EAChD,IAAI,KAAK;GACP,SAAS,GAAG;GACZ;EACF;EAEA,IAAI,SAAS,GAAG;GACd,yBAAS,IAAI,MAAM,yCAAyC,MAAM,CAAC;GACnE;EACF;EAOA,IAAI,CAAC,QAAQ;GACX,yBAAS,IAAI,MAAM,sCAAsC,CAAC;GAC1D;EACF;EAEA,IAAI;GACF,MAAM,QAAQ,OAAO,MAAM,GAAG,GAAG;GAEjC,MAAM,OAAoB,CAAC;GAC3B,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;IACrC,MAAM,OAAO,MAAM;IAEnB,IAAI,CAAC,MAAM;IACX,MAAM,UAAU,KAAK,KAAK;IAE1B,IAAI,CAAC,SAAS;IAEd,MAAM,QAAQ,QAAQ,MAAM,KAAK;IACjC,MAAM,KAAK,MAAM;IACjB,MAAM,KAAK,MAAM;IAEjB,IAAI,CAAC,MAAM,CAAC,IAAI;IAEhB,MAAM,OAAO,SAAS,IAAI,EAAE;IAC5B,MAAM,MAAM,SAAS,IAAI,EAAE;IAE3B,IAAI,CAAC,OAAO,MAAM,IAAI,KAAK,CAAC,OAAO,MAAM,GAAG,GAC1C,KAAK,KAAK,CAAC,MAAM,GAAG,CAAC;GAEzB;GAEA,SAAS,MAAM,IAAI;EACrB,SAAS,OAAO;GACd,SAAS,iBAAiB,QAAQ,QAAQ,IAAI,MAAM,OAAO,KAAK,CAAC,CAAC;EACpE;CACF,CAAC;AACH"}

package/dist/esm/watcher.mjs

@@ -1,3 +1,4 @@
+import { isDirectoryExcluded } from "./utils/isDirectoryExcluded.mjs";
 import { formatPath } from "./utils/formatter.mjs";
 import { getFormatFromExtension } from "./utils/getFormatFromExtension.mjs";
 import { parseContentDeclarationFileName } from "./utils/parseContentDeclarationFileName.mjs";
@@ -139,8 +140,10 @@ const watch = async (options) => {
 			const path = normalizePath(filePath);
 			const isConfigFile = normalizedConfigPath && path === normalizedConfigPath;
 			if (!isConfigFile) {
-				if (!contentDirs.some((d) => path.startsWith(`${d}/`) || path === d)) continue;
-				if (excludedSegments.some((segment) => path.includes(`/${segment}`))) continue;
+				const matchingContentDir = contentDirs.filter((dictionary) => path.startsWith(`${dictionary}/`) || path === dictionary).reduce((longest, dictionary) => longest === void 0 || dictionary.length > longest.length ? dictionary : longest, void 0);
+				if (matchingContentDir === void 0) continue;
+				const relativeDirectory = dirname(path.slice(matchingContentDir.length));
+				if (isDirectoryExcluded(relativeDirectory, excludedPath)) continue;
 				if (!fileExtensions.some((extension) => path.endsWith(extension))) continue;
 			}
 			if (event.type === "create") {