lzma1 0.2.0 → 0.3.0

package/src/range-decoder.ts

@@ -0,0 +1,98 @@
+import type { InputBuffer } from "./streams.js";
+
+export class RangeDecoder {
+	public stream: InputBuffer | null = null;
+	public code: number = 0;
+	public rrange: number = 0;
+
+	/**
+	 * Set input stream for decoding
+	 */
+	setStream(stream: InputBuffer | null): void {
+		this.stream = stream;
+	}
+
+	/**
+	 * Initialize range decoder
+	 */
+	init(): void {
+		this.code = 0;
+		this.rrange = -1;
+
+		for (let i = 0; i < 5; ++i) {
+			this.code = this.code << 8 | this.readFromStream();
+		}
+	}
+
+	/**
+	 * Decode a single bit using probability model
+	 */
+	decodeBit(probs: number[], index: number): 0 | 1 {
+		let newBound, prob = probs[index];
+		newBound = (this.rrange >>> 11) * prob;
+
+		if ((this.code ^ -0x80000000) < (newBound ^ -0x80000000)) {
+			this.rrange = newBound;
+			probs[index] = prob + ((2048 - prob) >>> 5);
+			if (!(this.rrange & -0x1000000)) {
+				this.code = this.code << 8 | this.readFromStream();
+				this.rrange <<= 8;
+			}
+			return 0;
+		} else {
+			this.rrange -= newBound;
+			this.code -= newBound;
+			probs[index] = prob - (prob >>> 5);
+			if (!(this.rrange & -0x1000000)) {
+				this.code = this.code << 8 | this.readFromStream();
+				this.rrange <<= 8;
+			}
+			return 1;
+		}
+	}
+
+	/**
+	 * Decode direct bits (without probability model)
+	 */
+	decodeDirectBits(numTotalBits: number): number {
+		let result = 0;
+
+		for (let i = numTotalBits; i != 0; i -= 1) {
+			this.rrange >>>= 1;
+			let t = (this.code - this.rrange) >>> 31;
+			this.code -= this.rrange & (t - 1);
+			result = result << 1 | 1 - t;
+
+			if (!(this.rrange & -0x1000000)) {
+				this.code = this.code << 8 | this.readFromStream();
+				this.rrange <<= 8;
+			}
+		}
+
+		return result;
+	}
+
+	/**
+	 * Get current code value (for compatibility)
+	 */
+	get currentCode(): number {
+		return this.code;
+	}
+
+	/**
+	 * Get current range value (for compatibility)
+	 */
+	get currentRange(): number {
+		return this.rrange;
+	}
+
+	/**
+	 * Read a single byte from the input stream
+	 */
+	private readFromStream(): number {
+		if (!this.stream) {
+			return 0;
+		}
+		return this.stream.readByte();
+	}
+}

package/src/range-encoder.ts

