@intlayer/chokidar 8.1.2 → 8.1.3

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

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

package/dist/esm/utils/formatter.mjs

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

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

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

package/dist/esm/utils/getChunk.mjs

@@ -1,34 +1,2 @@
-import { splitTextByLines } from "./splitTextByLine.mjs";
-
-//#region src/utils/getChunk.ts
-const getChunk = (text, options = {}) => {
-	const { lineStart, lineLength, charStart, charLength } = options;
-	if (lineStart === void 0 && lineLength === void 0 && charStart === void 0 && charLength === void 0) return text;
-	const lines = splitTextByLines(text);
-	const getCharIndexOfLineStart = (lineNumber) => {
-		if (lineNumber <= 0) return 0;
-		let idx = 0;
-		for (let i = 0; i < Math.min(lineNumber, lines.length); i++) idx += lines[i].length;
-		return idx;
-	};
-	const getCharIndexOfLineEnd = (lineNumber) => {
-		if (lineNumber >= lines.length) return text.length;
-		const line = lines[lineNumber];
-		return getCharIndexOfLineStart(lineNumber) + line.length;
-	};
-	let effectiveStart = 0;
-	let effectiveEnd = text.length;
-	if (lineStart !== void 0) effectiveStart = Math.max(effectiveStart, getCharIndexOfLineStart(lineStart));
-	if (charStart !== void 0) effectiveStart = Math.max(effectiveStart, charStart);
-	if (lineLength !== void 0) {
-		const endLine = (lineStart ?? 0) + lineLength - 1;
-		effectiveEnd = Math.min(effectiveEnd, getCharIndexOfLineEnd(endLine));
-	}
-	if (charLength !== void 0) effectiveEnd = Math.min(effectiveEnd, (charStart ?? effectiveStart) + charLength);
-	if (effectiveStart >= effectiveEnd) return "";
-	return text.slice(effectiveStart, effectiveEnd);
-};
-
-//#endregion
-export { getChunk };
+import{splitTextByLines as e}from"./splitTextByLine.mjs";const t=(t,n={})=>{let{lineStart:r,lineLength:i,charStart:a,charLength:o}=n;if(r===void 0&&i===void 0&&a===void 0&&o===void 0)return t;let s=e(t),c=e=>{if(e<=0)return 0;let t=0;for(let n=0;n<Math.min(e,s.length);n++)t+=s[n].length;return t},l=e=>{if(e>=s.length)return t.length;let n=s[e];return c(e)+n.length},u=0,d=t.length;if(r!==void 0&&(u=Math.max(u,c(r))),a!==void 0&&(u=Math.max(u,a)),i!==void 0){let e=(r??0)+i-1;d=Math.min(d,l(e))}return o!==void 0&&(d=Math.min(d,(a??u)+o)),u>=d?``:t.slice(u,d)};export{t as getChunk};
 //# sourceMappingURL=getChunk.mjs.map

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

@@ -1 +1 @@
-{"version":3,"file":"getChunk.mjs","names":[],"sources":["../../../src/utils/getChunk.ts"],"sourcesContent":["import { splitTextByLines } from './splitTextByLine';\n\ntype TrunkOptions = {\n  lineStart?: number;\n  lineLength?: number;\n  charStart?: number;\n  charLength?: number;\n};\n\nexport const getChunk = (text: string, options: TrunkOptions = {}): string => {\n  const { lineStart, lineLength, charStart, charLength } = options;\n\n  // Fast-path: if no filters were provided, return the whole text\n  if (\n    lineStart === undefined &&\n    lineLength === undefined &&\n    charStart === undefined &&\n    charLength === undefined\n  ) {\n    return text;\n  }\n\n  // ---------------------------------------------------------------------------\n  // Utility helpers to convert between line numbers and absolute char indices\n  // ---------------------------------------------------------------------------\n  const lines = splitTextByLines(text);\n\n  const getCharIndexOfLineStart = (lineNumber: number): number => {\n    if (lineNumber <= 0) return 0;\n    // Sum the length of every previous line\n    let idx = 0;\n    for (let i = 0; i < Math.min(lineNumber, lines.length); i++) {\n      idx += lines[i].length;\n    }\n    return idx;\n  };\n\n  const getCharIndexOfLineEnd = (lineNumber: number): number => {\n    // If the requested line number exceeds the number of lines, clamp to the last character\n    if (lineNumber >= lines.length) {\n      return text.length;\n    }\n    const line = lines[lineNumber];\n    const lineEnd = getCharIndexOfLineStart(lineNumber) + line.length;\n\n    return lineEnd;\n  };\n\n  // ---------------------------------------------------------------------------\n  // Compute the effective (inclusive) charStart/charEnd for the requested slice\n  // ---------------------------------------------------------------------------\n  let effectiveStart = 0; // inclusive\n  let effectiveEnd = text.length; // exclusive\n\n  // Apply line boundaries if provided\n  if (lineStart !== undefined) {\n    effectiveStart = Math.max(\n      effectiveStart,\n      getCharIndexOfLineStart(lineStart)\n    );\n  }\n\n  // Apply character boundaries if provided\n  if (charStart !== undefined) {\n    effectiveStart = Math.max(effectiveStart, charStart);\n  }\n\n  // Apply line length boundary from lineStart (or 0)\n  if (lineLength !== undefined) {\n    const endLine = (lineStart ?? 0) + lineLength - 1;\n    effectiveEnd = Math.min(effectiveEnd, getCharIndexOfLineEnd(endLine));\n  }\n\n  // Apply character length boundary from effectiveStart\n  if (charLength !== undefined) {\n    effectiveEnd = Math.min(\n      effectiveEnd,\n      (charStart ?? effectiveStart) + charLength\n    );\n  }\n\n  // If bounds do not overlap, return empty string\n  if (effectiveStart >= effectiveEnd) {\n    return '';\n  }\n\n  return text.slice(effectiveStart, effectiveEnd);\n};\n"],"mappings":";;;AASA,MAAa,YAAY,MAAc,UAAwB,EAAE,KAAa;CAC5E,MAAM,EAAE,WAAW,YAAY,WAAW,eAAe;AAGzD,KACE,cAAc,UACd,eAAe,UACf,cAAc,UACd,eAAe,OAEf,QAAO;CAMT,MAAM,QAAQ,iBAAiB,KAAK;CAEpC,MAAM,2BAA2B,eAA+B;AAC9D,MAAI,cAAc,EAAG,QAAO;EAE5B,IAAI,MAAM;AACV,OAAK,IAAI,IAAI,GAAG,IAAI,KAAK,IAAI,YAAY,MAAM,OAAO,EAAE,IACtD,QAAO,MAAM,GAAG;AAElB,SAAO;;CAGT,MAAM,yBAAyB,eAA+B;AAE5D,MAAI,cAAc,MAAM,OACtB,QAAO,KAAK;EAEd,MAAM,OAAO,MAAM;AAGnB,SAFgB,wBAAwB,WAAW,GAAG,KAAK;;CAQ7D,IAAI,iBAAiB;CACrB,IAAI,eAAe,KAAK;AAGxB,KAAI,cAAc,OAChB,kBAAiB,KAAK,IACpB,gBACA,wBAAwB,UAAU,CACnC;AAIH,KAAI,cAAc,OAChB,kBAAiB,KAAK,IAAI,gBAAgB,UAAU;AAItD,KAAI,eAAe,QAAW;EAC5B,MAAM,WAAW,aAAa,KAAK,aAAa;AAChD,iBAAe,KAAK,IAAI,cAAc,sBAAsB,QAAQ,CAAC;;AAIvE,KAAI,eAAe,OACjB,gBAAe,KAAK,IAClB,eACC,aAAa,kBAAkB,WACjC;AAIH,KAAI,kBAAkB,aACpB,QAAO;AAGT,QAAO,KAAK,MAAM,gBAAgB,aAAa"}
+{"version":3,"file":"getChunk.mjs","names":[],"sources":["../../../src/utils/getChunk.ts"],"sourcesContent":["import { splitTextByLines } from './splitTextByLine';\n\ntype TrunkOptions = {\n  lineStart?: number;\n  lineLength?: number;\n  charStart?: number;\n  charLength?: number;\n};\n\nexport const getChunk = (text: string, options: TrunkOptions = {}): string => {\n  const { lineStart, lineLength, charStart, charLength } = options;\n\n  // Fast-path: if no filters were provided, return the whole text\n  if (\n    lineStart === undefined &&\n    lineLength === undefined &&\n    charStart === undefined &&\n    charLength === undefined\n  ) {\n    return text;\n  }\n\n  // ---------------------------------------------------------------------------\n  // Utility helpers to convert between line numbers and absolute char indices\n  // ---------------------------------------------------------------------------\n  const lines = splitTextByLines(text);\n\n  const getCharIndexOfLineStart = (lineNumber: number): number => {\n    if (lineNumber <= 0) return 0;\n    // Sum the length of every previous line\n    let idx = 0;\n    for (let i = 0; i < Math.min(lineNumber, lines.length); i++) {\n      idx += lines[i].length;\n    }\n    return idx;\n  };\n\n  const getCharIndexOfLineEnd = (lineNumber: number): number => {\n    // If the requested line number exceeds the number of lines, clamp to the last character\n    if (lineNumber >= lines.length) {\n      return text.length;\n    }\n    const line = lines[lineNumber];\n    const lineEnd = getCharIndexOfLineStart(lineNumber) + line.length;\n\n    return lineEnd;\n  };\n\n  // ---------------------------------------------------------------------------\n  // Compute the effective (inclusive) charStart/charEnd for the requested slice\n  // ---------------------------------------------------------------------------\n  let effectiveStart = 0; // inclusive\n  let effectiveEnd = text.length; // exclusive\n\n  // Apply line boundaries if provided\n  if (lineStart !== undefined) {\n    effectiveStart = Math.max(\n      effectiveStart,\n      getCharIndexOfLineStart(lineStart)\n    );\n  }\n\n  // Apply character boundaries if provided\n  if (charStart !== undefined) {\n    effectiveStart = Math.max(effectiveStart, charStart);\n  }\n\n  // Apply line length boundary from lineStart (or 0)\n  if (lineLength !== undefined) {\n    const endLine = (lineStart ?? 0) + lineLength - 1;\n    effectiveEnd = Math.min(effectiveEnd, getCharIndexOfLineEnd(endLine));\n  }\n\n  // Apply character length boundary from effectiveStart\n  if (charLength !== undefined) {\n    effectiveEnd = Math.min(\n      effectiveEnd,\n      (charStart ?? effectiveStart) + charLength\n    );\n  }\n\n  // If bounds do not overlap, return empty string\n  if (effectiveStart >= effectiveEnd) {\n    return '';\n  }\n\n  return text.slice(effectiveStart, effectiveEnd);\n};\n"],"mappings":"yDASA,MAAa,GAAY,EAAc,EAAwB,EAAE,GAAa,CAC5E,GAAM,CAAE,YAAW,aAAY,YAAW,cAAe,EAGzD,GACE,IAAc,IAAA,IACd,IAAe,IAAA,IACf,IAAc,IAAA,IACd,IAAe,IAAA,GAEf,OAAO,EAMT,IAAM,EAAQ,EAAiB,EAAK,CAE9B,EAA2B,GAA+B,CAC9D,GAAI,GAAc,EAAG,MAAO,GAE5B,IAAI,EAAM,EACV,IAAK,IAAI,EAAI,EAAG,EAAI,KAAK,IAAI,EAAY,EAAM,OAAO,CAAE,IACtD,GAAO,EAAM,GAAG,OAElB,OAAO,GAGH,EAAyB,GAA+B,CAE5D,GAAI,GAAc,EAAM,OACtB,OAAO,EAAK,OAEd,IAAM,EAAO,EAAM,GAGnB,OAFgB,EAAwB,EAAW,CAAG,EAAK,QAQzD,EAAiB,EACjB,EAAe,EAAK,OAgBxB,GAbI,IAAc,IAAA,KAChB,EAAiB,KAAK,IACpB,EACA,EAAwB,EAAU,CACnC,EAIC,IAAc,IAAA,KAChB,EAAiB,KAAK,IAAI,EAAgB,EAAU,EAIlD,IAAe,IAAA,GAAW,CAC5B,IAAM,GAAW,GAAa,GAAK,EAAa,EAChD,EAAe,KAAK,IAAI,EAAc,EAAsB,EAAQ,CAAC,CAgBvE,OAZI,IAAe,IAAA,KACjB,EAAe,KAAK,IAClB,GACC,GAAa,GAAkB,EACjC,EAIC,GAAkB,EACb,GAGF,EAAK,MAAM,EAAgB,EAAa"}

