@ssttevee/streamsearch 0.3.0 → 0.4.0

package/lib/index.mjs

@@ -1,260 +1,25 @@
-import { stringToArray, mergeArrays, arrayToString } from '@ssttevee/u8-utils';
+import { iterateStrings } from './iterate-strings.mjs';
+export { iterateChunks } from './iterate-chunks.mjs';
+export { iterateChunksConcatted } from './iterate-chunks-concatted.mjs';
+export { IteratorStreamSearch } from './iterator.mjs';
+export { QueueableStreamSearch } from './queueable.mjs';
+export { ReadableStreamSearch } from './readable.mjs';
+export { MATCH, StreamSearch } from './search.mjs';
+export { split } from './split.mjs';
+import 'uint8arrays/concat';
+import 'uint8arrays/to-string';
+import '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 coerce(a) {
-    if (a instanceof Uint8Array) {
-        return (index) => a[index];
-    }
-    return a;
-}
-function jsmemcmp(buf1, pos1, buf2, pos2, len) {
-    const fn1 = coerce(buf1);
-    const fn2 = coerce(buf2);
-    for (var i = 0; i < len; ++i) {
-        if (fn1(pos1 + i) !== fn2(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 {
-    constructor(needle) {
-        this._lookbehind = new Uint8Array();
-        if (typeof needle === 'string') {
-            this._needle = needle = stringToArray(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 ch = this._charAt(data, pos + this._needle.length - 1);
-                if (ch === this._lastChar && this._memcmp(data, pos, this._needle.length - 1)) {
-                    if (pos > -this._lookbehind.length) {
-                        tokens.push(this._lookbehind.slice(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.slice(0, bytesToCutOff));
-                    this._lookbehind = this._lookbehind.slice(bytesToCutOff);
-                }
-                this._lookbehind = Uint8Array.from(new Array(this._lookbehind.length + data.length), (_, i) => this._charAt(data, i - this._lookbehind.length));
-                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.slice(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.slice(pos);
-            }
-        }
-        // Everything until pos is guaranteed not to contain needle data.
-        if (pos > 0) {
-            tokens.push(data.slice(buf_pos, pos < data.length ? pos : data.length));
-        }
-        return [data.length, ...tokens];
-    }
-    _charAt(data, pos) {
-        if (pos < 0) {
-            return this._lookbehind[this._lookbehind.length + pos];
-        }
-        return data[pos];
-    }
-    ;
-    _memcmp(data, pos, len) {
-        return jsmemcmp(this._charAt.bind(this, data), pos, this._needle, 0, len);
-    }
-    ;
+/**
+ * @deprecated Use the [Async Iterator Helpers](https://github.com/tc39/proposal-async-iterator-helpers). (e.g. `AsyncIterator.from(iterateStrings(...))`)
+ */
+async function allStrings(iter) {
+    const segments = [];
+    for await (const value of iterateStrings(iter)) {
+        segments.push(value);
+    }
+    return segments;
 }
 
-class ReadableStreamSearch {
-    constructor(needle, _readableStream) {
-        this._readableStream = _readableStream;
-        this._search = new StreamSearch(needle);
-    }
-    async *[Symbol.asyncIterator]() {
-        const reader = this._readableStream.getReader();
-        try {
-            while (true) {
-                const result = await reader.read();
-                if (result.done) {
-                    break;
-                }
-                yield* this._search.feed(result.value);
-            }
-            const tail = this._search.end();
-            if (tail.length) {
-                yield tail;
-            }
-        }
-        finally {
-            reader.releaseLock();
-        }
-    }
-}
-
-function splitChunks(chunks, needle) {
-    const search = new StreamSearch(needle);
-    const outchunks = [[]];
-    for (const chunk of 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) => mergeArrays(...chunks));
-}
-function split(buf, needle) {
-    return splitChunks([buf], needle);
-}
-async function* chunksIterator(iter) {
-    let chunks = [];
-    for await (const value of iter) {
-        if (value === MATCH) {
-            yield chunks;
-            chunks = [];
-        }
-        else {
-            chunks.push(value);
-        }
-    }
-    yield chunks;
-}
-async function* stringIterator(iter) {
-    for await (const chunk of chunksIterator(iter)) {
-        yield chunk.map(arrayToString).join('');
-    }
-}
-async function allStrings(iter) {
-    const segments = [];
-    for await (const value of stringIterator(iter)) {
-        segments.push(value);
-    }
-    return segments;
-}
-async function* arrayIterator(iter) {
-    for await (const chunk of chunksIterator(iter)) {
-        yield mergeArrays(...chunk);
-    }
-}
-
-export { MATCH, ReadableStreamSearch, StreamSearch, allStrings, arrayIterator, chunksIterator, split, splitChunks, stringIterator };
+export { allStrings, iterateStrings };
 //# sourceMappingURL=index.mjs.map

package/lib/index.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"index.mjs","sources":["../src/search.ts","../src/readable.ts","../src/index.ts"],"sourcesContent":[null,null,null],"names":[],"mappings":";;AAAA;;;;AASA,SAAS,MAAM,CAAC,CAAwB;IACpC,IAAI,CAAC,YAAY,UAAU,EAAE;QACzB,OAAO,CAAC,KAAa,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC;KACtC;IAED,OAAO,CAAC,CAAC;AACb,CAAC;AAED,SAAS,QAAQ,CACb,IAA2B,EAC3B,IAAY,EACZ,IAA2B,EAC3B,IAAY,EACZ,GAAW;IAEX,MAAM,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;IACzB,MAAM,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;IAEzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,EAAE;YACjC,OAAO,KAAK,CAAC;SAChB;KACJ;IAED,OAAO,IAAI,CAAC;AAChB,CAAC;AAED,SAAS,oBAAoB,CAAC,CAAa;;;IAGvC,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;IAC5C,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE;QACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YACnC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC;SAClC;KACJ;IAED,OAAO,KAAK,CAAC;AACjB,CAAC;MAEY,KAAK,GAAG,MAAM,CAAC,OAAO,EAAE;MAIxB,YAAY;IAOrB,YAAmB,MAA2B;QAFtC,gBAAW,GAAG,IAAI,UAAU,EAAE,CAAC;QAGnC,IAAI,OAAO,MAAM,KAAK,QAAQ,EAAE;YAC5B,IAAI,CAAC,OAAO,GAAG,MAAM,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC;SACjD;aAAM;YACH,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;SACzB;QAED,IAAI,CAAC,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC3C,IAAI,CAAC,IAAI,GAAG,oBAAoB,CAAC,MAAM,CAAC,CAAC;KAC5C;IAEM,IAAI,CAAC,KAAiB;QACzB,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,IAAI,MAAe,CAAC;QACpB,MAAM,SAAS,GAAY,EAAE,CAAC;QAC9B,OAAO,GAAG,KAAK,KAAK,CAAC,MAAM,EAAE;YACzB,CAAC,GAAG,EAAE,GAAG,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YAC1C,SAAS,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC;SAC7B;QAED,OAAO,SAAS,CAAC;KACpB;IAEM,GAAG;QACN,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC;QAC9B,IAAI,CAAC,WAAW,GAAG,IAAI,UAAU,EAAE,CAAC;QACpC,OAAO,IAAI,CAAC;KACf;IAEO,KAAK,CAAC,IAAgB,EAAE,OAAe;QAC3C,MAAM,MAAM,GAAY,EAAE,CAAC;;;;;QAM3B,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC;QAEnC,IAAI,GAAG,GAAG,CAAC,EAAE;;;;;;;;;;;;;YAaT,OAAO,GAAG,GAAG,CAAC,IAAI,GAAG,IAAI,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE;gBACxD,MAAM,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;gBAE7D,IAAI,EAAE,KAAK,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE;oBAC3E,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE;wBAChC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC;qBACzE;oBAED,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBAEnB,IAAI,CAAC,WAAW,GAAG,IAAI,UAAU,EAAE,CAAC;oBAEpC,OAAO,CAAC,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC;iBACjD;qBAAM;oBACH,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;iBACxB;aACJ;;YAID,IAAI,GAAG,GAAG,CAAC,EAAE;;;;;;;;;gBAST,OAAO,GAAG,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,EAAE;oBAC3D,GAAG,EAAE,CAAC;iBACT;aACJ;YAED,IAAI,GAAG,IAAI,CAAC,EAAE;;gBAEV,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;gBAC9B,IAAI,CAAC,WAAW,GAAG,IAAI,UAAU,EAAE,CAAC;aACvC;iBAAM;;;;gBAIH,MAAM,aAAa,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,GAAG,CAAC;gBAEpD,IAAI,aAAa,GAAG,CAAC,EAAE;;oBAEnB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC;oBACtD,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;iBAC5D;gBAED,IAAI,CAAC,WAAW,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC;gBAEhJ,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC;aACnC;SACJ;QAED,GAAG,IAAI,OAAO,CAAC;;;;QAKf,OAAO,GAAG,IAAI,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE;YAC7C,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAE/C,IAAI,EAAE,KAAK,IAAI,CAAC,SAAS;mBAClB,IAAI,CAAC,GAAG,CAAC,KAAK,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;mBAC7B,QAAQ,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE;gBAClE,IAAI,GAAG,GAAG,OAAO,EAAE;oBACf,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC;iBACzC;gBAED,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBAEnB,OAAO,CAAC,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC;aACjD;iBAAM;gBACH,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;aACxB;SACJ;;;;;;;QAQD,IAAI,GAAG,GAAG,IAAI,CAAC,MAAM,EAAE;YACnB,OAAO,GAAG,GAAG,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,GAAG,CAAC,KAAK,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;mBACnD,CAAC,QAAQ,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,OAAO,EAAE,CAAC,EAAE,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,EAAE;gBAC9D,EAAE,GAAG,CAAC;aACT;YAED,IAAI,GAAG,GAAG,IAAI,CAAC,MAAM,EAAE;gBACnB,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;aACtC;SACJ;;QAGD,IAAI,GAAG,GAAG,CAAC,EAAE;YACT,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,GAAG,GAAG,IAAI,CAAC,MAAM,GAAG,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;SAC3E;QAED,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC;KACnC;IAEO,OAAO,CAAC,IAAgB,EAAE,GAAW;QACzC,IAAI,GAAG,GAAG,CAAC,EAAE;YACT,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC;SAC1D;QAED,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC;KACpB;;IAEO,OAAO,CAAC,IAAgB,EAAE,GAAW,EAAE,GAAW;QACtD,OAAO,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,GAAG,EAAE,IAAI,CAAC,OAAO,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC;KAC7E;;;;MC/NQ,oBAAoB;IAG7B,YAAmB,MAA2B,EAAU,eAA2C;QAA3C,oBAAe,GAAf,eAAe,CAA4B;QAC/F,IAAI,CAAC,OAAO,GAAG,IAAI,YAAY,CAAC,MAAM,CAAC,CAAC;KAC3C;IAEM,QAAQ,MAAM,CAAC,aAAa,CAAC;QAChC,MAAM,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC,SAAS,EAAE,CAAC;QAChD,IAAI;YACA,OAAO,IAAI,EAAE;gBACT,MAAM,MAAM,GAAG,MAAM,MAAM,CAAC,IAAI,EAAE,CAAC;gBACnC,IAAI,MAAM,CAAC,IAAI,EAAE;oBACb,MAAM;iBACT;gBAED,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;aAC1C;YAED,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC;YAChC,IAAI,IAAI,CAAC,MAAM,EAAE;gBACb,MAAM,IAAI,CAAC;aACd;SACJ;gBAAS;YACN,MAAM,CAAC,WAAW,EAAE,CAAC;SACxB;KACJ;;;SCzBW,WAAW,CAAC,MAAoB,EAAE,MAA2B;IACzE,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,MAAM,CAAC,CAAC;IAExC,MAAM,SAAS,GAAmB,CAAC,EAAE,CAAC,CAAC;IACvC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE;QACxB,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE;YACpC,IAAI,KAAK,KAAK,KAAK,EAAE;gBACjB,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;aACtB;iBAAM;gBACH,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;aAC/C;SACJ;KACJ;IAED,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,EAAE,CAAC;IACzB,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAE1C,OAAO,SAAS,CAAC,GAAG,CAAC,CAAC,MAAM,KAAK,WAAW,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;AAC7D,CAAC;SAEe,KAAK,CAAC,GAAe,EAAE,MAA2B;IAC9D,OAAO,WAAW,CAAC,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC;AACtC,CAAC;AAEM,gBAAgB,cAAc,CAAC,IAA0B;IAC5D,IAAI,MAAM,GAAiB,EAAE,CAAC;IAC9B,WAAW,MAAM,KAAK,IAAI,IAAI,EAAE;QAC5B,IAAI,KAAK,KAAK,KAAK,EAAE;YACjB,MAAM,MAAM,CAAC;YACb,MAAM,GAAG,EAAE,CAAC;SACf;aAAM;YACH,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;SACtB;KACJ;IAED,MAAM,MAAM,CAAC;AACjB,CAAC;AAEM,gBAAgB,cAAc,CAAC,IAA0B;IAC5D,WAAW,MAAM,KAAK,IAAI,cAAc,CAAC,IAAI,CAAC,EAAE;QAC5C,MAAM,KAAK,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;KAC3C;AACL,CAAC;AAEM,eAAe,UAAU,CAAC,IAA0B;IACvD,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,WAAW,MAAM,KAAK,IAAI,cAAc,CAAC,IAAI,CAAC,EAAE;QAC5C,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;KACxB;IAED,OAAO,QAAQ,CAAC;AACpB,CAAC;AAEM,gBAAgB,aAAa,CAAC,IAA0B;IAC3D,WAAW,MAAM,KAAK,IAAI,cAAc,CAAC,IAAI,CAAC,EAAE;QAC5C,MAAM,WAAW,CAAC,GAAG,KAAK,CAAC,CAAC;KAC/B;AACL;;;;"}
+{"version":3,"file":"index.mjs","sources":["../src/index.ts"],"sourcesContent":[null],"names":[],"mappings":";;;;;;;;;;;;AAGA;;AAEG;AACI,eAAe,UAAU,CAC/B,IAA0B,EAAA;IAE1B,MAAM,QAAQ,GAAa,EAAE;IAC7B,WAAW,MAAM,KAAK,IAAI,cAAc,CAAC,IAAI,CAAC,EAAE;AAC/C,QAAA,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC;IACrB;AAEA,IAAA,OAAO,QAAQ;AAChB;;;;"}

package/lib/iterate-chunks-concatted.cjs

@@ -0,0 +1,15 @@
+'use strict';
+
+var concat = require('uint8arrays/concat');
+var iterateChunks = require('./iterate-chunks.cjs');
+require('./search.cjs');
+require('uint8arrays/from-string');
+
+async function* iterateChunksConcatted(iter) {
+    for await (const chunk of iterateChunks.iterateChunks(iter)) {
+        yield concat.concat(chunk);
+    }
+}
+
+exports.iterateChunksConcatted = iterateChunksConcatted;
+//# sourceMappingURL=iterate-chunks-concatted.cjs.map

package/lib/iterate-chunks-concatted.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"iterate-chunks-concatted.cjs","sources":["../src/iterate-chunks-concatted.ts"],"sourcesContent":[null],"names":["iterateChunks","concat"],"mappings":";;;;;;;AAKO,gBAAgB,sBAAsB,CAC5C,IAA0B,EAAA;IAE1B,WAAW,MAAM,KAAK,IAAIA,2BAAa,CAAC,IAAI,CAAC,EAAE;AAC9C,QAAA,MAAMC,aAAM,CAAC,KAAK,CAAC;IACpB;AACD;;;;"}

package/lib/iterate-chunks-concatted.d.ts

@@ -0,0 +1,2 @@
+import type { Token } from "./search.js";
+export declare function iterateChunksConcatted(iter: AsyncIterable<Token>): AsyncIterableIterator<Uint8Array>;

package/lib/iterate-chunks-concatted.mjs

@@ -0,0 +1,13 @@
+import { concat } from 'uint8arrays/concat';
+import { iterateChunks } from './iterate-chunks.mjs';
+import './search.mjs';
+import 'uint8arrays/from-string';
+
+async function* iterateChunksConcatted(iter) {
+    for await (const chunk of iterateChunks(iter)) {
+        yield concat(chunk);
+    }
+}
+
+export { iterateChunksConcatted };
+//# sourceMappingURL=iterate-chunks-concatted.mjs.map

package/lib/iterate-chunks-concatted.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"iterate-chunks-concatted.mjs","sources":["../src/iterate-chunks-concatted.ts"],"sourcesContent":[null],"names":[],"mappings":";;;;;AAKO,gBAAgB,sBAAsB,CAC5C,IAA0B,EAAA;IAE1B,WAAW,MAAM,KAAK,IAAI,aAAa,CAAC,IAAI,CAAC,EAAE;AAC9C,QAAA,MAAM,MAAM,CAAC,KAAK,CAAC;IACpB;AACD;;;;"}

package/lib/iterate-chunks.cjs

@@ -0,0 +1,22 @@
+'use strict';
+
+var search = require('./search.cjs');
+require('uint8arrays/concat');
+require('uint8arrays/from-string');
+
+async function* iterateChunks(iter) {
+    let chunks = [];
+    for await (const value of iter) {
+        if (value === search.MATCH) {
+            yield chunks;
+            chunks = [];
+        }
+        else {
+            chunks.push(value);
+        }
+    }
+    yield chunks;
+}
+
+exports.iterateChunks = iterateChunks;
+//# sourceMappingURL=iterate-chunks.cjs.map

package/lib/iterate-chunks.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"iterate-chunks.cjs","sources":["../src/iterate-chunks.ts"],"sourcesContent":[null],"names":["MATCH"],"mappings":";;;;;;AAEO,gBAAgB,aAAa,CACnC,IAA0B,EAAA;IAE1B,IAAI,MAAM,GAAiB,EAAE;AAC7B,IAAA,WAAW,MAAM,KAAK,IAAI,IAAI,EAAE;AAC/B,QAAA,IAAI,KAAK,KAAKA,YAAK,EAAE;AACpB,YAAA,MAAM,MAAM;YACZ,MAAM,GAAG,EAAE;QACZ;aAAO;AACN,YAAA,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC;QACnB;IACD;AAEA,IAAA,MAAM,MAAM;AACb;;;;"}

package/lib/iterate-chunks.d.ts

@@ -0,0 +1,2 @@
+import { type Token } from "./search.js";
+export declare function iterateChunks(iter: AsyncIterable<Token>): AsyncIterableIterator<Uint8Array[]>;

package/lib/iterate-chunks.mjs

@@ -0,0 +1,20 @@
+import { MATCH } from './search.mjs';
+import 'uint8arrays/concat';
+import 'uint8arrays/from-string';
+
+async function* iterateChunks(iter) {
+    let chunks = [];
+    for await (const value of iter) {
+        if (value === MATCH) {
+            yield chunks;
+            chunks = [];
+        }
+        else {
+            chunks.push(value);
+        }
+    }
+    yield chunks;
+}
+
+export { iterateChunks };
+//# sourceMappingURL=iterate-chunks.mjs.map

package/lib/iterate-chunks.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"iterate-chunks.mjs","sources":["../src/iterate-chunks.ts"],"sourcesContent":[null],"names":[],"mappings":";;;;AAEO,gBAAgB,aAAa,CACnC,IAA0B,EAAA;IAE1B,IAAI,MAAM,GAAiB,EAAE;AAC7B,IAAA,WAAW,MAAM,KAAK,IAAI,IAAI,EAAE;AAC/B,QAAA,IAAI,KAAK,KAAK,KAAK,EAAE;AACpB,YAAA,MAAM,MAAM;YACZ,MAAM,GAAG,EAAE;QACZ;aAAO;AACN,YAAA,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC;QACnB;IACD;AAEA,IAAA,MAAM,MAAM;AACb;;;;"}

package/lib/iterate-strings.cjs

@@ -0,0 +1,16 @@
+'use strict';
+
+var concat = require('uint8arrays/concat');
+var toString = require('uint8arrays/to-string');
+var iterateChunks = require('./iterate-chunks.cjs');
+require('./search.cjs');
+require('uint8arrays/from-string');
+
+async function* iterateStrings(iter) {
+    for await (const chunks of iterateChunks.iterateChunks(iter)) {
+        yield toString.toString(concat.concat(chunks));
+    }
+}
+
+exports.iterateStrings = iterateStrings;
+//# sourceMappingURL=iterate-strings.cjs.map

package/lib/iterate-strings.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"iterate-strings.cjs","sources":["../src/iterate-strings.ts"],"sourcesContent":[null],"names":["iterateChunks","toString","concat"],"mappings":";;;;;;;;AAMO,gBAAgB,cAAc,CACpC,IAA0B,EAAA;IAE1B,WAAW,MAAM,MAAM,IAAIA,2BAAa,CAAC,IAAI,CAAC,EAAE;AAC/C,QAAA,MAAMC,iBAAQ,CAACC,aAAM,CAAC,MAAM,CAAC,CAAC;IAC/B;AACD;;;;"}

package/lib/iterate-strings.d.ts

@@ -0,0 +1,2 @@
+import type { Token } from "./search.js";
+export declare function iterateStrings(iter: AsyncIterable<Token>): AsyncIterableIterator<string>;

package/lib/iterate-strings.mjs

@@ -0,0 +1,14 @@
+import { concat } from 'uint8arrays/concat';
+import { toString } from 'uint8arrays/to-string';
+import { iterateChunks } from './iterate-chunks.mjs';
+import './search.mjs';
+import 'uint8arrays/from-string';
+
+async function* iterateStrings(iter) {
+    for await (const chunks of iterateChunks(iter)) {
+        yield toString(concat(chunks));
+    }
+}
+
+export { iterateStrings };
+//# sourceMappingURL=iterate-strings.mjs.map

package/lib/iterate-strings.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"iterate-strings.mjs","sources":["../src/iterate-strings.ts"],"sourcesContent":[null],"names":[],"mappings":";;;;;;AAMO,gBAAgB,cAAc,CACpC,IAA0B,EAAA;IAE1B,WAAW,MAAM,MAAM,IAAI,aAAa,CAAC,IAAI,CAAC,EAAE;AAC/C,QAAA,MAAM,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAC/B;AACD;;;;"}