@@ -0,0 +1,136 @@
+import type { OutputBuffer } from "./streams.js";
+
+export class RangeEncoder {
+	private stream: OutputBuffer | null = null;
+	private low: bigint = 0n;
+	private rrange: number = 0;
+	private cache: number = 0;
+	private cacheSize: number = 0;
+	private position: bigint = 0n;
+
+	constructor() {
+		// Initialize with default values
+	}
+
+	/**
+	 * Set output stream for encoding
+	 */
+	setStream(stream: OutputBuffer | null): void {
+		this.stream = stream;
+	}
+
+	/**
+	 * Initialize range encoder
+	 */
+	init(): void {
+		this.position = 0n;
+		this.low = 0n;
+		this.rrange = -1;
+		this.cacheSize = 1;
+		this.cache = 0;
+	}
+
+	/**
+	 * Encode a single bit using probability model
+	 */
+	encodeBit(probs: number[], index: number, bit: number): void {
+		const prob = probs[index];
+		const newBound = (this.rrange >>> 11) * prob;
+
+		if (bit === 0) {
+			this.rrange = newBound;
+			probs[index] = prob + ((2048 - prob) >>> 5);
+		} else {
+			this.low += BigInt(newBound);
+			this.rrange -= newBound;
+			probs[index] = prob - (prob >>> 5);
+		}
+
+		if (!(this.rrange & -0x1000000)) {
+			this.rrange <<= 8;
+			this.shiftLow();
+		}
+	}
+
+	/**
+	 * Encode direct bits (without probability model)
+	 */
+	encodeDirectBits(value: number, numTotalBits: number): void {
+		for (let i = numTotalBits - 1; i >= 0; i--) {
+			this.rrange >>>= 1;
+			if (((value >>> i) & 1) === 1) {
+				this.low += BigInt(this.rrange);
+			}
+			if (!(this.rrange & -0x1000000)) {
+				this.rrange <<= 8;
+				this.shiftLow();
+			}
+		}
+	}
+
+	/**
+	 * Encode bit tree symbol
+	 */
+	encodeBitTree(numBitLevels: number, models: number[], symbol: number, startIndex: number = 1): void {
+		let m = 1;
+		for (let bitIndex = numBitLevels; bitIndex !== 0; bitIndex--) {
+			const bit = (symbol >>> (bitIndex - 1)) & 1;
+			this.encodeBit(models, startIndex + m - 1, bit);
+			m = (m << 1) | bit;
+		}
+	}
+
+	/**
+	 * Reverse encode bits
+	 */
+	reverseEncodeBits(numBitLevels: number, models: number[], symbol: number, startIndex: number): void {
+		let m = 1;
+		for (let i = 0; i < numBitLevels; i++) {
+			const bit = symbol & 1;
+			this.encodeBit(models, startIndex + m, bit);
+			m = (m << 1) | bit;
+			symbol >>>= 1;
+		}
+	}
+
+	/**
+	 * Finish encoding and flush remaining data
+	 */
+	finish(): void {
+		for (let i = 0; i < 5; i++) {
+			this.shiftLow();
+		}
+	}
+
+	/**
+	 * Shift low value and write to stream
+	 */
+	private shiftLow(): void {
+		const lowHi = Number((this.low >> 32n) & 0xFFFFFFFFn);
+
+		if (lowHi !== 0 || Number(this.low & 0xFFFFFFFFn) < 0xFF000000) {
+			this.position += BigInt(this.cacheSize);
+
+			let temp = this.cache;
+			do {
+				this.writeToStream(temp + lowHi);
+				temp = 255;
+			} while (--this.cacheSize !== 0);
+
+			this.cache = (Number(this.low & 0xFFFFFFFFn) >>> 24) & 0xFF;
+		}
+
+		this.cacheSize++;
+		this.low = BigInt(Number(this.low & 0xFFFFFFFFn) & 0xFFFFFF) << 8n;
+	}
+
+	/**
+	 * Write byte to output stream
+	 */
+	private writeToStream(value: number): void {
+		if (!this.stream) {
+			return;
+		}
+		this.stream.writeByte(value & 0xFF);
+	}
+}

package/src/streams.ts

@@ -0,0 +1,73 @@
+/**
+ * Read-only input buffer wrapping a Uint8Array.
+ */
+export class InputBuffer {
+	buf: Uint8Array;
+	pos: number = 0;
+	count: number;
+
+	constructor(data: Uint8Array) {
+		this.buf = data;
+		this.count = data.length;
+	}
+
+	readByte(): number {
+		if (this.pos >= this.count) return -1;
+		return this.buf[this.pos++] & 0xFF;
+	}
+
+	readBytes(dest: Uint8Array, off: number, len: number): number {
+		if (this.pos >= this.count) return -1;
+		len = Math.min(len, this.count - this.pos);
+		dest.set(this.buf.subarray(this.pos, this.pos + len), off);
+		this.pos += len;
+		return len;
+	}
+
+	get remaining(): number {
+		return this.count - this.pos;
+	}
+}
+
+/**
+ * Growable output buffer backed by a Uint8Array.
+ */
+export class OutputBuffer {
+	buf: Uint8Array;
+	count: number = 0;
+
+	constructor(capacity: number = 32) {
+		this.buf = new Uint8Array(capacity);
+	}
+
+	private grow(requiredSize: number): void {
+		const newSize = Math.max(this.buf.length * 2, requiredSize);
+		const newBuf = new Uint8Array(newSize);
+		newBuf.set(this.buf.subarray(0, this.count));
+		this.buf = newBuf;
+	}
+
+	writeByte(b: number): void {
+		if (this.count >= this.buf.length) {
+			this.grow(this.count + 1);
+		}
+		this.buf[this.count++] = b;
+	}
+
+	writeBytes(src: Uint8Array, off: number, len: number): void {
+		const requiredSize = this.count + len;
+		if (requiredSize > this.buf.length) {
+			this.grow(requiredSize);
+		}
+		this.buf.set(src.subarray(off, off + len), this.count);
+		this.count += len;
+	}
+
+	write(buf: Uint8Array): void {
+		this.writeBytes(buf, 0, buf.length);
+	}
+
+	toArray(): Uint8Array {
+		return this.buf.slice(0, this.count);
+	}
+}