package/dist/esm/utils/getComponentTransformPattern.mjs

@@ -1,45 +1,2 @@
-import { isAbsolute, relative, resolve } from "node:path";
-import fg from "fast-glob";
-
-//#region src/utils/getComponentTransformPattern.ts
-/**
-* Helper to remove directories that are subdirectories of others in the list.
-* Example: ['/root', '/root/src'] -> ['/root']
-* This prevents scanning the same files twice.
-*/
-const getDistinctRootDirs = (dirs) => {
-	const uniqueDirs = Array.from(new Set(dirs.map((dir) => resolve(dir))));
-	uniqueDirs.sort((a, b) => a.length - b.length);
-	return uniqueDirs.reduce((acc, dir) => {
-		if (!acc.some((parent) => {
-			const relativePath = relative(parent, dir);
-			return !relativePath.startsWith("..") && !isAbsolute(relativePath) && relativePath !== "";
-		})) acc.push(dir);
-		return acc;
-	}, []);
-};
-const getComponentTransformPattern = async (intlayerConfig) => {
-	const { baseDir, codeDir } = intlayerConfig.content;
-	const { traversePattern } = intlayerConfig.build;
-	const filesListPatternPromises = getDistinctRootDirs([baseDir, ...codeDir]).map((cwd) => fg(traversePattern, {
-		cwd,
-		absolute: true,
-		dot: true
-	}));
-	const filesList = (await Promise.all(filesListPatternPromises)).flat();
-	return Array.from(new Set(filesList));
-};
-const getComponentTransformPatternSync = (intlayerConfig) => {
-	const { baseDir, codeDir } = intlayerConfig.content;
-	const { traversePattern } = intlayerConfig.build;
-	const filesList = getDistinctRootDirs([baseDir, ...codeDir]).flatMap((cwd) => fg.sync(traversePattern, {
-		cwd,
-		absolute: true,
-		dot: true
-	}));
-	return Array.from(new Set(filesList));
-};
-
-//#endregion
-export { getComponentTransformPattern, getComponentTransformPatternSync };
+import{isAbsolute as e,relative as t,resolve as n}from"node:path";import r from"fast-glob";const i=r=>{let i=Array.from(new Set(r.map(e=>n(e))));return i.sort((e,t)=>e.length-t.length),i.reduce((n,r)=>(n.some(n=>{let i=t(n,r);return!i.startsWith(`..`)&&!e(i)&&i!==``})||n.push(r),n),[])},a=async e=>{let{baseDir:t,codeDir:n}=e.content,{traversePattern:a}=e.build,o=i([t,...n]).map(e=>r(a,{cwd:e,absolute:!0,dot:!0})),s=(await Promise.all(o)).flat();return Array.from(new Set(s))},o=e=>{let{baseDir:t,codeDir:n}=e.content,{traversePattern:a}=e.build,o=i([t,...n]).flatMap(e=>r.sync(a,{cwd:e,absolute:!0,dot:!0}));return Array.from(new Set(o))};export{a as getComponentTransformPattern,o as getComponentTransformPatternSync};
 //# sourceMappingURL=getComponentTransformPattern.mjs.map

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