package/lib/iterator.cjs

@@ -0,0 +1,42 @@
+'use strict';
+
+var search = require('./search.cjs');
+require('uint8arrays/concat');
+require('uint8arrays/from-string');
+
+class IteratorStreamSearch {
+    _iter;
+    _search;
+    constructor(needle, _iter) {
+        this._iter = _iter;
+        this._search = new search.StreamSearch(needle);
+    }
+    async *[Symbol.asyncIterator]() {
+        const it = this._iter[Symbol.asyncIterator]();
+        while (true) {
+            let result;
+            try {
+                result = await it.next();
+            }
+            catch (error) {
+                if (it.throw) {
+                    result = await it.throw(error);
+                }
+                else {
+                    throw error;
+                }
+            }
+            if (result.done) {
+                break;
+            }
+            yield* this._search.feed(result.value);
+        }
+        const tail = this._search.end();
+        if (tail.length) {
+            yield tail;
+        }
+    }
+}
+
+exports.IteratorStreamSearch = IteratorStreamSearch;
+//# sourceMappingURL=iterator.cjs.map

package/lib/iterator.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"iterator.cjs","sources":["../src/iterator.ts"],"sourcesContent":[null],"names":["StreamSearch"],"mappings":";;;;;;MAEa,oBAAoB,CAAA;AAKvB,IAAA,KAAA;AAJD,IAAA,OAAO;IAEf,WAAA,CACC,MAA2B,EACnB,KAAgC,EAAA;QAAhC,IAAA,CAAA,KAAK,GAAL,KAAK;QAEb,IAAI,CAAC,OAAO,GAAG,IAAIA,mBAAY,CAAC,MAAM,CAAC;IACxC;AAEO,IAAA,QAAQ,MAAM,CAAC,aAAa,CAAC,GAAA;QACnC,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,aAAa,CAAC,EAAE;QAC7C,OAAO,IAAI,EAAE;AACZ,YAAA,IAAI,MAAkC;AACtC,YAAA,IAAI;AACH,gBAAA,MAAM,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE;YACzB;YAAE,OAAO,KAAK,EAAE;AACf,gBAAA,IAAI,EAAE,CAAC,KAAK,EAAE;oBACb,MAAM,GAAG,MAAM,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC;gBAC/B;qBAAO;AACN,oBAAA,MAAM,KAAK;gBACZ;YACD;AAEA,YAAA,IAAI,MAAM,CAAC,IAAI,EAAE;gBAChB;YACD;AAEA,YAAA,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC;QACvC;QAEA,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE;AAC/B,QAAA,IAAI,IAAI,CAAC,MAAM,EAAE;AAChB,YAAA,MAAM,IAAI;QACX;IACD;AACA;;;;"}

