extract-base-iterator 3.4.0 → 3.4.2

package/dist/cjs/DirectoryEntry.js

@@ -59,14 +59,13 @@ var DirectoryEntry = /*#__PURE__*/ function() {
                 queue.defer(_chownts.default.bind(null, fullPath, this, options));
                 queue.defer(_utimests.default.bind(null, fullPath, this, options));
                 queue.await(callback);
-                return;
             } catch (err) {
                 callback(err);
-                return;
             }
+            return;
         }
         return new Promise(function(resolve, reject) {
-            _this.create(dest, options, function(err, done) {
+            return _this.create(dest, options, function(err, done) {
                 return err ? reject(err) : resolve(done);
             });
         });

package/dist/cjs/DirectoryEntry.js.map

@@ -1 +1 @@
-{"version":3,"sources":["/Users/kevin/Dev/OpenSource/iterators/extract-base-iterator/src/DirectoryEntry.ts"],"sourcesContent":["import mkdirp from 'mkdirp-classic';\nimport path from 'path';\nimport Queue from 'queue-cb';\nimport chmod from './fs/chmod.ts';\nimport chown from './fs/chown.ts';\nimport utimes from './fs/utimes.ts';\nimport { objectAssign } from './shared/index.ts';\nimport stripPath from './shared/stripPath.ts';\nimport validateAttributes from './validateAttributes.ts';\nimport waitForAccess from './waitForAccess.ts';\n\nconst MANDATORY_ATTRIBUTES = ['mode', 'mtime', 'path'];\n\nimport type { Mode } from 'fs';\nimport type { DirectoryAttributes, ExtractOptions, NoParamCallback } from './types.ts';\n\nexport default class DirectoryEntry {\n  mode: Mode;\n  mtime: number;\n  path: string;\n  basename: string;\n  type: string;\n\n  constructor(attributes: DirectoryAttributes) {\n    validateAttributes(attributes, MANDATORY_ATTRIBUTES);\n    objectAssign(this, attributes);\n    if (this.type === undefined) this.type = 'directory';\n    if (this.basename === undefined) this.basename = path.basename(this.path);\n  }\n\n  create(dest: string, callback: NoParamCallback): void;\n  create(dest: string, options: ExtractOptions, callback: NoParamCallback): void;\n  create(dest: string, options?: ExtractOptions): Promise<boolean>;\n  create(dest: string, options?: ExtractOptions | NoParamCallback, callback?: NoParamCallback): void | Promise<boolean> {\n    callback = typeof options === 'function' ? options : callback;\n    options = typeof options === 'function' ? {} : ((options || {}) as ExtractOptions);\n\n    if (typeof callback === 'function') {\n      try {\n        const normalizedPath = path.normalize(this.path);\n        const fullPath = path.join(dest, stripPath(normalizedPath, options));\n\n        // do not check for the existence of the directory but allow out-of-order calling\n        const queue = new Queue(1);\n        queue.defer(mkdirp.bind(null, fullPath));\n        queue.defer(waitForAccess.bind(null, fullPath));\n        queue.defer(chmod.bind(null, fullPath, this, options));\n        queue.defer(chown.bind(null, fullPath, this, options));\n        queue.defer(utimes.bind(null, fullPath, this, options));\n        queue.await(callback);\n        return;\n      } catch (err) {\n        callback(err);\n        return;\n      }\n    }\n\n    return new Promise((resolve, reject) => {\n      this.create(dest, options, (err?: Error, done?: boolean) => (err ? reject(err) : resolve(done)));\n    });\n  }\n\n  destroy() {}\n}\n"],"names":["DirectoryEntry","MANDATORY_ATTRIBUTES","attributes","validateAttributes","objectAssign","type","undefined","basename","path","create","dest","options","callback","normalizedPath","normalize","fullPath","join","stripPath","queue","Queue","defer","mkdirp","bind","waitForAccess","chmod","chown","utimes","await","err","Promise","resolve","reject","done","destroy"],"mappings":";;;;;;;eAgBqBA;;;oEAhBF;2DACF;8DACC;8DACA;8DACA;+DACC;uBACU;kEACP;2EACS;sEACL;;;;;;;;;;;AAE1B,IAAMC,uBAAuB;IAAC;IAAQ;IAAS;CAAO;AAKvC,IAAA,AAAMD,+BAAN;;aAAMA,eAOPE,UAA+B;gCAPxBF;QAQjBG,IAAAA,6BAAkB,EAACD,YAAYD;QAC/BG,IAAAA,qBAAY,EAAC,IAAI,EAAEF;QACnB,IAAI,IAAI,CAACG,IAAI,KAAKC,WAAW,IAAI,CAACD,IAAI,GAAG;QACzC,IAAI,IAAI,CAACE,QAAQ,KAAKD,WAAW,IAAI,CAACC,QAAQ,GAAGC,aAAI,CAACD,QAAQ,CAAC,IAAI,CAACC,IAAI;;iBAXvDR;IAiBnBS,OAAAA,MA2BC,GA3BDA,SAAAA,OAAOC,IAAY,EAAEC,OAA0C,EAAEC,QAA0B;;QACzFA,WAAW,OAAOD,YAAY,aAAaA,UAAUC;QACrDD,UAAU,OAAOA,YAAY,aAAa,CAAC,IAAMA,WAAW,CAAC;QAE7D,IAAI,OAAOC,aAAa,YAAY;YAClC,IAAI;gBACF,IAAMC,iBAAiBL,aAAI,CAACM,SAAS,CAAC,IAAI,CAACN,IAAI;gBAC/C,IAAMO,WAAWP,aAAI,CAACQ,IAAI,CAACN,MAAMO,IAAAA,oBAAS,EAACJ,gBAAgBF;gBAE3D,iFAAiF;gBACjF,IAAMO,QAAQ,IAAIC,gBAAK,CAAC;gBACxBD,MAAME,KAAK,CAACC,sBAAM,CAACC,IAAI,CAAC,MAAMP;gBAC9BG,MAAME,KAAK,CAACG,wBAAa,CAACD,IAAI,CAAC,MAAMP;gBACrCG,MAAME,KAAK,CAACI,gBAAK,CAACF,IAAI,CAAC,MAAMP,UAAU,IAAI,EAAEJ;gBAC7CO,MAAME,KAAK,CAACK,gBAAK,CAACH,IAAI,CAAC,MAAMP,UAAU,IAAI,EAAEJ;gBAC7CO,MAAME,KAAK,CAACM,iBAAM,CAACJ,IAAI,CAAC,MAAMP,UAAU,IAAI,EAAEJ;gBAC9CO,MAAMS,KAAK,CAACf;gBACZ;YACF,EAAE,OAAOgB,KAAK;gBACZhB,SAASgB;gBACT;YACF;QACF;QAEA,OAAO,IAAIC,QAAQ,SAACC,SAASC;YAC3B,MAAKtB,MAAM,CAACC,MAAMC,SAAS,SAACiB,KAAaI;uBAAoBJ,MAAMG,OAAOH,OAAOE,QAAQE;;QAC3F;IACF;IAEAC,OAAAA,OAAY,GAAZA,SAAAA,WAAW;WA9CQjC"}
+{"version":3,"sources":["/Users/kevin/Dev/OpenSource/iterators/extract-base-iterator/src/DirectoryEntry.ts"],"sourcesContent":["import mkdirp from 'mkdirp-classic';\nimport path from 'path';\nimport Queue from 'queue-cb';\nimport chmod from './fs/chmod.ts';\nimport chown from './fs/chown.ts';\nimport utimes from './fs/utimes.ts';\nimport { objectAssign } from './shared/index.ts';\nimport stripPath from './shared/stripPath.ts';\nimport validateAttributes from './validateAttributes.ts';\nimport waitForAccess from './waitForAccess.ts';\n\nconst MANDATORY_ATTRIBUTES = ['mode', 'mtime', 'path'];\n\nimport type { Mode } from 'fs';\nimport type { DirectoryAttributes, ExtractOptions, NoParamCallback } from './types.ts';\n\nexport default class DirectoryEntry {\n  mode: Mode;\n  mtime: number;\n  path: string;\n  basename: string;\n  type: string;\n\n  constructor(attributes: DirectoryAttributes) {\n    validateAttributes(attributes, MANDATORY_ATTRIBUTES);\n    objectAssign(this, attributes);\n    if (this.type === undefined) this.type = 'directory';\n    if (this.basename === undefined) this.basename = path.basename(this.path);\n  }\n\n  create(dest: string, callback: NoParamCallback): void;\n  create(dest: string, options: ExtractOptions, callback: NoParamCallback): void;\n  create(dest: string, options?: ExtractOptions): Promise<boolean>;\n  create(dest: string, options?: ExtractOptions | NoParamCallback, callback?: NoParamCallback): void | Promise<boolean> {\n    callback = typeof options === 'function' ? options : callback;\n    options = typeof options === 'function' ? {} : ((options || {}) as ExtractOptions);\n\n    if (typeof callback === 'function') {\n      try {\n        const normalizedPath = path.normalize(this.path);\n        const fullPath = path.join(dest, stripPath(normalizedPath, options));\n\n        // do not check for the existence of the directory but allow out-of-order calling\n        const queue = new Queue(1);\n        queue.defer(mkdirp.bind(null, fullPath));\n        queue.defer(waitForAccess.bind(null, fullPath));\n        queue.defer(chmod.bind(null, fullPath, this, options));\n        queue.defer(chown.bind(null, fullPath, this, options));\n        queue.defer(utimes.bind(null, fullPath, this, options));\n        queue.await(callback);\n      } catch (err) {\n        callback(err);\n      }\n      return;\n    }\n\n    return new Promise((resolve, reject) => this.create(dest, options, (err?: Error, done?: boolean) => (err ? reject(err) : resolve(done))));\n  }\n\n  destroy() {}\n}\n"],"names":["DirectoryEntry","MANDATORY_ATTRIBUTES","attributes","validateAttributes","objectAssign","type","undefined","basename","path","create","dest","options","callback","normalizedPath","normalize","fullPath","join","stripPath","queue","Queue","defer","mkdirp","bind","waitForAccess","chmod","chown","utimes","await","err","Promise","resolve","reject","done","destroy"],"mappings":";;;;;;;eAgBqBA;;;oEAhBF;2DACF;8DACC;8DACA;8DACA;+DACC;uBACU;kEACP;2EACS;sEACL;;;;;;;;;;;AAE1B,IAAMC,uBAAuB;IAAC;IAAQ;IAAS;CAAO;AAKvC,IAAA,AAAMD,+BAAN;;aAAMA,eAOPE,UAA+B;gCAPxBF;QAQjBG,IAAAA,6BAAkB,EAACD,YAAYD;QAC/BG,IAAAA,qBAAY,EAAC,IAAI,EAAEF;QACnB,IAAI,IAAI,CAACG,IAAI,KAAKC,WAAW,IAAI,CAACD,IAAI,GAAG;QACzC,IAAI,IAAI,CAACE,QAAQ,KAAKD,WAAW,IAAI,CAACC,QAAQ,GAAGC,aAAI,CAACD,QAAQ,CAAC,IAAI,CAACC,IAAI;;iBAXvDR;IAiBnBS,OAAAA,MAwBC,GAxBDA,SAAAA,OAAOC,IAAY,EAAEC,OAA0C,EAAEC,QAA0B;;QACzFA,WAAW,OAAOD,YAAY,aAAaA,UAAUC;QACrDD,UAAU,OAAOA,YAAY,aAAa,CAAC,IAAMA,WAAW,CAAC;QAE7D,IAAI,OAAOC,aAAa,YAAY;YAClC,IAAI;gBACF,IAAMC,iBAAiBL,aAAI,CAACM,SAAS,CAAC,IAAI,CAACN,IAAI;gBAC/C,IAAMO,WAAWP,aAAI,CAACQ,IAAI,CAACN,MAAMO,IAAAA,oBAAS,EAACJ,gBAAgBF;gBAE3D,iFAAiF;gBACjF,IAAMO,QAAQ,IAAIC,gBAAK,CAAC;gBACxBD,MAAME,KAAK,CAACC,sBAAM,CAACC,IAAI,CAAC,MAAMP;gBAC9BG,MAAME,KAAK,CAACG,wBAAa,CAACD,IAAI,CAAC,MAAMP;gBACrCG,MAAME,KAAK,CAACI,gBAAK,CAACF,IAAI,CAAC,MAAMP,UAAU,IAAI,EAAEJ;gBAC7CO,MAAME,KAAK,CAACK,gBAAK,CAACH,IAAI,CAAC,MAAMP,UAAU,IAAI,EAAEJ;gBAC7CO,MAAME,KAAK,CAACM,iBAAM,CAACJ,IAAI,CAAC,MAAMP,UAAU,IAAI,EAAEJ;gBAC9CO,MAAMS,KAAK,CAACf;YACd,EAAE,OAAOgB,KAAK;gBACZhB,SAASgB;YACX;YACA;QACF;QAEA,OAAO,IAAIC,QAAQ,SAACC,SAASC;mBAAW,MAAKtB,MAAM,CAACC,MAAMC,SAAS,SAACiB,KAAaI;uBAAoBJ,MAAMG,OAAOH,OAAOE,QAAQE;;;IACnI;IAEAC,OAAAA,OAAY,GAAZA,SAAAA,WAAW;WA3CQjC"}

package/dist/cjs/FileEntry.js

@@ -85,14 +85,13 @@ var FileEntry = /*#__PURE__*/ function() {
                 queue.defer(_chownts.default.bind(null, fullPath, this, options));
                 queue.defer(_utimests.default.bind(null, fullPath, this, options));
                 queue.await(callback);
-                return;
             } catch (err) {
                 callback(err);
-                return;
             }
+            return;
         }
         return new Promise(function(resolve, reject) {
-            _this.create(dest, options, function(err, done) {
+            return _this.create(dest, options, function(err, done) {
                 return err ? reject(err) : resolve(done);
             });
         });

package/dist/cjs/FileEntry.js.map

@@ -1 +1 @@
-{"version":3,"sources":["/Users/kevin/Dev/OpenSource/iterators/extract-base-iterator/src/FileEntry.ts"],"sourcesContent":["import { rm } from 'fs-remove-compat';\nimport fs from 'graceful-fs';\nimport mkdirp from 'mkdirp-classic';\nimport path from 'path';\nimport Queue from 'queue-cb';\nimport chmod from './fs/chmod.ts';\nimport chown from './fs/chown.ts';\nimport utimes from './fs/utimes.ts';\nimport { objectAssign } from './shared/index.ts';\nimport stripPath from './shared/stripPath.ts';\nimport validateAttributes from './validateAttributes.ts';\nimport waitForAccess from './waitForAccess.ts';\n\nconst MANDATORY_ATTRIBUTES = ['mode', 'mtime', 'path'];\n\nimport type { Mode } from 'fs';\nimport type { ExtractOptions, FileAttributes, NoParamCallback, WriteFileFn } from './types.ts';\n\ninterface AbstractFileEntry {\n  _writeFile: WriteFileFn;\n}\n\nexport default class FileEntry {\n  mode: Mode;\n  mtime: number;\n  path: string;\n  basename: string;\n  type: string;\n\n  constructor(attributes: FileAttributes) {\n    validateAttributes(attributes, MANDATORY_ATTRIBUTES);\n    objectAssign(this, attributes);\n    if (this.basename === undefined) this.basename = path.basename(this.path);\n    if (this.type === undefined) this.type = 'file';\n    if ((this as unknown as AbstractFileEntry)._writeFile === undefined) throw new Error('File this missing _writeFile. Please implement this method in your subclass');\n  }\n\n  create(dest: string, callback: NoParamCallback): void;\n  create(dest: string, options: ExtractOptions, callback: NoParamCallback): void;\n  create(dest: string, options?: ExtractOptions): Promise<boolean>;\n  create(dest: string, options?: ExtractOptions | NoParamCallback, callback?: NoParamCallback): void | Promise<boolean> {\n    callback = typeof options === 'function' ? options : callback;\n    options = typeof options === 'function' ? {} : ((options || {}) as ExtractOptions);\n\n    if (typeof callback === 'function') {\n      try {\n        const normalizedPath = path.normalize(this.path);\n        const fullPath = path.join(dest, stripPath(normalizedPath, options));\n\n        const queue = new Queue(1);\n        if (options.force) {\n          queue.defer((callback) => {\n            rm(fullPath, (err) => {\n              err && err.code !== 'ENOENT' ? callback(err) : callback();\n            });\n          });\n        } else {\n          // Check if file exists - throw EEXIST if it does\n          queue.defer((callback) => {\n            fs.stat(fullPath, (err) => {\n              if (!err) {\n                const existsErr = new Error(`EEXIST: file already exists, open '${fullPath}'`) as NodeJS.ErrnoException;\n                existsErr.code = 'EEXIST';\n                existsErr.path = fullPath;\n                return callback(existsErr);\n              }\n              // ENOENT means file doesn't exist - that's what we want\n              if (err.code === 'ENOENT') return callback();\n              // Other errors should be reported\n              callback(err);\n            });\n          });\n        }\n        queue.defer(mkdirp.bind(null, path.dirname(fullPath)));\n        queue.defer((this as unknown as AbstractFileEntry)._writeFile.bind(this, fullPath, options));\n        queue.defer(waitForAccess.bind(null, fullPath));\n        queue.defer(chmod.bind(null, fullPath, this, options));\n        queue.defer(chown.bind(null, fullPath, this, options));\n        queue.defer(utimes.bind(null, fullPath, this, options));\n        queue.await(callback);\n        return;\n      } catch (err) {\n        callback(err);\n        return;\n      }\n    }\n\n    return new Promise((resolve, reject) => {\n      this.create(dest, options, (err?: Error, done?: boolean) => (err ? reject(err) : resolve(done)));\n    });\n  }\n\n  destroy() {}\n}\n"],"names":["FileEntry","MANDATORY_ATTRIBUTES","attributes","validateAttributes","objectAssign","basename","undefined","path","type","_writeFile","Error","create","dest","options","callback","normalizedPath","normalize","fullPath","join","stripPath","queue","Queue","force","defer","rm","err","code","fs","stat","existsErr","mkdirp","bind","dirname","waitForAccess","chmod","chown","utimes","await","Promise","resolve","reject","done","destroy"],"mappings":";;;;;;;eAsBqBA;;;8BAtBF;iEACJ;oEACI;2DACF;8DACC;8DACA;8DACA;+DACC;uBACU;kEACP;2EACS;sEACL;;;;;;;;;;;AAE1B,IAAMC,uBAAuB;IAAC;IAAQ;IAAS;CAAO;AASvC,IAAA,AAAMD,0BAAN;;aAAMA,UAOPE,UAA0B;gCAPnBF;QAQjBG,IAAAA,6BAAkB,EAACD,YAAYD;QAC/BG,IAAAA,qBAAY,EAAC,IAAI,EAAEF;QACnB,IAAI,IAAI,CAACG,QAAQ,KAAKC,WAAW,IAAI,CAACD,QAAQ,GAAGE,aAAI,CAACF,QAAQ,CAAC,IAAI,CAACE,IAAI;QACxE,IAAI,IAAI,CAACC,IAAI,KAAKF,WAAW,IAAI,CAACE,IAAI,GAAG;QACzC,IAAI,AAAC,IAAI,CAAkCC,UAAU,KAAKH,WAAW,MAAM,IAAII,MAAM;;iBAZpEV;IAkBnBW,OAAAA,MAkDC,GAlDDA,SAAAA,OAAOC,IAAY,EAAEC,OAA0C,EAAEC,QAA0B;;QACzFA,WAAW,OAAOD,YAAY,aAAaA,UAAUC;QACrDD,UAAU,OAAOA,YAAY,aAAa,CAAC,IAAMA,WAAW,CAAC;QAE7D,IAAI,OAAOC,aAAa,YAAY;YAClC,IAAI;gBACF,IAAMC,iBAAiBR,aAAI,CAACS,SAAS,CAAC,IAAI,CAACT,IAAI;gBAC/C,IAAMU,WAAWV,aAAI,CAACW,IAAI,CAACN,MAAMO,IAAAA,oBAAS,EAACJ,gBAAgBF;gBAE3D,IAAMO,QAAQ,IAAIC,gBAAK,CAAC;gBACxB,IAAIR,QAAQS,KAAK,EAAE;oBACjBF,MAAMG,KAAK,CAAC,SAACT;wBACXU,IAAAA,kBAAE,EAACP,UAAU,SAACQ;4BACZA,OAAOA,IAAIC,IAAI,KAAK,WAAWZ,SAASW,OAAOX;wBACjD;oBACF;gBACF,OAAO;oBACL,iDAAiD;oBACjDM,MAAMG,KAAK,CAAC,SAACT;wBACXa,mBAAE,CAACC,IAAI,CAACX,UAAU,SAACQ;4BACjB,IAAI,CAACA,KAAK;gCACR,IAAMI,YAAY,IAAInB,MAAM,AAAC,sCAA8C,OAATO,UAAS;gCAC3EY,UAAUH,IAAI,GAAG;gCACjBG,UAAUtB,IAAI,GAAGU;gCACjB,OAAOH,SAASe;4BAClB;4BACA,wDAAwD;4BACxD,IAAIJ,IAAIC,IAAI,KAAK,UAAU,OAAOZ;4BAClC,kCAAkC;4BAClCA,SAASW;wBACX;oBACF;gBACF;gBACAL,MAAMG,KAAK,CAACO,sBAAM,CAACC,IAAI,CAAC,MAAMxB,aAAI,CAACyB,OAAO,CAACf;gBAC3CG,MAAMG,KAAK,CAAC,AAAC,IAAI,CAAkCd,UAAU,CAACsB,IAAI,CAAC,IAAI,EAAEd,UAAUJ;gBACnFO,MAAMG,KAAK,CAACU,wBAAa,CAACF,IAAI,CAAC,MAAMd;gBACrCG,MAAMG,KAAK,CAACW,gBAAK,CAACH,IAAI,CAAC,MAAMd,UAAU,IAAI,EAAEJ;gBAC7CO,MAAMG,KAAK,CAACY,gBAAK,CAACJ,IAAI,CAAC,MAAMd,UAAU,IAAI,EAAEJ;gBAC7CO,MAAMG,KAAK,CAACa,iBAAM,CAACL,IAAI,CAAC,MAAMd,UAAU,IAAI,EAAEJ;gBAC9CO,MAAMiB,KAAK,CAACvB;gBACZ;YACF,EAAE,OAAOW,KAAK;gBACZX,SAASW;gBACT;YACF;QACF;QAEA,OAAO,IAAIa,QAAQ,SAACC,SAASC;YAC3B,MAAK7B,MAAM,CAACC,MAAMC,SAAS,SAACY,KAAagB;uBAAoBhB,MAAMe,OAAOf,OAAOc,QAAQE;;QAC3F;IACF;IAEAC,OAAAA,OAAY,GAAZA,SAAAA,WAAW;WAtEQ1C"}
+{"version":3,"sources":["/Users/kevin/Dev/OpenSource/iterators/extract-base-iterator/src/FileEntry.ts"],"sourcesContent":["import { rm } from 'fs-remove-compat';\nimport fs from 'graceful-fs';\nimport mkdirp from 'mkdirp-classic';\nimport path from 'path';\nimport Queue from 'queue-cb';\nimport chmod from './fs/chmod.ts';\nimport chown from './fs/chown.ts';\nimport utimes from './fs/utimes.ts';\nimport { objectAssign } from './shared/index.ts';\nimport stripPath from './shared/stripPath.ts';\nimport validateAttributes from './validateAttributes.ts';\nimport waitForAccess from './waitForAccess.ts';\n\nconst MANDATORY_ATTRIBUTES = ['mode', 'mtime', 'path'];\n\nimport type { Mode } from 'fs';\nimport type { ExtractOptions, FileAttributes, NoParamCallback, WriteFileFn } from './types.ts';\n\ninterface AbstractFileEntry {\n  _writeFile: WriteFileFn;\n}\n\nexport default class FileEntry {\n  mode: Mode;\n  mtime: number;\n  path: string;\n  basename: string;\n  type: string;\n\n  constructor(attributes: FileAttributes) {\n    validateAttributes(attributes, MANDATORY_ATTRIBUTES);\n    objectAssign(this, attributes);\n    if (this.basename === undefined) this.basename = path.basename(this.path);\n    if (this.type === undefined) this.type = 'file';\n    if ((this as unknown as AbstractFileEntry)._writeFile === undefined) throw new Error('File this missing _writeFile. Please implement this method in your subclass');\n  }\n\n  create(dest: string, callback: NoParamCallback): void;\n  create(dest: string, options: ExtractOptions, callback: NoParamCallback): void;\n  create(dest: string, options?: ExtractOptions): Promise<boolean>;\n  create(dest: string, options?: ExtractOptions | NoParamCallback, callback?: NoParamCallback): void | Promise<boolean> {\n    callback = typeof options === 'function' ? options : callback;\n    options = typeof options === 'function' ? {} : ((options || {}) as ExtractOptions);\n\n    if (typeof callback === 'function') {\n      try {\n        const normalizedPath = path.normalize(this.path);\n        const fullPath = path.join(dest, stripPath(normalizedPath, options));\n\n        const queue = new Queue(1);\n        if (options.force) {\n          queue.defer((callback) => {\n            rm(fullPath, (err) => {\n              err && err.code !== 'ENOENT' ? callback(err) : callback();\n            });\n          });\n        } else {\n          // Check if file exists - throw EEXIST if it does\n          queue.defer((callback) => {\n            fs.stat(fullPath, (err) => {\n              if (!err) {\n                const existsErr = new Error(`EEXIST: file already exists, open '${fullPath}'`) as NodeJS.ErrnoException;\n                existsErr.code = 'EEXIST';\n                existsErr.path = fullPath;\n                return callback(existsErr);\n              }\n              // ENOENT means file doesn't exist - that's what we want\n              if (err.code === 'ENOENT') return callback();\n              // Other errors should be reported\n              callback(err);\n            });\n          });\n        }\n        queue.defer(mkdirp.bind(null, path.dirname(fullPath)));\n        queue.defer((this as unknown as AbstractFileEntry)._writeFile.bind(this, fullPath, options));\n        queue.defer(waitForAccess.bind(null, fullPath));\n        queue.defer(chmod.bind(null, fullPath, this, options));\n        queue.defer(chown.bind(null, fullPath, this, options));\n        queue.defer(utimes.bind(null, fullPath, this, options));\n        queue.await(callback);\n      } catch (err) {\n        callback(err);\n      }\n      return;\n    }\n\n    return new Promise((resolve, reject) => this.create(dest, options, (err?: Error, done?: boolean) => (err ? reject(err) : resolve(done))));\n  }\n\n  destroy() {}\n}\n"],"names":["FileEntry","MANDATORY_ATTRIBUTES","attributes","validateAttributes","objectAssign","basename","undefined","path","type","_writeFile","Error","create","dest","options","callback","normalizedPath","normalize","fullPath","join","stripPath","queue","Queue","force","defer","rm","err","code","fs","stat","existsErr","mkdirp","bind","dirname","waitForAccess","chmod","chown","utimes","await","Promise","resolve","reject","done","destroy"],"mappings":";;;;;;;eAsBqBA;;;8BAtBF;iEACJ;oEACI;2DACF;8DACC;8DACA;8DACA;+DACC;uBACU;kEACP;2EACS;sEACL;;;;;;;;;;;AAE1B,IAAMC,uBAAuB;IAAC;IAAQ;IAAS;CAAO;AASvC,IAAA,AAAMD,0BAAN;;aAAMA,UAOPE,UAA0B;gCAPnBF;QAQjBG,IAAAA,6BAAkB,EAACD,YAAYD;QAC/BG,IAAAA,qBAAY,EAAC,IAAI,EAAEF;QACnB,IAAI,IAAI,CAACG,QAAQ,KAAKC,WAAW,IAAI,CAACD,QAAQ,GAAGE,aAAI,CAACF,QAAQ,CAAC,IAAI,CAACE,IAAI;QACxE,IAAI,IAAI,CAACC,IAAI,KAAKF,WAAW,IAAI,CAACE,IAAI,GAAG;QACzC,IAAI,AAAC,IAAI,CAAkCC,UAAU,KAAKH,WAAW,MAAM,IAAII,MAAM;;iBAZpEV;IAkBnBW,OAAAA,MA+CC,GA/CDA,SAAAA,OAAOC,IAAY,EAAEC,OAA0C,EAAEC,QAA0B;;QACzFA,WAAW,OAAOD,YAAY,aAAaA,UAAUC;QACrDD,UAAU,OAAOA,YAAY,aAAa,CAAC,IAAMA,WAAW,CAAC;QAE7D,IAAI,OAAOC,aAAa,YAAY;YAClC,IAAI;gBACF,IAAMC,iBAAiBR,aAAI,CAACS,SAAS,CAAC,IAAI,CAACT,IAAI;gBAC/C,IAAMU,WAAWV,aAAI,CAACW,IAAI,CAACN,MAAMO,IAAAA,oBAAS,EAACJ,gBAAgBF;gBAE3D,IAAMO,QAAQ,IAAIC,gBAAK,CAAC;gBACxB,IAAIR,QAAQS,KAAK,EAAE;oBACjBF,MAAMG,KAAK,CAAC,SAACT;wBACXU,IAAAA,kBAAE,EAACP,UAAU,SAACQ;4BACZA,OAAOA,IAAIC,IAAI,KAAK,WAAWZ,SAASW,OAAOX;wBACjD;oBACF;gBACF,OAAO;oBACL,iDAAiD;oBACjDM,MAAMG,KAAK,CAAC,SAACT;wBACXa,mBAAE,CAACC,IAAI,CAACX,UAAU,SAACQ;4BACjB,IAAI,CAACA,KAAK;gCACR,IAAMI,YAAY,IAAInB,MAAM,AAAC,sCAA8C,OAATO,UAAS;gCAC3EY,UAAUH,IAAI,GAAG;gCACjBG,UAAUtB,IAAI,GAAGU;gCACjB,OAAOH,SAASe;4BAClB;4BACA,wDAAwD;4BACxD,IAAIJ,IAAIC,IAAI,KAAK,UAAU,OAAOZ;4BAClC,kCAAkC;4BAClCA,SAASW;wBACX;oBACF;gBACF;gBACAL,MAAMG,KAAK,CAACO,sBAAM,CAACC,IAAI,CAAC,MAAMxB,aAAI,CAACyB,OAAO,CAACf;gBAC3CG,MAAMG,KAAK,CAAC,AAAC,IAAI,CAAkCd,UAAU,CAACsB,IAAI,CAAC,IAAI,EAAEd,UAAUJ;gBACnFO,MAAMG,KAAK,CAACU,wBAAa,CAACF,IAAI,CAAC,MAAMd;gBACrCG,MAAMG,KAAK,CAACW,gBAAK,CAACH,IAAI,CAAC,MAAMd,UAAU,IAAI,EAAEJ;gBAC7CO,MAAMG,KAAK,CAACY,gBAAK,CAACJ,IAAI,CAAC,MAAMd,UAAU,IAAI,EAAEJ;gBAC7CO,MAAMG,KAAK,CAACa,iBAAM,CAACL,IAAI,CAAC,MAAMd,UAAU,IAAI,EAAEJ;gBAC9CO,MAAMiB,KAAK,CAACvB;YACd,EAAE,OAAOW,KAAK;gBACZX,SAASW;YACX;YACA;QACF;QAEA,OAAO,IAAIa,QAAQ,SAACC,SAASC;mBAAW,MAAK7B,MAAM,CAACC,MAAMC,SAAS,SAACY,KAAagB;uBAAoBhB,MAAMe,OAAOf,OAAOc,QAAQE;;;IACnI;IAEAC,OAAAA,OAAY,GAAZA,SAAAA,WAAW;WAnEQ1C"}

package/dist/cjs/LinkEntry.js

@@ -72,14 +72,13 @@ var LinkEntry = /*#__PURE__*/ function() {
                 queue.defer(_chownts.default.bind(null, fullPath, this, options));
                 queue.defer(_utimests.default.bind(null, fullPath, this, options));
                 queue.await(callback);
-                return;
             } catch (err) {
                 callback(err);
-                return;
             }
+            return;
         }
         return new Promise(function(resolve, reject) {
-            _this.create(dest, options, function(err, done) {
+            return _this.create(dest, options, function(err, done) {
                 return err ? reject(err) : resolve(done);
             });
         });

package/dist/cjs/LinkEntry.js.map

@@ -1 +1 @@
-{"version":3,"sources":["/Users/kevin/Dev/OpenSource/iterators/extract-base-iterator/src/LinkEntry.ts"],"sourcesContent":["import fs from 'fs';\nimport { rm } from 'fs-remove-compat';\nimport mkdirp from 'mkdirp-classic';\nimport path from 'path';\nimport Queue from 'queue-cb';\nimport chmod from './fs/chmod.ts';\nimport chown from './fs/chown.ts';\nimport utimes from './fs/utimes.ts';\nimport { objectAssign } from './shared/index.ts';\nimport stripPath from './shared/stripPath.ts';\nimport validateAttributes from './validateAttributes.ts';\nimport waitForAccess from './waitForAccess.ts';\n\nconst MANDATORY_ATTRIBUTES = ['mode', 'mtime', 'path', 'linkpath'];\n\nimport type { Mode } from 'fs';\nimport type { ExtractOptions, LinkAttributes, NoParamCallback } from './types.ts';\n\nexport default class LinkEntry {\n  mode: Mode;\n  mtime: number;\n  path: string;\n  linkpath: string;\n  basename: string;\n  type: string;\n\n  constructor(attributes: LinkAttributes) {\n    validateAttributes(attributes, MANDATORY_ATTRIBUTES);\n    objectAssign(this, attributes);\n    if (this.basename === undefined) this.basename = path.basename(this.path);\n    if (this.type === undefined) this.type = 'link';\n  }\n\n  create(dest: string, callback: NoParamCallback): void;\n  create(dest: string, options: ExtractOptions, callback: NoParamCallback): void;\n  create(dest: string, options?: ExtractOptions): Promise<boolean>;\n  create(dest: string, options?: ExtractOptions | NoParamCallback, callback?: NoParamCallback): void | Promise<boolean> {\n    callback = typeof options === 'function' ? options : callback;\n    options = typeof options === 'function' ? {} : ((options || {}) as ExtractOptions);\n\n    if (typeof callback === 'function') {\n      try {\n        const normalizedPath = path.normalize(this.path);\n        const fullPath = path.join(dest, stripPath(normalizedPath, options));\n        const normalizedLinkpath = path.normalize(this.linkpath);\n        const linkFullPath = path.join(dest, stripPath(normalizedLinkpath, options));\n\n        const queue = new Queue(1);\n        if (options.force) {\n          queue.defer((callback) => {\n            rm(fullPath, (err) => {\n              err && err.code !== 'ENOENT' ? callback(err) : callback();\n            });\n          });\n        }\n        queue.defer(mkdirp.bind(null, path.dirname(fullPath)));\n        queue.defer(waitForAccess.bind(null, linkFullPath)); // ensure target file is accessible before linking\n        queue.defer(fs.link.bind(fs, linkFullPath, fullPath));\n        queue.defer(waitForAccess.bind(null, fullPath));\n        queue.defer(chmod.bind(null, fullPath, this, options));\n        queue.defer(chown.bind(null, fullPath, this, options));\n        queue.defer(utimes.bind(null, fullPath, this, options));\n        queue.await(callback);\n        return;\n      } catch (err) {\n        callback(err);\n        return;\n      }\n    }\n\n    return new Promise((resolve, reject) => {\n      this.create(dest, options, (err?: Error, done?: boolean) => (err ? reject(err) : resolve(done)));\n    });\n  }\n\n  destroy() {}\n}\n"],"names":["LinkEntry","MANDATORY_ATTRIBUTES","attributes","validateAttributes","objectAssign","basename","undefined","path","type","create","dest","options","callback","normalizedPath","normalize","fullPath","join","stripPath","normalizedLinkpath","linkpath","linkFullPath","queue","Queue","force","defer","rm","err","code","mkdirp","bind","dirname","waitForAccess","fs","link","chmod","chown","utimes","await","Promise","resolve","reject","done","destroy"],"mappings":";;;;;;;eAkBqBA;;;yDAlBN;8BACI;oEACA;2DACF;8DACC;8DACA;8DACA;+DACC;uBACU;kEACP;2EACS;sEACL;;;;;;;;;;;AAE1B,IAAMC,uBAAuB;IAAC;IAAQ;IAAS;IAAQ;CAAW;AAKnD,IAAA,AAAMD,0BAAN;;aAAMA,UAQPE,UAA0B;gCARnBF;QASjBG,IAAAA,6BAAkB,EAACD,YAAYD;QAC/BG,IAAAA,qBAAY,EAAC,IAAI,EAAEF;QACnB,IAAI,IAAI,CAACG,QAAQ,KAAKC,WAAW,IAAI,CAACD,QAAQ,GAAGE,aAAI,CAACF,QAAQ,CAAC,IAAI,CAACE,IAAI;QACxE,IAAI,IAAI,CAACC,IAAI,KAAKF,WAAW,IAAI,CAACE,IAAI,GAAG;;iBAZxBR;IAkBnBS,OAAAA,MAqCC,GArCDA,SAAAA,OAAOC,IAAY,EAAEC,OAA0C,EAAEC,QAA0B;;QACzFA,WAAW,OAAOD,YAAY,aAAaA,UAAUC;QACrDD,UAAU,OAAOA,YAAY,aAAa,CAAC,IAAMA,WAAW,CAAC;QAE7D,IAAI,OAAOC,aAAa,YAAY;YAClC,IAAI;gBACF,IAAMC,iBAAiBN,aAAI,CAACO,SAAS,CAAC,IAAI,CAACP,IAAI;gBAC/C,IAAMQ,WAAWR,aAAI,CAACS,IAAI,CAACN,MAAMO,IAAAA,oBAAS,EAACJ,gBAAgBF;gBAC3D,IAAMO,qBAAqBX,aAAI,CAACO,SAAS,CAAC,IAAI,CAACK,QAAQ;gBACvD,IAAMC,eAAeb,aAAI,CAACS,IAAI,CAACN,MAAMO,IAAAA,oBAAS,EAACC,oBAAoBP;gBAEnE,IAAMU,QAAQ,IAAIC,gBAAK,CAAC;gBACxB,IAAIX,QAAQY,KAAK,EAAE;oBACjBF,MAAMG,KAAK,CAAC,SAACZ;wBACXa,IAAAA,kBAAE,EAACV,UAAU,SAACW;4BACZA,OAAOA,IAAIC,IAAI,KAAK,WAAWf,SAASc,OAAOd;wBACjD;oBACF;gBACF;gBACAS,MAAMG,KAAK,CAACI,sBAAM,CAACC,IAAI,CAAC,MAAMtB,aAAI,CAACuB,OAAO,CAACf;gBAC3CM,MAAMG,KAAK,CAACO,wBAAa,CAACF,IAAI,CAAC,MAAMT,gBAAgB,kDAAkD;gBACvGC,MAAMG,KAAK,CAACQ,WAAE,CAACC,IAAI,CAACJ,IAAI,CAACG,WAAE,EAAEZ,cAAcL;gBAC3CM,MAAMG,KAAK,CAACO,wBAAa,CAACF,IAAI,CAAC,MAAMd;gBACrCM,MAAMG,KAAK,CAACU,gBAAK,CAACL,IAAI,CAAC,MAAMd,UAAU,IAAI,EAAEJ;gBAC7CU,MAAMG,KAAK,CAACW,gBAAK,CAACN,IAAI,CAAC,MAAMd,UAAU,IAAI,EAAEJ;gBAC7CU,MAAMG,KAAK,CAACY,iBAAM,CAACP,IAAI,CAAC,MAAMd,UAAU,IAAI,EAAEJ;gBAC9CU,MAAMgB,KAAK,CAACzB;gBACZ;YACF,EAAE,OAAOc,KAAK;gBACZd,SAASc;gBACT;YACF;QACF;QAEA,OAAO,IAAIY,QAAQ,SAACC,SAASC;YAC3B,MAAK/B,MAAM,CAACC,MAAMC,SAAS,SAACe,KAAae;uBAAoBf,MAAMc,OAAOd,OAAOa,QAAQE;;QAC3F;IACF;IAEAC,OAAAA,OAAY,GAAZA,SAAAA,WAAW;WAzDQ1C"}
+{"version":3,"sources":["/Users/kevin/Dev/OpenSource/iterators/extract-base-iterator/src/LinkEntry.ts"],"sourcesContent":["import fs from 'fs';\nimport { rm } from 'fs-remove-compat';\nimport mkdirp from 'mkdirp-classic';\nimport path from 'path';\nimport Queue from 'queue-cb';\nimport chmod from './fs/chmod.ts';\nimport chown from './fs/chown.ts';\nimport utimes from './fs/utimes.ts';\nimport { objectAssign } from './shared/index.ts';\nimport stripPath from './shared/stripPath.ts';\nimport validateAttributes from './validateAttributes.ts';\nimport waitForAccess from './waitForAccess.ts';\n\nconst MANDATORY_ATTRIBUTES = ['mode', 'mtime', 'path', 'linkpath'];\n\nimport type { Mode } from 'fs';\nimport type { ExtractOptions, LinkAttributes, NoParamCallback } from './types.ts';\n\nexport default class LinkEntry {\n  mode: Mode;\n  mtime: number;\n  path: string;\n  linkpath: string;\n  basename: string;\n  type: string;\n\n  constructor(attributes: LinkAttributes) {\n    validateAttributes(attributes, MANDATORY_ATTRIBUTES);\n    objectAssign(this, attributes);\n    if (this.basename === undefined) this.basename = path.basename(this.path);\n    if (this.type === undefined) this.type = 'link';\n  }\n\n  create(dest: string, callback: NoParamCallback): void;\n  create(dest: string, options: ExtractOptions, callback: NoParamCallback): void;\n  create(dest: string, options?: ExtractOptions): Promise<boolean>;\n  create(dest: string, options?: ExtractOptions | NoParamCallback, callback?: NoParamCallback): void | Promise<boolean> {\n    callback = typeof options === 'function' ? options : callback;\n    options = typeof options === 'function' ? {} : ((options || {}) as ExtractOptions);\n\n    if (typeof callback === 'function') {\n      try {\n        const normalizedPath = path.normalize(this.path);\n        const fullPath = path.join(dest, stripPath(normalizedPath, options));\n        const normalizedLinkpath = path.normalize(this.linkpath);\n        const linkFullPath = path.join(dest, stripPath(normalizedLinkpath, options));\n\n        const queue = new Queue(1);\n        if (options.force) {\n          queue.defer((callback) => {\n            rm(fullPath, (err) => {\n              err && err.code !== 'ENOENT' ? callback(err) : callback();\n            });\n          });\n        }\n        queue.defer(mkdirp.bind(null, path.dirname(fullPath)));\n        queue.defer(waitForAccess.bind(null, linkFullPath)); // ensure target file is accessible before linking\n        queue.defer(fs.link.bind(fs, linkFullPath, fullPath));\n        queue.defer(waitForAccess.bind(null, fullPath));\n        queue.defer(chmod.bind(null, fullPath, this, options));\n        queue.defer(chown.bind(null, fullPath, this, options));\n        queue.defer(utimes.bind(null, fullPath, this, options));\n        queue.await(callback);\n      } catch (err) {\n        callback(err);\n      }\n      return;\n    }\n\n    return new Promise((resolve, reject) => this.create(dest, options, (err?: Error, done?: boolean) => (err ? reject(err) : resolve(done))));\n  }\n\n  destroy() {}\n}\n"],"names":["LinkEntry","MANDATORY_ATTRIBUTES","attributes","validateAttributes","objectAssign","basename","undefined","path","type","create","dest","options","callback","normalizedPath","normalize","fullPath","join","stripPath","normalizedLinkpath","linkpath","linkFullPath","queue","Queue","force","defer","rm","err","code","mkdirp","bind","dirname","waitForAccess","fs","link","chmod","chown","utimes","await","Promise","resolve","reject","done","destroy"],"mappings":";;;;;;;eAkBqBA;;;yDAlBN;8BACI;oEACA;2DACF;8DACC;8DACA;8DACA;+DACC;uBACU;kEACP;2EACS;sEACL;;;;;;;;;;;AAE1B,IAAMC,uBAAuB;IAAC;IAAQ;IAAS;IAAQ;CAAW;AAKnD,IAAA,AAAMD,0BAAN;;aAAMA,UAQPE,UAA0B;gCARnBF;QASjBG,IAAAA,6BAAkB,EAACD,YAAYD;QAC/BG,IAAAA,qBAAY,EAAC,IAAI,EAAEF;QACnB,IAAI,IAAI,CAACG,QAAQ,KAAKC,WAAW,IAAI,CAACD,QAAQ,GAAGE,aAAI,CAACF,QAAQ,CAAC,IAAI,CAACE,IAAI;QACxE,IAAI,IAAI,CAACC,IAAI,KAAKF,WAAW,IAAI,CAACE,IAAI,GAAG;;iBAZxBR;IAkBnBS,OAAAA,MAkCC,GAlCDA,SAAAA,OAAOC,IAAY,EAAEC,OAA0C,EAAEC,QAA0B;;QACzFA,WAAW,OAAOD,YAAY,aAAaA,UAAUC;QACrDD,UAAU,OAAOA,YAAY,aAAa,CAAC,IAAMA,WAAW,CAAC;QAE7D,IAAI,OAAOC,aAAa,YAAY;YAClC,IAAI;gBACF,IAAMC,iBAAiBN,aAAI,CAACO,SAAS,CAAC,IAAI,CAACP,IAAI;gBAC/C,IAAMQ,WAAWR,aAAI,CAACS,IAAI,CAACN,MAAMO,IAAAA,oBAAS,EAACJ,gBAAgBF;gBAC3D,IAAMO,qBAAqBX,aAAI,CAACO,SAAS,CAAC,IAAI,CAACK,QAAQ;gBACvD,IAAMC,eAAeb,aAAI,CAACS,IAAI,CAACN,MAAMO,IAAAA,oBAAS,EAACC,oBAAoBP;gBAEnE,IAAMU,QAAQ,IAAIC,gBAAK,CAAC;gBACxB,IAAIX,QAAQY,KAAK,EAAE;oBACjBF,MAAMG,KAAK,CAAC,SAACZ;wBACXa,IAAAA,kBAAE,EAACV,UAAU,SAACW;4BACZA,OAAOA,IAAIC,IAAI,KAAK,WAAWf,SAASc,OAAOd;wBACjD;oBACF;gBACF;gBACAS,MAAMG,KAAK,CAACI,sBAAM,CAACC,IAAI,CAAC,MAAMtB,aAAI,CAACuB,OAAO,CAACf;gBAC3CM,MAAMG,KAAK,CAACO,wBAAa,CAACF,IAAI,CAAC,MAAMT,gBAAgB,kDAAkD;gBACvGC,MAAMG,KAAK,CAACQ,WAAE,CAACC,IAAI,CAACJ,IAAI,CAACG,WAAE,EAAEZ,cAAcL;gBAC3CM,MAAMG,KAAK,CAACO,wBAAa,CAACF,IAAI,CAAC,MAAMd;gBACrCM,MAAMG,KAAK,CAACU,gBAAK,CAACL,IAAI,CAAC,MAAMd,UAAU,IAAI,EAAEJ;gBAC7CU,MAAMG,KAAK,CAACW,gBAAK,CAACN,IAAI,CAAC,MAAMd,UAAU,IAAI,EAAEJ;gBAC7CU,MAAMG,KAAK,CAACY,iBAAM,CAACP,IAAI,CAAC,MAAMd,UAAU,IAAI,EAAEJ;gBAC9CU,MAAMgB,KAAK,CAACzB;YACd,EAAE,OAAOc,KAAK;gBACZd,SAASc;YACX;YACA;QACF;QAEA,OAAO,IAAIY,QAAQ,SAACC,SAASC;mBAAW,MAAK/B,MAAM,CAACC,MAAMC,SAAS,SAACe,KAAae;uBAAoBf,MAAMc,OAAOd,OAAOa,QAAQE;;;IACnI;IAEAC,OAAAA,OAAY,GAAZA,SAAAA,WAAW;WAtDQ1C"}

package/dist/cjs/SymbolicLinkEntry.js

@@ -80,14 +80,13 @@ var SymbolicLinkEntry = /*#__PURE__*/ function() {
                 queue.defer(_chownts.default.bind(null, fullPath, this, options));
                 queue.defer(_lutimests.default.bind(null, fullPath, this, options));
                 queue.await(callback);
-                return;
             } catch (err) {
                 callback(err);
-                return;
             }
+            return;
         }
         return new Promise(function(resolve, reject) {
-            _this.create(dest, options, function(err, done) {
+            return _this.create(dest, options, function(err, done) {
                 return err ? reject(err) : resolve(done);
             });
         });

package/dist/cjs/SymbolicLinkEntry.js.map

@@ -1 +1 @@
-{"version":3,"sources":["/Users/kevin/Dev/OpenSource/iterators/extract-base-iterator/src/SymbolicLinkEntry.ts"],"sourcesContent":["import fs from 'fs';\nimport { rm } from 'fs-remove-compat';\nimport isAbsolute from 'is-absolute';\nimport mkdirp from 'mkdirp-classic';\nimport path from 'path';\nimport Queue from 'queue-cb';\nimport chmod from './fs/chmod.ts';\nimport chown from './fs/chown.ts';\nimport lutimes from './fs/lutimes.ts';\nimport symlinkWin32 from './fs/symlinkWin32.ts';\nimport { objectAssign } from './shared/index.ts';\nimport stripPath from './shared/stripPath.ts';\nimport validateAttributes from './validateAttributes.ts';\nimport waitForAccess from './waitForAccess.ts';\n\nconst isWindows = process.platform === 'win32' || /^(msys|cygwin)$/.test(process.env.OSTYPE);\n\nconst MANDATORY_ATTRIBUTES = ['mode', 'mtime', 'path', 'linkpath'];\n\nimport type { Mode } from 'fs';\nimport type { ExtractOptions, LinkAttributes, NoParamCallback } from './types.ts';\n\nexport default class SymbolicLinkEntry {\n  mode: Mode;\n  mtime: number;\n  path: string;\n  linkpath: string;\n  basename: string;\n  type: string;\n\n  constructor(attributes: LinkAttributes) {\n    validateAttributes(attributes, MANDATORY_ATTRIBUTES);\n    objectAssign(this, attributes);\n    if (this.basename === undefined) this.basename = path.basename(this.path);\n    if (this.type === undefined) this.type = 'symlink';\n  }\n\n  create(dest: string, callback: NoParamCallback): void;\n  create(dest: string, options: ExtractOptions, callback: NoParamCallback): void;\n  create(dest: string, options?: ExtractOptions): Promise<boolean>;\n  create(dest: string, options?: ExtractOptions | NoParamCallback, callback?: NoParamCallback): void | Promise<boolean> {\n    callback = typeof options === 'function' ? options : callback;\n    options = typeof options === 'function' ? {} : ((options || {}) as ExtractOptions);\n\n    if (typeof callback === 'function') {\n      try {\n        const normalizedPath = path.normalize(this.path);\n        const fullPath = path.join(dest, stripPath(normalizedPath, options));\n        let normalizedLinkpath = path.normalize(this.linkpath);\n        let linkFullPath = path.join(dest, stripPath(normalizedLinkpath, options));\n        if (!isAbsolute(normalizedLinkpath)) {\n          const linkRelativePath = path.join(path.dirname(normalizedPath), this.linkpath);\n          linkFullPath = path.join(dest, stripPath(linkRelativePath, options));\n          normalizedLinkpath = path.relative(path.dirname(fullPath), linkFullPath);\n        }\n\n        const queue = new Queue(1);\n        if (options.force) {\n          queue.defer((callback) => {\n            rm(fullPath, (err) => {\n              err && err.code !== 'ENOENT' ? callback(err) : callback();\n            });\n          });\n        }\n        queue.defer(mkdirp.bind(null, path.dirname(fullPath)));\n        if (isWindows) queue.defer(symlinkWin32.bind(null, linkFullPath, normalizedLinkpath, fullPath));\n        else queue.defer(fs.symlink.bind(fs, normalizedLinkpath, fullPath));\n        queue.defer(waitForAccess.bind(null, fullPath, true)); // noFollow=true for symlinks\n        queue.defer(chmod.bind(null, fullPath, this, options));\n        queue.defer(chown.bind(null, fullPath, this, options));\n        queue.defer(lutimes.bind(null, fullPath, this, options));\n        queue.await(callback);\n        return;\n      } catch (err) {\n        callback(err);\n        return;\n      }\n    }\n\n    return new Promise((resolve, reject) => {\n      this.create(dest, options, (err?: Error, done?: boolean) => (err ? reject(err) : resolve(done)));\n    });\n  }\n\n  destroy() {}\n}\n"],"names":["SymbolicLinkEntry","isWindows","process","platform","test","env","OSTYPE","MANDATORY_ATTRIBUTES","attributes","validateAttributes","objectAssign","basename","undefined","path","type","create","dest","options","callback","normalizedPath","normalize","fullPath","join","stripPath","normalizedLinkpath","linkpath","linkFullPath","isAbsolute","linkRelativePath","dirname","relative","queue","Queue","force","defer","rm","err","code","mkdirp","bind","symlinkWin32","fs","symlink","waitForAccess","chmod","chown","lutimes","await","Promise","resolve","reject","done","destroy"],"mappings":";;;;;;;eAsBqBA;;;yDAtBN;8BACI;iEACI;oEACJ;2DACF;8DACC;8DACA;8DACA;gEACE;qEACK;uBACI;kEACP;2EACS;sEACL;;;;;;;;;;;AAE1B,IAAMC,YAAYC,QAAQC,QAAQ,KAAK,WAAW,kBAAkBC,IAAI,CAACF,QAAQG,GAAG,CAACC,MAAM;AAE3F,IAAMC,uBAAuB;IAAC;IAAQ;IAAS;IAAQ;CAAW;AAKnD,IAAA,AAAMP,kCAAN;;aAAMA,kBAQPQ,UAA0B;gCARnBR;QASjBS,IAAAA,6BAAkB,EAACD,YAAYD;QAC/BG,IAAAA,qBAAY,EAAC,IAAI,EAAEF;QACnB,IAAI,IAAI,CAACG,QAAQ,KAAKC,WAAW,IAAI,CAACD,QAAQ,GAAGE,aAAI,CAACF,QAAQ,CAAC,IAAI,CAACE,IAAI;QACxE,IAAI,IAAI,CAACC,IAAI,KAAKF,WAAW,IAAI,CAACE,IAAI,GAAG;;iBAZxBd;IAkBnBe,OAAAA,MA0CC,GA1CDA,SAAAA,OAAOC,IAAY,EAAEC,OAA0C,EAAEC,QAA0B;;QACzFA,WAAW,OAAOD,YAAY,aAAaA,UAAUC;QACrDD,UAAU,OAAOA,YAAY,aAAa,CAAC,IAAMA,WAAW,CAAC;QAE7D,IAAI,OAAOC,aAAa,YAAY;YAClC,IAAI;gBACF,IAAMC,iBAAiBN,aAAI,CAACO,SAAS,CAAC,IAAI,CAACP,IAAI;gBAC/C,IAAMQ,WAAWR,aAAI,CAACS,IAAI,CAACN,MAAMO,IAAAA,oBAAS,EAACJ,gBAAgBF;gBAC3D,IAAIO,qBAAqBX,aAAI,CAACO,SAAS,CAAC,IAAI,CAACK,QAAQ;gBACrD,IAAIC,eAAeb,aAAI,CAACS,IAAI,CAACN,MAAMO,IAAAA,oBAAS,EAACC,oBAAoBP;gBACjE,IAAI,CAACU,IAAAA,mBAAU,EAACH,qBAAqB;oBACnC,IAAMI,mBAAmBf,aAAI,CAACS,IAAI,CAACT,aAAI,CAACgB,OAAO,CAACV,iBAAiB,IAAI,CAACM,QAAQ;oBAC9EC,eAAeb,aAAI,CAACS,IAAI,CAACN,MAAMO,IAAAA,oBAAS,EAACK,kBAAkBX;oBAC3DO,qBAAqBX,aAAI,CAACiB,QAAQ,CAACjB,aAAI,CAACgB,OAAO,CAACR,WAAWK;gBAC7D;gBAEA,IAAMK,QAAQ,IAAIC,gBAAK,CAAC;gBACxB,IAAIf,QAAQgB,KAAK,EAAE;oBACjBF,MAAMG,KAAK,CAAC,SAAChB;wBACXiB,IAAAA,kBAAE,EAACd,UAAU,SAACe;4BACZA,OAAOA,IAAIC,IAAI,KAAK,WAAWnB,SAASkB,OAAOlB;wBACjD;oBACF;gBACF;gBACAa,MAAMG,KAAK,CAACI,sBAAM,CAACC,IAAI,CAAC,MAAM1B,aAAI,CAACgB,OAAO,CAACR;gBAC3C,IAAIpB,WAAW8B,MAAMG,KAAK,CAACM,uBAAY,CAACD,IAAI,CAAC,MAAMb,cAAcF,oBAAoBH;qBAChFU,MAAMG,KAAK,CAACO,WAAE,CAACC,OAAO,CAACH,IAAI,CAACE,WAAE,EAAEjB,oBAAoBH;gBACzDU,MAAMG,KAAK,CAACS,wBAAa,CAACJ,IAAI,CAAC,MAAMlB,UAAU,QAAQ,6BAA6B;gBACpFU,MAAMG,KAAK,CAACU,gBAAK,CAACL,IAAI,CAAC,MAAMlB,UAAU,IAAI,EAAEJ;gBAC7Cc,MAAMG,KAAK,CAACW,gBAAK,CAACN,IAAI,CAAC,MAAMlB,UAAU,IAAI,EAAEJ;gBAC7Cc,MAAMG,KAAK,CAACY,kBAAO,CAACP,IAAI,CAAC,MAAMlB,UAAU,IAAI,EAAEJ;gBAC/Cc,MAAMgB,KAAK,CAAC7B;gBACZ;YACF,EAAE,OAAOkB,KAAK;gBACZlB,SAASkB;gBACT;YACF;QACF;QAEA,OAAO,IAAIY,QAAQ,SAACC,SAASC;YAC3B,MAAKnC,MAAM,CAACC,MAAMC,SAAS,SAACmB,KAAae;uBAAoBf,MAAMc,OAAOd,OAAOa,QAAQE;;QAC3F;IACF;IAEAC,OAAAA,OAAY,GAAZA,SAAAA,WAAW;WA9DQpD"}
+{"version":3,"sources":["/Users/kevin/Dev/OpenSource/iterators/extract-base-iterator/src/SymbolicLinkEntry.ts"],"sourcesContent":["import fs from 'fs';\nimport { rm } from 'fs-remove-compat';\nimport isAbsolute from 'is-absolute';\nimport mkdirp from 'mkdirp-classic';\nimport path from 'path';\nimport Queue from 'queue-cb';\nimport chmod from './fs/chmod.ts';\nimport chown from './fs/chown.ts';\nimport lutimes from './fs/lutimes.ts';\nimport symlinkWin32 from './fs/symlinkWin32.ts';\nimport { objectAssign } from './shared/index.ts';\nimport stripPath from './shared/stripPath.ts';\nimport validateAttributes from './validateAttributes.ts';\nimport waitForAccess from './waitForAccess.ts';\n\nconst isWindows = process.platform === 'win32' || /^(msys|cygwin)$/.test(process.env.OSTYPE);\n\nconst MANDATORY_ATTRIBUTES = ['mode', 'mtime', 'path', 'linkpath'];\n\nimport type { Mode } from 'fs';\nimport type { ExtractOptions, LinkAttributes, NoParamCallback } from './types.ts';\n\nexport default class SymbolicLinkEntry {\n  mode: Mode;\n  mtime: number;\n  path: string;\n  linkpath: string;\n  basename: string;\n  type: string;\n\n  constructor(attributes: LinkAttributes) {\n    validateAttributes(attributes, MANDATORY_ATTRIBUTES);\n    objectAssign(this, attributes);\n    if (this.basename === undefined) this.basename = path.basename(this.path);\n    if (this.type === undefined) this.type = 'symlink';\n  }\n\n  create(dest: string, callback: NoParamCallback): void;\n  create(dest: string, options: ExtractOptions, callback: NoParamCallback): void;\n  create(dest: string, options?: ExtractOptions): Promise<boolean>;\n  create(dest: string, options?: ExtractOptions | NoParamCallback, callback?: NoParamCallback): void | Promise<boolean> {\n    callback = typeof options === 'function' ? options : callback;\n    options = typeof options === 'function' ? {} : ((options || {}) as ExtractOptions);\n\n    if (typeof callback === 'function') {\n      try {\n        const normalizedPath = path.normalize(this.path);\n        const fullPath = path.join(dest, stripPath(normalizedPath, options));\n        let normalizedLinkpath = path.normalize(this.linkpath);\n        let linkFullPath = path.join(dest, stripPath(normalizedLinkpath, options));\n        if (!isAbsolute(normalizedLinkpath)) {\n          const linkRelativePath = path.join(path.dirname(normalizedPath), this.linkpath);\n          linkFullPath = path.join(dest, stripPath(linkRelativePath, options));\n          normalizedLinkpath = path.relative(path.dirname(fullPath), linkFullPath);\n        }\n\n        const queue = new Queue(1);\n        if (options.force) {\n          queue.defer((callback) => {\n            rm(fullPath, (err) => {\n              err && err.code !== 'ENOENT' ? callback(err) : callback();\n            });\n          });\n        }\n        queue.defer(mkdirp.bind(null, path.dirname(fullPath)));\n        if (isWindows) queue.defer(symlinkWin32.bind(null, linkFullPath, normalizedLinkpath, fullPath));\n        else queue.defer(fs.symlink.bind(fs, normalizedLinkpath, fullPath));\n        queue.defer(waitForAccess.bind(null, fullPath, true)); // noFollow=true for symlinks\n        queue.defer(chmod.bind(null, fullPath, this, options));\n        queue.defer(chown.bind(null, fullPath, this, options));\n        queue.defer(lutimes.bind(null, fullPath, this, options));\n        queue.await(callback);\n      } catch (err) {\n        callback(err);\n      }\n      return;\n    }\n\n    return new Promise((resolve, reject) => this.create(dest, options, (err?: Error, done?: boolean) => (err ? reject(err) : resolve(done))));\n  }\n\n  destroy() {}\n}\n"],"names":["SymbolicLinkEntry","isWindows","process","platform","test","env","OSTYPE","MANDATORY_ATTRIBUTES","attributes","validateAttributes","objectAssign","basename","undefined","path","type","create","dest","options","callback","normalizedPath","normalize","fullPath","join","stripPath","normalizedLinkpath","linkpath","linkFullPath","isAbsolute","linkRelativePath","dirname","relative","queue","Queue","force","defer","rm","err","code","mkdirp","bind","symlinkWin32","fs","symlink","waitForAccess","chmod","chown","lutimes","await","Promise","resolve","reject","done","destroy"],"mappings":";;;;;;;eAsBqBA;;;yDAtBN;8BACI;iEACI;oEACJ;2DACF;8DACC;8DACA;8DACA;gEACE;qEACK;uBACI;kEACP;2EACS;sEACL;;;;;;;;;;;AAE1B,IAAMC,YAAYC,QAAQC,QAAQ,KAAK,WAAW,kBAAkBC,IAAI,CAACF,QAAQG,GAAG,CAACC,MAAM;AAE3F,IAAMC,uBAAuB;IAAC;IAAQ;IAAS;IAAQ;CAAW;AAKnD,IAAA,AAAMP,kCAAN;;aAAMA,kBAQPQ,UAA0B;gCARnBR;QASjBS,IAAAA,6BAAkB,EAACD,YAAYD;QAC/BG,IAAAA,qBAAY,EAAC,IAAI,EAAEF;QACnB,IAAI,IAAI,CAACG,QAAQ,KAAKC,WAAW,IAAI,CAACD,QAAQ,GAAGE,aAAI,CAACF,QAAQ,CAAC,IAAI,CAACE,IAAI;QACxE,IAAI,IAAI,CAACC,IAAI,KAAKF,WAAW,IAAI,CAACE,IAAI,GAAG;;iBAZxBd;IAkBnBe,OAAAA,MAuCC,GAvCDA,SAAAA,OAAOC,IAAY,EAAEC,OAA0C,EAAEC,QAA0B;;QACzFA,WAAW,OAAOD,YAAY,aAAaA,UAAUC;QACrDD,UAAU,OAAOA,YAAY,aAAa,CAAC,IAAMA,WAAW,CAAC;QAE7D,IAAI,OAAOC,aAAa,YAAY;YAClC,IAAI;gBACF,IAAMC,iBAAiBN,aAAI,CAACO,SAAS,CAAC,IAAI,CAACP,IAAI;gBAC/C,IAAMQ,WAAWR,aAAI,CAACS,IAAI,CAACN,MAAMO,IAAAA,oBAAS,EAACJ,gBAAgBF;gBAC3D,IAAIO,qBAAqBX,aAAI,CAACO,SAAS,CAAC,IAAI,CAACK,QAAQ;gBACrD,IAAIC,eAAeb,aAAI,CAACS,IAAI,CAACN,MAAMO,IAAAA,oBAAS,EAACC,oBAAoBP;gBACjE,IAAI,CAACU,IAAAA,mBAAU,EAACH,qBAAqB;oBACnC,IAAMI,mBAAmBf,aAAI,CAACS,IAAI,CAACT,aAAI,CAACgB,OAAO,CAACV,iBAAiB,IAAI,CAACM,QAAQ;oBAC9EC,eAAeb,aAAI,CAACS,IAAI,CAACN,MAAMO,IAAAA,oBAAS,EAACK,kBAAkBX;oBAC3DO,qBAAqBX,aAAI,CAACiB,QAAQ,CAACjB,aAAI,CAACgB,OAAO,CAACR,WAAWK;gBAC7D;gBAEA,IAAMK,QAAQ,IAAIC,gBAAK,CAAC;gBACxB,IAAIf,QAAQgB,KAAK,EAAE;oBACjBF,MAAMG,KAAK,CAAC,SAAChB;wBACXiB,IAAAA,kBAAE,EAACd,UAAU,SAACe;4BACZA,OAAOA,IAAIC,IAAI,KAAK,WAAWnB,SAASkB,OAAOlB;wBACjD;oBACF;gBACF;gBACAa,MAAMG,KAAK,CAACI,sBAAM,CAACC,IAAI,CAAC,MAAM1B,aAAI,CAACgB,OAAO,CAACR;gBAC3C,IAAIpB,WAAW8B,MAAMG,KAAK,CAACM,uBAAY,CAACD,IAAI,CAAC,MAAMb,cAAcF,oBAAoBH;qBAChFU,MAAMG,KAAK,CAACO,WAAE,CAACC,OAAO,CAACH,IAAI,CAACE,WAAE,EAAEjB,oBAAoBH;gBACzDU,MAAMG,KAAK,CAACS,wBAAa,CAACJ,IAAI,CAAC,MAAMlB,UAAU,QAAQ,6BAA6B;gBACpFU,MAAMG,KAAK,CAACU,gBAAK,CAACL,IAAI,CAAC,MAAMlB,UAAU,IAAI,EAAEJ;gBAC7Cc,MAAMG,KAAK,CAACW,gBAAK,CAACN,IAAI,CAAC,MAAMlB,UAAU,IAAI,EAAEJ;gBAC7Cc,MAAMG,KAAK,CAACY,kBAAO,CAACP,IAAI,CAAC,MAAMlB,UAAU,IAAI,EAAEJ;gBAC/Cc,MAAMgB,KAAK,CAAC7B;YACd,EAAE,OAAOkB,KAAK;gBACZlB,SAASkB;YACX;YACA;QACF;QAEA,OAAO,IAAIY,QAAQ,SAACC,SAASC;mBAAW,MAAKnC,MAAM,CAACC,MAAMC,SAAS,SAACmB,KAAae;uBAAoBf,MAAMc,OAAOd,OAAOa,QAAQE;;;IACnI;IAEAC,OAAAA,OAAY,GAAZA,SAAAA,WAAW;WA3DQpD"}

package/dist/cjs/shared/compat.js

@@ -104,15 +104,21 @@ var MAX_SAFE_BUFFER_LENGTH = 256 * 1024 * 1024; // 256MB
 var DETECTED_MAX_LENGTH = null;
 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
-    // but may not exist at runtime on very old Node
+    // kMaxLength may not exist at runtime on very old or very new Node
+    // Modern Node (v8+) doesn't expose kMaxLength but allows large buffers
     var maxLen = Buffer.kMaxLength;
     if (maxLen !== undefined) {
         DETECTED_MAX_LENGTH = maxLen;
     } else {
-        // Older Node - use conservative estimate
-        DETECTED_MAX_LENGTH = 0x3fffffff; // ~1073MB
+        // Node 0.8-4.x: use conservative limit
+        // Node 8+: can allocate up to ~2GB (v8 array buffer limit)
+        // Use the higher limit for modern Node
+        var nodeVersion = parseInt(process.version.slice(1).split('.')[0], 10);
+        if (nodeVersion >= 8) {
+            DETECTED_MAX_LENGTH = Number.MAX_SAFE_INTEGER; // Effectively unlimited
+        } else {
+            DETECTED_MAX_LENGTH = 0x3fffffff; // ~1073MB for older Node
+        }
     }
     return DETECTED_MAX_LENGTH;
 }

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 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"}
+{"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  // kMaxLength may not exist at runtime on very old or very new Node\n  // Modern Node (v8+) doesn't expose kMaxLength but allows large buffers\n  const maxLen = (Buffer as { kMaxLength?: number }).kMaxLength;\n  if (maxLen !== undefined) {\n    DETECTED_MAX_LENGTH = maxLen;\n  } else {\n    // Node 0.8-4.x: use conservative limit\n    // Node 8+: can allocate up to ~2GB (v8 array buffer limit)\n    // Use the higher limit for modern Node\n    const nodeVersion = parseInt(process.version.slice(1).split('.')[0], 10);\n    if (nodeVersion >= 8) {\n      DETECTED_MAX_LENGTH = Number.MAX_SAFE_INTEGER; // Effectively unlimited\n    } else {\n      DETECTED_MAX_LENGTH = 0x3fffffff; // ~1073MB for older Node\n    }\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","nodeVersion","parseInt","process","version","slice","split","Number","MAX_SAFE_INTEGER","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","versions","node"],"mappings":"AAAA;;;;;;;;;;;;CAYC,GAED,qDAAqD;;;;;;;;;;;;QAiBxCA;eAAAA;;QAqcAC;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;;;6DApQG;;;;;;;;;;;;;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,mEAAmE;IACnE,uEAAuE;IACvE,IAAME,SAAS,AAACT,OAAmCU,UAAU;IAC7D,IAAID,WAAWE,WAAW;QACxBJ,sBAAsBE;IACxB,OAAO;QACL,uCAAuC;QACvC,2DAA2D;QAC3D,uCAAuC;QACvC,IAAMG,cAAcC,SAASC,QAAQC,OAAO,CAACC,KAAK,CAAC,GAAGC,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE;QACrE,IAAIL,eAAe,GAAG;YACpBL,sBAAsBW,OAAOC,gBAAgB,EAAE,wBAAwB;QACzE,OAAO;YACLZ,sBAAsB,YAAY,yBAAyB;QAC7D;IACF;IAEA,OAAOA;AACT;AAMO,SAASnB,sBAAsBgC,IAAY;IAChD,OAAOA,QAAQ,KAAKA,QAAQ5C;AAC9B;AAEA;;CAEC,GACD,SAAS6C,YAAYD,IAAY,EAAEE,QAAiB;IAClD,IAAIvB,gBAAgB;QAClB,OAAOC,OAAOC,KAAK,CAACmB;IACtB;IACA,IAAMG,MAAM,IAAIvB,OAAOoB;IACvB,IAAIE,UAAUC,IAAIC,IAAI,CAAC;IACvB,OAAOD;AACT;AAEA;;;;CAIC,GACD,SAASE,uBAAuBC,OAAiB;IAC/C,IAAMC,YAAYnB;IAElB,uBAAuB;IACvB,IAAIoB,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,OAAO5C;IACnC,IAAMgE,SAAmB,EAAE;IAE3B,8DAA8D;IAC9D,IAAK,IAAIX,IAAI,GAAGA,IAAIS,WAAWT,IAAK;QAClC,IAAMY,YAAYT,KAAKU,GAAG,CAAClE,wBAAwB4C,OAAOS,IAAIrD;QAC9DgE,OAAOG,IAAI,CAACtB,YAAYoB,WAAWnB;IACrC;IAEA,wDAAwD;IACxD,OAAOG,uBAAuBe;AAChC;AAQO,SAAS3D,YAAYuC,IAAY;IACtC,IAAIA,SAAS,GAAG;QACd,OAAO,IAAIpB,OAAO;IACpB;IAEA,qDAAqD;IACrD,IAAIZ,sBAAsBgC,OAAO;QAC/B,IAAIrB,gBAAgB;YAClB,OAAOC,OAAOC,KAAK,CAACmB;QACtB;QACA,iEAAiE;QACjE,IAAMG,MAAM,IAAIvB,OAAOoB;QACvBG,IAAIC,IAAI,CAAC;QACT,OAAOD;IACT;IAEA,wDAAwD;IACxD,OAAOc,iBAAiBjB,MAAM;AAChC;AAWO,SAAStC,kBAAkBsC,IAAY;IAC5C,IAAIA,SAAS,GAAG;QACd,OAAO,IAAIpB,OAAO;IACpB;IAEA,qDAAqD;IACrD,IAAIZ,sBAAsBgC,OAAO;QAC/B,IAAIlB,sBAAsB;YACxB,OAAOF,OAAOG,WAAW,CAACiB;QAC5B;QACA,OAAO,IAAIpB,OAAOoB;IACpB;IAEA,2DAA2D;IAC3D,OAAOiB,iBAAiBjB,MAAM;AAChC;AAQO,SAASlC,WAAW0D,IAA6C,EAAEC,QAAyB;IACjG,IAAIzC,eAAe;QACjB,IAAI,OAAOwC,SAAS,UAAU;YAC5B,OAAO5C,OAAOK,IAAI,CAACuC,MAAMC;QAC3B;QACA,OAAO7C,OAAOK,IAAI,CAACuC;IACrB;IACA,yDAAyD;IACzD,gFAAgF;IAChF,IAAIA,AAAI,YAAJA,MAAgBtC,eAAc,CAAEsC,AAAI,YAAJA,MAAgB5C,SAAS;QAC3D,IAAM8C,MAAgB,EAAE;QACxB,IAAK,IAAIjB,IAAI,GAAGA,IAAIe,KAAKd,MAAM,EAAED,IAAK;YACpCiB,IAAIH,IAAI,CAACC,IAAI,CAACf,EAAE;QAClB;QACA,OAAO,IAAI7B,OAAO8C;IACpB;IACA,OAAO,IAAI9C,OAAO4C,MAA2BC;AAC/C;AAOO,SAAS9D,cAAcgE,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,SAAStE,aAAasC,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,SAAS1C,gBAAgBoC,GAAW,EAAEqC,KAAa,EAAEC,GAAW;IACrE,IAAM3B,SAASrD,YAAYgF,MAAMD;IACjCrC,IAAIa,IAAI,CAACF,QAAQ,GAAG0B,OAAOC;IAC3B,OAAO3B;AACT;AASO,SAASzC,aAAa8B,GAAW,EAAEY,MAAc;IACtD,IAAM2B,MAAMvC,IAAIwC,YAAY,CAAC5B;IAC7B,IAAM6B,OAAOzC,IAAIwC,YAAY,CAAC5B,SAAS;IACvC,OAAO6B,OAAO,cAAcF;AAC9B;AAMO,SAASpE,cAAc6B,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,SAASnD,aAAamF,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,gBAAgBzD,YAAYyD,cAAcC;IAE/D,oBAAoB;IACpB,IAAIF,KAAKrC,MAAM,KAAK,GAAG;QACrB,OAAO,IAAI9B,OAAO;IACpB;IAEA,mEAAmE;IACnE,sDAAsD;IACtD,IAAIsE,gBAAgB9F,wBAAwB;QAC1C,iEAAiE;QACjE,4DAA4D;QAC5D,IAAI+F,aAAa;QACjB,IAAK,IAAIC,IAAI,GAAGA,IAAIL,KAAKrC,MAAM,EAAE0C,IAAK;YACpC,IAAI,CAAEL,AAAO,YAAPA,IAAI,CAACK,EAAE,EAAYxE,SAAS;gBAChCuE,aAAa;gBACb;YACF;QACF;QACA,IAAIA,cAAcD,gBAAgBD,cAAc;YAC9C,OAAOrE,OAAOyE,MAAM,CAACN,MAAkBG;QACzC;IACF;IAEA,4DAA4D;IAC5D,mEAAmE;IACnE,IAAMpC,SAASrD,YAAYyF;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,KAAevB,SAAQ;YACzBuB,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,SAAS3C,MAAM0E,KAAa;IACjC,gEAAgE;IAChE,OAAOA,UAAUA;AACnB;AAEA;;;;;;;;CAQC,GACD,iEAAiE;AACjE,IAAIY,OAAqC;AACzC,IAAI;IACFA,OAAOlF,SAAS;AAClB,EAAE,OAAOmF,IAAI;AACX,mDAAmD;AACrD;AACA,IAAMC,sBAAsBF,SAAS,QAAQ,OAAOA,KAAKG,cAAc,KAAK;AAErE,SAAS1F,WAAW2F,KAAa;IACtC,IAAIF,uBAAuBF,MAAM;QAC/B,OAAOA,KAAKG,cAAc,CAACC;IAC7B;IACA,qCAAqC;IACrC,IAAMC,OAAOvF,SAAS;IACtB,OAAOT,WAAWgG,KAAK5F,UAAU,CAAC2F;AACpC;AAEA;;;;;;;;CAQC,GACD,0EAA0E;AAC1E,2FAA2F;AAC3F,IAAME,4BAA4BN,SAAS,QAAQ,OAAO,AAACA,KAAaO,gBAAgB,KAAK;AAEtF,SAAS/F;IACd,IAAI8F,6BAA6BN,MAAM;QACrC,sCAAsC;QACtC,2FAA2F;QAC3F,OAAO,AAACA,KAAaO,gBAAgB;IACvC;IAEA,qDAAqD;IACrD,iDAAiD;IACjD,IAAMzG,YAAYgB,SAAS,mBAAmBhB,SAAS;IACvD,IAAMuG,OAAOvF,SAAS;IAEtB,IAAM0F,UAAU,IAAIH,KAAKI,OAAO,CAAC;QAAEC,KAAK;QAAM9C,WAAW;IAAM;IAC/D,IAAM+C,YAAY,IAAI7G;IACtB,IAAM8G,gBAA0B,EAAE;IAClC,IAAIC,QAAQ;IAEZ,gDAAgD;IAChDL,QAAQM,MAAM,GAAG,SAACC;QAChBH,cAAc9C,IAAI,CAACzD,WAAW0G;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,IAAIrC,WAAW,IAAI,OAAO,aAAa;YACpD,yCAAyC;YACzC,MAAOmF,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,SAASpH,aAAmBwD,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,CAACjG,QAAQkG,QAAQ,CAACC,IAAI,CAAChG,KAAK,CAAC,IAAI,CAAC,EAAE;AAC3C,IAAMvC,WAA6CqI,QAAQ,IAAIpH,SAAS,UAAUjB,QAAQ,GAAGiB,SAAS,mBAAmBjB,QAAQ;AACjI,IAAME,WAA6CmI,QAAQ,IAAIpH,SAAS,UAAUf,QAAQ,GAAGe,SAAS,mBAAmBf,QAAQ;AACjI,IAAMD,YAA+CoI,QAAQ,IAAIpH,SAAS,UAAUhB,SAAS,GAAGgB,SAAS,mBAAmBhB,SAAS;AACrI,IAAMF,cAAmDsI,QAAQ,IAAIpH,SAAS,UAAUlB,WAAW,GAAGkB,SAAS,mBAAmBlB,WAAW"}

package/dist/esm/DirectoryEntry.js

@@ -29,15 +29,12 @@ let DirectoryEntry = class DirectoryEntry {
                 queue.defer(chown.bind(null, fullPath, this, options));
                 queue.defer(utimes.bind(null, fullPath, this, options));
                 queue.await(callback);
-                return;
             } catch (err) {
                 callback(err);
-                return;
             }
+            return;
         }
-        return new Promise((resolve, reject)=>{
-            this.create(dest, options, (err, done)=>err ? reject(err) : resolve(done));
-        });
+        return new Promise((resolve, reject)=>this.create(dest, options, (err, done)=>err ? reject(err) : resolve(done)));
     }
     destroy() {}
     constructor(attributes){

package/dist/esm/DirectoryEntry.js.map

@@ -1 +1 @@
-{"version":3,"sources":["/Users/kevin/Dev/OpenSource/iterators/extract-base-iterator/src/DirectoryEntry.ts"],"sourcesContent":["import mkdirp from 'mkdirp-classic';\nimport path from 'path';\nimport Queue from 'queue-cb';\nimport chmod from './fs/chmod.ts';\nimport chown from './fs/chown.ts';\nimport utimes from './fs/utimes.ts';\nimport { objectAssign } from './shared/index.ts';\nimport stripPath from './shared/stripPath.ts';\nimport validateAttributes from './validateAttributes.ts';\nimport waitForAccess from './waitForAccess.ts';\n\nconst MANDATORY_ATTRIBUTES = ['mode', 'mtime', 'path'];\n\nimport type { Mode } from 'fs';\nimport type { DirectoryAttributes, ExtractOptions, NoParamCallback } from './types.ts';\n\nexport default class DirectoryEntry {\n  mode: Mode;\n  mtime: number;\n  path: string;\n  basename: string;\n  type: string;\n\n  constructor(attributes: DirectoryAttributes) {\n    validateAttributes(attributes, MANDATORY_ATTRIBUTES);\n    objectAssign(this, attributes);\n    if (this.type === undefined) this.type = 'directory';\n    if (this.basename === undefined) this.basename = path.basename(this.path);\n  }\n\n  create(dest: string, callback: NoParamCallback): void;\n  create(dest: string, options: ExtractOptions, callback: NoParamCallback): void;\n  create(dest: string, options?: ExtractOptions): Promise<boolean>;\n  create(dest: string, options?: ExtractOptions | NoParamCallback, callback?: NoParamCallback): void | Promise<boolean> {\n    callback = typeof options === 'function' ? options : callback;\n    options = typeof options === 'function' ? {} : ((options || {}) as ExtractOptions);\n\n    if (typeof callback === 'function') {\n      try {\n        const normalizedPath = path.normalize(this.path);\n        const fullPath = path.join(dest, stripPath(normalizedPath, options));\n\n        // do not check for the existence of the directory but allow out-of-order calling\n        const queue = new Queue(1);\n        queue.defer(mkdirp.bind(null, fullPath));\n        queue.defer(waitForAccess.bind(null, fullPath));\n        queue.defer(chmod.bind(null, fullPath, this, options));\n        queue.defer(chown.bind(null, fullPath, this, options));\n        queue.defer(utimes.bind(null, fullPath, this, options));\n        queue.await(callback);\n        return;\n      } catch (err) {\n        callback(err);\n        return;\n      }\n    }\n\n    return new Promise((resolve, reject) => {\n      this.create(dest, options, (err?: Error, done?: boolean) => (err ? reject(err) : resolve(done)));\n    });\n  }\n\n  destroy() {}\n}\n"],"names":["mkdirp","path","Queue","chmod","chown","utimes","objectAssign","stripPath","validateAttributes","waitForAccess","MANDATORY_ATTRIBUTES","DirectoryEntry","create","dest","options","callback","normalizedPath","normalize","fullPath","join","queue","defer","bind","await","err","Promise","resolve","reject","done","destroy","attributes","type","undefined","basename"],"mappings":"AAAA,OAAOA,YAAY,iBAAiB;AACpC,OAAOC,UAAU,OAAO;AACxB,OAAOC,WAAW,WAAW;AAC7B,OAAOC,WAAW,gBAAgB;AAClC,OAAOC,WAAW,gBAAgB;AAClC,OAAOC,YAAY,iBAAiB;AACpC,SAASC,YAAY,QAAQ,oBAAoB;AACjD,OAAOC,eAAe,wBAAwB;AAC9C,OAAOC,wBAAwB,0BAA0B;AACzD,OAAOC,mBAAmB,qBAAqB;AAE/C,MAAMC,uBAAuB;IAAC;IAAQ;IAAS;CAAO;AAKvC,IAAA,AAAMC,iBAAN,MAAMA;IAiBnBC,OAAOC,IAAY,EAAEC,OAA0C,EAAEC,QAA0B,EAA2B;QACpHA,WAAW,OAAOD,YAAY,aAAaA,UAAUC;QACrDD,UAAU,OAAOA,YAAY,aAAa,CAAC,IAAMA,WAAW,CAAC;QAE7D,IAAI,OAAOC,aAAa,YAAY;YAClC,IAAI;gBACF,MAAMC,iBAAiBf,KAAKgB,SAAS,CAAC,IAAI,CAAChB,IAAI;gBAC/C,MAAMiB,WAAWjB,KAAKkB,IAAI,CAACN,MAAMN,UAAUS,gBAAgBF;gBAE3D,iFAAiF;gBACjF,MAAMM,QAAQ,IAAIlB,MAAM;gBACxBkB,MAAMC,KAAK,CAACrB,OAAOsB,IAAI,CAAC,MAAMJ;gBAC9BE,MAAMC,KAAK,CAACZ,cAAca,IAAI,CAAC,MAAMJ;gBACrCE,MAAMC,KAAK,CAAClB,MAAMmB,IAAI,CAAC,MAAMJ,UAAU,IAAI,EAAEJ;gBAC7CM,MAAMC,KAAK,CAACjB,MAAMkB,IAAI,CAAC,MAAMJ,UAAU,IAAI,EAAEJ;gBAC7CM,MAAMC,KAAK,CAAChB,OAAOiB,IAAI,CAAC,MAAMJ,UAAU,IAAI,EAAEJ;gBAC9CM,MAAMG,KAAK,CAACR;gBACZ;YACF,EAAE,OAAOS,KAAK;gBACZT,SAASS;gBACT;YACF;QACF;QAEA,OAAO,IAAIC,QAAQ,CAACC,SAASC;YAC3B,IAAI,CAACf,MAAM,CAACC,MAAMC,SAAS,CAACU,KAAaI,OAAoBJ,MAAMG,OAAOH,OAAOE,QAAQE;QAC3F;IACF;IAEAC,UAAU,CAAC;IAvCX,YAAYC,UAA+B,CAAE;QAC3CtB,mBAAmBsB,YAAYpB;QAC/BJ,aAAa,IAAI,EAAEwB;QACnB,IAAI,IAAI,CAACC,IAAI,KAAKC,WAAW,IAAI,CAACD,IAAI,GAAG;QACzC,IAAI,IAAI,CAACE,QAAQ,KAAKD,WAAW,IAAI,CAACC,QAAQ,GAAGhC,KAAKgC,QAAQ,CAAC,IAAI,CAAChC,IAAI;IAC1E;AAmCF;AA/CA,SAAqBU,4BA+CpB"}
+{"version":3,"sources":["/Users/kevin/Dev/OpenSource/iterators/extract-base-iterator/src/DirectoryEntry.ts"],"sourcesContent":["import mkdirp from 'mkdirp-classic';\nimport path from 'path';\nimport Queue from 'queue-cb';\nimport chmod from './fs/chmod.ts';\nimport chown from './fs/chown.ts';\nimport utimes from './fs/utimes.ts';\nimport { objectAssign } from './shared/index.ts';\nimport stripPath from './shared/stripPath.ts';\nimport validateAttributes from './validateAttributes.ts';\nimport waitForAccess from './waitForAccess.ts';\n\nconst MANDATORY_ATTRIBUTES = ['mode', 'mtime', 'path'];\n\nimport type { Mode } from 'fs';\nimport type { DirectoryAttributes, ExtractOptions, NoParamCallback } from './types.ts';\n\nexport default class DirectoryEntry {\n  mode: Mode;\n  mtime: number;\n  path: string;\n  basename: string;\n  type: string;\n\n  constructor(attributes: DirectoryAttributes) {\n    validateAttributes(attributes, MANDATORY_ATTRIBUTES);\n    objectAssign(this, attributes);\n    if (this.type === undefined) this.type = 'directory';\n    if (this.basename === undefined) this.basename = path.basename(this.path);\n  }\n\n  create(dest: string, callback: NoParamCallback): void;\n  create(dest: string, options: ExtractOptions, callback: NoParamCallback): void;\n  create(dest: string, options?: ExtractOptions): Promise<boolean>;\n  create(dest: string, options?: ExtractOptions | NoParamCallback, callback?: NoParamCallback): void | Promise<boolean> {\n    callback = typeof options === 'function' ? options : callback;\n    options = typeof options === 'function' ? {} : ((options || {}) as ExtractOptions);\n\n    if (typeof callback === 'function') {\n      try {\n        const normalizedPath = path.normalize(this.path);\n        const fullPath = path.join(dest, stripPath(normalizedPath, options));\n\n        // do not check for the existence of the directory but allow out-of-order calling\n        const queue = new Queue(1);\n        queue.defer(mkdirp.bind(null, fullPath));\n        queue.defer(waitForAccess.bind(null, fullPath));\n        queue.defer(chmod.bind(null, fullPath, this, options));\n        queue.defer(chown.bind(null, fullPath, this, options));\n        queue.defer(utimes.bind(null, fullPath, this, options));\n        queue.await(callback);\n      } catch (err) {\n        callback(err);\n      }\n      return;\n    }\n\n    return new Promise((resolve, reject) => this.create(dest, options, (err?: Error, done?: boolean) => (err ? reject(err) : resolve(done))));\n  }\n\n  destroy() {}\n}\n"],"names":["mkdirp","path","Queue","chmod","chown","utimes","objectAssign","stripPath","validateAttributes","waitForAccess","MANDATORY_ATTRIBUTES","DirectoryEntry","create","dest","options","callback","normalizedPath","normalize","fullPath","join","queue","defer","bind","await","err","Promise","resolve","reject","done","destroy","attributes","type","undefined","basename"],"mappings":"AAAA,OAAOA,YAAY,iBAAiB;AACpC,OAAOC,UAAU,OAAO;AACxB,OAAOC,WAAW,WAAW;AAC7B,OAAOC,WAAW,gBAAgB;AAClC,OAAOC,WAAW,gBAAgB;AAClC,OAAOC,YAAY,iBAAiB;AACpC,SAASC,YAAY,QAAQ,oBAAoB;AACjD,OAAOC,eAAe,wBAAwB;AAC9C,OAAOC,wBAAwB,0BAA0B;AACzD,OAAOC,mBAAmB,qBAAqB;AAE/C,MAAMC,uBAAuB;IAAC;IAAQ;IAAS;CAAO;AAKvC,IAAA,AAAMC,iBAAN,MAAMA;IAiBnBC,OAAOC,IAAY,EAAEC,OAA0C,EAAEC,QAA0B,EAA2B;QACpHA,WAAW,OAAOD,YAAY,aAAaA,UAAUC;QACrDD,UAAU,OAAOA,YAAY,aAAa,CAAC,IAAMA,WAAW,CAAC;QAE7D,IAAI,OAAOC,aAAa,YAAY;YAClC,IAAI;gBACF,MAAMC,iBAAiBf,KAAKgB,SAAS,CAAC,IAAI,CAAChB,IAAI;gBAC/C,MAAMiB,WAAWjB,KAAKkB,IAAI,CAACN,MAAMN,UAAUS,gBAAgBF;gBAE3D,iFAAiF;gBACjF,MAAMM,QAAQ,IAAIlB,MAAM;gBACxBkB,MAAMC,KAAK,CAACrB,OAAOsB,IAAI,CAAC,MAAMJ;gBAC9BE,MAAMC,KAAK,CAACZ,cAAca,IAAI,CAAC,MAAMJ;gBACrCE,MAAMC,KAAK,CAAClB,MAAMmB,IAAI,CAAC,MAAMJ,UAAU,IAAI,EAAEJ;gBAC7CM,MAAMC,KAAK,CAACjB,MAAMkB,IAAI,CAAC,MAAMJ,UAAU,IAAI,EAAEJ;gBAC7CM,MAAMC,KAAK,CAAChB,OAAOiB,IAAI,CAAC,MAAMJ,UAAU,IAAI,EAAEJ;gBAC9CM,MAAMG,KAAK,CAACR;YACd,EAAE,OAAOS,KAAK;gBACZT,SAASS;YACX;YACA;QACF;QAEA,OAAO,IAAIC,QAAQ,CAACC,SAASC,SAAW,IAAI,CAACf,MAAM,CAACC,MAAMC,SAAS,CAACU,KAAaI,OAAoBJ,MAAMG,OAAOH,OAAOE,QAAQE;IACnI;IAEAC,UAAU,CAAC;IApCX,YAAYC,UAA+B,CAAE;QAC3CtB,mBAAmBsB,YAAYpB;QAC/BJ,aAAa,IAAI,EAAEwB;QACnB,IAAI,IAAI,CAACC,IAAI,KAAKC,WAAW,IAAI,CAACD,IAAI,GAAG;QACzC,IAAI,IAAI,CAACE,QAAQ,KAAKD,WAAW,IAAI,CAACC,QAAQ,GAAGhC,KAAKgC,QAAQ,CAAC,IAAI,CAAChC,IAAI;IAC1E;AAgCF;AA5CA,SAAqBU,4BA4CpB"}

package/dist/esm/FileEntry.js

@@ -54,15 +54,12 @@ let FileEntry = class FileEntry {
                 queue.defer(chown.bind(null, fullPath, this, options));
                 queue.defer(utimes.bind(null, fullPath, this, options));
                 queue.await(callback);
-                return;
             } catch (err) {
                 callback(err);
-                return;
             }
+            return;
         }
-        return new Promise((resolve, reject)=>{
-            this.create(dest, options, (err, done)=>err ? reject(err) : resolve(done));
-        });
+        return new Promise((resolve, reject)=>this.create(dest, options, (err, done)=>err ? reject(err) : resolve(done)));
     }
     destroy() {}
     constructor(attributes){

package/dist/esm/FileEntry.js.map

@@ -1 +1 @@
-{"version":3,"sources":["/Users/kevin/Dev/OpenSource/iterators/extract-base-iterator/src/FileEntry.ts"],"sourcesContent":["import { rm } from 'fs-remove-compat';\nimport fs from 'graceful-fs';\nimport mkdirp from 'mkdirp-classic';\nimport path from 'path';\nimport Queue from 'queue-cb';\nimport chmod from './fs/chmod.ts';\nimport chown from './fs/chown.ts';\nimport utimes from './fs/utimes.ts';\nimport { objectAssign } from './shared/index.ts';\nimport stripPath from './shared/stripPath.ts';\nimport validateAttributes from './validateAttributes.ts';\nimport waitForAccess from './waitForAccess.ts';\n\nconst MANDATORY_ATTRIBUTES = ['mode', 'mtime', 'path'];\n\nimport type { Mode } from 'fs';\nimport type { ExtractOptions, FileAttributes, NoParamCallback, WriteFileFn } from './types.ts';\n\ninterface AbstractFileEntry {\n  _writeFile: WriteFileFn;\n}\n\nexport default class FileEntry {\n  mode: Mode;\n  mtime: number;\n  path: string;\n  basename: string;\n  type: string;\n\n  constructor(attributes: FileAttributes) {\n    validateAttributes(attributes, MANDATORY_ATTRIBUTES);\n    objectAssign(this, attributes);\n    if (this.basename === undefined) this.basename = path.basename(this.path);\n    if (this.type === undefined) this.type = 'file';\n    if ((this as unknown as AbstractFileEntry)._writeFile === undefined) throw new Error('File this missing _writeFile. Please implement this method in your subclass');\n  }\n\n  create(dest: string, callback: NoParamCallback): void;\n  create(dest: string, options: ExtractOptions, callback: NoParamCallback): void;\n  create(dest: string, options?: ExtractOptions): Promise<boolean>;\n  create(dest: string, options?: ExtractOptions | NoParamCallback, callback?: NoParamCallback): void | Promise<boolean> {\n    callback = typeof options === 'function' ? options : callback;\n    options = typeof options === 'function' ? {} : ((options || {}) as ExtractOptions);\n\n    if (typeof callback === 'function') {\n      try {\n        const normalizedPath = path.normalize(this.path);\n        const fullPath = path.join(dest, stripPath(normalizedPath, options));\n\n        const queue = new Queue(1);\n        if (options.force) {\n          queue.defer((callback) => {\n            rm(fullPath, (err) => {\n              err && err.code !== 'ENOENT' ? callback(err) : callback();\n            });\n          });\n        } else {\n          // Check if file exists - throw EEXIST if it does\n          queue.defer((callback) => {\n            fs.stat(fullPath, (err) => {\n              if (!err) {\n                const existsErr = new Error(`EEXIST: file already exists, open '${fullPath}'`) as NodeJS.ErrnoException;\n                existsErr.code = 'EEXIST';\n                existsErr.path = fullPath;\n                return callback(existsErr);\n              }\n              // ENOENT means file doesn't exist - that's what we want\n              if (err.code === 'ENOENT') return callback();\n              // Other errors should be reported\n              callback(err);\n            });\n          });\n        }\n        queue.defer(mkdirp.bind(null, path.dirname(fullPath)));\n        queue.defer((this as unknown as AbstractFileEntry)._writeFile.bind(this, fullPath, options));\n        queue.defer(waitForAccess.bind(null, fullPath));\n        queue.defer(chmod.bind(null, fullPath, this, options));\n        queue.defer(chown.bind(null, fullPath, this, options));\n        queue.defer(utimes.bind(null, fullPath, this, options));\n        queue.await(callback);\n        return;\n      } catch (err) {\n        callback(err);\n        return;\n      }\n    }\n\n    return new Promise((resolve, reject) => {\n      this.create(dest, options, (err?: Error, done?: boolean) => (err ? reject(err) : resolve(done)));\n    });\n  }\n\n  destroy() {}\n}\n"],"names":["rm","fs","mkdirp","path","Queue","chmod","chown","utimes","objectAssign","stripPath","validateAttributes","waitForAccess","MANDATORY_ATTRIBUTES","FileEntry","create","dest","options","callback","normalizedPath","normalize","fullPath","join","queue","force","defer","err","code","stat","existsErr","Error","bind","dirname","_writeFile","await","Promise","resolve","reject","done","destroy","attributes","basename","undefined","type"],"mappings":"AAAA,SAASA,EAAE,QAAQ,mBAAmB;AACtC,OAAOC,QAAQ,cAAc;AAC7B,OAAOC,YAAY,iBAAiB;AACpC,OAAOC,UAAU,OAAO;AACxB,OAAOC,WAAW,WAAW;AAC7B,OAAOC,WAAW,gBAAgB;AAClC,OAAOC,WAAW,gBAAgB;AAClC,OAAOC,YAAY,iBAAiB;AACpC,SAASC,YAAY,QAAQ,oBAAoB;AACjD,OAAOC,eAAe,wBAAwB;AAC9C,OAAOC,wBAAwB,0BAA0B;AACzD,OAAOC,mBAAmB,qBAAqB;AAE/C,MAAMC,uBAAuB;IAAC;IAAQ;IAAS;CAAO;AASvC,IAAA,AAAMC,YAAN,MAAMA;IAkBnBC,OAAOC,IAAY,EAAEC,OAA0C,EAAEC,QAA0B,EAA2B;QACpHA,WAAW,OAAOD,YAAY,aAAaA,UAAUC;QACrDD,UAAU,OAAOA,YAAY,aAAa,CAAC,IAAMA,WAAW,CAAC;QAE7D,IAAI,OAAOC,aAAa,YAAY;YAClC,IAAI;gBACF,MAAMC,iBAAiBf,KAAKgB,SAAS,CAAC,IAAI,CAAChB,IAAI;gBAC/C,MAAMiB,WAAWjB,KAAKkB,IAAI,CAACN,MAAMN,UAAUS,gBAAgBF;gBAE3D,MAAMM,QAAQ,IAAIlB,MAAM;gBACxB,IAAIY,QAAQO,KAAK,EAAE;oBACjBD,MAAME,KAAK,CAAC,CAACP;wBACXjB,GAAGoB,UAAU,CAACK;4BACZA,OAAOA,IAAIC,IAAI,KAAK,WAAWT,SAASQ,OAAOR;wBACjD;oBACF;gBACF,OAAO;oBACL,iDAAiD;oBACjDK,MAAME,KAAK,CAAC,CAACP;wBACXhB,GAAG0B,IAAI,CAACP,UAAU,CAACK;4BACjB,IAAI,CAACA,KAAK;gCACR,MAAMG,YAAY,IAAIC,MAAM,CAAC,mCAAmC,EAAET,SAAS,CAAC,CAAC;gCAC7EQ,UAAUF,IAAI,GAAG;gCACjBE,UAAUzB,IAAI,GAAGiB;gCACjB,OAAOH,SAASW;4BAClB;4BACA,wDAAwD;4BACxD,IAAIH,IAAIC,IAAI,KAAK,UAAU,OAAOT;4BAClC,kCAAkC;4BAClCA,SAASQ;wBACX;oBACF;gBACF;gBACAH,MAAME,KAAK,CAACtB,OAAO4B,IAAI,CAAC,MAAM3B,KAAK4B,OAAO,CAACX;gBAC3CE,MAAME,KAAK,CAAC,AAAC,IAAI,CAAkCQ,UAAU,CAACF,IAAI,CAAC,IAAI,EAAEV,UAAUJ;gBACnFM,MAAME,KAAK,CAACb,cAAcmB,IAAI,CAAC,MAAMV;gBACrCE,MAAME,KAAK,CAACnB,MAAMyB,IAAI,CAAC,MAAMV,UAAU,IAAI,EAAEJ;gBAC7CM,MAAME,KAAK,CAAClB,MAAMwB,IAAI,CAAC,MAAMV,UAAU,IAAI,EAAEJ;gBAC7CM,MAAME,KAAK,CAACjB,OAAOuB,IAAI,CAAC,MAAMV,UAAU,IAAI,EAAEJ;gBAC9CM,MAAMW,KAAK,CAAChB;gBACZ;YACF,EAAE,OAAOQ,KAAK;gBACZR,SAASQ;gBACT;YACF;QACF;QAEA,OAAO,IAAIS,QAAQ,CAACC,SAASC;YAC3B,IAAI,CAACtB,MAAM,CAACC,MAAMC,SAAS,CAACS,KAAaY,OAAoBZ,MAAMW,OAAOX,OAAOU,QAAQE;QAC3F;IACF;IAEAC,UAAU,CAAC;IA/DX,YAAYC,UAA0B,CAAE;QACtC7B,mBAAmB6B,YAAY3B;QAC/BJ,aAAa,IAAI,EAAE+B;QACnB,IAAI,IAAI,CAACC,QAAQ,KAAKC,WAAW,IAAI,CAACD,QAAQ,GAAGrC,KAAKqC,QAAQ,CAAC,IAAI,CAACrC,IAAI;QACxE,IAAI,IAAI,CAACuC,IAAI,KAAKD,WAAW,IAAI,CAACC,IAAI,GAAG;QACzC,IAAI,AAAC,IAAI,CAAkCV,UAAU,KAAKS,WAAW,MAAM,IAAIZ,MAAM;IACvF;AA0DF;AAvEA,SAAqBhB,uBAuEpB"}
+{"version":3,"sources":["/Users/kevin/Dev/OpenSource/iterators/extract-base-iterator/src/FileEntry.ts"],"sourcesContent":["import { rm } from 'fs-remove-compat';\nimport fs from 'graceful-fs';\nimport mkdirp from 'mkdirp-classic';\nimport path from 'path';\nimport Queue from 'queue-cb';\nimport chmod from './fs/chmod.ts';\nimport chown from './fs/chown.ts';\nimport utimes from './fs/utimes.ts';\nimport { objectAssign } from './shared/index.ts';\nimport stripPath from './shared/stripPath.ts';\nimport validateAttributes from './validateAttributes.ts';\nimport waitForAccess from './waitForAccess.ts';\n\nconst MANDATORY_ATTRIBUTES = ['mode', 'mtime', 'path'];\n\nimport type { Mode } from 'fs';\nimport type { ExtractOptions, FileAttributes, NoParamCallback, WriteFileFn } from './types.ts';\n\ninterface AbstractFileEntry {\n  _writeFile: WriteFileFn;\n}\n\nexport default class FileEntry {\n  mode: Mode;\n  mtime: number;\n  path: string;\n  basename: string;\n  type: string;\n\n  constructor(attributes: FileAttributes) {\n    validateAttributes(attributes, MANDATORY_ATTRIBUTES);\n    objectAssign(this, attributes);\n    if (this.basename === undefined) this.basename = path.basename(this.path);\n    if (this.type === undefined) this.type = 'file';\n    if ((this as unknown as AbstractFileEntry)._writeFile === undefined) throw new Error('File this missing _writeFile. Please implement this method in your subclass');\n  }\n\n  create(dest: string, callback: NoParamCallback): void;\n  create(dest: string, options: ExtractOptions, callback: NoParamCallback): void;\n  create(dest: string, options?: ExtractOptions): Promise<boolean>;\n  create(dest: string, options?: ExtractOptions | NoParamCallback, callback?: NoParamCallback): void | Promise<boolean> {\n    callback = typeof options === 'function' ? options : callback;\n    options = typeof options === 'function' ? {} : ((options || {}) as ExtractOptions);\n\n    if (typeof callback === 'function') {\n      try {\n        const normalizedPath = path.normalize(this.path);\n        const fullPath = path.join(dest, stripPath(normalizedPath, options));\n\n        const queue = new Queue(1);\n        if (options.force) {\n          queue.defer((callback) => {\n            rm(fullPath, (err) => {\n              err && err.code !== 'ENOENT' ? callback(err) : callback();\n            });\n          });\n        } else {\n          // Check if file exists - throw EEXIST if it does\n          queue.defer((callback) => {\n            fs.stat(fullPath, (err) => {\n              if (!err) {\n                const existsErr = new Error(`EEXIST: file already exists, open '${fullPath}'`) as NodeJS.ErrnoException;\n                existsErr.code = 'EEXIST';\n                existsErr.path = fullPath;\n                return callback(existsErr);\n              }\n              // ENOENT means file doesn't exist - that's what we want\n              if (err.code === 'ENOENT') return callback();\n              // Other errors should be reported\n              callback(err);\n            });\n          });\n        }\n        queue.defer(mkdirp.bind(null, path.dirname(fullPath)));\n        queue.defer((this as unknown as AbstractFileEntry)._writeFile.bind(this, fullPath, options));\n        queue.defer(waitForAccess.bind(null, fullPath));\n        queue.defer(chmod.bind(null, fullPath, this, options));\n        queue.defer(chown.bind(null, fullPath, this, options));\n        queue.defer(utimes.bind(null, fullPath, this, options));\n        queue.await(callback);\n      } catch (err) {\n        callback(err);\n      }\n      return;\n    }\n\n    return new Promise((resolve, reject) => this.create(dest, options, (err?: Error, done?: boolean) => (err ? reject(err) : resolve(done))));\n  }\n\n  destroy() {}\n}\n"],"names":["rm","fs","mkdirp","path","Queue","chmod","chown","utimes","objectAssign","stripPath","validateAttributes","waitForAccess","MANDATORY_ATTRIBUTES","FileEntry","create","dest","options","callback","normalizedPath","normalize","fullPath","join","queue","force","defer","err","code","stat","existsErr","Error","bind","dirname","_writeFile","await","Promise","resolve","reject","done","destroy","attributes","basename","undefined","type"],"mappings":"AAAA,SAASA,EAAE,QAAQ,mBAAmB;AACtC,OAAOC,QAAQ,cAAc;AAC7B,OAAOC,YAAY,iBAAiB;AACpC,OAAOC,UAAU,OAAO;AACxB,OAAOC,WAAW,WAAW;AAC7B,OAAOC,WAAW,gBAAgB;AAClC,OAAOC,WAAW,gBAAgB;AAClC,OAAOC,YAAY,iBAAiB;AACpC,SAASC,YAAY,QAAQ,oBAAoB;AACjD,OAAOC,eAAe,wBAAwB;AAC9C,OAAOC,wBAAwB,0BAA0B;AACzD,OAAOC,mBAAmB,qBAAqB;AAE/C,MAAMC,uBAAuB;IAAC;IAAQ;IAAS;CAAO;AASvC,IAAA,AAAMC,YAAN,MAAMA;IAkBnBC,OAAOC,IAAY,EAAEC,OAA0C,EAAEC,QAA0B,EAA2B;QACpHA,WAAW,OAAOD,YAAY,aAAaA,UAAUC;QACrDD,UAAU,OAAOA,YAAY,aAAa,CAAC,IAAMA,WAAW,CAAC;QAE7D,IAAI,OAAOC,aAAa,YAAY;YAClC,IAAI;gBACF,MAAMC,iBAAiBf,KAAKgB,SAAS,CAAC,IAAI,CAAChB,IAAI;gBAC/C,MAAMiB,WAAWjB,KAAKkB,IAAI,CAACN,MAAMN,UAAUS,gBAAgBF;gBAE3D,MAAMM,QAAQ,IAAIlB,MAAM;gBACxB,IAAIY,QAAQO,KAAK,EAAE;oBACjBD,MAAME,KAAK,CAAC,CAACP;wBACXjB,GAAGoB,UAAU,CAACK;4BACZA,OAAOA,IAAIC,IAAI,KAAK,WAAWT,SAASQ,OAAOR;wBACjD;oBACF;gBACF,OAAO;oBACL,iDAAiD;oBACjDK,MAAME,KAAK,CAAC,CAACP;wBACXhB,GAAG0B,IAAI,CAACP,UAAU,CAACK;4BACjB,IAAI,CAACA,KAAK;gCACR,MAAMG,YAAY,IAAIC,MAAM,CAAC,mCAAmC,EAAET,SAAS,CAAC,CAAC;gCAC7EQ,UAAUF,IAAI,GAAG;gCACjBE,UAAUzB,IAAI,GAAGiB;gCACjB,OAAOH,SAASW;4BAClB;4BACA,wDAAwD;4BACxD,IAAIH,IAAIC,IAAI,KAAK,UAAU,OAAOT;4BAClC,kCAAkC;4BAClCA,SAASQ;wBACX;oBACF;gBACF;gBACAH,MAAME,KAAK,CAACtB,OAAO4B,IAAI,CAAC,MAAM3B,KAAK4B,OAAO,CAACX;gBAC3CE,MAAME,KAAK,CAAC,AAAC,IAAI,CAAkCQ,UAAU,CAACF,IAAI,CAAC,IAAI,EAAEV,UAAUJ;gBACnFM,MAAME,KAAK,CAACb,cAAcmB,IAAI,CAAC,MAAMV;gBACrCE,MAAME,KAAK,CAACnB,MAAMyB,IAAI,CAAC,MAAMV,UAAU,IAAI,EAAEJ;gBAC7CM,MAAME,KAAK,CAAClB,MAAMwB,IAAI,CAAC,MAAMV,UAAU,IAAI,EAAEJ;gBAC7CM,MAAME,KAAK,CAACjB,OAAOuB,IAAI,CAAC,MAAMV,UAAU,IAAI,EAAEJ;gBAC9CM,MAAMW,KAAK,CAAChB;YACd,EAAE,OAAOQ,KAAK;gBACZR,SAASQ;YACX;YACA;QACF;QAEA,OAAO,IAAIS,QAAQ,CAACC,SAASC,SAAW,IAAI,CAACtB,MAAM,CAACC,MAAMC,SAAS,CAACS,KAAaY,OAAoBZ,MAAMW,OAAOX,OAAOU,QAAQE;IACnI;IAEAC,UAAU,CAAC;IA5DX,YAAYC,UAA0B,CAAE;QACtC7B,mBAAmB6B,YAAY3B;QAC/BJ,aAAa,IAAI,EAAE+B;QACnB,IAAI,IAAI,CAACC,QAAQ,KAAKC,WAAW,IAAI,CAACD,QAAQ,GAAGrC,KAAKqC,QAAQ,CAAC,IAAI,CAACrC,IAAI;QACxE,IAAI,IAAI,CAACuC,IAAI,KAAKD,WAAW,IAAI,CAACC,IAAI,GAAG;QACzC,IAAI,AAAC,IAAI,CAAkCV,UAAU,KAAKS,WAAW,MAAM,IAAIZ,MAAM;IACvF;AAuDF;AApEA,SAAqBhB,uBAoEpB"}

package/dist/esm/LinkEntry.js

@@ -42,15 +42,12 @@ let LinkEntry = class LinkEntry {
                 queue.defer(chown.bind(null, fullPath, this, options));
                 queue.defer(utimes.bind(null, fullPath, this, options));
                 queue.await(callback);
-                return;
             } catch (err) {
                 callback(err);
-                return;
             }
+            return;
         }