package/src/utils.ts

@@ -0,0 +1,263 @@
+export interface BitTree {
+	numBitLevels: number;
+	models: number[];
+}
+
+/**
+ * Literal decoder/encoder for optimization
+ */
+export interface LiteralDecoderEncoder2 {
+	decoders: number[];
+}
+
+/**
+ * Basic range encoder interface for bit operations
+ */
+export interface BasicRangeEncoder {
+	encodeBit(probs: number[], index: number, bit: number): void;
+}
+
+/**
+ * Basic range decoder interface for bit operations
+ */
+export interface BasicRangeDecoder {
+	decodeBit(probs: number[], index: number): number;
+}
+
+// Additional LZMA constants
+export const INFINITY_PRICE = 0xFFFFFFF;
+export const _MAX_UINT32 = 0xFFFFFFFF;
+export const DICTIONARY_SIZE_THRESHOLD = 0x3FFFFFFF;
+
+// Range coder constants
+export const kTopValue = 1 << 24;
+export const kNumBitModelTotalBits = 11;
+export const kBitModelTotal = 1 << kNumBitModelTotalBits;
+export const kNumMoveBits = 5;
+export const kNumMoveReducingBits = 2;
+export const kNumBitPriceShiftBits = 6;
+
+// Common array sizes used throughout LZMA implementation
+export const MATCH_DECODERS_SIZE = 0xC0; // 192
+export const REP_DECODERS_SIZE = 12;
+export const POS_DECODERS_SIZE = 114;
+export const LITERAL_DECODER_SIZE = 0x300; // 768
+export const DEFAULT_WINDOW_SIZE = 0x1000; // 4096
+export const CHOICE_ARRAY_SIZE = 2;
+
+/**
+ * CRC32 lookup table for hash calculations
+ * dprint-ignore
+ */
+export const CRC32_TABLE = [
+	0x00000000, 0x77073096, 0xEE0E612C, 0x990951BA, 0x076DC419, 0x706AF48F,
+	0xE963A535, 0x9E6495A3,	0x0EDB8832, 0x79DCB8A4, 0xE0D5E91E, 0x97D2D988,
+	0x09B64C2B, 0x7EB17CBD, 0xE7B82D07, 0x90BF1D91, 0x1DB71064, 0x6AB020F2,
+	0xF3B97148, 0x84BE41DE,	0x1ADAD47D, 0x6DDDE4EB, 0xF4D4B551, 0x83D385C7,
+	0x136C9856, 0x646BA8C0, 0xFD62F97A, 0x8A65C9EC,	0x14015C4F, 0x63066CD9,
+	0xFA0F3D63, 0x8D080DF5,	0x3B6E20C8, 0x4C69105E, 0xD56041E4, 0xA2677172,
+	0x3C03E4D1, 0x4B04D447, 0xD20D85FD, 0xA50AB56B,	0x35B5A8FA, 0x42B2986C,
+	0xDBBBC9D6, 0xACBCF940,	0x32D86CE3, 0x45DF5C75, 0xDCD60DCF, 0xABD13D59,
+	0x26D930AC, 0x51DE003A, 0xC8D75180, 0xBFD06116, 0x21B4F4B5, 0x56B3C423,
+	0xCFBA9599, 0xB8BDA50F, 0x2802B89E, 0x5F058808, 0xC60CD9B2, 0xB10BE924,
+	0x2F6F7C87, 0x58684C11, 0xC1611DAB, 0xB6662D3D,	0x76DC4190, 0x01DB7106,
+	0x98D220BC, 0xEFD5102A, 0x71B18589, 0x06B6B51F, 0x9FBFE4A5, 0xE8B8D433,
+	0x7807C9A2, 0x0F00F934, 0x9609A88E, 0xE10E9818, 0x7F6A0DBB, 0x086D3D2D,
+	0x91646C97, 0xE6635C01, 0x6B6B51F4, 0x1C6C6162, 0x856530D8, 0xF262004E,
+	0x6C0695ED, 0x1B01A57B, 0x8208F4C1, 0xF50FC457, 0x65B0D9C6, 0x12B7E950,
+	0x8BBEB8EA, 0xFCB9887C, 0x62DD1DDF, 0x15DA2D49, 0x8CD37CF3, 0xFBD44C65,
+	0x4DB26158, 0x3AB551CE, 0xA3BC0074, 0xD4BB30E2, 0x4ADFA541, 0x3DD895D7,
+	0xA4D1C46D, 0xD3D6F4FB, 0x4369E96A, 0x346ED9FC, 0xAD678846, 0xDA60B8D0,
+	0x44042D73, 0x33031DE5, 0xAA0A4C5F, 0xDD0D7CC9, 0x5005713C, 0x270241AA,
+	0xBE0B1010, 0xC90C2086, 0x5768B525, 0x206F85B3, 0xB966D409, 0xCE61E49F,
+	0x5EDEF90E, 0x29D9C998, 0xB0D09822, 0xC7D7A8B4, 0x59B33D17, 0x2EB40D81,
+	0xB7BD5C3B, 0xC0BA6CAD, 0xEDB88320, 0x9ABFB3B6, 0x03B6E20C, 0x74B1D29A,
+	0xEAD54739, 0x9DD277AF, 0x04DB2615, 0x73DC1683, 0xE3630B12, 0x94643B84,
+	0x0D6D6A3E, 0x7A6A5AA8, 0xE40ECF0B, 0x9309FF9D, 0x0A00AE27, 0x7D079EB1,
+	0xF00F9344, 0x8708A3D2, 0x1E01F268, 0x6906C2FE, 0xF762575D, 0x806567CB,
+	0x196C3671, 0x6E6B06E7, 0xFED41B76, 0x89D32BE0, 0x10DA7A5A, 0x67DD4ACC,
+	0xF9B9DF6F, 0x8EBEEFF9, 0x17B7BE43, 0x60B08ED5, 0xD6D6A3E8, 0xA1D1937E,
+	0x38D8C2C4, 0x4FDFF252, 0xD1BB67F1, 0xA6BC5767, 0x3FB506DD, 0x48B2364B,
+	0xD80D2BDA, 0xAF0A1B4C, 0x36034AF6, 0x41047A60, 0xDF60EFC3, 0xA867DF55,
+	0x316E8EEF, 0x4669BE79, 0xCB61B38C, 0xBC66831A, 0x256FD2A0, 0x5268E236,
+	0xCC0C7795, 0xBB0B4703, 0x220216B9, 0x5505262F, 0xC5BA3BBE, 0xB2BD0B28,
+	0x2BB45A92, 0x5CB36A04, 0xC2D7FFA7, 0xB5D0CF31, 0x2CD99E8B, 0x5BDEAE1D,
+	0x9B64C2B0, 0xEC63F226, 0x756AA39C, 0x026D930A, 0x9C0906A9, 0xEB0E363F,
+	0x72076785, 0x05005713, 0x95BF4A82, 0xE2B87A14, 0x7BB12BAE, 0x0CB61B38,
+	0x92D28E9B, 0xE5D5BE0D, 0x7CDCEFB7, 0x0BDBDF21, 0x86D3D2D4, 0xF1D4E242,
+	0x68DDB3F8, 0x1FDA836E, 0x81BE16CD, 0xF6B9265B, 0x6FB077E1, 0x18B74777,
+	0x88085AE6, 0xFF0F6A70, 0x66063BCA, 0x11010B5C, 0x8F659EFF, 0xF862AE69,
+	0x616BFFD3, 0x166CCF45, 0xA00AE278, 0xD70DD2EE, 0x4E048354, 0x3903B3C2,
+	0xA7672661, 0xD06016F7, 0x4969474D, 0x3E6E77DB, 0xAED16A4A, 0xD9D65ADC,
+	0x40DF0B66, 0x37D83BF0, 0xA9BCAE53, 0xDEBB9EC5, 0x47B2CF7F, 0x30B5FFE9,
+	0xBDBDF21C, 0xCABAC28A, 0x53B39330, 0x24B4A3A6, 0xBAD03605, 0xCDD70693,
+	0x54DE5729, 0x23D967BF, 0xB3667A2E, 0xC4614AB8, 0x5D681B02, 0x2A6F2B94,
+	0xB40BBE37, 0xC30C8EA1, 0x5A05DF1B, 0x2D02EF8D
+];
+
+/**
+ * Pre-computed static instances for common use
+ */
+export const PROB_PRICES: number[] = createProbPrices();
+export const G_FAST_POS: number[] = createFastPos();
+
+/**
+ * Initialize array with specified length and default value
+ * This is MUCH faster than "new Array(len)" in newer versions of v8
+ * (starting with Node.js 0.11.15, which uses v8 3.28.73).
+ */
+export function initArray(len: number, value = 0): number[] {
+	const array = [];
+
+	// Pre-allocate array by setting the last index
+	array[len - 1] = undefined;
+
+	// Fill with specified value if needed
+	if (value !== 0) {
+		for (let i = 0; i < len; i++) {
+			array[i] = value;
+		}
+	}
+
+	return array as unknown as number[];
+}
+
+/**
+ * Copy array data with bounds checking and overlap handling
+ */
+export function arraycopy(
+	src: number[],
+	srcOfs: number,
+	dest: number[],
+	destOfs: number,
+	len: number,
+): void {
+	// Bounds checking
+	if (
+		srcOfs < 0
+		|| destOfs < 0
+		|| len < 0
+		|| srcOfs + len > src.length
+		|| destOfs + len > dest.length
+	) {
+		return;
+	}
+
+	if (
+		src === dest
+		&& srcOfs < destOfs
+		&& destOfs < srcOfs + len
+	) {
+		// Overlapping regions - copy backwards
+		for (let i = len - 1; i >= 0; i--) {
+			dest[destOfs + i] = src[srcOfs + i];
+		}
+	} else {
+		// Non-overlapping or safe regions - copy forward
+		for (let i = 0; i < len; i++) {
+			dest[destOfs + i] = src[srcOfs + i];
+		}
+	}
+}
+
+/**
+ * Get bit price using pre-computed probability prices
+ */
+export function getBitPrice(probability: number, bit: number): number {
+	return PROB_PRICES[((probability - bit ^ -bit) & 2047) >>> 2];
+}
+
+/**
+ * Bit model operations
+ */
+
+/**
+ * Initialize bit models with default probability
+ */
+export function initBitModels(probs: number[]): void {
+	for (let i = probs.length - 1; i >= 0; --i) {
+		probs[i] = 1024;
+	}
+}
+
+/**
+ * Position and state operations
+ */
+
+/**
+ * Get length to position state mapping
+ */
+export function getLenToPosState(len: number): number {
+	len -= 2;
+	if (len < 4) {
+		return len;
+	}
+	return 3;
+}
+
+/**
+ * Update state after character encoding/decoding
+ */
+const STATE_UPDATE_CHAR_TABLE = [0, 0, 0, 0, 1, 2, 3, 4, 5, 6, 4, 5];
+
+export function stateUpdateChar(index: number): number {
+	if (index >= 0 && index < STATE_UPDATE_CHAR_TABLE.length) {
+		return STATE_UPDATE_CHAR_TABLE[index];
+	}
+	if (index < 4) {
+		return 0;
+	}
+	if (index < 10) {
+		return index - 3;
+	}
+	return index - 6;
+}
+
+/**
+ * Bit tree operations
+ */
+
+/**
+ * Create a bit tree with specified number of bit levels
+ */
+export function createBitTree(numBitLevels: number): BitTree {
+	return {
+		numBitLevels: numBitLevels,
+		models: initArray(1 << numBitLevels),
+	};
+}
+
+/**
+ * Create probability prices lookup table
+ */
+export function createProbPrices(): number[] {
+	const probPrices = [];
+	for (let i = 8; i >= 0; --i) {
+		let start = 1 << (9 - i - 1);
+		let end = 1 << (9 - i);
+
+		for (let j = start; j < end; ++j) {
+			probPrices[j] = (i << 6) + ((end - j) << 6 >>> (9 - i - 1));
+		}
+	}
+
+	return probPrices;
+}
+
+/**
+ * Create fast position lookup table
+ */
+export function createFastPos(): number[] {
+	const gFastPos = [0, 1];
+	let c = 2;
+
+	for (let slotFast = 2; slotFast < 22; ++slotFast) {
+		let k = 1 << ((slotFast >> 1) - 1);
+
+		for (let j = 0; j < k; ++j, ++c) {
+			gFastPos[c] = slotFast;
+		}
+	}
+
+	return gFastPos;
+}

