spliterator 1.5.0

package/out/lib/IndexQueue.js

@@ -0,0 +1,80 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ */
+/**
+ * A first-in, first-out queue for marking and dequeuing index tuples.
+ */
+export class IndexQueue {
+    #tuples = [];
+    /**
+     * The number of tuples in the queue.
+     */
+    get size() {
+        return this.#tuples.length / 2;
+    }
+    #byteLength = 0;
+    /**
+     * The total byte length spanned by the tuples in the queue.
+     *
+     * This is a cached value and may not be accurate if the queue is modified externally.
+     */
+    get byteLength() {
+        return this.#byteLength;
+    }
+    /**
+     * Append a new tuple to the queue.
+     */
+    enqueue(tuple) {
+        this.#tuples.push(...tuple);
+        this.#byteLength += tuple[1] - tuple[0];
+    }
+    /**
+     * Get the next tuple in the queue, removing it.
+     */
+    dequeue() {
+        if (this.#tuples.length < 2)
+            return;
+        const tuple = this.#tuples.splice(0, 2);
+        this.#byteLength -= tuple[1] - tuple[0];
+        return tuple;
+    }
+    /**
+     * Peek at the next tuple in the queue without removing it.
+     */
+    peek() {
+        if (this.#tuples.length < 2)
+            return;
+        return this.#tuples.slice(0, 2);
+    }
+    /**
+     * Peek at the last tuple in the queue without removing it.
+     */
+    peekLast() {
+        if (this.#tuples.length < 2)
+            return;
+        return this.#tuples.slice(-2);
+    }
+    /**
+     * Clear the queue.
+     */
+    clear() {
+        this.#tuples.length = 0;
+        this.#byteLength = 0;
+    }
+    /**
+     * Alias for `dequeue`, conforming to the iterator protocol.
+     */
+    next() {
+        const tuple = this.dequeue();
+        if (tuple) {
+            return { done: false, value: tuple };
+        }
+        return { done: true, value: undefined };
+    }
+    [Symbol.iterator]() {
+        return this;
+    }
+}
+//# sourceMappingURL=IndexQueue.js.map

package/out/lib/IndexQueue.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"IndexQueue.js","sourceRoot":"","sources":["../../lib/IndexQueue.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAIH;;GAEG;AACH,MAAM,OAAO,UAAU;IACtB,OAAO,GAAa,EAAE,CAAA;IAEtB;;OAEG;IACH,IAAW,IAAI;QACd,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAA;IAC/B,CAAC;IAED,WAAW,GAAG,CAAC,CAAA;IAEf;;;;OAIG;IACH,IAAW,UAAU;QACpB,OAAO,IAAI,CAAC,WAAW,CAAA;IACxB,CAAC;IAED;;OAEG;IACI,OAAO,CAAC,KAAgB;QAC9B,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,CAAA;QAE3B,IAAI,CAAC,WAAW,IAAI,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAA;IACxC,CAAC;IAED;;OAEG;IACI,OAAO;QACb,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC;YAAE,OAAM;QAEnC,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAc,CAAA;QAEpD,IAAI,CAAC,WAAW,IAAI,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAA;QAEvC,OAAO,KAAkB,CAAA;IAC1B,CAAC;IAED;;OAEG;IACI,IAAI;QACV,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC;YAAE,OAAM;QAEnC,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAc,CAAA;IAC7C,CAAC;IAED;;OAEG;IACI,QAAQ;QACd,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC;YAAE,OAAM;QAEnC,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAc,CAAA;IAC3C,CAAC;IAED;;OAEG;IACI,KAAK;QACX,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAA;QACvB,IAAI,CAAC,WAAW,GAAG,CAAC,CAAA;IACrB,CAAC;IAED;;OAEG;IACI,IAAI;QACV,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,EAAE,CAAA;QAE5B,IAAI,KAAK,EAAE,CAAC;YACX,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,CAAA;QACrC,CAAC;QAED,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,CAAA;IACxC,CAAC;IAEM,CAAC,MAAM,CAAC,QAAQ,CAAC;QACvB,OAAO,IAAI,CAAA;IACZ,CAAC;CACD"}

package/out/lib/JSONSpliterator.d.ts

@@ -0,0 +1,19 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ */
+import { CharacterSequenceInput } from "./CharacterSequence.js";
+import { AsyncDataResource } from "./shared.js";
+import { AsyncSpliteratorInit, SpliteratorInit } from "./Spliterator.js";
+export declare abstract class JSONSpliterator {
+    constructor();
+    static from<T = unknown>(source: CharacterSequenceInput, options?: SpliteratorInit): Generator<T>;
+    /**
+     * Given a byte array or string, yield each row as an array of columns.
+     *
+     * @yields Each row as an array of columns.
+     */
+    static fromAsync<T = unknown>(source: AsyncDataResource, options?: AsyncSpliteratorInit): AsyncGenerator<Awaited<T>, void, unknown>;
+}
+//# sourceMappingURL=JSONSpliterator.d.ts.map

package/out/lib/JSONSpliterator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"JSONSpliterator.d.ts","sourceRoot":"","sources":["../../lib/JSONSpliterator.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,sBAAsB,EAAE,MAAM,wBAAwB,CAAA;AAC/D,OAAO,EAAE,iBAAiB,EAAE,MAAM,aAAa,CAAA;AAC/C,OAAO,EAAE,oBAAoB,EAAe,eAAe,EAAE,MAAM,kBAAkB,CAAA;AAErF,8BAAsB,eAAe;;IAKpC,MAAM,CAAE,IAAI,CAAC,CAAC,GAAG,OAAO,EAAE,MAAM,EAAE,sBAAsB,EAAE,OAAO,GAAE,eAAoB,GAAG,SAAS,CAAC,CAAC,CAAC;IA0BtG;;;;OAIG;WACW,SAAS,CAAC,CAAC,GAAG,OAAO,EAAE,MAAM,EAAE,iBAAiB,EAAE,OAAO,GAAE,oBAAyB;CAwBlG"}

package/out/lib/JSONSpliterator.js

@@ -0,0 +1,55 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ */
+import { Spliterator } from "./Spliterator.js";
+export class JSONSpliterator {
+    constructor() {
+        throw new TypeError("Static class cannot be instantiated. Did you mean `JSONSpliterator.from`?");
+    }
+    static *from(source, options = {}) {
+        const decoder = new TextDecoder();
+        let rowCursor = 0;
+        const spliterator = Spliterator.from(source, options);
+        for (const row of spliterator) {
+            let parsed;
+            try {
+                const content = decoder.decode(row);
+                parsed = JSON.parse(content);
+            }
+            catch (parsedError) {
+                const error = SyntaxError(`Failed to parse JSON at row ${rowCursor}`);
+                error.cause = parsedError;
+                throw error;
+            }
+            yield parsed;
+            rowCursor++;
+        }
+    }
+    /**
+     * Given a byte array or string, yield each row as an array of columns.
+     *
+     * @yields Each row as an array of columns.
+     */
+    static async *fromAsync(source, options = {}) {
+        const decoder = new TextDecoder();
+        let rowCursor = 0;
+        const spliterator = await Spliterator.fromAsync(source, options);
+        for await (const row of spliterator) {
+            let parsed;
+            try {
+                const content = decoder.decode(row);
+                parsed = JSON.parse(content);
+            }
+            catch (parsedError) {
+                const error = SyntaxError(`Failed to parse JSON at row ${rowCursor}`);
+                error.cause = parsedError;
+                throw error;
+            }
+            yield parsed;
+            rowCursor++;
+        }
+    }
+}
+//# sourceMappingURL=JSONSpliterator.js.map

package/out/lib/JSONSpliterator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"JSONSpliterator.js","sourceRoot":"","sources":["../../lib/JSONSpliterator.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAIH,OAAO,EAAwB,WAAW,EAAmB,MAAM,kBAAkB,CAAA;AAErF,MAAM,OAAgB,eAAe;IACpC;QACC,MAAM,IAAI,SAAS,CAAC,2EAA2E,CAAC,CAAA;IACjG,CAAC;IAED,MAAM,CAAC,CAAC,IAAI,CAAc,MAA8B,EAAE,UAA2B,EAAE;QACtF,MAAM,OAAO,GAAG,IAAI,WAAW,EAAE,CAAA;QACjC,IAAI,SAAS,GAAG,CAAC,CAAA;QAEjB,MAAM,WAAW,GAAG,WAAW,CAAC,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;QAErD,KAAK,MAAM,GAAG,IAAI,WAAW,EAAE,CAAC;YAC/B,IAAI,MAAS,CAAA;YAEb,IAAI,CAAC;gBACJ,MAAM,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;gBAEnC,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAM,CAAA;YAClC,CAAC;YAAC,OAAO,WAAW,EAAE,CAAC;gBACtB,MAAM,KAAK,GAAG,WAAW,CAAC,+BAA+B,SAAS,EAAE,CAAC,CAAA;gBACrE,KAAK,CAAC,KAAK,GAAG,WAAW,CAAA;gBAEzB,MAAM,KAAK,CAAA;YACZ,CAAC;YAED,MAAM,MAAM,CAAA;YAEZ,SAAS,EAAE,CAAA;QACZ,CAAC;IACF,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAC,KAAK,CAAC,CAAC,SAAS,CAAc,MAAyB,EAAE,UAAgC,EAAE;QACjG,MAAM,OAAO,GAAG,IAAI,WAAW,EAAE,CAAA;QACjC,IAAI,SAAS,GAAG,CAAC,CAAA;QACjB,MAAM,WAAW,GAAG,MAAM,WAAW,CAAC,SAAS,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;QAEhE,IAAI,KAAK,EAAE,MAAM,GAAG,IAAI,WAAW,EAAE,CAAC;YACrC,IAAI,MAAS,CAAA;YAEb,IAAI,CAAC;gBACJ,MAAM,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;gBAEnC,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAM,CAAA;YAClC,CAAC;YAAC,OAAO,WAAW,EAAE,CAAC;gBACtB,MAAM,KAAK,GAAG,WAAW,CAAC,+BAA+B,SAAS,EAAE,CAAC,CAAA;gBACrE,KAAK,CAAC,KAAK,GAAG,WAAW,CAAA;gBAEzB,MAAM,KAAK,CAAA;YACZ,CAAC;YAED,MAAM,MAAM,CAAA;YAEZ,SAAS,EAAE,CAAA;QACZ,CAAC;IACF,CAAC;CACD"}

package/out/lib/SlidingWindow.d.ts

@@ -0,0 +1,93 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ */
+import { CharacterSequenceInput } from "./CharacterSequence.js";
+import { ByteRange, FileResourceLike, TypedArray } from "./shared.js";
+export interface SlidingWindowInit {
+    /**
+     * The delimiter to use. Defaults to a line feed.
+     */
+    delimiter?: CharacterSequenceInput;
+    /**
+     * The byte index to start searching from.
+     */
+    position?: number;
+    /**
+     * The byte index to stop searching at.
+     */
+    byteLength?: number;
+}
+/**
+ * A sliding window that iterates over an in-memory buffer, yielding byte ranges.
+ *
+ * @see {@link AsyncSlidingWindow} for an asynchronous version.
+ */
+export declare class SlidingWindow<T extends TypedArray> implements IterableIterator<ByteRange> {
+    #private;
+    buffer: T;
+    /**
+     * The current byte index of the sliding window.
+     */
+    cursor: number;
+    /**
+     * Given a byte array containing delimited data, yield a sliding window of indexes.
+     *
+     * This a low-level utility function that can be used to implement more complex parsing logic.
+     */
+    constructor(
+    /**
+     * The buffer containing delimited data.
+     */
+    buffer: T, init?: SlidingWindowInit);
+    next(): IteratorResult<ByteRange>;
+    [Symbol.iterator](): IterableIterator<ByteRange>;
+}
+/**
+ * Options for initializing an asynchronous sliding window.
+ */
+export interface AsyncSlidingWindowInit extends SlidingWindowInit {
+    /**
+     * Whether to close the file handle when the iterator is completed or disposed.
+     */
+    autoClose?: boolean;
+}
+/**
+ * An asynchronous sliding window that iterates over a file handle, yielding byte ranges.
+ *
+ * @see {@link SlidingWindow} for a synchronous version.
+ */
+export declare class AsyncSlidingWindow implements AsyncIterableIterator<ByteRange>, AsyncDisposable {
+    #private;
+    /**
+     * The current byte index of the sliding window.
+     */
+    cursor: number;
+    /**
+     * Given a byte array containing delimited data, yield a sliding window of indexes.
+     *
+     * This a low-level utility function that can be used to implement more complex parsing logic.
+     */
+    constructor(file: FileResourceLike, init: AsyncSlidingWindowInit);
+    /**
+     * Read the next byte range from the file handle.
+     */
+    next(): Promise<IteratorResult<ByteRange>>;
+    /**
+     * Read the previous byte range from the file handle.
+     *
+     * This is useful for backtracking in the event that a delimiter is split across two windows.
+     */
+    previous(): Promise<IteratorResult<ByteRange>>;
+    /**
+     * Given a collection of sliding windows, iterate over them and coalesce adjacent windows.
+     *
+     * @yields Each coalesced window.
+     */
+    static collect(slidingWindows: AsyncSlidingWindow[]): AsyncGenerator<ByteRange[]>;
+    [Symbol.asyncDispose](): Promise<void>;
+    dispose(): Promise<void>;
+    [Symbol.asyncIterator](): AsyncIterableIterator<ByteRange>;
+}
+//# sourceMappingURL=SlidingWindow.d.ts.map

package/out/lib/SlidingWindow.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"SlidingWindow.d.ts","sourceRoot":"","sources":["../../lib/SlidingWindow.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAqB,sBAAsB,EAAE,MAAM,wBAAwB,CAAA;AAClF,OAAO,EAAuB,SAAS,EAAmB,gBAAgB,EAAE,UAAU,EAAE,MAAM,aAAa,CAAA;AAE3G,MAAM,WAAW,iBAAiB;IACjC;;OAEG;IACH,SAAS,CAAC,EAAE,sBAAsB,CAAA;IAElC;;OAEG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAA;IAEjB;;OAEG;IACH,UAAU,CAAC,EAAE,MAAM,CAAA;CACnB;AAED;;;;GAIG;AACH,qBAAa,aAAa,CAAC,CAAC,SAAS,UAAU,CAAE,YAAW,gBAAgB,CAAC,SAAS,CAAC;;IACtF,MAAM,EAAE,CAAC,CAAA;IAKT;;OAEG;IACH,MAAM,EAAE,MAAM,CAAA;IAEd;;;;OAIG;;IAEF;;OAEG;IACH,MAAM,EAAE,CAAC,EACT,IAAI,GAAE,iBAAsB;IAQtB,IAAI,IAAI,cAAc,CAAC,SAAS,CAAC;IA8BjC,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,gBAAgB,CAAC,SAAS,CAAC;CAGvD;AAED;;GAEG;AACH,MAAM,WAAW,sBAAuB,SAAQ,iBAAiB;IAChE;;OAEG;IACH,SAAS,CAAC,EAAE,OAAO,CAAA;CACnB;AAED;;;;GAIG;AACH,qBAAa,kBAAmB,YAAW,qBAAqB,CAAC,SAAS,CAAC,EAAE,eAAe;;IAO3F;;OAEG;IACH,MAAM,EAAE,MAAM,CAAA;IAEd;;;;OAIG;gBACS,IAAI,EAAE,gBAAgB,EAAE,IAAI,EAAE,sBAAsB;IAUhE;;OAEG;IACU,IAAI,IAAI,OAAO,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC;IAqCvD;;;;OAIG;IACU,QAAQ,IAAI,OAAO,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC;IAuB3D;;;;OAIG;WACW,OAAO,CAAC,cAAc,EAAE,kBAAkB,EAAE,GAAG,cAAc,CAAC,SAAS,EAAE,CAAC;IAyB3E,CAAC,MAAM,CAAC,YAAY,CAAC,IAAI,OAAO,CAAC,IAAI,CAAC;IAM5C,OAAO,IAAI,OAAO,CAAC,IAAI,CAAC;IAIxB,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,qBAAqB,CAAC,SAAS,CAAC;CAGjE"}

package/out/lib/SlidingWindow.js

@@ -0,0 +1,176 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ */
+import { CharacterSequence } from "./CharacterSequence.js";
+import { applyReaderPolyfill } from "./shared.js";
+/**
+ * A sliding window that iterates over an in-memory buffer, yielding byte ranges.
+ *
+ * @see {@link AsyncSlidingWindow} for an asynchronous version.
+ */
+export class SlidingWindow {
+    buffer;
+    #delimiter;
+    #byteLength;
+    #done = false;
+    /**
+     * The current byte index of the sliding window.
+     */
+    cursor;
+    /**
+     * Given a byte array containing delimited data, yield a sliding window of indexes.
+     *
+     * This a low-level utility function that can be used to implement more complex parsing logic.
+     */
+    constructor(
+    /**
+     * The buffer containing delimited data.
+     */
+    buffer, init = {}) {
+        this.buffer = buffer;
+        this.#delimiter = new CharacterSequence(init.delimiter);
+        this.cursor = init.position ?? 0;
+        this.#byteLength = Math.min(init.byteLength ?? buffer.byteLength, buffer.byteLength);
+    }
+    next() {
+        for (let end = this.cursor; end < this.#byteLength; end++) {
+            // We walk through as many bytes as the delimiter has...
+            const match = this.#delimiter.every((byte, i) => byte === this.buffer[end + i]);
+            // We didn't find a match, so we continue.
+            if (!match)
+                continue;
+            const range = [this.cursor, end];
+            this.cursor = end + this.#delimiter.length;
+            return { value: range, done: false };
+        }
+        if (this.cursor <= this.#byteLength && !this.#done) {
+            const range = [this.cursor, this.#byteLength];
+            this.cursor = this.#byteLength;
+            this.#done = true;
+            return { value: range, done: false };
+        }
+        return {
+            value: undefined,
+            done: true,
+        };
+    }
+    [Symbol.iterator]() {
+        return this;
+    }
+}
+/**
+ * An asynchronous sliding window that iterates over a file handle, yielding byte ranges.
+ *
+ * @see {@link SlidingWindow} for a synchronous version.
+ */
+export class AsyncSlidingWindow {
+    #file;
+    #delimiter;
+    #byteLength;
+    #done = false;
+    #autoClose;
+    /**
+     * The current byte index of the sliding window.
+     */
+    cursor;
+    /**
+     * Given a byte array containing delimited data, yield a sliding window of indexes.
+     *
+     * This a low-level utility function that can be used to implement more complex parsing logic.
+     */
+    constructor(file, init) {
+        applyReaderPolyfill(file);
+        this.#file = file;
+        this.#byteLength = init.byteLength ?? Infinity;
+        this.#delimiter = new CharacterSequence(init.delimiter);
+        this.cursor = init.position ?? 0;
+        this.#autoClose = init.autoClose ?? false;
+    }
+    /**
+     * Read the next byte range from the file handle.
+     */
+    async next() {
+        const lookahead = this.#delimiter.length;
+        for (let end = this.cursor; end < this.#byteLength; end++) {
+            const byteSlice = await this.#file.read({
+                position: end,
+                // lenegth: end + lookahead
+            });
+            const match = byteSlice.every((byte, i) => byte === this.#delimiter[i]);
+            if (!match)
+                continue;
+            const range = [this.cursor, end];
+            this.cursor = end + lookahead;
+            return { value: range, done: false };
+        }
+        // Handle the final window if we haven't reached the byte limit
+        // and there's remaining content after the last delimiter
+        if (this.cursor <= this.#byteLength && !this.#done) {
+            const range = [this.cursor, this.#byteLength];
+            this.cursor = this.#byteLength;
+            this.#done = true;
+            return { value: range, done: false };
+        }
+        return {
+            value: undefined,
+            done: true,
+        };
+    }
+    /**
+     * Read the previous byte range from the file handle.
+     *
+     * This is useful for backtracking in the event that a delimiter is split across two windows.
+     */
+    async previous() {
+        const lookahead = this.#delimiter.length;
+        for (let start = this.cursor; start > 0; start--) {
+            const byteSlice = await this.#file.read({ position: start - lookahead, length: start });
+            const match = byteSlice.every((byte, i) => byte === this.#delimiter[i]);
+            if (!match)
+                continue;
+            const range = [start - lookahead, this.cursor];
+            this.cursor = start - lookahead;
+            return { value: range, done: false };
+        }
+        return {
+            value: undefined,
+            done: true,
+        };
+    }
+    /**
+     * Given a collection of sliding windows, iterate over them and coalesce adjacent windows.
+     *
+     * @yields Each coalesced window.
+     */
+    static async *collect(slidingWindows) {
+        let results;
+        let done;
+        do {
+            results = await Promise.all(slidingWindows.map((window) => {
+                return window.next();
+            }));
+            const emitted = [];
+            for (const result of results) {
+                done = result.done;
+                if (result.done)
+                    continue;
+                emitted.push(result.value);
+            }
+            yield emitted;
+        } while (!done);
+    }
+    async [Symbol.asyncDispose]() {
+        if (this.#autoClose) {
+            await this.#file[Symbol.asyncDispose]?.();
+        }
+    }
+    dispose() {
+        return this[Symbol.asyncDispose]();
+    }
+    [Symbol.asyncIterator]() {
+        return this;
+    }
+}
+//# sourceMappingURL=SlidingWindow.js.map

package/out/lib/SlidingWindow.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"SlidingWindow.js","sourceRoot":"","sources":["../../lib/SlidingWindow.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,iBAAiB,EAA0B,MAAM,wBAAwB,CAAA;AAClF,OAAO,EAAE,mBAAmB,EAA4D,MAAM,aAAa,CAAA;AAmB3G;;;;GAIG;AACH,MAAM,OAAO,aAAa;IACzB,MAAM,CAAG;IACT,UAAU,CAAmB;IAC7B,WAAW,CAAQ;IACnB,KAAK,GAAG,KAAK,CAAA;IAEb;;OAEG;IACH,MAAM,CAAQ;IAEd;;;;OAIG;IACH;IACC;;OAEG;IACH,MAAS,EACT,OAA0B,EAAE;QAE5B,IAAI,CAAC,MAAM,GAAG,MAAM,CAAA;QACpB,IAAI,CAAC,UAAU,GAAG,IAAI,iBAAiB,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;QACvD,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAA;QAChC,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,IAAI,MAAM,CAAC,UAAU,EAAE,MAAM,CAAC,UAAU,CAAC,CAAA;IACrF,CAAC;IAEM,IAAI;QACV,KAAK,IAAI,GAAG,GAAG,IAAI,CAAC,MAAM,EAAE,GAAG,GAAG,IAAI,CAAC,WAAW,EAAE,GAAG,EAAE,EAAE,CAAC;YAC3D,wDAAwD;YACxD,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,KAAK,IAAI,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAA;YAE/E,0CAA0C;YAC1C,IAAI,CAAC,KAAK;gBAAE,SAAQ;YAEpB,MAAM,KAAK,GAAc,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,CAAA;YAE3C,IAAI,CAAC,MAAM,GAAG,GAAG,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAA;YAE1C,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,CAAA;QACrC,CAAC;QAED,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,WAAW,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;YACpD,MAAM,KAAK,GAAc,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,WAAW,CAAC,CAAA;YAExD,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,WAAW,CAAA;YAC9B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAA;YAEjB,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,CAAA;QACrC,CAAC;QAED,OAAO;YACN,KAAK,EAAE,SAAS;YAChB,IAAI,EAAE,IAAI;SACV,CAAA;IACF,CAAC;IAEM,CAAC,MAAM,CAAC,QAAQ,CAAC;QACvB,OAAO,IAAI,CAAA;IACZ,CAAC;CACD;AAYD;;;;GAIG;AACH,MAAM,OAAO,kBAAkB;IAC9B,KAAK,CAAoC;IACzC,UAAU,CAAmB;IAC7B,WAAW,CAAQ;IACnB,KAAK,GAAG,KAAK,CAAA;IACb,UAAU,CAAS;IAEnB;;OAEG;IACH,MAAM,CAAQ;IAEd;;;;OAIG;IACH,YAAY,IAAsB,EAAE,IAA4B;QAC/D,mBAAmB,CAAC,IAAI,CAAC,CAAA;QAEzB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAA;QACjB,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,UAAU,IAAI,QAAQ,CAAA;QAC9C,IAAI,CAAC,UAAU,GAAG,IAAI,iBAAiB,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;QACvD,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAA;QAChC,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,SAAS,IAAI,KAAK,CAAA;IAC1C,CAAC;IAED;;OAEG;IACI,KAAK,CAAC,IAAI;QAChB,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAA;QAExC,KAAK,IAAI,GAAG,GAAG,IAAI,CAAC,MAAM,EAAE,GAAG,GAAG,IAAI,CAAC,WAAW,EAAE,GAAG,EAAE,EAAE,CAAC;YAC3D,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;gBACvC,QAAQ,EAAE,GAAG;gBACb,2BAA2B;aAC3B,CAAC,CAAA;YAEF,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,KAAK,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAA;YAEvE,IAAI,CAAC,KAAK;gBAAE,SAAQ;YAEpB,MAAM,KAAK,GAAc,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,CAAA;YAE3C,IAAI,CAAC,MAAM,GAAG,GAAG,GAAG,SAAS,CAAA;YAE7B,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,CAAA;QACrC,CAAC;QAED,+DAA+D;QAC/D,yDAAyD;QACzD,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,WAAW,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;YACpD,MAAM,KAAK,GAAc,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,WAAW,CAAC,CAAA;YAExD,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,WAAW,CAAA;YAC9B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAA;YAEjB,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,CAAA;QACrC,CAAC;QAED,OAAO;YACN,KAAK,EAAE,SAAS;YAChB,IAAI,EAAE,IAAI;SACV,CAAA;IACF,CAAC;IAED;;;;OAIG;IACI,KAAK,CAAC,QAAQ;QACpB,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAA;QAExC,KAAK,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,EAAE,KAAK,GAAG,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC;YAClD,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,KAAK,GAAG,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAA;YAEvF,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,KAAK,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAA;YAEvE,IAAI,CAAC,KAAK;gBAAE,SAAQ;YAEpB,MAAM,KAAK,GAAc,CAAC,KAAK,GAAG,SAAS,EAAE,IAAI,CAAC,MAAM,CAAC,CAAA;YAEzD,IAAI,CAAC,MAAM,GAAG,KAAK,GAAG,SAAS,CAAA;YAE/B,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,CAAA;QACrC,CAAC;QAED,OAAO;YACN,KAAK,EAAE,SAAS;YAChB,IAAI,EAAE,IAAI;SACV,CAAA;IACF,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,cAAoC;QACzD,IAAI,OAAoC,CAAA;QACxC,IAAI,IAAyB,CAAA;QAE7B,GAAG,CAAC;YACH,OAAO,GAAG,MAAM,OAAO,CAAC,GAAG,CAC1B,cAAc,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE;gBAC7B,OAAO,MAAM,CAAC,IAAI,EAAE,CAAA;YACrB,CAAC,CAAC,CACF,CAAA;YAED,MAAM,OAAO,GAAgB,EAAE,CAAA;YAE/B,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;gBAC9B,IAAI,GAAG,MAAM,CAAC,IAAI,CAAA;gBAElB,IAAI,MAAM,CAAC,IAAI;oBAAE,SAAQ;gBAEzB,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;YAC3B,CAAC;YAED,MAAM,OAAO,CAAA;QACd,CAAC,QAAQ,CAAC,IAAI,EAAC;IAChB,CAAC;IAEM,KAAK,CAAC,CAAC,MAAM,CAAC,YAAY,CAAC;QACjC,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACrB,MAAM,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,YAAY,CAAC,EAAE,EAAE,CAAA;QAC1C,CAAC;IACF,CAAC;IAEM,OAAO;QACb,OAAO,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,EAAE,CAAA;IACnC,CAAC;IAEM,CAAC,MAAM,CAAC,aAAa,CAAC;QAC5B,OAAO,IAAI,CAAA;IACZ,CAAC;CACD"}

package/out/lib/Spliterator.d.ts

@@ -0,0 +1,51 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ */
+import { AsyncSpliterator, AsyncSpliteratorInit, SpliteratorInit } from "./AsyncSpliterator.js";
+import { CharacterSequenceInput } from "./CharacterSequence.js";
+export { AsyncSpliterator };
+export type { AsyncSpliteratorInit, SpliteratorInit };
+/**
+ * A byte stream delimiting iterator.
+ */
+export declare class Spliterator implements IterableIterator<Uint8Array>, Disposable {
+    #private;
+    /**
+     * Create a spliterator from an asynchronous resource such as a file.
+     *
+     * This is an alias for `AsyncSpliterator.from`.
+     *
+     * @param source - The data resource to read from.
+     * @param init - The initialization options for the generator.
+     * @see {@linkcode AsyncSpliterator} for usage.
+     */
+    static fromAsync: typeof AsyncSpliterator.from;
+    /**
+     * Create a spliterator from an iterable resource such as a buffer, array, or string.
+     *
+     * @param source - The data resource to read from.
+     * @param init - The initialization options for the generator.
+     */
+    static from<T extends CharacterSequenceInput>(source: T, init?: SpliteratorInit): Spliterator;
+    /**
+     * Dispose of the spliterator, closing the file handle if necessary.
+     */
+    [Symbol.dispose](): void;
+    constructor(source: Uint8Array, init?: SpliteratorInit);
+    /**
+     * Read the next byte range from the source.
+     */
+    next(): IteratorResult<Uint8Array>;
+    /**
+     * Collect all the byte ranges from the file.
+     */
+    toArray(): Uint8Array[];
+    /**
+     * Collect all the byte ranges from the file as a string.
+     */
+    toDecodedArray(decoder?: import("util").TextDecoder): string[];
+    [Symbol.iterator](): IterableIterator<Uint8Array>;
+}
+//# sourceMappingURL=Spliterator.d.ts.map

package/out/lib/Spliterator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Spliterator.d.ts","sourceRoot":"","sources":["../../lib/Spliterator.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,gBAAgB,EAAE,oBAAoB,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAA;AAC/F,OAAO,EAAqB,sBAAsB,EAA2B,MAAM,wBAAwB,CAAA;AAI3G,OAAO,EAAE,gBAAgB,EAAE,CAAA;AAE3B,YAAY,EAAE,oBAAoB,EAAE,eAAe,EAAE,CAAA;AAErD;;GAEG;AACH,qBAAa,WAAY,YAAW,gBAAgB,CAAC,UAAU,CAAC,EAAE,UAAU;;IAG3E;;;;;;;;OAQG;IACH,MAAM,CAAC,SAAS,+BAAwB;IAExC;;;;;OAKG;IACH,MAAM,CAAC,IAAI,CAAC,CAAC,SAAS,sBAAsB,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,GAAE,eAAoB,GAAG,WAAW;IAIjG;;OAEG;IACI,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,IAAI;gBAInB,MAAM,EAAE,UAAU,EAAE,IAAI,GAAE,eAAoB;IAwM1D;;OAEG;IACI,IAAI,IAAI,cAAc,CAAC,UAAU,CAAC;IAgCzC;;OAEG;IACI,OAAO,IAAI,UAAU,EAAE;IAI9B;;OAEG;IACI,cAAc,CAAC,OAAO,6BAAoB,GAAG,MAAM,EAAE;IAIrD,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,gBAAgB,CAAC,UAAU,CAAC;CAGxD"}