extract-base-iterator 2.3.2 → 2.4.0

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

@@ -0,0 +1,60 @@
+/**
+ * Buffer List for Streaming
+ *
+ * Simple linked list for accumulating buffer chunks during streaming.
+ * Provides efficient append, consume, and slice operations.
+ */
+export default class BufferList {
+    private head;
+    private tail;
+    /** Total bytes in the buffer list */
+    length: number;
+    /**
+     * Append a buffer to the end of the list
+     */
+    append(buf: Buffer): void;
+    /**
+     * Prepend a buffer to the front of the list
+     */
+    prepend(buf: Buffer): void;
+    /**
+     * Consume n bytes from the front of the list
+     * Returns a new buffer containing the consumed bytes
+     */
+    consume(n: number): Buffer;
+    /**
+     * Get a slice of the buffer without consuming
+     * Returns a new buffer containing the bytes
+     */
+    slice(start: number, end: number): Buffer;
+    /**
+     * Read a single byte at offset without consuming
+     */
+    readByte(offset: number): number;
+    /**
+     * Search for a byte sequence in the buffer
+     * Returns offset of first match, or -1 if not found
+     */
+    indexOf(signature: number[], startOffset?: number): number;
+    /**
+     * Skip (consume) n bytes without returning them
+     */
+    skip(n: number): void;
+    /**
+     * Clear all buffers
+     */
+    clear(): void;
+    /**
+     * Check if buffer has at least n bytes available
+     */
+    has(n: number): boolean;
+    /**
+     * Check if the buffer starts with a signature at offset 0
+     */
+    startsWith(signature: number[]): boolean;
+    /**
+     * Get a consolidated buffer of the entire contents
+     * Note: This creates a copy, so use sparingly for large buffers
+     */
+    toBuffer(): Buffer;
+}

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

@@ -0,0 +1,60 @@
+/**
+ * Buffer List for Streaming
+ *
+ * Simple linked list for accumulating buffer chunks during streaming.
+ * Provides efficient append, consume, and slice operations.
+ */
+export default class BufferList {
+    private head;
+    private tail;
+    /** Total bytes in the buffer list */
+    length: number;
+    /**
+     * Append a buffer to the end of the list
+     */
+    append(buf: Buffer): void;
+    /**
+     * Prepend a buffer to the front of the list
+     */
+    prepend(buf: Buffer): void;
+    /**
+     * Consume n bytes from the front of the list
+     * Returns a new buffer containing the consumed bytes
+     */
+    consume(n: number): Buffer;
+    /**
+     * Get a slice of the buffer without consuming
+     * Returns a new buffer containing the bytes
+     */
+    slice(start: number, end: number): Buffer;
+    /**
+     * Read a single byte at offset without consuming
+     */
+    readByte(offset: number): number;
+    /**
+     * Search for a byte sequence in the buffer
+     * Returns offset of first match, or -1 if not found
+     */
+    indexOf(signature: number[], startOffset?: number): number;
+    /**
+     * Skip (consume) n bytes without returning them
+     */
+    skip(n: number): void;
+    /**
+     * Clear all buffers
+     */
+    clear(): void;
+    /**
+     * Check if buffer has at least n bytes available
+     */
+    has(n: number): boolean;
+    /**
+     * Check if the buffer starts with a signature at offset 0
+     */
+    startsWith(signature: number[]): boolean;
+    /**
+     * Get a consolidated buffer of the entire contents
+     * Note: This creates a copy, so use sparingly for large buffers
+     */
+    toBuffer(): Buffer;
+}

package/dist/cjs/shared/BufferList.js

@@ -0,0 +1,207 @@
+/**
+ * Buffer List for Streaming
+ *
+ * Simple linked list for accumulating buffer chunks during streaming.
+ * Provides efficient append, consume, and slice operations.
+ */ "use strict";
+Object.defineProperty(exports, "__esModule", {
+    value: true
+});
+Object.defineProperty(exports, "default", {
+    enumerable: true,
+    get: function() {
+        return BufferList;
+    }
+});
+var _extractbaseiterator = require("extract-base-iterator");
+function _class_call_check(instance, Constructor) {
+    if (!(instance instanceof Constructor)) {
+        throw new TypeError("Cannot call a class as a function");
+    }
+}
+var BufferList = /*#__PURE__*/ function() {
+    "use strict";
+    function BufferList() {
+        _class_call_check(this, BufferList);
+        this.head = null;
+        this.tail = null;
+        /** Total bytes in the buffer list */ this.length = 0;
+    }
+    var _proto = BufferList.prototype;
+    /**
+   * Append a buffer to the end of the list
+   */ _proto.append = function append(buf) {
+        if (buf.length === 0) return;
+        var node = {
+            data: buf,
+            next: null
+        };
+        if (this.tail) {
+            this.tail.next = node;
+            this.tail = node;
+        } else {
+            this.head = this.tail = node;
+        }
+        this.length += buf.length;
+    };
+    /**
+   * Prepend a buffer to the front of the list
+   */ _proto.prepend = function prepend(buf) {
+        if (buf.length === 0) return;
+        var node = {
+            data: buf,
+            next: this.head
+        };
+        if (!this.tail) {
+            this.tail = node;
+        }
+        this.head = node;
+        this.length += buf.length;
+    };
+    /**
+   * Consume n bytes from the front of the list
+   * Returns a new buffer containing the consumed bytes
+   */ _proto.consume = function consume(n) {
+        if (n <= 0) return (0, _extractbaseiterator.allocBuffer)(0);
+        if (n > this.length) n = this.length;
+        var result = (0, _extractbaseiterator.allocBuffer)(n);
+        var offset = 0;
+        while(offset < n && this.head){
+            var chunk = this.head.data;
+            var needed = n - offset;
+            if (chunk.length <= needed) {
+                // Use entire chunk
+                chunk.copy(result, offset);
+                offset += chunk.length;
+                this.head = this.head.next;
+                if (!this.head) this.tail = null;
+            } else {
+                // Use partial chunk
+                chunk.copy(result, offset, 0, needed);
+                this.head.data = chunk.slice(needed);
+                offset = n;
+            }
+        }
+        this.length -= n;
+        return result;
+    };
+    /**
+   * Get a slice of the buffer without consuming
+   * Returns a new buffer containing the bytes
+   */ _proto.slice = function slice(start, end) {
+        var len = end - start;
+        if (len <= 0) return (0, _extractbaseiterator.allocBuffer)(0);
+        if (start >= this.length) return (0, _extractbaseiterator.allocBuffer)(0);
+        var result = (0, _extractbaseiterator.allocBuffer)(Math.min(len, this.length - start));
+        var resultOffset = 0;
+        var bufOffset = 0;
+        var node = this.head;
+        // Skip to start position
+        while(node && bufOffset + node.data.length <= start){
+            bufOffset += node.data.length;
+            node = node.next;
+        }
+        // Copy data
+        while(node && resultOffset < result.length){
+            var chunk = node.data;
+            var chunkStart = Math.max(0, start - bufOffset);
+            var chunkEnd = Math.min(chunk.length, end - bufOffset);
+            var toCopy = chunkEnd - chunkStart;
+            if (toCopy > 0) {
+                chunk.copy(result, resultOffset, chunkStart, chunkEnd);
+                resultOffset += toCopy;
+            }
+            bufOffset += chunk.length;
+            node = node.next;
+        }
+        return result;
+    };
+    /**
+   * Read a single byte at offset without consuming
+   */ _proto.readByte = function readByte(offset) {
+        if (offset < 0 || offset >= this.length) return -1;
+        var bufOffset = 0;
+        var node = this.head;
+        while(node){
+            if (offset < bufOffset + node.data.length) {
+                return node.data[offset - bufOffset];
+            }
+            bufOffset += node.data.length;
+            node = node.next;
+        }
+        return -1;
+    };
+    /**
+   * Search for a byte sequence in the buffer
+   * Returns offset of first match, or -1 if not found
+   */ _proto.indexOf = function indexOf(signature) {
+        var startOffset = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : 0;
+        if (signature.length === 0) return startOffset;
+        if (startOffset + signature.length > this.length) return -1;
+        // Simple byte-by-byte search
+        // Could be optimized with KMP/Boyer-Moore for larger signatures
+        for(var i = startOffset; i <= this.length - signature.length; i++){
+            var match = true;
+            for(var j = 0; j < signature.length; j++){
+                if (this.readByte(i + j) !== signature[j]) {
+                    match = false;
+                    break;
+                }
+            }
+            if (match) return i;
+        }
+        return -1;
+    };
+    /**
+   * Skip (consume) n bytes without returning them
+   */ _proto.skip = function skip(n) {
+        if (n <= 0) return;
+        if (n >= this.length) {
+            this.clear();
+            return;
+        }
+        var remaining = n;
+        while(remaining > 0 && this.head){
+            var chunk = this.head.data;
+            if (chunk.length <= remaining) {
+                remaining -= chunk.length;
+                this.head = this.head.next;
+                if (!this.head) this.tail = null;
+            } else {
+                this.head.data = chunk.slice(remaining);
+                remaining = 0;
+            }
+        }
+        this.length -= n;
+    };
+    /**
+   * Clear all buffers
+   */ _proto.clear = function clear() {
+        this.head = null;
+        this.tail = null;
+        this.length = 0;
+    };
+    /**
+   * Check if buffer has at least n bytes available
+   */ _proto.has = function has(n) {
+        return this.length >= n;
+    };
+    /**
+   * Check if the buffer starts with a signature at offset 0
+   */ _proto.startsWith = function startsWith(signature) {
+        if (signature.length > this.length) return false;
+        for(var i = 0; i < signature.length; i++){
+            if (this.readByte(i) !== signature[i]) return false;
+        }
+        return true;
+    };
+    /**
+   * Get a consolidated buffer of the entire contents
+   * Note: This creates a copy, so use sparingly for large buffers
+   */ _proto.toBuffer = function toBuffer() {
+        if (this.length === 0) return (0, _extractbaseiterator.allocBuffer)(0);
+        return this.slice(0, this.length);
+    };
+    return BufferList;
+}();
+/* CJS INTEROP */ if (exports.__esModule && exports.default) { try { Object.defineProperty(exports.default, '__esModule', { value: true }); for (var key in exports) { exports.default[key] = exports[key]; } } catch (_) {}; module.exports = exports.default; }

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

