@ssttevee/streamsearch 0.3.1 → 0.4.0

package/lib/search.mjs

@@ -0,0 +1,185 @@
+import { concat } from 'uint8arrays/concat';
+import { fromString } from 'uint8arrays/from-string';
+
+/*
+  Based heavily on the Streaming Boyer-Moore-Horspool C++ implementation
+  by Hongli Lai at: https://github.com/FooBarWidget/boyer-moore-horspool
+*/
+function jsmemcmp(buf1, pos1, buf2, pos2, len) {
+    for (let i = 0; i < len; i++) {
+        if (buf1[pos1 + i] !== buf2[pos2 + i]) {
+            return false;
+        }
+    }
+    return true;
+}
+function createOccurenceTable(s) {
+    // Populate occurrence table with analysis of the needle,
+    // ignoring last letter.
+    const table = new Array(256).fill(s.length);
+    if (s.length > 1) {
+        for (let i = 0; i < s.length - 1; i++) {
+            table[s[i]] = s.length - 1 - i;
+        }
+    }
+    return table;
+}
+const MATCH = Symbol("Match");
+class StreamSearch {
+    _needle;
+    _lastChar;
+    _occ;
+    _lookbehind = new Uint8Array();
+    constructor(needle) {
+        if (typeof needle === "string") {
+            this._needle = needle = fromString(needle);
+        }
+        else {
+            this._needle = needle;
+        }
+        this._lastChar = needle[needle.length - 1];
+        this._occ = createOccurenceTable(needle);
+    }
+    feed(chunk) {
+        let pos = 0;
+        let tokens;
+        const allTokens = [];
+        while (pos !== chunk.length) {
+            [pos, ...tokens] = this._feed(chunk, pos);
+            allTokens.push(...tokens);
+        }
+        return allTokens;
+    }
+    end() {
+        const tail = this._lookbehind;
+        this._lookbehind = new Uint8Array();
+        return tail;
+    }
+    _feed(data, buf_pos) {
+        const tokens = [];
+        // Positive: points to a position in `data`
+        //           pos == 3 points to data[3]
+        // Negative: points to a position in the lookbehind buffer
+        //           pos == -2 points to lookbehind[lookbehind_size - 2]
+        let pos = -this._lookbehind.length;
+        if (pos < 0) {
+            // Lookbehind buffer is not empty. Perform Boyer-Moore-Horspool
+            // search with character lookup code that considers both the
+            // lookbehind buffer and the current round's haystack data.
+            //
+            // Loop until (condition 1)
+            //   there is a match.
+            // or until
+            //   we've moved past the position that requires the
+            //   lookbehind buffer. In this case we switch to the
+            //   optimized loop.
+            // or until (condition 3)
+            //   the character to look at lies outside the haystack.
+            while (pos < 0 && pos <= data.length - this._needle.length) {
+                const cpos = pos + this._needle.length - 1;
+                const ch = cpos < 0
+                    ? this._lookbehind[this._lookbehind.length + cpos]
+                    : data[cpos];
+                if (ch === this._lastChar &&
+                    this._memcmp(data, pos, this._needle.length - 1)) {
+                    if (pos > -this._lookbehind.length) {
+                        tokens.push(this._lookbehind.subarray(0, this._lookbehind.length + pos));
+                    }
+                    tokens.push(MATCH);
+                    this._lookbehind = new Uint8Array();
+                    return [pos + this._needle.length, ...tokens];
+                }
+                else {
+                    pos += this._occ[ch];
+                }
+            }
+            // No match.
+            if (pos < 0) {
+                // There's too little data for Boyer-Moore-Horspool to run,
+                // so we'll use a different algorithm to skip as much as
+                // we can.
+                // Forward pos until
+                //   the trailing part of lookbehind + data
+                //   looks like the beginning of the needle
+                // or until
+                //   pos == 0
+                while (pos < 0 && !this._memcmp(data, pos, data.length - pos)) {
+                    pos++;
+                }
+            }
+            if (pos >= 0) {
+                // Discard lookbehind buffer.
+                tokens.push(this._lookbehind);
+                this._lookbehind = new Uint8Array();
+            }
+            else {
+                // Cut off part of the lookbehind buffer that has
+                // been processed and append the entire haystack
+                // into it.
+                const bytesToCutOff = this._lookbehind.length + pos;
+                if (bytesToCutOff > 0) {
+                    // The cut off data is guaranteed not to contain the needle.
+                    tokens.push(this._lookbehind.subarray(0, bytesToCutOff));
+                    this._lookbehind = this._lookbehind.subarray(bytesToCutOff);
+                }
+                this._lookbehind = concat([this._lookbehind, data]);
+                return [data.length, ...tokens];
+            }
+        }
+        pos += buf_pos;
+        // Lookbehind buffer is now empty. Perform Boyer-Moore-Horspool
+        // search with optimized character lookup code that only considers
+        // the current round's haystack data.
+        while (pos <= data.length - this._needle.length) {
+            const ch = data[pos + this._needle.length - 1];
+            if (ch === this._lastChar &&
+                data[pos] === this._needle[0] &&
+                jsmemcmp(this._needle, 0, data, pos, this._needle.length - 1)) {
+                if (pos > buf_pos) {
+                    tokens.push(data.subarray(buf_pos, pos));
+                }
+                tokens.push(MATCH);
+                return [pos + this._needle.length, ...tokens];
+            }
+            else {
+                pos += this._occ[ch];
+            }
+        }
+        // There was no match. If there's trailing haystack data that we cannot
+        // match yet using the Boyer-Moore-Horspool algorithm (because the trailing
+        // data is less than the needle size) then match using a modified
+        // algorithm that starts matching from the beginning instead of the end.
+        // Whatever trailing data is left after running this algorithm is added to
+        // the lookbehind buffer.
+        if (pos < data.length) {
+            while (pos < data.length &&
+                (data[pos] !== this._needle[0] ||
+                    !jsmemcmp(data, pos, this._needle, 0, data.length - pos))) {
+                ++pos;
+            }
+            if (pos < data.length) {
+                this._lookbehind = data.subarray(pos);
+            }
+        }
+        // Everything until pos is guaranteed not to contain needle data.
+        if (pos > 0) {
+            tokens.push(data.subarray(buf_pos, pos < data.length ? pos : data.length));
+        }
+        return [data.length, ...tokens];
+    }
+    _memcmp(data, pos, len) {
+        if (pos < 0) {
+            if (!jsmemcmp(this._lookbehind, this._lookbehind.length + pos, this._needle, 0, Math.min(-pos, len))) {
+                return false;
+            }
+            if (len < -pos) {
+                return true;
+            }
+            len += pos;
+        }
+        return jsmemcmp(data, Math.max(0, pos), this._needle, -Math.min(0, pos), len);
+    }
+}
+
+export { MATCH, StreamSearch };
+//# sourceMappingURL=search.mjs.map