-        return new Promise((resolve, reject)=>{
-            this.create(dest, options, (err, done)=>err ? reject(err) : resolve(done));
-        });
+        return new Promise((resolve, reject)=>this.create(dest, options, (err, done)=>err ? reject(err) : resolve(done)));
     }
     destroy() {}
     constructor(attributes){

package/dist/esm/LinkEntry.js.map

@@ -1 +1 @@
-{"version":3,"sources":["/Users/kevin/Dev/OpenSource/iterators/extract-base-iterator/src/LinkEntry.ts"],"sourcesContent":["import fs from 'fs';\nimport { rm } from 'fs-remove-compat';\nimport mkdirp from 'mkdirp-classic';\nimport path from 'path';\nimport Queue from 'queue-cb';\nimport chmod from './fs/chmod.ts';\nimport chown from './fs/chown.ts';\nimport utimes from './fs/utimes.ts';\nimport { objectAssign } from './shared/index.ts';\nimport stripPath from './shared/stripPath.ts';\nimport validateAttributes from './validateAttributes.ts';\nimport waitForAccess from './waitForAccess.ts';\n\nconst MANDATORY_ATTRIBUTES = ['mode', 'mtime', 'path', 'linkpath'];\n\nimport type { Mode } from 'fs';\nimport type { ExtractOptions, LinkAttributes, NoParamCallback } from './types.ts';\n\nexport default class LinkEntry {\n  mode: Mode;\n  mtime: number;\n  path: string;\n  linkpath: string;\n  basename: string;\n  type: string;\n\n  constructor(attributes: LinkAttributes) {\n    validateAttributes(attributes, MANDATORY_ATTRIBUTES);\n    objectAssign(this, attributes);\n    if (this.basename === undefined) this.basename = path.basename(this.path);\n    if (this.type === undefined) this.type = 'link';\n  }\n\n  create(dest: string, callback: NoParamCallback): void;\n  create(dest: string, options: ExtractOptions, callback: NoParamCallback): void;\n  create(dest: string, options?: ExtractOptions): Promise<boolean>;\n  create(dest: string, options?: ExtractOptions | NoParamCallback, callback?: NoParamCallback): void | Promise<boolean> {\n    callback = typeof options === 'function' ? options : callback;\n    options = typeof options === 'function' ? {} : ((options || {}) as ExtractOptions);\n\n    if (typeof callback === 'function') {\n      try {\n        const normalizedPath = path.normalize(this.path);\n        const fullPath = path.join(dest, stripPath(normalizedPath, options));\n        const normalizedLinkpath = path.normalize(this.linkpath);\n        const linkFullPath = path.join(dest, stripPath(normalizedLinkpath, options));\n\n        const queue = new Queue(1);\n        if (options.force) {\n          queue.defer((callback) => {\n            rm(fullPath, (err) => {\n              err && err.code !== 'ENOENT' ? callback(err) : callback();\n            });\n          });\n        }\n        queue.defer(mkdirp.bind(null, path.dirname(fullPath)));\n        queue.defer(waitForAccess.bind(null, linkFullPath)); // ensure target file is accessible before linking\n        queue.defer(fs.link.bind(fs, linkFullPath, fullPath));\n        queue.defer(waitForAccess.bind(null, fullPath));\n        queue.defer(chmod.bind(null, fullPath, this, options));\n        queue.defer(chown.bind(null, fullPath, this, options));\n        queue.defer(utimes.bind(null, fullPath, this, options));\n        queue.await(callback);\n        return;\n      } catch (err) {\n        callback(err);\n        return;\n      }\n    }\n\n    return new Promise((resolve, reject) => {\n      this.create(dest, options, (err?: Error, done?: boolean) => (err ? reject(err) : resolve(done)));\n    });\n  }\n\n  destroy() {}\n}\n"],"names":["fs","rm","mkdirp","path","Queue","chmod","chown","utimes","objectAssign","stripPath","validateAttributes","waitForAccess","MANDATORY_ATTRIBUTES","LinkEntry","create","dest","options","callback","normalizedPath","normalize","fullPath","join","normalizedLinkpath","linkpath","linkFullPath","queue","force","defer","err","code","bind","dirname","link","await","Promise","resolve","reject","done","destroy","attributes","basename","undefined","type"],"mappings":"AAAA,OAAOA,QAAQ,KAAK;AACpB,SAASC,EAAE,QAAQ,mBAAmB;AACtC,OAAOC,YAAY,iBAAiB;AACpC,OAAOC,UAAU,OAAO;AACxB,OAAOC,WAAW,WAAW;AAC7B,OAAOC,WAAW,gBAAgB;AAClC,OAAOC,WAAW,gBAAgB;AAClC,OAAOC,YAAY,iBAAiB;AACpC,SAASC,YAAY,QAAQ,oBAAoB;AACjD,OAAOC,eAAe,wBAAwB;AAC9C,OAAOC,wBAAwB,0BAA0B;AACzD,OAAOC,mBAAmB,qBAAqB;AAE/C,MAAMC,uBAAuB;IAAC;IAAQ;IAAS;IAAQ;CAAW;AAKnD,IAAA,AAAMC,YAAN,MAAMA;IAkBnBC,OAAOC,IAAY,EAAEC,OAA0C,EAAEC,QAA0B,EAA2B;QACpHA,WAAW,OAAOD,YAAY,aAAaA,UAAUC;QACrDD,UAAU,OAAOA,YAAY,aAAa,CAAC,IAAMA,WAAW,CAAC;QAE7D,IAAI,OAAOC,aAAa,YAAY;YAClC,IAAI;gBACF,MAAMC,iBAAiBf,KAAKgB,SAAS,CAAC,IAAI,CAAChB,IAAI;gBAC/C,MAAMiB,WAAWjB,KAAKkB,IAAI,CAACN,MAAMN,UAAUS,gBAAgBF;gBAC3D,MAAMM,qBAAqBnB,KAAKgB,SAAS,CAAC,IAAI,CAACI,QAAQ;gBACvD,MAAMC,eAAerB,KAAKkB,IAAI,CAACN,MAAMN,UAAUa,oBAAoBN;gBAEnE,MAAMS,QAAQ,IAAIrB,MAAM;gBACxB,IAAIY,QAAQU,KAAK,EAAE;oBACjBD,MAAME,KAAK,CAAC,CAACV;wBACXhB,GAAGmB,UAAU,CAACQ;4BACZA,OAAOA,IAAIC,IAAI,KAAK,WAAWZ,SAASW,OAAOX;wBACjD;oBACF;gBACF;gBACAQ,MAAME,KAAK,CAACzB,OAAO4B,IAAI,CAAC,MAAM3B,KAAK4B,OAAO,CAACX;gBAC3CK,MAAME,KAAK,CAAChB,cAAcmB,IAAI,CAAC,MAAMN,gBAAgB,kDAAkD;gBACvGC,MAAME,KAAK,CAAC3B,GAAGgC,IAAI,CAACF,IAAI,CAAC9B,IAAIwB,cAAcJ;gBAC3CK,MAAME,KAAK,CAAChB,cAAcmB,IAAI,CAAC,MAAMV;gBACrCK,MAAME,KAAK,CAACtB,MAAMyB,IAAI,CAAC,MAAMV,UAAU,IAAI,EAAEJ;gBAC7CS,MAAME,KAAK,CAACrB,MAAMwB,IAAI,CAAC,MAAMV,UAAU,IAAI,EAAEJ;gBAC7CS,MAAME,KAAK,CAACpB,OAAOuB,IAAI,CAAC,MAAMV,UAAU,IAAI,EAAEJ;gBAC9CS,MAAMQ,KAAK,CAAChB;gBACZ;YACF,EAAE,OAAOW,KAAK;gBACZX,SAASW;gBACT;YACF;QACF;QAEA,OAAO,IAAIM,QAAQ,CAACC,SAASC;YAC3B,IAAI,CAACtB,MAAM,CAACC,MAAMC,SAAS,CAACY,KAAaS,OAAoBT,MAAMQ,OAAOR,OAAOO,QAAQE;QAC3F;IACF;IAEAC,UAAU,CAAC;IAjDX,YAAYC,UAA0B,CAAE;QACtC7B,mBAAmB6B,YAAY3B;QAC/BJ,aAAa,IAAI,EAAE+B;QACnB,IAAI,IAAI,CAACC,QAAQ,KAAKC,WAAW,IAAI,CAACD,QAAQ,GAAGrC,KAAKqC,QAAQ,CAAC,IAAI,CAACrC,IAAI;QACxE,IAAI,IAAI,CAACuC,IAAI,KAAKD,WAAW,IAAI,CAACC,IAAI,GAAG;IAC3C;AA6CF;AA1DA,SAAqB7B,uBA0DpB"}
+{"version":3,"sources":["/Users/kevin/Dev/OpenSource/iterators/extract-base-iterator/src/LinkEntry.ts"],"sourcesContent":["import fs from 'fs';\nimport { rm } from 'fs-remove-compat';\nimport mkdirp from 'mkdirp-classic';\nimport path from 'path';\nimport Queue from 'queue-cb';\nimport chmod from './fs/chmod.ts';\nimport chown from './fs/chown.ts';\nimport utimes from './fs/utimes.ts';\nimport { objectAssign } from './shared/index.ts';\nimport stripPath from './shared/stripPath.ts';\nimport validateAttributes from './validateAttributes.ts';\nimport waitForAccess from './waitForAccess.ts';\n\nconst MANDATORY_ATTRIBUTES = ['mode', 'mtime', 'path', 'linkpath'];\n\nimport type { Mode } from 'fs';\nimport type { ExtractOptions, LinkAttributes, NoParamCallback } from './types.ts';\n\nexport default class LinkEntry {\n  mode: Mode;\n  mtime: number;\n  path: string;\n  linkpath: string;\n  basename: string;\n  type: string;\n\n  constructor(attributes: LinkAttributes) {\n    validateAttributes(attributes, MANDATORY_ATTRIBUTES);\n    objectAssign(this, attributes);\n    if (this.basename === undefined) this.basename = path.basename(this.path);\n    if (this.type === undefined) this.type = 'link';\n  }\n\n  create(dest: string, callback: NoParamCallback): void;\n  create(dest: string, options: ExtractOptions, callback: NoParamCallback): void;\n  create(dest: string, options?: ExtractOptions): Promise<boolean>;\n  create(dest: string, options?: ExtractOptions | NoParamCallback, callback?: NoParamCallback): void | Promise<boolean> {\n    callback = typeof options === 'function' ? options : callback;\n    options = typeof options === 'function' ? {} : ((options || {}) as ExtractOptions);\n\n    if (typeof callback === 'function') {\n      try {\n        const normalizedPath = path.normalize(this.path);\n        const fullPath = path.join(dest, stripPath(normalizedPath, options));\n        const normalizedLinkpath = path.normalize(this.linkpath);\n        const linkFullPath = path.join(dest, stripPath(normalizedLinkpath, options));\n\n        const queue = new Queue(1);\n        if (options.force) {\n          queue.defer((callback) => {\n            rm(fullPath, (err) => {\n              err && err.code !== 'ENOENT' ? callback(err) : callback();\n            });\n          });\n        }\n        queue.defer(mkdirp.bind(null, path.dirname(fullPath)));\n        queue.defer(waitForAccess.bind(null, linkFullPath)); // ensure target file is accessible before linking\n        queue.defer(fs.link.bind(fs, linkFullPath, fullPath));\n        queue.defer(waitForAccess.bind(null, fullPath));\n        queue.defer(chmod.bind(null, fullPath, this, options));\n        queue.defer(chown.bind(null, fullPath, this, options));\n        queue.defer(utimes.bind(null, fullPath, this, options));\n        queue.await(callback);\n      } catch (err) {\n        callback(err);\n      }\n      return;\n    }\n\n    return new Promise((resolve, reject) => this.create(dest, options, (err?: Error, done?: boolean) => (err ? reject(err) : resolve(done))));\n  }\n\n  destroy() {}\n}\n"],"names":["fs","rm","mkdirp","path","Queue","chmod","chown","utimes","objectAssign","stripPath","validateAttributes","waitForAccess","MANDATORY_ATTRIBUTES","LinkEntry","create","dest","options","callback","normalizedPath","normalize","fullPath","join","normalizedLinkpath","linkpath","linkFullPath","queue","force","defer","err","code","bind","dirname","link","await","Promise","resolve","reject","done","destroy","attributes","basename","undefined","type"],"mappings":"AAAA,OAAOA,QAAQ,KAAK;AACpB,SAASC,EAAE,QAAQ,mBAAmB;AACtC,OAAOC,YAAY,iBAAiB;AACpC,OAAOC,UAAU,OAAO;AACxB,OAAOC,WAAW,WAAW;AAC7B,OAAOC,WAAW,gBAAgB;AAClC,OAAOC,WAAW,gBAAgB;AAClC,OAAOC,YAAY,iBAAiB;AACpC,SAASC,YAAY,QAAQ,oBAAoB;AACjD,OAAOC,eAAe,wBAAwB;AAC9C,OAAOC,wBAAwB,0BAA0B;AACzD,OAAOC,mBAAmB,qBAAqB;AAE/C,MAAMC,uBAAuB;IAAC;IAAQ;IAAS;IAAQ;CAAW;AAKnD,IAAA,AAAMC,YAAN,MAAMA;IAkBnBC,OAAOC,IAAY,EAAEC,OAA0C,EAAEC,QAA0B,EAA2B;QACpHA,WAAW,OAAOD,YAAY,aAAaA,UAAUC;QACrDD,UAAU,OAAOA,YAAY,aAAa,CAAC,IAAMA,WAAW,CAAC;QAE7D,IAAI,OAAOC,aAAa,YAAY;YAClC,IAAI;gBACF,MAAMC,iBAAiBf,KAAKgB,SAAS,CAAC,IAAI,CAAChB,IAAI;gBAC/C,MAAMiB,WAAWjB,KAAKkB,IAAI,CAACN,MAAMN,UAAUS,gBAAgBF;gBAC3D,MAAMM,qBAAqBnB,KAAKgB,SAAS,CAAC,IAAI,CAACI,QAAQ;gBACvD,MAAMC,eAAerB,KAAKkB,IAAI,CAACN,MAAMN,UAAUa,oBAAoBN;gBAEnE,MAAMS,QAAQ,IAAIrB,MAAM;gBACxB,IAAIY,QAAQU,KAAK,EAAE;oBACjBD,MAAME,KAAK,CAAC,CAACV;wBACXhB,GAAGmB,UAAU,CAACQ;4BACZA,OAAOA,IAAIC,IAAI,KAAK,WAAWZ,SAASW,OAAOX;wBACjD;oBACF;gBACF;gBACAQ,MAAME,KAAK,CAACzB,OAAO4B,IAAI,CAAC,MAAM3B,KAAK4B,OAAO,CAACX;gBAC3CK,MAAME,KAAK,CAAChB,cAAcmB,IAAI,CAAC,MAAMN,gBAAgB,kDAAkD;gBACvGC,MAAME,KAAK,CAAC3B,GAAGgC,IAAI,CAACF,IAAI,CAAC9B,IAAIwB,cAAcJ;gBAC3CK,MAAME,KAAK,CAAChB,cAAcmB,IAAI,CAAC,MAAMV;gBACrCK,MAAME,KAAK,CAACtB,MAAMyB,IAAI,CAAC,MAAMV,UAAU,IAAI,EAAEJ;gBAC7CS,MAAME,KAAK,CAACrB,MAAMwB,IAAI,CAAC,MAAMV,UAAU,IAAI,EAAEJ;gBAC7CS,MAAME,KAAK,CAACpB,OAAOuB,IAAI,CAAC,MAAMV,UAAU,IAAI,EAAEJ;gBAC9CS,MAAMQ,KAAK,CAAChB;YACd,EAAE,OAAOW,KAAK;gBACZX,SAASW;YACX;YACA;QACF;QAEA,OAAO,IAAIM,QAAQ,CAACC,SAASC,SAAW,IAAI,CAACtB,MAAM,CAACC,MAAMC,SAAS,CAACY,KAAaS,OAAoBT,MAAMQ,OAAOR,OAAOO,QAAQE;IACnI;IAEAC,UAAU,CAAC;IA9CX,YAAYC,UAA0B,CAAE;QACtC7B,mBAAmB6B,YAAY3B;QAC/BJ,aAAa,IAAI,EAAE+B;QACnB,IAAI,IAAI,CAACC,QAAQ,KAAKC,WAAW,IAAI,CAACD,QAAQ,GAAGrC,KAAKqC,QAAQ,CAAC,IAAI,CAACrC,IAAI;QACxE,IAAI,IAAI,CAACuC,IAAI,KAAKD,WAAW,IAAI,CAACC,IAAI,GAAG;IAC3C;AA0CF;AAvDA,SAAqB7B,uBAuDpB"}

package/dist/esm/SymbolicLinkEntry.js

@@ -50,15 +50,12 @@ let SymbolicLinkEntry = class SymbolicLinkEntry {
                 queue.defer(chown.bind(null, fullPath, this, options));
                 queue.defer(lutimes.bind(null, fullPath, this, options));
                 queue.await(callback);
-                return;
             } catch (err) {
                 callback(err);
-                return;
             }
+            return;
         }