package/lib/iterator.d.ts

@@ -0,0 +1,7 @@
+import { type Token } from "./search.js";
+export declare class IteratorStreamSearch {
+    private _iter;
+    private _search;
+    constructor(needle: Uint8Array | string, _iter: AsyncIterable<Uint8Array>);
+    [Symbol.asyncIterator](): AsyncIterableIterator<Token>;
+}

package/lib/iterator.mjs

@@ -0,0 +1,40 @@
+import { StreamSearch } from './search.mjs';
+import 'uint8arrays/concat';
+import 'uint8arrays/from-string';
+
+class IteratorStreamSearch {
+    _iter;
+    _search;
+    constructor(needle, _iter) {
+        this._iter = _iter;
+        this._search = new StreamSearch(needle);
+    }
+    async *[Symbol.asyncIterator]() {
+        const it = this._iter[Symbol.asyncIterator]();
+        while (true) {
+            let result;
+            try {
+                result = await it.next();
+            }
+            catch (error) {
+                if (it.throw) {
+                    result = await it.throw(error);
+                }
+                else {
+                    throw error;
+                }
+            }
+            if (result.done) {
+                break;
+            }
+            yield* this._search.feed(result.value);
+        }
+        const tail = this._search.end();
+        if (tail.length) {
+            yield tail;
+        }
+    }
+}
+
+export { IteratorStreamSearch };
+//# sourceMappingURL=iterator.mjs.map