package/lib/chunker.d.ts

@@ -1,46 +0,0 @@
-import { Decoder } from "./decoder.js";
-import { Encoder } from "./encoder.js";
-/**
- * Base chunker interface for both encoding and decoding operations
- */
-interface BaseChunker {
-    alive: number;
-    inBytesProcessed: [number, number];
-}
-/**
- * Interface for LZMA instance needed by EncoderChunker
- */
-interface LZMAInstance {
-    codeOneBlock(): void;
-    releaseStreams(): void;
-}
-/**
- * Encoder chunker for handling compression chunk processing
- */
-export declare class EncoderChunker implements BaseChunker {
-    encoder: Encoder | null;
-    decoder: null;
-    alive: number;
-    inBytesProcessed: [number, number];
-    private lzma;
-    constructor(lzma: LZMAInstance);
-    /**
-     * Process one chunk of encoding
-     */
-    processChunk(): number;
-}
-/**
- * Decoder chunker for handling decompression chunk processing
- */
-export declare class DecoderChunker implements BaseChunker {
-    encoder: null;
-    decoder: Decoder;
-    alive: number;
-    inBytesProcessed: [number, number];
-    constructor(decoder: Decoder);
-    /**
-     * Process one chunk of decoding
-     */
-    processChunk(): number;
-}
-export {};