@@ -0,0 +1 @@
+{"version":3,"sources":["/Users/kevin/Dev/OpenSource/iterators/extract-base-iterator/src/shared/BufferList.ts"],"sourcesContent":["/**\n * Buffer List for Streaming\n *\n * Simple linked list for accumulating buffer chunks during streaming.\n * Provides efficient append, consume, and slice operations.\n */\n\nimport { allocBuffer } from 'extract-base-iterator';\n\ninterface BufferNode {\n  data: Buffer;\n  next: BufferNode | null;\n}\n\nexport default class BufferList {\n  private head: BufferNode | null = null;\n  private tail: BufferNode | null = null;\n\n  /** Total bytes in the buffer list */\n  public length = 0;\n\n  /**\n   * Append a buffer to the end of the list\n   */\n  append(buf: Buffer): void {\n    if (buf.length === 0) return;\n\n    const node: BufferNode = { data: buf, next: null };\n\n    if (this.tail) {\n      this.tail.next = node;\n      this.tail = node;\n    } else {\n      this.head = this.tail = node;\n    }\n\n    this.length += buf.length;\n  }\n\n  /**\n   * Prepend a buffer to the front of the list\n   */\n  prepend(buf: Buffer): void {\n    if (buf.length === 0) return;\n\n    const node: BufferNode = { data: buf, next: this.head };\n\n    if (!this.tail) {\n      this.tail = node;\n    }\n    this.head = node;\n\n    this.length += buf.length;\n  }\n\n  /**\n   * Consume n bytes from the front of the list\n   * Returns a new buffer containing the consumed bytes\n   */\n  consume(n: number): Buffer {\n    if (n <= 0) return allocBuffer(0);\n    if (n > this.length) n = this.length;\n\n    const result = allocBuffer(n);\n    let offset = 0;\n\n    while (offset < n && this.head) {\n      const chunk = this.head.data;\n      const needed = n - offset;\n\n      if (chunk.length <= needed) {\n        // Use entire chunk\n        chunk.copy(result, offset);\n        offset += chunk.length;\n        this.head = this.head.next;\n        if (!this.head) this.tail = null;\n      } else {\n        // Use partial chunk\n        chunk.copy(result, offset, 0, needed);\n        this.head.data = chunk.slice(needed);\n        offset = n;\n      }\n    }\n\n    this.length -= n;\n    return result;\n  }\n\n  /**\n   * Get a slice of the buffer without consuming\n   * Returns a new buffer containing the bytes\n   */\n  slice(start: number, end: number): Buffer {\n    const len = end - start;\n    if (len <= 0) return allocBuffer(0);\n    if (start >= this.length) return allocBuffer(0);\n\n    const result = allocBuffer(Math.min(len, this.length - start));\n    let resultOffset = 0;\n    let bufOffset = 0;\n    let node = this.head;\n\n    // Skip to start position\n    while (node && bufOffset + node.data.length <= start) {\n      bufOffset += node.data.length;\n      node = node.next;\n    }\n\n    // Copy data\n    while (node && resultOffset < result.length) {\n      const chunk = node.data;\n      const chunkStart = Math.max(0, start - bufOffset);\n      const chunkEnd = Math.min(chunk.length, end - bufOffset);\n      const toCopy = chunkEnd - chunkStart;\n\n      if (toCopy > 0) {\n        chunk.copy(result, resultOffset, chunkStart, chunkEnd);\n        resultOffset += toCopy;\n      }\n\n      bufOffset += chunk.length;\n      node = node.next;\n    }\n\n    return result;\n  }\n\n  /**\n   * Read a single byte at offset without consuming\n   */\n  readByte(offset: number): number {\n    if (offset < 0 || offset >= this.length) return -1;\n\n    let bufOffset = 0;\n    let node = this.head;\n\n    while (node) {\n      if (offset < bufOffset + node.data.length) {\n        return node.data[offset - bufOffset];\n      }\n      bufOffset += node.data.length;\n      node = node.next;\n    }\n\n    return -1;\n  }\n\n  /**\n   * Search for a byte sequence in the buffer\n   * Returns offset of first match, or -1 if not found\n   */\n  indexOf(signature: number[], startOffset = 0): number {\n    if (signature.length === 0) return startOffset;\n    if (startOffset + signature.length > this.length) return -1;\n\n    // Simple byte-by-byte search\n    // Could be optimized with KMP/Boyer-Moore for larger signatures\n    for (let i = startOffset; i <= this.length - signature.length; i++) {\n      let match = true;\n      for (let j = 0; j < signature.length; j++) {\n        if (this.readByte(i + j) !== signature[j]) {\n          match = false;\n          break;\n        }\n      }\n      if (match) return i;\n    }\n\n    return -1;\n  }\n\n  /**\n   * Skip (consume) n bytes without returning them\n   */\n  skip(n: number): void {\n    if (n <= 0) return;\n    if (n >= this.length) {\n      this.clear();\n      return;\n    }\n\n    let remaining = n;\n\n    while (remaining > 0 && this.head) {\n      const chunk = this.head.data;\n\n      if (chunk.length <= remaining) {\n        remaining -= chunk.length;\n        this.head = this.head.next;\n        if (!this.head) this.tail = null;\n      } else {\n        this.head.data = chunk.slice(remaining);\n        remaining = 0;\n      }\n    }\n\n    this.length -= n;\n  }\n\n  /**\n   * Clear all buffers\n   */\n  clear(): void {\n    this.head = null;\n    this.tail = null;\n    this.length = 0;\n  }\n\n  /**\n   * Check if buffer has at least n bytes available\n   */\n  has(n: number): boolean {\n    return this.length >= n;\n  }\n\n  /**\n   * Check if the buffer starts with a signature at offset 0\n   */\n  startsWith(signature: number[]): boolean {\n    if (signature.length > this.length) return false;\n    for (let i = 0; i < signature.length; i++) {\n      if (this.readByte(i) !== signature[i]) return false;\n    }\n    return true;\n  }\n\n  /**\n   * Get a consolidated buffer of the entire contents\n   * Note: This creates a copy, so use sparingly for large buffers\n   */\n  toBuffer(): Buffer {\n    if (this.length === 0) return allocBuffer(0);\n    return this.slice(0, this.length);\n  }\n}\n"],"names":["BufferList","head","tail","length","append","buf","node","data","next","prepend","consume","n","allocBuffer","result","offset","chunk","needed","copy","slice","start","end","len","Math","min","resultOffset","bufOffset","chunkStart","max","chunkEnd","toCopy","readByte","indexOf","signature","startOffset","i","match","j","skip","clear","remaining","has","startsWith","toBuffer"],"mappings":"AAAA;;;;;CAKC;;;;;;;eASoBA;;;mCAPO;;;;;;AAOb,IAAA,AAAMA,2BAAN;;aAAMA;gCAAAA;aACXC,OAA0B;aAC1BC,OAA0B;QAElC,mCAAmC,QAC5BC,SAAS;;iBALGH;IAOnB;;GAEC,GACDI,OAAAA,MAaC,GAbDA,SAAAA,OAAOC,GAAW;QAChB,IAAIA,IAAIF,MAAM,KAAK,GAAG;QAEtB,IAAMG,OAAmB;YAAEC,MAAMF;YAAKG,MAAM;QAAK;QAEjD,IAAI,IAAI,CAACN,IAAI,EAAE;YACb,IAAI,CAACA,IAAI,CAACM,IAAI,GAAGF;YACjB,IAAI,CAACJ,IAAI,GAAGI;QACd,OAAO;YACL,IAAI,CAACL,IAAI,GAAG,IAAI,CAACC,IAAI,GAAGI;QAC1B;QAEA,IAAI,CAACH,MAAM,IAAIE,IAAIF,MAAM;IAC3B;IAEA;;GAEC,GACDM,OAAAA,OAWC,GAXDA,SAAAA,QAAQJ,GAAW;QACjB,IAAIA,IAAIF,MAAM,KAAK,GAAG;QAEtB,IAAMG,OAAmB;YAAEC,MAAMF;YAAKG,MAAM,IAAI,CAACP,IAAI;QAAC;QAEtD,IAAI,CAAC,IAAI,CAACC,IAAI,EAAE;YACd,IAAI,CAACA,IAAI,GAAGI;QACd;QACA,IAAI,CAACL,IAAI,GAAGK;QAEZ,IAAI,CAACH,MAAM,IAAIE,IAAIF,MAAM;IAC3B;IAEA;;;GAGC,GACDO,OAAAA,OA2BC,GA3BDA,SAAAA,QAAQC,CAAS;QACf,IAAIA,KAAK,GAAG,OAAOC,IAAAA,gCAAW,EAAC;QAC/B,IAAID,IAAI,IAAI,CAACR,MAAM,EAAEQ,IAAI,IAAI,CAACR,MAAM;QAEpC,IAAMU,SAASD,IAAAA,gCAAW,EAACD;QAC3B,IAAIG,SAAS;QAEb,MAAOA,SAASH,KAAK,IAAI,CAACV,IAAI,CAAE;YAC9B,IAAMc,QAAQ,IAAI,CAACd,IAAI,CAACM,IAAI;YAC5B,IAAMS,SAASL,IAAIG;YAEnB,IAAIC,MAAMZ,MAAM,IAAIa,QAAQ;gBAC1B,mBAAmB;gBACnBD,MAAME,IAAI,CAACJ,QAAQC;gBACnBA,UAAUC,MAAMZ,MAAM;gBACtB,IAAI,CAACF,IAAI,GAAG,IAAI,CAACA,IAAI,CAACO,IAAI;gBAC1B,IAAI,CAAC,IAAI,CAACP,IAAI,EAAE,IAAI,CAACC,IAAI,GAAG;YAC9B,OAAO;gBACL,oBAAoB;gBACpBa,MAAME,IAAI,CAACJ,QAAQC,QAAQ,GAAGE;gBAC9B,IAAI,CAACf,IAAI,CAACM,IAAI,GAAGQ,MAAMG,KAAK,CAACF;gBAC7BF,SAASH;YACX;QACF;QAEA,IAAI,CAACR,MAAM,IAAIQ;QACf,OAAOE;IACT;IAEA;;;GAGC,GACDK,OAAAA,KAiCC,GAjCDA,SAAAA,MAAMC,KAAa,EAAEC,GAAW;QAC9B,IAAMC,MAAMD,MAAMD;QAClB,IAAIE,OAAO,GAAG,OAAOT,IAAAA,gCAAW,EAAC;QACjC,IAAIO,SAAS,IAAI,CAAChB,MAAM,EAAE,OAAOS,IAAAA,gCAAW,EAAC;QAE7C,IAAMC,SAASD,IAAAA,gCAAW,EAACU,KAAKC,GAAG,CAACF,KAAK,IAAI,CAAClB,MAAM,GAAGgB;QACvD,IAAIK,eAAe;QACnB,IAAIC,YAAY;QAChB,IAAInB,OAAO,IAAI,CAACL,IAAI;QAEpB,yBAAyB;QACzB,MAAOK,QAAQmB,YAAYnB,KAAKC,IAAI,CAACJ,MAAM,IAAIgB,MAAO;YACpDM,aAAanB,KAAKC,IAAI,CAACJ,MAAM;YAC7BG,OAAOA,KAAKE,IAAI;QAClB;QAEA,YAAY;QACZ,MAAOF,QAAQkB,eAAeX,OAAOV,MAAM,CAAE;YAC3C,IAAMY,QAAQT,KAAKC,IAAI;YACvB,IAAMmB,aAAaJ,KAAKK,GAAG,CAAC,GAAGR,QAAQM;YACvC,IAAMG,WAAWN,KAAKC,GAAG,CAACR,MAAMZ,MAAM,EAAEiB,MAAMK;YAC9C,IAAMI,SAASD,WAAWF;YAE1B,IAAIG,SAAS,GAAG;gBACdd,MAAME,IAAI,CAACJ,QAAQW,cAAcE,YAAYE;gBAC7CJ,gBAAgBK;YAClB;YAEAJ,aAAaV,MAAMZ,MAAM;YACzBG,OAAOA,KAAKE,IAAI;QAClB;QAEA,OAAOK;IACT;IAEA;;GAEC,GACDiB,OAAAA,QAeC,GAfDA,SAAAA,SAAShB,MAAc;QACrB,IAAIA,SAAS,KAAKA,UAAU,IAAI,CAACX,MAAM,EAAE,OAAO,CAAC;QAEjD,IAAIsB,YAAY;QAChB,IAAInB,OAAO,IAAI,CAACL,IAAI;QAEpB,MAAOK,KAAM;YACX,IAAIQ,SAASW,YAAYnB,KAAKC,IAAI,CAACJ,MAAM,EAAE;gBACzC,OAAOG,KAAKC,IAAI,CAACO,SAASW,UAAU;YACtC;YACAA,aAAanB,KAAKC,IAAI,CAACJ,MAAM;YAC7BG,OAAOA,KAAKE,IAAI;QAClB;QAEA,OAAO,CAAC;IACV;IAEA;;;GAGC,GACDuB,OAAAA,OAkBC,GAlBDA,SAAAA,QAAQC,SAAmB;YAAEC,cAAAA,iEAAc;QACzC,IAAID,UAAU7B,MAAM,KAAK,GAAG,OAAO8B;QACnC,IAAIA,cAAcD,UAAU7B,MAAM,GAAG,IAAI,CAACA,MAAM,EAAE,OAAO,CAAC;QAE1D,6BAA6B;QAC7B,gEAAgE;QAChE,IAAK,IAAI+B,IAAID,aAAaC,KAAK,IAAI,CAAC/B,MAAM,GAAG6B,UAAU7B,MAAM,EAAE+B,IAAK;YAClE,IAAIC,QAAQ;YACZ,IAAK,IAAIC,IAAI,GAAGA,IAAIJ,UAAU7B,MAAM,EAAEiC,IAAK;gBACzC,IAAI,IAAI,CAACN,QAAQ,CAACI,IAAIE,OAAOJ,SAAS,CAACI,EAAE,EAAE;oBACzCD,QAAQ;oBACR;gBACF;YACF;YACA,IAAIA,OAAO,OAAOD;QACpB;QAEA,OAAO,CAAC;IACV;IAEA;;GAEC,GACDG,OAAAA,IAuBC,GAvBDA,SAAAA,KAAK1B,CAAS;QACZ,IAAIA,KAAK,GAAG;QACZ,IAAIA,KAAK,IAAI,CAACR,MAAM,EAAE;YACpB,IAAI,CAACmC,KAAK;YACV;QACF;QAEA,IAAIC,YAAY5B;QAEhB,MAAO4B,YAAY,KAAK,IAAI,CAACtC,IAAI,CAAE;YACjC,IAAMc,QAAQ,IAAI,CAACd,IAAI,CAACM,IAAI;YAE5B,IAAIQ,MAAMZ,MAAM,IAAIoC,WAAW;gBAC7BA,aAAaxB,MAAMZ,MAAM;gBACzB,IAAI,CAACF,IAAI,GAAG,IAAI,CAACA,IAAI,CAACO,IAAI;gBAC1B,IAAI,CAAC,IAAI,CAACP,IAAI,EAAE,IAAI,CAACC,IAAI,GAAG;YAC9B,OAAO;gBACL,IAAI,CAACD,IAAI,CAACM,IAAI,GAAGQ,MAAMG,KAAK,CAACqB;gBAC7BA,YAAY;YACd;QACF;QAEA,IAAI,CAACpC,MAAM,IAAIQ;IACjB;IAEA;;GAEC,GACD2B,OAAAA,KAIC,GAJDA,SAAAA;QACE,IAAI,CAACrC,IAAI,GAAG;QACZ,IAAI,CAACC,IAAI,GAAG;QACZ,IAAI,CAACC,MAAM,GAAG;IAChB;IAEA;;GAEC,GACDqC,OAAAA,GAEC,GAFDA,SAAAA,IAAI7B,CAAS;QACX,OAAO,IAAI,CAACR,MAAM,IAAIQ;IACxB;IAEA;;GAEC,GACD8B,OAAAA,UAMC,GANDA,SAAAA,WAAWT,SAAmB;QAC5B,IAAIA,UAAU7B,MAAM,GAAG,IAAI,CAACA,MAAM,EAAE,OAAO;QAC3C,IAAK,IAAI+B,IAAI,GAAGA,IAAIF,UAAU7B,MAAM,EAAE+B,IAAK;YACzC,IAAI,IAAI,CAACJ,QAAQ,CAACI,OAAOF,SAAS,CAACE,EAAE,EAAE,OAAO;QAChD;QACA,OAAO;IACT;IAEA;;;GAGC,GACDQ,OAAAA,QAGC,GAHDA,SAAAA;QACE,IAAI,IAAI,CAACvC,MAAM,KAAK,GAAG,OAAOS,IAAAA,gCAAW,EAAC;QAC1C,OAAO,IAAI,CAACM,KAAK,CAAC,GAAG,IAAI,CAACf,MAAM;IAClC;WA3NmBH"}

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