package/lib/search.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"search.mjs","sources":["../src/search.ts"],"sourcesContent":[null],"names":[],"mappings":";;;AAAA;;;AAGE;AAKF,SAAS,QAAQ,CAChB,IAAgB,EAChB,IAAY,EACZ,IAAgB,EAChB,IAAY,EACZ,GAAW,EAAA;AAEX,IAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;AAC7B,QAAA,IAAI,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,EAAE;AACtC,YAAA,OAAO,KAAK;QACb;IACD;AAEA,IAAA,OAAO,IAAI;AACZ;AAEA,SAAS,oBAAoB,CAAC,CAAa,EAAA;;;AAG1C,IAAA,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC;AAC3C,IAAA,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE;AACjB,QAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;AACtC,YAAA,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC;QAC/B;IACD;AAEA,IAAA,OAAO,KAAK;AACb;MAEa,KAAK,GAAG,MAAM,CAAC,OAAO;MAItB,YAAY,CAAA;AAChB,IAAA,OAAO;AACP,IAAA,SAAS;AACT,IAAA,IAAI;AAEJ,IAAA,WAAW,GAAe,IAAI,UAAU,EAAE;AAElD,IAAA,WAAA,CAAmB,MAA2B,EAAA;AAC7C,QAAA,IAAI,OAAO,MAAM,KAAK,QAAQ,EAAE;YAC/B,IAAI,CAAC,OAAO,GAAG,MAAM,GAAG,UAAU,CAAC,MAAM,CAAC;QAC3C;aAAO;AACN,YAAA,IAAI,CAAC,OAAO,GAAG,MAAM;QACtB;QAEA,IAAI,CAAC,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;AAC1C,QAAA,IAAI,CAAC,IAAI,GAAG,oBAAoB,CAAC,MAAM,CAAC;IACzC;AAEO,IAAA,IAAI,CAAC,KAAiB,EAAA;QAC5B,IAAI,GAAG,GAAG,CAAC;AACX,QAAA,IAAI,MAAe;QACnB,MAAM,SAAS,GAAY,EAAE;AAC7B,QAAA,OAAO,GAAG,KAAK,KAAK,CAAC,MAAM,EAAE;AAC5B,YAAA,CAAC,GAAG,EAAE,GAAG,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC;AACzC,YAAA,SAAS,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC;QAC1B;AAEA,QAAA,OAAO,SAAS;IACjB;IAEO,GAAG,GAAA;AACT,QAAA,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW;AAC7B,QAAA,IAAI,CAAC,WAAW,GAAG,IAAI,UAAU,EAAE;AACnC,QAAA,OAAO,IAAI;IACZ;IAEQ,KAAK,CAAC,IAAgB,EAAE,OAAe,EAAA;QAC9C,MAAM,MAAM,GAAY,EAAE;;;;;QAM1B,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM;AAElC,QAAA,IAAI,GAAG,GAAG,CAAC,EAAE;;;;;;;;;;;;;AAaZ,YAAA,OAAO,GAAG,GAAG,CAAC,IAAI,GAAG,IAAI,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE;gBAC3D,MAAM,IAAI,GAAG,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC;AAC1C,gBAAA,MAAM,EAAE,GACP,IAAI,GAAG;AACN,sBAAE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,IAAI;AACjD,sBAAE,IAAI,CAAC,IAAI,CAAC;AAEd,gBAAA,IACC,EAAE,KAAK,IAAI,CAAC,SAAS;AACrB,oBAAA,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,EAC/C;oBACD,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE;wBACnC,MAAM,CAAC,IAAI,CACV,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,GAAG,CAAC,CAC3D;oBACF;AAEA,oBAAA,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC;AAElB,oBAAA,IAAI,CAAC,WAAW,GAAG,IAAI,UAAU,EAAE;AAEnC,oBAAA,OAAO,CAAC,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,MAAM,CAAC;gBAC9C;qBAAO;AACN,oBAAA,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gBACrB;YACD;;AAIA,YAAA,IAAI,GAAG,GAAG,CAAC,EAAE;;;;;;;;;gBASZ,OAAO,GAAG,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,EAAE;AAC9D,oBAAA,GAAG,EAAE;gBACN;YACD;AAEA,YAAA,IAAI,GAAG,IAAI,CAAC,EAAE;;AAEb,gBAAA,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC;AAC7B,gBAAA,IAAI,CAAC,WAAW,GAAG,IAAI,UAAU,EAAE;YACpC;iBAAO;;;;gBAIN,MAAM,aAAa,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,GAAG;AAEnD,gBAAA,IAAI,aAAa,GAAG,CAAC,EAAE;;AAEtB,oBAAA,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC;oBACxD,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,aAAa,CAAC;gBAC5D;AAEA,gBAAA,IAAI,CAAC,WAAW,GAAG,MAAM,CAAC,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC;gBAEnD,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,MAAM,CAAC;YAChC;QACD;QAEA,GAAG,IAAI,OAAO;;;;AAKd,QAAA,OAAO,GAAG,IAAI,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE;AAChD,YAAA,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;AAE9C,YAAA,IACC,EAAE,KAAK,IAAI,CAAC,SAAS;gBACrB,IAAI,CAAC,GAAG,CAAC,KAAK,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;gBAC7B,QAAQ,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,EAC5D;AACD,gBAAA,IAAI,GAAG,GAAG,OAAO,EAAE;AAClB,oBAAA,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;gBACzC;AAEA,gBAAA,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC;AAElB,gBAAA,OAAO,CAAC,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,MAAM,CAAC;YAC9C;iBAAO;AACN,gBAAA,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YACrB;QACD;;;;;;;AAQA,QAAA,IAAI,GAAG,GAAG,IAAI,CAAC,MAAM,EAAE;AACtB,YAAA,OACC,GAAG,GAAG,IAAI,CAAC,MAAM;iBAChB,IAAI,CAAC,GAAG,CAAC,KAAK,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;oBAC7B,CAAC,QAAQ,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,OAAO,EAAE,CAAC,EAAE,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,EACzD;AACD,gBAAA,EAAE,GAAG;YACN;AAEA,YAAA,IAAI,GAAG,GAAG,IAAI,CAAC,MAAM,EAAE;gBACtB,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC;YACtC;QACD;;AAGA,QAAA,IAAI,GAAG,GAAG,CAAC,EAAE;YACZ,MAAM,CAAC,IAAI,CACV,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,GAAG,GAAG,IAAI,CAAC,MAAM,GAAG,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,CAC7D;QACF;QAEA,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,MAAM,CAAC;IAChC;AAEQ,IAAA,OAAO,CAAC,IAAgB,EAAE,GAAW,EAAE,GAAW,EAAA;AACzD,QAAA,IAAI,GAAG,GAAG,CAAC,EAAE;AACZ,YAAA,IACC,CAAC,QAAQ,CACR,IAAI,CAAC,WAAW,EAChB,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,GAAG,EAC7B,IAAI,CAAC,OAAO,EACZ,CAAC,EACD,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CACnB,EACA;AACD,gBAAA,OAAO,KAAK;YACb;AAEA,YAAA,IAAI,GAAG,GAAG,CAAC,GAAG,EAAE;AACf,gBAAA,OAAO,IAAI;YACZ;YAEA,GAAG,IAAI,GAAG;QACX;AAEA,QAAA,OAAO,QAAQ,CACd,IAAI,EACJ,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,EAChB,IAAI,CAAC,OAAO,EACZ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,EACjB,GAAG,CACH;IACF;AACA;;;;"}