package/lib/chunker.js

@@ -1,68 +0,0 @@
-import { compare64, P0_LONG_LIT, } from "./utils.js";
-/**
- * Encoder chunker for handling compression chunk processing
- */
-export class EncoderChunker {
-    encoder = null;
-    decoder = null;
-    alive = 0;
-    inBytesProcessed = [0, 0];
-    lzma;
-    constructor(lzma) {
-        this.lzma = lzma;
-    }
-    /**
-     * Process one chunk of encoding
-     */
-    processChunk() {
-        if (!this.alive) {
-            throw new Error("bad state");
-        }
-        if (!this.encoder) {
-            throw new Error("No decoding");
-        }
-        this.lzma.codeOneBlock();
-        this.inBytesProcessed = this.encoder.processedInSize[0];
-        if (this.encoder.finished[0]) {
-            this.lzma.releaseStreams();
-            this.alive = 0;
-        }
-        return this.alive;
-    }
-}
-/**
- * Decoder chunker for handling decompression chunk processing
- */
-export class DecoderChunker {
-    encoder = null;
-    decoder;
-    alive = 0;
-    inBytesProcessed = [0, 0];
-    constructor(decoder) {
-        this.decoder = decoder;
-    }
-    /**
-     * Process one chunk of decoding
-     */
-    processChunk() {
-        if (!this.alive) {
-            throw new Error("Bad state");
-        }
-        if (this.encoder) {
-            throw new Error("No encoding");
-        }
-        const result = this.decoder.codeOneChunk();
-        if (result === -1) {
-            throw new Error("Corrupted input");
-        }
-        this.inBytesProcessed = this.decoder.nowPos64;
-        const isOutputComplete = (compare64(this.decoder.outSize, P0_LONG_LIT) >= 0)
-            && (compare64(this.decoder.nowPos64, this.decoder.outSize) >= 0);
-        if (result || isOutputComplete) {
-            this.decoder.flush();
-            this.decoder.cleanup();
-            this.alive = 0;
-        }
-        return this.alive;
-    }
-}