@@ -76,3 +76,4 @@ export declare function bufferConcat(list: (Buffer | Uint8Array)[], totalLength?
  * Uses self-comparison: NaN is the only value not equal to itself
  */
 export declare function isNaN(value: number): boolean;
+export declare function inflateRaw(input: Buffer): Buffer;

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

@@ -76,3 +76,4 @@ export declare function bufferConcat(list: (Buffer | Uint8Array)[], totalLength?
  * Uses self-comparison: NaN is the only value not equal to itself
  */
 export declare function isNaN(value: number): boolean;
+export declare function inflateRaw(input: Buffer): Buffer;

package/dist/cjs/shared/compat.js

@@ -1,3 +1,16 @@
+/**
+ * Buffer Compatibility Layer for Node.js 0.8+
+ *
+ * Provides buffer utilities that work across all Node.js versions
+ * WITHOUT modifying global Buffer object.
+ *
+ * Version history:
+ * - Node 0.8-4.4: Only has `new Buffer()`, no `Buffer.alloc/from`
+ * - Node 4.5+: Has `Buffer.alloc/from`, deprecates `new Buffer()`
+ * - Node 10+: Warns or errors on `new Buffer()`
+ *
+ * Solution: Feature detection with graceful fallback in both directions.
+ */ // ESM-compatible require - works in both CJS and ESM
 "use strict";
 Object.defineProperty(exports, "__esModule", {
     value: true
@@ -30,6 +43,9 @@ _export(exports, {
     get bufferSliceCopy () {
         return bufferSliceCopy;
     },
+    get inflateRaw () {
+        return inflateRaw;
+    },
     get isNaN () {
         return isNaN;
     },
@@ -40,6 +56,7 @@ _export(exports, {
         return writeUInt64LE;
     }
 });
+var _module = /*#__PURE__*/ _interop_require_default(require("module"));
 function _instanceof(left, right) {
     if (right != null && typeof Symbol !== "undefined" && right[Symbol.hasInstance]) {
         return !!right[Symbol.hasInstance](left);
@@ -47,19 +64,13 @@ function _instanceof(left, right) {
         return left instanceof right;
     }
 }
-/**
- * Buffer Compatibility Layer for Node.js 0.8+
- *
- * Provides buffer utilities that work across all Node.js versions
- * WITHOUT modifying global Buffer object.
- *
- * Version history:
- * - Node 0.8-4.4: Only has `new Buffer()`, no `Buffer.alloc/from`
- * - Node 4.5+: Has `Buffer.alloc/from`, deprecates `new Buffer()`
- * - Node 10+: Warns or errors on `new Buffer()`
- *
- * Solution: Feature detection with graceful fallback in both directions.
- */ // Feature detection (runs once at module load)
+function _interop_require_default(obj) {
+    return obj && obj.__esModule ? obj : {
+        default: obj
+    };
+}
+var _require = typeof require === 'undefined' ? _module.default.createRequire(require("url").pathToFileURL(__filename).toString()) : require;
+// Feature detection (runs once at module load)
 var hasBufferAlloc = typeof Buffer.alloc === 'function';
 var hasBufferAllocUnsafe = typeof Buffer.allocUnsafe === 'function';
 var hasBufferFrom = typeof Buffer.from === 'function' && Buffer.from !== Uint8Array.from;
@@ -174,4 +185,28 @@ function isNaN(value) {
     // biome-ignore lint/suspicious/noSelfCompare: NaN check pattern
     return value !== value;
 }
+/**
+ * Decompress raw DEFLATE data (no zlib/gzip header)
+ * - Uses native zlib.inflateRawSync() on Node 0.11.12+
+ * - Falls back to pako for Node 0.8-0.10
+ *
+ * Version history:
+ * - Node 0.8-0.10: No zlib sync methods, use pako
+ * - Node 0.11.12+: zlib.inflateRawSync available
+ */ // Feature detection for native zlib sync methods (Node 0.11.12+)
+var zlib = null;
+try {
+    zlib = _require('zlib');
+} catch (_e) {
+// zlib not available (shouldn't happen in Node.js)
+}
+var hasNativeInflateRaw = zlib !== null && typeof zlib.inflateRawSync === 'function';
+function inflateRaw(input) {
+    if (hasNativeInflateRaw && zlib) {
+        return zlib.inflateRawSync(input);
+    }
+    // Fallback to pako for Node 0.8-0.10
+    var pako = _require('pako');
+    return bufferFrom(pako.inflateRaw(input));
+}
 /* CJS INTEROP */ if (exports.__esModule && exports.default) { try { Object.defineProperty(exports.default, '__esModule', { value: true }); for (var key in exports) { exports.default[key] = exports[key]; } } catch (_) {}; module.exports = exports.default; }

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// Feature detection (runs once at module load)\nvar hasBufferAlloc = typeof Buffer.alloc === 'function';\nvar hasBufferAllocUnsafe = typeof Buffer.allocUnsafe === 'function';\nvar hasBufferFrom = typeof Buffer.from === 'function' && Buffer.from !== Uint8Array.from;\n\n/**\n * Allocate a zero-filled buffer (safe)\n * - Uses Buffer.alloc() on Node 4.5+\n * - Falls back to new Buffer() + fill on Node 0.8-4.4\n */\nexport function allocBuffer(size: number): Buffer {\n  if (hasBufferAlloc) {\n    return Buffer.alloc(size);\n  }\n  // Legacy fallback: new Buffer() is uninitialized, must zero-fill\n  var buf = new Buffer(size);\n  buf.fill(0);\n  return buf;\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 *\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 (hasBufferAllocUnsafe) {\n    return Buffer.allocUnsafe(size);\n  }\n  return new Buffer(size);\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    var arr: number[] = [];\n    for (var 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  var sourceLen = sourceEnd - sourceStart;\n  var targetLen = targetEnd - targetStart;\n  var len = Math.min(sourceLen, targetLen);\n\n  for (var i = 0; i < len; i++) {\n    var s = source[sourceStart + i];\n    var 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 (var 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  var 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  var low = buf.readUInt32LE(offset);\n  var 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  var low = value >>> 0;\n  var 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 *\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  var actualLength = 0;\n  for (var i = 0; i < list.length; i++) {\n    actualLength += list[i].length;\n  }\n\n  // Use specified totalLength or actual length\n  var targetLength = totalLength !== undefined ? totalLength : actualLength;\n\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  var allBuffers = true;\n  for (var 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  // Manual concat for mixed types or when truncation is needed\n  var result = allocBuffer(targetLength);\n  var offset = 0;\n  for (var k = 0; k < list.length && offset < targetLength; k++) {\n    var buf = list[k];\n    for (var l = 0; l < buf.length && offset < targetLength; l++) {\n      result[offset++] = buf[l];\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"],"names":["allocBuffer","allocBufferUnsafe","bufferCompare","bufferConcat","bufferEquals","bufferFrom","bufferSliceCopy","isNaN","readUInt64LE","writeUInt64LE","hasBufferAlloc","Buffer","alloc","hasBufferAllocUnsafe","allocUnsafe","hasBufferFrom","from","Uint8Array","size","buf","fill","data","encoding","arr","i","length","push","source","target","targetStart","targetEnd","sourceStart","sourceEnd","compare","sourceLen","targetLen","len","Math","min","s","t","offset","expected","start","end","result","copy","low","readUInt32LE","high","value","writeUInt32LE","list","totalLength","actualLength","targetLength","undefined","allBuffers","j","concat","k","l"],"mappings":";;;;;;;;;;;QAwBgBA;eAAAA;;QAkBAC;eAAAA;;QAqCAC;eAAAA;;QA+EAC;eAAAA;;QAlDAC;eAAAA;;QArDAC;eAAAA;;QAiEAC;eAAAA;;QA8EAC;eAAAA;;QAjEAC;eAAAA;;QAUAC;eAAAA;;;;;;;;;;AA/IhB;;;;;;;;;;;;CAYC,GAED,+CAA+C;AAC/C,IAAIC,iBAAiB,OAAOC,OAAOC,KAAK,KAAK;AAC7C,IAAIC,uBAAuB,OAAOF,OAAOG,WAAW,KAAK;AACzD,IAAIC,gBAAgB,OAAOJ,OAAOK,IAAI,KAAK,cAAcL,OAAOK,IAAI,KAAKC,WAAWD,IAAI;AAOjF,SAAShB,YAAYkB,IAAY;IACtC,IAAIR,gBAAgB;QAClB,OAAOC,OAAOC,KAAK,CAACM;IACtB;IACA,iEAAiE;IACjE,IAAIC,MAAM,IAAIR,OAAOO;IACrBC,IAAIC,IAAI,CAAC;IACT,OAAOD;AACT;AAUO,SAASlB,kBAAkBiB,IAAY;IAC5C,IAAIL,sBAAsB;QACxB,OAAOF,OAAOG,WAAW,CAACI;IAC5B;IACA,OAAO,IAAIP,OAAOO;AACpB;AAQO,SAASb,WAAWgB,IAA6C,EAAEC,QAAyB;IACjG,IAAIP,eAAe;QACjB,IAAI,OAAOM,SAAS,UAAU;YAC5B,OAAOV,OAAOK,IAAI,CAACK,MAAMC;QAC3B;QACA,OAAOX,OAAOK,IAAI,CAACK;IACrB;IACA,yDAAyD;IACzD,gFAAgF;IAChF,IAAIA,AAAI,YAAJA,MAAgBJ,eAAc,CAAEI,AAAI,YAAJA,MAAgBV,SAAS;QAC3D,IAAIY,MAAgB,EAAE;QACtB,IAAK,IAAIC,IAAI,GAAGA,IAAIH,KAAKI,MAAM,EAAED,IAAK;YACpCD,IAAIG,IAAI,CAACL,IAAI,CAACG,EAAE;QAClB;QACA,OAAO,IAAIb,OAAOY;IACpB;IACA,OAAO,IAAIZ,OAAOU,MAA2BC;AAC/C;AAOO,SAASpB,cAAcyB,MAAc,EAAEC,MAAc,EAAEC,WAAoB,EAAEC,SAAkB,EAAEC,WAAoB,EAAEC,SAAkB;IAC9ID,cAAcA,eAAe;IAC7BC,YAAYA,aAAaL,OAAOF,MAAM;IACtCI,cAAcA,eAAe;IAC7BC,YAAYA,aAAaF,OAAOH,MAAM;IAEtC,kEAAkE;IAClE,IAAIE,OAAOM,OAAO,IAAIN,OAAOM,OAAO,CAACR,MAAM,IAAI,GAAG;QAChD,OAAOE,OAAOM,OAAO,CAACL,QAAQC,aAAaC,WAAWC,aAAaC;IACrE;IAEA,4CAA4C;IAC5C,IAAIE,YAAYF,YAAYD;IAC5B,IAAII,YAAYL,YAAYD;IAC5B,IAAIO,MAAMC,KAAKC,GAAG,CAACJ,WAAWC;IAE9B,IAAK,IAAIX,IAAI,GAAGA,IAAIY,KAAKZ,IAAK;QAC5B,IAAIe,IAAIZ,MAAM,CAACI,cAAcP,EAAE;QAC/B,IAAIgB,IAAIZ,MAAM,CAACC,cAAcL,EAAE;QAC/B,IAAIe,MAAMC,GAAG,OAAOD,IAAIC,IAAI,CAAC,IAAI;IACnC;IAEA,OAAON,YAAYC;AACrB;AAMO,SAAS/B,aAAae,GAAW,EAAEsB,MAAc,EAAEC,QAAkB;IAC1E,IAAID,SAASC,SAASjB,MAAM,GAAGN,IAAIM,MAAM,EAAE,OAAO;IAClD,IAAK,IAAID,IAAI,GAAGA,IAAIkB,SAASjB,MAAM,EAAED,IAAK;QACxC,IAAIL,GAAG,CAACsB,SAASjB,EAAE,KAAKkB,QAAQ,CAAClB,EAAE,EAAE,OAAO;IAC9C;IACA,OAAO;AACT;AAMO,SAASlB,gBAAgBa,GAAW,EAAEwB,KAAa,EAAEC,GAAW;IACrE,IAAIC,SAAS7C,YAAY4C,MAAMD;IAC/BxB,IAAI2B,IAAI,CAACD,QAAQ,GAAGF,OAAOC;IAC3B,OAAOC;AACT;AASO,SAASrC,aAAaW,GAAW,EAAEsB,MAAc;IACtD,IAAIM,MAAM5B,IAAI6B,YAAY,CAACP;IAC3B,IAAIQ,OAAO9B,IAAI6B,YAAY,CAACP,SAAS;IACrC,OAAOQ,OAAO,cAAcF;AAC9B;AAMO,SAAStC,cAAcU,GAAW,EAAE+B,KAAa,EAAET,MAAc;IACtE,IAAIM,MAAMG,UAAU;IACpB,IAAID,OAAO,AAACC,QAAQ,gBAAiB;IACrC/B,IAAIgC,aAAa,CAACJ,KAAKN;IACvBtB,IAAIgC,aAAa,CAACF,MAAMR,SAAS;AACnC;AAUO,SAAStC,aAAaiD,IAA6B,EAAEC,WAAoB;IAC9E,sCAAsC;IACtC,IAAIC,eAAe;IACnB,IAAK,IAAI9B,IAAI,GAAGA,IAAI4B,KAAK3B,MAAM,EAAED,IAAK;QACpC8B,gBAAgBF,IAAI,CAAC5B,EAAE,CAACC,MAAM;IAChC;IAEA,6CAA6C;IAC7C,IAAI8B,eAAeF,gBAAgBG,YAAYH,cAAcC;IAE7D,iEAAiE;IACjE,4DAA4D;IAC5D,IAAIG,aAAa;IACjB,IAAK,IAAIC,IAAI,GAAGA,IAAIN,KAAK3B,MAAM,EAAEiC,IAAK;QACpC,IAAI,CAAEN,AAAO,YAAPA,IAAI,CAACM,EAAE,EAAY/C,SAAS;YAChC8C,aAAa;YACb;QACF;IACF;IACA,IAAIA,cAAcF,gBAAgBD,cAAc;QAC9C,OAAO3C,OAAOgD,MAAM,CAACP,MAAkBG;IACzC;IAEA,6DAA6D;IAC7D,IAAIV,SAAS7C,YAAYuD;IACzB,IAAId,SAAS;IACb,IAAK,IAAImB,IAAI,GAAGA,IAAIR,KAAK3B,MAAM,IAAIgB,SAASc,cAAcK,IAAK;QAC7D,IAAIzC,MAAMiC,IAAI,CAACQ,EAAE;QACjB,IAAK,IAAIC,IAAI,GAAGA,IAAI1C,IAAIM,MAAM,IAAIgB,SAASc,cAAcM,IAAK;YAC5DhB,MAAM,CAACJ,SAAS,GAAGtB,GAAG,CAAC0C,EAAE;QAC3B;IACF;IACA,OAAOhB;AACT;AAOO,SAAStC,MAAM2C,KAAa;IACjC,gEAAgE;IAChE,OAAOA,UAAUA;AACnB"}
+{"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\nvar _require = typeof require === 'undefined' ? Module.createRequire(import.meta.url) : require;\n\n// Feature detection (runs once at module load)\nvar hasBufferAlloc = typeof Buffer.alloc === 'function';\nvar hasBufferAllocUnsafe = typeof Buffer.allocUnsafe === 'function';\nvar hasBufferFrom = typeof Buffer.from === 'function' && Buffer.from !== Uint8Array.from;\n\n/**\n * Allocate a zero-filled buffer (safe)\n * - Uses Buffer.alloc() on Node 4.5+\n * - Falls back to new Buffer() + fill on Node 0.8-4.4\n */\nexport function allocBuffer(size: number): Buffer {\n  if (hasBufferAlloc) {\n    return Buffer.alloc(size);\n  }\n  // Legacy fallback: new Buffer() is uninitialized, must zero-fill\n  var buf = new Buffer(size);\n  buf.fill(0);\n  return buf;\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 *\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 (hasBufferAllocUnsafe) {\n    return Buffer.allocUnsafe(size);\n  }\n  return new Buffer(size);\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    var arr: number[] = [];\n    for (var 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  var sourceLen = sourceEnd - sourceStart;\n  var targetLen = targetEnd - targetStart;\n  var len = Math.min(sourceLen, targetLen);\n\n  for (var i = 0; i < len; i++) {\n    var s = source[sourceStart + i];\n    var 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 (var 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  var 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  var low = buf.readUInt32LE(offset);\n  var 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  var low = value >>> 0;\n  var 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 *\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  var actualLength = 0;\n  for (var i = 0; i < list.length; i++) {\n    actualLength += list[i].length;\n  }\n\n  // Use specified totalLength or actual length\n  var targetLength = totalLength !== undefined ? totalLength : actualLength;\n\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  var allBuffers = true;\n  for (var 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  // Manual concat for mixed types or when truncation is needed\n  var result = allocBuffer(targetLength);\n  var offset = 0;\n  for (var k = 0; k < list.length && offset < targetLength; k++) {\n    var buf = list[k];\n    for (var l = 0; l < buf.length && offset < targetLength; l++) {\n      result[offset++] = buf[l];\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+)\nvar 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}\nvar 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  var pako = _require('pako');\n  return bufferFrom(pako.inflateRaw(input));\n}\n"],"names":["allocBuffer","allocBufferUnsafe","bufferCompare","bufferConcat","bufferEquals","bufferFrom","bufferSliceCopy","inflateRaw","isNaN","readUInt64LE","writeUInt64LE","_require","require","Module","createRequire","hasBufferAlloc","Buffer","alloc","hasBufferAllocUnsafe","allocUnsafe","hasBufferFrom","from","Uint8Array","size","buf","fill","data","encoding","arr","i","length","push","source","target","targetStart","targetEnd","sourceStart","sourceEnd","compare","sourceLen","targetLen","len","Math","min","s","t","offset","expected","start","end","result","copy","low","readUInt32LE","high","value","writeUInt32LE","list","totalLength","actualLength","targetLength","undefined","allBuffers","j","concat","k","l","zlib","_e","hasNativeInflateRaw","inflateRawSync","input","pako"],"mappings":"AAAA;;;;;;;;;;;;CAYC,GAED,qDAAqD;;;;;;;;;;;;QAerCA;eAAAA;;QAkBAC;eAAAA;;QAqCAC;eAAAA;;QA+EAC;eAAAA;;QAlDAC;eAAAA;;QArDAC;eAAAA;;QAiEAC;eAAAA;;QAqGAC;eAAAA;;QAvBAC;eAAAA;;QAjEAC;eAAAA;;QAUAC;eAAAA;;;6DArIG;;;;;;;;;;;;;AAEnB,IAAIC,WAAW,OAAOC,YAAY,cAAcC,eAAM,CAACC,aAAa,CAAC,uDAAmBF;AAExF,+CAA+C;AAC/C,IAAIG,iBAAiB,OAAOC,OAAOC,KAAK,KAAK;AAC7C,IAAIC,uBAAuB,OAAOF,OAAOG,WAAW,KAAK;AACzD,IAAIC,gBAAgB,OAAOJ,OAAOK,IAAI,KAAK,cAAcL,OAAOK,IAAI,KAAKC,WAAWD,IAAI;AAOjF,SAASrB,YAAYuB,IAAY;IACtC,IAAIR,gBAAgB;QAClB,OAAOC,OAAOC,KAAK,CAACM;IACtB;IACA,iEAAiE;IACjE,IAAIC,MAAM,IAAIR,OAAOO;IACrBC,IAAIC,IAAI,CAAC;IACT,OAAOD;AACT;AAUO,SAASvB,kBAAkBsB,IAAY;IAC5C,IAAIL,sBAAsB;QACxB,OAAOF,OAAOG,WAAW,CAACI;IAC5B;IACA,OAAO,IAAIP,OAAOO;AACpB;AAQO,SAASlB,WAAWqB,IAA6C,EAAEC,QAAyB;IACjG,IAAIP,eAAe;QACjB,IAAI,OAAOM,SAAS,UAAU;YAC5B,OAAOV,OAAOK,IAAI,CAACK,MAAMC;QAC3B;QACA,OAAOX,OAAOK,IAAI,CAACK;IACrB;IACA,yDAAyD;IACzD,gFAAgF;IAChF,IAAIA,AAAI,YAAJA,MAAgBJ,eAAc,CAAEI,AAAI,YAAJA,MAAgBV,SAAS;QAC3D,IAAIY,MAAgB,EAAE;QACtB,IAAK,IAAIC,IAAI,GAAGA,IAAIH,KAAKI,MAAM,EAAED,IAAK;YACpCD,IAAIG,IAAI,CAACL,IAAI,CAACG,EAAE;QAClB;QACA,OAAO,IAAIb,OAAOY;IACpB;IACA,OAAO,IAAIZ,OAAOU,MAA2BC;AAC/C;AAOO,SAASzB,cAAc8B,MAAc,EAAEC,MAAc,EAAEC,WAAoB,EAAEC,SAAkB,EAAEC,WAAoB,EAAEC,SAAkB;IAC9ID,cAAcA,eAAe;IAC7BC,YAAYA,aAAaL,OAAOF,MAAM;IACtCI,cAAcA,eAAe;IAC7BC,YAAYA,aAAaF,OAAOH,MAAM;IAEtC,kEAAkE;IAClE,IAAIE,OAAOM,OAAO,IAAIN,OAAOM,OAAO,CAACR,MAAM,IAAI,GAAG;QAChD,OAAOE,OAAOM,OAAO,CAACL,QAAQC,aAAaC,WAAWC,aAAaC;IACrE;IAEA,4CAA4C;IAC5C,IAAIE,YAAYF,YAAYD;IAC5B,IAAII,YAAYL,YAAYD;IAC5B,IAAIO,MAAMC,KAAKC,GAAG,CAACJ,WAAWC;IAE9B,IAAK,IAAIX,IAAI,GAAGA,IAAIY,KAAKZ,IAAK;QAC5B,IAAIe,IAAIZ,MAAM,CAACI,cAAcP,EAAE;QAC/B,IAAIgB,IAAIZ,MAAM,CAACC,cAAcL,EAAE;QAC/B,IAAIe,MAAMC,GAAG,OAAOD,IAAIC,IAAI,CAAC,IAAI;IACnC;IAEA,OAAON,YAAYC;AACrB;AAMO,SAASpC,aAAaoB,GAAW,EAAEsB,MAAc,EAAEC,QAAkB;IAC1E,IAAID,SAASC,SAASjB,MAAM,GAAGN,IAAIM,MAAM,EAAE,OAAO;IAClD,IAAK,IAAID,IAAI,GAAGA,IAAIkB,SAASjB,MAAM,EAAED,IAAK;QACxC,IAAIL,GAAG,CAACsB,SAASjB,EAAE,KAAKkB,QAAQ,CAAClB,EAAE,EAAE,OAAO;IAC9C;IACA,OAAO;AACT;AAMO,SAASvB,gBAAgBkB,GAAW,EAAEwB,KAAa,EAAEC,GAAW;IACrE,IAAIC,SAASlD,YAAYiD,MAAMD;IAC/BxB,IAAI2B,IAAI,CAACD,QAAQ,GAAGF,OAAOC;IAC3B,OAAOC;AACT;AASO,SAASzC,aAAae,GAAW,EAAEsB,MAAc;IACtD,IAAIM,MAAM5B,IAAI6B,YAAY,CAACP;IAC3B,IAAIQ,OAAO9B,IAAI6B,YAAY,CAACP,SAAS;IACrC,OAAOQ,OAAO,cAAcF;AAC9B;AAMO,SAAS1C,cAAcc,GAAW,EAAE+B,KAAa,EAAET,MAAc;IACtE,IAAIM,MAAMG,UAAU;IACpB,IAAID,OAAO,AAACC,QAAQ,gBAAiB;IACrC/B,IAAIgC,aAAa,CAACJ,KAAKN;IACvBtB,IAAIgC,aAAa,CAACF,MAAMR,SAAS;AACnC;AAUO,SAAS3C,aAAasD,IAA6B,EAAEC,WAAoB;IAC9E,sCAAsC;IACtC,IAAIC,eAAe;IACnB,IAAK,IAAI9B,IAAI,GAAGA,IAAI4B,KAAK3B,MAAM,EAAED,IAAK;QACpC8B,gBAAgBF,IAAI,CAAC5B,EAAE,CAACC,MAAM;IAChC;IAEA,6CAA6C;IAC7C,IAAI8B,eAAeF,gBAAgBG,YAAYH,cAAcC;IAE7D,iEAAiE;IACjE,4DAA4D;IAC5D,IAAIG,aAAa;IACjB,IAAK,IAAIC,IAAI,GAAGA,IAAIN,KAAK3B,MAAM,EAAEiC,IAAK;QACpC,IAAI,CAAEN,AAAO,YAAPA,IAAI,CAACM,EAAE,EAAY/C,SAAS;YAChC8C,aAAa;YACb;QACF;IACF;IACA,IAAIA,cAAcF,gBAAgBD,cAAc;QAC9C,OAAO3C,OAAOgD,MAAM,CAACP,MAAkBG;IACzC;IAEA,6DAA6D;IAC7D,IAAIV,SAASlD,YAAY4D;IACzB,IAAId,SAAS;IACb,IAAK,IAAImB,IAAI,GAAGA,IAAIR,KAAK3B,MAAM,IAAIgB,SAASc,cAAcK,IAAK;QAC7D,IAAIzC,MAAMiC,IAAI,CAACQ,EAAE;QACjB,IAAK,IAAIC,IAAI,GAAGA,IAAI1C,IAAIM,MAAM,IAAIgB,SAASc,cAAcM,IAAK;YAC5DhB,MAAM,CAACJ,SAAS,GAAGtB,GAAG,CAAC0C,EAAE;QAC3B;IACF;IACA,OAAOhB;AACT;AAOO,SAAS1C,MAAM+C,KAAa;IACjC,gEAAgE;IAChE,OAAOA,UAAUA;AACnB;AAEA;;;;;;;;CAQC,GACD,iEAAiE;AACjE,IAAIY,OAAqC;AACzC,IAAI;IACFA,OAAOxD,SAAS;AAClB,EAAE,OAAOyD,IAAI;AACX,mDAAmD;AACrD;AACA,IAAIC,sBAAsBF,SAAS,QAAQ,OAAOA,KAAKG,cAAc,KAAK;AAEnE,SAAS/D,WAAWgE,KAAa;IACtC,IAAIF,uBAAuBF,MAAM;QAC/B,OAAOA,KAAKG,cAAc,CAACC;IAC7B;IACA,qCAAqC;IACrC,IAAIC,OAAO7D,SAAS;IACpB,OAAON,WAAWmE,KAAKjE,UAAU,CAACgE;AACpC"}

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

@@ -9,6 +9,7 @@
  *
  * All utilities support Node.js 0.8+
  */
-export { allocBuffer, allocBufferUnsafe, bufferCompare, bufferConcat, bufferEquals, bufferFrom, bufferSliceCopy, isNaN, readUInt64LE, writeUInt64LE, } from './compat.js';
+export { default as BufferList } from './BufferList.js';
+export { allocBuffer, allocBufferUnsafe, bufferCompare, bufferConcat, bufferEquals, bufferFrom, bufferSliceCopy, inflateRaw, isNaN, readUInt64LE, writeUInt64LE, } from './compat.js';
 export { crc32, crc32Region, verifyCrc32, verifyCrc32Region } from './crc32.js';
 export { default as EntryStream } from './EntryStream.js';

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

@@ -9,6 +9,7 @@
  *
  * All utilities support Node.js 0.8+
  */
-export { allocBuffer, allocBufferUnsafe, bufferCompare, bufferConcat, bufferEquals, bufferFrom, bufferSliceCopy, isNaN, readUInt64LE, writeUInt64LE, } from './compat.js';
+export { default as BufferList } from './BufferList.js';
+export { allocBuffer, allocBufferUnsafe, bufferCompare, bufferConcat, bufferEquals, bufferFrom, bufferSliceCopy, inflateRaw, isNaN, readUInt64LE, writeUInt64LE, } from './compat.js';
 export { crc32, crc32Region, verifyCrc32, verifyCrc32Region } from './crc32.js';
 export { default as EntryStream } from './EntryStream.js';

package/dist/cjs/shared/index.js

@@ -19,6 +19,9 @@ function _export(target, all) {
     });
 }
 _export(exports, {
+    get BufferList () {
+        return _BufferListts.default;
+    },
     get EntryStream () {
         return _EntryStreamts.default;
     },
@@ -49,6 +52,9 @@ _export(exports, {
     get crc32Region () {
         return _crc32ts.crc32Region;
     },
+    get inflateRaw () {
+        return _compatts.inflateRaw;
+    },
     get isNaN () {
         return _compatts.isNaN;
     },
@@ -65,6 +71,7 @@ _export(exports, {
         return _compatts.writeUInt64LE;
     }
 });
+var _BufferListts = /*#__PURE__*/ _interop_require_default(require("./BufferList.js"));
 var _compatts = require("./compat.js");
 var _crc32ts = require("./crc32.js");
 var _EntryStreamts = /*#__PURE__*/ _interop_require_default(require("./EntryStream.js"));

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

@@ -1 +1 @@
-{"version":3,"sources":["/Users/kevin/Dev/OpenSource/iterators/extract-base-iterator/src/shared/index.ts"],"sourcesContent":["/**\n * Shared utilities for iterator libraries\n *\n * These utilities are designed to be used by:\n * - zip-iterator\n * - 7z-iterator\n * - tar-iterator\n * - Any other archive iterator library\n *\n * All utilities support Node.js 0.8+\n */\n\nexport {\n  allocBuffer,\n  allocBufferUnsafe,\n  bufferCompare,\n  bufferConcat,\n  bufferEquals,\n  bufferFrom,\n  bufferSliceCopy,\n  isNaN,\n  readUInt64LE,\n  writeUInt64LE,\n} from './compat.ts';\n\nexport { crc32, crc32Region, verifyCrc32, verifyCrc32Region } from './crc32.ts';\n\nexport { default as EntryStream } from './EntryStream.ts';\n"],"names":["EntryStream","allocBuffer","allocBufferUnsafe","bufferCompare","bufferConcat","bufferEquals","bufferFrom","bufferSliceCopy","crc32","crc32Region","isNaN","readUInt64LE","verifyCrc32","verifyCrc32Region","writeUInt64LE"],"mappings":"AAAA;;;;;;;;;;CAUC;;;;;;;;;;;QAiBmBA;eAAAA,sBAAW;;QAd7BC;eAAAA,qBAAW;;QACXC;eAAAA,2BAAiB;;QACjBC;eAAAA,uBAAa;;QACbC;eAAAA,sBAAY;;QACZC;eAAAA,sBAAY;;QACZC;eAAAA,oBAAU;;QACVC;eAAAA,yBAAe;;QAMRC;eAAAA,cAAK;;QAAEC;eAAAA,oBAAW;;QALzBC;eAAAA,eAAK;;QACLC;eAAAA,sBAAY;;QAIeC;eAAAA,oBAAW;;QAAEC;eAAAA,0BAAiB;;QAHzDC;eAAAA,uBAAa;;;wBACR;uBAE4D;oEAE5B"}
+{"version":3,"sources":["/Users/kevin/Dev/OpenSource/iterators/extract-base-iterator/src/shared/index.ts"],"sourcesContent":["/**\n * Shared utilities for iterator libraries\n *\n * These utilities are designed to be used by:\n * - zip-iterator\n * - 7z-iterator\n * - tar-iterator\n * - Any other archive iterator library\n *\n * All utilities support Node.js 0.8+\n */\n\nexport { default as BufferList } from './BufferList.ts';\nexport {\n  allocBuffer,\n  allocBufferUnsafe,\n  bufferCompare,\n  bufferConcat,\n  bufferEquals,\n  bufferFrom,\n  bufferSliceCopy,\n  inflateRaw,\n  isNaN,\n  readUInt64LE,\n  writeUInt64LE,\n} from './compat.ts';\nexport { crc32, crc32Region, verifyCrc32, verifyCrc32Region } from './crc32.ts';\nexport { default as EntryStream } from './EntryStream.ts';\n"],"names":["BufferList","EntryStream","allocBuffer","allocBufferUnsafe","bufferCompare","bufferConcat","bufferEquals","bufferFrom","bufferSliceCopy","crc32","crc32Region","inflateRaw","isNaN","readUInt64LE","verifyCrc32","verifyCrc32Region","writeUInt64LE"],"mappings":"AAAA;;;;;;;;;;CAUC;;;;;;;;;;;QAEmBA;eAAAA,qBAAU;;QAeVC;eAAAA,sBAAW;;QAb7BC;eAAAA,qBAAW;;QACXC;eAAAA,2BAAiB;;QACjBC;eAAAA,uBAAa;;QACbC;eAAAA,sBAAY;;QACZC;eAAAA,sBAAY;;QACZC;eAAAA,oBAAU;;QACVC;eAAAA,yBAAe;;QAMRC;eAAAA,cAAK;;QAAEC;eAAAA,oBAAW;;QALzBC;eAAAA,oBAAU;;QACVC;eAAAA,eAAK;;QACLC;eAAAA,sBAAY;;QAGeC;eAAAA,oBAAW;;QAAEC;eAAAA,0BAAiB;;QAFzDC;eAAAA,uBAAa;;;mEAZuB;wBAa/B;uBAC4D;oEAC5B"}

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

@@ -0,0 +1,60 @@
+/**
+ * Buffer List for Streaming
+ *
+ * Simple linked list for accumulating buffer chunks during streaming.
+ * Provides efficient append, consume, and slice operations.
+ */
+export default class BufferList {
+    private head;
+    private tail;
+    /** Total bytes in the buffer list */
+    length: number;
+    /**
+     * Append a buffer to the end of the list
+     */
+    append(buf: Buffer): void;
+    /**
+     * Prepend a buffer to the front of the list
+     */
+    prepend(buf: Buffer): void;
+    /**
+     * Consume n bytes from the front of the list
+     * Returns a new buffer containing the consumed bytes
+     */
+    consume(n: number): Buffer;
+    /**
+     * Get a slice of the buffer without consuming
+     * Returns a new buffer containing the bytes
+     */
+    slice(start: number, end: number): Buffer;
+    /**
+     * Read a single byte at offset without consuming
+     */
+    readByte(offset: number): number;
+    /**
+     * Search for a byte sequence in the buffer
+     * Returns offset of first match, or -1 if not found
+     */
+    indexOf(signature: number[], startOffset?: number): number;
+    /**
+     * Skip (consume) n bytes without returning them
+     */
+    skip(n: number): void;
+    /**
+     * Clear all buffers
+     */
+    clear(): void;
+    /**
+     * Check if buffer has at least n bytes available
+     */
+    has(n: number): boolean;
+    /**
+     * Check if the buffer starts with a signature at offset 0
+     */
+    startsWith(signature: number[]): boolean;
+    /**
+     * Get a consolidated buffer of the entire contents
+     * Note: This creates a copy, so use sparingly for large buffers
+     */
+    toBuffer(): Buffer;
+}

package/dist/esm/shared/BufferList.js

@@ -0,0 +1,187 @@
+/**
+ * Buffer List for Streaming
+ *
+ * Simple linked list for accumulating buffer chunks during streaming.
+ * Provides efficient append, consume, and slice operations.
+ */ import { allocBuffer } from 'extract-base-iterator';
+let BufferList = class BufferList {
+    /**
+   * Append a buffer to the end of the list
+   */ append(buf) {
+        if (buf.length === 0) return;
+        const node = {
+            data: buf,
+            next: null
+        };
+        if (this.tail) {
+            this.tail.next = node;
+            this.tail = node;
+        } else {
+            this.head = this.tail = node;
+        }
+        this.length += buf.length;
+    }
+    /**
+   * Prepend a buffer to the front of the list
+   */ prepend(buf) {
+        if (buf.length === 0) return;
+        const node = {
+            data: buf,
+            next: this.head
+        };
+        if (!this.tail) {
+            this.tail = node;
+        }
+        this.head = node;
+        this.length += buf.length;
+    }
+    /**
+   * Consume n bytes from the front of the list
+   * Returns a new buffer containing the consumed bytes
+   */ consume(n) {
+        if (n <= 0) return allocBuffer(0);
+        if (n > this.length) n = this.length;
+        const result = allocBuffer(n);
+        let offset = 0;
+        while(offset < n && this.head){
+            const chunk = this.head.data;
+            const needed = n - offset;
+            if (chunk.length <= needed) {
+                // Use entire chunk
+                chunk.copy(result, offset);
+                offset += chunk.length;
+                this.head = this.head.next;
+                if (!this.head) this.tail = null;
+            } else {
+                // Use partial chunk
+                chunk.copy(result, offset, 0, needed);
+                this.head.data = chunk.slice(needed);
+                offset = n;
+            }
+        }
+        this.length -= n;
+        return result;
+    }
+    /**
+   * Get a slice of the buffer without consuming
+   * Returns a new buffer containing the bytes
+   */ slice(start, end) {
+        const len = end - start;
+        if (len <= 0) return allocBuffer(0);
+        if (start >= this.length) return allocBuffer(0);
+        const result = allocBuffer(Math.min(len, this.length - start));
+        let resultOffset = 0;
+        let bufOffset = 0;
+        let node = this.head;
+        // Skip to start position
+        while(node && bufOffset + node.data.length <= start){
+            bufOffset += node.data.length;
+            node = node.next;
+        }
+        // Copy data
+        while(node && resultOffset < result.length){
+            const chunk = node.data;
+            const chunkStart = Math.max(0, start - bufOffset);
+            const chunkEnd = Math.min(chunk.length, end - bufOffset);
+            const toCopy = chunkEnd - chunkStart;
+            if (toCopy > 0) {
+                chunk.copy(result, resultOffset, chunkStart, chunkEnd);
+                resultOffset += toCopy;
+            }
+            bufOffset += chunk.length;
+            node = node.next;
+        }
+        return result;
+    }
+    /**
+   * Read a single byte at offset without consuming
+   */ readByte(offset) {
+        if (offset < 0 || offset >= this.length) return -1;
+        let bufOffset = 0;
+        let node = this.head;
+        while(node){
+            if (offset < bufOffset + node.data.length) {
+                return node.data[offset - bufOffset];
+            }
+            bufOffset += node.data.length;
+            node = node.next;
+        }
+        return -1;
+    }
+    /**
+   * Search for a byte sequence in the buffer
+   * Returns offset of first match, or -1 if not found
+   */ indexOf(signature, startOffset = 0) {
+        if (signature.length === 0) return startOffset;
+        if (startOffset + signature.length > this.length) return -1;
+        // Simple byte-by-byte search
+        // Could be optimized with KMP/Boyer-Moore for larger signatures
+        for(let i = startOffset; i <= this.length - signature.length; i++){
+            let match = true;
+            for(let j = 0; j < signature.length; j++){
+                if (this.readByte(i + j) !== signature[j]) {
+                    match = false;
+                    break;
+                }
+            }
+            if (match) return i;
+        }
+        return -1;
+    }
+    /**
+   * Skip (consume) n bytes without returning them
+   */ skip(n) {
+        if (n <= 0) return;
+        if (n >= this.length) {
+            this.clear();
+            return;
+        }
+        let remaining = n;
+        while(remaining > 0 && this.head){
+            const chunk = this.head.data;
+            if (chunk.length <= remaining) {
+                remaining -= chunk.length;
+                this.head = this.head.next;
+                if (!this.head) this.tail = null;
+            } else {
+                this.head.data = chunk.slice(remaining);
+                remaining = 0;
+            }
+        }
+        this.length -= n;
+    }
+    /**
+   * Clear all buffers
+   */ clear() {
+        this.head = null;
+        this.tail = null;
+        this.length = 0;
+    }
+    /**
+   * Check if buffer has at least n bytes available
+   */ has(n) {
+        return this.length >= n;
+    }
+    /**
+   * Check if the buffer starts with a signature at offset 0
+   */ startsWith(signature) {
+        if (signature.length > this.length) return false;
+        for(let i = 0; i < signature.length; i++){
+            if (this.readByte(i) !== signature[i]) return false;
+        }
+        return true;
+    }
+    /**
+   * Get a consolidated buffer of the entire contents
+   * Note: This creates a copy, so use sparingly for large buffers
+   */ toBuffer() {
+        if (this.length === 0) return allocBuffer(0);
+        return this.slice(0, this.length);
+    }
+    constructor(){
+        this.head = null;
+        this.tail = null;
+        /** Total bytes in the buffer list */ this.length = 0;
+    }
+};
+export { BufferList as default };

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

@@ -0,0 +1 @@
+{"version":3,"sources":["/Users/kevin/Dev/OpenSource/iterators/extract-base-iterator/src/shared/BufferList.ts"],"sourcesContent":["/**\n * Buffer List for Streaming\n *\n * Simple linked list for accumulating buffer chunks during streaming.\n * Provides efficient append, consume, and slice operations.\n */\n\nimport { allocBuffer } from 'extract-base-iterator';\n\ninterface BufferNode {\n  data: Buffer;\n  next: BufferNode | null;\n}\n\nexport default class BufferList {\n  private head: BufferNode | null = null;\n  private tail: BufferNode | null = null;\n\n  /** Total bytes in the buffer list */\n  public length = 0;\n\n  /**\n   * Append a buffer to the end of the list\n   */\n  append(buf: Buffer): void {\n    if (buf.length === 0) return;\n\n    const node: BufferNode = { data: buf, next: null };\n\n    if (this.tail) {\n      this.tail.next = node;\n      this.tail = node;\n    } else {\n      this.head = this.tail = node;\n    }\n\n    this.length += buf.length;\n  }\n\n  /**\n   * Prepend a buffer to the front of the list\n   */\n  prepend(buf: Buffer): void {\n    if (buf.length === 0) return;\n\n    const node: BufferNode = { data: buf, next: this.head };\n\n    if (!this.tail) {\n      this.tail = node;\n    }\n    this.head = node;\n\n    this.length += buf.length;\n  }\n\n  /**\n   * Consume n bytes from the front of the list\n   * Returns a new buffer containing the consumed bytes\n   */\n  consume(n: number): Buffer {\n    if (n <= 0) return allocBuffer(0);\n    if (n > this.length) n = this.length;\n\n    const result = allocBuffer(n);\n    let offset = 0;\n\n    while (offset < n && this.head) {\n      const chunk = this.head.data;\n      const needed = n - offset;\n\n      if (chunk.length <= needed) {\n        // Use entire chunk\n        chunk.copy(result, offset);\n        offset += chunk.length;\n        this.head = this.head.next;\n        if (!this.head) this.tail = null;\n      } else {\n        // Use partial chunk\n        chunk.copy(result, offset, 0, needed);\n        this.head.data = chunk.slice(needed);\n        offset = n;\n      }\n    }\n\n    this.length -= n;\n    return result;\n  }\n\n  /**\n   * Get a slice of the buffer without consuming\n   * Returns a new buffer containing the bytes\n   */\n  slice(start: number, end: number): Buffer {\n    const len = end - start;\n    if (len <= 0) return allocBuffer(0);\n    if (start >= this.length) return allocBuffer(0);\n\n    const result = allocBuffer(Math.min(len, this.length - start));\n    let resultOffset = 0;\n    let bufOffset = 0;\n    let node = this.head;\n\n    // Skip to start position\n    while (node && bufOffset + node.data.length <= start) {\n      bufOffset += node.data.length;\n      node = node.next;\n    }\n\n    // Copy data\n    while (node && resultOffset < result.length) {\n      const chunk = node.data;\n      const chunkStart = Math.max(0, start - bufOffset);\n      const chunkEnd = Math.min(chunk.length, end - bufOffset);\n      const toCopy = chunkEnd - chunkStart;\n\n      if (toCopy > 0) {\n        chunk.copy(result, resultOffset, chunkStart, chunkEnd);\n        resultOffset += toCopy;\n      }\n\n      bufOffset += chunk.length;\n      node = node.next;\n    }\n\n    return result;\n  }\n\n  /**\n   * Read a single byte at offset without consuming\n   */\n  readByte(offset: number): number {\n    if (offset < 0 || offset >= this.length) return -1;\n\n    let bufOffset = 0;\n    let node = this.head;\n\n    while (node) {\n      if (offset < bufOffset + node.data.length) {\n        return node.data[offset - bufOffset];\n      }\n      bufOffset += node.data.length;\n      node = node.next;\n    }\n\n    return -1;\n  }\n\n  /**\n   * Search for a byte sequence in the buffer\n   * Returns offset of first match, or -1 if not found\n   */\n  indexOf(signature: number[], startOffset = 0): number {\n    if (signature.length === 0) return startOffset;\n    if (startOffset + signature.length > this.length) return -1;\n\n    // Simple byte-by-byte search\n    // Could be optimized with KMP/Boyer-Moore for larger signatures\n    for (let i = startOffset; i <= this.length - signature.length; i++) {\n      let match = true;\n      for (let j = 0; j < signature.length; j++) {\n        if (this.readByte(i + j) !== signature[j]) {\n          match = false;\n          break;\n        }\n      }\n      if (match) return i;\n    }\n\n    return -1;\n  }\n\n  /**\n   * Skip (consume) n bytes without returning them\n   */\n  skip(n: number): void {\n    if (n <= 0) return;\n    if (n >= this.length) {\n      this.clear();\n      return;\n    }\n\n    let remaining = n;\n\n    while (remaining > 0 && this.head) {\n      const chunk = this.head.data;\n\n      if (chunk.length <= remaining) {\n        remaining -= chunk.length;\n        this.head = this.head.next;\n        if (!this.head) this.tail = null;\n      } else {\n        this.head.data = chunk.slice(remaining);\n        remaining = 0;\n      }\n    }\n\n    this.length -= n;\n  }\n\n  /**\n   * Clear all buffers\n   */\n  clear(): void {\n    this.head = null;\n    this.tail = null;\n    this.length = 0;\n  }\n\n  /**\n   * Check if buffer has at least n bytes available\n   */\n  has(n: number): boolean {\n    return this.length >= n;\n  }\n\n  /**\n   * Check if the buffer starts with a signature at offset 0\n   */\n  startsWith(signature: number[]): boolean {\n    if (signature.length > this.length) return false;\n    for (let i = 0; i < signature.length; i++) {\n      if (this.readByte(i) !== signature[i]) return false;\n    }\n    return true;\n  }\n\n  /**\n   * Get a consolidated buffer of the entire contents\n   * Note: This creates a copy, so use sparingly for large buffers\n   */\n  toBuffer(): Buffer {\n    if (this.length === 0) return allocBuffer(0);\n    return this.slice(0, this.length);\n  }\n}\n"],"names":["allocBuffer","BufferList","append","buf","length","node","data","next","tail","head","prepend","consume","n","result","offset","chunk","needed","copy","slice","start","end","len","Math","min","resultOffset","bufOffset","chunkStart","max","chunkEnd","toCopy","readByte","indexOf","signature","startOffset","i","match","j","skip","clear","remaining","has","startsWith","toBuffer"],"mappings":"AAAA;;;;;CAKC,GAED,SAASA,WAAW,QAAQ,wBAAwB;AAOrC,IAAA,AAAMC,aAAN,MAAMA;IAOnB;;GAEC,GACDC,OAAOC,GAAW,EAAQ;QACxB,IAAIA,IAAIC,MAAM,KAAK,GAAG;QAEtB,MAAMC,OAAmB;YAAEC,MAAMH;YAAKI,MAAM;QAAK;QAEjD,IAAI,IAAI,CAACC,IAAI,EAAE;YACb,IAAI,CAACA,IAAI,CAACD,IAAI,GAAGF;YACjB,IAAI,CAACG,IAAI,GAAGH;QACd,OAAO;YACL,IAAI,CAACI,IAAI,GAAG,IAAI,CAACD,IAAI,GAAGH;QAC1B;QAEA,IAAI,CAACD,MAAM,IAAID,IAAIC,MAAM;IAC3B;IAEA;;GAEC,GACDM,QAAQP,GAAW,EAAQ;QACzB,IAAIA,IAAIC,MAAM,KAAK,GAAG;QAEtB,MAAMC,OAAmB;YAAEC,MAAMH;YAAKI,MAAM,IAAI,CAACE,IAAI;QAAC;QAEtD,IAAI,CAAC,IAAI,CAACD,IAAI,EAAE;YACd,IAAI,CAACA,IAAI,GAAGH;QACd;QACA,IAAI,CAACI,IAAI,GAAGJ;QAEZ,IAAI,CAACD,MAAM,IAAID,IAAIC,MAAM;IAC3B;IAEA;;;GAGC,GACDO,QAAQC,CAAS,EAAU;QACzB,IAAIA,KAAK,GAAG,OAAOZ,YAAY;QAC/B,IAAIY,IAAI,IAAI,CAACR,MAAM,EAAEQ,IAAI,IAAI,CAACR,MAAM;QAEpC,MAAMS,SAASb,YAAYY;QAC3B,IAAIE,SAAS;QAEb,MAAOA,SAASF,KAAK,IAAI,CAACH,IAAI,CAAE;YAC9B,MAAMM,QAAQ,IAAI,CAACN,IAAI,CAACH,IAAI;YAC5B,MAAMU,SAASJ,IAAIE;YAEnB,IAAIC,MAAMX,MAAM,IAAIY,QAAQ;gBAC1B,mBAAmB;gBACnBD,MAAME,IAAI,CAACJ,QAAQC;gBACnBA,UAAUC,MAAMX,MAAM;gBACtB,IAAI,CAACK,IAAI,GAAG,IAAI,CAACA,IAAI,CAACF,IAAI;gBAC1B,IAAI,CAAC,IAAI,CAACE,IAAI,EAAE,IAAI,CAACD,IAAI,GAAG;YAC9B,OAAO;gBACL,oBAAoB;gBACpBO,MAAME,IAAI,CAACJ,QAAQC,QAAQ,GAAGE;gBAC9B,IAAI,CAACP,IAAI,CAACH,IAAI,GAAGS,MAAMG,KAAK,CAACF;gBAC7BF,SAASF;YACX;QACF;QAEA,IAAI,CAACR,MAAM,IAAIQ;QACf,OAAOC;IACT;IAEA;;;GAGC,GACDK,MAAMC,KAAa,EAAEC,GAAW,EAAU;QACxC,MAAMC,MAAMD,MAAMD;QAClB,IAAIE,OAAO,GAAG,OAAOrB,YAAY;QACjC,IAAImB,SAAS,IAAI,CAACf,MAAM,EAAE,OAAOJ,YAAY;QAE7C,MAAMa,SAASb,YAAYsB,KAAKC,GAAG,CAACF,KAAK,IAAI,CAACjB,MAAM,GAAGe;QACvD,IAAIK,eAAe;QACnB,IAAIC,YAAY;QAChB,IAAIpB,OAAO,IAAI,CAACI,IAAI;QAEpB,yBAAyB;QACzB,MAAOJ,QAAQoB,YAAYpB,KAAKC,IAAI,CAACF,MAAM,IAAIe,MAAO;YACpDM,aAAapB,KAAKC,IAAI,CAACF,MAAM;YAC7BC,OAAOA,KAAKE,IAAI;QAClB;QAEA,YAAY;QACZ,MAAOF,QAAQmB,eAAeX,OAAOT,MAAM,CAAE;YAC3C,MAAMW,QAAQV,KAAKC,IAAI;YACvB,MAAMoB,aAAaJ,KAAKK,GAAG,CAAC,GAAGR,QAAQM;YACvC,MAAMG,WAAWN,KAAKC,GAAG,CAACR,MAAMX,MAAM,EAAEgB,MAAMK;YAC9C,MAAMI,SAASD,WAAWF;YAE1B,IAAIG,SAAS,GAAG;gBACdd,MAAME,IAAI,CAACJ,QAAQW,cAAcE,YAAYE;gBAC7CJ,gBAAgBK;YAClB;YAEAJ,aAAaV,MAAMX,MAAM;YACzBC,OAAOA,KAAKE,IAAI;QAClB;QAEA,OAAOM;IACT;IAEA;;GAEC,GACDiB,SAAShB,MAAc,EAAU;QAC/B,IAAIA,SAAS,KAAKA,UAAU,IAAI,CAACV,MAAM,EAAE,OAAO,CAAC;QAEjD,IAAIqB,YAAY;QAChB,IAAIpB,OAAO,IAAI,CAACI,IAAI;QAEpB,MAAOJ,KAAM;YACX,IAAIS,SAASW,YAAYpB,KAAKC,IAAI,CAACF,MAAM,EAAE;gBACzC,OAAOC,KAAKC,IAAI,CAACQ,SAASW,UAAU;YACtC;YACAA,aAAapB,KAAKC,IAAI,CAACF,MAAM;YAC7BC,OAAOA,KAAKE,IAAI;QAClB;QAEA,OAAO,CAAC;IACV;IAEA;;;GAGC,GACDwB,QAAQC,SAAmB,EAAEC,cAAc,CAAC,EAAU;QACpD,IAAID,UAAU5B,MAAM,KAAK,GAAG,OAAO6B;QACnC,IAAIA,cAAcD,UAAU5B,MAAM,GAAG,IAAI,CAACA,MAAM,EAAE,OAAO,CAAC;QAE1D,6BAA6B;QAC7B,gEAAgE;QAChE,IAAK,IAAI8B,IAAID,aAAaC,KAAK,IAAI,CAAC9B,MAAM,GAAG4B,UAAU5B,MAAM,EAAE8B,IAAK;YAClE,IAAIC,QAAQ;YACZ,IAAK,IAAIC,IAAI,GAAGA,IAAIJ,UAAU5B,MAAM,EAAEgC,IAAK;gBACzC,IAAI,IAAI,CAACN,QAAQ,CAACI,IAAIE,OAAOJ,SAAS,CAACI,EAAE,EAAE;oBACzCD,QAAQ;oBACR;gBACF;YACF;YACA,IAAIA,OAAO,OAAOD;QACpB;QAEA,OAAO,CAAC;IACV;IAEA;;GAEC,GACDG,KAAKzB,CAAS,EAAQ;QACpB,IAAIA,KAAK,GAAG;QACZ,IAAIA,KAAK,IAAI,CAACR,MAAM,EAAE;YACpB,IAAI,CAACkC,KAAK;YACV;QACF;QAEA,IAAIC,YAAY3B;QAEhB,MAAO2B,YAAY,KAAK,IAAI,CAAC9B,IAAI,CAAE;YACjC,MAAMM,QAAQ,IAAI,CAACN,IAAI,CAACH,IAAI;YAE5B,IAAIS,MAAMX,MAAM,IAAImC,WAAW;gBAC7BA,aAAaxB,MAAMX,MAAM;gBACzB,IAAI,CAACK,IAAI,GAAG,IAAI,CAACA,IAAI,CAACF,IAAI;gBAC1B,IAAI,CAAC,IAAI,CAACE,IAAI,EAAE,IAAI,CAACD,IAAI,GAAG;YAC9B,OAAO;gBACL,IAAI,CAACC,IAAI,CAACH,IAAI,GAAGS,MAAMG,KAAK,CAACqB;gBAC7BA,YAAY;YACd;QACF;QAEA,IAAI,CAACnC,MAAM,IAAIQ;IACjB;IAEA;;GAEC,GACD0B,QAAc;QACZ,IAAI,CAAC7B,IAAI,GAAG;QACZ,IAAI,CAACD,IAAI,GAAG;QACZ,IAAI,CAACJ,MAAM,GAAG;IAChB;IAEA;;GAEC,GACDoC,IAAI5B,CAAS,EAAW;QACtB,OAAO,IAAI,CAACR,MAAM,IAAIQ;IACxB;IAEA;;GAEC,GACD6B,WAAWT,SAAmB,EAAW;QACvC,IAAIA,UAAU5B,MAAM,GAAG,IAAI,CAACA,MAAM,EAAE,OAAO;QAC3C,IAAK,IAAI8B,IAAI,GAAGA,IAAIF,UAAU5B,MAAM,EAAE8B,IAAK;YACzC,IAAI,IAAI,CAACJ,QAAQ,CAACI,OAAOF,SAAS,CAACE,EAAE,EAAE,OAAO;QAChD;QACA,OAAO;IACT;IAEA;;;GAGC,GACDQ,WAAmB;QACjB,IAAI,IAAI,CAACtC,MAAM,KAAK,GAAG,OAAOJ,YAAY;QAC1C,OAAO,IAAI,CAACkB,KAAK,CAAC,GAAG,IAAI,CAACd,MAAM;IAClC;;aA1NQK,OAA0B;aAC1BD,OAA0B;QAElC,mCAAmC,QAC5BJ,SAAS;;AAuNlB;AA5NA,SAAqBH,wBA4NpB"}

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

@@ -76,3 +76,4 @@ export declare function bufferConcat(list: (Buffer | Uint8Array)[], totalLength?
  * Uses self-comparison: NaN is the only value not equal to itself
  */
 export declare function isNaN(value: number): boolean;
+export declare function inflateRaw(input: Buffer): Buffer;

package/dist/esm/shared/compat.js

@@ -10,7 +10,10 @@
  * - Node 10+: Warns or errors on `new Buffer()`
  *
  * Solution: Feature detection with graceful fallback in both directions.
- */ // Feature detection (runs once at module load)
+ */ // ESM-compatible require - works in both CJS and ESM
+import Module from 'module';
+var _require = typeof require === 'undefined' ? Module.createRequire(import.meta.url) : require;
+// Feature detection (runs once at module load)
 var hasBufferAlloc = typeof Buffer.alloc === 'function';
 var hasBufferAllocUnsafe = typeof Buffer.allocUnsafe === 'function';
 var hasBufferFrom = typeof Buffer.from === 'function' && Buffer.from !== Uint8Array.from;
@@ -171,3 +174,27 @@ export function isNaN(value) {
     // biome-ignore lint/suspicious/noSelfCompare: NaN check pattern
     return value !== value;
 }
+/**
+ * Decompress raw DEFLATE data (no zlib/gzip header)
+ * - Uses native zlib.inflateRawSync() on Node 0.11.12+
+ * - Falls back to pako for Node 0.8-0.10
+ *
+ * Version history:
+ * - Node 0.8-0.10: No zlib sync methods, use pako
+ * - Node 0.11.12+: zlib.inflateRawSync available
+ */ // Feature detection for native zlib sync methods (Node 0.11.12+)
+var zlib = null;
+try {
+    zlib = _require('zlib');
+} catch (_e) {
+// zlib not available (shouldn't happen in Node.js)
+}
+var hasNativeInflateRaw = zlib !== null && typeof zlib.inflateRawSync === 'function';
+export function inflateRaw(input) {
+    if (hasNativeInflateRaw && zlib) {
+        return zlib.inflateRawSync(input);
+    }
+    // Fallback to pako for Node 0.8-0.10
+    var pako = _require('pako');
+    return bufferFrom(pako.inflateRaw(input));
+}

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// Feature detection (runs once at module load)\nvar hasBufferAlloc = typeof Buffer.alloc === 'function';\nvar hasBufferAllocUnsafe = typeof Buffer.allocUnsafe === 'function';\nvar hasBufferFrom = typeof Buffer.from === 'function' && Buffer.from !== Uint8Array.from;\n\n/**\n * Allocate a zero-filled buffer (safe)\n * - Uses Buffer.alloc() on Node 4.5+\n * - Falls back to new Buffer() + fill on Node 0.8-4.4\n */\nexport function allocBuffer(size: number): Buffer {\n  if (hasBufferAlloc) {\n    return Buffer.alloc(size);\n  }\n  // Legacy fallback: new Buffer() is uninitialized, must zero-fill\n  var buf = new Buffer(size);\n  buf.fill(0);\n  return buf;\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 *\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 (hasBufferAllocUnsafe) {\n    return Buffer.allocUnsafe(size);\n  }\n  return new Buffer(size);\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    var arr: number[] = [];\n    for (var 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  var sourceLen = sourceEnd - sourceStart;\n  var targetLen = targetEnd - targetStart;\n  var len = Math.min(sourceLen, targetLen);\n\n  for (var i = 0; i < len; i++) {\n    var s = source[sourceStart + i];\n    var 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 (var 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  var 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  var low = buf.readUInt32LE(offset);\n  var 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  var low = value >>> 0;\n  var 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 *\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  var actualLength = 0;\n  for (var i = 0; i < list.length; i++) {\n    actualLength += list[i].length;\n  }\n\n  // Use specified totalLength or actual length\n  var targetLength = totalLength !== undefined ? totalLength : actualLength;\n\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  var allBuffers = true;\n  for (var 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  // Manual concat for mixed types or when truncation is needed\n  var result = allocBuffer(targetLength);\n  var offset = 0;\n  for (var k = 0; k < list.length && offset < targetLength; k++) {\n    var buf = list[k];\n    for (var l = 0; l < buf.length && offset < targetLength; l++) {\n      result[offset++] = buf[l];\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"],"names":["hasBufferAlloc","Buffer","alloc","hasBufferAllocUnsafe","allocUnsafe","hasBufferFrom","from","Uint8Array","allocBuffer","size","buf","fill","allocBufferUnsafe","bufferFrom","data","encoding","arr","i","length","push","bufferCompare","source","target","targetStart","targetEnd","sourceStart","sourceEnd","compare","sourceLen","targetLen","len","Math","min","s","t","bufferEquals","offset","expected","bufferSliceCopy","start","end","result","copy","readUInt64LE","low","readUInt32LE","high","writeUInt64LE","value","writeUInt32LE","bufferConcat","list","totalLength","actualLength","targetLength","undefined","allBuffers","j","concat","k","l","isNaN"],"mappings":"AAAA;;;;;;;;;;;;CAYC,GAED,+CAA+C;AAC/C,IAAIA,iBAAiB,OAAOC,OAAOC,KAAK,KAAK;AAC7C,IAAIC,uBAAuB,OAAOF,OAAOG,WAAW,KAAK;AACzD,IAAIC,gBAAgB,OAAOJ,OAAOK,IAAI,KAAK,cAAcL,OAAOK,IAAI,KAAKC,WAAWD,IAAI;AAExF;;;;CAIC,GACD,OAAO,SAASE,YAAYC,IAAY;IACtC,IAAIT,gBAAgB;QAClB,OAAOC,OAAOC,KAAK,CAACO;IACtB;IACA,iEAAiE;IACjE,IAAIC,MAAM,IAAIT,OAAOQ;IACrBC,IAAIC,IAAI,CAAC;IACT,OAAOD;AACT;AAEA;;;;;;;CAOC,GACD,OAAO,SAASE,kBAAkBH,IAAY;IAC5C,IAAIN,sBAAsB;QACxB,OAAOF,OAAOG,WAAW,CAACK;IAC5B;IACA,OAAO,IAAIR,OAAOQ;AACpB;AAEA;;;;;CAKC,GACD,OAAO,SAASI,WAAWC,IAA6C,EAAEC,QAAyB;IACjG,IAAIV,eAAe;QACjB,IAAI,OAAOS,SAAS,UAAU;YAC5B,OAAOb,OAAOK,IAAI,CAACQ,MAAMC;QAC3B;QACA,OAAOd,OAAOK,IAAI,CAACQ;IACrB;IACA,yDAAyD;IACzD,gFAAgF;IAChF,IAAIA,gBAAgBP,cAAc,CAAEO,CAAAA,gBAAgBb,MAAK,GAAI;QAC3D,IAAIe,MAAgB,EAAE;QACtB,IAAK,IAAIC,IAAI,GAAGA,IAAIH,KAAKI,MAAM,EAAED,IAAK;YACpCD,IAAIG,IAAI,CAACL,IAAI,CAACG,EAAE;QAClB;QACA,OAAO,IAAIhB,OAAOe;IACpB;IACA,OAAO,IAAIf,OAAOa,MAA2BC;AAC/C;AAEA;;;;CAIC,GACD,OAAO,SAASK,cAAcC,MAAc,EAAEC,MAAc,EAAEC,WAAoB,EAAEC,SAAkB,EAAEC,WAAoB,EAAEC,SAAkB;IAC9ID,cAAcA,eAAe;IAC7BC,YAAYA,aAAaL,OAAOH,MAAM;IACtCK,cAAcA,eAAe;IAC7BC,YAAYA,aAAaF,OAAOJ,MAAM;IAEtC,kEAAkE;IAClE,IAAIG,OAAOM,OAAO,IAAIN,OAAOM,OAAO,CAACT,MAAM,IAAI,GAAG;QAChD,OAAOG,OAAOM,OAAO,CAACL,QAAQC,aAAaC,WAAWC,aAAaC;IACrE;IAEA,4CAA4C;IAC5C,IAAIE,YAAYF,YAAYD;IAC5B,IAAII,YAAYL,YAAYD;IAC5B,IAAIO,MAAMC,KAAKC,GAAG,CAACJ,WAAWC;IAE9B,IAAK,IAAIZ,IAAI,GAAGA,IAAIa,KAAKb,IAAK;QAC5B,IAAIgB,IAAIZ,MAAM,CAACI,cAAcR,EAAE;QAC/B,IAAIiB,IAAIZ,MAAM,CAACC,cAAcN,EAAE;QAC/B,IAAIgB,MAAMC,GAAG,OAAOD,IAAIC,IAAI,CAAC,IAAI;IACnC;IAEA,OAAON,YAAYC;AACrB;AAEA;;;CAGC,GACD,OAAO,SAASM,aAAazB,GAAW,EAAE0B,MAAc,EAAEC,QAAkB;IAC1E,IAAID,SAASC,SAASnB,MAAM,GAAGR,IAAIQ,MAAM,EAAE,OAAO;IAClD,IAAK,IAAID,IAAI,GAAGA,IAAIoB,SAASnB,MAAM,EAAED,IAAK;QACxC,IAAIP,GAAG,CAAC0B,SAASnB,EAAE,KAAKoB,QAAQ,CAACpB,EAAE,EAAE,OAAO;IAC9C;IACA,OAAO;AACT;AAEA;;;CAGC,GACD,OAAO,SAASqB,gBAAgB5B,GAAW,EAAE6B,KAAa,EAAEC,GAAW;IACrE,IAAIC,SAASjC,YAAYgC,MAAMD;IAC/B7B,IAAIgC,IAAI,CAACD,QAAQ,GAAGF,OAAOC;IAC3B,OAAOC;AACT;AAEA;;;;;;CAMC,GACD,OAAO,SAASE,aAAajC,GAAW,EAAE0B,MAAc;IACtD,IAAIQ,MAAMlC,IAAImC,YAAY,CAACT;IAC3B,IAAIU,OAAOpC,IAAImC,YAAY,CAACT,SAAS;IACrC,OAAOU,OAAO,cAAcF;AAC9B;AAEA;;;CAGC,GACD,OAAO,SAASG,cAAcrC,GAAW,EAAEsC,KAAa,EAAEZ,MAAc;IACtE,IAAIQ,MAAMI,UAAU;IACpB,IAAIF,OAAO,AAACE,QAAQ,gBAAiB;IACrCtC,IAAIuC,aAAa,CAACL,KAAKR;IACvB1B,IAAIuC,aAAa,CAACH,MAAMV,SAAS;AACnC;AAEA;;;;;;;CAOC,GACD,OAAO,SAASc,aAAaC,IAA6B,EAAEC,WAAoB;IAC9E,sCAAsC;IACtC,IAAIC,eAAe;IACnB,IAAK,IAAIpC,IAAI,GAAGA,IAAIkC,KAAKjC,MAAM,EAAED,IAAK;QACpCoC,gBAAgBF,IAAI,CAAClC,EAAE,CAACC,MAAM;IAChC;IAEA,6CAA6C;IAC7C,IAAIoC,eAAeF,gBAAgBG,YAAYH,cAAcC;IAE7D,iEAAiE;IACjE,4DAA4D;IAC5D,IAAIG,aAAa;IACjB,IAAK,IAAIC,IAAI,GAAGA,IAAIN,KAAKjC,MAAM,EAAEuC,IAAK;QACpC,IAAI,CAAEN,CAAAA,IAAI,CAACM,EAAE,YAAYxD,MAAK,GAAI;YAChCuD,aAAa;YACb;QACF;IACF;IACA,IAAIA,cAAcF,gBAAgBD,cAAc;QAC9C,OAAOpD,OAAOyD,MAAM,CAACP,MAAkBG;IACzC;IAEA,6DAA6D;IAC7D,IAAIb,SAASjC,YAAY8C;IACzB,IAAIlB,SAAS;IACb,IAAK,IAAIuB,IAAI,GAAGA,IAAIR,KAAKjC,MAAM,IAAIkB,SAASkB,cAAcK,IAAK;QAC7D,IAAIjD,MAAMyC,IAAI,CAACQ,EAAE;QACjB,IAAK,IAAIC,IAAI,GAAGA,IAAIlD,IAAIQ,MAAM,IAAIkB,SAASkB,cAAcM,IAAK;YAC5DnB,MAAM,CAACL,SAAS,GAAG1B,GAAG,CAACkD,EAAE;QAC3B;IACF;IACA,OAAOnB;AACT;AAEA;;;CAGC,GACD,6EAA6E;AAC7E,OAAO,SAASoB,MAAMb,KAAa;IACjC,gEAAgE;IAChE,OAAOA,UAAUA;AACnB"}
+{"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\nvar _require = typeof require === 'undefined' ? Module.createRequire(import.meta.url) : require;\n\n// Feature detection (runs once at module load)\nvar hasBufferAlloc = typeof Buffer.alloc === 'function';\nvar hasBufferAllocUnsafe = typeof Buffer.allocUnsafe === 'function';\nvar hasBufferFrom = typeof Buffer.from === 'function' && Buffer.from !== Uint8Array.from;\n\n/**\n * Allocate a zero-filled buffer (safe)\n * - Uses Buffer.alloc() on Node 4.5+\n * - Falls back to new Buffer() + fill on Node 0.8-4.4\n */\nexport function allocBuffer(size: number): Buffer {\n  if (hasBufferAlloc) {\n    return Buffer.alloc(size);\n  }\n  // Legacy fallback: new Buffer() is uninitialized, must zero-fill\n  var buf = new Buffer(size);\n  buf.fill(0);\n  return buf;\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 *\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 (hasBufferAllocUnsafe) {\n    return Buffer.allocUnsafe(size);\n  }\n  return new Buffer(size);\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    var arr: number[] = [];\n    for (var 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  var sourceLen = sourceEnd - sourceStart;\n  var targetLen = targetEnd - targetStart;\n  var len = Math.min(sourceLen, targetLen);\n\n  for (var i = 0; i < len; i++) {\n    var s = source[sourceStart + i];\n    var 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 (var 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  var 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  var low = buf.readUInt32LE(offset);\n  var 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  var low = value >>> 0;\n  var 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 *\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  var actualLength = 0;\n  for (var i = 0; i < list.length; i++) {\n    actualLength += list[i].length;\n  }\n\n  // Use specified totalLength or actual length\n  var targetLength = totalLength !== undefined ? totalLength : actualLength;\n\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  var allBuffers = true;\n  for (var 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  // Manual concat for mixed types or when truncation is needed\n  var result = allocBuffer(targetLength);\n  var offset = 0;\n  for (var k = 0; k < list.length && offset < targetLength; k++) {\n    var buf = list[k];\n    for (var l = 0; l < buf.length && offset < targetLength; l++) {\n      result[offset++] = buf[l];\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+)\nvar 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}\nvar 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  var pako = _require('pako');\n  return bufferFrom(pako.inflateRaw(input));\n}\n"],"names":["Module","_require","require","createRequire","url","hasBufferAlloc","Buffer","alloc","hasBufferAllocUnsafe","allocUnsafe","hasBufferFrom","from","Uint8Array","allocBuffer","size","buf","fill","allocBufferUnsafe","bufferFrom","data","encoding","arr","i","length","push","bufferCompare","source","target","targetStart","targetEnd","sourceStart","sourceEnd","compare","sourceLen","targetLen","len","Math","min","s","t","bufferEquals","offset","expected","bufferSliceCopy","start","end","result","copy","readUInt64LE","low","readUInt32LE","high","writeUInt64LE","value","writeUInt32LE","bufferConcat","list","totalLength","actualLength","targetLength","undefined","allBuffers","j","concat","k","l","isNaN","zlib","_e","hasNativeInflateRaw","inflateRawSync","inflateRaw","input","pako"],"mappings":"AAAA;;;;;;;;;;;;CAYC,GAED,qDAAqD;AACrD,OAAOA,YAAY,SAAS;AAE5B,IAAIC,WAAW,OAAOC,YAAY,cAAcF,OAAOG,aAAa,CAAC,YAAYC,GAAG,IAAIF;AAExF,+CAA+C;AAC/C,IAAIG,iBAAiB,OAAOC,OAAOC,KAAK,KAAK;AAC7C,IAAIC,uBAAuB,OAAOF,OAAOG,WAAW,KAAK;AACzD,IAAIC,gBAAgB,OAAOJ,OAAOK,IAAI,KAAK,cAAcL,OAAOK,IAAI,KAAKC,WAAWD,IAAI;AAExF;;;;CAIC,GACD,OAAO,SAASE,YAAYC,IAAY;IACtC,IAAIT,gBAAgB;QAClB,OAAOC,OAAOC,KAAK,CAACO;IACtB;IACA,iEAAiE;IACjE,IAAIC,MAAM,IAAIT,OAAOQ;IACrBC,IAAIC,IAAI,CAAC;IACT,OAAOD;AACT;AAEA;;;;;;;CAOC,GACD,OAAO,SAASE,kBAAkBH,IAAY;IAC5C,IAAIN,sBAAsB;QACxB,OAAOF,OAAOG,WAAW,CAACK;IAC5B;IACA,OAAO,IAAIR,OAAOQ;AACpB;AAEA;;;;;CAKC,GACD,OAAO,SAASI,WAAWC,IAA6C,EAAEC,QAAyB;IACjG,IAAIV,eAAe;QACjB,IAAI,OAAOS,SAAS,UAAU;YAC5B,OAAOb,OAAOK,IAAI,CAACQ,MAAMC;QAC3B;QACA,OAAOd,OAAOK,IAAI,CAACQ;IACrB;IACA,yDAAyD;IACzD,gFAAgF;IAChF,IAAIA,gBAAgBP,cAAc,CAAEO,CAAAA,gBAAgBb,MAAK,GAAI;QAC3D,IAAIe,MAAgB,EAAE;QACtB,IAAK,IAAIC,IAAI,GAAGA,IAAIH,KAAKI,MAAM,EAAED,IAAK;YACpCD,IAAIG,IAAI,CAACL,IAAI,CAACG,EAAE;QAClB;QACA,OAAO,IAAIhB,OAAOe;IACpB;IACA,OAAO,IAAIf,OAAOa,MAA2BC;AAC/C;AAEA;;;;CAIC,GACD,OAAO,SAASK,cAAcC,MAAc,EAAEC,MAAc,EAAEC,WAAoB,EAAEC,SAAkB,EAAEC,WAAoB,EAAEC,SAAkB;IAC9ID,cAAcA,eAAe;IAC7BC,YAAYA,aAAaL,OAAOH,MAAM;IACtCK,cAAcA,eAAe;IAC7BC,YAAYA,aAAaF,OAAOJ,MAAM;IAEtC,kEAAkE;IAClE,IAAIG,OAAOM,OAAO,IAAIN,OAAOM,OAAO,CAACT,MAAM,IAAI,GAAG;QAChD,OAAOG,OAAOM,OAAO,CAACL,QAAQC,aAAaC,WAAWC,aAAaC;IACrE;IAEA,4CAA4C;IAC5C,IAAIE,YAAYF,YAAYD;IAC5B,IAAII,YAAYL,YAAYD;IAC5B,IAAIO,MAAMC,KAAKC,GAAG,CAACJ,WAAWC;IAE9B,IAAK,IAAIZ,IAAI,GAAGA,IAAIa,KAAKb,IAAK;QAC5B,IAAIgB,IAAIZ,MAAM,CAACI,cAAcR,EAAE;QAC/B,IAAIiB,IAAIZ,MAAM,CAACC,cAAcN,EAAE;QAC/B,IAAIgB,MAAMC,GAAG,OAAOD,IAAIC,IAAI,CAAC,IAAI;IACnC;IAEA,OAAON,YAAYC;AACrB;AAEA;;;CAGC,GACD,OAAO,SAASM,aAAazB,GAAW,EAAE0B,MAAc,EAAEC,QAAkB;IAC1E,IAAID,SAASC,SAASnB,MAAM,GAAGR,IAAIQ,MAAM,EAAE,OAAO;IAClD,IAAK,IAAID,IAAI,GAAGA,IAAIoB,SAASnB,MAAM,EAAED,IAAK;QACxC,IAAIP,GAAG,CAAC0B,SAASnB,EAAE,KAAKoB,QAAQ,CAACpB,EAAE,EAAE,OAAO;IAC9C;IACA,OAAO;AACT;AAEA;;;CAGC,GACD,OAAO,SAASqB,gBAAgB5B,GAAW,EAAE6B,KAAa,EAAEC,GAAW;IACrE,IAAIC,SAASjC,YAAYgC,MAAMD;IAC/B7B,IAAIgC,IAAI,CAACD,QAAQ,GAAGF,OAAOC;IAC3B,OAAOC;AACT;AAEA;;;;;;CAMC,GACD,OAAO,SAASE,aAAajC,GAAW,EAAE0B,MAAc;IACtD,IAAIQ,MAAMlC,IAAImC,YAAY,CAACT;IAC3B,IAAIU,OAAOpC,IAAImC,YAAY,CAACT,SAAS;IACrC,OAAOU,OAAO,cAAcF;AAC9B;AAEA;;;CAGC,GACD,OAAO,SAASG,cAAcrC,GAAW,EAAEsC,KAAa,EAAEZ,MAAc;IACtE,IAAIQ,MAAMI,UAAU;IACpB,IAAIF,OAAO,AAACE,QAAQ,gBAAiB;IACrCtC,IAAIuC,aAAa,CAACL,KAAKR;IACvB1B,IAAIuC,aAAa,CAACH,MAAMV,SAAS;AACnC;AAEA;;;;;;;CAOC,GACD,OAAO,SAASc,aAAaC,IAA6B,EAAEC,WAAoB;IAC9E,sCAAsC;IACtC,IAAIC,eAAe;IACnB,IAAK,IAAIpC,IAAI,GAAGA,IAAIkC,KAAKjC,MAAM,EAAED,IAAK;QACpCoC,gBAAgBF,IAAI,CAAClC,EAAE,CAACC,MAAM;IAChC;IAEA,6CAA6C;IAC7C,IAAIoC,eAAeF,gBAAgBG,YAAYH,cAAcC;IAE7D,iEAAiE;IACjE,4DAA4D;IAC5D,IAAIG,aAAa;IACjB,IAAK,IAAIC,IAAI,GAAGA,IAAIN,KAAKjC,MAAM,EAAEuC,IAAK;QACpC,IAAI,CAAEN,CAAAA,IAAI,CAACM,EAAE,YAAYxD,MAAK,GAAI;YAChCuD,aAAa;YACb;QACF;IACF;IACA,IAAIA,cAAcF,gBAAgBD,cAAc;QAC9C,OAAOpD,OAAOyD,MAAM,CAACP,MAAkBG;IACzC;IAEA,6DAA6D;IAC7D,IAAIb,SAASjC,YAAY8C;IACzB,IAAIlB,SAAS;IACb,IAAK,IAAIuB,IAAI,GAAGA,IAAIR,KAAKjC,MAAM,IAAIkB,SAASkB,cAAcK,IAAK;QAC7D,IAAIjD,MAAMyC,IAAI,CAACQ,EAAE;QACjB,IAAK,IAAIC,IAAI,GAAGA,IAAIlD,IAAIQ,MAAM,IAAIkB,SAASkB,cAAcM,IAAK;YAC5DnB,MAAM,CAACL,SAAS,GAAG1B,GAAG,CAACkD,EAAE;QAC3B;IACF;IACA,OAAOnB;AACT;AAEA;;;CAGC,GACD,6EAA6E;AAC7E,OAAO,SAASoB,MAAMb,KAAa;IACjC,gEAAgE;IAChE,OAAOA,UAAUA;AACnB;AAEA;;;;;;;;CAQC,GACD,iEAAiE;AACjE,IAAIc,OAAqC;AACzC,IAAI;IACFA,OAAOlE,SAAS;AAClB,EAAE,OAAOmE,IAAI;AACX,mDAAmD;AACrD;AACA,IAAIC,sBAAsBF,SAAS,QAAQ,OAAOA,KAAKG,cAAc,KAAK;AAE1E,OAAO,SAASC,WAAWC,KAAa;IACtC,IAAIH,uBAAuBF,MAAM;QAC/B,OAAOA,KAAKG,cAAc,CAACE;IAC7B;IACA,qCAAqC;IACrC,IAAIC,OAAOxE,SAAS;IACpB,OAAOiB,WAAWuD,KAAKF,UAAU,CAACC;AACpC"}

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

@@ -9,6 +9,7 @@
  *
  * All utilities support Node.js 0.8+
  */
-export { allocBuffer, allocBufferUnsafe, bufferCompare, bufferConcat, bufferEquals, bufferFrom, bufferSliceCopy, isNaN, readUInt64LE, writeUInt64LE, } from './compat.js';
+export { default as BufferList } from './BufferList.js';
+export { allocBuffer, allocBufferUnsafe, bufferCompare, bufferConcat, bufferEquals, bufferFrom, bufferSliceCopy, inflateRaw, isNaN, readUInt64LE, writeUInt64LE, } from './compat.js';
 export { crc32, crc32Region, verifyCrc32, verifyCrc32Region } from './crc32.js';
 export { default as EntryStream } from './EntryStream.js';

package/dist/esm/shared/index.js

@@ -8,6 +8,7 @@
  * - Any other archive iterator library
  *
  * All utilities support Node.js 0.8+
- */ export { allocBuffer, allocBufferUnsafe, bufferCompare, bufferConcat, bufferEquals, bufferFrom, bufferSliceCopy, isNaN, readUInt64LE, writeUInt64LE } from './compat.js';
+ */ export { default as BufferList } from './BufferList.js';
+export { allocBuffer, allocBufferUnsafe, bufferCompare, bufferConcat, bufferEquals, bufferFrom, bufferSliceCopy, inflateRaw, isNaN, readUInt64LE, writeUInt64LE } from './compat.js';
 export { crc32, crc32Region, verifyCrc32, verifyCrc32Region } from './crc32.js';
 export { default as EntryStream } from './EntryStream.js';

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

@@ -1 +1 @@
-{"version":3,"sources":["/Users/kevin/Dev/OpenSource/iterators/extract-base-iterator/src/shared/index.ts"],"sourcesContent":["/**\n * Shared utilities for iterator libraries\n *\n * These utilities are designed to be used by:\n * - zip-iterator\n * - 7z-iterator\n * - tar-iterator\n * - Any other archive iterator library\n *\n * All utilities support Node.js 0.8+\n */\n\nexport {\n  allocBuffer,\n  allocBufferUnsafe,\n  bufferCompare,\n  bufferConcat,\n  bufferEquals,\n  bufferFrom,\n  bufferSliceCopy,\n  isNaN,\n  readUInt64LE,\n  writeUInt64LE,\n} from './compat.ts';\n\nexport { crc32, crc32Region, verifyCrc32, verifyCrc32Region } from './crc32.ts';\n\nexport { default as EntryStream } from './EntryStream.ts';\n"],"names":["allocBuffer","allocBufferUnsafe","bufferCompare","bufferConcat","bufferEquals","bufferFrom","bufferSliceCopy","isNaN","readUInt64LE","writeUInt64LE","crc32","crc32Region","verifyCrc32","verifyCrc32Region","default","EntryStream"],"mappings":"AAAA;;;;;;;;;;CAUC,GAED,SACEA,WAAW,EACXC,iBAAiB,EACjBC,aAAa,EACbC,YAAY,EACZC,YAAY,EACZC,UAAU,EACVC,eAAe,EACfC,KAAK,EACLC,YAAY,EACZC,aAAa,QACR,cAAc;AAErB,SAASC,KAAK,EAAEC,WAAW,EAAEC,WAAW,EAAEC,iBAAiB,QAAQ,aAAa;AAEhF,SAASC,WAAWC,WAAW,QAAQ,mBAAmB"}
+{"version":3,"sources":["/Users/kevin/Dev/OpenSource/iterators/extract-base-iterator/src/shared/index.ts"],"sourcesContent":["/**\n * Shared utilities for iterator libraries\n *\n * These utilities are designed to be used by:\n * - zip-iterator\n * - 7z-iterator\n * - tar-iterator\n * - Any other archive iterator library\n *\n * All utilities support Node.js 0.8+\n */\n\nexport { default as BufferList } from './BufferList.ts';\nexport {\n  allocBuffer,\n  allocBufferUnsafe,\n  bufferCompare,\n  bufferConcat,\n  bufferEquals,\n  bufferFrom,\n  bufferSliceCopy,\n  inflateRaw,\n  isNaN,\n  readUInt64LE,\n  writeUInt64LE,\n} from './compat.ts';\nexport { crc32, crc32Region, verifyCrc32, verifyCrc32Region } from './crc32.ts';\nexport { default as EntryStream } from './EntryStream.ts';\n"],"names":["default","BufferList","allocBuffer","allocBufferUnsafe","bufferCompare","bufferConcat","bufferEquals","bufferFrom","bufferSliceCopy","inflateRaw","isNaN","readUInt64LE","writeUInt64LE","crc32","crc32Region","verifyCrc32","verifyCrc32Region","EntryStream"],"mappings":"AAAA;;;;;;;;;;CAUC,GAED,SAASA,WAAWC,UAAU,QAAQ,kBAAkB;AACxD,SACEC,WAAW,EACXC,iBAAiB,EACjBC,aAAa,EACbC,YAAY,EACZC,YAAY,EACZC,UAAU,EACVC,eAAe,EACfC,UAAU,EACVC,KAAK,EACLC,YAAY,EACZC,aAAa,QACR,cAAc;AACrB,SAASC,KAAK,EAAEC,WAAW,EAAEC,WAAW,EAAEC,iBAAiB,QAAQ,aAAa;AAChF,SAAShB,WAAWiB,WAAW,QAAQ,mBAAmB"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "extract-base-iterator",
-  "version": "2.3.2",
+  "version": "2.4.0",
   "description": "Base iterator for extract iterators like tar-iterator and zip-iterator",
   "keywords": [
     "extract",
@@ -37,7 +37,7 @@
     "build": "tsds build",
     "format": "biome check --write --unsafe",
     "prepublishOnly": "tsds validate",
-    "test": "mocha --no-timeouts test/**/*.test.*",
+    "test": "tsds test:node --no-timeouts",
     "test:engines": "nvu engines tsds test:node --no-timeouts",
     "version": "tsds version"
   },
@@ -48,19 +48,23 @@
     "mkdirp-classic": "*",
     "next-tick": "*",
     "object-assign": "*",
+    "pako": "*",
     "queue-cb": "*",
     "readable-stream": "^2.3.8",
     "rimraf2": "*",
     "stack-base-iterator": "*"
   },
   "devDependencies": {
+    "@biomejs/biome": "*",
     "@types/mocha": "*",
     "@types/node": "*",
     "cr": "*",
     "fs-iterator": "*",
     "fs-stats-spys": "*",
     "lodash.find": "*",
-    "pinkie-promise": "*"
+    "node-version-use": "*",
+    "pinkie-promise": "*",
+    "ts-dev-stack": "*"
   },
   "engines": {
     "node": ">=0.8"