zstdify 1.0.0

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2025 Ben Houston
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -0,0 +1,95 @@
+# zstdify
+
+[![NPM Package][npm]][npm-url]
+[![NPM Downloads][npm-downloads]][npmtrends-url]
+[![Tests][tests-badge]][tests-url]
+[![Coverage][coverage-badge]][coverage-url]
+
+Pure TypeScript zstd compression library. No native dependencies, works in Node.js and browsers.
+
+## Status
+
+- **Decoder**: Raw and RLE blocks supported. Compressed blocks (Huffman/FSE) planned.
+- **Encoder**: Raw baseline, RLE blocks for repeated-byte chunks (`level > 0`), plus an initial compressed-block path (`level > 1`) for selected single-sequence blocks with raw fallback.
+- **Format**: RFC 8878 compliant for supported features.
+
+## Usage
+
+```ts
+import { compress, decompress } from 'zstdify';
+
+const data = new TextEncoder().encode('hello world');
+const compressed = compress(data);
+const restored = decompress(compressed);
+// restored equals data
+```
+
+## API
+
+- `compress(input: Uint8Array, options?: { level?: number }): Uint8Array`
+- `decompress(input: Uint8Array, options?: { maxSize?: number }): Uint8Array`
+
+## CLI Tool
+
+The **zstdify-cli** package is a command-line tool for compressing and decompressing files with zstd. Install from npm:
+
+```sh
+pnpm add -g zstdify-cli
+```
+
+```bash
+zstdify compress input.txt output.zst
+zstdify extract output.zst restored.txt
+```
+
+See [packages/cli/README.md](packages/cli/README.md) for full CLI documentation.
+
+## Development
+
+```bash
+pnpm install
+pnpm build
+pnpm test
+pnpm check
+```
+
+### How we validate
+
+- **Round-trip**: `decompress(compress(x)) === x` for a variety of payloads and levels (see [packages/zstdify-tests/src/roundtrip/](packages/zstdify-tests/src/roundtrip/)), plus property-based tests with [fast-check](https://fast-check.dev/).
+- **Conformance fixtures**: Pre-generated `.zst` files from the official zstd CLI; we decompress and compare. Legacy fixtures are documented in [packages/zstdify-tests/fixtures/README.md](packages/zstdify-tests/fixtures/README.md). A decodecorpus-style **corpus** (multiple sizes/levels, manifest with hashes) is generated by `pnpm --filter zstdify-tests run generate:corpus` and tested in `conformance/corpus-manifest.test.ts`.
+- **Differential (zstd ↔ zstdify)**: With the zstd CLI installed, we test zstd compress → zstdify decompress and zstdify compress → zstd decompress across payloads and levels.
+- **Corruption**: Truncation, checksum mismatch, invalid header bits, and related error paths are tested in [conformance/corruption.test.ts](packages/zstdify-tests/src/conformance/corruption.test.ts).
+- **Compression regression**: `pnpm --filter zstdify-tests run regression:compression` checks that compressed sizes for fixed payloads do not increase (ratio stability).
+- **Fuzzing**: A decompress harness (`pnpm --filter zstdify-tests run fuzz:decompress`) reads bytes from stdin and calls `decompress`; use with a fuzzer or corpus to find crashes. See [upstream zstd TESTING.md](https://github.com/facebook/zstd/blob/dev/TESTING.md) and decodecorpus for comparison.
+
+## Publishing
+
+Publish the npm packages (library first, then CLI so it gets the correct `zstdify` version):
+
+```bash
+pnpm make-release:zstdify
+pnpm make-release:cli
+```
+
+## Project structure
+
+- `packages/zstdify` - Core library
+- `packages/cli` - CLI tool (`zstdify-cli` on npm)
+- `packages/zstdify-tests` - Integration tests
+
+# License
+
+MIT
+
+## Author
+
+[Ben Houston](https://benhouston3d.com), Sponsored by [Land of Assets](https://landofassets.com)
+
+[npm]: https://img.shields.io/npm/v/zstdify
+[npm-url]: https://www.npmjs.com/package/zstdify
+[npm-downloads]: https://img.shields.io/npm/dw/zstdify
+[npmtrends-url]: https://www.npmtrends.com/zstdify
+[tests-badge]: https://github.com/bhouston/zstdify/workflows/Tests/badge.svg
+[tests-url]: https://github.com/bhouston/zstdify/actions/workflows/test.yml
+[coverage-badge]: https://codecov.io/gh/bhouston/zstdify/branch/main/graph/badge.svg
+[coverage-url]: https://codecov.io/gh/bhouston/zstdify

package/dist/bitstream/bitReader.d.ts

@@ -0,0 +1,26 @@
+/**
+ * Little-endian bit reader with bounds-safe cursor.
+ * Reads bits LSB-first within bytes, bytes in forward order.
+ */
+export declare class BitReader {
+    private data;
+    private byteOffset;
+    private bitOffset;
+    constructor(data: Uint8Array, byteOffset?: number);
+    /** Current byte position (after last fully consumed byte) */
+    get position(): number;
+    /** Total bits consumed */
+    get bitsConsumed(): number;
+    /** True if no more bits available */
+    get atEnd(): boolean;
+    /** Ensure at least n bits are available. Throws if not. */
+    ensure(n: number): void;
+    /** Read n bits (1-32), LSB first */
+    readBits(n: number): number;
+    /** Align to next byte boundary (skip remaining bits in current byte) */
+    align(): void;
+    /** Read a full byte (convenience, must be aligned or will read across boundary) */
+    readByte(): number;
+    /** Slice remaining bytes from current position (after aligning) */
+    readRemainingBytes(): Uint8Array;
+}

package/dist/bitstream/bitReader.js

@@ -0,0 +1,86 @@
+/**
+ * Little-endian bit reader with bounds-safe cursor.
+ * Reads bits LSB-first within bytes, bytes in forward order.
+ */
+export class BitReader {
+    data;
+    byteOffset;
+    bitOffset; // 0-7, bits consumed in current byte
+    constructor(data, byteOffset = 0) {
+        this.data = data;
+        this.byteOffset = byteOffset;
+        this.bitOffset = 0;
+    }
+    /** Current byte position (after last fully consumed byte) */
+    get position() {
+        return this.byteOffset;
+    }
+    /** Total bits consumed */
+    get bitsConsumed() {
+        return this.byteOffset * 8 + this.bitOffset;
+    }
+    /** True if no more bits available */
+    get atEnd() {
+        return this.byteOffset >= this.data.length;
+    }
+    /** Ensure at least n bits are available. Throws if not. */
+    ensure(n) {
+        const bitsAvailable = (this.data.length - this.byteOffset) * 8 - this.bitOffset;
+        if (bitsAvailable < n) {
+            throw new RangeError(`BitReader: requested ${n} bits, only ${bitsAvailable} available`);
+        }
+    }
+    /** Read n bits (1-32), LSB first */
+    readBits(n) {
+        if (n < 1 || n > 32) {
+            throw new RangeError(`BitReader.readBits: n must be 1-32, got ${n}`);
+        }
+        this.ensure(n);
+        let value = 0;
+        let bitsLeft = n;
+        while (bitsLeft > 0) {
+            const byte = this.data[this.byteOffset] ?? 0;
+            const bitsInByte = 8 - this.bitOffset;
+            const take = Math.min(bitsLeft, bitsInByte);
+            const mask = (1 << take) - 1;
+            const shift = this.bitOffset;
+            value |= ((byte >> shift) & mask) << (n - bitsLeft);
+            this.bitOffset += take;
+            bitsLeft -= take;
+            if (this.bitOffset >= 8) {
+                this.byteOffset++;
+                this.bitOffset = 0;
+            }
+        }
+        return value;
+    }
+    /** Align to next byte boundary (skip remaining bits in current byte) */
+    align() {
+        if (this.bitOffset !== 0) {
+            this.bitOffset = 0;
+            this.byteOffset++;
+        }
+    }
+    /** Read a full byte (convenience, must be aligned or will read across boundary) */
+    readByte() {
+        if (this.bitOffset === 0) {
+            if (this.byteOffset >= this.data.length) {
+                throw new RangeError('BitReader: no more bytes');
+            }
+            const v = this.data[this.byteOffset++];
+            if (v === undefined)
+                throw new RangeError('BitReader: no more bytes');
+            return v;
+        }
+        return this.readBits(8);
+    }
+    /** Slice remaining bytes from current position (after aligning) */
+    readRemainingBytes() {
+        this.align();
+        if (this.byteOffset >= this.data.length) {
+            return new Uint8Array(0);
+        }
+        return this.data.subarray(this.byteOffset);
+    }
+}
+//# sourceMappingURL=bitReader.js.map

package/dist/bitstream/bitReader.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bitReader.js","sourceRoot":"","sources":["../../src/bitstream/bitReader.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,MAAM,OAAO,SAAS;IACZ,IAAI,CAAa;IACjB,UAAU,CAAS;IACnB,SAAS,CAAS,CAAC,qCAAqC;IAEhE,YAAY,IAAgB,EAAE,UAAU,GAAG,CAAC,EAAE;QAC5C,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;IAAA,CACpB;IAED,6DAA6D;IAC7D,IAAI,QAAQ,GAAW;QACrB,OAAO,IAAI,CAAC,UAAU,CAAC;IAAA,CACxB;IAED,0BAA0B;IAC1B,IAAI,YAAY,GAAW;QACzB,OAAO,IAAI,CAAC,UAAU,GAAG,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC;IAAA,CAC7C;IAED,qCAAqC;IACrC,IAAI,KAAK,GAAY;QACnB,OAAO,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;IAAA,CAC5C;IAED,2DAA2D;IAC3D,MAAM,CAAC,CAAS,EAAQ;QACtB,MAAM,aAAa,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC;QAChF,IAAI,aAAa,GAAG,CAAC,EAAE,CAAC;YACtB,MAAM,IAAI,UAAU,CAAC,wBAAwB,CAAC,eAAe,aAAa,YAAY,CAAC,CAAC;QAC1F,CAAC;IAAA,CACF;IAED,oCAAoC;IACpC,QAAQ,CAAC,CAAS,EAAU;QAC1B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;YACpB,MAAM,IAAI,UAAU,CAAC,2CAA2C,CAAC,EAAE,CAAC,CAAC;QACvE,CAAC;QACD,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAEf,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,QAAQ,GAAG,CAAC,CAAC;QAEjB,OAAO,QAAQ,GAAG,CAAC,EAAE,CAAC;YACpB,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;YAC7C,MAAM,UAAU,GAAG,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC;YACtC,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;YAC5C,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC;YAC7B,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC;YAC7B,KAAK,IAAI,CAAC,CAAC,IAAI,IAAI,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC;YAEpD,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC;YACvB,QAAQ,IAAI,IAAI,CAAC;YAEjB,IAAI,IAAI,CAAC,SAAS,IAAI,CAAC,EAAE,CAAC;gBACxB,IAAI,CAAC,UAAU,EAAE,CAAC;gBAClB,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;YACrB,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC;IAAA,CACd;IAED,wEAAwE;IACxE,KAAK,GAAS;QACZ,IAAI,IAAI,CAAC,SAAS,KAAK,CAAC,EAAE,CAAC;YACzB,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;YACnB,IAAI,CAAC,UAAU,EAAE,CAAC;QACpB,CAAC;IAAA,CACF;IAED,mFAAmF;IACnF,QAAQ,GAAW;QACjB,IAAI,IAAI,CAAC,SAAS,KAAK,CAAC,EAAE,CAAC;YACzB,IAAI,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;gBACxC,MAAM,IAAI,UAAU,CAAC,0BAA0B,CAAC,CAAC;YACnD,CAAC;YACD,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC;YACvC,IAAI,CAAC,KAAK,SAAS;gBAAE,MAAM,IAAI,UAAU,CAAC,0BAA0B,CAAC,CAAC;YACtE,OAAO,CAAC,CAAC;QACX,CAAC;QACD,OAAO,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAAA,CACzB;IAED,mEAAmE;IACnE,kBAAkB,GAAe;QAC/B,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,IAAI,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;YACxC,OAAO,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;QAC3B,CAAC;QACD,OAAO,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IAAA,CAC5C;CACF"}

package/dist/bitstream/bitReader.test.d.ts

@@ -0,0 +1 @@
+export {};

package/dist/bitstream/bitReader.test.js

@@ -0,0 +1,47 @@
+import { describe, expect, it } from 'vitest';
+import { BitReader } from './bitReader.js';
+describe('BitReader', () => {
+    it('reads single bits', () => {
+        // 0b10110100 = 0xB4
+        const data = new Uint8Array([0xb4]);
+        const r = new BitReader(data);
+        expect(r.readBits(1)).toBe(0);
+        expect(r.readBits(1)).toBe(0);
+        expect(r.readBits(1)).toBe(1);
+        expect(r.readBits(1)).toBe(0);
+        expect(r.readBits(1)).toBe(1);
+        expect(r.readBits(1)).toBe(1);
+        expect(r.readBits(1)).toBe(0);
+        expect(r.readBits(1)).toBe(1);
+        expect(r.atEnd).toBe(true);
+    });
+    it('reads multi-bit values', () => {
+        const data = new Uint8Array([0xff, 0x00]); // 11111111 00000000
+        const r = new BitReader(data);
+        expect(r.readBits(8)).toBe(0xff);
+        expect(r.readBits(8)).toBe(0x00);
+    });
+    it('reads across byte boundaries', () => {
+        // byte0: 1111 (low) 0000 (high), byte1: 1111 (low) 0000 (high)
+        const data = new Uint8Array([0b00001111, 0b00001111]);
+        const r = new BitReader(data);
+        expect(r.readBits(4)).toBe(0b1111); // low 4 of byte0
+        expect(r.readBits(8)).toBe(0b11110000); // high 4 of byte0 + low 4 of byte1
+        expect(r.readBits(4)).toBe(0); // high 4 of byte1
+    });
+    it('align works', () => {
+        const data = new Uint8Array([0xff, 0xab, 0xcd]);
+        const r = new BitReader(data);
+        r.readBits(3);
+        r.align();
+        expect(r.position).toBe(1);
+        expect(r.readByte()).toBe(0xab);
+    });
+    it('throws on out of bounds', () => {
+        const data = new Uint8Array([0xff]);
+        const r = new BitReader(data);
+        r.readBits(8);
+        expect(() => r.readBits(1)).toThrow();
+    });
+});
+//# sourceMappingURL=bitReader.test.js.map

package/dist/bitstream/bitReader.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bitReader.test.js","sourceRoot":"","sources":["../../src/bitstream/bitReader.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,QAAQ,CAAC;AAC9C,OAAO,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAC;AAE3C,QAAQ,CAAC,WAAW,EAAE,GAAG,EAAE,CAAC;IAC1B,EAAE,CAAC,mBAAmB,EAAE,GAAG,EAAE,CAAC;QAC5B,oBAAoB;QACpB,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QACpC,MAAM,CAAC,GAAG,IAAI,SAAS,CAAC,IAAI,CAAC,CAAC;QAC9B,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAAA,CAC5B,CAAC,CAAC;IAEH,EAAE,CAAC,wBAAwB,EAAE,GAAG,EAAE,CAAC;QACjC,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,oBAAoB;QAC/D,MAAM,CAAC,GAAG,IAAI,SAAS,CAAC,IAAI,CAAC,CAAC;QAC9B,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjC,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAAA,CAClC,CAAC,CAAC;IAEH,EAAE,CAAC,8BAA8B,EAAE,GAAG,EAAE,CAAC;QACvC,+DAA+D;QAC/D,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC;QACtD,MAAM,CAAC,GAAG,IAAI,SAAS,CAAC,IAAI,CAAC,CAAC;QAC9B,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,iBAAiB;QACrD,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,mCAAmC;QAC3E,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,kBAAkB;IAAnB,CAC/B,CAAC,CAAC;IAEH,EAAE,CAAC,aAAa,EAAE,GAAG,EAAE,CAAC;QACtB,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;QAChD,MAAM,CAAC,GAAG,IAAI,SAAS,CAAC,IAAI,CAAC,CAAC;QAC9B,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACd,CAAC,CAAC,KAAK,EAAE,CAAC;QACV,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC3B,MAAM,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAAA,CACjC,CAAC,CAAC;IAEH,EAAE,CAAC,yBAAyB,EAAE,GAAG,EAAE,CAAC;QAClC,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QACpC,MAAM,CAAC,GAAG,IAAI,SAAS,CAAC,IAAI,CAAC,CAAC;QAC9B,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACd,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;IAAA,CACvC,CAAC,CAAC;AAAA,CACJ,CAAC,CAAC"}

package/dist/bitstream/bitReaderReverse.d.ts

@@ -0,0 +1,23 @@
+/**
+ * Reverse (backward) bit reader for FSE/Huffman streams in zstd.
+ * Modeled after zstd's reverse stream semantics:
+ * - compute an absolute bit offset from stream start,
+ * - consume bits by decrementing that offset,
+ * - extract bits in little-endian bit order.
+ */
+export declare class BitReaderReverse {
+    private readonly data;
+    private readonly startBit;
+    private readonly endBit;
+    private bitOffset;
+    constructor(data: Uint8Array, startByteOffset: number, lengthBytes: number, skipBitsAtStart?: number);
+    /** Read n bits (1-32), LSB first from current position (reading backward) */
+    readBits(n: number): number;
+    /** Skip trailing zero padding and end-mark bit from the stream tail. */
+    skipPadding(): void;
+    get position(): number;
+    /** Skip the first n bits at the logical start (the end of the buffer when reading backward). */
+    skipBitsAtEnd(n: number): void;
+    /** Undo a previous readBits() by pushing the cursor forward. */
+    unreadBits(n: number): void;
+}

package/dist/bitstream/bitReaderReverse.js

@@ -0,0 +1,84 @@
+/**
+ * Reverse (backward) bit reader for FSE/Huffman streams in zstd.
+ * Modeled after zstd's reverse stream semantics:
+ * - compute an absolute bit offset from stream start,
+ * - consume bits by decrementing that offset,
+ * - extract bits in little-endian bit order.
+ */
+export class BitReaderReverse {
+    data;
+    startBit;
+    endBit;
+    bitOffset;
+    constructor(data, startByteOffset, lengthBytes, skipBitsAtStart = 0) {
+        if (lengthBytes < 0) {
+            throw new RangeError(`BitReaderReverse: negative length ${lengthBytes}`);
+        }
+        this.data = data;
+        this.startBit = startByteOffset * 8 + skipBitsAtStart;
+        this.endBit = (startByteOffset + lengthBytes) * 8;
+        this.bitOffset = this.endBit;
+    }
+    /** Read n bits (1-32), LSB first from current position (reading backward) */
+    readBits(n) {
+        if (n < 1 || n > 32) {
+            throw new RangeError(`BitReaderReverse.readBits: n must be 1-32, got ${n}`);
+        }
+        const requestedStart = this.bitOffset - n;
+        this.bitOffset = Math.max(this.startBit, requestedStart);
+        let value = 0;
+        for (let i = 0; i < n; i++) {
+            const absoluteBit = requestedStart + i;
+            if (absoluteBit < this.startBit) {
+                continue;
+            }
+            const byteIndex = absoluteBit >>> 3;
+            const bitInByte = absoluteBit & 7;
+            const bit = ((this.data[byteIndex] ?? 0) >>> bitInByte) & 1;
+            value |= bit << i;
+        }
+        return value;
+    }
+    /** Skip trailing zero padding and end-mark bit from the stream tail. */
+    skipPadding() {
+        if (this.endBit <= this.startBit) {
+            throw new RangeError('BitReaderReverse: empty stream');
+        }
+        const lastByteIndex = (this.endBit >>> 3) - 1;
+        const lastByte = this.data[lastByteIndex] ?? 0;
+        if (lastByte === 0) {
+            throw new RangeError('BitReaderReverse: invalid end marker');
+        }
+        const highestSetBit = 31 - Math.clz32(lastByte);
+        const paddingBits = 8 - highestSetBit; // includes end-mark + zero padding bits.
+        this.bitOffset = this.endBit - paddingBits;
+        if (this.bitOffset < this.startBit) {
+            throw new RangeError('BitReaderReverse: invalid padding');
+        }
+    }
+    get position() {
+        if (this.bitOffset <= this.startBit) {
+            return this.startBit >>> 3;
+        }
+        return (this.bitOffset - 1) >>> 3;
+    }
+    /** Skip the first n bits at the logical start (the end of the buffer when reading backward). */
+    skipBitsAtEnd(n) {
+        if (n <= 0)
+            return;
+        this.bitOffset -= n;
+        if (this.bitOffset < this.startBit) {
+            throw new RangeError('BitReaderReverse: buffer underflow');
+        }
+    }
+    /** Undo a previous readBits() by pushing the cursor forward. */
+    unreadBits(n) {
+        if (n <= 0)
+            return;
+        this.bitOffset += n;
+        if (this.bitOffset > this.endBit) {
+            throw new RangeError('BitReaderReverse: unread overflow');
+        }
+    }
+}
+//# sourceMappingURL=bitReaderReverse.js.map

package/dist/bitstream/bitReaderReverse.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bitReaderReverse.js","sourceRoot":"","sources":["../../src/bitstream/bitReaderReverse.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,MAAM,OAAO,gBAAgB;IACV,IAAI,CAAa;IACjB,QAAQ,CAAS;IACjB,MAAM,CAAS;IACxB,SAAS,CAAS;IAE1B,YAAY,IAAgB,EAAE,eAAuB,EAAE,WAAmB,EAAE,eAAe,GAAG,CAAC,EAAE;QAC/F,IAAI,WAAW,GAAG,CAAC,EAAE,CAAC;YACpB,MAAM,IAAI,UAAU,CAAC,qCAAqC,WAAW,EAAE,CAAC,CAAC;QAC3E,CAAC;QACD,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,QAAQ,GAAG,eAAe,GAAG,CAAC,GAAG,eAAe,CAAC;QACtD,IAAI,CAAC,MAAM,GAAG,CAAC,eAAe,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC;QAClD,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC;IAAA,CAC9B;IAED,6EAA6E;IAC7E,QAAQ,CAAC,CAAS,EAAU;QAC1B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;YACpB,MAAM,IAAI,UAAU,CAAC,kDAAkD,CAAC,EAAE,CAAC,CAAC;QAC9E,CAAC;QAED,MAAM,cAAc,GAAG,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;QAC1C,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,EAAE,cAAc,CAAC,CAAC;QAEzD,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,WAAW,GAAG,cAAc,GAAG,CAAC,CAAC;YACvC,IAAI,WAAW,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAChC,SAAS;YACX,CAAC;YACD,MAAM,SAAS,GAAG,WAAW,KAAK,CAAC,CAAC;YACpC,MAAM,SAAS,GAAG,WAAW,GAAG,CAAC,CAAC;YAClC,MAAM,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,KAAK,SAAS,CAAC,GAAG,CAAC,CAAC;YAC5D,KAAK,IAAI,GAAG,IAAI,CAAC,CAAC;QACpB,CAAC;QACD,OAAO,KAAK,CAAC;IAAA,CACd;IAED,wEAAwE;IACxE,WAAW,GAAS;QAClB,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACjC,MAAM,IAAI,UAAU,CAAC,gCAAgC,CAAC,CAAC;QACzD,CAAC;QACD,MAAM,aAAa,GAAG,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;QAC9C,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;QAC/C,IAAI,QAAQ,KAAK,CAAC,EAAE,CAAC;YACnB,MAAM,IAAI,UAAU,CAAC,sCAAsC,CAAC,CAAC;QAC/D,CAAC;QACD,MAAM,aAAa,GAAG,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QAChD,MAAM,WAAW,GAAG,CAAC,GAAG,aAAa,CAAC,CAAC,yCAAyC;QAChF,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,MAAM,GAAG,WAAW,CAAC;QAC3C,IAAI,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;YACnC,MAAM,IAAI,UAAU,CAAC,mCAAmC,CAAC,CAAC;QAC5D,CAAC;IAAA,CACF;IAED,IAAI,QAAQ,GAAW;QACrB,IAAI,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACpC,OAAO,IAAI,CAAC,QAAQ,KAAK,CAAC,CAAC;QAC7B,CAAC;QACD,OAAO,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IAAA,CACnC;IAED,gGAAgG;IAChG,aAAa,CAAC,CAAS,EAAQ;QAC7B,IAAI,CAAC,IAAI,CAAC;YAAE,OAAO;QACnB,IAAI,CAAC,SAAS,IAAI,CAAC,CAAC;QACpB,IAAI,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;YACnC,MAAM,IAAI,UAAU,CAAC,oCAAoC,CAAC,CAAC;QAC7D,CAAC;IAAA,CACF;IAED,gEAAgE;IAChE,UAAU,CAAC,CAAS,EAAQ;QAC1B,IAAI,CAAC,IAAI,CAAC;YAAE,OAAO;QACnB,IAAI,CAAC,SAAS,IAAI,CAAC,CAAC;QACpB,IAAI,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;YACjC,MAAM,IAAI,UAAU,CAAC,mCAAmC,CAAC,CAAC;QAC5D,CAAC;IAAA,CACF;CACF"}

package/dist/bitstream/bitReaderReverse.test.d.ts

@@ -0,0 +1 @@
+export {};

package/dist/bitstream/bitReaderReverse.test.js

@@ -0,0 +1,49 @@
+import { describe, expect, it } from 'vitest';
+import { BitReaderReverse } from './bitReaderReverse.js';
+describe('BitReaderReverse', () => {
+    it('supports unreadBits to rollback over-read', () => {
+        const reader = new BitReaderReverse(new Uint8Array([0xa0, 0x01]), 0, 2);
+        reader.skipPadding();
+        const first = reader.readBits(2);
+        expect(first).toBe(2);
+        reader.unreadBits(1);
+        expect(reader.readBits(1)).toBe(0);
+    });
+    it('zero-fills when reading past stream start', () => {
+        const reader = new BitReaderReverse(new Uint8Array([0x80]), 0, 1);
+        reader.skipPadding();
+        // No payload bits remain after padding; reading still succeeds with zeros.
+        expect(reader.readBits(4)).toBe(0);
+    });
+    it('position returns start byte when bitOffset <= startBit', () => {
+        const reader = new BitReaderReverse(new Uint8Array([0x80]), 0, 1);
+        reader.skipPadding();
+        reader.readBits(4); // consume remaining (zeros)
+        expect(reader.position).toBe(0);
+    });
+    it('position returns correct byte after reading bits', () => {
+        const reader = new BitReaderReverse(new Uint8Array([0xa0, 0x01]), 0, 2);
+        reader.skipPadding();
+        reader.readBits(2);
+        expect(reader.position).toBeGreaterThanOrEqual(0);
+        expect(reader.position).toBeLessThanOrEqual(2);
+    });
+    it('skipBitsAtEnd advances logical position', () => {
+        const reader = new BitReaderReverse(new Uint8Array([0x80]), 0, 1);
+        reader.skipPadding();
+        reader.skipBitsAtEnd(1);
+        expect(reader.readBits(1)).toBe(0);
+    });
+    it('skipBitsAtEnd throws on buffer underflow', () => {
+        const reader = new BitReaderReverse(new Uint8Array([0x80]), 0, 1);
+        reader.skipPadding();
+        expect(() => reader.skipBitsAtEnd(100)).toThrow(/underflow|RangeError/i);
+    });
+    it('unreadBits throws on overflow', () => {
+        const reader = new BitReaderReverse(new Uint8Array([0xa0, 0x01]), 0, 2);
+        reader.skipPadding();
+        reader.readBits(2);
+        expect(() => reader.unreadBits(20)).toThrow(/overflow|RangeError/i);
+    });
+});
+//# sourceMappingURL=bitReaderReverse.test.js.map

package/dist/bitstream/bitReaderReverse.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bitReaderReverse.test.js","sourceRoot":"","sources":["../../src/bitstream/bitReaderReverse.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,QAAQ,CAAC;AAC9C,OAAO,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AAEzD,QAAQ,CAAC,kBAAkB,EAAE,GAAG,EAAE,CAAC;IACjC,EAAE,CAAC,2CAA2C,EAAE,GAAG,EAAE,CAAC;QACpD,MAAM,MAAM,GAAG,IAAI,gBAAgB,CAAC,IAAI,UAAU,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACxE,MAAM,CAAC,WAAW,EAAE,CAAC;QACrB,MAAM,KAAK,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACjC,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACtB,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QACrB,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAAA,CACpC,CAAC,CAAC;IAEH,EAAE,CAAC,2CAA2C,EAAE,GAAG,EAAE,CAAC;QACpD,MAAM,MAAM,GAAG,IAAI,gBAAgB,CAAC,IAAI,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAClE,MAAM,CAAC,WAAW,EAAE,CAAC;QACrB,2EAA2E;QAC3E,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAAA,CACpC,CAAC,CAAC;IAEH,EAAE,CAAC,wDAAwD,EAAE,GAAG,EAAE,CAAC;QACjE,MAAM,MAAM,GAAG,IAAI,gBAAgB,CAAC,IAAI,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAClE,MAAM,CAAC,WAAW,EAAE,CAAC;QACrB,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,4BAA4B;QAChD,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAAA,CACjC,CAAC,CAAC;IAEH,EAAE,CAAC,kDAAkD,EAAE,GAAG,EAAE,CAAC;QAC3D,MAAM,MAAM,GAAG,IAAI,gBAAgB,CAAC,IAAI,UAAU,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACxE,MAAM,CAAC,WAAW,EAAE,CAAC;QACrB,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACnB,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;QAClD,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC;IAAA,CAChD,CAAC,CAAC;IAEH,EAAE,CAAC,yCAAyC,EAAE,GAAG,EAAE,CAAC;QAClD,MAAM,MAAM,GAAG,IAAI,gBAAgB,CAAC,IAAI,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAClE,MAAM,CAAC,WAAW,EAAE,CAAC;QACrB,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;QACxB,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAAA,CACpC,CAAC,CAAC;IAEH,EAAE,CAAC,0CAA0C,EAAE,GAAG,EAAE,CAAC;QACnD,MAAM,MAAM,GAAG,IAAI,gBAAgB,CAAC,IAAI,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAClE,MAAM,CAAC,WAAW,EAAE,CAAC;QACrB,MAAM,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,uBAAuB,CAAC,CAAC;IAAA,CAC1E,CAAC,CAAC;IAEH,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE,CAAC;QACxC,MAAM,MAAM,GAAG,IAAI,gBAAgB,CAAC,IAAI,UAAU,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACxE,MAAM,CAAC,WAAW,EAAE,CAAC;QACrB,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACnB,MAAM,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,sBAAsB,CAAC,CAAC;IAAA,CACrE,CAAC,CAAC;AAAA,CACJ,CAAC,CAAC"}

package/dist/bitstream/bitWriter.d.ts

@@ -0,0 +1,15 @@
+/**
+ * Little-endian bit writer.
+ * Writes bits LSB-first within bytes.
+ */
+export declare class BitWriter {
+    private chunks;
+    private currentByte;
+    private bitOffset;
+    /** Write n bits (1-32), LSB first */
+    writeBits(n: number, bits: number): void;
+    /** Flush remaining bits to output. Call when done writing. */
+    flush(): Uint8Array;
+    /** Reset writer for reuse */
+    reset(): void;
+}

package/dist/bitstream/bitWriter.js

@@ -0,0 +1,47 @@
+/**
+ * Little-endian bit writer.
+ * Writes bits LSB-first within bytes.
+ */
+export class BitWriter {
+    chunks = [];
+    currentByte = 0;
+    bitOffset = 0; // 0-7, bits written in current byte
+    /** Write n bits (1-32), LSB first */
+    writeBits(n, bits) {
+        if (n < 1 || n > 32) {
+            throw new RangeError(`BitWriter.writeBits: n must be 1-32, got ${n}`);
+        }
+        const mask = n === 32 ? 0xffff_ffff : (1 << n) - 1;
+        let value = (bits >>> 0) & mask;
+        let bitsLeft = n;
+        while (bitsLeft > 0) {
+            const spaceInByte = 8 - this.bitOffset;
+            const take = Math.min(bitsLeft, spaceInByte);
+            const maskTake = (1 << take) - 1;
+            this.currentByte |= (value & maskTake) << this.bitOffset;
+            this.bitOffset += take;
+            bitsLeft -= take;
+            value >>= take;
+            if (this.bitOffset >= 8) {
+                this.chunks.push(this.currentByte & 0xff);
+                this.currentByte = 0;
+                this.bitOffset = 0;
+            }
+        }
+    }
+    /** Flush remaining bits to output. Call when done writing. */
+    flush() {
+        const result = [...this.chunks];
+        if (this.bitOffset > 0) {
+            result.push(this.currentByte & 0xff);
+        }
+        return new Uint8Array(result);
+    }
+    /** Reset writer for reuse */
+    reset() {
+        this.chunks = [];
+        this.currentByte = 0;
+        this.bitOffset = 0;
+    }
+}
+//# sourceMappingURL=bitWriter.js.map

package/dist/bitstream/bitWriter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bitWriter.js","sourceRoot":"","sources":["../../src/bitstream/bitWriter.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,MAAM,OAAO,SAAS;IACZ,MAAM,GAAa,EAAE,CAAC;IACtB,WAAW,GAAG,CAAC,CAAC;IAChB,SAAS,GAAG,CAAC,CAAC,CAAC,oCAAoC;IAE3D,qCAAqC;IACrC,SAAS,CAAC,CAAS,EAAE,IAAY,EAAQ;QACvC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;YACpB,MAAM,IAAI,UAAU,CAAC,4CAA4C,CAAC,EAAE,CAAC,CAAC;QACxE,CAAC;QACD,MAAM,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QACnD,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC;QAChC,IAAI,QAAQ,GAAG,CAAC,CAAC;QAEjB,OAAO,QAAQ,GAAG,CAAC,EAAE,CAAC;YACpB,MAAM,WAAW,GAAG,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC;YACvC,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,WAAW,CAAC,CAAC;YAC7C,MAAM,QAAQ,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC;YACjC,IAAI,CAAC,WAAW,IAAI,CAAC,KAAK,GAAG,QAAQ,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC;YAEzD,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC;YACvB,QAAQ,IAAI,IAAI,CAAC;YACjB,KAAK,KAAK,IAAI,CAAC;YAEf,IAAI,IAAI,CAAC,SAAS,IAAI,CAAC,EAAE,CAAC;gBACxB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,CAAC;gBAC1C,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC;gBACrB,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;YACrB,CAAC;QACH,CAAC;IAAA,CACF;IAED,8DAA8D;IAC9D,KAAK,GAAe;QAClB,MAAM,MAAM,GAAa,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;QAC1C,IAAI,IAAI,CAAC,SAAS,GAAG,CAAC,EAAE,CAAC;YACvB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,CAAC;QACvC,CAAC;QACD,OAAO,IAAI,UAAU,CAAC,MAAM,CAAC,CAAC;IAAA,CAC/B;IAED,6BAA6B;IAC7B,KAAK,GAAS;QACZ,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC;QACjB,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC;QACrB,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;IAAA,CACpB;CACF"}

package/dist/bitstream/index.d.ts

@@ -0,0 +1,4 @@
+export { BitReader } from './bitReader.js';
+export { BitWriter } from './bitWriter.js';
+export { readU16LE, readU32LE, readU64LE } from './littleEndian.js';
+export { decodeVarint, encodeVarint } from './varint.js';

package/dist/bitstream/index.js

@@ -0,0 +1,5 @@
+export { BitReader } from './bitReader.js';
+export { BitWriter } from './bitWriter.js';
+export { readU16LE, readU32LE, readU64LE } from './littleEndian.js';
+export { decodeVarint, encodeVarint } from './varint.js';
+//# sourceMappingURL=index.js.map

package/dist/bitstream/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/bitstream/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAC;AAC3C,OAAO,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAC;AAC3C,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAC;AACpE,OAAO,EAAE,YAAY,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC"}

package/dist/bitstream/littleEndian.d.ts

@@ -0,0 +1,7 @@
+/**
+ * Little-endian read helpers for Uint8Array.
+ * All reads are bounds-checked.
+ */
+export declare function readU16LE(data: Uint8Array, offset: number): number;
+export declare function readU32LE(data: Uint8Array, offset: number): number;
+export declare function readU64LE(data: Uint8Array, offset: number): bigint;

package/dist/bitstream/littleEndian.js

@@ -0,0 +1,45 @@
+/**
+ * Little-endian read helpers for Uint8Array.
+ * All reads are bounds-checked.
+ */
+export function readU16LE(data, offset) {
+    if (offset + 2 > data.length) {
+        throw new RangeError(`readU16LE: offset ${offset} + 2 exceeds length ${data.length}`);
+    }
+    const a = data[offset];
+    const b = data[offset + 1];
+    if (a === undefined || b === undefined)
+        throw new Error('unreachable');
+    return a | (b << 8);
+}
+export function readU32LE(data, offset) {
+    if (offset + 4 > data.length) {
+        throw new RangeError(`readU32LE: offset ${offset} + 4 exceeds length ${data.length}`);
+    }
+    const a = data[offset];
+    const b = data[offset + 1];
+    const c = data[offset + 2];
+    const d = data[offset + 3];
+    if (a === undefined || b === undefined || c === undefined || d === undefined)
+        throw new Error('unreachable');
+    return (a | (b << 8) | (c << 16) | (d << 24)) >>> 0;
+}
+export function readU64LE(data, offset) {
+    if (offset + 8 > data.length) {
+        throw new RangeError(`readU64LE: offset ${offset} + 8 exceeds length ${data.length}`);
+    }
+    const b0 = data[offset];
+    const b1 = data[offset + 1];
+    const b2 = data[offset + 2];
+    const b3 = data[offset + 3];
+    const b4 = data[offset + 4];
+    const b5 = data[offset + 5];
+    const b6 = data[offset + 6];
+    const b7 = data[offset + 7];
+    if ([b0, b1, b2, b3, b4, b5, b6, b7].some((x) => x === undefined))
+        throw new Error('unreachable');
+    const lo = (b0 | (b1 << 8) | (b2 << 16) | (b3 << 24)) >>> 0;
+    const hi = (b4 | (b5 << 8) | (b6 << 16) | (b7 << 24)) >>> 0;
+    return BigInt(lo) | (BigInt(hi) << 32n);
+}
+//# sourceMappingURL=littleEndian.js.map

package/dist/bitstream/littleEndian.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"littleEndian.js","sourceRoot":"","sources":["../../src/bitstream/littleEndian.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,MAAM,UAAU,SAAS,CAAC,IAAgB,EAAE,MAAc,EAAU;IAClE,IAAI,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QAC7B,MAAM,IAAI,UAAU,CAAC,qBAAqB,MAAM,uBAAuB,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;IACxF,CAAC;IACD,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;IACvB,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC3B,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS;QAAE,MAAM,IAAI,KAAK,CAAC,aAAa,CAAC,CAAC;IACvE,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;AAAA,CACrB;AAED,MAAM,UAAU,SAAS,CAAC,IAAgB,EAAE,MAAc,EAAU;IAClE,IAAI,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QAC7B,MAAM,IAAI,UAAU,CAAC,qBAAqB,MAAM,uBAAuB,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;IACxF,CAAC;IACD,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;IACvB,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC3B,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC3B,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC3B,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS;QAAE,MAAM,IAAI,KAAK,CAAC,aAAa,CAAC,CAAC;IAC7G,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;AAAA,CACrD;AAED,MAAM,UAAU,SAAS,CAAC,IAAgB,EAAE,MAAc,EAAU;IAClE,IAAI,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QAC7B,MAAM,IAAI,UAAU,CAAC,qBAAqB,MAAM,uBAAuB,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;IACxF,CAAC;IACD,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;IACxB,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC5B,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC5B,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC5B,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC5B,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC5B,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC5B,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC5B,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,aAAa,CAAC,CAAC;IAClG,MAAM,EAAE,GAAG,CAAE,EAAa,GAAG,CAAE,EAAa,IAAI,CAAC,CAAC,GAAG,CAAE,EAAa,IAAI,EAAE,CAAC,GAAG,CAAE,EAAa,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;IAC5G,MAAM,EAAE,GAAG,CAAE,EAAa,GAAG,CAAE,EAAa,IAAI,CAAC,CAAC,GAAG,CAAE,EAAa,IAAI,EAAE,CAAC,GAAG,CAAE,EAAa,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;IAC5G,OAAO,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,IAAI,GAAG,CAAC,CAAC;AAAA,CACzC"}

package/dist/bitstream/littleEndian.test.d.ts

@@ -0,0 +1 @@
+export {};

package/dist/bitstream/littleEndian.test.js

@@ -0,0 +1,21 @@
+import { describe, expect, it } from 'vitest';
+import { readU16LE, readU32LE, readU64LE } from './littleEndian.js';
+describe('littleEndian', () => {
+    it('readU16LE', () => {
+        const data = new Uint8Array([0x34, 0x12]); // 0x1234
+        expect(readU16LE(data, 0)).toBe(0x1234);
+    });
+    it('readU32LE', () => {
+        const data = new Uint8Array([0x78, 0x56, 0x34, 0x12]);
+        expect(readU32LE(data, 0)).toBe(0x12345678);
+    });
+    it('readU64LE', () => {
+        const data = new Uint8Array([0xef, 0xcd, 0xab, 0x89, 0x67, 0x45, 0x23, 0x01]);
+        expect(readU64LE(data, 0)).toBe(0x0123456789abcdefn);
+    });
+    it('throws on out of bounds', () => {
+        const data = new Uint8Array([1, 2, 3]);
+        expect(() => readU32LE(data, 0)).toThrow();
+    });
+});
+//# sourceMappingURL=littleEndian.test.js.map