@@ -1 +1 @@
-{"version":3,"file":"getComponentTransformPattern.mjs","names":[],"sources":["../../../src/utils/getComponentTransformPattern.ts"],"sourcesContent":["import { isAbsolute, relative, resolve } from 'node:path';\nimport type { IntlayerConfig } from '@intlayer/types';\nimport fg from 'fast-glob';\n\n/**\n * Helper to remove directories that are subdirectories of others in the list.\n * Example: ['/root', '/root/src'] -> ['/root']\n * This prevents scanning the same files twice.\n */\nconst getDistinctRootDirs = (dirs: string[]): string[] => {\n  // Resolve to absolute paths and remove exact duplicates\n  const uniqueDirs = Array.from(new Set(dirs.map((dir) => resolve(dir))));\n\n  // Sort by length (shortest paths first) so parents appear before children\n  uniqueDirs.sort((a, b) => a.length - b.length);\n\n  // Filter out any directory that is inside a parent already in the accepted list\n  return uniqueDirs.reduce((acc: string[], dir) => {\n    const isNested = acc.some((parent) => {\n      const relativePath = relative(parent, dir);\n      return (\n        !relativePath.startsWith('..') && // It is inside the parent\n        !isAbsolute(relativePath) && // It is not a different drive/root\n        relativePath !== '' // It is not the parent itself (already handled by Set, but good for safety)\n      );\n    });\n\n    if (!isNested) {\n      acc.push(dir);\n    }\n    return acc;\n  }, []);\n};\n\nexport const getComponentTransformPattern = async (\n  intlayerConfig: IntlayerConfig\n): Promise<string[]> => {\n  const { baseDir, codeDir } = intlayerConfig.content;\n  const { traversePattern } = intlayerConfig.build;\n\n  // Optimize: Filter out codeDir paths if they are already covered by baseDir\n  const distinctRoots = getDistinctRootDirs([baseDir, ...codeDir]);\n\n  const filesListPatternPromises = distinctRoots.map((cwd) =>\n    fg(traversePattern, {\n      cwd,\n      absolute: true,\n      dot: true,\n    })\n  );\n\n  const filesList = (await Promise.all(filesListPatternPromises)).flat();\n\n  // Deduplicate files just in case of overlapping patterns or symlinks\n  return Array.from(new Set(filesList));\n};\n\nexport const getComponentTransformPatternSync = (\n  intlayerConfig: IntlayerConfig\n): string[] => {\n  const { baseDir, codeDir } = intlayerConfig.content;\n  const { traversePattern } = intlayerConfig.build;\n\n  // Optimize: Filter out codeDir paths if they are already covered by baseDir\n  const distinctRoots = getDistinctRootDirs([baseDir, ...codeDir]);\n\n  const filesList = distinctRoots.flatMap((cwd) =>\n    fg.sync(traversePattern, {\n      cwd,\n      absolute: true,\n      dot: true,\n    })\n  );\n\n  return Array.from(new Set(filesList));\n};\n"],"mappings":";;;;;;;;;AASA,MAAM,uBAAuB,SAA6B;CAExD,MAAM,aAAa,MAAM,KAAK,IAAI,IAAI,KAAK,KAAK,QAAQ,QAAQ,IAAI,CAAC,CAAC,CAAC;AAGvE,YAAW,MAAM,GAAG,MAAM,EAAE,SAAS,EAAE,OAAO;AAG9C,QAAO,WAAW,QAAQ,KAAe,QAAQ;AAU/C,MAAI,CATa,IAAI,MAAM,WAAW;GACpC,MAAM,eAAe,SAAS,QAAQ,IAAI;AAC1C,UACE,CAAC,aAAa,WAAW,KAAK,IAC9B,CAAC,WAAW,aAAa,IACzB,iBAAiB;IAEnB,CAGA,KAAI,KAAK,IAAI;AAEf,SAAO;IACN,EAAE,CAAC;;AAGR,MAAa,+BAA+B,OAC1C,mBACsB;CACtB,MAAM,EAAE,SAAS,YAAY,eAAe;CAC5C,MAAM,EAAE,oBAAoB,eAAe;CAK3C,MAAM,2BAFgB,oBAAoB,CAAC,SAAS,GAAG,QAAQ,CAAC,CAEjB,KAAK,QAClD,GAAG,iBAAiB;EAClB;EACA,UAAU;EACV,KAAK;EACN,CAAC,CACH;CAED,MAAM,aAAa,MAAM,QAAQ,IAAI,yBAAyB,EAAE,MAAM;AAGtE,QAAO,MAAM,KAAK,IAAI,IAAI,UAAU,CAAC;;AAGvC,MAAa,oCACX,mBACa;CACb,MAAM,EAAE,SAAS,YAAY,eAAe;CAC5C,MAAM,EAAE,oBAAoB,eAAe;CAK3C,MAAM,YAFgB,oBAAoB,CAAC,SAAS,GAAG,QAAQ,CAAC,CAEhC,SAAS,QACvC,GAAG,KAAK,iBAAiB;EACvB;EACA,UAAU;EACV,KAAK;EACN,CAAC,CACH;AAED,QAAO,MAAM,KAAK,IAAI,IAAI,UAAU,CAAC"}
+{"version":3,"file":"getComponentTransformPattern.mjs","names":[],"sources":["../../../src/utils/getComponentTransformPattern.ts"],"sourcesContent":["import { isAbsolute, relative, resolve } from 'node:path';\nimport type { IntlayerConfig } from '@intlayer/types';\nimport fg from 'fast-glob';\n\n/**\n * Helper to remove directories that are subdirectories of others in the list.\n * Example: ['/root', '/root/src'] -> ['/root']\n * This prevents scanning the same files twice.\n */\nconst getDistinctRootDirs = (dirs: string[]): string[] => {\n  // Resolve to absolute paths and remove exact duplicates\n  const uniqueDirs = Array.from(new Set(dirs.map((dir) => resolve(dir))));\n\n  // Sort by length (shortest paths first) so parents appear before children\n  uniqueDirs.sort((a, b) => a.length - b.length);\n\n  // Filter out any directory that is inside a parent already in the accepted list\n  return uniqueDirs.reduce((acc: string[], dir) => {\n    const isNested = acc.some((parent) => {\n      const relativePath = relative(parent, dir);\n      return (\n        !relativePath.startsWith('..') && // It is inside the parent\n        !isAbsolute(relativePath) && // It is not a different drive/root\n        relativePath !== '' // It is not the parent itself (already handled by Set, but good for safety)\n      );\n    });\n\n    if (!isNested) {\n      acc.push(dir);\n    }\n    return acc;\n  }, []);\n};\n\nexport const getComponentTransformPattern = async (\n  intlayerConfig: IntlayerConfig\n): Promise<string[]> => {\n  const { baseDir, codeDir } = intlayerConfig.content;\n  const { traversePattern } = intlayerConfig.build;\n\n  // Optimize: Filter out codeDir paths if they are already covered by baseDir\n  const distinctRoots = getDistinctRootDirs([baseDir, ...codeDir]);\n\n  const filesListPatternPromises = distinctRoots.map((cwd) =>\n    fg(traversePattern, {\n      cwd,\n      absolute: true,\n      dot: true,\n    })\n  );\n\n  const filesList = (await Promise.all(filesListPatternPromises)).flat();\n\n  // Deduplicate files just in case of overlapping patterns or symlinks\n  return Array.from(new Set(filesList));\n};\n\nexport const getComponentTransformPatternSync = (\n  intlayerConfig: IntlayerConfig\n): string[] => {\n  const { baseDir, codeDir } = intlayerConfig.content;\n  const { traversePattern } = intlayerConfig.build;\n\n  // Optimize: Filter out codeDir paths if they are already covered by baseDir\n  const distinctRoots = getDistinctRootDirs([baseDir, ...codeDir]);\n\n  const filesList = distinctRoots.flatMap((cwd) =>\n    fg.sync(traversePattern, {\n      cwd,\n      absolute: true,\n      dot: true,\n    })\n  );\n\n  return Array.from(new Set(filesList));\n};\n"],"mappings":"2FASA,MAAM,EAAuB,GAA6B,CAExD,IAAM,EAAa,MAAM,KAAK,IAAI,IAAI,EAAK,IAAK,GAAQ,EAAQ,EAAI,CAAC,CAAC,CAAC,CAMvE,OAHA,EAAW,MAAM,EAAG,IAAM,EAAE,OAAS,EAAE,OAAO,CAGvC,EAAW,QAAQ,EAAe,KACtB,EAAI,KAAM,GAAW,CACpC,IAAM,EAAe,EAAS,EAAQ,EAAI,CAC1C,MACE,CAAC,EAAa,WAAW,KAAK,EAC9B,CAAC,EAAW,EAAa,EACzB,IAAiB,IAEnB,EAGA,EAAI,KAAK,EAAI,CAER,GACN,EAAE,CAAC,EAGK,EAA+B,KAC1C,IACsB,CACtB,GAAM,CAAE,UAAS,WAAY,EAAe,QACtC,CAAE,mBAAoB,EAAe,MAKrC,EAFgB,EAAoB,CAAC,EAAS,GAAG,EAAQ,CAAC,CAEjB,IAAK,GAClD,EAAG,EAAiB,CAClB,MACA,SAAU,GACV,IAAK,GACN,CAAC,CACH,CAEK,GAAa,MAAM,QAAQ,IAAI,EAAyB,EAAE,MAAM,CAGtE,OAAO,MAAM,KAAK,IAAI,IAAI,EAAU,CAAC,EAG1B,EACX,GACa,CACb,GAAM,CAAE,UAAS,WAAY,EAAe,QACtC,CAAE,mBAAoB,EAAe,MAKrC,EAFgB,EAAoB,CAAC,EAAS,GAAG,EAAQ,CAAC,CAEhC,QAAS,GACvC,EAAG,KAAK,EAAiB,CACvB,MACA,SAAU,GACV,IAAK,GACN,CAAC,CACH,CAED,OAAO,MAAM,KAAK,IAAI,IAAI,EAAU,CAAC"}

package/dist/esm/utils/getFileHash.mjs

