distillate 0.1.0

package/dist/fuse/index.js

@@ -0,0 +1,295 @@
+import { i as hash128, n as readHeader, r as writeHeader, s as normalize, t as SerializationError } from "../serialize-E_4WyueA.js";
+//#region src/fuse/fuse.ts
+const ARITY = 3;
+const TYPE_FUSE8 = 3;
+const TYPE_FUSE16 = 4;
+var BinaryFuseBuildError = class extends Error {
+	name = "BinaryFuseBuildError";
+};
+let RLO = 0;
+let RHI = 0;
+function mul64(alo, ahi, blo, bhi) {
+	const a0 = alo & 65535;
+	const a1 = alo >>> 16;
+	const a2 = ahi & 65535;
+	const a3 = ahi >>> 16;
+	const b0 = blo & 65535;
+	const b1 = blo >>> 16;
+	const b2 = bhi & 65535;
+	const b3 = bhi >>> 16;
+	let c0 = a0 * b0;
+	let c1 = c0 >>> 16;
+	c0 &= 65535;
+	c1 += a1 * b0;
+	let c2 = c1 >>> 16;
+	c1 &= 65535;
+	c1 += a0 * b1;
+	c2 += c1 >>> 16;
+	c1 &= 65535;
+	c2 += a2 * b0;
+	let c3 = c2 >>> 16;
+	c2 &= 65535;
+	c2 += a1 * b1;
+	c3 += c2 >>> 16;
+	c2 &= 65535;
+	c2 += a0 * b2;
+	c3 += c2 >>> 16;
+	c2 &= 65535;
+	c3 += a3 * b0 + a2 * b1 + a1 * b2 + a0 * b3;
+	c3 &= 65535;
+	RLO = (c1 << 16 | c0) >>> 0;
+	RHI = (c3 << 16 | c2) >>> 0;
+}
+function fmix64(lo, hi) {
+	let l = (lo ^ hi >>> 1) >>> 0;
+	let h = hi;
+	mul64(l, h, 3981806797, 4283543511);
+	l = RLO;
+	h = RHI;
+	l = (l ^ h >>> 1) >>> 0;
+	mul64(l, h, 444984403, 3301882366);
+	l = RLO;
+	h = RHI;
+	l = (l ^ h >>> 1) >>> 0;
+	RLO = l;
+	RHI = h;
+}
+function mixSeed(lo, hi, seed) {
+	const l = (lo >>> 0) + (seed >>> 0);
+	const carry = l > 4294967295 ? 1 : 0;
+	fmix64(l >>> 0, hi + carry >>> 0);
+}
+function mulhi64(lo, hi, n) {
+	mul64(hi, 0, n, 0);
+	const aLo = RLO;
+	const aHi = RHI;
+	mul64(lo, 0, n, 0);
+	const bHi = RHI;
+	return aHi + ((aLo >>> 0) + (bHi >>> 0) > 4294967295 ? 1 : 0) >>> 0;
+}
+function positionsInto(mlo, mhi, seg, segMask, segCountLen, out) {
+	const h0 = mulhi64(mlo, mhi, segCountLen);
+	let h1 = h0 + seg >>> 0;
+	let h2 = h1 + seg >>> 0;
+	h1 = (h1 ^ (mlo >>> 18 | mhi << 14) & segMask) >>> 0;
+	h2 = (h2 ^ mlo & segMask) >>> 0;
+	out[0] = h0;
+	out[1] = h1;
+	out[2] = h2;
+}
+function fpMask(fp) {
+	return (1 << 8 * fp.BYTES_PER_ELEMENT) - 1 >>> 0;
+}
+function computeParams(size) {
+	const seg = Math.min(1 << Math.floor(Math.log(size) / Math.log(3.33) + 2.25), 1 << 18);
+	const segMask = seg - 1;
+	const sizeFactor = Math.max(1.125, .875 + .25 * Math.log(1e6) / Math.log(Math.max(size, 2)));
+	const capacity = Math.round(size * sizeFactor);
+	let segCount = Math.floor((capacity + seg - 1) / seg) - (ARITY - 1);
+	if (segCount <= 0) segCount = 1;
+	let arrayLength = (segCount + ARITY - 1) * seg;
+	segCount = Math.floor((arrayLength + seg - 1) / seg) - (ARITY - 1);
+	if (segCount <= 0) segCount = 1;
+	arrayLength = (segCount + ARITY - 1) * seg;
+	return {
+		seg,
+		segMask,
+		segCountLen: segCount * seg,
+		arrayLength
+	};
+}
+/**
+* Peel the 3-hypergraph and assign fingerprints so every key's XOR of its 3
+* lanes equals its fingerprint. Retries with a bumped seed on a stall; returns
+* the seed that succeeded.
+*/
+function buildFingerprints(fp, hashes, params, maxAttempts = 100) {
+	const size = hashes.length / 2;
+	const { seg, segMask, segCountLen, arrayLength } = params;
+	const mask = fpMask(fp);
+	const counts = new Uint32Array(arrayLength);
+	const xorLo = new Uint32Array(arrayLength);
+	const xorHi = new Uint32Array(arrayLength);
+	const orderLo = new Uint32Array(size);
+	const orderHi = new Uint32Array(size);
+	const orderIdx = new Uint32Array(size);
+	const pos = /* @__PURE__ */ new Uint32Array(3);
+	for (let attempt = 0; attempt < maxAttempts; attempt++) {
+		const seed = attempt;
+		counts.fill(0);
+		xorLo.fill(0);
+		xorHi.fill(0);
+		for (let i = 0; i < size; i++) {
+			mixSeed(hashes[2 * i] ?? 0, hashes[2 * i + 1] ?? 0, seed);
+			const mlo = RLO;
+			const mhi = RHI;
+			positionsInto(mlo, mhi, seg, segMask, segCountLen, pos);
+			for (let j = 0; j < 3; j++) {
+				const p = pos[j] ?? 0;
+				counts[p] = (counts[p] ?? 0) + 1;
+				xorLo[p] = (xorLo[p] ?? 0) ^ mlo;
+				xorHi[p] = (xorHi[p] ?? 0) ^ mhi;
+			}
+		}
+		const queue = [];
+		for (let idx = 0; idx < arrayLength; idx++) if ((counts[idx] ?? 0) === 1) queue.push(idx);
+		let processed = 0;
+		while (queue.length > 0) {
+			const idx = queue.pop();
+			if (idx === void 0) break;
+			if ((counts[idx] ?? 0) !== 1) continue;
+			const mlo = xorLo[idx] ?? 0;
+			const mhi = xorHi[idx] ?? 0;
+			orderLo[processed] = mlo;
+			orderHi[processed] = mhi;
+			orderIdx[processed] = idx;
+			processed++;
+			positionsInto(mlo, mhi, seg, segMask, segCountLen, pos);
+			for (let j = 0; j < 3; j++) {
+				const p = pos[j] ?? 0;
+				counts[p] = (counts[p] ?? 0) - 1;
+				xorLo[p] = (xorLo[p] ?? 0) ^ mlo;
+				xorHi[p] = (xorHi[p] ?? 0) ^ mhi;
+				if ((counts[p] ?? 0) === 1) queue.push(p);
+			}
+		}
+		if (processed === size) {
+			fp.fill(0);
+			for (let i = processed - 1; i >= 0; i--) {
+				const mlo = orderLo[i] ?? 0;
+				const mhi = orderHi[i] ?? 0;
+				const idx = orderIdx[i] ?? 0;
+				positionsInto(mlo, mhi, seg, segMask, segCountLen, pos);
+				const p0 = pos[0] ?? 0;
+				const p1 = pos[1] ?? 0;
+				const p2 = pos[2] ?? 0;
+				fp[idx] = ((mlo ^ mhi) & mask ^ (fp[p0] ?? 0) ^ (fp[p1] ?? 0) ^ (fp[p2] ?? 0)) & mask;
+			}
+			return seed;
+		}
+	}
+	throw new BinaryFuseBuildError("binary fuse construction failed");
+}
+function buildState(keys, alloc) {
+	const hashList = [];
+	const seen = /* @__PURE__ */ new Set();
+	for (const key of keys) {
+		const { h1lo, h1hi } = hash128(normalize(key), 0);
+		const lo = h1lo >>> 0;
+		const hi = h1hi >>> 0;
+		const id = `${String(lo)},${String(hi)}`;
+		if (seen.has(id)) continue;
+		seen.add(id);
+		hashList.push(lo, hi);
+	}
+	const size = hashList.length / 2;
+	const params = computeParams(size);
+	if (size === 0) return {
+		fp: alloc(0),
+		seed: 0,
+		params,
+		size: 0
+	};
+	const hashes = Uint32Array.from(hashList);
+	const fp = alloc(params.arrayLength);
+	return {
+		fp,
+		seed: buildFingerprints(fp, hashes, params),
+		params,
+		size
+	};
+}
+function fuseStateFromBytes(bytes, expectedType) {
+	const { type, body } = readHeader(bytes);
+	if (type !== expectedType) throw new SerializationError(`expected AMQF type ${String(expectedType)}, got ${String(type)}`);
+	const dv = new DataView(body.buffer, body.byteOffset, body.byteLength);
+	const seed = dv.getUint32(0, true);
+	const seg = dv.getUint32(4, true);
+	const segCountLen = dv.getUint32(8, true);
+	const size = dv.getUint32(12, true);
+	const laneBytes = body.subarray(16);
+	const bpe = expectedType === TYPE_FUSE8 ? 1 : 2;
+	const arrayLength = laneBytes.length / bpe;
+	const fp = bpe === 1 ? new Uint8Array(arrayLength) : new Uint16Array(arrayLength);
+	new Uint8Array(fp.buffer).set(laneBytes);
+	return {
+		fp,
+		seed,
+		params: {
+			seg,
+			segMask: seg - 1,
+			segCountLen,
+			arrayLength
+		},
+		size
+	};
+}
+var BinaryFuse = class {
+	#fp;
+	#seed;
+	#seg;
+	#segMask;
+	#segCountLen;
+	#size;
+	#pos = /* @__PURE__ */ new Uint32Array(3);
+	constructor(state) {
+		this.#fp = state.fp;
+		this.#seed = state.seed;
+		this.#seg = state.params.seg;
+		this.#segMask = state.params.segMask;
+		this.#segCountLen = state.params.segCountLen;
+		this.#size = state.size;
+	}
+	get size() {
+		return this.#size;
+	}
+	get bitsPerKey() {
+		return this.#size === 0 ? 0 : this.#fp.byteLength * 8 / this.#size;
+	}
+	toBytes() {
+		const laneBytes = new Uint8Array(this.#fp.buffer, this.#fp.byteOffset, this.#fp.byteLength);
+		const body = new Uint8Array(16 + laneBytes.length);
+		const dv = new DataView(body.buffer);
+		dv.setUint32(0, this.#seed, true);
+		dv.setUint32(4, this.#seg, true);
+		dv.setUint32(8, this.#segCountLen, true);
+		dv.setUint32(12, this.#size, true);
+		body.set(laneBytes, 16);
+		return writeHeader({
+			version: 1,
+			type: this.#fp.BYTES_PER_ELEMENT === 1 ? TYPE_FUSE8 : TYPE_FUSE16,
+			flags: 0
+		}, body);
+	}
+	has(key) {
+		if (this.#fp.length === 0) return false;
+		const { h1lo, h1hi } = hash128(normalize(key), 0);
+		mixSeed(h1lo >>> 0, h1hi >>> 0, this.#seed);
+		const mlo = RLO;
+		const mhi = RHI;
+		positionsInto(mlo, mhi, this.#seg, this.#segMask, this.#segCountLen, this.#pos);
+		const mask = fpMask(this.#fp);
+		const p0 = this.#pos[0] ?? 0;
+		const p1 = this.#pos[1] ?? 0;
+		const p2 = this.#pos[2] ?? 0;
+		return ((mlo ^ mhi) & mask) === (((this.#fp[p0] ?? 0) ^ (this.#fp[p1] ?? 0) ^ (this.#fp[p2] ?? 0)) & mask);
+	}
+};
+var BinaryFuse8 = class BinaryFuse8 extends BinaryFuse {
+	static from(keys) {
+		return new BinaryFuse8(buildState(keys, (n) => new Uint8Array(n)));
+	}
+	static fromBytes(bytes) {
+		return new BinaryFuse8(fuseStateFromBytes(bytes, TYPE_FUSE8));
+	}
+};
+var BinaryFuse16 = class BinaryFuse16 extends BinaryFuse {
+	static from(keys) {
+		return new BinaryFuse16(buildState(keys, (n) => new Uint16Array(n)));
+	}
+	static fromBytes(bytes) {
+		return new BinaryFuse16(fuseStateFromBytes(bytes, TYPE_FUSE16));
+	}
+};
+//#endregion
+export { BinaryFuse16, BinaryFuse8, BinaryFuseBuildError };

package/dist/index.cjs

@@ -0,0 +1,5 @@
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+//#region src/index.ts
+const VERSION = "0.1.0";
+//#endregion
+exports.VERSION = VERSION;

package/dist/index.d.cts

@@ -0,0 +1,4 @@
+//#region src/index.d.ts
+declare const VERSION = "0.1.0";
+//#endregion
+export { VERSION };

package/dist/index.d.ts

@@ -0,0 +1,4 @@
+//#region src/index.d.ts
+declare const VERSION = "0.1.0";
+//#endregion
+export { VERSION };

package/dist/index.js

@@ -0,0 +1,4 @@
+//#region src/index.ts
+const VERSION = "0.1.0";
+//#endregion
+export { VERSION };

package/dist/serialize-C5rwVPvv.cjs

@@ -0,0 +1,312 @@
+//#region src/core/bytes.ts
+const encoder = new TextEncoder();
+function normalize(input) {
+	if (typeof input === "string") return encoder.encode(input);
+	if (input instanceof Uint8Array) return input;
+	return new Uint8Array(input);
+}
+//#endregion
+//#region src/core/hasher.ts
+const C1LO = 289559509;
+const C1HI = 2277735313;
+const C2LO = 658871167;
+const C2HI = 1291169091;
+let RLO = 0;
+let RHI = 0;
+function mul64(alo, ahi, blo, bhi) {
+	const a0 = alo & 65535;
+	const a1 = alo >>> 16;
+	const a2 = ahi & 65535;
+	const a3 = ahi >>> 16;
+	const b0 = blo & 65535;
+	const b1 = blo >>> 16;
+	const b2 = bhi & 65535;
+	const b3 = bhi >>> 16;
+	let c0 = a0 * b0;
+	let c1 = c0 >>> 16;
+	c0 &= 65535;
+	c1 += a1 * b0;
+	let c2 = c1 >>> 16;
+	c1 &= 65535;
+	c1 += a0 * b1;
+	c2 += c1 >>> 16;
+	c1 &= 65535;
+	c2 += a2 * b0;
+	let c3 = c2 >>> 16;
+	c2 &= 65535;
+	c2 += a1 * b1;
+	c3 += c2 >>> 16;
+	c2 &= 65535;
+	c2 += a0 * b2;
+	c3 += c2 >>> 16;
+	c2 &= 65535;
+	c3 += a3 * b0 + a2 * b1 + a1 * b2 + a0 * b3;
+	c3 &= 65535;
+	RLO = (c1 << 16 | c0) >>> 0;
+	RHI = (c3 << 16 | c2) >>> 0;
+}
+function rotl64(lo, hi, r) {
+	if (r < 32) {
+		RLO = (lo << r | hi >>> 32 - r) >>> 0;
+		RHI = (hi << r | lo >>> 32 - r) >>> 0;
+	} else {
+		const s = r - 32;
+		RLO = (hi << s | lo >>> 32 - s) >>> 0;
+		RHI = (lo << s | hi >>> 32 - s) >>> 0;
+	}
+}
+function add64(alo, ahi, blo, bhi) {
+	const lo = (alo >>> 0) + (blo >>> 0);
+	RHI = ahi + bhi + (lo > 4294967295 ? 1 : 0) >>> 0;
+	RLO = lo >>> 0;
+}
+function fmix64(lo, hi) {
+	let l = lo;
+	let h = hi;
+	l = (l ^ h >>> 1) >>> 0;
+	mul64(l, h, 3981806797, 4283543511);
+	l = RLO;
+	h = RHI;
+	l = (l ^ h >>> 1) >>> 0;
+	mul64(l, h, 444984403, 3301882366);
+	l = RLO;
+	h = RHI;
+	l = (l ^ h >>> 1) >>> 0;
+	RLO = l;
+	RHI = h;
+}
+function hash128(bytes, seed = 0) {
+	const len = bytes.length;
+	const nblocks = len >>> 4;
+	let h1lo = seed >>> 0;
+	let h1hi = 0;
+	let h2lo = seed >>> 0;
+	let h2hi = 0;
+	for (let i = 0; i < nblocks; i++) {
+		const b = i * 16;
+		let k1lo = ((bytes[b] ?? 0) | (bytes[b + 1] ?? 0) << 8 | (bytes[b + 2] ?? 0) << 16 | (bytes[b + 3] ?? 0) << 24) >>> 0;
+		let k1hi = ((bytes[b + 4] ?? 0) | (bytes[b + 5] ?? 0) << 8 | (bytes[b + 6] ?? 0) << 16 | (bytes[b + 7] ?? 0) << 24) >>> 0;
+		let k2lo = ((bytes[b + 8] ?? 0) | (bytes[b + 9] ?? 0) << 8 | (bytes[b + 10] ?? 0) << 16 | (bytes[b + 11] ?? 0) << 24) >>> 0;
+		let k2hi = ((bytes[b + 12] ?? 0) | (bytes[b + 13] ?? 0) << 8 | (bytes[b + 14] ?? 0) << 16 | (bytes[b + 15] ?? 0) << 24) >>> 0;
+		mul64(k1lo, k1hi, C1LO, C1HI);
+		rotl64(RLO, RHI, 31);
+		mul64(RLO, RHI, C2LO, C2HI);
+		k1lo = RLO;
+		k1hi = RHI;
+		h1lo ^= k1lo;
+		h1hi ^= k1hi;
+		rotl64(h1lo, h1hi, 27);
+		add64(RLO, RHI, h2lo, h2hi);
+		mul64(RLO, RHI, 5, 0);
+		add64(RLO, RHI, 1390208809, 0);
+		h1lo = RLO;
+		h1hi = RHI;
+		mul64(k2lo, k2hi, C2LO, C2HI);
+		rotl64(RLO, RHI, 33);
+		mul64(RLO, RHI, C1LO, C1HI);
+		k2lo = RLO;
+		k2hi = RHI;
+		h2lo ^= k2lo;
+		h2hi ^= k2hi;
+		rotl64(h2lo, h2hi, 31);
+		add64(RLO, RHI, h1lo, h1hi);
+		mul64(RLO, RHI, 5, 0);
+		add64(RLO, RHI, 944331445, 0);
+		h2lo = RLO;
+		h2hi = RHI;
+	}
+	let k1lo = 0;
+	let k1hi = 0;
+	let k2lo = 0;
+	let k2hi = 0;
+	const tail = nblocks * 16;
+	const rem = len & 15;
+	if (rem >= 15) k2hi ^= (bytes[tail + 14] ?? 0) << 16;
+	if (rem >= 14) k2hi ^= (bytes[tail + 13] ?? 0) << 8;
+	if (rem >= 13) k2hi ^= bytes[tail + 12] ?? 0;
+	if (rem >= 12) k2lo ^= (bytes[tail + 11] ?? 0) << 24;
+	if (rem >= 11) k2lo ^= (bytes[tail + 10] ?? 0) << 16;
+	if (rem >= 10) k2lo ^= (bytes[tail + 9] ?? 0) << 8;
+	if (rem >= 9) {
+		k2lo ^= bytes[tail + 8] ?? 0;
+		k2lo >>>= 0;
+		k2hi >>>= 0;
+		mul64(k2lo, k2hi, C2LO, C2HI);
+		rotl64(RLO, RHI, 33);
+		mul64(RLO, RHI, C1LO, C1HI);
+		h2lo ^= RLO;
+		h2hi ^= RHI;
+	}
+	if (rem >= 8) k1hi ^= (bytes[tail + 7] ?? 0) << 24;
+	if (rem >= 7) k1hi ^= (bytes[tail + 6] ?? 0) << 16;
+	if (rem >= 6) k1hi ^= (bytes[tail + 5] ?? 0) << 8;
+	if (rem >= 5) k1hi ^= bytes[tail + 4] ?? 0;
+	if (rem >= 4) k1lo ^= (bytes[tail + 3] ?? 0) << 24;
+	if (rem >= 3) k1lo ^= (bytes[tail + 2] ?? 0) << 16;
+	if (rem >= 2) k1lo ^= (bytes[tail + 1] ?? 0) << 8;
+	if (rem >= 1) {
+		k1lo ^= bytes[tail] ?? 0;
+		k1lo >>>= 0;
+		k1hi >>>= 0;
+		mul64(k1lo, k1hi, C1LO, C1HI);
+		rotl64(RLO, RHI, 31);
+		mul64(RLO, RHI, C2LO, C2HI);
+		h1lo ^= RLO;
+		h1hi ^= RHI;
+	}
+	h1lo = (h1lo ^ len) >>> 0;
+	h2lo = (h2lo ^ len) >>> 0;
+	add64(h1lo, h1hi, h2lo, h2hi);
+	h1lo = RLO;
+	h1hi = RHI;
+	add64(h2lo, h2hi, h1lo, h1hi);
+	h2lo = RLO;
+	h2hi = RHI;
+	fmix64(h1lo, h1hi);
+	h1lo = RLO;
+	h1hi = RHI;
+	fmix64(h2lo, h2hi);
+	h2lo = RLO;
+	h2hi = RHI;
+	add64(h1lo, h1hi, h2lo, h2hi);
+	h1lo = RLO;
+	h1hi = RHI;
+	add64(h2lo, h2hi, h1lo, h1hi);
+	h2lo = RLO;
+	h2hi = RHI;
+	return {
+		h1lo: h1lo >>> 0,
+		h1hi: h1hi >>> 0,
+		h2lo: h2lo >>> 0,
+		h2hi: h2hi >>> 0
+	};
+}
+function reduce(x, range) {
+	const xlo = x & 65535;
+	const xhi = x >>> 16;
+	const rlo = range & 65535;
+	const rhi = range >>> 16;
+	const lolo = xlo * rlo;
+	const lohi = xlo * rhi;
+	const hilo = xhi * rlo;
+	const hihi = xhi * rhi;
+	const carry = (lolo >>> 16) + (lohi & 65535) + (hilo & 65535);
+	return hihi + (lohi >>> 16) + (hilo >>> 16) + (carry >>> 16) >>> 0;
+}
+/**
+* Derive `count` bucket indices in `[0, range)` from a key using
+* Kirsch-Mitzenmacher enhanced double hashing `g_i = h1 + i*h2 + i^2`
+* (the RocksDB `+i^2` fix), reduced into range with Lemire multiply-shift.
+*/
+function probeInto(key, count, range, seed, out) {
+	const { h1lo, h1hi, h2lo, h2hi } = hash128(normalize(key), seed);
+	const a = (h1lo ^ h1hi) >>> 0;
+	const b = (h2lo ^ h2hi) >>> 0;
+	for (let i = 0; i < count; i++) out[i] = reduce(a + Math.imul(i, b) + i * i >>> 0, range);
+}
+//#endregion
+//#region src/core/crc32.ts
+let table;
+function buildTable() {
+	const t = /* @__PURE__ */ new Uint32Array(256);
+	for (let n = 0; n < 256; n++) {
+		let c = n;
+		for (let k = 0; k < 8; k++) c = c & 1 ? 3988292384 ^ c >>> 1 : c >>> 1;
+		t[n] = c >>> 0;
+	}
+	return t;
+}
+function crc32(bytes) {
+	table ??= buildTable();
+	let crc = 4294967295;
+	for (const byte of bytes) crc = (table[(crc ^ byte) & 255] ?? 0) ^ crc >>> 8;
+	return (crc ^ 4294967295) >>> 0;
+}
+const HEADER_SIZE = 8;
+const TRAILER_SIZE = 4;
+function writeHeader(header, body) {
+	const frame = new Uint8Array(HEADER_SIZE + body.length + TRAILER_SIZE);
+	frame[0] = 65;
+	frame[1] = 77;
+	frame[2] = 81;
+	frame[3] = 70;
+	frame[4] = header.version;
+	frame[5] = header.type;
+	frame[6] = header.flags;
+	frame[7] = 0;
+	frame.set(body, HEADER_SIZE);
+	const crc = crc32(frame.subarray(0, HEADER_SIZE + body.length));
+	new DataView(frame.buffer, frame.byteOffset, frame.byteLength).setUint32(HEADER_SIZE + body.length, crc, true);
+	return frame;
+}
+var SerializationError = class extends Error {
+	name = "SerializationError";
+};
+var TruncatedError = class extends SerializationError {
+	name = "TruncatedError";
+};
+var BadMagicError = class extends SerializationError {
+	name = "BadMagicError";
+};
+var UnknownVersionError = class extends SerializationError {
+	name = "UnknownVersionError";
+};
+var ChecksumError = class extends SerializationError {
+	name = "ChecksumError";
+};
+function readHeader(frame) {
+	if (frame.length < 12) throw new TruncatedError(`frame of ${String(frame.length)} bytes is shorter than the minimum ${String(12)}`);
+	if (frame[0] !== 65 || frame[1] !== 77 || frame[2] !== 81 || frame[3] !== 70) throw new BadMagicError("frame does not start with the AMQF magic");
+	const version = frame[4] ?? 0;
+	if (version !== 1) throw new UnknownVersionError(`unsupported format version ${String(version)}`);
+	if (new DataView(frame.buffer, frame.byteOffset, frame.byteLength).getUint32(frame.length - TRAILER_SIZE, true) !== crc32(frame.subarray(0, frame.length - TRAILER_SIZE))) throw new ChecksumError("frame CRC32 does not match its contents");
+	return {
+		version,
+		type: frame[5] ?? 0,
+		flags: frame[6] ?? 0,
+		body: frame.subarray(HEADER_SIZE, frame.length - TRAILER_SIZE)
+	};
+}
+//#endregion
+Object.defineProperty(exports, "SerializationError", {
+	enumerable: true,
+	get: function() {
+		return SerializationError;
+	}
+});
+Object.defineProperty(exports, "hash128", {
+	enumerable: true,
+	get: function() {
+		return hash128;
+	}
+});
+Object.defineProperty(exports, "normalize", {
+	enumerable: true,
+	get: function() {
+		return normalize;
+	}
+});
+Object.defineProperty(exports, "probeInto", {
+	enumerable: true,
+	get: function() {
+		return probeInto;
+	}
+});
+Object.defineProperty(exports, "readHeader", {
+	enumerable: true,
+	get: function() {
+		return readHeader;
+	}
+});
+Object.defineProperty(exports, "reduce", {
+	enumerable: true,
+	get: function() {
+		return reduce;
+	}
+});
+Object.defineProperty(exports, "writeHeader", {
+	enumerable: true,
+	get: function() {
+		return writeHeader;
+	}
+});