package/lib/split.cjs

@@ -0,0 +1,26 @@
+'use strict';
+
+var concat = require('uint8arrays/concat');
+var search = require('./search.cjs');
+require('uint8arrays/from-string');
+
+function split(chunks, needle) {
+    const search$1 = new search.StreamSearch(needle);
+    const outchunks = [[]];
+    for (const chunk of Array.isArray(chunks) ? chunks : [chunks]) {
+        for (const token of search$1.feed(chunk)) {
+            if (token === search.MATCH) {
+                outchunks.push([]);
+            }
+            else {
+                outchunks[outchunks.length - 1].push(token);
+            }
+        }
+    }
+    const end = search$1.end();
+    outchunks[outchunks.length - 1].push(end);
+    return outchunks.map((chunks) => concat.concat(chunks));
+}
+
+exports.split = split;
+//# sourceMappingURL=split.cjs.map

package/lib/split.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"split.cjs","sources":["../src/split.ts"],"sourcesContent":[null],"names":["search","StreamSearch","MATCH","concat"],"mappings":";;;;;;AAIM,SAAU,KAAK,CACpB,MAAiC,EACjC,MAA2B,EAAA;AAE3B,IAAA,MAAMA,QAAM,GAAG,IAAIC,mBAAY,CAAC,MAAM,CAAC;AAEvC,IAAA,MAAM,SAAS,GAAmB,CAAC,EAAE,CAAC;IACtC,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,MAAM,GAAG,CAAC,MAAM,CAAC,EAAE;QAC9D,KAAK,MAAM,KAAK,IAAID,QAAM,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE;AACvC,YAAA,IAAI,KAAK,KAAKE,YAAK,EAAE;AACpB,gBAAA,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;YACnB;iBAAO;AACN,gBAAA,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;YAC5C;QACD;IACD;AAEA,IAAA,MAAM,GAAG,GAAGF,QAAM,CAAC,GAAG,EAAE;AACxB,IAAA,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC;AAEzC,IAAA,OAAO,SAAS,CAAC,GAAG,CAAC,CAAC,MAAM,KAAKG,aAAM,CAAC,MAAM,CAAC,CAAC;AACjD;;;;"}