-        return new Promise((resolve, reject)=>{
-            this.create(dest, options, (err, done)=>err ? reject(err) : resolve(done));
-        });
+        return new Promise((resolve, reject)=>this.create(dest, options, (err, done)=>err ? reject(err) : resolve(done)));
     }
     destroy() {}
     constructor(attributes){

package/dist/esm/SymbolicLinkEntry.js.map

@@ -1 +1 @@
-{"version":3,"sources":["/Users/kevin/Dev/OpenSource/iterators/extract-base-iterator/src/SymbolicLinkEntry.ts"],"sourcesContent":["import fs from 'fs';\nimport { rm } from 'fs-remove-compat';\nimport isAbsolute from 'is-absolute';\nimport mkdirp from 'mkdirp-classic';\nimport path from 'path';\nimport Queue from 'queue-cb';\nimport chmod from './fs/chmod.ts';\nimport chown from './fs/chown.ts';\nimport lutimes from './fs/lutimes.ts';\nimport symlinkWin32 from './fs/symlinkWin32.ts';\nimport { objectAssign } from './shared/index.ts';\nimport stripPath from './shared/stripPath.ts';\nimport validateAttributes from './validateAttributes.ts';\nimport waitForAccess from './waitForAccess.ts';\n\nconst isWindows = process.platform === 'win32' || /^(msys|cygwin)$/.test(process.env.OSTYPE);\n\nconst MANDATORY_ATTRIBUTES = ['mode', 'mtime', 'path', 'linkpath'];\n\nimport type { Mode } from 'fs';\nimport type { ExtractOptions, LinkAttributes, NoParamCallback } from './types.ts';\n\nexport default class SymbolicLinkEntry {\n  mode: Mode;\n  mtime: number;\n  path: string;\n  linkpath: string;\n  basename: string;\n  type: string;\n\n  constructor(attributes: LinkAttributes) {\n    validateAttributes(attributes, MANDATORY_ATTRIBUTES);\n    objectAssign(this, attributes);\n    if (this.basename === undefined) this.basename = path.basename(this.path);\n    if (this.type === undefined) this.type = 'symlink';\n  }\n\n  create(dest: string, callback: NoParamCallback): void;\n  create(dest: string, options: ExtractOptions, callback: NoParamCallback): void;\n  create(dest: string, options?: ExtractOptions): Promise<boolean>;\n  create(dest: string, options?: ExtractOptions | NoParamCallback, callback?: NoParamCallback): void | Promise<boolean> {\n    callback = typeof options === 'function' ? options : callback;\n    options = typeof options === 'function' ? {} : ((options || {}) as ExtractOptions);\n\n    if (typeof callback === 'function') {\n      try {\n        const normalizedPath = path.normalize(this.path);\n        const fullPath = path.join(dest, stripPath(normalizedPath, options));\n        let normalizedLinkpath = path.normalize(this.linkpath);\n        let linkFullPath = path.join(dest, stripPath(normalizedLinkpath, options));\n        if (!isAbsolute(normalizedLinkpath)) {\n          const linkRelativePath = path.join(path.dirname(normalizedPath), this.linkpath);\n          linkFullPath = path.join(dest, stripPath(linkRelativePath, options));\n          normalizedLinkpath = path.relative(path.dirname(fullPath), linkFullPath);\n        }\n\n        const queue = new Queue(1);\n        if (options.force) {\n          queue.defer((callback) => {\n            rm(fullPath, (err) => {\n              err && err.code !== 'ENOENT' ? callback(err) : callback();\n            });\n          });\n        }\n        queue.defer(mkdirp.bind(null, path.dirname(fullPath)));\n        if (isWindows) queue.defer(symlinkWin32.bind(null, linkFullPath, normalizedLinkpath, fullPath));\n        else queue.defer(fs.symlink.bind(fs, normalizedLinkpath, fullPath));\n        queue.defer(waitForAccess.bind(null, fullPath, true)); // noFollow=true for symlinks\n        queue.defer(chmod.bind(null, fullPath, this, options));\n        queue.defer(chown.bind(null, fullPath, this, options));\n        queue.defer(lutimes.bind(null, fullPath, this, options));\n        queue.await(callback);\n        return;\n      } catch (err) {\n        callback(err);\n        return;\n      }\n    }\n\n    return new Promise((resolve, reject) => {\n      this.create(dest, options, (err?: Error, done?: boolean) => (err ? reject(err) : resolve(done)));\n    });\n  }\n\n  destroy() {}\n}\n"],"names":["fs","rm","isAbsolute","mkdirp","path","Queue","chmod","chown","lutimes","symlinkWin32","objectAssign","stripPath","validateAttributes","waitForAccess","isWindows","process","platform","test","env","OSTYPE","MANDATORY_ATTRIBUTES","SymbolicLinkEntry","create","dest","options","callback","normalizedPath","normalize","fullPath","join","normalizedLinkpath","linkpath","linkFullPath","linkRelativePath","dirname","relative","queue","force","defer","err","code","bind","symlink","await","Promise","resolve","reject","done","destroy","attributes","basename","undefined","type"],"mappings":"AAAA,OAAOA,QAAQ,KAAK;AACpB,SAASC,EAAE,QAAQ,mBAAmB;AACtC,OAAOC,gBAAgB,cAAc;AACrC,OAAOC,YAAY,iBAAiB;AACpC,OAAOC,UAAU,OAAO;AACxB,OAAOC,WAAW,WAAW;AAC7B,OAAOC,WAAW,gBAAgB;AAClC,OAAOC,WAAW,gBAAgB;AAClC,OAAOC,aAAa,kBAAkB;AACtC,OAAOC,kBAAkB,uBAAuB;AAChD,SAASC,YAAY,QAAQ,oBAAoB;AACjD,OAAOC,eAAe,wBAAwB;AAC9C,OAAOC,wBAAwB,0BAA0B;AACzD,OAAOC,mBAAmB,qBAAqB;AAE/C,MAAMC,YAAYC,QAAQC,QAAQ,KAAK,WAAW,kBAAkBC,IAAI,CAACF,QAAQG,GAAG,CAACC,MAAM;AAE3F,MAAMC,uBAAuB;IAAC;IAAQ;IAAS;IAAQ;CAAW;AAKnD,IAAA,AAAMC,oBAAN,MAAMA;IAkBnBC,OAAOC,IAAY,EAAEC,OAA0C,EAAEC,QAA0B,EAA2B;QACpHA,WAAW,OAAOD,YAAY,aAAaA,UAAUC;QACrDD,UAAU,OAAOA,YAAY,aAAa,CAAC,IAAMA,WAAW,CAAC;QAE7D,IAAI,OAAOC,aAAa,YAAY;YAClC,IAAI;gBACF,MAAMC,iBAAiBtB,KAAKuB,SAAS,CAAC,IAAI,CAACvB,IAAI;gBAC/C,MAAMwB,WAAWxB,KAAKyB,IAAI,CAACN,MAAMZ,UAAUe,gBAAgBF;gBAC3D,IAAIM,qBAAqB1B,KAAKuB,SAAS,CAAC,IAAI,CAACI,QAAQ;gBACrD,IAAIC,eAAe5B,KAAKyB,IAAI,CAACN,MAAMZ,UAAUmB,oBAAoBN;gBACjE,IAAI,CAACtB,WAAW4B,qBAAqB;oBACnC,MAAMG,mBAAmB7B,KAAKyB,IAAI,CAACzB,KAAK8B,OAAO,CAACR,iBAAiB,IAAI,CAACK,QAAQ;oBAC9EC,eAAe5B,KAAKyB,IAAI,CAACN,MAAMZ,UAAUsB,kBAAkBT;oBAC3DM,qBAAqB1B,KAAK+B,QAAQ,CAAC/B,KAAK8B,OAAO,CAACN,WAAWI;gBAC7D;gBAEA,MAAMI,QAAQ,IAAI/B,MAAM;gBACxB,IAAImB,QAAQa,KAAK,EAAE;oBACjBD,MAAME,KAAK,CAAC,CAACb;wBACXxB,GAAG2B,UAAU,CAACW;4BACZA,OAAOA,IAAIC,IAAI,KAAK,WAAWf,SAASc,OAAOd;wBACjD;oBACF;gBACF;gBACAW,MAAME,KAAK,CAACnC,OAAOsC,IAAI,CAAC,MAAMrC,KAAK8B,OAAO,CAACN;gBAC3C,IAAId,WAAWsB,MAAME,KAAK,CAAC7B,aAAagC,IAAI,CAAC,MAAMT,cAAcF,oBAAoBF;qBAChFQ,MAAME,KAAK,CAACtC,GAAG0C,OAAO,CAACD,IAAI,CAACzC,IAAI8B,oBAAoBF;gBACzDQ,MAAME,KAAK,CAACzB,cAAc4B,IAAI,CAAC,MAAMb,UAAU,QAAQ,6BAA6B;gBACpFQ,MAAME,KAAK,CAAChC,MAAMmC,IAAI,CAAC,MAAMb,UAAU,IAAI,EAAEJ;gBAC7CY,MAAME,KAAK,CAAC/B,MAAMkC,IAAI,CAAC,MAAMb,UAAU,IAAI,EAAEJ;gBAC7CY,MAAME,KAAK,CAAC9B,QAAQiC,IAAI,CAAC,MAAMb,UAAU,IAAI,EAAEJ;gBAC/CY,MAAMO,KAAK,CAAClB;gBACZ;YACF,EAAE,OAAOc,KAAK;gBACZd,SAASc;gBACT;YACF;QACF;QAEA,OAAO,IAAIK,QAAQ,CAACC,SAASC;YAC3B,IAAI,CAACxB,MAAM,CAACC,MAAMC,SAAS,CAACe,KAAaQ,OAAoBR,MAAMO,OAAOP,OAAOM,QAAQE;QAC3F;IACF;IAEAC,UAAU,CAAC;IAtDX,YAAYC,UAA0B,CAAE;QACtCrC,mBAAmBqC,YAAY7B;QAC/BV,aAAa,IAAI,EAAEuC;QACnB,IAAI,IAAI,CAACC,QAAQ,KAAKC,WAAW,IAAI,CAACD,QAAQ,GAAG9C,KAAK8C,QAAQ,CAAC,IAAI,CAAC9C,IAAI;QACxE,IAAI,IAAI,CAACgD,IAAI,KAAKD,WAAW,IAAI,CAACC,IAAI,GAAG;IAC3C;AAkDF;AA/DA,SAAqB/B,+BA+DpB"}
+{"version":3,"sources":["/Users/kevin/Dev/OpenSource/iterators/extract-base-iterator/src/SymbolicLinkEntry.ts"],"sourcesContent":["import fs from 'fs';\nimport { rm } from 'fs-remove-compat';\nimport isAbsolute from 'is-absolute';\nimport mkdirp from 'mkdirp-classic';\nimport path from 'path';\nimport Queue from 'queue-cb';\nimport chmod from './fs/chmod.ts';\nimport chown from './fs/chown.ts';\nimport lutimes from './fs/lutimes.ts';\nimport symlinkWin32 from './fs/symlinkWin32.ts';\nimport { objectAssign } from './shared/index.ts';\nimport stripPath from './shared/stripPath.ts';\nimport validateAttributes from './validateAttributes.ts';\nimport waitForAccess from './waitForAccess.ts';\n\nconst isWindows = process.platform === 'win32' || /^(msys|cygwin)$/.test(process.env.OSTYPE);\n\nconst MANDATORY_ATTRIBUTES = ['mode', 'mtime', 'path', 'linkpath'];\n\nimport type { Mode } from 'fs';\nimport type { ExtractOptions, LinkAttributes, NoParamCallback } from './types.ts';\n\nexport default class SymbolicLinkEntry {\n  mode: Mode;\n  mtime: number;\n  path: string;\n  linkpath: string;\n  basename: string;\n  type: string;\n\n  constructor(attributes: LinkAttributes) {\n    validateAttributes(attributes, MANDATORY_ATTRIBUTES);\n    objectAssign(this, attributes);\n    if (this.basename === undefined) this.basename = path.basename(this.path);\n    if (this.type === undefined) this.type = 'symlink';\n  }\n\n  create(dest: string, callback: NoParamCallback): void;\n  create(dest: string, options: ExtractOptions, callback: NoParamCallback): void;\n  create(dest: string, options?: ExtractOptions): Promise<boolean>;\n  create(dest: string, options?: ExtractOptions | NoParamCallback, callback?: NoParamCallback): void | Promise<boolean> {\n    callback = typeof options === 'function' ? options : callback;\n    options = typeof options === 'function' ? {} : ((options || {}) as ExtractOptions);\n\n    if (typeof callback === 'function') {\n      try {\n        const normalizedPath = path.normalize(this.path);\n        const fullPath = path.join(dest, stripPath(normalizedPath, options));\n        let normalizedLinkpath = path.normalize(this.linkpath);\n        let linkFullPath = path.join(dest, stripPath(normalizedLinkpath, options));\n        if (!isAbsolute(normalizedLinkpath)) {\n          const linkRelativePath = path.join(path.dirname(normalizedPath), this.linkpath);\n          linkFullPath = path.join(dest, stripPath(linkRelativePath, options));\n          normalizedLinkpath = path.relative(path.dirname(fullPath), linkFullPath);\n        }\n\n        const queue = new Queue(1);\n        if (options.force) {\n          queue.defer((callback) => {\n            rm(fullPath, (err) => {\n              err && err.code !== 'ENOENT' ? callback(err) : callback();\n            });\n          });\n        }\n        queue.defer(mkdirp.bind(null, path.dirname(fullPath)));\n        if (isWindows) queue.defer(symlinkWin32.bind(null, linkFullPath, normalizedLinkpath, fullPath));\n        else queue.defer(fs.symlink.bind(fs, normalizedLinkpath, fullPath));\n        queue.defer(waitForAccess.bind(null, fullPath, true)); // noFollow=true for symlinks\n        queue.defer(chmod.bind(null, fullPath, this, options));\n        queue.defer(chown.bind(null, fullPath, this, options));\n        queue.defer(lutimes.bind(null, fullPath, this, options));\n        queue.await(callback);\n      } catch (err) {\n        callback(err);\n      }\n      return;\n    }\n\n    return new Promise((resolve, reject) => this.create(dest, options, (err?: Error, done?: boolean) => (err ? reject(err) : resolve(done))));\n  }\n\n  destroy() {}\n}\n"],"names":["fs","rm","isAbsolute","mkdirp","path","Queue","chmod","chown","lutimes","symlinkWin32","objectAssign","stripPath","validateAttributes","waitForAccess","isWindows","process","platform","test","env","OSTYPE","MANDATORY_ATTRIBUTES","SymbolicLinkEntry","create","dest","options","callback","normalizedPath","normalize","fullPath","join","normalizedLinkpath","linkpath","linkFullPath","linkRelativePath","dirname","relative","queue","force","defer","err","code","bind","symlink","await","Promise","resolve","reject","done","destroy","attributes","basename","undefined","type"],"mappings":"AAAA,OAAOA,QAAQ,KAAK;AACpB,SAASC,EAAE,QAAQ,mBAAmB;AACtC,OAAOC,gBAAgB,cAAc;AACrC,OAAOC,YAAY,iBAAiB;AACpC,OAAOC,UAAU,OAAO;AACxB,OAAOC,WAAW,WAAW;AAC7B,OAAOC,WAAW,gBAAgB;AAClC,OAAOC,WAAW,gBAAgB;AAClC,OAAOC,aAAa,kBAAkB;AACtC,OAAOC,kBAAkB,uBAAuB;AAChD,SAASC,YAAY,QAAQ,oBAAoB;AACjD,OAAOC,eAAe,wBAAwB;AAC9C,OAAOC,wBAAwB,0BAA0B;AACzD,OAAOC,mBAAmB,qBAAqB;AAE/C,MAAMC,YAAYC,QAAQC,QAAQ,KAAK,WAAW,kBAAkBC,IAAI,CAACF,QAAQG,GAAG,CAACC,MAAM;AAE3F,MAAMC,uBAAuB;IAAC;IAAQ;IAAS;IAAQ;CAAW;AAKnD,IAAA,AAAMC,oBAAN,MAAMA;IAkBnBC,OAAOC,IAAY,EAAEC,OAA0C,EAAEC,QAA0B,EAA2B;QACpHA,WAAW,OAAOD,YAAY,aAAaA,UAAUC;QACrDD,UAAU,OAAOA,YAAY,aAAa,CAAC,IAAMA,WAAW,CAAC;QAE7D,IAAI,OAAOC,aAAa,YAAY;YAClC,IAAI;gBACF,MAAMC,iBAAiBtB,KAAKuB,SAAS,CAAC,IAAI,CAACvB,IAAI;gBAC/C,MAAMwB,WAAWxB,KAAKyB,IAAI,CAACN,MAAMZ,UAAUe,gBAAgBF;gBAC3D,IAAIM,qBAAqB1B,KAAKuB,SAAS,CAAC,IAAI,CAACI,QAAQ;gBACrD,IAAIC,eAAe5B,KAAKyB,IAAI,CAACN,MAAMZ,UAAUmB,oBAAoBN;gBACjE,IAAI,CAACtB,WAAW4B,qBAAqB;oBACnC,MAAMG,mBAAmB7B,KAAKyB,IAAI,CAACzB,KAAK8B,OAAO,CAACR,iBAAiB,IAAI,CAACK,QAAQ;oBAC9EC,eAAe5B,KAAKyB,IAAI,CAACN,MAAMZ,UAAUsB,kBAAkBT;oBAC3DM,qBAAqB1B,KAAK+B,QAAQ,CAAC/B,KAAK8B,OAAO,CAACN,WAAWI;gBAC7D;gBAEA,MAAMI,QAAQ,IAAI/B,MAAM;gBACxB,IAAImB,QAAQa,KAAK,EAAE;oBACjBD,MAAME,KAAK,CAAC,CAACb;wBACXxB,GAAG2B,UAAU,CAACW;4BACZA,OAAOA,IAAIC,IAAI,KAAK,WAAWf,SAASc,OAAOd;wBACjD;oBACF;gBACF;gBACAW,MAAME,KAAK,CAACnC,OAAOsC,IAAI,CAAC,MAAMrC,KAAK8B,OAAO,CAACN;gBAC3C,IAAId,WAAWsB,MAAME,KAAK,CAAC7B,aAAagC,IAAI,CAAC,MAAMT,cAAcF,oBAAoBF;qBAChFQ,MAAME,KAAK,CAACtC,GAAG0C,OAAO,CAACD,IAAI,CAACzC,IAAI8B,oBAAoBF;gBACzDQ,MAAME,KAAK,CAACzB,cAAc4B,IAAI,CAAC,MAAMb,UAAU,QAAQ,6BAA6B;gBACpFQ,MAAME,KAAK,CAAChC,MAAMmC,IAAI,CAAC,MAAMb,UAAU,IAAI,EAAEJ;gBAC7CY,MAAME,KAAK,CAAC/B,MAAMkC,IAAI,CAAC,MAAMb,UAAU,IAAI,EAAEJ;gBAC7CY,MAAME,KAAK,CAAC9B,QAAQiC,IAAI,CAAC,MAAMb,UAAU,IAAI,EAAEJ;gBAC/CY,MAAMO,KAAK,CAAClB;YACd,EAAE,OAAOc,KAAK;gBACZd,SAASc;YACX;YACA;QACF;QAEA,OAAO,IAAIK,QAAQ,CAACC,SAASC,SAAW,IAAI,CAACxB,MAAM,CAACC,MAAMC,SAAS,CAACe,KAAaQ,OAAoBR,MAAMO,OAAOP,OAAOM,QAAQE;IACnI;IAEAC,UAAU,CAAC;IAnDX,YAAYC,UAA0B,CAAE;QACtCrC,mBAAmBqC,YAAY7B;QAC/BV,aAAa,IAAI,EAAEuC;QACnB,IAAI,IAAI,CAACC,QAAQ,KAAKC,WAAW,IAAI,CAACD,QAAQ,GAAG9C,KAAK8C,QAAQ,CAAC,IAAI,CAAC9C,IAAI;QACxE,IAAI,IAAI,CAACgD,IAAI,KAAKD,WAAW,IAAI,CAACC,IAAI,GAAG;IAC3C;AA+CF;AA5DA,SAAqB/B,+BA4DpB"}

package/dist/esm/shared/compat.js

@@ -30,15 +30,21 @@ export const MAX_SAFE_BUFFER_LENGTH = 256 * 1024 * 1024; // 256MB
 let DETECTED_MAX_LENGTH = null;
 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
-    // but may not exist at runtime on very old Node
+    // kMaxLength may not exist at runtime on very old or very new Node
+    // Modern Node (v8+) doesn't expose kMaxLength but allows large buffers
     const maxLen = Buffer.kMaxLength;
     if (maxLen !== undefined) {
         DETECTED_MAX_LENGTH = maxLen;
     } else {
-        // Older Node - use conservative estimate
-        DETECTED_MAX_LENGTH = 0x3fffffff; // ~1073MB
+        // Node 0.8-4.x: use conservative limit
+        // Node 8+: can allocate up to ~2GB (v8 array buffer limit)
+        // Use the higher limit for modern Node
+        const nodeVersion = parseInt(process.version.slice(1).split('.')[0], 10);
+        if (nodeVersion >= 8) {
+            DETECTED_MAX_LENGTH = Number.MAX_SAFE_INTEGER; // Effectively unlimited
+        } else {
+            DETECTED_MAX_LENGTH = 0x3fffffff; // ~1073MB for older Node
+        }
     }
     return DETECTED_MAX_LENGTH;
 }

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 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"}
+{"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  // kMaxLength may not exist at runtime on very old or very new Node\n  // Modern Node (v8+) doesn't expose kMaxLength but allows large buffers\n  const maxLen = (Buffer as { kMaxLength?: number }).kMaxLength;\n  if (maxLen !== undefined) {\n    DETECTED_MAX_LENGTH = maxLen;\n  } else {\n    // Node 0.8-4.x: use conservative limit\n    // Node 8+: can allocate up to ~2GB (v8 array buffer limit)\n    // Use the higher limit for modern Node\n    const nodeVersion = parseInt(process.version.slice(1).split('.')[0], 10);\n    if (nodeVersion >= 8) {\n      DETECTED_MAX_LENGTH = Number.MAX_SAFE_INTEGER; // Effectively unlimited\n    } else {\n      DETECTED_MAX_LENGTH = 0x3fffffff; // ~1073MB for older Node\n    }\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","nodeVersion","parseInt","process","version","slice","split","Number","MAX_SAFE_INTEGER","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","versions","node","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,mEAAmE;IACnE,uEAAuE;IACvE,MAAME,SAAS,AAACV,OAAmCW,UAAU;IAC7D,IAAID,WAAWE,WAAW;QACxBJ,sBAAsBE;IACxB,OAAO;QACL,uCAAuC;QACvC,2DAA2D;QAC3D,uCAAuC;QACvC,MAAMG,cAAcC,SAASC,QAAQC,OAAO,CAACC,KAAK,CAAC,GAAGC,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE;QACrE,IAAIL,eAAe,GAAG;YACpBL,sBAAsBW,OAAOC,gBAAgB,EAAE,wBAAwB;QACzE,OAAO;YACLZ,sBAAsB,YAAY,yBAAyB;QAC7D;IACF;IAEA,OAAOA;AACT;AAEA;;;CAGC,GACD,OAAO,SAASa,sBAAsBC,IAAY;IAChD,OAAOA,QAAQ,KAAKA,QAAQf;AAC9B;AAEA;;CAEC,GACD,SAASgB,YAAYD,IAAY,EAAEE,QAAiB;IAClD,IAAIzB,gBAAgB;QAClB,OAAOC,OAAOC,KAAK,CAACqB;IACtB;IACA,MAAMG,MAAM,IAAIzB,OAAOsB;IACvB,IAAIE,UAAUC,IAAIC,IAAI,CAAC;IACvB,OAAOD;AACT;AAEA;;;;CAIC,GACD,SAASE,uBAAuBC,OAAiB;IAC/C,MAAMC,YAAYpB;IAElB,uBAAuB;IACvB,IAAIqB,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,OAAOf;IACnC,MAAMmC,SAAmB,EAAE;IAE3B,8DAA8D;IAC9D,IAAK,IAAIX,IAAI,GAAGA,IAAIS,WAAWT,IAAK;QAClC,MAAMY,YAAYT,KAAKU,GAAG,CAACrC,wBAAwBe,OAAOS,IAAIxB;QAC9DmC,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,IAAItB,OAAO;IACpB;IAEA,qDAAqD;IACrD,IAAIqB,sBAAsBC,OAAO;QAC/B,IAAIvB,gBAAgB;YAClB,OAAOC,OAAOC,KAAK,CAACqB;QACtB;QACA,iEAAiE;QACjE,MAAMG,MAAM,IAAIzB,OAAOsB;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,IAAItB,OAAO;IACpB;IAEA,qDAAqD;IACrD,IAAIqB,sBAAsBC,OAAO;QAC/B,IAAIpB,sBAAsB;YACxB,OAAOF,OAAOG,WAAW,CAACmB;QAC5B;QACA,OAAO,IAAItB,OAAOsB;IACpB;IAEA,2DAA2D;IAC3D,OAAOiB,iBAAiBjB,MAAM;AAChC;AAEA;;;;;CAKC,GACD,OAAO,SAAS0B,WAAWC,IAA6C,EAAEC,QAAyB;IACjG,IAAI9C,eAAe;QACjB,IAAI,OAAO6C,SAAS,UAAU;YAC5B,OAAOjD,OAAOK,IAAI,CAAC4C,MAAMC;QAC3B;QACA,OAAOlD,OAAOK,IAAI,CAAC4C;IACrB;IACA,yDAAyD;IACzD,gFAAgF;IAChF,IAAIA,gBAAgB3C,cAAc,CAAE2C,CAAAA,gBAAgBjD,MAAK,GAAI;QAC3D,MAAMmD,MAAgB,EAAE;QACxB,IAAK,IAAIpB,IAAI,GAAGA,IAAIkB,KAAKjB,MAAM,EAAED,IAAK;YACpCoB,IAAIN,IAAI,CAACI,IAAI,CAAClB,EAAE;QAClB;QACA,OAAO,IAAI/B,OAAOmD;IACpB;IACA,OAAO,IAAInD,OAAOiD,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,gBAAgBnE,YAAYmE,cAAcC;IAE/D,oBAAoB;IACpB,IAAIF,KAAK9C,MAAM,KAAK,GAAG;QACrB,OAAO,IAAIhC,OAAO;IACpB;IAEA,mEAAmE;IACnE,sDAAsD;IACtD,IAAIiF,gBAAgB1E,wBAAwB;QAC1C,iEAAiE;QACjE,4DAA4D;QAC5D,IAAI2E,aAAa;QACjB,IAAK,IAAIC,IAAI,GAAGA,IAAIL,KAAK9C,MAAM,EAAEmD,IAAK;YACpC,IAAI,CAAEL,CAAAA,IAAI,CAACK,EAAE,YAAYnF,MAAK,GAAI;gBAChCkF,aAAa;gBACb;YACF;QACF;QACA,IAAIA,cAAcD,gBAAgBD,cAAc;YAC9C,OAAOhF,OAAOoF,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,eAAezB,QAAQ;YACzByB,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,OAAO9F,SAAS;AAClB,EAAE,OAAO+F,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,OAAOpG,SAAS;IACtB,OAAOqD,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,YAAYxG,SAAS,mBAAmBwG,SAAS;IACvD,MAAMJ,OAAOpG,SAAS;IAEtB,MAAMyG,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,IAAIvC,WAAW,IAAI,OAAO,aAAa;YACpD,yCAAyC;YACzC,MAAOkG,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,CAAChH,QAAQiH,QAAQ,CAACC,IAAI,CAAC/G,KAAK,CAAC,IAAI,CAAC,EAAE;AAClD,OAAO,MAAMgH,WAA6CH,QAAQ,IAAIpI,SAAS,UAAUuI,QAAQ,GAAGvI,SAAS,mBAAmBuI,QAAQ,CAAC;AACzI,OAAO,MAAMC,WAA6CJ,QAAQ,IAAIpI,SAAS,UAAUwI,QAAQ,GAAGxI,SAAS,mBAAmBwI,QAAQ,CAAC;AACzI,OAAO,MAAMhC,YAA+C4B,QAAQ,IAAIpI,SAAS,UAAUwG,SAAS,GAAGxG,SAAS,mBAAmBwG,SAAS,CAAC;AAC7I,OAAO,MAAMiC,cAAmDL,QAAQ,IAAIpI,SAAS,UAAUyI,WAAW,GAAGzI,SAAS,mBAAmByI,WAAW,CAAC"}

package/package.json

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