package/lib/iterator.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"iterator.mjs","sources":["../src/iterator.ts"],"sourcesContent":[null],"names":[],"mappings":";;;;MAEa,oBAAoB,CAAA;AAKvB,IAAA,KAAA;AAJD,IAAA,OAAO;IAEf,WAAA,CACC,MAA2B,EACnB,KAAgC,EAAA;QAAhC,IAAA,CAAA,KAAK,GAAL,KAAK;QAEb,IAAI,CAAC,OAAO,GAAG,IAAI,YAAY,CAAC,MAAM,CAAC;IACxC;AAEO,IAAA,QAAQ,MAAM,CAAC,aAAa,CAAC,GAAA;QACnC,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,aAAa,CAAC,EAAE;QAC7C,OAAO,IAAI,EAAE;AACZ,YAAA,IAAI,MAAkC;AACtC,YAAA,IAAI;AACH,gBAAA,MAAM,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE;YACzB;YAAE,OAAO,KAAK,EAAE;AACf,gBAAA,IAAI,EAAE,CAAC,KAAK,EAAE;oBACb,MAAM,GAAG,MAAM,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC;gBAC/B;qBAAO;AACN,oBAAA,MAAM,KAAK;gBACZ;YACD;AAEA,YAAA,IAAI,MAAM,CAAC,IAAI,EAAE;gBAChB;YACD;AAEA,YAAA,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC;QACvC;QAEA,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE;AAC/B,QAAA,IAAI,IAAI,CAAC,MAAM,EAAE;AAChB,YAAA,MAAM,IAAI;QACX;IACD;AACA;;;;"}