@@ -1,10 +1,2 @@
-import crypto from "crypto-js";
-
-//#region src/utils/getFileHash.ts
-const getFileHash = (filePath) => {
-	return crypto.SHA3(filePath).toString(crypto.enc.Base64).replace(/[^A-Z\d]/gi, "").substring(0, 20);
-};
-
-//#endregion
-export { getFileHash };
+import e from"crypto-js";const t=t=>e.SHA3(t).toString(e.enc.Base64).replace(/[^A-Z\d]/gi,``).substring(0,20);export{t as getFileHash};
 //# sourceMappingURL=getFileHash.mjs.map

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

@@ -1 +1 @@
-{"version":3,"file":"getFileHash.mjs","names":[],"sources":["../../../src/utils/getFileHash.ts"],"sourcesContent":["import crypto from 'crypto-js';\n\nexport const getFileHash = (filePath: string) => {\n  const hash = crypto.SHA3(filePath);\n\n  return hash\n    .toString(crypto.enc.Base64)\n    .replace(/[^A-Z\\d]/gi, '')\n    .substring(0, 20);\n};\n"],"mappings":";;;AAEA,MAAa,eAAe,aAAqB;AAG/C,QAFa,OAAO,KAAK,SAAS,CAG/B,SAAS,OAAO,IAAI,OAAO,CAC3B,QAAQ,cAAc,GAAG,CACzB,UAAU,GAAG,GAAG"}
+{"version":3,"file":"getFileHash.mjs","names":[],"sources":["../../../src/utils/getFileHash.ts"],"sourcesContent":["import crypto from 'crypto-js';\n\nexport const getFileHash = (filePath: string) => {\n  const hash = crypto.SHA3(filePath);\n\n  return hash\n    .toString(crypto.enc.Base64)\n    .replace(/[^A-Z\\d]/gi, '')\n    .substring(0, 20);\n};\n"],"mappings":"yBAEA,MAAa,EAAe,GACb,EAAO,KAAK,EAAS,CAG/B,SAAS,EAAO,IAAI,OAAO,CAC3B,QAAQ,aAAc,GAAG,CACzB,UAAU,EAAG,GAAG"}

package/dist/esm/utils/getFormatFromExtension.mjs

@@ -1,29 +1,2 @@
-//#region src/utils/getFormatFromExtension.ts
-const getFormatFromExtension = (extension) => {
-	switch (extension) {
-		case ".ts":
-		case ".tsx": return "ts";
-		case ".cjs":
-		case ".cjsx": return "cjs";
-		case ".mjs": return "esm";
-		case ".json":
-		case ".jsonc":
-		case ".json5": return "json";
-	}
-	return "ts";
-};
-const getExtensionFromFormat = (format) => {
-	switch (format) {
-		case "ts": return ".ts";
-		case "cjs": return ".cjs";
-		case "json": return ".json";
-		case "jsonc": return ".jsonc";
-		case "json5": return ".json5";
-		case "esm": return ".mjs";
-	}
-	return ".ts";
-};
-
-//#endregion
-export { getExtensionFromFormat, getFormatFromExtension };
+const e=e=>{switch(e){case`.ts`:case`.tsx`:return`ts`;case`.cjs`:case`.cjsx`:return`cjs`;case`.mjs`:return`esm`;case`.json`:case`.jsonc`:case`.json5`:return`json`}return`ts`},t=e=>{switch(e){case`ts`:return`.ts`;case`cjs`:return`.cjs`;case`json`:return`.json`;case`jsonc`:return`.jsonc`;case`json5`:return`.json5`;case`esm`:return`.mjs`}return`.ts`};export{t as getExtensionFromFormat,e as getFormatFromExtension};
 //# sourceMappingURL=getFormatFromExtension.mjs.map

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

@@ -1 +1 @@
-{"version":3,"file":"getFormatFromExtension.mjs","names":[],"sources":["../../../src/utils/getFormatFromExtension.ts"],"sourcesContent":["export type Format = 'ts' | 'cjs' | 'esm' | 'json' | 'jsonc' | 'json5';\nexport type Extension =\n  | '.ts'\n  | '.tsx'\n  | '.js'\n  | '.jsx'\n  | '.cjs'\n  | '.cjsx'\n  | '.mjs'\n  | '.mjsx'\n  | '.json'\n  | '.jsonc'\n  | '.json5';\n\nexport const getFormatFromExtension = (extension: Extension): Format => {\n  switch (extension) {\n    case '.ts':\n    case '.tsx':\n      return 'ts';\n    case '.cjs':\n    case '.cjsx':\n      return 'cjs';\n    case '.mjs':\n      return 'esm';\n    case '.json':\n    case '.jsonc':\n    case '.json5':\n      return 'json';\n  }\n\n  return 'ts';\n};\n\nexport const getExtensionFromFormat = (format: Format): Extension => {\n  switch (format) {\n    case 'ts':\n      return '.ts';\n    case 'cjs':\n      return '.cjs';\n    case 'json':\n      return '.json';\n    case 'jsonc':\n      return '.jsonc';\n    case 'json5':\n      return '.json5';\n    case 'esm':\n      return '.mjs';\n  }\n\n  return '.ts';\n};\n"],"mappings":";AAcA,MAAa,0BAA0B,cAAiC;AACtE,SAAQ,WAAR;EACE,KAAK;EACL,KAAK,OACH,QAAO;EACT,KAAK;EACL,KAAK,QACH,QAAO;EACT,KAAK,OACH,QAAO;EACT,KAAK;EACL,KAAK;EACL,KAAK,SACH,QAAO;;AAGX,QAAO;;AAGT,MAAa,0BAA0B,WAA8B;AACnE,SAAQ,QAAR;EACE,KAAK,KACH,QAAO;EACT,KAAK,MACH,QAAO;EACT,KAAK,OACH,QAAO;EACT,KAAK,QACH,QAAO;EACT,KAAK,QACH,QAAO;EACT,KAAK,MACH,QAAO;;AAGX,QAAO"}
+{"version":3,"file":"getFormatFromExtension.mjs","names":[],"sources":["../../../src/utils/getFormatFromExtension.ts"],"sourcesContent":["export type Format = 'ts' | 'cjs' | 'esm' | 'json' | 'jsonc' | 'json5';\nexport type Extension =\n  | '.ts'\n  | '.tsx'\n  | '.js'\n  | '.jsx'\n  | '.cjs'\n  | '.cjsx'\n  | '.mjs'\n  | '.mjsx'\n  | '.json'\n  | '.jsonc'\n  | '.json5';\n\nexport const getFormatFromExtension = (extension: Extension): Format => {\n  switch (extension) {\n    case '.ts':\n    case '.tsx':\n      return 'ts';\n    case '.cjs':\n    case '.cjsx':\n      return 'cjs';\n    case '.mjs':\n      return 'esm';\n    case '.json':\n    case '.jsonc':\n    case '.json5':\n      return 'json';\n  }\n\n  return 'ts';\n};\n\nexport const getExtensionFromFormat = (format: Format): Extension => {\n  switch (format) {\n    case 'ts':\n      return '.ts';\n    case 'cjs':\n      return '.cjs';\n    case 'json':\n      return '.json';\n    case 'jsonc':\n      return '.jsonc';\n    case 'json5':\n      return '.json5';\n    case 'esm':\n      return '.mjs';\n  }\n\n  return '.ts';\n};\n"],"mappings":"AAcA,MAAa,EAA0B,GAAiC,CACtE,OAAQ,EAAR,CACE,IAAK,MACL,IAAK,OACH,MAAO,KACT,IAAK,OACL,IAAK,QACH,MAAO,MACT,IAAK,OACH,MAAO,MACT,IAAK,QACL,IAAK,SACL,IAAK,SACH,MAAO,OAGX,MAAO,MAGI,EAA0B,GAA8B,CACnE,OAAQ,EAAR,CACE,IAAK,KACH,MAAO,MACT,IAAK,MACH,MAAO,OACT,IAAK,OACH,MAAO,QACT,IAAK,QACH,MAAO,SACT,IAAK,QACH,MAAO,SACT,IAAK,MACH,MAAO,OAGX,MAAO"}

package/dist/esm/utils/index.mjs