package/lib/split.d.ts

@@ -0,0 +1 @@
+export declare function split(chunks: Uint8Array | Uint8Array[], needle: Uint8Array | string): Uint8Array[];

package/lib/split.mjs

@@ -0,0 +1,24 @@
+import { concat } from 'uint8arrays/concat';
+import { StreamSearch, MATCH } from './search.mjs';
+import 'uint8arrays/from-string';
+
+function split(chunks, needle) {
+    const search = new StreamSearch(needle);
+    const outchunks = [[]];
+    for (const chunk of Array.isArray(chunks) ? chunks : [chunks]) {
+        for (const token of search.feed(chunk)) {
+            if (token === MATCH) {
+                outchunks.push([]);
+            }
+            else {
+                outchunks[outchunks.length - 1].push(token);
+            }
+        }
+    }
+    const end = search.end();
+    outchunks[outchunks.length - 1].push(end);
+    return outchunks.map((chunks) => concat(chunks));
+}
+
+export { split };
+//# sourceMappingURL=split.mjs.map

package/lib/split.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"split.mjs","sources":["../src/split.ts"],"sourcesContent":[null],"names":[],"mappings":";;;;AAIM,SAAU,KAAK,CACpB,MAAiC,EACjC,MAA2B,EAAA;AAE3B,IAAA,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,MAAM,CAAC;AAEvC,IAAA,MAAM,SAAS,GAAmB,CAAC,EAAE,CAAC;IACtC,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,MAAM,GAAG,CAAC,MAAM,CAAC,EAAE;QAC9D,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE;AACvC,YAAA,IAAI,KAAK,KAAK,KAAK,EAAE;AACpB,gBAAA,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;YACnB;iBAAO;AACN,gBAAA,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;YAC5C;QACD;IACD;AAEA,IAAA,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,EAAE;AACxB,IAAA,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC;AAEzC,IAAA,OAAO,SAAS,CAAC,GAAG,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,MAAM,CAAC,CAAC;AACjD;;;;"}