package/lib/queueable.cjs

@@ -0,0 +1,55 @@
+'use strict';
+
+var search = require('./search.cjs');
+require('uint8arrays/concat');
+require('uint8arrays/from-string');
+
+const EOQ = Symbol("End of Queue");
+class QueueableStreamSearch {
+    _search;
+    _chunksQueue = [];
+    _notify;
+    _closed = false;
+    constructor(needle) {
+        this._search = new search.StreamSearch(needle);
+    }
+    push(...chunks) {
+        if (this._closed) {
+            throw new Error("cannot call push after close");
+        }
+        this._chunksQueue.push(...chunks);
+        if (this._notify) {
+            this._notify();
+        }
+    }
+    close() {
+        if (this._closed) {
+            throw new Error("close was already called");
+        }
+        this._closed = true;
+        this._chunksQueue.push(EOQ);
+        if (this._notify) {
+            this._notify();
+        }
+    }
+    async *[Symbol.asyncIterator]() {
+        while (true) {
+            let chunk;
+            while (!(chunk = this._chunksQueue.shift())) {
+                await new Promise((resolve) => (this._notify = resolve));
+                this._notify = undefined;
+            }
+            if (chunk === EOQ) {
+                break;
+            }
+            yield* this._search.feed(chunk);
+        }
+        const tail = this._search.end();
+        if (tail.length) {
+            yield tail;
+        }
+    }
+}
+
+exports.QueueableStreamSearch = QueueableStreamSearch;
+//# sourceMappingURL=queueable.cjs.map