@@ -1,20 +1 @@
-import { Queue, pLimit } from "./pLimit.mjs";
-import { parallelize } from "./parallelize.mjs";
-import { formatLocale, formatPath } from "./formatter.mjs";
-import { autoDecorateContent } from "./autoDecorateContent.mjs";
-import { resolveObjectPromises } from "./resolveObjectPromises.mjs";
-import { getFileHash } from "./getFileHash.mjs";
-import { sortAlphabetically } from "./sortAlphabetically.mjs";
-import { runOnce } from "./runOnce.mjs";
-import { getExtensionFromFormat, getFormatFromExtension } from "./getFormatFromExtension.mjs";
-import { buildFilesList } from "./buildFilesList.mjs";
-import { splitTextByLines } from "./splitTextByLine.mjs";
-import { getChunk } from "./getChunk.mjs";
-import { assembleJSON, chunkJSON, reconstructFromSingleChunk } from "./chunkJSON.mjs";
-import { getComponentTransformPattern, getComponentTransformPatternSync } from "./getComponentTransformPattern.mjs";
-import { getGlobalLimiter, getTaskLimiter, parallelizeGlobal } from "./parallelizeGlobal.mjs";
-import { reduceObjectFormat } from "./reduceObjectFormat.mjs";
-import { runParallel } from "./runParallel/index.mjs";
-import { verifyIdenticObjectFormat } from "./verifyIdenticObjectFormat.mjs";
-
-export { Queue, assembleJSON, autoDecorateContent, buildFilesList, chunkJSON, formatLocale, formatPath, getChunk, getComponentTransformPattern, getComponentTransformPatternSync, getExtensionFromFormat, getFileHash, getFormatFromExtension, getGlobalLimiter, getTaskLimiter, pLimit, parallelize, parallelizeGlobal, reconstructFromSingleChunk, reduceObjectFormat, resolveObjectPromises, runOnce, runParallel, sortAlphabetically, splitTextByLines, verifyIdenticObjectFormat };
+import{Queue as e,pLimit as t}from"./pLimit.mjs";import{parallelize as n}from"./parallelize.mjs";import{formatLocale as r,formatPath as i}from"./formatter.mjs";import{autoDecorateContent as a}from"./autoDecorateContent.mjs";import{resolveObjectPromises as o}from"./resolveObjectPromises.mjs";import{getFileHash as s}from"./getFileHash.mjs";import{sortAlphabetically as c}from"./sortAlphabetically.mjs";import{runOnce as l}from"./runOnce.mjs";import{getExtensionFromFormat as u,getFormatFromExtension as d}from"./getFormatFromExtension.mjs";import{buildFilesList as f}from"./buildFilesList.mjs";import{splitTextByLines as p}from"./splitTextByLine.mjs";import{getChunk as m}from"./getChunk.mjs";import{assembleJSON as h,chunkJSON as g,reconstructFromSingleChunk as _}from"./chunkJSON.mjs";import{getComponentTransformPattern as v,getComponentTransformPatternSync as y}from"./getComponentTransformPattern.mjs";import{getGlobalLimiter as b,getTaskLimiter as x,parallelizeGlobal as S}from"./parallelizeGlobal.mjs";import{reduceObjectFormat as C}from"./reduceObjectFormat.mjs";import{runParallel as w}from"./runParallel/index.mjs";import{verifyIdenticObjectFormat as T}from"./verifyIdenticObjectFormat.mjs";export{e as Queue,h as assembleJSON,a as autoDecorateContent,f as buildFilesList,g as chunkJSON,r as formatLocale,i as formatPath,m as getChunk,v as getComponentTransformPattern,y as getComponentTransformPatternSync,u as getExtensionFromFormat,s as getFileHash,d as getFormatFromExtension,b as getGlobalLimiter,x as getTaskLimiter,t as pLimit,n as parallelize,S as parallelizeGlobal,_ as reconstructFromSingleChunk,C as reduceObjectFormat,o as resolveObjectPromises,l as runOnce,w as runParallel,c as sortAlphabetically,p as splitTextByLines,T as verifyIdenticObjectFormat};

package/dist/esm/utils/pLimit.mjs