package/package.json

@@ -1,39 +1,87 @@
 {
-  "name": "@ssttevee/streamsearch",
-  "version": "0.3.1",
-  "description": "A port of streamsearch for es modules using Web APIs",
-  "main": "lib/index.js",
-  "module": "lib/index.mjs",
-  "source": "src/index.ts",
-  "files": [
-    "lib/**/*"
-  ],
-  "scripts": {
-    "test": "tap --no-ts --node-arg=-r --node-arg=ts-node/register src/**/*.test.ts",
-    "coverage": "nyc -a -n src/**/*.ts -x src/**/*.test.ts -e .ts -r lcov -r text npm test",
-    "fuzz": "ts-node testing/fuzz.ts",
-    "build": "rollup -c && tsc -d --emitDeclarationOnly --declarationDir lib",
-    "prepack": "npm run build"
-  },
-  "repository": {
-    "type": "git",
-    "url": "git+https://github.com/ssttevee/js-streamsearch"
-  },
-  "keywords": [],
-  "author": "ssttevee",
-  "license": "MIT",
-  "devDependencies": {
-    "@rollup/plugin-typescript": "^5.0.2",
-    "@types/tap": "^14.10.0",
-    "esm": "^3.2.25",
-    "nyc": "^14.1.1",
-    "rollup": "^2.23.1",
-    "tap": "^14.10.8",
-    "ts-node": "^8.10.2",
-    "tslib": "^2.0.1",
-    "typescript": "^3.9.7"
-  },
-  "dependencies": {
-    "@ssttevee/u8-utils": "~0.1.5"
-  }
+	"name": "@ssttevee/streamsearch",
+	"version": "0.4.0",
+	"type": "module",
+	"description": "A port of streamsearch for es modules using Web APIs",
+	"main": "lib/index.js",
+	"module": "lib/index.mjs",
+	"source": "src/index.ts",
+	"files": [
+		"lib/**/*"
+	],
+	"scripts": {
+		"test": "tap run",
+		"coverage": "npm run test --  --coverage-report=lcov --coverage-report=text",
+		"fuzz": "ts-node testing/fuzz.ts",
+		"build": "rollup -c && tsc -d --emitDeclarationOnly --declarationDir lib",
+		"prepack": "npm run build"
+	},
+	"repository": {
+		"type": "git",
+		"url": "git+https://github.com/ssttevee/js-streamsearch"
+	},
+	"keywords": [],
+	"author": "ssttevee",
+	"license": "MIT",
+	"devDependencies": {
+		"@biomejs/biome": "^2.3.13",
+		"@rollup/plugin-typescript": "^12.3.0",
+		"@types/tap": "^18.0.0",
+		"esm": "^3.2.25",
+		"rollup": "^4.57.0",
+		"tap": "^21.5.0",
+		"ts-node": "^10.9.2",
+		"tslib": "^2.8.1",
+		"typescript": "^5.9.3"
+	},
+	"dependencies": {
+		"uint8arrays": "^5.1.0"
+	},
+	"exports": {
+		".": {
+			"import": "./lib/index.mjs",
+			"require": "./lib/index.cjs",
+			"types": "./lib/index.d.ts"
+		},
+		"./iterate-chunks": {
+			"import": "./lib/iterate-chunks.mjs",
+			"require": "./lib/iterate-chunks.cjs",
+			"types": "./lib/iterate-chunks.d.ts"
+		},
+		"./iterate-chunks-concatted": {
+			"import": "./lib/iterate-chunks-concatted.mjs",
+			"require": "./lib/iterate-chunks-concatted.cjs",
+			"types": "./lib/iterate-chunks-concatted.d.ts"
+		},
+		"./iterate-strings": {
+			"import": "./lib/iterate-strings.mjs",
+			"require": "./lib/iterate-strings.cjs",
+			"types": "./lib/iterate-strings.d.ts"
+		},
+		"./iterator": {
+			"import": "./lib/iterator.mjs",
+			"require": "./lib/iterator.cjs",
+			"types": "./lib/iterator.d.ts"
+		},
+		"./queuable": {
+			"import": "./lib/queuable.mjs",
+			"require": "./lib/queuable.cjs",
+			"types": "./lib/queuable.d.ts"
+		},
+		"./readable": {
+			"import": "./lib/readable.mjs",
+			"require": "./lib/readable.cjs",
+			"types": "./lib/readable.d.ts"
+		},
+		"./search": {
+			"import": "./lib/search.mjs",
+			"require": "./lib/search.cjs",
+			"types": "./lib/search.d.ts"
+		},
+		"./split": {
+			"import": "./lib/split.mjs",
+			"require": "./lib/split.cjs",
+			"types": "./lib/split.d.ts"
+		}
+	}
 }