package/lib/queueable.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"queueable.cjs","sources":["../src/queueable.ts"],"sourcesContent":[null],"names":["StreamSearch"],"mappings":";;;;;;AAEA,MAAM,GAAG,GAAG,MAAM,CAAC,cAAc,CAAC;MAErB,qBAAqB,CAAA;AACzB,IAAA,OAAO;IACP,YAAY,GAAmC,EAAE;AACjD,IAAA,OAAO;IACP,OAAO,GAAG,KAAK;AAEvB,IAAA,WAAA,CAAmB,MAA2B,EAAA;QAC7C,IAAI,CAAC,OAAO,GAAG,IAAIA,mBAAY,CAAC,MAAM,CAAC;IACxC;IAEO,IAAI,CAAC,GAAG,MAAoB,EAAA;AAClC,QAAA,IAAI,IAAI,CAAC,OAAO,EAAE;AACjB,YAAA,MAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC;QAChD;QAEA,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC;AACjC,QAAA,IAAI,IAAI,CAAC,OAAO,EAAE;YACjB,IAAI,CAAC,OAAO,EAAE;QACf;IACD;IAEO,KAAK,GAAA;AACX,QAAA,IAAI,IAAI,CAAC,OAAO,EAAE;AACjB,YAAA,MAAM,IAAI,KAAK,CAAC,0BAA0B,CAAC;QAC5C;AAEA,QAAA,IAAI,CAAC,OAAO,GAAG,IAAI;AACnB,QAAA,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC;AAC3B,QAAA,IAAI,IAAI,CAAC,OAAO,EAAE;YACjB,IAAI,CAAC,OAAO,EAAE;QACf;IACD;AAEO,IAAA,QAAQ,MAAM,CAAC,aAAa,CAAC,GAAA;QACnC,OAAO,IAAI,EAAE;AACZ,YAAA,IAAI,KAA0C;AAC9C,YAAA,OAAO,EAAE,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC,EAAE;AAC5C,gBAAA,MAAM,IAAI,OAAO,CAAO,CAAC,OAAO,MAAM,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC,CAAC;AAC9D,gBAAA,IAAI,CAAC,OAAO,GAAG,SAAS;YACzB;AAEA,YAAA,IAAI,KAAK,KAAK,GAAG,EAAE;gBAClB;YACD;YAEA,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC;QAChC;QAEA,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE;AAC/B,QAAA,IAAI,IAAI,CAAC,MAAM,EAAE;AAChB,YAAA,MAAM,IAAI;QACX;IACD;AACA;;;;"}

package/lib/queueable.d.ts

@@ -1,11 +1,11 @@
-import { Token } from './search';
-export declare class QueueableStreamSearch {
-    private _search;
-    private _chunksQueue;
-    private _notify?;
-    private _closed;
-    constructor(needle: Uint8Array | string);
-    push(...chunks: Uint8Array[]): void;
-    close(): void;
-    [Symbol.asyncIterator](): AsyncIterableIterator<Token>;
-}
+import { type Token } from "./search.js";
+export declare class QueueableStreamSearch {
+    private _search;
+    private _chunksQueue;
+    private _notify?;
+    private _closed;
+    constructor(needle: Uint8Array | string);
+    push(...chunks: Uint8Array[]): void;
+    close(): void;
+    [Symbol.asyncIterator](): AsyncIterableIterator<Token>;
+}