extract-base-iterator 3.3.5 → 3.4.0

package/dist/cjs/shared/compat.d.cts

@@ -11,6 +11,12 @@
  *
  * Solution: Feature detection with graceful fallback in both directions.
  */
+export declare const MAX_SAFE_BUFFER_LENGTH: number;
+/**
+ * Check if a buffer size can be safely allocated on this Node version
+ * Uses conservative limit to work across all versions
+ */
+export declare function canAllocateBufferSize(size: number): boolean;
 /**
  * Allocate a zero-filled buffer (safe) - handles very large allocations
  * - Uses Buffer.alloc() on Node 4.5+

package/dist/cjs/shared/compat.d.ts

@@ -11,6 +11,12 @@
  *
  * Solution: Feature detection with graceful fallback in both directions.
  */
+export declare const MAX_SAFE_BUFFER_LENGTH: number;
+/**
+ * Check if a buffer size can be safely allocated on this Node version
+ * Uses conservative limit to work across all versions
+ */
+export declare function canAllocateBufferSize(size: number): boolean;
 /**
  * Allocate a zero-filled buffer (safe) - handles very large allocations
  * - Uses Buffer.alloc() on Node 4.5+

package/dist/cjs/shared/compat.js

@@ -22,6 +22,9 @@ function _export(target, all) {
     });
 }
 _export(exports, {
+    get MAX_SAFE_BUFFER_LENGTH () {
+        return MAX_SAFE_BUFFER_LENGTH;
+    },
     get PassThrough () {
         return PassThrough;
     },
@@ -55,6 +58,9 @@ _export(exports, {
     get bufferSliceCopy () {
         return bufferSliceCopy;
     },
+    get canAllocateBufferSize () {
+        return canAllocateBufferSize;
+    },
     get createInflateRawStream () {
         return createInflateRawStream;
     },
@@ -92,17 +98,11 @@ var _require = typeof require === 'undefined' ? _module.default.createRequire(re
 var hasBufferAlloc = typeof Buffer.alloc === 'function';
 var hasBufferAllocUnsafe = typeof Buffer.allocUnsafe === 'function';
 var hasBufferFrom = typeof Buffer.from === 'function' && Buffer.from !== Uint8Array.from;
-// Maximum buffer size that works across all Node.js versions
-// Node 0.8-4.x: kMaxLength = 0x3fffffff (~1073MB) but actual limit may be lower
-// Node 6-7.x: ~1073MB for Uint8Array
-// Node 8+: ~2GB for Buffer
-// Node 10+: 2^31-1 (~2147MB) for Buffer.allocUnsafe
-// Use 128MB as a conservative limit for buffer operations
-var MAX_SAFE_BUFFER_LENGTH = 128 * 1024 * 1024; // 128MB
+var MAX_SAFE_BUFFER_LENGTH = 256 * 1024 * 1024; // 256MB
 // Try to detect the actual kMaxLength for this Node version
 // If we can't detect it (older Node), assume conservative limit
 var DETECTED_MAX_LENGTH = null;
-function _getMaxBufferLength() {
+function getMaxBufferLength() {
     if (DETECTED_MAX_LENGTH !== null) return DETECTED_MAX_LENGTH;
     // Try to detect the actual limit
     // kMaxLength exists on BufferConstructor in newer TypeScript definitions
@@ -116,10 +116,7 @@ function _getMaxBufferLength() {
     }
     return DETECTED_MAX_LENGTH;
 }
-/**
- * Check if a buffer size can be safely allocated on this Node version
- * Uses conservative limit to work across all versions
- */ function canAllocateBufferSize(size) {
+function canAllocateBufferSize(size) {
     return size >= 0 && size <= MAX_SAFE_BUFFER_LENGTH;
 }
 /**
@@ -133,36 +130,29 @@ function _getMaxBufferLength() {
     return buf;
 }
 /**
- * Combine an array of buffers into one by pairwise concatenation
- * Each combination produces a buffer at most 2x MAX_SAFE_BUFFER_LENGTH (256MB)
- * which is within kMaxLength for all Node versions
+ * Combine an array of buffers into one by iterative concatenation
+ * Stays under the actual kMaxLength for each Node version
+ * Uses a "fill and continue" approach
  */ function combineBuffersPairwise(buffers) {
-    while(buffers.length > 1){
-        var newBuffers = [];
-        for(var i = 0; i < buffers.length; i += 2){
-            if (i + 1 < buffers.length) {
-                var size1 = buffers[i].length;
-                var size2 = buffers[i + 1].length;
-                var combinedSize = size1 + size2;
-                // Safe: combinedSize <= 2 * MAX_SAFE_BUFFER_LENGTH = 256MB
-                var combined = createChunk(combinedSize, false);
-                buffers[i].copy(combined, 0);
-                buffers[i + 1].copy(combined, size1);
-                newBuffers.push(combined);
-            } else {
-                newBuffers.push(buffers[i]);
-            }
-        }
-        // Clear old references to help GC and use traditional for loop for Node 0.8 compatibility
-        for(var j = 0; j < buffers.length; j++){
-            buffers[j] = undefined;
-        }
-        buffers.length = 0;
-        for(var j1 = 0; j1 < newBuffers.length; j1++){
-            buffers.push(newBuffers[j1]);
-        }
+    var maxLength = getMaxBufferLength();
+    // Calculate total size
+    var totalSize = 0;
+    for(var i = 0; i < buffers.length; i++){
+        totalSize += buffers[i].length;
+    }
+    // If total exceeds this Node version's limit, we cannot combine
+    // LZMA1 requires a single contiguous Buffer input
+    if (totalSize > maxLength) {
+        throw new Error("Cannot combine buffers: total size (".concat(totalSize, " bytes) exceeds Node.js buffer limit (").concat(maxLength, " bytes). LZMA1 archives with folders larger than ").concat(Math.floor(maxLength / 1024 / 1024), "MB cannot be processed on this Node version."));
     }
-    return buffers[0];
+    // If everything fits in a single allocation, do it directly
+    var result = createChunk(totalSize, false);
+    var offset = 0;
+    for(var i1 = 0; i1 < buffers.length; i1++){
+        buffers[i1].copy(result, offset);
+        offset += buffers[i1].length;
+    }
+    return result;
 }
 /**
  * Allocate a large buffer by allocating in chunks and combining them

package/dist/cjs/shared/compat.js.map

@@ -1 +1 @@
-{"version":3,"sources":["/Users/kevin/Dev/OpenSource/iterators/extract-base-iterator/src/shared/compat.ts"],"sourcesContent":["/**\n * Buffer Compatibility Layer for Node.js 0.8+\n *\n * Provides buffer utilities that work across all Node.js versions\n * WITHOUT modifying global Buffer object.\n *\n * Version history:\n * - Node 0.8-4.4: Only has `new Buffer()`, no `Buffer.alloc/from`\n * - Node 4.5+: Has `Buffer.alloc/from`, deprecates `new Buffer()`\n * - Node 10+: Warns or errors on `new Buffer()`\n *\n * Solution: Feature detection with graceful fallback in both directions.\n */\n\n// ESM-compatible require - works in both CJS and ESM\nimport Module from 'module';\n\nconst _require = typeof require === 'undefined' ? Module.createRequire(import.meta.url) : require;\n\n// Feature detection (runs once at module load)\nconst hasBufferAlloc = typeof Buffer.alloc === 'function';\nconst hasBufferAllocUnsafe = typeof Buffer.allocUnsafe === 'function';\nconst hasBufferFrom = typeof Buffer.from === 'function' && Buffer.from !== Uint8Array.from;\n\n// Maximum buffer size that works across all Node.js versions\n// Node 0.8-4.x: kMaxLength = 0x3fffffff (~1073MB) but actual limit may be lower\n// Node 6-7.x: ~1073MB for Uint8Array\n// Node 8+: ~2GB for Buffer\n// Node 10+: 2^31-1 (~2147MB) for Buffer.allocUnsafe\n// Use 128MB as a conservative limit for buffer operations\nconst MAX_SAFE_BUFFER_LENGTH = 128 * 1024 * 1024; // 128MB\n\n// Try to detect the actual kMaxLength for this Node version\n// If we can't detect it (older Node), assume conservative limit\nlet DETECTED_MAX_LENGTH: number | null = null;\n\nfunction _getMaxBufferLength(): number {\n  if (DETECTED_MAX_LENGTH !== null) return DETECTED_MAX_LENGTH;\n\n  // Try to detect the actual limit\n  // kMaxLength exists on BufferConstructor in newer TypeScript definitions\n  // but may not exist at runtime on very old Node\n  const maxLen = (Buffer as { kMaxLength?: number }).kMaxLength;\n  if (maxLen !== undefined) {\n    DETECTED_MAX_LENGTH = maxLen;\n  } else {\n    // Older Node - use conservative estimate\n    DETECTED_MAX_LENGTH = 0x3fffffff; // ~1073MB\n  }\n\n  return DETECTED_MAX_LENGTH;\n}\n\n/**\n * Check if a buffer size can be safely allocated on this Node version\n * Uses conservative limit to work across all versions\n */\nfunction canAllocateBufferSize(size: number): boolean {\n  return size >= 0 && size <= MAX_SAFE_BUFFER_LENGTH;\n}\n\n/**\n * Create a single chunk of the specified size\n */\nfunction createChunk(size: number, zeroFill: boolean): Buffer {\n  if (hasBufferAlloc) {\n    return Buffer.alloc(size);\n  }\n  const buf = new Buffer(size);\n  if (zeroFill) buf.fill(0);\n  return buf;\n}\n\n/**\n * Combine an array of buffers into one by pairwise concatenation\n * Each combination produces a buffer at most 2x MAX_SAFE_BUFFER_LENGTH (256MB)\n * which is within kMaxLength for all Node versions\n */\nfunction combineBuffersPairwise(buffers: Buffer[]): Buffer {\n  while (buffers.length > 1) {\n    const newBuffers: Buffer[] = [];\n\n    for (let i = 0; i < buffers.length; i += 2) {\n      if (i + 1 < buffers.length) {\n        const size1 = buffers[i].length;\n        const size2 = buffers[i + 1].length;\n        const combinedSize = size1 + size2;\n\n        // Safe: combinedSize <= 2 * MAX_SAFE_BUFFER_LENGTH = 256MB\n        const combined = createChunk(combinedSize, false);\n        buffers[i].copy(combined, 0);\n        buffers[i + 1].copy(combined, size1);\n        newBuffers.push(combined);\n      } else {\n        newBuffers.push(buffers[i]);\n      }\n    }\n\n    // Clear old references to help GC and use traditional for loop for Node 0.8 compatibility\n    for (let j = 0; j < buffers.length; j++) {\n      buffers[j] = undefined as unknown as Buffer;\n    }\n    buffers.length = 0;\n    for (let j = 0; j < newBuffers.length; j++) {\n      buffers.push(newBuffers[j]);\n    }\n  }\n\n  return buffers[0];\n}\n\n/**\n * Allocate a large buffer by allocating in chunks and combining them\n * Handles both zero-filled (safe) and uninitialized (unsafe) variants\n */\nfunction allocBufferLarge(size: number, zeroFill: boolean): Buffer {\n  // For large sizes, allocate smaller chunks and combine them\n  const numChunks = Math.ceil(size / MAX_SAFE_BUFFER_LENGTH);\n  const chunks: Buffer[] = [];\n\n  // Allocate individual chunks (each <= MAX_SAFE_BUFFER_LENGTH)\n  for (let i = 0; i < numChunks; i++) {\n    const chunkSize = Math.min(MAX_SAFE_BUFFER_LENGTH, size - i * MAX_SAFE_BUFFER_LENGTH);\n    chunks.push(createChunk(chunkSize, zeroFill));\n  }\n\n  // Combine chunks iteratively using pairwise combination\n  return combineBuffersPairwise(chunks);\n}\n\n/**\n * Allocate a zero-filled buffer (safe) - handles very large allocations\n * - Uses Buffer.alloc() on Node 4.5+\n * - Falls back to new Buffer() + fill on Node 0.8-4.4\n * - For sizes > MAX_SAFE_BUFFER_LENGTH, allocates in chunks and copies\n */\nexport function allocBuffer(size: number): Buffer {\n  if (size === 0) {\n    return new Buffer(0);\n  }\n\n  // Use native allocation for sizes within safe limits\n  if (canAllocateBufferSize(size)) {\n    if (hasBufferAlloc) {\n      return Buffer.alloc(size);\n    }\n    // Legacy fallback: new Buffer() is uninitialized, must zero-fill\n    const buf = new Buffer(size);\n    buf.fill(0);\n    return buf;\n  }\n\n  // For large sizes, allocate in chunks with zero-filling\n  return allocBufferLarge(size, true);\n}\n\n/**\n * Allocate a buffer without initialization (unsafe but faster)\n * - Uses Buffer.allocUnsafe() on Node 4.5+\n * - Falls back to new Buffer() on Node 0.8-4.4\n * - For sizes > MAX_SAFE_BUFFER_LENGTH, allocates in chunks without zeroing\n *\n * WARNING: Buffer contents are uninitialized and may contain sensitive data.\n * Only use when you will immediately overwrite all bytes.\n */\nexport function allocBufferUnsafe(size: number): Buffer {\n  if (size === 0) {\n    return new Buffer(0);\n  }\n\n  // Use native allocation for sizes within safe limits\n  if (canAllocateBufferSize(size)) {\n    if (hasBufferAllocUnsafe) {\n      return Buffer.allocUnsafe(size);\n    }\n    return new Buffer(size);\n  }\n\n  // For large sizes, allocate in chunks without zero-filling\n  return allocBufferLarge(size, false);\n}\n\n/**\n * Create a buffer from string, array, or existing buffer\n * - Uses Buffer.from() on Node 4.5+\n * - Falls back to new Buffer() on Node 0.8-4.4\n * - Handles Uint8Array conversion for Node 0.8 (crypto output compatibility)\n */\nexport function bufferFrom(data: string | number[] | Buffer | Uint8Array, encoding?: BufferEncoding): Buffer {\n  if (hasBufferFrom) {\n    if (typeof data === 'string') {\n      return Buffer.from(data, encoding);\n    }\n    return Buffer.from(data as number[] | Buffer);\n  }\n  // Node 0.8 compatibility - deprecated Buffer constructor\n  // For Uint8Array, convert to array first (needed for crypto output in Node 0.8)\n  if (data instanceof Uint8Array && !(data instanceof Buffer)) {\n    const arr: number[] = [];\n    for (let i = 0; i < data.length; i++) {\n      arr.push(data[i]);\n    }\n    return new Buffer(arr);\n  }\n  return new Buffer(data as string & number[], encoding);\n}\n\n/**\n * Compare two buffers or buffer regions\n * - Uses Buffer.compare() on Node 5.10+ (with offset support)\n * - Falls back to manual comparison on Node 0.8-5.9\n */\nexport function bufferCompare(source: Buffer, target: Buffer, targetStart?: number, targetEnd?: number, sourceStart?: number, sourceEnd?: number): number {\n  sourceStart = sourceStart || 0;\n  sourceEnd = sourceEnd || source.length;\n  targetStart = targetStart || 0;\n  targetEnd = targetEnd || target.length;\n\n  // Check if native compare with offset support exists (Node 5.10+)\n  if (source.compare && source.compare.length >= 5) {\n    return source.compare(target, targetStart, targetEnd, sourceStart, sourceEnd);\n  }\n\n  // Manual comparison for older Node versions\n  const sourceLen = sourceEnd - sourceStart;\n  const targetLen = targetEnd - targetStart;\n  const len = Math.min(sourceLen, targetLen);\n\n  for (let i = 0; i < len; i++) {\n    const s = source[sourceStart + i];\n    const t = target[targetStart + i];\n    if (s !== t) return s < t ? -1 : 1;\n  }\n\n  return sourceLen - targetLen;\n}\n\n/**\n * Check if buffer region equals byte array\n * Useful for magic number detection without Buffer.from()\n */\nexport function bufferEquals(buf: Buffer, offset: number, expected: number[]): boolean {\n  if (offset + expected.length > buf.length) return false;\n  for (let i = 0; i < expected.length; i++) {\n    if (buf[offset + i] !== expected[i]) return false;\n  }\n  return true;\n}\n\n/**\n * Copy buffer region to new buffer\n * Works on all Node versions\n */\nexport function bufferSliceCopy(buf: Buffer, start: number, end: number): Buffer {\n  const result = allocBuffer(end - start);\n  buf.copy(result, 0, start, end);\n  return result;\n}\n\n/**\n * Read 64-bit unsigned integer (little-endian)\n * Uses two 32-bit reads since BigInt not available until Node 10.4\n *\n * WARNING: Only accurate for values < Number.MAX_SAFE_INTEGER (2^53 - 1)\n * This covers files up to ~9 PB which is practical for all real use cases.\n */\nexport function readUInt64LE(buf: Buffer, offset: number): number {\n  const low = buf.readUInt32LE(offset);\n  const high = buf.readUInt32LE(offset + 4);\n  return high * 0x100000000 + low;\n}\n\n/**\n * Write 64-bit unsigned integer (little-endian)\n * Same precision limitation as readUInt64LE\n */\nexport function writeUInt64LE(buf: Buffer, value: number, offset: number): void {\n  const low = value >>> 0;\n  const high = (value / 0x100000000) >>> 0;\n  buf.writeUInt32LE(low, offset);\n  buf.writeUInt32LE(high, offset + 4);\n}\n\n/**\n * Concatenate buffers - compatible with Node 0.8+\n * Handles crypto output which may not be proper Buffer instances in old Node.\n * Also handles very large concatenations that would exceed buffer limits.\n *\n * NOTE: This function is primarily needed for AES decryption compatibility\n * in Node 0.8 where crypto output may not be proper Buffer instances.\n * Libraries not using crypto can use native Buffer.concat() directly.\n */\nexport function bufferConcat(list: (Buffer | Uint8Array)[], totalLength?: number): Buffer {\n  // Calculate actual total length first\n  let actualLength = 0;\n  for (let i = 0; i < list.length; i++) {\n    actualLength += list[i].length;\n  }\n\n  // Use specified totalLength or actual length\n  const targetLength = totalLength !== undefined ? totalLength : actualLength;\n\n  // Handle empty list\n  if (list.length === 0) {\n    return new Buffer(0);\n  }\n\n  // Handle very large concatenations that would exceed buffer limits\n  // Use native Buffer.concat for smaller sizes (faster)\n  if (targetLength <= MAX_SAFE_BUFFER_LENGTH) {\n    // Check if all items are proper Buffers AND no truncation needed\n    // (Node 0.8's Buffer.concat doesn't handle truncation well)\n    let allBuffers = true;\n    for (let j = 0; j < list.length; j++) {\n      if (!(list[j] instanceof Buffer)) {\n        allBuffers = false;\n        break;\n      }\n    }\n    if (allBuffers && targetLength >= actualLength) {\n      return Buffer.concat(list as Buffer[], targetLength);\n    }\n  }\n\n  // For large or complex concatenations, use chunked approach\n  // This will use allocBuffer which handles large sizes via chunking\n  const result = allocBuffer(targetLength);\n  let offset = 0;\n\n  for (let k = 0; k < list.length && offset < targetLength; k++) {\n    const buf = list[k];\n    const toCopy = Math.min(buf.length, targetLength - offset);\n\n    if (buf instanceof Buffer) {\n      buf.copy(result, offset, 0, toCopy);\n    } else {\n      // Uint8Array - need to copy byte by byte\n      for (let l = 0; l < toCopy; l++) {\n        result[offset + l] = buf[l];\n      }\n    }\n    offset += toCopy;\n  }\n\n  return result;\n}\n\n/**\n * Node 0.8 compatible isNaN (Number.isNaN didn't exist until ES2015)\n * Uses self-comparison: NaN is the only value not equal to itself\n */\n// biome-ignore lint/suspicious/noShadowRestrictedNames: Legacy compatibility\nexport function isNaN(value: number): boolean {\n  // biome-ignore lint/suspicious/noSelfCompare: NaN check pattern\n  return value !== value;\n}\n\n/**\n * Decompress raw DEFLATE data (no zlib/gzip header)\n * - Uses native zlib.inflateRawSync() on Node 0.11.12+\n * - Falls back to pako for Node 0.8-0.10\n *\n * Version history:\n * - Node 0.8-0.10: No zlib sync methods, use pako\n * - Node 0.11.12+: zlib.inflateRawSync available\n */\n// Feature detection for native zlib sync methods (Node 0.11.12+)\nlet zlib: typeof import('zlib') | null = null;\ntry {\n  zlib = _require('zlib');\n} catch (_e) {\n  // zlib not available (shouldn't happen in Node.js)\n}\nconst hasNativeInflateRaw = zlib !== null && typeof zlib.inflateRawSync === 'function';\n\nexport function inflateRaw(input: Buffer): Buffer {\n  if (hasNativeInflateRaw && zlib) {\n    return zlib.inflateRawSync(input);\n  }\n  // Fallback to pako for Node 0.8-0.10\n  const pako = _require('pako');\n  return bufferFrom(pako.inflateRaw(input));\n}\n\n/**\n * Create a streaming raw DEFLATE decompressor (Transform stream)\n * Decompresses data incrementally to avoid holding full output in memory.\n *\n * - Uses native zlib.createInflateRaw() on Node 0.11.12+\n * - Falls back to pako-based Transform for Node 0.8-0.10\n *\n * @returns A Transform stream that decompresses raw DEFLATE data\n */\n// Check for native streaming inflate (Node 0.11.12+ has createInflateRaw)\n// biome-ignore lint/suspicious/noExplicitAny: createInflateRaw not in older TS definitions\nconst hasNativeStreamingInflate = zlib !== null && typeof (zlib as any).createInflateRaw === 'function';\n\nexport function createInflateRawStream(): NodeJS.ReadWriteStream {\n  if (hasNativeStreamingInflate && zlib) {\n    // Use native zlib streaming Transform\n    // biome-ignore lint/suspicious/noExplicitAny: createInflateRaw not in older TS definitions\n    return (zlib as any).createInflateRaw();\n  }\n\n  // Fallback to pako-based Transform for Node 0.8-0.10\n  // Use readable-stream for Node 0.8 compatibility\n  const Transform = _require('readable-stream').Transform;\n  const pako = _require('pako');\n\n  const inflate = new pako.Inflate({ raw: true, chunkSize: 16384 });\n  const transform = new Transform();\n  const pendingChunks: Buffer[] = [];\n  let ended = false;\n\n  // Pako calls onData synchronously during push()\n  inflate.onData = (chunk: Uint8Array) => {\n    pendingChunks.push(bufferFrom(chunk));\n  };\n\n  inflate.onEnd = (status: number) => {\n    ended = true;\n    if (status !== 0) {\n      transform.emit('error', new Error(`Inflate error: ${inflate.msg || 'unknown'}`));\n    }\n  };\n\n  transform._transform = function (chunk: Buffer, _encoding: string, callback: (err?: Error) => void) {\n    try {\n      inflate.push(chunk, false);\n      // Push any pending decompressed chunks\n      while (pendingChunks.length > 0) {\n        this.push(pendingChunks.shift());\n      }\n      callback();\n    } catch (err) {\n      callback(err as Error);\n    }\n  };\n\n  transform._flush = function (callback: (err?: Error) => void) {\n    try {\n      inflate.push(new Uint8Array(0), true); // Signal end\n      // Push any remaining decompressed chunks\n      while (pendingChunks.length > 0) {\n        this.push(pendingChunks.shift());\n      }\n      if (ended && inflate.err) {\n        callback(new Error(`Inflate error: ${inflate.msg || 'unknown'}`));\n      } else {\n        callback();\n      }\n    } catch (err) {\n      callback(err as Error);\n    }\n  };\n\n  return transform;\n}\n\n/**\n * Object.assign wrapper for Node.js 0.8+\n * - Uses native Object.assign on Node 4.0+\n * - Falls back to manual property copy on Node 0.8-3.x\n */\nconst hasObjectAssign = typeof Object.assign === 'function';\nconst _hasOwnProperty = Object.prototype.hasOwnProperty;\n\nexport function objectAssign<T, U>(target: T, source: U): T & U {\n  if (hasObjectAssign) return Object.assign(target, source);\n\n  for (const key in source) {\n    if (_hasOwnProperty.call(source, key)) (target as Record<string, unknown>)[key] = source[key];\n  }\n  return target as T & U;\n}\n\n/**\n * Stream compatibility - Transform class\n * - Uses native stream.Transform on Node 0.10+\n * - Falls back to readable-stream for Node 0.8\n */\nconst major = +process.versions.node.split('.')[0];\nexport const Readable: typeof import('stream').Readable = major > 0 ? _require('stream').Readable : _require('readable-stream').Readable;\nexport const Writable: typeof import('stream').Writable = major > 0 ? _require('stream').Writable : _require('readable-stream').Writable;\nexport const Transform: typeof import('stream').Transform = major > 0 ? _require('stream').Transform : _require('readable-stream').Transform;\nexport const PassThrough: typeof import('stream').PassThrough = major > 0 ? _require('stream').PassThrough : _require('readable-stream').PassThrough;\n"],"names":["PassThrough","Readable","Transform","Writable","allocBuffer","allocBufferUnsafe","bufferCompare","bufferConcat","bufferEquals","bufferFrom","bufferSliceCopy","createInflateRawStream","inflateRaw","isNaN","objectAssign","readUInt64LE","writeUInt64LE","_require","require","Module","createRequire","hasBufferAlloc","Buffer","alloc","hasBufferAllocUnsafe","allocUnsafe","hasBufferFrom","from","Uint8Array","MAX_SAFE_BUFFER_LENGTH","DETECTED_MAX_LENGTH","_getMaxBufferLength","maxLen","kMaxLength","undefined","canAllocateBufferSize","size","createChunk","zeroFill","buf","fill","combineBuffersPairwise","buffers","length","newBuffers","i","size1","size2","combinedSize","combined","copy","push","j","allocBufferLarge","numChunks","Math","ceil","chunks","chunkSize","min","data","encoding","arr","source","target","targetStart","targetEnd","sourceStart","sourceEnd","compare","sourceLen","targetLen","len","s","t","offset","expected","start","end","result","low","readUInt32LE","high","value","writeUInt32LE","list","totalLength","actualLength","targetLength","allBuffers","concat","k","toCopy","l","zlib","_e","hasNativeInflateRaw","inflateRawSync","input","pako","hasNativeStreamingInflate","createInflateRaw","inflate","Inflate","raw","transform","pendingChunks","ended","onData","chunk","onEnd","status","emit","Error","msg","_transform","_encoding","callback","shift","err","_flush","hasObjectAssign","Object","assign","_hasOwnProperty","prototype","hasOwnProperty","key","call","major","process","versions","node","split"],"mappings":"AAAA;;;;;;;;;;;;CAYC,GAED,qDAAqD;;;;;;;;;;;;QAudxCA;eAAAA;;QAHAC;eAAAA;;QAEAC;eAAAA;;QADAC;eAAAA;;QA3VGC;eAAAA;;QA6BAC;eAAAA;;QA+CAC;eAAAA;;QAgFAC;eAAAA;;QAnDAC;eAAAA;;QArDAC;eAAAA;;QAiEAC;eAAAA;;QAgJAC;eAAAA;;QAtBAC;eAAAA;;QAvBAC;eAAAA;;QAmHAC;eAAAA;;QAzMAC;eAAAA;;QAUAC;eAAAA;;;6DArQG;;;;;;;;;;;;;AAEnB,IAAMC,WAAW,OAAOC,YAAY,cAAcC,eAAM,CAACC,aAAa,CAAC,uDAAmBF;AAE1F,+CAA+C;AAC/C,IAAMG,iBAAiB,OAAOC,OAAOC,KAAK,KAAK;AAC/C,IAAMC,uBAAuB,OAAOF,OAAOG,WAAW,KAAK;AAC3D,IAAMC,gBAAgB,OAAOJ,OAAOK,IAAI,KAAK,cAAcL,OAAOK,IAAI,KAAKC,WAAWD,IAAI;AAE1F,6DAA6D;AAC7D,gFAAgF;AAChF,qCAAqC;AACrC,2BAA2B;AAC3B,oDAAoD;AACpD,0DAA0D;AAC1D,IAAME,yBAAyB,MAAM,OAAO,MAAM,QAAQ;AAE1D,4DAA4D;AAC5D,gEAAgE;AAChE,IAAIC,sBAAqC;AAEzC,SAASC;IACP,IAAID,wBAAwB,MAAM,OAAOA;IAEzC,iCAAiC;IACjC,yEAAyE;IACzE,gDAAgD;IAChD,IAAME,SAAS,AAACV,OAAmCW,UAAU;IAC7D,IAAID,WAAWE,WAAW;QACxBJ,sBAAsBE;IACxB,OAAO;QACL,yCAAyC;QACzCF,sBAAsB,YAAY,UAAU;IAC9C;IAEA,OAAOA;AACT;AAEA;;;CAGC,GACD,SAASK,sBAAsBC,IAAY;IACzC,OAAOA,QAAQ,KAAKA,QAAQP;AAC9B;AAEA;;CAEC,GACD,SAASQ,YAAYD,IAAY,EAAEE,QAAiB;IAClD,IAAIjB,gBAAgB;QAClB,OAAOC,OAAOC,KAAK,CAACa;IACtB;IACA,IAAMG,MAAM,IAAIjB,OAAOc;IACvB,IAAIE,UAAUC,IAAIC,IAAI,CAAC;IACvB,OAAOD;AACT;AAEA;;;;CAIC,GACD,SAASE,uBAAuBC,OAAiB;IAC/C,MAAOA,QAAQC,MAAM,GAAG,EAAG;QACzB,IAAMC,aAAuB,EAAE;QAE/B,IAAK,IAAIC,IAAI,GAAGA,IAAIH,QAAQC,MAAM,EAAEE,KAAK,EAAG;YAC1C,IAAIA,IAAI,IAAIH,QAAQC,MAAM,EAAE;gBAC1B,IAAMG,QAAQJ,OAAO,CAACG,EAAE,CAACF,MAAM;gBAC/B,IAAMI,QAAQL,OAAO,CAACG,IAAI,EAAE,CAACF,MAAM;gBACnC,IAAMK,eAAeF,QAAQC;gBAE7B,2DAA2D;gBAC3D,IAAME,WAAWZ,YAAYW,cAAc;gBAC3CN,OAAO,CAACG,EAAE,CAACK,IAAI,CAACD,UAAU;gBAC1BP,OAAO,CAACG,IAAI,EAAE,CAACK,IAAI,CAACD,UAAUH;gBAC9BF,WAAWO,IAAI,CAACF;YAClB,OAAO;gBACLL,WAAWO,IAAI,CAACT,OAAO,CAACG,EAAE;YAC5B;QACF;QAEA,0FAA0F;QAC1F,IAAK,IAAIO,IAAI,GAAGA,IAAIV,QAAQC,MAAM,EAAES,IAAK;YACvCV,OAAO,CAACU,EAAE,GAAGlB;QACf;QACAQ,QAAQC,MAAM,GAAG;QACjB,IAAK,IAAIS,KAAI,GAAGA,KAAIR,WAAWD,MAAM,EAAES,KAAK;YAC1CV,QAAQS,IAAI,CAACP,UAAU,CAACQ,GAAE;QAC5B;IACF;IAEA,OAAOV,OAAO,CAAC,EAAE;AACnB;AAEA;;;CAGC,GACD,SAASW,iBAAiBjB,IAAY,EAAEE,QAAiB;IACvD,4DAA4D;IAC5D,IAAMgB,YAAYC,KAAKC,IAAI,CAACpB,OAAOP;IACnC,IAAM4B,SAAmB,EAAE;IAE3B,8DAA8D;IAC9D,IAAK,IAAIZ,IAAI,GAAGA,IAAIS,WAAWT,IAAK;QAClC,IAAMa,YAAYH,KAAKI,GAAG,CAAC9B,wBAAwBO,OAAOS,IAAIhB;QAC9D4B,OAAON,IAAI,CAACd,YAAYqB,WAAWpB;IACrC;IAEA,wDAAwD;IACxD,OAAOG,uBAAuBgB;AAChC;AAQO,SAASrD,YAAYgC,IAAY;IACtC,IAAIA,SAAS,GAAG;QACd,OAAO,IAAId,OAAO;IACpB;IAEA,qDAAqD;IACrD,IAAIa,sBAAsBC,OAAO;QAC/B,IAAIf,gBAAgB;YAClB,OAAOC,OAAOC,KAAK,CAACa;QACtB;QACA,iEAAiE;QACjE,IAAMG,MAAM,IAAIjB,OAAOc;QACvBG,IAAIC,IAAI,CAAC;QACT,OAAOD;IACT;IAEA,wDAAwD;IACxD,OAAOc,iBAAiBjB,MAAM;AAChC;AAWO,SAAS/B,kBAAkB+B,IAAY;IAC5C,IAAIA,SAAS,GAAG;QACd,OAAO,IAAId,OAAO;IACpB;IAEA,qDAAqD;IACrD,IAAIa,sBAAsBC,OAAO;QAC/B,IAAIZ,sBAAsB;YACxB,OAAOF,OAAOG,WAAW,CAACW;QAC5B;QACA,OAAO,IAAId,OAAOc;IACpB;IAEA,2DAA2D;IAC3D,OAAOiB,iBAAiBjB,MAAM;AAChC;AAQO,SAAS3B,WAAWmD,IAA6C,EAAEC,QAAyB;IACjG,IAAInC,eAAe;QACjB,IAAI,OAAOkC,SAAS,UAAU;YAC5B,OAAOtC,OAAOK,IAAI,CAACiC,MAAMC;QAC3B;QACA,OAAOvC,OAAOK,IAAI,CAACiC;IACrB;IACA,yDAAyD;IACzD,gFAAgF;IAChF,IAAIA,AAAI,YAAJA,MAAgBhC,eAAc,CAAEgC,AAAI,YAAJA,MAAgBtC,SAAS;QAC3D,IAAMwC,MAAgB,EAAE;QACxB,IAAK,IAAIjB,IAAI,GAAGA,IAAIe,KAAKjB,MAAM,EAAEE,IAAK;YACpCiB,IAAIX,IAAI,CAACS,IAAI,CAACf,EAAE;QAClB;QACA,OAAO,IAAIvB,OAAOwC;IACpB;IACA,OAAO,IAAIxC,OAAOsC,MAA2BC;AAC/C;AAOO,SAASvD,cAAcyD,MAAc,EAAEC,MAAc,EAAEC,WAAoB,EAAEC,SAAkB,EAAEC,WAAoB,EAAEC,SAAkB;IAC9ID,cAAcA,eAAe;IAC7BC,YAAYA,aAAaL,OAAOpB,MAAM;IACtCsB,cAAcA,eAAe;IAC7BC,YAAYA,aAAaF,OAAOrB,MAAM;IAEtC,kEAAkE;IAClE,IAAIoB,OAAOM,OAAO,IAAIN,OAAOM,OAAO,CAAC1B,MAAM,IAAI,GAAG;QAChD,OAAOoB,OAAOM,OAAO,CAACL,QAAQC,aAAaC,WAAWC,aAAaC;IACrE;IAEA,4CAA4C;IAC5C,IAAME,YAAYF,YAAYD;IAC9B,IAAMI,YAAYL,YAAYD;IAC9B,IAAMO,MAAMjB,KAAKI,GAAG,CAACW,WAAWC;IAEhC,IAAK,IAAI1B,IAAI,GAAGA,IAAI2B,KAAK3B,IAAK;QAC5B,IAAM4B,IAAIV,MAAM,CAACI,cAActB,EAAE;QACjC,IAAM6B,IAAIV,MAAM,CAACC,cAAcpB,EAAE;QACjC,IAAI4B,MAAMC,GAAG,OAAOD,IAAIC,IAAI,CAAC,IAAI;IACnC;IAEA,OAAOJ,YAAYC;AACrB;AAMO,SAAS/D,aAAa+B,GAAW,EAAEoC,MAAc,EAAEC,QAAkB;IAC1E,IAAID,SAASC,SAASjC,MAAM,GAAGJ,IAAII,MAAM,EAAE,OAAO;IAClD,IAAK,IAAIE,IAAI,GAAGA,IAAI+B,SAASjC,MAAM,EAAEE,IAAK;QACxC,IAAIN,GAAG,CAACoC,SAAS9B,EAAE,KAAK+B,QAAQ,CAAC/B,EAAE,EAAE,OAAO;IAC9C;IACA,OAAO;AACT;AAMO,SAASnC,gBAAgB6B,GAAW,EAAEsC,KAAa,EAAEC,GAAW;IACrE,IAAMC,SAAS3E,YAAY0E,MAAMD;IACjCtC,IAAIW,IAAI,CAAC6B,QAAQ,GAAGF,OAAOC;IAC3B,OAAOC;AACT;AASO,SAAShE,aAAawB,GAAW,EAAEoC,MAAc;IACtD,IAAMK,MAAMzC,IAAI0C,YAAY,CAACN;IAC7B,IAAMO,OAAO3C,IAAI0C,YAAY,CAACN,SAAS;IACvC,OAAOO,OAAO,cAAcF;AAC9B;AAMO,SAAShE,cAAcuB,GAAW,EAAE4C,KAAa,EAAER,MAAc;IACtE,IAAMK,MAAMG,UAAU;IACtB,IAAMD,OAAO,AAACC,QAAQ,gBAAiB;IACvC5C,IAAI6C,aAAa,CAACJ,KAAKL;IACvBpC,IAAI6C,aAAa,CAACF,MAAMP,SAAS;AACnC;AAWO,SAASpE,aAAa8E,IAA6B,EAAEC,WAAoB;IAC9E,sCAAsC;IACtC,IAAIC,eAAe;IACnB,IAAK,IAAI1C,IAAI,GAAGA,IAAIwC,KAAK1C,MAAM,EAAEE,IAAK;QACpC0C,gBAAgBF,IAAI,CAACxC,EAAE,CAACF,MAAM;IAChC;IAEA,6CAA6C;IAC7C,IAAM6C,eAAeF,gBAAgBpD,YAAYoD,cAAcC;IAE/D,oBAAoB;IACpB,IAAIF,KAAK1C,MAAM,KAAK,GAAG;QACrB,OAAO,IAAIrB,OAAO;IACpB;IAEA,mEAAmE;IACnE,sDAAsD;IACtD,IAAIkE,gBAAgB3D,wBAAwB;QAC1C,iEAAiE;QACjE,4DAA4D;QAC5D,IAAI4D,aAAa;QACjB,IAAK,IAAIrC,IAAI,GAAGA,IAAIiC,KAAK1C,MAAM,EAAES,IAAK;YACpC,IAAI,CAAEiC,AAAO,YAAPA,IAAI,CAACjC,EAAE,EAAY9B,SAAS;gBAChCmE,aAAa;gBACb;YACF;QACF;QACA,IAAIA,cAAcD,gBAAgBD,cAAc;YAC9C,OAAOjE,OAAOoE,MAAM,CAACL,MAAkBG;QACzC;IACF;IAEA,4DAA4D;IAC5D,mEAAmE;IACnE,IAAMT,SAAS3E,YAAYoF;IAC3B,IAAIb,SAAS;IAEb,IAAK,IAAIgB,IAAI,GAAGA,IAAIN,KAAK1C,MAAM,IAAIgC,SAASa,cAAcG,IAAK;QAC7D,IAAMpD,MAAM8C,IAAI,CAACM,EAAE;QACnB,IAAMC,SAASrC,KAAKI,GAAG,CAACpB,IAAII,MAAM,EAAE6C,eAAeb;QAEnD,IAAIpC,AAAG,YAAHA,KAAejB,SAAQ;YACzBiB,IAAIW,IAAI,CAAC6B,QAAQJ,QAAQ,GAAGiB;QAC9B,OAAO;YACL,yCAAyC;YACzC,IAAK,IAAIC,IAAI,GAAGA,IAAID,QAAQC,IAAK;gBAC/Bd,MAAM,CAACJ,SAASkB,EAAE,GAAGtD,GAAG,CAACsD,EAAE;YAC7B;QACF;QACAlB,UAAUiB;IACZ;IAEA,OAAOb;AACT;AAOO,SAASlE,MAAMsE,KAAa;IACjC,gEAAgE;IAChE,OAAOA,UAAUA;AACnB;AAEA;;;;;;;;CAQC,GACD,iEAAiE;AACjE,IAAIW,OAAqC;AACzC,IAAI;IACFA,OAAO7E,SAAS;AAClB,EAAE,OAAO8E,IAAI;AACX,mDAAmD;AACrD;AACA,IAAMC,sBAAsBF,SAAS,QAAQ,OAAOA,KAAKG,cAAc,KAAK;AAErE,SAASrF,WAAWsF,KAAa;IACtC,IAAIF,uBAAuBF,MAAM;QAC/B,OAAOA,KAAKG,cAAc,CAACC;IAC7B;IACA,qCAAqC;IACrC,IAAMC,OAAOlF,SAAS;IACtB,OAAOR,WAAW0F,KAAKvF,UAAU,CAACsF;AACpC;AAEA;;;;;;;;CAQC,GACD,0EAA0E;AAC1E,2FAA2F;AAC3F,IAAME,4BAA4BN,SAAS,QAAQ,OAAO,AAACA,KAAaO,gBAAgB,KAAK;AAEtF,SAAS1F;IACd,IAAIyF,6BAA6BN,MAAM;QACrC,sCAAsC;QACtC,2FAA2F;QAC3F,OAAO,AAACA,KAAaO,gBAAgB;IACvC;IAEA,qDAAqD;IACrD,iDAAiD;IACjD,IAAMnG,YAAYe,SAAS,mBAAmBf,SAAS;IACvD,IAAMiG,OAAOlF,SAAS;IAEtB,IAAMqF,UAAU,IAAIH,KAAKI,OAAO,CAAC;QAAEC,KAAK;QAAM9C,WAAW;IAAM;IAC/D,IAAM+C,YAAY,IAAIvG;IACtB,IAAMwG,gBAA0B,EAAE;IAClC,IAAIC,QAAQ;IAEZ,gDAAgD;IAChDL,QAAQM,MAAM,GAAG,SAACC;QAChBH,cAAcvD,IAAI,CAAC1C,WAAWoG;IAChC;IAEAP,QAAQQ,KAAK,GAAG,SAACC;QACfJ,QAAQ;QACR,IAAII,WAAW,GAAG;YAChBN,UAAUO,IAAI,CAAC,SAAS,IAAIC,MAAM,AAAC,kBAA0C,OAAzBX,QAAQY,GAAG,IAAI;QACrE;IACF;IAEAT,UAAUU,UAAU,GAAG,SAAUN,KAAa,EAAEO,SAAiB,EAAEC,QAA+B;QAChG,IAAI;YACFf,QAAQnD,IAAI,CAAC0D,OAAO;YACpB,uCAAuC;YACvC,MAAOH,cAAc/D,MAAM,GAAG,EAAG;gBAC/B,IAAI,CAACQ,IAAI,CAACuD,cAAcY,KAAK;YAC/B;YACAD;QACF,EAAE,OAAOE,KAAK;YACZF,SAASE;QACX;IACF;IAEAd,UAAUe,MAAM,GAAG,SAAUH,QAA+B;QAC1D,IAAI;YACFf,QAAQnD,IAAI,CAAC,IAAIvB,WAAW,IAAI,OAAO,aAAa;YACpD,yCAAyC;YACzC,MAAO8E,cAAc/D,MAAM,GAAG,EAAG;gBAC/B,IAAI,CAACQ,IAAI,CAACuD,cAAcY,KAAK;YAC/B;YACA,IAAIX,SAASL,QAAQiB,GAAG,EAAE;gBACxBF,SAAS,IAAIJ,MAAM,AAAC,kBAA0C,OAAzBX,QAAQY,GAAG,IAAI;YACtD,OAAO;gBACLG;YACF;QACF,EAAE,OAAOE,KAAK;YACZF,SAASE;QACX;IACF;IAEA,OAAOd;AACT;AAEA;;;;CAIC,GACD,IAAMgB,kBAAkB,OAAOC,OAAOC,MAAM,KAAK;AACjD,IAAMC,kBAAkBF,OAAOG,SAAS,CAACC,cAAc;AAEhD,SAAShH,aAAmBkD,MAAS,EAAED,MAAS;IACrD,IAAI0D,iBAAiB,OAAOC,OAAOC,MAAM,CAAC3D,QAAQD;IAElD,IAAK,IAAMgE,OAAOhE,OAAQ;QACxB,IAAI6D,gBAAgBI,IAAI,CAACjE,QAAQgE,MAAM,AAAC/D,MAAkC,CAAC+D,IAAI,GAAGhE,MAAM,CAACgE,IAAI;IAC/F;IACA,OAAO/D;AACT;AAEA;;;;CAIC,GACD,IAAMiE,QAAQ,CAACC,QAAQC,QAAQ,CAACC,IAAI,CAACC,KAAK,CAAC,IAAI,CAAC,EAAE;AAC3C,IAAMpI,WAA6CgI,QAAQ,IAAIhH,SAAS,UAAUhB,QAAQ,GAAGgB,SAAS,mBAAmBhB,QAAQ;AACjI,IAAME,WAA6C8H,QAAQ,IAAIhH,SAAS,UAAUd,QAAQ,GAAGc,SAAS,mBAAmBd,QAAQ;AACjI,IAAMD,YAA+C+H,QAAQ,IAAIhH,SAAS,UAAUf,SAAS,GAAGe,SAAS,mBAAmBf,SAAS;AACrI,IAAMF,cAAmDiI,QAAQ,IAAIhH,SAAS,UAAUjB,WAAW,GAAGiB,SAAS,mBAAmBjB,WAAW"}
+{"version":3,"sources":["/Users/kevin/Dev/OpenSource/iterators/extract-base-iterator/src/shared/compat.ts"],"sourcesContent":["/**\n * Buffer Compatibility Layer for Node.js 0.8+\n *\n * Provides buffer utilities that work across all Node.js versions\n * WITHOUT modifying global Buffer object.\n *\n * Version history:\n * - Node 0.8-4.4: Only has `new Buffer()`, no `Buffer.alloc/from`\n * - Node 4.5+: Has `Buffer.alloc/from`, deprecates `new Buffer()`\n * - Node 10+: Warns or errors on `new Buffer()`\n *\n * Solution: Feature detection with graceful fallback in both directions.\n */\n\n// ESM-compatible require - works in both CJS and ESM\nimport Module from 'module';\n\nconst _require = typeof require === 'undefined' ? Module.createRequire(import.meta.url) : require;\n\n// Feature detection (runs once at module load)\nconst hasBufferAlloc = typeof Buffer.alloc === 'function';\nconst hasBufferAllocUnsafe = typeof Buffer.allocUnsafe === 'function';\nconst hasBufferFrom = typeof Buffer.from === 'function' && Buffer.from !== Uint8Array.from;\n\n// Maximum buffer size that works across all Node.js versions\n// Node 0.8-4.x: kMaxLength = 0x3fffffff (~1073MB) but actual limit may be lower\n// Node 6-7.x: ~1073MB for Uint8Array\n// Node 8+: ~2GB for Buffer\n// Node 10+: 2^31-1 (~2147MB) for Buffer.allocUnsafe\n// Use 256MB as a conservative limit for buffer operations\n// Must leave room for pairwise combination (256MB * 2 = 512MB, 512MB * 2 = 1024MB, etc.)\nexport const MAX_SAFE_BUFFER_LENGTH = 256 * 1024 * 1024; // 256MB\n\n// Try to detect the actual kMaxLength for this Node version\n// If we can't detect it (older Node), assume conservative limit\nlet DETECTED_MAX_LENGTH: number | null = null;\n\nfunction getMaxBufferLength(): number {\n  if (DETECTED_MAX_LENGTH !== null) return DETECTED_MAX_LENGTH;\n\n  // Try to detect the actual limit\n  // kMaxLength exists on BufferConstructor in newer TypeScript definitions\n  // but may not exist at runtime on very old Node\n  const maxLen = (Buffer as { kMaxLength?: number }).kMaxLength;\n  if (maxLen !== undefined) {\n    DETECTED_MAX_LENGTH = maxLen;\n  } else {\n    // Older Node - use conservative estimate\n    DETECTED_MAX_LENGTH = 0x3fffffff; // ~1073MB\n  }\n\n  return DETECTED_MAX_LENGTH;\n}\n\n/**\n * Check if a buffer size can be safely allocated on this Node version\n * Uses conservative limit to work across all versions\n */\nexport function canAllocateBufferSize(size: number): boolean {\n  return size >= 0 && size <= MAX_SAFE_BUFFER_LENGTH;\n}\n\n/**\n * Create a single chunk of the specified size\n */\nfunction createChunk(size: number, zeroFill: boolean): Buffer {\n  if (hasBufferAlloc) {\n    return Buffer.alloc(size);\n  }\n  const buf = new Buffer(size);\n  if (zeroFill) buf.fill(0);\n  return buf;\n}\n\n/**\n * Combine an array of buffers into one by iterative concatenation\n * Stays under the actual kMaxLength for each Node version\n * Uses a \"fill and continue\" approach\n */\nfunction combineBuffersPairwise(buffers: Buffer[]): Buffer {\n  const maxLength = getMaxBufferLength();\n\n  // Calculate total size\n  let totalSize = 0;\n  for (let i = 0; i < buffers.length; i++) {\n    totalSize += buffers[i].length;\n  }\n\n  // If total exceeds this Node version's limit, we cannot combine\n  // LZMA1 requires a single contiguous Buffer input\n  if (totalSize > maxLength) {\n    throw new Error(`Cannot combine buffers: total size (${totalSize} bytes) exceeds Node.js buffer limit (${maxLength} bytes). LZMA1 archives with folders larger than ${Math.floor(maxLength / 1024 / 1024)}MB cannot be processed on this Node version.`);\n  }\n\n  // If everything fits in a single allocation, do it directly\n  const result = createChunk(totalSize, false);\n  let offset = 0;\n  for (let i = 0; i < buffers.length; i++) {\n    buffers[i].copy(result, offset);\n    offset += buffers[i].length;\n  }\n  return result;\n}\n\n/**\n * Allocate a large buffer by allocating in chunks and combining them\n * Handles both zero-filled (safe) and uninitialized (unsafe) variants\n */\nfunction allocBufferLarge(size: number, zeroFill: boolean): Buffer {\n  // For large sizes, allocate smaller chunks and combine them\n  const numChunks = Math.ceil(size / MAX_SAFE_BUFFER_LENGTH);\n  const chunks: Buffer[] = [];\n\n  // Allocate individual chunks (each <= MAX_SAFE_BUFFER_LENGTH)\n  for (let i = 0; i < numChunks; i++) {\n    const chunkSize = Math.min(MAX_SAFE_BUFFER_LENGTH, size - i * MAX_SAFE_BUFFER_LENGTH);\n    chunks.push(createChunk(chunkSize, zeroFill));\n  }\n\n  // Combine chunks iteratively using pairwise combination\n  return combineBuffersPairwise(chunks);\n}\n\n/**\n * Allocate a zero-filled buffer (safe) - handles very large allocations\n * - Uses Buffer.alloc() on Node 4.5+\n * - Falls back to new Buffer() + fill on Node 0.8-4.4\n * - For sizes > MAX_SAFE_BUFFER_LENGTH, allocates in chunks and copies\n */\nexport function allocBuffer(size: number): Buffer {\n  if (size === 0) {\n    return new Buffer(0);\n  }\n\n  // Use native allocation for sizes within safe limits\n  if (canAllocateBufferSize(size)) {\n    if (hasBufferAlloc) {\n      return Buffer.alloc(size);\n    }\n    // Legacy fallback: new Buffer() is uninitialized, must zero-fill\n    const buf = new Buffer(size);\n    buf.fill(0);\n    return buf;\n  }\n\n  // For large sizes, allocate in chunks with zero-filling\n  return allocBufferLarge(size, true);\n}\n\n/**\n * Allocate a buffer without initialization (unsafe but faster)\n * - Uses Buffer.allocUnsafe() on Node 4.5+\n * - Falls back to new Buffer() on Node 0.8-4.4\n * - For sizes > MAX_SAFE_BUFFER_LENGTH, allocates in chunks without zeroing\n *\n * WARNING: Buffer contents are uninitialized and may contain sensitive data.\n * Only use when you will immediately overwrite all bytes.\n */\nexport function allocBufferUnsafe(size: number): Buffer {\n  if (size === 0) {\n    return new Buffer(0);\n  }\n\n  // Use native allocation for sizes within safe limits\n  if (canAllocateBufferSize(size)) {\n    if (hasBufferAllocUnsafe) {\n      return Buffer.allocUnsafe(size);\n    }\n    return new Buffer(size);\n  }\n\n  // For large sizes, allocate in chunks without zero-filling\n  return allocBufferLarge(size, false);\n}\n\n/**\n * Create a buffer from string, array, or existing buffer\n * - Uses Buffer.from() on Node 4.5+\n * - Falls back to new Buffer() on Node 0.8-4.4\n * - Handles Uint8Array conversion for Node 0.8 (crypto output compatibility)\n */\nexport function bufferFrom(data: string | number[] | Buffer | Uint8Array, encoding?: BufferEncoding): Buffer {\n  if (hasBufferFrom) {\n    if (typeof data === 'string') {\n      return Buffer.from(data, encoding);\n    }\n    return Buffer.from(data as number[] | Buffer);\n  }\n  // Node 0.8 compatibility - deprecated Buffer constructor\n  // For Uint8Array, convert to array first (needed for crypto output in Node 0.8)\n  if (data instanceof Uint8Array && !(data instanceof Buffer)) {\n    const arr: number[] = [];\n    for (let i = 0; i < data.length; i++) {\n      arr.push(data[i]);\n    }\n    return new Buffer(arr);\n  }\n  return new Buffer(data as string & number[], encoding);\n}\n\n/**\n * Compare two buffers or buffer regions\n * - Uses Buffer.compare() on Node 5.10+ (with offset support)\n * - Falls back to manual comparison on Node 0.8-5.9\n */\nexport function bufferCompare(source: Buffer, target: Buffer, targetStart?: number, targetEnd?: number, sourceStart?: number, sourceEnd?: number): number {\n  sourceStart = sourceStart || 0;\n  sourceEnd = sourceEnd || source.length;\n  targetStart = targetStart || 0;\n  targetEnd = targetEnd || target.length;\n\n  // Check if native compare with offset support exists (Node 5.10+)\n  if (source.compare && source.compare.length >= 5) {\n    return source.compare(target, targetStart, targetEnd, sourceStart, sourceEnd);\n  }\n\n  // Manual comparison for older Node versions\n  const sourceLen = sourceEnd - sourceStart;\n  const targetLen = targetEnd - targetStart;\n  const len = Math.min(sourceLen, targetLen);\n\n  for (let i = 0; i < len; i++) {\n    const s = source[sourceStart + i];\n    const t = target[targetStart + i];\n    if (s !== t) return s < t ? -1 : 1;\n  }\n\n  return sourceLen - targetLen;\n}\n\n/**\n * Check if buffer region equals byte array\n * Useful for magic number detection without Buffer.from()\n */\nexport function bufferEquals(buf: Buffer, offset: number, expected: number[]): boolean {\n  if (offset + expected.length > buf.length) return false;\n  for (let i = 0; i < expected.length; i++) {\n    if (buf[offset + i] !== expected[i]) return false;\n  }\n  return true;\n}\n\n/**\n * Copy buffer region to new buffer\n * Works on all Node versions\n */\nexport function bufferSliceCopy(buf: Buffer, start: number, end: number): Buffer {\n  const result = allocBuffer(end - start);\n  buf.copy(result, 0, start, end);\n  return result;\n}\n\n/**\n * Read 64-bit unsigned integer (little-endian)\n * Uses two 32-bit reads since BigInt not available until Node 10.4\n *\n * WARNING: Only accurate for values < Number.MAX_SAFE_INTEGER (2^53 - 1)\n * This covers files up to ~9 PB which is practical for all real use cases.\n */\nexport function readUInt64LE(buf: Buffer, offset: number): number {\n  const low = buf.readUInt32LE(offset);\n  const high = buf.readUInt32LE(offset + 4);\n  return high * 0x100000000 + low;\n}\n\n/**\n * Write 64-bit unsigned integer (little-endian)\n * Same precision limitation as readUInt64LE\n */\nexport function writeUInt64LE(buf: Buffer, value: number, offset: number): void {\n  const low = value >>> 0;\n  const high = (value / 0x100000000) >>> 0;\n  buf.writeUInt32LE(low, offset);\n  buf.writeUInt32LE(high, offset + 4);\n}\n\n/**\n * Concatenate buffers - compatible with Node 0.8+\n * Handles crypto output which may not be proper Buffer instances in old Node.\n * Also handles very large concatenations that would exceed buffer limits.\n *\n * NOTE: This function is primarily needed for AES decryption compatibility\n * in Node 0.8 where crypto output may not be proper Buffer instances.\n * Libraries not using crypto can use native Buffer.concat() directly.\n */\nexport function bufferConcat(list: (Buffer | Uint8Array)[], totalLength?: number): Buffer {\n  // Calculate actual total length first\n  let actualLength = 0;\n  for (let i = 0; i < list.length; i++) {\n    actualLength += list[i].length;\n  }\n\n  // Use specified totalLength or actual length\n  const targetLength = totalLength !== undefined ? totalLength : actualLength;\n\n  // Handle empty list\n  if (list.length === 0) {\n    return new Buffer(0);\n  }\n\n  // Handle very large concatenations that would exceed buffer limits\n  // Use native Buffer.concat for smaller sizes (faster)\n  if (targetLength <= MAX_SAFE_BUFFER_LENGTH) {\n    // Check if all items are proper Buffers AND no truncation needed\n    // (Node 0.8's Buffer.concat doesn't handle truncation well)\n    let allBuffers = true;\n    for (let j = 0; j < list.length; j++) {\n      if (!(list[j] instanceof Buffer)) {\n        allBuffers = false;\n        break;\n      }\n    }\n    if (allBuffers && targetLength >= actualLength) {\n      return Buffer.concat(list as Buffer[], targetLength);\n    }\n  }\n\n  // For large or complex concatenations, use chunked approach\n  // This will use allocBuffer which handles large sizes via chunking\n  const result = allocBuffer(targetLength);\n  let offset = 0;\n\n  for (let k = 0; k < list.length && offset < targetLength; k++) {\n    const buf = list[k];\n    const toCopy = Math.min(buf.length, targetLength - offset);\n\n    if (buf instanceof Buffer) {\n      buf.copy(result, offset, 0, toCopy);\n    } else {\n      // Uint8Array - need to copy byte by byte\n      for (let l = 0; l < toCopy; l++) {\n        result[offset + l] = buf[l];\n      }\n    }\n    offset += toCopy;\n  }\n\n  return result;\n}\n\n/**\n * Node 0.8 compatible isNaN (Number.isNaN didn't exist until ES2015)\n * Uses self-comparison: NaN is the only value not equal to itself\n */\n// biome-ignore lint/suspicious/noShadowRestrictedNames: Legacy compatibility\nexport function isNaN(value: number): boolean {\n  // biome-ignore lint/suspicious/noSelfCompare: NaN check pattern\n  return value !== value;\n}\n\n/**\n * Decompress raw DEFLATE data (no zlib/gzip header)\n * - Uses native zlib.inflateRawSync() on Node 0.11.12+\n * - Falls back to pako for Node 0.8-0.10\n *\n * Version history:\n * - Node 0.8-0.10: No zlib sync methods, use pako\n * - Node 0.11.12+: zlib.inflateRawSync available\n */\n// Feature detection for native zlib sync methods (Node 0.11.12+)\nlet zlib: typeof import('zlib') | null = null;\ntry {\n  zlib = _require('zlib');\n} catch (_e) {\n  // zlib not available (shouldn't happen in Node.js)\n}\nconst hasNativeInflateRaw = zlib !== null && typeof zlib.inflateRawSync === 'function';\n\nexport function inflateRaw(input: Buffer): Buffer {\n  if (hasNativeInflateRaw && zlib) {\n    return zlib.inflateRawSync(input);\n  }\n  // Fallback to pako for Node 0.8-0.10\n  const pako = _require('pako');\n  return bufferFrom(pako.inflateRaw(input));\n}\n\n/**\n * Create a streaming raw DEFLATE decompressor (Transform stream)\n * Decompresses data incrementally to avoid holding full output in memory.\n *\n * - Uses native zlib.createInflateRaw() on Node 0.11.12+\n * - Falls back to pako-based Transform for Node 0.8-0.10\n *\n * @returns A Transform stream that decompresses raw DEFLATE data\n */\n// Check for native streaming inflate (Node 0.11.12+ has createInflateRaw)\n// biome-ignore lint/suspicious/noExplicitAny: createInflateRaw not in older TS definitions\nconst hasNativeStreamingInflate = zlib !== null && typeof (zlib as any).createInflateRaw === 'function';\n\nexport function createInflateRawStream(): NodeJS.ReadWriteStream {\n  if (hasNativeStreamingInflate && zlib) {\n    // Use native zlib streaming Transform\n    // biome-ignore lint/suspicious/noExplicitAny: createInflateRaw not in older TS definitions\n    return (zlib as any).createInflateRaw();\n  }\n\n  // Fallback to pako-based Transform for Node 0.8-0.10\n  // Use readable-stream for Node 0.8 compatibility\n  const Transform = _require('readable-stream').Transform;\n  const pako = _require('pako');\n\n  const inflate = new pako.Inflate({ raw: true, chunkSize: 16384 });\n  const transform = new Transform();\n  const pendingChunks: Buffer[] = [];\n  let ended = false;\n\n  // Pako calls onData synchronously during push()\n  inflate.onData = (chunk: Uint8Array) => {\n    pendingChunks.push(bufferFrom(chunk));\n  };\n\n  inflate.onEnd = (status: number) => {\n    ended = true;\n    if (status !== 0) {\n      transform.emit('error', new Error(`Inflate error: ${inflate.msg || 'unknown'}`));\n    }\n  };\n\n  transform._transform = function (chunk: Buffer, _encoding: string, callback: (err?: Error) => void) {\n    try {\n      inflate.push(chunk, false);\n      // Push any pending decompressed chunks\n      while (pendingChunks.length > 0) {\n        this.push(pendingChunks.shift());\n      }\n      callback();\n    } catch (err) {\n      callback(err as Error);\n    }\n  };\n\n  transform._flush = function (callback: (err?: Error) => void) {\n    try {\n      inflate.push(new Uint8Array(0), true); // Signal end\n      // Push any remaining decompressed chunks\n      while (pendingChunks.length > 0) {\n        this.push(pendingChunks.shift());\n      }\n      if (ended && inflate.err) {\n        callback(new Error(`Inflate error: ${inflate.msg || 'unknown'}`));\n      } else {\n        callback();\n      }\n    } catch (err) {\n      callback(err as Error);\n    }\n  };\n\n  return transform;\n}\n\n/**\n * Object.assign wrapper for Node.js 0.8+\n * - Uses native Object.assign on Node 4.0+\n * - Falls back to manual property copy on Node 0.8-3.x\n */\nconst hasObjectAssign = typeof Object.assign === 'function';\nconst _hasOwnProperty = Object.prototype.hasOwnProperty;\n\nexport function objectAssign<T, U>(target: T, source: U): T & U {\n  if (hasObjectAssign) return Object.assign(target, source);\n\n  for (const key in source) {\n    if (_hasOwnProperty.call(source, key)) (target as Record<string, unknown>)[key] = source[key];\n  }\n  return target as T & U;\n}\n\n/**\n * Stream compatibility - Transform class\n * - Uses native stream.Transform on Node 0.10+\n * - Falls back to readable-stream for Node 0.8\n */\nconst major = +process.versions.node.split('.')[0];\nexport const Readable: typeof import('stream').Readable = major > 0 ? _require('stream').Readable : _require('readable-stream').Readable;\nexport const Writable: typeof import('stream').Writable = major > 0 ? _require('stream').Writable : _require('readable-stream').Writable;\nexport const Transform: typeof import('stream').Transform = major > 0 ? _require('stream').Transform : _require('readable-stream').Transform;\nexport const PassThrough: typeof import('stream').PassThrough = major > 0 ? _require('stream').PassThrough : _require('readable-stream').PassThrough;\n"],"names":["MAX_SAFE_BUFFER_LENGTH","PassThrough","Readable","Transform","Writable","allocBuffer","allocBufferUnsafe","bufferCompare","bufferConcat","bufferEquals","bufferFrom","bufferSliceCopy","canAllocateBufferSize","createInflateRawStream","inflateRaw","isNaN","objectAssign","readUInt64LE","writeUInt64LE","_require","require","Module","createRequire","hasBufferAlloc","Buffer","alloc","hasBufferAllocUnsafe","allocUnsafe","hasBufferFrom","from","Uint8Array","DETECTED_MAX_LENGTH","getMaxBufferLength","maxLen","kMaxLength","undefined","size","createChunk","zeroFill","buf","fill","combineBuffersPairwise","buffers","maxLength","totalSize","i","length","Error","Math","floor","result","offset","copy","allocBufferLarge","numChunks","ceil","chunks","chunkSize","min","push","data","encoding","arr","source","target","targetStart","targetEnd","sourceStart","sourceEnd","compare","sourceLen","targetLen","len","s","t","expected","start","end","low","readUInt32LE","high","value","writeUInt32LE","list","totalLength","actualLength","targetLength","allBuffers","j","concat","k","toCopy","l","zlib","_e","hasNativeInflateRaw","inflateRawSync","input","pako","hasNativeStreamingInflate","createInflateRaw","inflate","Inflate","raw","transform","pendingChunks","ended","onData","chunk","onEnd","status","emit","msg","_transform","_encoding","callback","shift","err","_flush","hasObjectAssign","Object","assign","_hasOwnProperty","prototype","hasOwnProperty","key","call","major","process","versions","node","split"],"mappings":"AAAA;;;;;;;;;;;;CAYC,GAED,qDAAqD;;;;;;;;;;;;QAiBxCA;eAAAA;;QA+bAC;eAAAA;;QAHAC;eAAAA;;QAEAC;eAAAA;;QADAC;eAAAA;;QA3VGC;eAAAA;;QA6BAC;eAAAA;;QA+CAC;eAAAA;;QAgFAC;eAAAA;;QAnDAC;eAAAA;;QArDAC;eAAAA;;QAiEAC;eAAAA;;QA5LAC;eAAAA;;QA4UAC;eAAAA;;QAtBAC;eAAAA;;QAvBAC;eAAAA;;QAmHAC;eAAAA;;QAzMAC;eAAAA;;QAUAC;eAAAA;;;6DA9PG;;;;;;;;;;;;;AAEnB,IAAMC,WAAW,OAAOC,YAAY,cAAcC,eAAM,CAACC,aAAa,CAAC,uDAAmBF;AAE1F,+CAA+C;AAC/C,IAAMG,iBAAiB,OAAOC,OAAOC,KAAK,KAAK;AAC/C,IAAMC,uBAAuB,OAAOF,OAAOG,WAAW,KAAK;AAC3D,IAAMC,gBAAgB,OAAOJ,OAAOK,IAAI,KAAK,cAAcL,OAAOK,IAAI,KAAKC,WAAWD,IAAI;AASnF,IAAM7B,yBAAyB,MAAM,OAAO,MAAM,QAAQ;AAEjE,4DAA4D;AAC5D,gEAAgE;AAChE,IAAI+B,sBAAqC;AAEzC,SAASC;IACP,IAAID,wBAAwB,MAAM,OAAOA;IAEzC,iCAAiC;IACjC,yEAAyE;IACzE,gDAAgD;IAChD,IAAME,SAAS,AAACT,OAAmCU,UAAU;IAC7D,IAAID,WAAWE,WAAW;QACxBJ,sBAAsBE;IACxB,OAAO;QACL,yCAAyC;QACzCF,sBAAsB,YAAY,UAAU;IAC9C;IAEA,OAAOA;AACT;AAMO,SAASnB,sBAAsBwB,IAAY;IAChD,OAAOA,QAAQ,KAAKA,QAAQpC;AAC9B;AAEA;;CAEC,GACD,SAASqC,YAAYD,IAAY,EAAEE,QAAiB;IAClD,IAAIf,gBAAgB;QAClB,OAAOC,OAAOC,KAAK,CAACW;IACtB;IACA,IAAMG,MAAM,IAAIf,OAAOY;IACvB,IAAIE,UAAUC,IAAIC,IAAI,CAAC;IACvB,OAAOD;AACT;AAEA;;;;CAIC,GACD,SAASE,uBAAuBC,OAAiB;IAC/C,IAAMC,YAAYX;IAElB,uBAAuB;IACvB,IAAIY,YAAY;IAChB,IAAK,IAAIC,IAAI,GAAGA,IAAIH,QAAQI,MAAM,EAAED,IAAK;QACvCD,aAAaF,OAAO,CAACG,EAAE,CAACC,MAAM;IAChC;IAEA,gEAAgE;IAChE,kDAAkD;IAClD,IAAIF,YAAYD,WAAW;QACzB,MAAM,IAAII,MAAM,AAAC,uCAAwFJ,OAAlDC,WAAU,0CAAqGI,OAA7DL,WAAU,qDAAuF,OAApCK,KAAKC,KAAK,CAACN,YAAY,OAAO,OAAM;IAC5M;IAEA,4DAA4D;IAC5D,IAAMO,SAASb,YAAYO,WAAW;IACtC,IAAIO,SAAS;IACb,IAAK,IAAIN,KAAI,GAAGA,KAAIH,QAAQI,MAAM,EAAED,KAAK;QACvCH,OAAO,CAACG,GAAE,CAACO,IAAI,CAACF,QAAQC;QACxBA,UAAUT,OAAO,CAACG,GAAE,CAACC,MAAM;IAC7B;IACA,OAAOI;AACT;AAEA;;;CAGC,GACD,SAASG,iBAAiBjB,IAAY,EAAEE,QAAiB;IACvD,4DAA4D;IAC5D,IAAMgB,YAAYN,KAAKO,IAAI,CAACnB,OAAOpC;IACnC,IAAMwD,SAAmB,EAAE;IAE3B,8DAA8D;IAC9D,IAAK,IAAIX,IAAI,GAAGA,IAAIS,WAAWT,IAAK;QAClC,IAAMY,YAAYT,KAAKU,GAAG,CAAC1D,wBAAwBoC,OAAOS,IAAI7C;QAC9DwD,OAAOG,IAAI,CAACtB,YAAYoB,WAAWnB;IACrC;IAEA,wDAAwD;IACxD,OAAOG,uBAAuBe;AAChC;AAQO,SAASnD,YAAY+B,IAAY;IACtC,IAAIA,SAAS,GAAG;QACd,OAAO,IAAIZ,OAAO;IACpB;IAEA,qDAAqD;IACrD,IAAIZ,sBAAsBwB,OAAO;QAC/B,IAAIb,gBAAgB;YAClB,OAAOC,OAAOC,KAAK,CAACW;QACtB;QACA,iEAAiE;QACjE,IAAMG,MAAM,IAAIf,OAAOY;QACvBG,IAAIC,IAAI,CAAC;QACT,OAAOD;IACT;IAEA,wDAAwD;IACxD,OAAOc,iBAAiBjB,MAAM;AAChC;AAWO,SAAS9B,kBAAkB8B,IAAY;IAC5C,IAAIA,SAAS,GAAG;QACd,OAAO,IAAIZ,OAAO;IACpB;IAEA,qDAAqD;IACrD,IAAIZ,sBAAsBwB,OAAO;QAC/B,IAAIV,sBAAsB;YACxB,OAAOF,OAAOG,WAAW,CAACS;QAC5B;QACA,OAAO,IAAIZ,OAAOY;IACpB;IAEA,2DAA2D;IAC3D,OAAOiB,iBAAiBjB,MAAM;AAChC;AAQO,SAAS1B,WAAWkD,IAA6C,EAAEC,QAAyB;IACjG,IAAIjC,eAAe;QACjB,IAAI,OAAOgC,SAAS,UAAU;YAC5B,OAAOpC,OAAOK,IAAI,CAAC+B,MAAMC;QAC3B;QACA,OAAOrC,OAAOK,IAAI,CAAC+B;IACrB;IACA,yDAAyD;IACzD,gFAAgF;IAChF,IAAIA,AAAI,YAAJA,MAAgB9B,eAAc,CAAE8B,AAAI,YAAJA,MAAgBpC,SAAS;QAC3D,IAAMsC,MAAgB,EAAE;QACxB,IAAK,IAAIjB,IAAI,GAAGA,IAAIe,KAAKd,MAAM,EAAED,IAAK;YACpCiB,IAAIH,IAAI,CAACC,IAAI,CAACf,EAAE;QAClB;QACA,OAAO,IAAIrB,OAAOsC;IACpB;IACA,OAAO,IAAItC,OAAOoC,MAA2BC;AAC/C;AAOO,SAAStD,cAAcwD,MAAc,EAAEC,MAAc,EAAEC,WAAoB,EAAEC,SAAkB,EAAEC,WAAoB,EAAEC,SAAkB;IAC9ID,cAAcA,eAAe;IAC7BC,YAAYA,aAAaL,OAAOjB,MAAM;IACtCmB,cAAcA,eAAe;IAC7BC,YAAYA,aAAaF,OAAOlB,MAAM;IAEtC,kEAAkE;IAClE,IAAIiB,OAAOM,OAAO,IAAIN,OAAOM,OAAO,CAACvB,MAAM,IAAI,GAAG;QAChD,OAAOiB,OAAOM,OAAO,CAACL,QAAQC,aAAaC,WAAWC,aAAaC;IACrE;IAEA,4CAA4C;IAC5C,IAAME,YAAYF,YAAYD;IAC9B,IAAMI,YAAYL,YAAYD;IAC9B,IAAMO,MAAMxB,KAAKU,GAAG,CAACY,WAAWC;IAEhC,IAAK,IAAI1B,IAAI,GAAGA,IAAI2B,KAAK3B,IAAK;QAC5B,IAAM4B,IAAIV,MAAM,CAACI,cAActB,EAAE;QACjC,IAAM6B,IAAIV,MAAM,CAACC,cAAcpB,EAAE;QACjC,IAAI4B,MAAMC,GAAG,OAAOD,IAAIC,IAAI,CAAC,IAAI;IACnC;IAEA,OAAOJ,YAAYC;AACrB;AAMO,SAAS9D,aAAa8B,GAAW,EAAEY,MAAc,EAAEwB,QAAkB;IAC1E,IAAIxB,SAASwB,SAAS7B,MAAM,GAAGP,IAAIO,MAAM,EAAE,OAAO;IAClD,IAAK,IAAID,IAAI,GAAGA,IAAI8B,SAAS7B,MAAM,EAAED,IAAK;QACxC,IAAIN,GAAG,CAACY,SAASN,EAAE,KAAK8B,QAAQ,CAAC9B,EAAE,EAAE,OAAO;IAC9C;IACA,OAAO;AACT;AAMO,SAASlC,gBAAgB4B,GAAW,EAAEqC,KAAa,EAAEC,GAAW;IACrE,IAAM3B,SAAS7C,YAAYwE,MAAMD;IACjCrC,IAAIa,IAAI,CAACF,QAAQ,GAAG0B,OAAOC;IAC3B,OAAO3B;AACT;AASO,SAASjC,aAAasB,GAAW,EAAEY,MAAc;IACtD,IAAM2B,MAAMvC,IAAIwC,YAAY,CAAC5B;IAC7B,IAAM6B,OAAOzC,IAAIwC,YAAY,CAAC5B,SAAS;IACvC,OAAO6B,OAAO,cAAcF;AAC9B;AAMO,SAAS5D,cAAcqB,GAAW,EAAE0C,KAAa,EAAE9B,MAAc;IACtE,IAAM2B,MAAMG,UAAU;IACtB,IAAMD,OAAO,AAACC,QAAQ,gBAAiB;IACvC1C,IAAI2C,aAAa,CAACJ,KAAK3B;IACvBZ,IAAI2C,aAAa,CAACF,MAAM7B,SAAS;AACnC;AAWO,SAAS3C,aAAa2E,IAA6B,EAAEC,WAAoB;IAC9E,sCAAsC;IACtC,IAAIC,eAAe;IACnB,IAAK,IAAIxC,IAAI,GAAGA,IAAIsC,KAAKrC,MAAM,EAAED,IAAK;QACpCwC,gBAAgBF,IAAI,CAACtC,EAAE,CAACC,MAAM;IAChC;IAEA,6CAA6C;IAC7C,IAAMwC,eAAeF,gBAAgBjD,YAAYiD,cAAcC;IAE/D,oBAAoB;IACpB,IAAIF,KAAKrC,MAAM,KAAK,GAAG;QACrB,OAAO,IAAItB,OAAO;IACpB;IAEA,mEAAmE;IACnE,sDAAsD;IACtD,IAAI8D,gBAAgBtF,wBAAwB;QAC1C,iEAAiE;QACjE,4DAA4D;QAC5D,IAAIuF,aAAa;QACjB,IAAK,IAAIC,IAAI,GAAGA,IAAIL,KAAKrC,MAAM,EAAE0C,IAAK;YACpC,IAAI,CAAEL,AAAO,YAAPA,IAAI,CAACK,EAAE,EAAYhE,SAAS;gBAChC+D,aAAa;gBACb;YACF;QACF;QACA,IAAIA,cAAcD,gBAAgBD,cAAc;YAC9C,OAAO7D,OAAOiE,MAAM,CAACN,MAAkBG;QACzC;IACF;IAEA,4DAA4D;IAC5D,mEAAmE;IACnE,IAAMpC,SAAS7C,YAAYiF;IAC3B,IAAInC,SAAS;IAEb,IAAK,IAAIuC,IAAI,GAAGA,IAAIP,KAAKrC,MAAM,IAAIK,SAASmC,cAAcI,IAAK;QAC7D,IAAMnD,MAAM4C,IAAI,CAACO,EAAE;QACnB,IAAMC,SAAS3C,KAAKU,GAAG,CAACnB,IAAIO,MAAM,EAAEwC,eAAenC;QAEnD,IAAIZ,AAAG,YAAHA,KAAef,SAAQ;YACzBe,IAAIa,IAAI,CAACF,QAAQC,QAAQ,GAAGwC;QAC9B,OAAO;YACL,yCAAyC;YACzC,IAAK,IAAIC,IAAI,GAAGA,IAAID,QAAQC,IAAK;gBAC/B1C,MAAM,CAACC,SAASyC,EAAE,GAAGrD,GAAG,CAACqD,EAAE;YAC7B;QACF;QACAzC,UAAUwC;IACZ;IAEA,OAAOzC;AACT;AAOO,SAASnC,MAAMkE,KAAa;IACjC,gEAAgE;IAChE,OAAOA,UAAUA;AACnB;AAEA;;;;;;;;CAQC,GACD,iEAAiE;AACjE,IAAIY,OAAqC;AACzC,IAAI;IACFA,OAAO1E,SAAS;AAClB,EAAE,OAAO2E,IAAI;AACX,mDAAmD;AACrD;AACA,IAAMC,sBAAsBF,SAAS,QAAQ,OAAOA,KAAKG,cAAc,KAAK;AAErE,SAASlF,WAAWmF,KAAa;IACtC,IAAIF,uBAAuBF,MAAM;QAC/B,OAAOA,KAAKG,cAAc,CAACC;IAC7B;IACA,qCAAqC;IACrC,IAAMC,OAAO/E,SAAS;IACtB,OAAOT,WAAWwF,KAAKpF,UAAU,CAACmF;AACpC;AAEA;;;;;;;;CAQC,GACD,0EAA0E;AAC1E,2FAA2F;AAC3F,IAAME,4BAA4BN,SAAS,QAAQ,OAAO,AAACA,KAAaO,gBAAgB,KAAK;AAEtF,SAASvF;IACd,IAAIsF,6BAA6BN,MAAM;QACrC,sCAAsC;QACtC,2FAA2F;QAC3F,OAAO,AAACA,KAAaO,gBAAgB;IACvC;IAEA,qDAAqD;IACrD,iDAAiD;IACjD,IAAMjG,YAAYgB,SAAS,mBAAmBhB,SAAS;IACvD,IAAM+F,OAAO/E,SAAS;IAEtB,IAAMkF,UAAU,IAAIH,KAAKI,OAAO,CAAC;QAAEC,KAAK;QAAM9C,WAAW;IAAM;IAC/D,IAAM+C,YAAY,IAAIrG;IACtB,IAAMsG,gBAA0B,EAAE;IAClC,IAAIC,QAAQ;IAEZ,gDAAgD;IAChDL,QAAQM,MAAM,GAAG,SAACC;QAChBH,cAAc9C,IAAI,CAACjD,WAAWkG;IAChC;IAEAP,QAAQQ,KAAK,GAAG,SAACC;QACfJ,QAAQ;QACR,IAAII,WAAW,GAAG;YAChBN,UAAUO,IAAI,CAAC,SAAS,IAAIhE,MAAM,AAAC,kBAA0C,OAAzBsD,QAAQW,GAAG,IAAI;QACrE;IACF;IAEAR,UAAUS,UAAU,GAAG,SAAUL,KAAa,EAAEM,SAAiB,EAAEC,QAA+B;QAChG,IAAI;YACFd,QAAQ1C,IAAI,CAACiD,OAAO;YACpB,uCAAuC;YACvC,MAAOH,cAAc3D,MAAM,GAAG,EAAG;gBAC/B,IAAI,CAACa,IAAI,CAAC8C,cAAcW,KAAK;YAC/B;YACAD;QACF,EAAE,OAAOE,KAAK;YACZF,SAASE;QACX;IACF;IAEAb,UAAUc,MAAM,GAAG,SAAUH,QAA+B;QAC1D,IAAI;YACFd,QAAQ1C,IAAI,CAAC,IAAI7B,WAAW,IAAI,OAAO,aAAa;YACpD,yCAAyC;YACzC,MAAO2E,cAAc3D,MAAM,GAAG,EAAG;gBAC/B,IAAI,CAACa,IAAI,CAAC8C,cAAcW,KAAK;YAC/B;YACA,IAAIV,SAASL,QAAQgB,GAAG,EAAE;gBACxBF,SAAS,IAAIpE,MAAM,AAAC,kBAA0C,OAAzBsD,QAAQW,GAAG,IAAI;YACtD,OAAO;gBACLG;YACF;QACF,EAAE,OAAOE,KAAK;YACZF,SAASE;QACX;IACF;IAEA,OAAOb;AACT;AAEA;;;;CAIC,GACD,IAAMe,kBAAkB,OAAOC,OAAOC,MAAM,KAAK;AACjD,IAAMC,kBAAkBF,OAAOG,SAAS,CAACC,cAAc;AAEhD,SAAS5G,aAAmBgD,MAAS,EAAED,MAAS;IACrD,IAAIwD,iBAAiB,OAAOC,OAAOC,MAAM,CAACzD,QAAQD;IAElD,IAAK,IAAM8D,OAAO9D,OAAQ;QACxB,IAAI2D,gBAAgBI,IAAI,CAAC/D,QAAQ8D,MAAM,AAAC7D,MAAkC,CAAC6D,IAAI,GAAG9D,MAAM,CAAC8D,IAAI;IAC/F;IACA,OAAO7D;AACT;AAEA;;;;CAIC,GACD,IAAM+D,QAAQ,CAACC,QAAQC,QAAQ,CAACC,IAAI,CAACC,KAAK,CAAC,IAAI,CAAC,EAAE;AAC3C,IAAMjI,WAA6C6H,QAAQ,IAAI5G,SAAS,UAAUjB,QAAQ,GAAGiB,SAAS,mBAAmBjB,QAAQ;AACjI,IAAME,WAA6C2H,QAAQ,IAAI5G,SAAS,UAAUf,QAAQ,GAAGe,SAAS,mBAAmBf,QAAQ;AACjI,IAAMD,YAA+C4H,QAAQ,IAAI5G,SAAS,UAAUhB,SAAS,GAAGgB,SAAS,mBAAmBhB,SAAS;AACrI,IAAMF,cAAmD8H,QAAQ,IAAI5G,SAAS,UAAUlB,WAAW,GAAGkB,SAAS,mBAAmBlB,WAAW"}

package/dist/cjs/shared/index.d.cts

@@ -17,7 +17,7 @@ export { BufferList };
  * or chunked streaming data (BufferList).
  */
 export type BufferLike = Buffer | BufferList;
-export { allocBuffer, allocBufferUnsafe, bufferCompare, bufferConcat, bufferEquals, bufferFrom, bufferSliceCopy, createInflateRawStream, inflateRaw, isNaN, objectAssign, PassThrough, Readable, readUInt64LE, Transform, Writable, writeUInt64LE, } from './compat.js';
+export { allocBuffer, allocBufferUnsafe, bufferCompare, bufferConcat, bufferEquals, bufferFrom, bufferSliceCopy, canAllocateBufferSize, createInflateRawStream, inflateRaw, isNaN, MAX_SAFE_BUFFER_LENGTH, objectAssign, PassThrough, Readable, readUInt64LE, Transform, Writable, writeUInt64LE, } from './compat.js';
 export { crc32, crc32Region, verifyCrc32, verifyCrc32Region } from './crc32.js';
 export { default as EntryStream } from './EntryStream.js';
 export { type CleanupFn, default as Lock } from './Lock.js';

package/dist/cjs/shared/index.d.ts

@@ -17,7 +17,7 @@ export { BufferList };
  * or chunked streaming data (BufferList).
  */
 export type BufferLike = Buffer | BufferList;
-export { allocBuffer, allocBufferUnsafe, bufferCompare, bufferConcat, bufferEquals, bufferFrom, bufferSliceCopy, createInflateRawStream, inflateRaw, isNaN, objectAssign, PassThrough, Readable, readUInt64LE, Transform, Writable, writeUInt64LE, } from './compat.js';
+export { allocBuffer, allocBufferUnsafe, bufferCompare, bufferConcat, bufferEquals, bufferFrom, bufferSliceCopy, canAllocateBufferSize, createInflateRawStream, inflateRaw, isNaN, MAX_SAFE_BUFFER_LENGTH, objectAssign, PassThrough, Readable, readUInt64LE, Transform, Writable, writeUInt64LE, } from './compat.js';
 export { crc32, crc32Region, verifyCrc32, verifyCrc32Region } from './crc32.js';
 export { default as EntryStream } from './EntryStream.js';
 export { type CleanupFn, default as Lock } from './Lock.js';

package/dist/cjs/shared/index.js

@@ -28,6 +28,9 @@ _export(exports, {
     get Lock () {
         return _Lockts.default;
     },
+    get MAX_SAFE_BUFFER_LENGTH () {
+        return _compatts.MAX_SAFE_BUFFER_LENGTH;
+    },
     get PassThrough () {
         return _compatts.PassThrough;
     },
@@ -61,6 +64,9 @@ _export(exports, {
     get bufferSliceCopy () {
         return _compatts.bufferSliceCopy;
     },
+    get canAllocateBufferSize () {
+        return _compatts.canAllocateBufferSize;
+    },
     get crc32 () {
         return _crc32ts.crc32;
     },

package/dist/cjs/shared/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["/Users/kevin/Dev/OpenSource/iterators/extract-base-iterator/src/shared/index.ts"],"sourcesContent":["/**\n * Shared utilities for iterator libraries\n *\n * These utilities are designed to be used by:\n * - zip-iterator\n * - 7z-iterator\n * - tar-iterator\n * - Any other archive iterator library\n *\n * All utilities support Node.js 0.8+\n */\n\nimport BufferList from './BufferList.ts';\n\nexport { BufferList };\n\n/**\n * Type alias for Buffer or BufferList - both can be read byte-by-byte.\n * Use this when an API should accept either contiguous data (Buffer)\n * or chunked streaming data (BufferList).\n */\nexport type BufferLike = Buffer | BufferList;\nexport {\n  allocBuffer,\n  allocBufferUnsafe,\n  bufferCompare,\n  bufferConcat,\n  bufferEquals,\n  bufferFrom,\n  bufferSliceCopy,\n  createInflateRawStream,\n  inflateRaw,\n  isNaN,\n  objectAssign,\n  PassThrough,\n  Readable,\n  readUInt64LE,\n  Transform,\n  Writable,\n  writeUInt64LE,\n} from './compat.ts';\nexport { crc32, crc32Region, verifyCrc32, verifyCrc32Region } from './crc32.ts';\nexport { default as EntryStream } from './EntryStream.ts';\nexport { type CleanupFn, default as Lock } from './Lock.ts';\nexport { default as normalizePath } from './normalizePath.ts';\nexport { default as streamToString, type StreamToStringCallback } from './streamToString.ts';\nexport { default as stripPath } from './stripPath.ts';\n"],"names":["BufferList","EntryStream","Lock","PassThrough","Readable","Transform","Writable","allocBuffer","allocBufferUnsafe","bufferCompare","bufferConcat","bufferEquals","bufferFrom","bufferSliceCopy","crc32","crc32Region","createInflateRawStream","inflateRaw","isNaN","normalizePath","objectAssign","readUInt64LE","streamToString","stripPath","verifyCrc32","verifyCrc32Region","writeUInt64LE"],"mappings":"AAAA;;;;;;;;;;CAUC;;;;;;;;;;;QAIQA;eAAAA,qBAAU;;QA4BCC;eAAAA,sBAAW;;QACKC;eAAAA,eAAI;;QATtCC;eAAAA,qBAAW;;QACXC;eAAAA,kBAAQ;;QAERC;eAAAA,mBAAS;;QACTC;eAAAA,kBAAQ;;QAfRC;eAAAA,qBAAW;;QACXC;eAAAA,2BAAiB;;QACjBC;eAAAA,uBAAa;;QACbC;eAAAA,sBAAY;;QACZC;eAAAA,sBAAY;;QACZC;eAAAA,oBAAU;;QACVC;eAAAA,yBAAe;;QAYRC;eAAAA,cAAK;;QAAEC;eAAAA,oBAAW;;QAXzBC;eAAAA,gCAAsB;;QACtBC;eAAAA,oBAAU;;QACVC;eAAAA,eAAK;;QAYaC;eAAAA,wBAAa;;QAX/BC;eAAAA,sBAAY;;QAGZC;eAAAA,sBAAY;;QASMC;eAAAA,yBAAc;;QACdC;eAAAA,oBAAS;;QALAC;eAAAA,oBAAW;;QAAEC;eAAAA,0BAAiB;;QAFzDC;eAAAA,uBAAa;;;mEA3BQ;wBA4BhB;uBAC4D;oEAC5B;6DACS;sEACP;uEAC8B;kEAClC"}
+{"version":3,"sources":["/Users/kevin/Dev/OpenSource/iterators/extract-base-iterator/src/shared/index.ts"],"sourcesContent":["/**\n * Shared utilities for iterator libraries\n *\n * These utilities are designed to be used by:\n * - zip-iterator\n * - 7z-iterator\n * - tar-iterator\n * - Any other archive iterator library\n *\n * All utilities support Node.js 0.8+\n */\n\nimport BufferList from './BufferList.ts';\n\nexport { BufferList };\n\n/**\n * Type alias for Buffer or BufferList - both can be read byte-by-byte.\n * Use this when an API should accept either contiguous data (Buffer)\n * or chunked streaming data (BufferList).\n */\nexport type BufferLike = Buffer | BufferList;\nexport {\n  allocBuffer,\n  allocBufferUnsafe,\n  bufferCompare,\n  bufferConcat,\n  bufferEquals,\n  bufferFrom,\n  bufferSliceCopy,\n  canAllocateBufferSize,\n  createInflateRawStream,\n  inflateRaw,\n  isNaN,\n  MAX_SAFE_BUFFER_LENGTH,\n  objectAssign,\n  PassThrough,\n  Readable,\n  readUInt64LE,\n  Transform,\n  Writable,\n  writeUInt64LE,\n} from './compat.ts';\nexport { crc32, crc32Region, verifyCrc32, verifyCrc32Region } from './crc32.ts';\nexport { default as EntryStream } from './EntryStream.ts';\nexport { type CleanupFn, default as Lock } from './Lock.ts';\nexport { default as normalizePath } from './normalizePath.ts';\nexport { default as streamToString, type StreamToStringCallback } from './streamToString.ts';\nexport { default as stripPath } from './stripPath.ts';\n"],"names":["BufferList","EntryStream","Lock","MAX_SAFE_BUFFER_LENGTH","PassThrough","Readable","Transform","Writable","allocBuffer","allocBufferUnsafe","bufferCompare","bufferConcat","bufferEquals","bufferFrom","bufferSliceCopy","canAllocateBufferSize","crc32","crc32Region","createInflateRawStream","inflateRaw","isNaN","normalizePath","objectAssign","readUInt64LE","streamToString","stripPath","verifyCrc32","verifyCrc32Region","writeUInt64LE"],"mappings":"AAAA;;;;;;;;;;CAUC;;;;;;;;;;;QAIQA;eAAAA,qBAAU;;QA8BCC;eAAAA,sBAAW;;QACKC;eAAAA,eAAI;;QAXtCC;eAAAA,gCAAsB;;QAEtBC;eAAAA,qBAAW;;QACXC;eAAAA,kBAAQ;;QAERC;eAAAA,mBAAS;;QACTC;eAAAA,kBAAQ;;QAjBRC;eAAAA,qBAAW;;QACXC;eAAAA,2BAAiB;;QACjBC;eAAAA,uBAAa;;QACbC;eAAAA,sBAAY;;QACZC;eAAAA,sBAAY;;QACZC;eAAAA,oBAAU;;QACVC;eAAAA,yBAAe;;QACfC;eAAAA,+BAAqB;;QAadC;eAAAA,cAAK;;QAAEC;eAAAA,oBAAW;;QAZzBC;eAAAA,gCAAsB;;QACtBC;eAAAA,oBAAU;;QACVC;eAAAA,eAAK;;QAaaC;eAAAA,wBAAa;;QAX/BC;eAAAA,sBAAY;;QAGZC;eAAAA,sBAAY;;QASMC;eAAAA,yBAAc;;QACdC;eAAAA,oBAAS;;QALAC;eAAAA,oBAAW;;QAAEC;eAAAA,0BAAiB;;QAFzDC;eAAAA,uBAAa;;;mEA7BQ;wBA8BhB;uBAC4D;oEAC5B;6DACS;sEACP;uEAC8B;kEAClC"}

package/dist/esm/shared/compat.d.ts

@@ -11,6 +11,12 @@
  *
  * Solution: Feature detection with graceful fallback in both directions.
  */
+export declare const MAX_SAFE_BUFFER_LENGTH: number;
+/**
+ * Check if a buffer size can be safely allocated on this Node version
+ * Uses conservative limit to work across all versions
+ */
+export declare function canAllocateBufferSize(size: number): boolean;
 /**
  * Allocate a zero-filled buffer (safe) - handles very large allocations
  * - Uses Buffer.alloc() on Node 4.5+

package/dist/esm/shared/compat.js

@@ -22,12 +22,13 @@ const hasBufferFrom = typeof Buffer.from === 'function' && Buffer.from !== Uint8
 // Node 6-7.x: ~1073MB for Uint8Array
 // Node 8+: ~2GB for Buffer
 // Node 10+: 2^31-1 (~2147MB) for Buffer.allocUnsafe
-// Use 128MB as a conservative limit for buffer operations
-const MAX_SAFE_BUFFER_LENGTH = 128 * 1024 * 1024; // 128MB
+// Use 256MB as a conservative limit for buffer operations
+// Must leave room for pairwise combination (256MB * 2 = 512MB, 512MB * 2 = 1024MB, etc.)
+export const MAX_SAFE_BUFFER_LENGTH = 256 * 1024 * 1024; // 256MB
 // Try to detect the actual kMaxLength for this Node version
 // If we can't detect it (older Node), assume conservative limit
 let DETECTED_MAX_LENGTH = null;
-function _getMaxBufferLength() {
+function getMaxBufferLength() {
     if (DETECTED_MAX_LENGTH !== null) return DETECTED_MAX_LENGTH;
     // Try to detect the actual limit
     // kMaxLength exists on BufferConstructor in newer TypeScript definitions
@@ -44,7 +45,7 @@ function _getMaxBufferLength() {
 /**
  * Check if a buffer size can be safely allocated on this Node version
  * Uses conservative limit to work across all versions
- */ function canAllocateBufferSize(size) {
+ */ export function canAllocateBufferSize(size) {
     return size >= 0 && size <= MAX_SAFE_BUFFER_LENGTH;
 }
 /**
@@ -58,36 +59,29 @@ function _getMaxBufferLength() {
     return buf;
 }
 /**
- * Combine an array of buffers into one by pairwise concatenation
- * Each combination produces a buffer at most 2x MAX_SAFE_BUFFER_LENGTH (256MB)
- * which is within kMaxLength for all Node versions
+ * Combine an array of buffers into one by iterative concatenation
+ * Stays under the actual kMaxLength for each Node version
+ * Uses a "fill and continue" approach
  */ function combineBuffersPairwise(buffers) {
-    while(buffers.length > 1){
-        const newBuffers = [];
-        for(let i = 0; i < buffers.length; i += 2){
-            if (i + 1 < buffers.length) {
-                const size1 = buffers[i].length;
-                const size2 = buffers[i + 1].length;
-                const combinedSize = size1 + size2;
-                // Safe: combinedSize <= 2 * MAX_SAFE_BUFFER_LENGTH = 256MB
-                const combined = createChunk(combinedSize, false);
-                buffers[i].copy(combined, 0);
-                buffers[i + 1].copy(combined, size1);
-                newBuffers.push(combined);
-            } else {
-                newBuffers.push(buffers[i]);
-            }
-        }
-        // Clear old references to help GC and use traditional for loop for Node 0.8 compatibility
-        for(let j = 0; j < buffers.length; j++){
-            buffers[j] = undefined;
-        }
-        buffers.length = 0;
-        for(let j = 0; j < newBuffers.length; j++){
-            buffers.push(newBuffers[j]);
-        }
+    const maxLength = getMaxBufferLength();
+    // Calculate total size
+    let totalSize = 0;
+    for(let i = 0; i < buffers.length; i++){
+        totalSize += buffers[i].length;
     }
-    return buffers[0];
+    // If total exceeds this Node version's limit, we cannot combine
+    // LZMA1 requires a single contiguous Buffer input
+    if (totalSize > maxLength) {
+        throw new Error(`Cannot combine buffers: total size (${totalSize} bytes) exceeds Node.js buffer limit (${maxLength} bytes). LZMA1 archives with folders larger than ${Math.floor(maxLength / 1024 / 1024)}MB cannot be processed on this Node version.`);
+    }
+    // If everything fits in a single allocation, do it directly
+    const result = createChunk(totalSize, false);
+    let offset = 0;
+    for(let i = 0; i < buffers.length; i++){
+        buffers[i].copy(result, offset);
+        offset += buffers[i].length;
+    }
+    return result;
 }
 /**
  * Allocate a large buffer by allocating in chunks and combining them

package/dist/esm/shared/compat.js.map

@@ -1 +1 @@
-{"version":3,"sources":["/Users/kevin/Dev/OpenSource/iterators/extract-base-iterator/src/shared/compat.ts"],"sourcesContent":["/**\n * Buffer Compatibility Layer for Node.js 0.8+\n *\n * Provides buffer utilities that work across all Node.js versions\n * WITHOUT modifying global Buffer object.\n *\n * Version history:\n * - Node 0.8-4.4: Only has `new Buffer()`, no `Buffer.alloc/from`\n * - Node 4.5+: Has `Buffer.alloc/from`, deprecates `new Buffer()`\n * - Node 10+: Warns or errors on `new Buffer()`\n *\n * Solution: Feature detection with graceful fallback in both directions.\n */\n\n// ESM-compatible require - works in both CJS and ESM\nimport Module from 'module';\n\nconst _require = typeof require === 'undefined' ? Module.createRequire(import.meta.url) : require;\n\n// Feature detection (runs once at module load)\nconst hasBufferAlloc = typeof Buffer.alloc === 'function';\nconst hasBufferAllocUnsafe = typeof Buffer.allocUnsafe === 'function';\nconst hasBufferFrom = typeof Buffer.from === 'function' && Buffer.from !== Uint8Array.from;\n\n// Maximum buffer size that works across all Node.js versions\n// Node 0.8-4.x: kMaxLength = 0x3fffffff (~1073MB) but actual limit may be lower\n// Node 6-7.x: ~1073MB for Uint8Array\n// Node 8+: ~2GB for Buffer\n// Node 10+: 2^31-1 (~2147MB) for Buffer.allocUnsafe\n// Use 128MB as a conservative limit for buffer operations\nconst MAX_SAFE_BUFFER_LENGTH = 128 * 1024 * 1024; // 128MB\n\n// Try to detect the actual kMaxLength for this Node version\n// If we can't detect it (older Node), assume conservative limit\nlet DETECTED_MAX_LENGTH: number | null = null;\n\nfunction _getMaxBufferLength(): number {\n  if (DETECTED_MAX_LENGTH !== null) return DETECTED_MAX_LENGTH;\n\n  // Try to detect the actual limit\n  // kMaxLength exists on BufferConstructor in newer TypeScript definitions\n  // but may not exist at runtime on very old Node\n  const maxLen = (Buffer as { kMaxLength?: number }).kMaxLength;\n  if (maxLen !== undefined) {\n    DETECTED_MAX_LENGTH = maxLen;\n  } else {\n    // Older Node - use conservative estimate\n    DETECTED_MAX_LENGTH = 0x3fffffff; // ~1073MB\n  }\n\n  return DETECTED_MAX_LENGTH;\n}\n\n/**\n * Check if a buffer size can be safely allocated on this Node version\n * Uses conservative limit to work across all versions\n */\nfunction canAllocateBufferSize(size: number): boolean {\n  return size >= 0 && size <= MAX_SAFE_BUFFER_LENGTH;\n}\n\n/**\n * Create a single chunk of the specified size\n */\nfunction createChunk(size: number, zeroFill: boolean): Buffer {\n  if (hasBufferAlloc) {\n    return Buffer.alloc(size);\n  }\n  const buf = new Buffer(size);\n  if (zeroFill) buf.fill(0);\n  return buf;\n}\n\n/**\n * Combine an array of buffers into one by pairwise concatenation\n * Each combination produces a buffer at most 2x MAX_SAFE_BUFFER_LENGTH (256MB)\n * which is within kMaxLength for all Node versions\n */\nfunction combineBuffersPairwise(buffers: Buffer[]): Buffer {\n  while (buffers.length > 1) {\n    const newBuffers: Buffer[] = [];\n\n    for (let i = 0; i < buffers.length; i += 2) {\n      if (i + 1 < buffers.length) {\n        const size1 = buffers[i].length;\n        const size2 = buffers[i + 1].length;\n        const combinedSize = size1 + size2;\n\n        // Safe: combinedSize <= 2 * MAX_SAFE_BUFFER_LENGTH = 256MB\n        const combined = createChunk(combinedSize, false);\n        buffers[i].copy(combined, 0);\n        buffers[i + 1].copy(combined, size1);\n        newBuffers.push(combined);\n      } else {\n        newBuffers.push(buffers[i]);\n      }\n    }\n\n    // Clear old references to help GC and use traditional for loop for Node 0.8 compatibility\n    for (let j = 0; j < buffers.length; j++) {\n      buffers[j] = undefined as unknown as Buffer;\n    }\n    buffers.length = 0;\n    for (let j = 0; j < newBuffers.length; j++) {\n      buffers.push(newBuffers[j]);\n    }\n  }\n\n  return buffers[0];\n}\n\n/**\n * Allocate a large buffer by allocating in chunks and combining them\n * Handles both zero-filled (safe) and uninitialized (unsafe) variants\n */\nfunction allocBufferLarge(size: number, zeroFill: boolean): Buffer {\n  // For large sizes, allocate smaller chunks and combine them\n  const numChunks = Math.ceil(size / MAX_SAFE_BUFFER_LENGTH);\n  const chunks: Buffer[] = [];\n\n  // Allocate individual chunks (each <= MAX_SAFE_BUFFER_LENGTH)\n  for (let i = 0; i < numChunks; i++) {\n    const chunkSize = Math.min(MAX_SAFE_BUFFER_LENGTH, size - i * MAX_SAFE_BUFFER_LENGTH);\n    chunks.push(createChunk(chunkSize, zeroFill));\n  }\n\n  // Combine chunks iteratively using pairwise combination\n  return combineBuffersPairwise(chunks);\n}\n\n/**\n * Allocate a zero-filled buffer (safe) - handles very large allocations\n * - Uses Buffer.alloc() on Node 4.5+\n * - Falls back to new Buffer() + fill on Node 0.8-4.4\n * - For sizes > MAX_SAFE_BUFFER_LENGTH, allocates in chunks and copies\n */\nexport function allocBuffer(size: number): Buffer {\n  if (size === 0) {\n    return new Buffer(0);\n  }\n\n  // Use native allocation for sizes within safe limits\n  if (canAllocateBufferSize(size)) {\n    if (hasBufferAlloc) {\n      return Buffer.alloc(size);\n    }\n    // Legacy fallback: new Buffer() is uninitialized, must zero-fill\n    const buf = new Buffer(size);\n    buf.fill(0);\n    return buf;\n  }\n\n  // For large sizes, allocate in chunks with zero-filling\n  return allocBufferLarge(size, true);\n}\n\n/**\n * Allocate a buffer without initialization (unsafe but faster)\n * - Uses Buffer.allocUnsafe() on Node 4.5+\n * - Falls back to new Buffer() on Node 0.8-4.4\n * - For sizes > MAX_SAFE_BUFFER_LENGTH, allocates in chunks without zeroing\n *\n * WARNING: Buffer contents are uninitialized and may contain sensitive data.\n * Only use when you will immediately overwrite all bytes.\n */\nexport function allocBufferUnsafe(size: number): Buffer {\n  if (size === 0) {\n    return new Buffer(0);\n  }\n\n  // Use native allocation for sizes within safe limits\n  if (canAllocateBufferSize(size)) {\n    if (hasBufferAllocUnsafe) {\n      return Buffer.allocUnsafe(size);\n    }\n    return new Buffer(size);\n  }\n\n  // For large sizes, allocate in chunks without zero-filling\n  return allocBufferLarge(size, false);\n}\n\n/**\n * Create a buffer from string, array, or existing buffer\n * - Uses Buffer.from() on Node 4.5+\n * - Falls back to new Buffer() on Node 0.8-4.4\n * - Handles Uint8Array conversion for Node 0.8 (crypto output compatibility)\n */\nexport function bufferFrom(data: string | number[] | Buffer | Uint8Array, encoding?: BufferEncoding): Buffer {\n  if (hasBufferFrom) {\n    if (typeof data === 'string') {\n      return Buffer.from(data, encoding);\n    }\n    return Buffer.from(data as number[] | Buffer);\n  }\n  // Node 0.8 compatibility - deprecated Buffer constructor\n  // For Uint8Array, convert to array first (needed for crypto output in Node 0.8)\n  if (data instanceof Uint8Array && !(data instanceof Buffer)) {\n    const arr: number[] = [];\n    for (let i = 0; i < data.length; i++) {\n      arr.push(data[i]);\n    }\n    return new Buffer(arr);\n  }\n  return new Buffer(data as string & number[], encoding);\n}\n\n/**\n * Compare two buffers or buffer regions\n * - Uses Buffer.compare() on Node 5.10+ (with offset support)\n * - Falls back to manual comparison on Node 0.8-5.9\n */\nexport function bufferCompare(source: Buffer, target: Buffer, targetStart?: number, targetEnd?: number, sourceStart?: number, sourceEnd?: number): number {\n  sourceStart = sourceStart || 0;\n  sourceEnd = sourceEnd || source.length;\n  targetStart = targetStart || 0;\n  targetEnd = targetEnd || target.length;\n\n  // Check if native compare with offset support exists (Node 5.10+)\n  if (source.compare && source.compare.length >= 5) {\n    return source.compare(target, targetStart, targetEnd, sourceStart, sourceEnd);\n  }\n\n  // Manual comparison for older Node versions\n  const sourceLen = sourceEnd - sourceStart;\n  const targetLen = targetEnd - targetStart;\n  const len = Math.min(sourceLen, targetLen);\n\n  for (let i = 0; i < len; i++) {\n    const s = source[sourceStart + i];\n    const t = target[targetStart + i];\n    if (s !== t) return s < t ? -1 : 1;\n  }\n\n  return sourceLen - targetLen;\n}\n\n/**\n * Check if buffer region equals byte array\n * Useful for magic number detection without Buffer.from()\n */\nexport function bufferEquals(buf: Buffer, offset: number, expected: number[]): boolean {\n  if (offset + expected.length > buf.length) return false;\n  for (let i = 0; i < expected.length; i++) {\n    if (buf[offset + i] !== expected[i]) return false;\n  }\n  return true;\n}\n\n/**\n * Copy buffer region to new buffer\n * Works on all Node versions\n */\nexport function bufferSliceCopy(buf: Buffer, start: number, end: number): Buffer {\n  const result = allocBuffer(end - start);\n  buf.copy(result, 0, start, end);\n  return result;\n}\n\n/**\n * Read 64-bit unsigned integer (little-endian)\n * Uses two 32-bit reads since BigInt not available until Node 10.4\n *\n * WARNING: Only accurate for values < Number.MAX_SAFE_INTEGER (2^53 - 1)\n * This covers files up to ~9 PB which is practical for all real use cases.\n */\nexport function readUInt64LE(buf: Buffer, offset: number): number {\n  const low = buf.readUInt32LE(offset);\n  const high = buf.readUInt32LE(offset + 4);\n  return high * 0x100000000 + low;\n}\n\n/**\n * Write 64-bit unsigned integer (little-endian)\n * Same precision limitation as readUInt64LE\n */\nexport function writeUInt64LE(buf: Buffer, value: number, offset: number): void {\n  const low = value >>> 0;\n  const high = (value / 0x100000000) >>> 0;\n  buf.writeUInt32LE(low, offset);\n  buf.writeUInt32LE(high, offset + 4);\n}\n\n/**\n * Concatenate buffers - compatible with Node 0.8+\n * Handles crypto output which may not be proper Buffer instances in old Node.\n * Also handles very large concatenations that would exceed buffer limits.\n *\n * NOTE: This function is primarily needed for AES decryption compatibility\n * in Node 0.8 where crypto output may not be proper Buffer instances.\n * Libraries not using crypto can use native Buffer.concat() directly.\n */\nexport function bufferConcat(list: (Buffer | Uint8Array)[], totalLength?: number): Buffer {\n  // Calculate actual total length first\n  let actualLength = 0;\n  for (let i = 0; i < list.length; i++) {\n    actualLength += list[i].length;\n  }\n\n  // Use specified totalLength or actual length\n  const targetLength = totalLength !== undefined ? totalLength : actualLength;\n\n  // Handle empty list\n  if (list.length === 0) {\n    return new Buffer(0);\n  }\n\n  // Handle very large concatenations that would exceed buffer limits\n  // Use native Buffer.concat for smaller sizes (faster)\n  if (targetLength <= MAX_SAFE_BUFFER_LENGTH) {\n    // Check if all items are proper Buffers AND no truncation needed\n    // (Node 0.8's Buffer.concat doesn't handle truncation well)\n    let allBuffers = true;\n    for (let j = 0; j < list.length; j++) {\n      if (!(list[j] instanceof Buffer)) {\n        allBuffers = false;\n        break;\n      }\n    }\n    if (allBuffers && targetLength >= actualLength) {\n      return Buffer.concat(list as Buffer[], targetLength);\n    }\n  }\n\n  // For large or complex concatenations, use chunked approach\n  // This will use allocBuffer which handles large sizes via chunking\n  const result = allocBuffer(targetLength);\n  let offset = 0;\n\n  for (let k = 0; k < list.length && offset < targetLength; k++) {\n    const buf = list[k];\n    const toCopy = Math.min(buf.length, targetLength - offset);\n\n    if (buf instanceof Buffer) {\n      buf.copy(result, offset, 0, toCopy);\n    } else {\n      // Uint8Array - need to copy byte by byte\n      for (let l = 0; l < toCopy; l++) {\n        result[offset + l] = buf[l];\n      }\n    }\n    offset += toCopy;\n  }\n\n  return result;\n}\n\n/**\n * Node 0.8 compatible isNaN (Number.isNaN didn't exist until ES2015)\n * Uses self-comparison: NaN is the only value not equal to itself\n */\n// biome-ignore lint/suspicious/noShadowRestrictedNames: Legacy compatibility\nexport function isNaN(value: number): boolean {\n  // biome-ignore lint/suspicious/noSelfCompare: NaN check pattern\n  return value !== value;\n}\n\n/**\n * Decompress raw DEFLATE data (no zlib/gzip header)\n * - Uses native zlib.inflateRawSync() on Node 0.11.12+\n * - Falls back to pako for Node 0.8-0.10\n *\n * Version history:\n * - Node 0.8-0.10: No zlib sync methods, use pako\n * - Node 0.11.12+: zlib.inflateRawSync available\n */\n// Feature detection for native zlib sync methods (Node 0.11.12+)\nlet zlib: typeof import('zlib') | null = null;\ntry {\n  zlib = _require('zlib');\n} catch (_e) {\n  // zlib not available (shouldn't happen in Node.js)\n}\nconst hasNativeInflateRaw = zlib !== null && typeof zlib.inflateRawSync === 'function';\n\nexport function inflateRaw(input: Buffer): Buffer {\n  if (hasNativeInflateRaw && zlib) {\n    return zlib.inflateRawSync(input);\n  }\n  // Fallback to pako for Node 0.8-0.10\n  const pako = _require('pako');\n  return bufferFrom(pako.inflateRaw(input));\n}\n\n/**\n * Create a streaming raw DEFLATE decompressor (Transform stream)\n * Decompresses data incrementally to avoid holding full output in memory.\n *\n * - Uses native zlib.createInflateRaw() on Node 0.11.12+\n * - Falls back to pako-based Transform for Node 0.8-0.10\n *\n * @returns A Transform stream that decompresses raw DEFLATE data\n */\n// Check for native streaming inflate (Node 0.11.12+ has createInflateRaw)\n// biome-ignore lint/suspicious/noExplicitAny: createInflateRaw not in older TS definitions\nconst hasNativeStreamingInflate = zlib !== null && typeof (zlib as any).createInflateRaw === 'function';\n\nexport function createInflateRawStream(): NodeJS.ReadWriteStream {\n  if (hasNativeStreamingInflate && zlib) {\n    // Use native zlib streaming Transform\n    // biome-ignore lint/suspicious/noExplicitAny: createInflateRaw not in older TS definitions\n    return (zlib as any).createInflateRaw();\n  }\n\n  // Fallback to pako-based Transform for Node 0.8-0.10\n  // Use readable-stream for Node 0.8 compatibility\n  const Transform = _require('readable-stream').Transform;\n  const pako = _require('pako');\n\n  const inflate = new pako.Inflate({ raw: true, chunkSize: 16384 });\n  const transform = new Transform();\n  const pendingChunks: Buffer[] = [];\n  let ended = false;\n\n  // Pako calls onData synchronously during push()\n  inflate.onData = (chunk: Uint8Array) => {\n    pendingChunks.push(bufferFrom(chunk));\n  };\n\n  inflate.onEnd = (status: number) => {\n    ended = true;\n    if (status !== 0) {\n      transform.emit('error', new Error(`Inflate error: ${inflate.msg || 'unknown'}`));\n    }\n  };\n\n  transform._transform = function (chunk: Buffer, _encoding: string, callback: (err?: Error) => void) {\n    try {\n      inflate.push(chunk, false);\n      // Push any pending decompressed chunks\n      while (pendingChunks.length > 0) {\n        this.push(pendingChunks.shift());\n      }\n      callback();\n    } catch (err) {\n      callback(err as Error);\n    }\n  };\n\n  transform._flush = function (callback: (err?: Error) => void) {\n    try {\n      inflate.push(new Uint8Array(0), true); // Signal end\n      // Push any remaining decompressed chunks\n      while (pendingChunks.length > 0) {\n        this.push(pendingChunks.shift());\n      }\n      if (ended && inflate.err) {\n        callback(new Error(`Inflate error: ${inflate.msg || 'unknown'}`));\n      } else {\n        callback();\n      }\n    } catch (err) {\n      callback(err as Error);\n    }\n  };\n\n  return transform;\n}\n\n/**\n * Object.assign wrapper for Node.js 0.8+\n * - Uses native Object.assign on Node 4.0+\n * - Falls back to manual property copy on Node 0.8-3.x\n */\nconst hasObjectAssign = typeof Object.assign === 'function';\nconst _hasOwnProperty = Object.prototype.hasOwnProperty;\n\nexport function objectAssign<T, U>(target: T, source: U): T & U {\n  if (hasObjectAssign) return Object.assign(target, source);\n\n  for (const key in source) {\n    if (_hasOwnProperty.call(source, key)) (target as Record<string, unknown>)[key] = source[key];\n  }\n  return target as T & U;\n}\n\n/**\n * Stream compatibility - Transform class\n * - Uses native stream.Transform on Node 0.10+\n * - Falls back to readable-stream for Node 0.8\n */\nconst major = +process.versions.node.split('.')[0];\nexport const Readable: typeof import('stream').Readable = major > 0 ? _require('stream').Readable : _require('readable-stream').Readable;\nexport const Writable: typeof import('stream').Writable = major > 0 ? _require('stream').Writable : _require('readable-stream').Writable;\nexport const Transform: typeof import('stream').Transform = major > 0 ? _require('stream').Transform : _require('readable-stream').Transform;\nexport const PassThrough: typeof import('stream').PassThrough = major > 0 ? _require('stream').PassThrough : _require('readable-stream').PassThrough;\n"],"names":["Module","_require","require","createRequire","url","hasBufferAlloc","Buffer","alloc","hasBufferAllocUnsafe","allocUnsafe","hasBufferFrom","from","Uint8Array","MAX_SAFE_BUFFER_LENGTH","DETECTED_MAX_LENGTH","_getMaxBufferLength","maxLen","kMaxLength","undefined","canAllocateBufferSize","size","createChunk","zeroFill","buf","fill","combineBuffersPairwise","buffers","length","newBuffers","i","size1","size2","combinedSize","combined","copy","push","j","allocBufferLarge","numChunks","Math","ceil","chunks","chunkSize","min","allocBuffer","allocBufferUnsafe","bufferFrom","data","encoding","arr","bufferCompare","source","target","targetStart","targetEnd","sourceStart","sourceEnd","compare","sourceLen","targetLen","len","s","t","bufferEquals","offset","expected","bufferSliceCopy","start","end","result","readUInt64LE","low","readUInt32LE","high","writeUInt64LE","value","writeUInt32LE","bufferConcat","list","totalLength","actualLength","targetLength","allBuffers","concat","k","toCopy","l","isNaN","zlib","_e","hasNativeInflateRaw","inflateRawSync","inflateRaw","input","pako","hasNativeStreamingInflate","createInflateRaw","createInflateRawStream","Transform","inflate","Inflate","raw","transform","pendingChunks","ended","onData","chunk","onEnd","status","emit","Error","msg","_transform","_encoding","callback","shift","err","_flush","hasObjectAssign","Object","assign","_hasOwnProperty","prototype","hasOwnProperty","objectAssign","key","call","major","process","versions","node","split","Readable","Writable","PassThrough"],"mappings":"AAAA;;;;;;;;;;;;CAYC,GAED,qDAAqD;AACrD,OAAOA,YAAY,SAAS;AAE5B,MAAMC,WAAW,OAAOC,YAAY,cAAcF,OAAOG,aAAa,CAAC,YAAYC,GAAG,IAAIF;AAE1F,+CAA+C;AAC/C,MAAMG,iBAAiB,OAAOC,OAAOC,KAAK,KAAK;AAC/C,MAAMC,uBAAuB,OAAOF,OAAOG,WAAW,KAAK;AAC3D,MAAMC,gBAAgB,OAAOJ,OAAOK,IAAI,KAAK,cAAcL,OAAOK,IAAI,KAAKC,WAAWD,IAAI;AAE1F,6DAA6D;AAC7D,gFAAgF;AAChF,qCAAqC;AACrC,2BAA2B;AAC3B,oDAAoD;AACpD,0DAA0D;AAC1D,MAAME,yBAAyB,MAAM,OAAO,MAAM,QAAQ;AAE1D,4DAA4D;AAC5D,gEAAgE;AAChE,IAAIC,sBAAqC;AAEzC,SAASC;IACP,IAAID,wBAAwB,MAAM,OAAOA;IAEzC,iCAAiC;IACjC,yEAAyE;IACzE,gDAAgD;IAChD,MAAME,SAAS,AAACV,OAAmCW,UAAU;IAC7D,IAAID,WAAWE,WAAW;QACxBJ,sBAAsBE;IACxB,OAAO;QACL,yCAAyC;QACzCF,sBAAsB,YAAY,UAAU;IAC9C;IAEA,OAAOA;AACT;AAEA;;;CAGC,GACD,SAASK,sBAAsBC,IAAY;IACzC,OAAOA,QAAQ,KAAKA,QAAQP;AAC9B;AAEA;;CAEC,GACD,SAASQ,YAAYD,IAAY,EAAEE,QAAiB;IAClD,IAAIjB,gBAAgB;QAClB,OAAOC,OAAOC,KAAK,CAACa;IACtB;IACA,MAAMG,MAAM,IAAIjB,OAAOc;IACvB,IAAIE,UAAUC,IAAIC,IAAI,CAAC;IACvB,OAAOD;AACT;AAEA;;;;CAIC,GACD,SAASE,uBAAuBC,OAAiB;IAC/C,MAAOA,QAAQC,MAAM,GAAG,EAAG;QACzB,MAAMC,aAAuB,EAAE;QAE/B,IAAK,IAAIC,IAAI,GAAGA,IAAIH,QAAQC,MAAM,EAAEE,KAAK,EAAG;YAC1C,IAAIA,IAAI,IAAIH,QAAQC,MAAM,EAAE;gBAC1B,MAAMG,QAAQJ,OAAO,CAACG,EAAE,CAACF,MAAM;gBAC/B,MAAMI,QAAQL,OAAO,CAACG,IAAI,EAAE,CAACF,MAAM;gBACnC,MAAMK,eAAeF,QAAQC;gBAE7B,2DAA2D;gBAC3D,MAAME,WAAWZ,YAAYW,cAAc;gBAC3CN,OAAO,CAACG,EAAE,CAACK,IAAI,CAACD,UAAU;gBAC1BP,OAAO,CAACG,IAAI,EAAE,CAACK,IAAI,CAACD,UAAUH;gBAC9BF,WAAWO,IAAI,CAACF;YAClB,OAAO;gBACLL,WAAWO,IAAI,CAACT,OAAO,CAACG,EAAE;YAC5B;QACF;QAEA,0FAA0F;QAC1F,IAAK,IAAIO,IAAI,GAAGA,IAAIV,QAAQC,MAAM,EAAES,IAAK;YACvCV,OAAO,CAACU,EAAE,GAAGlB;QACf;QACAQ,QAAQC,MAAM,GAAG;QACjB,IAAK,IAAIS,IAAI,GAAGA,IAAIR,WAAWD,MAAM,EAAES,IAAK;YAC1CV,QAAQS,IAAI,CAACP,UAAU,CAACQ,EAAE;QAC5B;IACF;IAEA,OAAOV,OAAO,CAAC,EAAE;AACnB;AAEA;;;CAGC,GACD,SAASW,iBAAiBjB,IAAY,EAAEE,QAAiB;IACvD,4DAA4D;IAC5D,MAAMgB,YAAYC,KAAKC,IAAI,CAACpB,OAAOP;IACnC,MAAM4B,SAAmB,EAAE;IAE3B,8DAA8D;IAC9D,IAAK,IAAIZ,IAAI,GAAGA,IAAIS,WAAWT,IAAK;QAClC,MAAMa,YAAYH,KAAKI,GAAG,CAAC9B,wBAAwBO,OAAOS,IAAIhB;QAC9D4B,OAAON,IAAI,CAACd,YAAYqB,WAAWpB;IACrC;IAEA,wDAAwD;IACxD,OAAOG,uBAAuBgB;AAChC;AAEA;;;;;CAKC,GACD,OAAO,SAASG,YAAYxB,IAAY;IACtC,IAAIA,SAAS,GAAG;QACd,OAAO,IAAId,OAAO;IACpB;IAEA,qDAAqD;IACrD,IAAIa,sBAAsBC,OAAO;QAC/B,IAAIf,gBAAgB;YAClB,OAAOC,OAAOC,KAAK,CAACa;QACtB;QACA,iEAAiE;QACjE,MAAMG,MAAM,IAAIjB,OAAOc;QACvBG,IAAIC,IAAI,CAAC;QACT,OAAOD;IACT;IAEA,wDAAwD;IACxD,OAAOc,iBAAiBjB,MAAM;AAChC;AAEA;;;;;;;;CAQC,GACD,OAAO,SAASyB,kBAAkBzB,IAAY;IAC5C,IAAIA,SAAS,GAAG;QACd,OAAO,IAAId,OAAO;IACpB;IAEA,qDAAqD;IACrD,IAAIa,sBAAsBC,OAAO;QAC/B,IAAIZ,sBAAsB;YACxB,OAAOF,OAAOG,WAAW,CAACW;QAC5B;QACA,OAAO,IAAId,OAAOc;IACpB;IAEA,2DAA2D;IAC3D,OAAOiB,iBAAiBjB,MAAM;AAChC;AAEA;;;;;CAKC,GACD,OAAO,SAAS0B,WAAWC,IAA6C,EAAEC,QAAyB;IACjG,IAAItC,eAAe;QACjB,IAAI,OAAOqC,SAAS,UAAU;YAC5B,OAAOzC,OAAOK,IAAI,CAACoC,MAAMC;QAC3B;QACA,OAAO1C,OAAOK,IAAI,CAACoC;IACrB;IACA,yDAAyD;IACzD,gFAAgF;IAChF,IAAIA,gBAAgBnC,cAAc,CAAEmC,CAAAA,gBAAgBzC,MAAK,GAAI;QAC3D,MAAM2C,MAAgB,EAAE;QACxB,IAAK,IAAIpB,IAAI,GAAGA,IAAIkB,KAAKpB,MAAM,EAAEE,IAAK;YACpCoB,IAAId,IAAI,CAACY,IAAI,CAAClB,EAAE;QAClB;QACA,OAAO,IAAIvB,OAAO2C;IACpB;IACA,OAAO,IAAI3C,OAAOyC,MAA2BC;AAC/C;AAEA;;;;CAIC,GACD,OAAO,SAASE,cAAcC,MAAc,EAAEC,MAAc,EAAEC,WAAoB,EAAEC,SAAkB,EAAEC,WAAoB,EAAEC,SAAkB;IAC9ID,cAAcA,eAAe;IAC7BC,YAAYA,aAAaL,OAAOxB,MAAM;IACtC0B,cAAcA,eAAe;IAC7BC,YAAYA,aAAaF,OAAOzB,MAAM;IAEtC,kEAAkE;IAClE,IAAIwB,OAAOM,OAAO,IAAIN,OAAOM,OAAO,CAAC9B,MAAM,IAAI,GAAG;QAChD,OAAOwB,OAAOM,OAAO,CAACL,QAAQC,aAAaC,WAAWC,aAAaC;IACrE;IAEA,4CAA4C;IAC5C,MAAME,YAAYF,YAAYD;IAC9B,MAAMI,YAAYL,YAAYD;IAC9B,MAAMO,MAAMrB,KAAKI,GAAG,CAACe,WAAWC;IAEhC,IAAK,IAAI9B,IAAI,GAAGA,IAAI+B,KAAK/B,IAAK;QAC5B,MAAMgC,IAAIV,MAAM,CAACI,cAAc1B,EAAE;QACjC,MAAMiC,IAAIV,MAAM,CAACC,cAAcxB,EAAE;QACjC,IAAIgC,MAAMC,GAAG,OAAOD,IAAIC,IAAI,CAAC,IAAI;IACnC;IAEA,OAAOJ,YAAYC;AACrB;AAEA;;;CAGC,GACD,OAAO,SAASI,aAAaxC,GAAW,EAAEyC,MAAc,EAAEC,QAAkB;IAC1E,IAAID,SAASC,SAAStC,MAAM,GAAGJ,IAAII,MAAM,EAAE,OAAO;IAClD,IAAK,IAAIE,IAAI,GAAGA,IAAIoC,SAAStC,MAAM,EAAEE,IAAK;QACxC,IAAIN,GAAG,CAACyC,SAASnC,EAAE,KAAKoC,QAAQ,CAACpC,EAAE,EAAE,OAAO;IAC9C;IACA,OAAO;AACT;AAEA;;;CAGC,GACD,OAAO,SAASqC,gBAAgB3C,GAAW,EAAE4C,KAAa,EAAEC,GAAW;IACrE,MAAMC,SAASzB,YAAYwB,MAAMD;IACjC5C,IAAIW,IAAI,CAACmC,QAAQ,GAAGF,OAAOC;IAC3B,OAAOC;AACT;AAEA;;;;;;CAMC,GACD,OAAO,SAASC,aAAa/C,GAAW,EAAEyC,MAAc;IACtD,MAAMO,MAAMhD,IAAIiD,YAAY,CAACR;IAC7B,MAAMS,OAAOlD,IAAIiD,YAAY,CAACR,SAAS;IACvC,OAAOS,OAAO,cAAcF;AAC9B;AAEA;;;CAGC,GACD,OAAO,SAASG,cAAcnD,GAAW,EAAEoD,KAAa,EAAEX,MAAc;IACtE,MAAMO,MAAMI,UAAU;IACtB,MAAMF,OAAO,AAACE,QAAQ,gBAAiB;IACvCpD,IAAIqD,aAAa,CAACL,KAAKP;IACvBzC,IAAIqD,aAAa,CAACH,MAAMT,SAAS;AACnC;AAEA;;;;;;;;CAQC,GACD,OAAO,SAASa,aAAaC,IAA6B,EAAEC,WAAoB;IAC9E,sCAAsC;IACtC,IAAIC,eAAe;IACnB,IAAK,IAAInD,IAAI,GAAGA,IAAIiD,KAAKnD,MAAM,EAAEE,IAAK;QACpCmD,gBAAgBF,IAAI,CAACjD,EAAE,CAACF,MAAM;IAChC;IAEA,6CAA6C;IAC7C,MAAMsD,eAAeF,gBAAgB7D,YAAY6D,cAAcC;IAE/D,oBAAoB;IACpB,IAAIF,KAAKnD,MAAM,KAAK,GAAG;QACrB,OAAO,IAAIrB,OAAO;IACpB;IAEA,mEAAmE;IACnE,sDAAsD;IACtD,IAAI2E,gBAAgBpE,wBAAwB;QAC1C,iEAAiE;QACjE,4DAA4D;QAC5D,IAAIqE,aAAa;QACjB,IAAK,IAAI9C,IAAI,GAAGA,IAAI0C,KAAKnD,MAAM,EAAES,IAAK;YACpC,IAAI,CAAE0C,CAAAA,IAAI,CAAC1C,EAAE,YAAY9B,MAAK,GAAI;gBAChC4E,aAAa;gBACb;YACF;QACF;QACA,IAAIA,cAAcD,gBAAgBD,cAAc;YAC9C,OAAO1E,OAAO6E,MAAM,CAACL,MAAkBG;QACzC;IACF;IAEA,4DAA4D;IAC5D,mEAAmE;IACnE,MAAMZ,SAASzB,YAAYqC;IAC3B,IAAIjB,SAAS;IAEb,IAAK,IAAIoB,IAAI,GAAGA,IAAIN,KAAKnD,MAAM,IAAIqC,SAASiB,cAAcG,IAAK;QAC7D,MAAM7D,MAAMuD,IAAI,CAACM,EAAE;QACnB,MAAMC,SAAS9C,KAAKI,GAAG,CAACpB,IAAII,MAAM,EAAEsD,eAAejB;QAEnD,IAAIzC,eAAejB,QAAQ;YACzBiB,IAAIW,IAAI,CAACmC,QAAQL,QAAQ,GAAGqB;QAC9B,OAAO;YACL,yCAAyC;YACzC,IAAK,IAAIC,IAAI,GAAGA,IAAID,QAAQC,IAAK;gBAC/BjB,MAAM,CAACL,SAASsB,EAAE,GAAG/D,GAAG,CAAC+D,EAAE;YAC7B;QACF;QACAtB,UAAUqB;IACZ;IAEA,OAAOhB;AACT;AAEA;;;CAGC,GACD,6EAA6E;AAC7E,OAAO,SAASkB,MAAMZ,KAAa;IACjC,gEAAgE;IAChE,OAAOA,UAAUA;AACnB;AAEA;;;;;;;;CAQC,GACD,iEAAiE;AACjE,IAAIa,OAAqC;AACzC,IAAI;IACFA,OAAOvF,SAAS;AAClB,EAAE,OAAOwF,IAAI;AACX,mDAAmD;AACrD;AACA,MAAMC,sBAAsBF,SAAS,QAAQ,OAAOA,KAAKG,cAAc,KAAK;AAE5E,OAAO,SAASC,WAAWC,KAAa;IACtC,IAAIH,uBAAuBF,MAAM;QAC/B,OAAOA,KAAKG,cAAc,CAACE;IAC7B;IACA,qCAAqC;IACrC,MAAMC,OAAO7F,SAAS;IACtB,OAAO6C,WAAWgD,KAAKF,UAAU,CAACC;AACpC;AAEA;;;;;;;;CAQC,GACD,0EAA0E;AAC1E,2FAA2F;AAC3F,MAAME,4BAA4BP,SAAS,QAAQ,OAAO,AAACA,KAAaQ,gBAAgB,KAAK;AAE7F,OAAO,SAASC;IACd,IAAIF,6BAA6BP,MAAM;QACrC,sCAAsC;QACtC,2FAA2F;QAC3F,OAAO,AAACA,KAAaQ,gBAAgB;IACvC;IAEA,qDAAqD;IACrD,iDAAiD;IACjD,MAAME,YAAYjG,SAAS,mBAAmBiG,SAAS;IACvD,MAAMJ,OAAO7F,SAAS;IAEtB,MAAMkG,UAAU,IAAIL,KAAKM,OAAO,CAAC;QAAEC,KAAK;QAAM3D,WAAW;IAAM;IAC/D,MAAM4D,YAAY,IAAIJ;IACtB,MAAMK,gBAA0B,EAAE;IAClC,IAAIC,QAAQ;IAEZ,gDAAgD;IAChDL,QAAQM,MAAM,GAAG,CAACC;QAChBH,cAAcpE,IAAI,CAACW,WAAW4D;IAChC;IAEAP,QAAQQ,KAAK,GAAG,CAACC;QACfJ,QAAQ;QACR,IAAII,WAAW,GAAG;YAChBN,UAAUO,IAAI,CAAC,SAAS,IAAIC,MAAM,CAAC,eAAe,EAAEX,QAAQY,GAAG,IAAI,WAAW;QAChF;IACF;IAEAT,UAAUU,UAAU,GAAG,SAAUN,KAAa,EAAEO,SAAiB,EAAEC,QAA+B;QAChG,IAAI;YACFf,QAAQhE,IAAI,CAACuE,OAAO;YACpB,uCAAuC;YACvC,MAAOH,cAAc5E,MAAM,GAAG,EAAG;gBAC/B,IAAI,CAACQ,IAAI,CAACoE,cAAcY,KAAK;YAC/B;YACAD;QACF,EAAE,OAAOE,KAAK;YACZF,SAASE;QACX;IACF;IAEAd,UAAUe,MAAM,GAAG,SAAUH,QAA+B;QAC1D,IAAI;YACFf,QAAQhE,IAAI,CAAC,IAAIvB,WAAW,IAAI,OAAO,aAAa;YACpD,yCAAyC;YACzC,MAAO2F,cAAc5E,MAAM,GAAG,EAAG;gBAC/B,IAAI,CAACQ,IAAI,CAACoE,cAAcY,KAAK;YAC/B;YACA,IAAIX,SAASL,QAAQiB,GAAG,EAAE;gBACxBF,SAAS,IAAIJ,MAAM,CAAC,eAAe,EAAEX,QAAQY,GAAG,IAAI,WAAW;YACjE,OAAO;gBACLG;YACF;QACF,EAAE,OAAOE,KAAK;YACZF,SAASE;QACX;IACF;IAEA,OAAOd;AACT;AAEA;;;;CAIC,GACD,MAAMgB,kBAAkB,OAAOC,OAAOC,MAAM,KAAK;AACjD,MAAMC,kBAAkBF,OAAOG,SAAS,CAACC,cAAc;AAEvD,OAAO,SAASC,aAAmBxE,MAAS,EAAED,MAAS;IACrD,IAAImE,iBAAiB,OAAOC,OAAOC,MAAM,CAACpE,QAAQD;IAElD,IAAK,MAAM0E,OAAO1E,OAAQ;QACxB,IAAIsE,gBAAgBK,IAAI,CAAC3E,QAAQ0E,MAAM,AAACzE,MAAkC,CAACyE,IAAI,GAAG1E,MAAM,CAAC0E,IAAI;IAC/F;IACA,OAAOzE;AACT;AAEA;;;;CAIC,GACD,MAAM2E,QAAQ,CAACC,QAAQC,QAAQ,CAACC,IAAI,CAACC,KAAK,CAAC,IAAI,CAAC,EAAE;AAClD,OAAO,MAAMC,WAA6CL,QAAQ,IAAI9H,SAAS,UAAUmI,QAAQ,GAAGnI,SAAS,mBAAmBmI,QAAQ,CAAC;AACzI,OAAO,MAAMC,WAA6CN,QAAQ,IAAI9H,SAAS,UAAUoI,QAAQ,GAAGpI,SAAS,mBAAmBoI,QAAQ,CAAC;AACzI,OAAO,MAAMnC,YAA+C6B,QAAQ,IAAI9H,SAAS,UAAUiG,SAAS,GAAGjG,SAAS,mBAAmBiG,SAAS,CAAC;AAC7I,OAAO,MAAMoC,cAAmDP,QAAQ,IAAI9H,SAAS,UAAUqI,WAAW,GAAGrI,SAAS,mBAAmBqI,WAAW,CAAC"}
+{"version":3,"sources":["/Users/kevin/Dev/OpenSource/iterators/extract-base-iterator/src/shared/compat.ts"],"sourcesContent":["/**\n * Buffer Compatibility Layer for Node.js 0.8+\n *\n * Provides buffer utilities that work across all Node.js versions\n * WITHOUT modifying global Buffer object.\n *\n * Version history:\n * - Node 0.8-4.4: Only has `new Buffer()`, no `Buffer.alloc/from`\n * - Node 4.5+: Has `Buffer.alloc/from`, deprecates `new Buffer()`\n * - Node 10+: Warns or errors on `new Buffer()`\n *\n * Solution: Feature detection with graceful fallback in both directions.\n */\n\n// ESM-compatible require - works in both CJS and ESM\nimport Module from 'module';\n\nconst _require = typeof require === 'undefined' ? Module.createRequire(import.meta.url) : require;\n\n// Feature detection (runs once at module load)\nconst hasBufferAlloc = typeof Buffer.alloc === 'function';\nconst hasBufferAllocUnsafe = typeof Buffer.allocUnsafe === 'function';\nconst hasBufferFrom = typeof Buffer.from === 'function' && Buffer.from !== Uint8Array.from;\n\n// Maximum buffer size that works across all Node.js versions\n// Node 0.8-4.x: kMaxLength = 0x3fffffff (~1073MB) but actual limit may be lower\n// Node 6-7.x: ~1073MB for Uint8Array\n// Node 8+: ~2GB for Buffer\n// Node 10+: 2^31-1 (~2147MB) for Buffer.allocUnsafe\n// Use 256MB as a conservative limit for buffer operations\n// Must leave room for pairwise combination (256MB * 2 = 512MB, 512MB * 2 = 1024MB, etc.)\nexport const MAX_SAFE_BUFFER_LENGTH = 256 * 1024 * 1024; // 256MB\n\n// Try to detect the actual kMaxLength for this Node version\n// If we can't detect it (older Node), assume conservative limit\nlet DETECTED_MAX_LENGTH: number | null = null;\n\nfunction getMaxBufferLength(): number {\n  if (DETECTED_MAX_LENGTH !== null) return DETECTED_MAX_LENGTH;\n\n  // Try to detect the actual limit\n  // kMaxLength exists on BufferConstructor in newer TypeScript definitions\n  // but may not exist at runtime on very old Node\n  const maxLen = (Buffer as { kMaxLength?: number }).kMaxLength;\n  if (maxLen !== undefined) {\n    DETECTED_MAX_LENGTH = maxLen;\n  } else {\n    // Older Node - use conservative estimate\n    DETECTED_MAX_LENGTH = 0x3fffffff; // ~1073MB\n  }\n\n  return DETECTED_MAX_LENGTH;\n}\n\n/**\n * Check if a buffer size can be safely allocated on this Node version\n * Uses conservative limit to work across all versions\n */\nexport function canAllocateBufferSize(size: number): boolean {\n  return size >= 0 && size <= MAX_SAFE_BUFFER_LENGTH;\n}\n\n/**\n * Create a single chunk of the specified size\n */\nfunction createChunk(size: number, zeroFill: boolean): Buffer {\n  if (hasBufferAlloc) {\n    return Buffer.alloc(size);\n  }\n  const buf = new Buffer(size);\n  if (zeroFill) buf.fill(0);\n  return buf;\n}\n\n/**\n * Combine an array of buffers into one by iterative concatenation\n * Stays under the actual kMaxLength for each Node version\n * Uses a \"fill and continue\" approach\n */\nfunction combineBuffersPairwise(buffers: Buffer[]): Buffer {\n  const maxLength = getMaxBufferLength();\n\n  // Calculate total size\n  let totalSize = 0;\n  for (let i = 0; i < buffers.length; i++) {\n    totalSize += buffers[i].length;\n  }\n\n  // If total exceeds this Node version's limit, we cannot combine\n  // LZMA1 requires a single contiguous Buffer input\n  if (totalSize > maxLength) {\n    throw new Error(`Cannot combine buffers: total size (${totalSize} bytes) exceeds Node.js buffer limit (${maxLength} bytes). LZMA1 archives with folders larger than ${Math.floor(maxLength / 1024 / 1024)}MB cannot be processed on this Node version.`);\n  }\n\n  // If everything fits in a single allocation, do it directly\n  const result = createChunk(totalSize, false);\n  let offset = 0;\n  for (let i = 0; i < buffers.length; i++) {\n    buffers[i].copy(result, offset);\n    offset += buffers[i].length;\n  }\n  return result;\n}\n\n/**\n * Allocate a large buffer by allocating in chunks and combining them\n * Handles both zero-filled (safe) and uninitialized (unsafe) variants\n */\nfunction allocBufferLarge(size: number, zeroFill: boolean): Buffer {\n  // For large sizes, allocate smaller chunks and combine them\n  const numChunks = Math.ceil(size / MAX_SAFE_BUFFER_LENGTH);\n  const chunks: Buffer[] = [];\n\n  // Allocate individual chunks (each <= MAX_SAFE_BUFFER_LENGTH)\n  for (let i = 0; i < numChunks; i++) {\n    const chunkSize = Math.min(MAX_SAFE_BUFFER_LENGTH, size - i * MAX_SAFE_BUFFER_LENGTH);\n    chunks.push(createChunk(chunkSize, zeroFill));\n  }\n\n  // Combine chunks iteratively using pairwise combination\n  return combineBuffersPairwise(chunks);\n}\n\n/**\n * Allocate a zero-filled buffer (safe) - handles very large allocations\n * - Uses Buffer.alloc() on Node 4.5+\n * - Falls back to new Buffer() + fill on Node 0.8-4.4\n * - For sizes > MAX_SAFE_BUFFER_LENGTH, allocates in chunks and copies\n */\nexport function allocBuffer(size: number): Buffer {\n  if (size === 0) {\n    return new Buffer(0);\n  }\n\n  // Use native allocation for sizes within safe limits\n  if (canAllocateBufferSize(size)) {\n    if (hasBufferAlloc) {\n      return Buffer.alloc(size);\n    }\n    // Legacy fallback: new Buffer() is uninitialized, must zero-fill\n    const buf = new Buffer(size);\n    buf.fill(0);\n    return buf;\n  }\n\n  // For large sizes, allocate in chunks with zero-filling\n  return allocBufferLarge(size, true);\n}\n\n/**\n * Allocate a buffer without initialization (unsafe but faster)\n * - Uses Buffer.allocUnsafe() on Node 4.5+\n * - Falls back to new Buffer() on Node 0.8-4.4\n * - For sizes > MAX_SAFE_BUFFER_LENGTH, allocates in chunks without zeroing\n *\n * WARNING: Buffer contents are uninitialized and may contain sensitive data.\n * Only use when you will immediately overwrite all bytes.\n */\nexport function allocBufferUnsafe(size: number): Buffer {\n  if (size === 0) {\n    return new Buffer(0);\n  }\n\n  // Use native allocation for sizes within safe limits\n  if (canAllocateBufferSize(size)) {\n    if (hasBufferAllocUnsafe) {\n      return Buffer.allocUnsafe(size);\n    }\n    return new Buffer(size);\n  }\n\n  // For large sizes, allocate in chunks without zero-filling\n  return allocBufferLarge(size, false);\n}\n\n/**\n * Create a buffer from string, array, or existing buffer\n * - Uses Buffer.from() on Node 4.5+\n * - Falls back to new Buffer() on Node 0.8-4.4\n * - Handles Uint8Array conversion for Node 0.8 (crypto output compatibility)\n */\nexport function bufferFrom(data: string | number[] | Buffer | Uint8Array, encoding?: BufferEncoding): Buffer {\n  if (hasBufferFrom) {\n    if (typeof data === 'string') {\n      return Buffer.from(data, encoding);\n    }\n    return Buffer.from(data as number[] | Buffer);\n  }\n  // Node 0.8 compatibility - deprecated Buffer constructor\n  // For Uint8Array, convert to array first (needed for crypto output in Node 0.8)\n  if (data instanceof Uint8Array && !(data instanceof Buffer)) {\n    const arr: number[] = [];\n    for (let i = 0; i < data.length; i++) {\n      arr.push(data[i]);\n    }\n    return new Buffer(arr);\n  }\n  return new Buffer(data as string & number[], encoding);\n}\n\n/**\n * Compare two buffers or buffer regions\n * - Uses Buffer.compare() on Node 5.10+ (with offset support)\n * - Falls back to manual comparison on Node 0.8-5.9\n */\nexport function bufferCompare(source: Buffer, target: Buffer, targetStart?: number, targetEnd?: number, sourceStart?: number, sourceEnd?: number): number {\n  sourceStart = sourceStart || 0;\n  sourceEnd = sourceEnd || source.length;\n  targetStart = targetStart || 0;\n  targetEnd = targetEnd || target.length;\n\n  // Check if native compare with offset support exists (Node 5.10+)\n  if (source.compare && source.compare.length >= 5) {\n    return source.compare(target, targetStart, targetEnd, sourceStart, sourceEnd);\n  }\n\n  // Manual comparison for older Node versions\n  const sourceLen = sourceEnd - sourceStart;\n  const targetLen = targetEnd - targetStart;\n  const len = Math.min(sourceLen, targetLen);\n\n  for (let i = 0; i < len; i++) {\n    const s = source[sourceStart + i];\n    const t = target[targetStart + i];\n    if (s !== t) return s < t ? -1 : 1;\n  }\n\n  return sourceLen - targetLen;\n}\n\n/**\n * Check if buffer region equals byte array\n * Useful for magic number detection without Buffer.from()\n */\nexport function bufferEquals(buf: Buffer, offset: number, expected: number[]): boolean {\n  if (offset + expected.length > buf.length) return false;\n  for (let i = 0; i < expected.length; i++) {\n    if (buf[offset + i] !== expected[i]) return false;\n  }\n  return true;\n}\n\n/**\n * Copy buffer region to new buffer\n * Works on all Node versions\n */\nexport function bufferSliceCopy(buf: Buffer, start: number, end: number): Buffer {\n  const result = allocBuffer(end - start);\n  buf.copy(result, 0, start, end);\n  return result;\n}\n\n/**\n * Read 64-bit unsigned integer (little-endian)\n * Uses two 32-bit reads since BigInt not available until Node 10.4\n *\n * WARNING: Only accurate for values < Number.MAX_SAFE_INTEGER (2^53 - 1)\n * This covers files up to ~9 PB which is practical for all real use cases.\n */\nexport function readUInt64LE(buf: Buffer, offset: number): number {\n  const low = buf.readUInt32LE(offset);\n  const high = buf.readUInt32LE(offset + 4);\n  return high * 0x100000000 + low;\n}\n\n/**\n * Write 64-bit unsigned integer (little-endian)\n * Same precision limitation as readUInt64LE\n */\nexport function writeUInt64LE(buf: Buffer, value: number, offset: number): void {\n  const low = value >>> 0;\n  const high = (value / 0x100000000) >>> 0;\n  buf.writeUInt32LE(low, offset);\n  buf.writeUInt32LE(high, offset + 4);\n}\n\n/**\n * Concatenate buffers - compatible with Node 0.8+\n * Handles crypto output which may not be proper Buffer instances in old Node.\n * Also handles very large concatenations that would exceed buffer limits.\n *\n * NOTE: This function is primarily needed for AES decryption compatibility\n * in Node 0.8 where crypto output may not be proper Buffer instances.\n * Libraries not using crypto can use native Buffer.concat() directly.\n */\nexport function bufferConcat(list: (Buffer | Uint8Array)[], totalLength?: number): Buffer {\n  // Calculate actual total length first\n  let actualLength = 0;\n  for (let i = 0; i < list.length; i++) {\n    actualLength += list[i].length;\n  }\n\n  // Use specified totalLength or actual length\n  const targetLength = totalLength !== undefined ? totalLength : actualLength;\n\n  // Handle empty list\n  if (list.length === 0) {\n    return new Buffer(0);\n  }\n\n  // Handle very large concatenations that would exceed buffer limits\n  // Use native Buffer.concat for smaller sizes (faster)\n  if (targetLength <= MAX_SAFE_BUFFER_LENGTH) {\n    // Check if all items are proper Buffers AND no truncation needed\n    // (Node 0.8's Buffer.concat doesn't handle truncation well)\n    let allBuffers = true;\n    for (let j = 0; j < list.length; j++) {\n      if (!(list[j] instanceof Buffer)) {\n        allBuffers = false;\n        break;\n      }\n    }\n    if (allBuffers && targetLength >= actualLength) {\n      return Buffer.concat(list as Buffer[], targetLength);\n    }\n  }\n\n  // For large or complex concatenations, use chunked approach\n  // This will use allocBuffer which handles large sizes via chunking\n  const result = allocBuffer(targetLength);\n  let offset = 0;\n\n  for (let k = 0; k < list.length && offset < targetLength; k++) {\n    const buf = list[k];\n    const toCopy = Math.min(buf.length, targetLength - offset);\n\n    if (buf instanceof Buffer) {\n      buf.copy(result, offset, 0, toCopy);\n    } else {\n      // Uint8Array - need to copy byte by byte\n      for (let l = 0; l < toCopy; l++) {\n        result[offset + l] = buf[l];\n      }\n    }\n    offset += toCopy;\n  }\n\n  return result;\n}\n\n/**\n * Node 0.8 compatible isNaN (Number.isNaN didn't exist until ES2015)\n * Uses self-comparison: NaN is the only value not equal to itself\n */\n// biome-ignore lint/suspicious/noShadowRestrictedNames: Legacy compatibility\nexport function isNaN(value: number): boolean {\n  // biome-ignore lint/suspicious/noSelfCompare: NaN check pattern\n  return value !== value;\n}\n\n/**\n * Decompress raw DEFLATE data (no zlib/gzip header)\n * - Uses native zlib.inflateRawSync() on Node 0.11.12+\n * - Falls back to pako for Node 0.8-0.10\n *\n * Version history:\n * - Node 0.8-0.10: No zlib sync methods, use pako\n * - Node 0.11.12+: zlib.inflateRawSync available\n */\n// Feature detection for native zlib sync methods (Node 0.11.12+)\nlet zlib: typeof import('zlib') | null = null;\ntry {\n  zlib = _require('zlib');\n} catch (_e) {\n  // zlib not available (shouldn't happen in Node.js)\n}\nconst hasNativeInflateRaw = zlib !== null && typeof zlib.inflateRawSync === 'function';\n\nexport function inflateRaw(input: Buffer): Buffer {\n  if (hasNativeInflateRaw && zlib) {\n    return zlib.inflateRawSync(input);\n  }\n  // Fallback to pako for Node 0.8-0.10\n  const pako = _require('pako');\n  return bufferFrom(pako.inflateRaw(input));\n}\n\n/**\n * Create a streaming raw DEFLATE decompressor (Transform stream)\n * Decompresses data incrementally to avoid holding full output in memory.\n *\n * - Uses native zlib.createInflateRaw() on Node 0.11.12+\n * - Falls back to pako-based Transform for Node 0.8-0.10\n *\n * @returns A Transform stream that decompresses raw DEFLATE data\n */\n// Check for native streaming inflate (Node 0.11.12+ has createInflateRaw)\n// biome-ignore lint/suspicious/noExplicitAny: createInflateRaw not in older TS definitions\nconst hasNativeStreamingInflate = zlib !== null && typeof (zlib as any).createInflateRaw === 'function';\n\nexport function createInflateRawStream(): NodeJS.ReadWriteStream {\n  if (hasNativeStreamingInflate && zlib) {\n    // Use native zlib streaming Transform\n    // biome-ignore lint/suspicious/noExplicitAny: createInflateRaw not in older TS definitions\n    return (zlib as any).createInflateRaw();\n  }\n\n  // Fallback to pako-based Transform for Node 0.8-0.10\n  // Use readable-stream for Node 0.8 compatibility\n  const Transform = _require('readable-stream').Transform;\n  const pako = _require('pako');\n\n  const inflate = new pako.Inflate({ raw: true, chunkSize: 16384 });\n  const transform = new Transform();\n  const pendingChunks: Buffer[] = [];\n  let ended = false;\n\n  // Pako calls onData synchronously during push()\n  inflate.onData = (chunk: Uint8Array) => {\n    pendingChunks.push(bufferFrom(chunk));\n  };\n\n  inflate.onEnd = (status: number) => {\n    ended = true;\n    if (status !== 0) {\n      transform.emit('error', new Error(`Inflate error: ${inflate.msg || 'unknown'}`));\n    }\n  };\n\n  transform._transform = function (chunk: Buffer, _encoding: string, callback: (err?: Error) => void) {\n    try {\n      inflate.push(chunk, false);\n      // Push any pending decompressed chunks\n      while (pendingChunks.length > 0) {\n        this.push(pendingChunks.shift());\n      }\n      callback();\n    } catch (err) {\n      callback(err as Error);\n    }\n  };\n\n  transform._flush = function (callback: (err?: Error) => void) {\n    try {\n      inflate.push(new Uint8Array(0), true); // Signal end\n      // Push any remaining decompressed chunks\n      while (pendingChunks.length > 0) {\n        this.push(pendingChunks.shift());\n      }\n      if (ended && inflate.err) {\n        callback(new Error(`Inflate error: ${inflate.msg || 'unknown'}`));\n      } else {\n        callback();\n      }\n    } catch (err) {\n      callback(err as Error);\n    }\n  };\n\n  return transform;\n}\n\n/**\n * Object.assign wrapper for Node.js 0.8+\n * - Uses native Object.assign on Node 4.0+\n * - Falls back to manual property copy on Node 0.8-3.x\n */\nconst hasObjectAssign = typeof Object.assign === 'function';\nconst _hasOwnProperty = Object.prototype.hasOwnProperty;\n\nexport function objectAssign<T, U>(target: T, source: U): T & U {\n  if (hasObjectAssign) return Object.assign(target, source);\n\n  for (const key in source) {\n    if (_hasOwnProperty.call(source, key)) (target as Record<string, unknown>)[key] = source[key];\n  }\n  return target as T & U;\n}\n\n/**\n * Stream compatibility - Transform class\n * - Uses native stream.Transform on Node 0.10+\n * - Falls back to readable-stream for Node 0.8\n */\nconst major = +process.versions.node.split('.')[0];\nexport const Readable: typeof import('stream').Readable = major > 0 ? _require('stream').Readable : _require('readable-stream').Readable;\nexport const Writable: typeof import('stream').Writable = major > 0 ? _require('stream').Writable : _require('readable-stream').Writable;\nexport const Transform: typeof import('stream').Transform = major > 0 ? _require('stream').Transform : _require('readable-stream').Transform;\nexport const PassThrough: typeof import('stream').PassThrough = major > 0 ? _require('stream').PassThrough : _require('readable-stream').PassThrough;\n"],"names":["Module","_require","require","createRequire","url","hasBufferAlloc","Buffer","alloc","hasBufferAllocUnsafe","allocUnsafe","hasBufferFrom","from","Uint8Array","MAX_SAFE_BUFFER_LENGTH","DETECTED_MAX_LENGTH","getMaxBufferLength","maxLen","kMaxLength","undefined","canAllocateBufferSize","size","createChunk","zeroFill","buf","fill","combineBuffersPairwise","buffers","maxLength","totalSize","i","length","Error","Math","floor","result","offset","copy","allocBufferLarge","numChunks","ceil","chunks","chunkSize","min","push","allocBuffer","allocBufferUnsafe","bufferFrom","data","encoding","arr","bufferCompare","source","target","targetStart","targetEnd","sourceStart","sourceEnd","compare","sourceLen","targetLen","len","s","t","bufferEquals","expected","bufferSliceCopy","start","end","readUInt64LE","low","readUInt32LE","high","writeUInt64LE","value","writeUInt32LE","bufferConcat","list","totalLength","actualLength","targetLength","allBuffers","j","concat","k","toCopy","l","isNaN","zlib","_e","hasNativeInflateRaw","inflateRawSync","inflateRaw","input","pako","hasNativeStreamingInflate","createInflateRaw","createInflateRawStream","Transform","inflate","Inflate","raw","transform","pendingChunks","ended","onData","chunk","onEnd","status","emit","msg","_transform","_encoding","callback","shift","err","_flush","hasObjectAssign","Object","assign","_hasOwnProperty","prototype","hasOwnProperty","objectAssign","key","call","major","process","versions","node","split","Readable","Writable","PassThrough"],"mappings":"AAAA;;;;;;;;;;;;CAYC,GAED,qDAAqD;AACrD,OAAOA,YAAY,SAAS;AAE5B,MAAMC,WAAW,OAAOC,YAAY,cAAcF,OAAOG,aAAa,CAAC,YAAYC,GAAG,IAAIF;AAE1F,+CAA+C;AAC/C,MAAMG,iBAAiB,OAAOC,OAAOC,KAAK,KAAK;AAC/C,MAAMC,uBAAuB,OAAOF,OAAOG,WAAW,KAAK;AAC3D,MAAMC,gBAAgB,OAAOJ,OAAOK,IAAI,KAAK,cAAcL,OAAOK,IAAI,KAAKC,WAAWD,IAAI;AAE1F,6DAA6D;AAC7D,gFAAgF;AAChF,qCAAqC;AACrC,2BAA2B;AAC3B,oDAAoD;AACpD,0DAA0D;AAC1D,yFAAyF;AACzF,OAAO,MAAME,yBAAyB,MAAM,OAAO,KAAK,CAAC,QAAQ;AAEjE,4DAA4D;AAC5D,gEAAgE;AAChE,IAAIC,sBAAqC;AAEzC,SAASC;IACP,IAAID,wBAAwB,MAAM,OAAOA;IAEzC,iCAAiC;IACjC,yEAAyE;IACzE,gDAAgD;IAChD,MAAME,SAAS,AAACV,OAAmCW,UAAU;IAC7D,IAAID,WAAWE,WAAW;QACxBJ,sBAAsBE;IACxB,OAAO;QACL,yCAAyC;QACzCF,sBAAsB,YAAY,UAAU;IAC9C;IAEA,OAAOA;AACT;AAEA;;;CAGC,GACD,OAAO,SAASK,sBAAsBC,IAAY;IAChD,OAAOA,QAAQ,KAAKA,QAAQP;AAC9B;AAEA;;CAEC,GACD,SAASQ,YAAYD,IAAY,EAAEE,QAAiB;IAClD,IAAIjB,gBAAgB;QAClB,OAAOC,OAAOC,KAAK,CAACa;IACtB;IACA,MAAMG,MAAM,IAAIjB,OAAOc;IACvB,IAAIE,UAAUC,IAAIC,IAAI,CAAC;IACvB,OAAOD;AACT;AAEA;;;;CAIC,GACD,SAASE,uBAAuBC,OAAiB;IAC/C,MAAMC,YAAYZ;IAElB,uBAAuB;IACvB,IAAIa,YAAY;IAChB,IAAK,IAAIC,IAAI,GAAGA,IAAIH,QAAQI,MAAM,EAAED,IAAK;QACvCD,aAAaF,OAAO,CAACG,EAAE,CAACC,MAAM;IAChC;IAEA,gEAAgE;IAChE,kDAAkD;IAClD,IAAIF,YAAYD,WAAW;QACzB,MAAM,IAAII,MAAM,CAAC,oCAAoC,EAAEH,UAAU,sCAAsC,EAAED,UAAU,iDAAiD,EAAEK,KAAKC,KAAK,CAACN,YAAY,OAAO,MAAM,4CAA4C,CAAC;IACzP;IAEA,4DAA4D;IAC5D,MAAMO,SAASb,YAAYO,WAAW;IACtC,IAAIO,SAAS;IACb,IAAK,IAAIN,IAAI,GAAGA,IAAIH,QAAQI,MAAM,EAAED,IAAK;QACvCH,OAAO,CAACG,EAAE,CAACO,IAAI,CAACF,QAAQC;QACxBA,UAAUT,OAAO,CAACG,EAAE,CAACC,MAAM;IAC7B;IACA,OAAOI;AACT;AAEA;;;CAGC,GACD,SAASG,iBAAiBjB,IAAY,EAAEE,QAAiB;IACvD,4DAA4D;IAC5D,MAAMgB,YAAYN,KAAKO,IAAI,CAACnB,OAAOP;IACnC,MAAM2B,SAAmB,EAAE;IAE3B,8DAA8D;IAC9D,IAAK,IAAIX,IAAI,GAAGA,IAAIS,WAAWT,IAAK;QAClC,MAAMY,YAAYT,KAAKU,GAAG,CAAC7B,wBAAwBO,OAAOS,IAAIhB;QAC9D2B,OAAOG,IAAI,CAACtB,YAAYoB,WAAWnB;IACrC;IAEA,wDAAwD;IACxD,OAAOG,uBAAuBe;AAChC;AAEA;;;;;CAKC,GACD,OAAO,SAASI,YAAYxB,IAAY;IACtC,IAAIA,SAAS,GAAG;QACd,OAAO,IAAId,OAAO;IACpB;IAEA,qDAAqD;IACrD,IAAIa,sBAAsBC,OAAO;QAC/B,IAAIf,gBAAgB;YAClB,OAAOC,OAAOC,KAAK,CAACa;QACtB;QACA,iEAAiE;QACjE,MAAMG,MAAM,IAAIjB,OAAOc;QACvBG,IAAIC,IAAI,CAAC;QACT,OAAOD;IACT;IAEA,wDAAwD;IACxD,OAAOc,iBAAiBjB,MAAM;AAChC;AAEA;;;;;;;;CAQC,GACD,OAAO,SAASyB,kBAAkBzB,IAAY;IAC5C,IAAIA,SAAS,GAAG;QACd,OAAO,IAAId,OAAO;IACpB;IAEA,qDAAqD;IACrD,IAAIa,sBAAsBC,OAAO;QAC/B,IAAIZ,sBAAsB;YACxB,OAAOF,OAAOG,WAAW,CAACW;QAC5B;QACA,OAAO,IAAId,OAAOc;IACpB;IAEA,2DAA2D;IAC3D,OAAOiB,iBAAiBjB,MAAM;AAChC;AAEA;;;;;CAKC,GACD,OAAO,SAAS0B,WAAWC,IAA6C,EAAEC,QAAyB;IACjG,IAAItC,eAAe;QACjB,IAAI,OAAOqC,SAAS,UAAU;YAC5B,OAAOzC,OAAOK,IAAI,CAACoC,MAAMC;QAC3B;QACA,OAAO1C,OAAOK,IAAI,CAACoC;IACrB;IACA,yDAAyD;IACzD,gFAAgF;IAChF,IAAIA,gBAAgBnC,cAAc,CAAEmC,CAAAA,gBAAgBzC,MAAK,GAAI;QAC3D,MAAM2C,MAAgB,EAAE;QACxB,IAAK,IAAIpB,IAAI,GAAGA,IAAIkB,KAAKjB,MAAM,EAAED,IAAK;YACpCoB,IAAIN,IAAI,CAACI,IAAI,CAAClB,EAAE;QAClB;QACA,OAAO,IAAIvB,OAAO2C;IACpB;IACA,OAAO,IAAI3C,OAAOyC,MAA2BC;AAC/C;AAEA;;;;CAIC,GACD,OAAO,SAASE,cAAcC,MAAc,EAAEC,MAAc,EAAEC,WAAoB,EAAEC,SAAkB,EAAEC,WAAoB,EAAEC,SAAkB;IAC9ID,cAAcA,eAAe;IAC7BC,YAAYA,aAAaL,OAAOrB,MAAM;IACtCuB,cAAcA,eAAe;IAC7BC,YAAYA,aAAaF,OAAOtB,MAAM;IAEtC,kEAAkE;IAClE,IAAIqB,OAAOM,OAAO,IAAIN,OAAOM,OAAO,CAAC3B,MAAM,IAAI,GAAG;QAChD,OAAOqB,OAAOM,OAAO,CAACL,QAAQC,aAAaC,WAAWC,aAAaC;IACrE;IAEA,4CAA4C;IAC5C,MAAME,YAAYF,YAAYD;IAC9B,MAAMI,YAAYL,YAAYD;IAC9B,MAAMO,MAAM5B,KAAKU,GAAG,CAACgB,WAAWC;IAEhC,IAAK,IAAI9B,IAAI,GAAGA,IAAI+B,KAAK/B,IAAK;QAC5B,MAAMgC,IAAIV,MAAM,CAACI,cAAc1B,EAAE;QACjC,MAAMiC,IAAIV,MAAM,CAACC,cAAcxB,EAAE;QACjC,IAAIgC,MAAMC,GAAG,OAAOD,IAAIC,IAAI,CAAC,IAAI;IACnC;IAEA,OAAOJ,YAAYC;AACrB;AAEA;;;CAGC,GACD,OAAO,SAASI,aAAaxC,GAAW,EAAEY,MAAc,EAAE6B,QAAkB;IAC1E,IAAI7B,SAAS6B,SAASlC,MAAM,GAAGP,IAAIO,MAAM,EAAE,OAAO;IAClD,IAAK,IAAID,IAAI,GAAGA,IAAImC,SAASlC,MAAM,EAAED,IAAK;QACxC,IAAIN,GAAG,CAACY,SAASN,EAAE,KAAKmC,QAAQ,CAACnC,EAAE,EAAE,OAAO;IAC9C;IACA,OAAO;AACT;AAEA;;;CAGC,GACD,OAAO,SAASoC,gBAAgB1C,GAAW,EAAE2C,KAAa,EAAEC,GAAW;IACrE,MAAMjC,SAASU,YAAYuB,MAAMD;IACjC3C,IAAIa,IAAI,CAACF,QAAQ,GAAGgC,OAAOC;IAC3B,OAAOjC;AACT;AAEA;;;;;;CAMC,GACD,OAAO,SAASkC,aAAa7C,GAAW,EAAEY,MAAc;IACtD,MAAMkC,MAAM9C,IAAI+C,YAAY,CAACnC;IAC7B,MAAMoC,OAAOhD,IAAI+C,YAAY,CAACnC,SAAS;IACvC,OAAOoC,OAAO,cAAcF;AAC9B;AAEA;;;CAGC,GACD,OAAO,SAASG,cAAcjD,GAAW,EAAEkD,KAAa,EAAEtC,MAAc;IACtE,MAAMkC,MAAMI,UAAU;IACtB,MAAMF,OAAO,AAACE,QAAQ,gBAAiB;IACvClD,IAAImD,aAAa,CAACL,KAAKlC;IACvBZ,IAAImD,aAAa,CAACH,MAAMpC,SAAS;AACnC;AAEA;;;;;;;;CAQC,GACD,OAAO,SAASwC,aAAaC,IAA6B,EAAEC,WAAoB;IAC9E,sCAAsC;IACtC,IAAIC,eAAe;IACnB,IAAK,IAAIjD,IAAI,GAAGA,IAAI+C,KAAK9C,MAAM,EAAED,IAAK;QACpCiD,gBAAgBF,IAAI,CAAC/C,EAAE,CAACC,MAAM;IAChC;IAEA,6CAA6C;IAC7C,MAAMiD,eAAeF,gBAAgB3D,YAAY2D,cAAcC;IAE/D,oBAAoB;IACpB,IAAIF,KAAK9C,MAAM,KAAK,GAAG;QACrB,OAAO,IAAIxB,OAAO;IACpB;IAEA,mEAAmE;IACnE,sDAAsD;IACtD,IAAIyE,gBAAgBlE,wBAAwB;QAC1C,iEAAiE;QACjE,4DAA4D;QAC5D,IAAImE,aAAa;QACjB,IAAK,IAAIC,IAAI,GAAGA,IAAIL,KAAK9C,MAAM,EAAEmD,IAAK;YACpC,IAAI,CAAEL,CAAAA,IAAI,CAACK,EAAE,YAAY3E,MAAK,GAAI;gBAChC0E,aAAa;gBACb;YACF;QACF;QACA,IAAIA,cAAcD,gBAAgBD,cAAc;YAC9C,OAAOxE,OAAO4E,MAAM,CAACN,MAAkBG;QACzC;IACF;IAEA,4DAA4D;IAC5D,mEAAmE;IACnE,MAAM7C,SAASU,YAAYmC;IAC3B,IAAI5C,SAAS;IAEb,IAAK,IAAIgD,IAAI,GAAGA,IAAIP,KAAK9C,MAAM,IAAIK,SAAS4C,cAAcI,IAAK;QAC7D,MAAM5D,MAAMqD,IAAI,CAACO,EAAE;QACnB,MAAMC,SAASpD,KAAKU,GAAG,CAACnB,IAAIO,MAAM,EAAEiD,eAAe5C;QAEnD,IAAIZ,eAAejB,QAAQ;YACzBiB,IAAIa,IAAI,CAACF,QAAQC,QAAQ,GAAGiD;QAC9B,OAAO;YACL,yCAAyC;YACzC,IAAK,IAAIC,IAAI,GAAGA,IAAID,QAAQC,IAAK;gBAC/BnD,MAAM,CAACC,SAASkD,EAAE,GAAG9D,GAAG,CAAC8D,EAAE;YAC7B;QACF;QACAlD,UAAUiD;IACZ;IAEA,OAAOlD;AACT;AAEA;;;CAGC,GACD,6EAA6E;AAC7E,OAAO,SAASoD,MAAMb,KAAa;IACjC,gEAAgE;IAChE,OAAOA,UAAUA;AACnB;AAEA;;;;;;;;CAQC,GACD,iEAAiE;AACjE,IAAIc,OAAqC;AACzC,IAAI;IACFA,OAAOtF,SAAS;AAClB,EAAE,OAAOuF,IAAI;AACX,mDAAmD;AACrD;AACA,MAAMC,sBAAsBF,SAAS,QAAQ,OAAOA,KAAKG,cAAc,KAAK;AAE5E,OAAO,SAASC,WAAWC,KAAa;IACtC,IAAIH,uBAAuBF,MAAM;QAC/B,OAAOA,KAAKG,cAAc,CAACE;IAC7B;IACA,qCAAqC;IACrC,MAAMC,OAAO5F,SAAS;IACtB,OAAO6C,WAAW+C,KAAKF,UAAU,CAACC;AACpC;AAEA;;;;;;;;CAQC,GACD,0EAA0E;AAC1E,2FAA2F;AAC3F,MAAME,4BAA4BP,SAAS,QAAQ,OAAO,AAACA,KAAaQ,gBAAgB,KAAK;AAE7F,OAAO,SAASC;IACd,IAAIF,6BAA6BP,MAAM;QACrC,sCAAsC;QACtC,2FAA2F;QAC3F,OAAO,AAACA,KAAaQ,gBAAgB;IACvC;IAEA,qDAAqD;IACrD,iDAAiD;IACjD,MAAME,YAAYhG,SAAS,mBAAmBgG,SAAS;IACvD,MAAMJ,OAAO5F,SAAS;IAEtB,MAAMiG,UAAU,IAAIL,KAAKM,OAAO,CAAC;QAAEC,KAAK;QAAM3D,WAAW;IAAM;IAC/D,MAAM4D,YAAY,IAAIJ;IACtB,MAAMK,gBAA0B,EAAE;IAClC,IAAIC,QAAQ;IAEZ,gDAAgD;IAChDL,QAAQM,MAAM,GAAG,CAACC;QAChBH,cAAc3D,IAAI,CAACG,WAAW2D;IAChC;IAEAP,QAAQQ,KAAK,GAAG,CAACC;QACfJ,QAAQ;QACR,IAAII,WAAW,GAAG;YAChBN,UAAUO,IAAI,CAAC,SAAS,IAAI7E,MAAM,CAAC,eAAe,EAAEmE,QAAQW,GAAG,IAAI,WAAW;QAChF;IACF;IAEAR,UAAUS,UAAU,GAAG,SAAUL,KAAa,EAAEM,SAAiB,EAAEC,QAA+B;QAChG,IAAI;YACFd,QAAQvD,IAAI,CAAC8D,OAAO;YACpB,uCAAuC;YACvC,MAAOH,cAAcxE,MAAM,GAAG,EAAG;gBAC/B,IAAI,CAACa,IAAI,CAAC2D,cAAcW,KAAK;YAC/B;YACAD;QACF,EAAE,OAAOE,KAAK;YACZF,SAASE;QACX;IACF;IAEAb,UAAUc,MAAM,GAAG,SAAUH,QAA+B;QAC1D,IAAI;YACFd,QAAQvD,IAAI,CAAC,IAAI/B,WAAW,IAAI,OAAO,aAAa;YACpD,yCAAyC;YACzC,MAAO0F,cAAcxE,MAAM,GAAG,EAAG;gBAC/B,IAAI,CAACa,IAAI,CAAC2D,cAAcW,KAAK;YAC/B;YACA,IAAIV,SAASL,QAAQgB,GAAG,EAAE;gBACxBF,SAAS,IAAIjF,MAAM,CAAC,eAAe,EAAEmE,QAAQW,GAAG,IAAI,WAAW;YACjE,OAAO;gBACLG;YACF;QACF,EAAE,OAAOE,KAAK;YACZF,SAASE;QACX;IACF;IAEA,OAAOb;AACT;AAEA;;;;CAIC,GACD,MAAMe,kBAAkB,OAAOC,OAAOC,MAAM,KAAK;AACjD,MAAMC,kBAAkBF,OAAOG,SAAS,CAACC,cAAc;AAEvD,OAAO,SAASC,aAAmBtE,MAAS,EAAED,MAAS;IACrD,IAAIiE,iBAAiB,OAAOC,OAAOC,MAAM,CAAClE,QAAQD;IAElD,IAAK,MAAMwE,OAAOxE,OAAQ;QACxB,IAAIoE,gBAAgBK,IAAI,CAACzE,QAAQwE,MAAM,AAACvE,MAAkC,CAACuE,IAAI,GAAGxE,MAAM,CAACwE,IAAI;IAC/F;IACA,OAAOvE;AACT;AAEA;;;;CAIC,GACD,MAAMyE,QAAQ,CAACC,QAAQC,QAAQ,CAACC,IAAI,CAACC,KAAK,CAAC,IAAI,CAAC,EAAE;AAClD,OAAO,MAAMC,WAA6CL,QAAQ,IAAI5H,SAAS,UAAUiI,QAAQ,GAAGjI,SAAS,mBAAmBiI,QAAQ,CAAC;AACzI,OAAO,MAAMC,WAA6CN,QAAQ,IAAI5H,SAAS,UAAUkI,QAAQ,GAAGlI,SAAS,mBAAmBkI,QAAQ,CAAC;AACzI,OAAO,MAAMlC,YAA+C4B,QAAQ,IAAI5H,SAAS,UAAUgG,SAAS,GAAGhG,SAAS,mBAAmBgG,SAAS,CAAC;AAC7I,OAAO,MAAMmC,cAAmDP,QAAQ,IAAI5H,SAAS,UAAUmI,WAAW,GAAGnI,SAAS,mBAAmBmI,WAAW,CAAC"}

package/dist/esm/shared/index.d.ts

@@ -17,7 +17,7 @@ export { BufferList };
  * or chunked streaming data (BufferList).
  */
 export type BufferLike = Buffer | BufferList;
-export { allocBuffer, allocBufferUnsafe, bufferCompare, bufferConcat, bufferEquals, bufferFrom, bufferSliceCopy, createInflateRawStream, inflateRaw, isNaN, objectAssign, PassThrough, Readable, readUInt64LE, Transform, Writable, writeUInt64LE, } from './compat.js';
+export { allocBuffer, allocBufferUnsafe, bufferCompare, bufferConcat, bufferEquals, bufferFrom, bufferSliceCopy, canAllocateBufferSize, createInflateRawStream, inflateRaw, isNaN, MAX_SAFE_BUFFER_LENGTH, objectAssign, PassThrough, Readable, readUInt64LE, Transform, Writable, writeUInt64LE, } from './compat.js';
 export { crc32, crc32Region, verifyCrc32, verifyCrc32Region } from './crc32.js';
 export { default as EntryStream } from './EntryStream.js';
 export { type CleanupFn, default as Lock } from './Lock.js';

package/dist/esm/shared/index.js

@@ -10,7 +10,7 @@
  * All utilities support Node.js 0.8+
  */ import BufferList from './BufferList.js';
 export { BufferList };
-export { allocBuffer, allocBufferUnsafe, bufferCompare, bufferConcat, bufferEquals, bufferFrom, bufferSliceCopy, createInflateRawStream, inflateRaw, isNaN, objectAssign, PassThrough, Readable, readUInt64LE, Transform, Writable, writeUInt64LE } from './compat.js';
+export { allocBuffer, allocBufferUnsafe, bufferCompare, bufferConcat, bufferEquals, bufferFrom, bufferSliceCopy, canAllocateBufferSize, createInflateRawStream, inflateRaw, isNaN, MAX_SAFE_BUFFER_LENGTH, objectAssign, PassThrough, Readable, readUInt64LE, Transform, Writable, writeUInt64LE } from './compat.js';
 export { crc32, crc32Region, verifyCrc32, verifyCrc32Region } from './crc32.js';
 export { default as EntryStream } from './EntryStream.js';
 export { default as Lock } from './Lock.js';

package/dist/esm/shared/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["/Users/kevin/Dev/OpenSource/iterators/extract-base-iterator/src/shared/index.ts"],"sourcesContent":["/**\n * Shared utilities for iterator libraries\n *\n * These utilities are designed to be used by:\n * - zip-iterator\n * - 7z-iterator\n * - tar-iterator\n * - Any other archive iterator library\n *\n * All utilities support Node.js 0.8+\n */\n\nimport BufferList from './BufferList.ts';\n\nexport { BufferList };\n\n/**\n * Type alias for Buffer or BufferList - both can be read byte-by-byte.\n * Use this when an API should accept either contiguous data (Buffer)\n * or chunked streaming data (BufferList).\n */\nexport type BufferLike = Buffer | BufferList;\nexport {\n  allocBuffer,\n  allocBufferUnsafe,\n  bufferCompare,\n  bufferConcat,\n  bufferEquals,\n  bufferFrom,\n  bufferSliceCopy,\n  createInflateRawStream,\n  inflateRaw,\n  isNaN,\n  objectAssign,\n  PassThrough,\n  Readable,\n  readUInt64LE,\n  Transform,\n  Writable,\n  writeUInt64LE,\n} from './compat.ts';\nexport { crc32, crc32Region, verifyCrc32, verifyCrc32Region } from './crc32.ts';\nexport { default as EntryStream } from './EntryStream.ts';\nexport { type CleanupFn, default as Lock } from './Lock.ts';\nexport { default as normalizePath } from './normalizePath.ts';\nexport { default as streamToString, type StreamToStringCallback } from './streamToString.ts';\nexport { default as stripPath } from './stripPath.ts';\n"],"names":["BufferList","allocBuffer","allocBufferUnsafe","bufferCompare","bufferConcat","bufferEquals","bufferFrom","bufferSliceCopy","createInflateRawStream","inflateRaw","isNaN","objectAssign","PassThrough","Readable","readUInt64LE","Transform","Writable","writeUInt64LE","crc32","crc32Region","verifyCrc32","verifyCrc32Region","default","EntryStream","Lock","normalizePath","streamToString","stripPath"],"mappings":"AAAA;;;;;;;;;;CAUC,GAED,OAAOA,gBAAgB,kBAAkB;AAEzC,SAASA,UAAU,GAAG;AAQtB,SACEC,WAAW,EACXC,iBAAiB,EACjBC,aAAa,EACbC,YAAY,EACZC,YAAY,EACZC,UAAU,EACVC,eAAe,EACfC,sBAAsB,EACtBC,UAAU,EACVC,KAAK,EACLC,YAAY,EACZC,WAAW,EACXC,QAAQ,EACRC,YAAY,EACZC,SAAS,EACTC,QAAQ,EACRC,aAAa,QACR,cAAc;AACrB,SAASC,KAAK,EAAEC,WAAW,EAAEC,WAAW,EAAEC,iBAAiB,QAAQ,aAAa;AAChF,SAASC,WAAWC,WAAW,QAAQ,mBAAmB;AAC1D,SAAyBD,WAAWE,IAAI,QAAQ,YAAY;AAC5D,SAASF,WAAWG,aAAa,QAAQ,qBAAqB;AAC9D,SAASH,WAAWI,cAAc,QAAqC,sBAAsB;AAC7F,SAASJ,WAAWK,SAAS,QAAQ,iBAAiB"}
+{"version":3,"sources":["/Users/kevin/Dev/OpenSource/iterators/extract-base-iterator/src/shared/index.ts"],"sourcesContent":["/**\n * Shared utilities for iterator libraries\n *\n * These utilities are designed to be used by:\n * - zip-iterator\n * - 7z-iterator\n * - tar-iterator\n * - Any other archive iterator library\n *\n * All utilities support Node.js 0.8+\n */\n\nimport BufferList from './BufferList.ts';\n\nexport { BufferList };\n\n/**\n * Type alias for Buffer or BufferList - both can be read byte-by-byte.\n * Use this when an API should accept either contiguous data (Buffer)\n * or chunked streaming data (BufferList).\n */\nexport type BufferLike = Buffer | BufferList;\nexport {\n  allocBuffer,\n  allocBufferUnsafe,\n  bufferCompare,\n  bufferConcat,\n  bufferEquals,\n  bufferFrom,\n  bufferSliceCopy,\n  canAllocateBufferSize,\n  createInflateRawStream,\n  inflateRaw,\n  isNaN,\n  MAX_SAFE_BUFFER_LENGTH,\n  objectAssign,\n  PassThrough,\n  Readable,\n  readUInt64LE,\n  Transform,\n  Writable,\n  writeUInt64LE,\n} from './compat.ts';\nexport { crc32, crc32Region, verifyCrc32, verifyCrc32Region } from './crc32.ts';\nexport { default as EntryStream } from './EntryStream.ts';\nexport { type CleanupFn, default as Lock } from './Lock.ts';\nexport { default as normalizePath } from './normalizePath.ts';\nexport { default as streamToString, type StreamToStringCallback } from './streamToString.ts';\nexport { default as stripPath } from './stripPath.ts';\n"],"names":["BufferList","allocBuffer","allocBufferUnsafe","bufferCompare","bufferConcat","bufferEquals","bufferFrom","bufferSliceCopy","canAllocateBufferSize","createInflateRawStream","inflateRaw","isNaN","MAX_SAFE_BUFFER_LENGTH","objectAssign","PassThrough","Readable","readUInt64LE","Transform","Writable","writeUInt64LE","crc32","crc32Region","verifyCrc32","verifyCrc32Region","default","EntryStream","Lock","normalizePath","streamToString","stripPath"],"mappings":"AAAA;;;;;;;;;;CAUC,GAED,OAAOA,gBAAgB,kBAAkB;AAEzC,SAASA,UAAU,GAAG;AAQtB,SACEC,WAAW,EACXC,iBAAiB,EACjBC,aAAa,EACbC,YAAY,EACZC,YAAY,EACZC,UAAU,EACVC,eAAe,EACfC,qBAAqB,EACrBC,sBAAsB,EACtBC,UAAU,EACVC,KAAK,EACLC,sBAAsB,EACtBC,YAAY,EACZC,WAAW,EACXC,QAAQ,EACRC,YAAY,EACZC,SAAS,EACTC,QAAQ,EACRC,aAAa,QACR,cAAc;AACrB,SAASC,KAAK,EAAEC,WAAW,EAAEC,WAAW,EAAEC,iBAAiB,QAAQ,aAAa;AAChF,SAASC,WAAWC,WAAW,QAAQ,mBAAmB;AAC1D,SAAyBD,WAAWE,IAAI,QAAQ,YAAY;AAC5D,SAASF,WAAWG,aAAa,QAAQ,qBAAqB;AAC9D,SAASH,WAAWI,cAAc,QAAqC,sBAAsB;AAC7F,SAASJ,WAAWK,SAAS,QAAQ,iBAAiB"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "extract-base-iterator",
-  "version": "3.3.5",
+  "version": "3.4.0",
   "description": "Base iterator for extract iterators like tar-iterator and zip-iterator",
   "keywords": [
     "extract",