@@ -1,126 +1,2 @@
-//#region src/utils/pLimit.ts
-var Node = class {
-	value;
-	next;
-	constructor(value) {
-		this.value = value;
-	}
-};
-var Queue = class {
-	#head;
-	#tail;
-	#size;
-	constructor() {
-		this.clear();
-	}
-	enqueue(value) {
-		const node = new Node(value);
-		if (this.#head) {
-			this.#tail.next = node;
-			this.#tail = node;
-		} else {
-			this.#head = node;
-			this.#tail = node;
-		}
-		this.#size++;
-	}
-	dequeue() {
-		const current = this.#head;
-		if (!current) return;
-		this.#head = current.next;
-		this.#size--;
-		return current.value;
-	}
-	peek() {
-		if (!this.#head) return;
-		return this.#head.value;
-	}
-	clear() {
-		this.#head = void 0;
-		this.#tail = void 0;
-		this.#size = 0;
-	}
-	get size() {
-		return this.#size;
-	}
-	*[Symbol.iterator]() {
-		let current = this.#head;
-		while (current) {
-			yield current.value;
-			current = current.next;
-		}
-	}
-	*drain() {
-		while (this.#head) yield this.dequeue();
-	}
-};
-const pLimit = (concurrency) => {
-	validateConcurrency(concurrency);
-	const queue = new Queue();
-	let activeCount = 0;
-	const idleWaiters = [];
-	const notifyIdleIfNeeded = () => {
-		if (activeCount === 0 && queue.size === 0) while (idleWaiters.length) idleWaiters.pop()?.();
-	};
-	const resumeNext = () => {
-		if (activeCount < concurrency && queue.size > 0) {
-			activeCount++;
-			queue.dequeue()?.();
-		}
-	};
-	const next = () => {
-		activeCount--;
-		resumeNext();
-	};
-	const run = async (fn, resolve, arguments_) => {
-		const result = (async () => fn(...arguments_))();
-		resolve(result);
-		try {
-			await result;
-		} catch {}
-		next();
-	};
-	const enqueue = (fn, resolve, arguments_) => {
-		new Promise((internalResolve) => {
-			queue.enqueue(internalResolve);
-		}).then(run.bind(void 0, fn, resolve, arguments_));
-		if (activeCount < concurrency) resumeNext();
-	};
-	const generator = (fn, ...arguments_) => new Promise((resolve) => {
-		enqueue(fn, resolve, arguments_);
-	});
-	Object.defineProperties(generator, {
-		activeCount: { get: () => activeCount },
-		pendingCount: { get: () => queue.size },
-		clearQueue: { value() {
-			queue.clear();
-			notifyIdleIfNeeded();
-		} },
-		concurrency: {
-			get: () => concurrency,
-			set(newConcurrency) {
-				validateConcurrency(newConcurrency);
-				concurrency = newConcurrency;
-				queueMicrotask(() => {
-					while (activeCount < concurrency && queue.size > 0) resumeNext();
-				});
-			}
-		},
-		map: { async value(array, fn) {
-			const promises = array.map((value, index) => this(fn, value, index));
-			return Promise.all(promises);
-		} },
-		onIdle: { value() {
-			if (activeCount === 0 && queue.size === 0) return Promise.resolve();
-			return new Promise((resolve) => idleWaiters.push(resolve));
-		} }
-	});
-	return generator;
-};
-const validateConcurrency = (concurrency) => {
-	if (!((Number.isInteger(concurrency) || concurrency === Number.POSITIVE_INFINITY) && concurrency > 0)) throw new TypeError("Expected `concurrency` to be a number from 1 and up");
-};
-
-//#endregion
-export { Queue, pLimit };
+var e=class{value;next;constructor(e){this.value=e}},t=class{#e;#t;#n;constructor(){this.clear()}enqueue(t){let n=new e(t);this.#e?(this.#t.next=n,this.#t=n):(this.#e=n,this.#t=n),this.#n++}dequeue(){let e=this.#e;if(e)return this.#e=e.next,this.#n--,e.value}peek(){if(this.#e)return this.#e.value}clear(){this.#e=void 0,this.#t=void 0,this.#n=0}get size(){return this.#n}*[Symbol.iterator](){let e=this.#e;for(;e;)yield e.value,e=e.next}*drain(){for(;this.#e;)yield this.dequeue()}};const n=e=>{r(e);let n=new t,i=0,a=[],o=()=>{if(i===0&&n.size===0)for(;a.length;)a.pop()?.()},s=()=>{i<e&&n.size>0&&(i++,n.dequeue()?.())},c=()=>{i--,s()},l=async(e,t,n)=>{let r=(async()=>e(...n))();t(r);try{await r}catch{}c()},u=(t,r,a)=>{new Promise(e=>{n.enqueue(e)}).then(l.bind(void 0,t,r,a)),i<e&&s()},d=(e,...t)=>new Promise(n=>{u(e,n,t)});return Object.defineProperties(d,{activeCount:{get:()=>i},pendingCount:{get:()=>n.size},clearQueue:{value(){n.clear(),o()}},concurrency:{get:()=>e,set(t){r(t),e=t,queueMicrotask(()=>{for(;i<e&&n.size>0;)s()})}},map:{async value(e,t){let n=e.map((e,n)=>this(t,e,n));return Promise.all(n)}},onIdle:{value(){return i===0&&n.size===0?Promise.resolve():new Promise(e=>a.push(e))}}}),d},r=e=>{if(!((Number.isInteger(e)||e===1/0)&&e>0))throw TypeError("Expected `concurrency` to be a number from 1 and up")};export{t as Queue,n as pLimit};
 //# sourceMappingURL=pLimit.mjs.map

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

@@ -1 +1 @@
-{"version":3,"file":"pLimit.mjs","names":["#head","#tail","#size"],"sources":["../../../src/utils/pLimit.ts"],"sourcesContent":["/*\nHow it works:\n`this.#head` is an instance of `Node` which keeps track of its current value and nests another instance of `Node` that keeps the value that comes after it. When a value is provided to `.enqueue()`, the code needs to iterate through `this.#head`, going deeper and deeper to find the last value. However, iterating through every single item is slow. This problem is solved by saving a reference to the last value as `this.#tail` so that it can reference it to add a new value.\n*/\n\nclass Node<T> {\n  value: T;\n  next: Node<T> | undefined;\n\n  constructor(value: T) {\n    this.value = value;\n  }\n}\n\nexport class Queue<T> {\n  #head: Node<T> | undefined;\n  #tail: Node<T> | undefined;\n  #size!: number;\n\n  constructor() {\n    this.clear();\n  }\n\n  enqueue(value: T): void {\n    const node = new Node(value);\n\n    if (this.#head) {\n      this.#tail!.next = node;\n      this.#tail = node;\n    } else {\n      this.#head = node;\n      this.#tail = node;\n    }\n\n    this.#size++;\n  }\n\n  dequeue(): T | undefined {\n    const current = this.#head;\n    if (!current) {\n      return;\n    }\n\n    this.#head = current.next;\n    this.#size--;\n    return current.value;\n  }\n\n  peek(): T | undefined {\n    if (!this.#head) {\n      return;\n    }\n\n    return this.#head.value;\n\n    // TODO: Node.js 18.\n    // return this.#head?.value;\n  }\n\n  clear(): void {\n    this.#head = undefined;\n    this.#tail = undefined;\n    this.#size = 0;\n  }\n\n  get size(): number {\n    return this.#size;\n  }\n\n  *[Symbol.iterator](): Generator<T, void, unknown> {\n    let current = this.#head;\n\n    while (current) {\n      yield current.value;\n      current = current.next;\n    }\n  }\n\n  *drain(): Generator<T | undefined, void, unknown> {\n    while (this.#head) {\n      yield this.dequeue();\n    }\n  }\n}\n\nexport const pLimit = (concurrency: number) => {\n  validateConcurrency(concurrency);\n\n  const queue = new Queue<() => void>();\n  let activeCount = 0;\n\n  const idleWaiters: Array<() => void> = [];\n  const notifyIdleIfNeeded = (): void => {\n    if (activeCount === 0 && queue.size === 0) {\n      while (idleWaiters.length) idleWaiters.pop()?.();\n    }\n  };\n\n  const resumeNext = (): void => {\n    // Process the next queued function if we're under the concurrency limit\n    if (activeCount < concurrency && queue.size > 0) {\n      activeCount++;\n      queue.dequeue()?.();\n    }\n  };\n\n  const next = (): void => {\n    activeCount--;\n    resumeNext();\n  };\n\n  const run = async (\n    fn: (...args: any[]) => Promise<any>,\n    resolve: (value: Promise<any>) => void,\n    arguments_: any[]\n  ): Promise<void> => {\n    // Execute the function and capture the result promise\n    const result = (async () => fn(...arguments_))();\n\n    // Resolve immediately with the promise (don't wait for completion)\n    resolve(result);\n\n    // Wait for the function to complete (success or failure)\n    // We catch errors here to prevent unhandled rejections,\n    // but the original promise rejection is preserved for the caller\n    try {\n      await result;\n    } catch {}\n\n    // Decrement active count and process next queued function\n    next();\n  };\n\n  const enqueue = (\n    fn: (...args: any[]) => Promise<any>,\n    resolve: (value: Promise<any>) => void,\n    arguments_: any[]\n  ): void => {\n    // Queue the internal resolve function instead of the run function\n    // to preserve the asynchronous execution context.\n    new Promise<void>((internalResolve) => {\n      queue.enqueue(internalResolve);\n    }).then(run.bind(undefined, fn, resolve, arguments_));\n\n    // Start processing immediately if we haven't reached the concurrency limit\n    if (activeCount < concurrency) {\n      resumeNext();\n    }\n  };\n\n  const generator = (\n    fn: (...args: any[]) => Promise<any>,\n    ...arguments_: any[]\n  ): Promise<any> =>\n    new Promise<any>((resolve) => {\n      enqueue(fn, resolve, arguments_);\n    });\n\n  Object.defineProperties(generator, {\n    activeCount: {\n      get: () => activeCount,\n    },\n    pendingCount: {\n      get: () => queue.size,\n    },\n    clearQueue: {\n      value() {\n        queue.clear();\n        notifyIdleIfNeeded();\n      },\n    },\n    concurrency: {\n      get: () => concurrency,\n\n      set(newConcurrency: number) {\n        validateConcurrency(newConcurrency);\n        concurrency = newConcurrency;\n\n        queueMicrotask(() => {\n          while (activeCount < concurrency && queue.size > 0) {\n            resumeNext();\n          }\n        });\n      },\n    },\n    map: {\n      async value<T, R>(\n        array: T[],\n        fn: (value: T, index: number) => Promise<R>\n      ): Promise<R[]> {\n        const promises = array.map((value, index) => this(fn, value, index));\n        return Promise.all(promises);\n      },\n    },\n    onIdle: {\n      /**\n       * Resolves when `activeCount === 0` and the queue is empty.\n       * Use this to wait for completion without holding a list of Promises.\n       */\n      value(): Promise<void> {\n        if (activeCount === 0 && queue.size === 0) return Promise.resolve();\n        return new Promise<void>((resolve) => idleWaiters.push(resolve));\n      },\n    },\n  });\n\n  return generator;\n};\n\nconst validateConcurrency = (concurrency: number): void => {\n  if (\n    !(\n      (Number.isInteger(concurrency) ||\n        concurrency === Number.POSITIVE_INFINITY) &&\n      concurrency > 0\n    )\n  ) {\n    throw new TypeError('Expected `concurrency` to be a number from 1 and up');\n  }\n};\n"],"mappings":";AAKA,IAAM,OAAN,MAAc;CACZ;CACA;CAEA,YAAY,OAAU;AACpB,OAAK,QAAQ;;;AAIjB,IAAa,QAAb,MAAsB;CACpB;CACA;CACA;CAEA,cAAc;AACZ,OAAK,OAAO;;CAGd,QAAQ,OAAgB;EACtB,MAAM,OAAO,IAAI,KAAK,MAAM;AAE5B,MAAI,MAAKA,MAAO;AACd,SAAKC,KAAO,OAAO;AACnB,SAAKA,OAAQ;SACR;AACL,SAAKD,OAAQ;AACb,SAAKC,OAAQ;;AAGf,QAAKC;;CAGP,UAAyB;EACvB,MAAM,UAAU,MAAKF;AACrB,MAAI,CAAC,QACH;AAGF,QAAKA,OAAQ,QAAQ;AACrB,QAAKE;AACL,SAAO,QAAQ;;CAGjB,OAAsB;AACpB,MAAI,CAAC,MAAKF,KACR;AAGF,SAAO,MAAKA,KAAM;;CAMpB,QAAc;AACZ,QAAKA,OAAQ;AACb,QAAKC,OAAQ;AACb,QAAKC,OAAQ;;CAGf,IAAI,OAAe;AACjB,SAAO,MAAKA;;CAGd,EAAE,OAAO,YAAyC;EAChD,IAAI,UAAU,MAAKF;AAEnB,SAAO,SAAS;AACd,SAAM,QAAQ;AACd,aAAU,QAAQ;;;CAItB,CAAC,QAAiD;AAChD,SAAO,MAAKA,KACV,OAAM,KAAK,SAAS;;;AAK1B,MAAa,UAAU,gBAAwB;AAC7C,qBAAoB,YAAY;CAEhC,MAAM,QAAQ,IAAI,OAAmB;CACrC,IAAI,cAAc;CAElB,MAAM,cAAiC,EAAE;CACzC,MAAM,2BAAiC;AACrC,MAAI,gBAAgB,KAAK,MAAM,SAAS,EACtC,QAAO,YAAY,OAAQ,aAAY,KAAK,IAAI;;CAIpD,MAAM,mBAAyB;AAE7B,MAAI,cAAc,eAAe,MAAM,OAAO,GAAG;AAC/C;AACA,SAAM,SAAS,IAAI;;;CAIvB,MAAM,aAAmB;AACvB;AACA,cAAY;;CAGd,MAAM,MAAM,OACV,IACA,SACA,eACkB;EAElB,MAAM,UAAU,YAAY,GAAG,GAAG,WAAW,GAAG;AAGhD,UAAQ,OAAO;AAKf,MAAI;AACF,SAAM;UACA;AAGR,QAAM;;CAGR,MAAM,WACJ,IACA,SACA,eACS;AAGT,MAAI,SAAe,oBAAoB;AACrC,SAAM,QAAQ,gBAAgB;IAC9B,CAAC,KAAK,IAAI,KAAK,QAAW,IAAI,SAAS,WAAW,CAAC;AAGrD,MAAI,cAAc,YAChB,aAAY;;CAIhB,MAAM,aACJ,IACA,GAAG,eAEH,IAAI,SAAc,YAAY;AAC5B,UAAQ,IAAI,SAAS,WAAW;GAChC;AAEJ,QAAO,iBAAiB,WAAW;EACjC,aAAa,EACX,WAAW,aACZ;EACD,cAAc,EACZ,WAAW,MAAM,MAClB;EACD,YAAY,EACV,QAAQ;AACN,SAAM,OAAO;AACb,uBAAoB;KAEvB;EACD,aAAa;GACX,WAAW;GAEX,IAAI,gBAAwB;AAC1B,wBAAoB,eAAe;AACnC,kBAAc;AAEd,yBAAqB;AACnB,YAAO,cAAc,eAAe,MAAM,OAAO,EAC/C,aAAY;MAEd;;GAEL;EACD,KAAK,EACH,MAAM,MACJ,OACA,IACc;GACd,MAAM,WAAW,MAAM,KAAK,OAAO,UAAU,KAAK,IAAI,OAAO,MAAM,CAAC;AACpE,UAAO,QAAQ,IAAI,SAAS;KAE/B;EACD,QAAQ,EAKN,QAAuB;AACrB,OAAI,gBAAgB,KAAK,MAAM,SAAS,EAAG,QAAO,QAAQ,SAAS;AACnE,UAAO,IAAI,SAAe,YAAY,YAAY,KAAK,QAAQ,CAAC;KAEnE;EACF,CAAC;AAEF,QAAO;;AAGT,MAAM,uBAAuB,gBAA8B;AACzD,KACE,GACG,OAAO,UAAU,YAAY,IAC5B,gBAAgB,OAAO,sBACzB,cAAc,GAGhB,OAAM,IAAI,UAAU,sDAAsD"}
+{"version":3,"file":"pLimit.mjs","names":["#head","#tail","#size"],"sources":["../../../src/utils/pLimit.ts"],"sourcesContent":["/*\nHow it works:\n`this.#head` is an instance of `Node` which keeps track of its current value and nests another instance of `Node` that keeps the value that comes after it. When a value is provided to `.enqueue()`, the code needs to iterate through `this.#head`, going deeper and deeper to find the last value. However, iterating through every single item is slow. This problem is solved by saving a reference to the last value as `this.#tail` so that it can reference it to add a new value.\n*/\n\nclass Node<T> {\n  value: T;\n  next: Node<T> | undefined;\n\n  constructor(value: T) {\n    this.value = value;\n  }\n}\n\nexport class Queue<T> {\n  #head: Node<T> | undefined;\n  #tail: Node<T> | undefined;\n  #size!: number;\n\n  constructor() {\n    this.clear();\n  }\n\n  enqueue(value: T): void {\n    const node = new Node(value);\n\n    if (this.#head) {\n      this.#tail!.next = node;\n      this.#tail = node;\n    } else {\n      this.#head = node;\n      this.#tail = node;\n    }\n\n    this.#size++;\n  }\n\n  dequeue(): T | undefined {\n    const current = this.#head;\n    if (!current) {\n      return;\n    }\n\n    this.#head = current.next;\n    this.#size--;\n    return current.value;\n  }\n\n  peek(): T | undefined {\n    if (!this.#head) {\n      return;\n    }\n\n    return this.#head.value;\n\n    // TODO: Node.js 18.\n    // return this.#head?.value;\n  }\n\n  clear(): void {\n    this.#head = undefined;\n    this.#tail = undefined;\n    this.#size = 0;\n  }\n\n  get size(): number {\n    return this.#size;\n  }\n\n  *[Symbol.iterator](): Generator<T, void, unknown> {\n    let current = this.#head;\n\n    while (current) {\n      yield current.value;\n      current = current.next;\n    }\n  }\n\n  *drain(): Generator<T | undefined, void, unknown> {\n    while (this.#head) {\n      yield this.dequeue();\n    }\n  }\n}\n\nexport const pLimit = (concurrency: number) => {\n  validateConcurrency(concurrency);\n\n  const queue = new Queue<() => void>();\n  let activeCount = 0;\n\n  const idleWaiters: Array<() => void> = [];\n  const notifyIdleIfNeeded = (): void => {\n    if (activeCount === 0 && queue.size === 0) {\n      while (idleWaiters.length) idleWaiters.pop()?.();\n    }\n  };\n\n  const resumeNext = (): void => {\n    // Process the next queued function if we're under the concurrency limit\n    if (activeCount < concurrency && queue.size > 0) {\n      activeCount++;\n      queue.dequeue()?.();\n    }\n  };\n\n  const next = (): void => {\n    activeCount--;\n    resumeNext();\n  };\n\n  const run = async (\n    fn: (...args: any[]) => Promise<any>,\n    resolve: (value: Promise<any>) => void,\n    arguments_: any[]\n  ): Promise<void> => {\n    // Execute the function and capture the result promise\n    const result = (async () => fn(...arguments_))();\n\n    // Resolve immediately with the promise (don't wait for completion)\n    resolve(result);\n\n    // Wait for the function to complete (success or failure)\n    // We catch errors here to prevent unhandled rejections,\n    // but the original promise rejection is preserved for the caller\n    try {\n      await result;\n    } catch {}\n\n    // Decrement active count and process next queued function\n    next();\n  };\n\n  const enqueue = (\n    fn: (...args: any[]) => Promise<any>,\n    resolve: (value: Promise<any>) => void,\n    arguments_: any[]\n  ): void => {\n    // Queue the internal resolve function instead of the run function\n    // to preserve the asynchronous execution context.\n    new Promise<void>((internalResolve) => {\n      queue.enqueue(internalResolve);\n    }).then(run.bind(undefined, fn, resolve, arguments_));\n\n    // Start processing immediately if we haven't reached the concurrency limit\n    if (activeCount < concurrency) {\n      resumeNext();\n    }\n  };\n\n  const generator = (\n    fn: (...args: any[]) => Promise<any>,\n    ...arguments_: any[]\n  ): Promise<any> =>\n    new Promise<any>((resolve) => {\n      enqueue(fn, resolve, arguments_);\n    });\n\n  Object.defineProperties(generator, {\n    activeCount: {\n      get: () => activeCount,\n    },\n    pendingCount: {\n      get: () => queue.size,\n    },\n    clearQueue: {\n      value() {\n        queue.clear();\n        notifyIdleIfNeeded();\n      },\n    },\n    concurrency: {\n      get: () => concurrency,\n\n      set(newConcurrency: number) {\n        validateConcurrency(newConcurrency);\n        concurrency = newConcurrency;\n\n        queueMicrotask(() => {\n          while (activeCount < concurrency && queue.size > 0) {\n            resumeNext();\n          }\n        });\n      },\n    },\n    map: {\n      async value<T, R>(\n        array: T[],\n        fn: (value: T, index: number) => Promise<R>\n      ): Promise<R[]> {\n        const promises = array.map((value, index) => this(fn, value, index));\n        return Promise.all(promises);\n      },\n    },\n    onIdle: {\n      /**\n       * Resolves when `activeCount === 0` and the queue is empty.\n       * Use this to wait for completion without holding a list of Promises.\n       */\n      value(): Promise<void> {\n        if (activeCount === 0 && queue.size === 0) return Promise.resolve();\n        return new Promise<void>((resolve) => idleWaiters.push(resolve));\n      },\n    },\n  });\n\n  return generator;\n};\n\nconst validateConcurrency = (concurrency: number): void => {\n  if (\n    !(\n      (Number.isInteger(concurrency) ||\n        concurrency === Number.POSITIVE_INFINITY) &&\n      concurrency > 0\n    )\n  ) {\n    throw new TypeError('Expected `concurrency` to be a number from 1 and up');\n  }\n};\n"],"mappings":"AAKA,IAAM,EAAN,KAAc,CACZ,MACA,KAEA,YAAY,EAAU,CACpB,KAAK,MAAQ,IAIJ,EAAb,KAAsB,CACpB,GACA,GACA,GAEA,aAAc,CACZ,KAAK,OAAO,CAGd,QAAQ,EAAgB,CACtB,IAAM,EAAO,IAAI,EAAK,EAAM,CAExB,MAAA,GACF,MAAA,EAAY,KAAO,EACnB,MAAA,EAAa,IAEb,MAAA,EAAa,EACb,MAAA,EAAa,GAGf,MAAA,IAGF,SAAyB,CACvB,IAAM,EAAU,MAAA,EACX,KAML,MAFA,OAAA,EAAa,EAAQ,KACrB,MAAA,IACO,EAAQ,MAGjB,MAAsB,CACf,SAAA,EAIL,OAAO,MAAA,EAAW,MAMpB,OAAc,CACZ,MAAA,EAAa,IAAA,GACb,MAAA,EAAa,IAAA,GACb,MAAA,EAAa,EAGf,IAAI,MAAe,CACjB,OAAO,MAAA,EAGT,EAAE,OAAO,WAAyC,CAChD,IAAI,EAAU,MAAA,EAEd,KAAO,GACL,MAAM,EAAQ,MACd,EAAU,EAAQ,KAItB,CAAC,OAAiD,CAChD,KAAO,MAAA,GACL,MAAM,KAAK,SAAS,GAK1B,MAAa,EAAU,GAAwB,CAC7C,EAAoB,EAAY,CAEhC,IAAM,EAAQ,IAAI,EACd,EAAc,EAEZ,EAAiC,EAAE,CACnC,MAAiC,CACrC,GAAI,IAAgB,GAAK,EAAM,OAAS,EACtC,KAAO,EAAY,QAAQ,EAAY,KAAK,IAAI,EAI9C,MAAyB,CAEzB,EAAc,GAAe,EAAM,KAAO,IAC5C,IACA,EAAM,SAAS,IAAI,GAIjB,MAAmB,CACvB,IACA,GAAY,EAGR,EAAM,MACV,EACA,EACA,IACkB,CAElB,IAAM,GAAU,SAAY,EAAG,GAAG,EAAW,GAAG,CAGhD,EAAQ,EAAO,CAKf,GAAI,CACF,MAAM,OACA,EAGR,GAAM,EAGF,GACJ,EACA,EACA,IACS,CAGT,IAAI,QAAe,GAAoB,CACrC,EAAM,QAAQ,EAAgB,EAC9B,CAAC,KAAK,EAAI,KAAK,IAAA,GAAW,EAAI,EAAS,EAAW,CAAC,CAGjD,EAAc,GAChB,GAAY,EAIV,GACJ,EACA,GAAG,IAEH,IAAI,QAAc,GAAY,CAC5B,EAAQ,EAAI,EAAS,EAAW,EAChC,CAkDJ,OAhDA,OAAO,iBAAiB,EAAW,CACjC,YAAa,CACX,QAAW,EACZ,CACD,aAAc,CACZ,QAAW,EAAM,KAClB,CACD,WAAY,CACV,OAAQ,CACN,EAAM,OAAO,CACb,GAAoB,EAEvB,CACD,YAAa,CACX,QAAW,EAEX,IAAI,EAAwB,CAC1B,EAAoB,EAAe,CACnC,EAAc,EAEd,mBAAqB,CACnB,KAAO,EAAc,GAAe,EAAM,KAAO,GAC/C,GAAY,EAEd,EAEL,CACD,IAAK,CACH,MAAM,MACJ,EACA,EACc,CACd,IAAM,EAAW,EAAM,KAAK,EAAO,IAAU,KAAK,EAAI,EAAO,EAAM,CAAC,CACpE,OAAO,QAAQ,IAAI,EAAS,EAE/B,CACD,OAAQ,CAKN,OAAuB,CAErB,OADI,IAAgB,GAAK,EAAM,OAAS,EAAU,QAAQ,SAAS,CAC5D,IAAI,QAAe,GAAY,EAAY,KAAK,EAAQ,CAAC,EAEnE,CACF,CAAC,CAEK,GAGH,EAAuB,GAA8B,CACzD,GACE,GACG,OAAO,UAAU,EAAY,EAC5B,IAAgB,MAClB,EAAc,GAGhB,MAAU,UAAU,sDAAsD"}

package/dist/esm/utils/parallelize.mjs

@@ -1,11 +1,2 @@
-import { pLimit } from "./pLimit.mjs";
-
-//#region src/utils/parallelize.ts
-const parallelize = async (items, callback = async (item) => item, parallelLimit = 10) => {
-	const limit = pLimit(parallelLimit);
-	return Promise.all(items.map((item) => limit(() => callback(item))));
-};
-
-//#endregion
-export { parallelize };
+import{pLimit as e}from"./pLimit.mjs";const t=async(t,n=async e=>e,r=10)=>{let i=e(r);return Promise.all(t.map(e=>i(()=>n(e))))};export{t as parallelize};
 //# sourceMappingURL=parallelize.mjs.map

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

@@ -1 +1 @@
-{"version":3,"file":"parallelize.mjs","names":[],"sources":["../../../src/utils/parallelize.ts"],"sourcesContent":["import { pLimit } from './pLimit';\n\nexport const parallelize = async <T, R>(\n  items: T[],\n  callback: (item: T) => Promise<R> = async (item) =>\n    item as unknown as Promise<R>,\n  parallelLimit: number = 10\n): Promise<R[]> => {\n  const limit = pLimit(parallelLimit);\n  return Promise.all(items.map((item) => limit(() => callback(item))));\n};\n"],"mappings":";;;AAEA,MAAa,cAAc,OACzB,OACA,WAAoC,OAAO,SACzC,MACF,gBAAwB,OACP;CACjB,MAAM,QAAQ,OAAO,cAAc;AACnC,QAAO,QAAQ,IAAI,MAAM,KAAK,SAAS,YAAY,SAAS,KAAK,CAAC,CAAC,CAAC"}
+{"version":3,"file":"parallelize.mjs","names":[],"sources":["../../../src/utils/parallelize.ts"],"sourcesContent":["import { pLimit } from './pLimit';\n\nexport const parallelize = async <T, R>(\n  items: T[],\n  callback: (item: T) => Promise<R> = async (item) =>\n    item as unknown as Promise<R>,\n  parallelLimit: number = 10\n): Promise<R[]> => {\n  const limit = pLimit(parallelLimit);\n  return Promise.all(items.map((item) => limit(() => callback(item))));\n};\n"],"mappings":"sCAEA,MAAa,EAAc,MACzB,EACA,EAAoC,KAAO,IACzC,EACF,EAAwB,KACP,CACjB,IAAM,EAAQ,EAAO,EAAc,CACnC,OAAO,QAAQ,IAAI,EAAM,IAAK,GAAS,MAAY,EAAS,EAAK,CAAC,CAAC,CAAC"}

package/dist/esm/utils/parallelizeGlobal.mjs

@@ -1,27 +1,2 @@
-import { pLimit } from "./pLimit.mjs";
-
-//#region src/utils/parallelizeGlobal.ts
-let _globalLimiter = null;
-/** Get (and optionally configure) the single, shared limiter. */
-const getGlobalLimiter = (concurrency) => {
-	if (!_globalLimiter) _globalLimiter = pLimit(concurrency ?? 10);
-	else if (typeof concurrency === "number") _globalLimiter.concurrency = concurrency;
-	return _globalLimiter;
-};
-let _taskLimiter = null;
-/** Limits how many *tasks* run concurrently (independent from AI calls). */
-const getTaskLimiter = (concurrency) => {
-	if (!_taskLimiter) _taskLimiter = pLimit(concurrency ?? 5);
-	else if (typeof concurrency === "number") _taskLimiter.concurrency = concurrency;
-	return _taskLimiter;
-};
-const parallelizeGlobal = async (items, callback = async (item) => item, options) => {
-	const limiter = options?.limiter ?? getGlobalLimiter(options?.concurrency);
-	const run = options?.wrapInLimiter ?? true ? (fn) => limiter(fn) : (fn) => fn();
-	const promises = items.map((item, index) => run(() => callback(item, index)));
-	return Promise.all(promises);
-};
-
-//#endregion
-export { getGlobalLimiter, getTaskLimiter, parallelizeGlobal };
+import{pLimit as e}from"./pLimit.mjs";let t=null;const n=n=>(t?typeof n==`number`&&(t.concurrency=n):t=e(n??10),t);let r=null;const i=t=>(r?typeof t==`number`&&(r.concurrency=t):r=e(t??5),r),a=async(e,t=async e=>e,r)=>{let i=r?.limiter??n(r?.concurrency),a=r?.wrapInLimiter??!0?e=>i(e):e=>e(),o=e.map((e,n)=>a(()=>t(e,n)));return Promise.all(o)};export{n as getGlobalLimiter,i as getTaskLimiter,a as parallelizeGlobal};
 //# sourceMappingURL=parallelizeGlobal.mjs.map